WP44: landmark selection v2 results
Co-Authored-By: Claude Fable 5.1 <noreply@anthropic.com>
29 changed files +3,389 −2,822
added
literature_synthesis/agent_E/claims.csv
+46 −0
@@ -0,0 +1,46 @@ | |||||
| 1 | +claim_id,claim,claim_type,evidence_type,supporting_keys,contradicting_keys,corpus_artifact,confidence,verification_status,notes | ||||
| 2 | +E-01,"The automatic AI/ML landmark selection returned 234 candidates (33 LLM, 26 AI safety, 25 in each other category), 72 dated 2026, 136 typed article, 28 preprint, 19 book-chapter, 11 dissertation.",established,corpus_statistic,,,"literature_synthesis/landmarks/ai_ml_landmarks.csv (columns primary_category, year, type); selection_report.json by_area.ai_ml",0.99,machine-verified,Counts recomputed by make_contributions.py. | ||||
| 3 | +E-02,"44 of the 234 AI/ML landmark records (18.8 %) are unreliable: 13 identifier mismatches, 3 abstract mismatches, 11 implausible years, 7 normalisation artefacts, 10 off-scope classifications.",established,metadata_only,,,literature_synthesis/agent_E/contributions.csv (column data_quality_flag); manuscript/tables/tab_ai_landmark_flags.tex,0.9,human-verified,"Judged record by record by Agent E from identifiers, citation counts, venue, title and abstract; needs Agent N audit of the Phase 1 linkage." | ||||
| 4 | +E-03,Identifier and abstract mismatches concentrate in the LLM category (8 of 33) and misdated classics in ML theory and DL architectures (4 each).,established,metadata_only,,,literature_synthesis/agent_E/contributions.csv; tab_ai_landmark_flags,0.9,human-verified, | ||||
| 5 | +E-04,The NCS36 ranking should be re-run with document-type-specific reference sets and the 2026 cohort excluded; the clean AI landmark count is at most 190.,speculative,corpus_statistic,,,literature_synthesis/agent_E/contributions.csv,0.6,unverified,Remedy proposed to the director; not implemented. | ||||
| 6 | +E-05,"Of the 234 landmark candidates, 84 are surveys, 67 methods, 33 empirical, 29 theory/position, 17 engineering and 4 benchmarks (judged from abstract for 190, metadata for 44).",established,abstract,,,literature_synthesis/agent_E/contributions.csv (contribution_type); tab_ai_contribution_types,0.85,human-verified,Contribution typing is a judgement; abstracts only. | ||||
| 7 | +E-06,The citation-ranked top of the LLM and generative-AI categories is dominated by education and commentary papers on ChatGPT rather than by the technical papers introducing the models.,established,metadata_only,kasneci2023chatgptgood;lo2023rapidreview;rudolph2023assessment;chan2023students;baidooanu2023chatgptedu;dwivedi2023sowhat;vandis2023priorities;lim2023ragnarok,,literature_synthesis/landmarks/ai_ml_landmarks.csv (rows with primary_category llm or generative_ai),0.9,human-verified,Property of field-normalised ranking inside a multi-label category spanning education venues. | ||||
| 8 | +E-07,Post-period CAGR (2023–2025) versus baseline (2018–2022): LLM 1.085 vs 0.189; generative AI 0.870 vs 0.296; multimodal 0.869 vs 0.284; foundation models 0.802 vs 0.661; AI safety 0.647 vs 0.294; RL 0.252 vs 0.208; ML theory 0.197 vs 0.104; DL architectures 0.155 vs 0.167; AI agents 0.329 vs −0.045.,established,corpus_statistic,,,"results/bibliometrics/cagr_by_category.csv (cagr_baseline, cagr_post); tab_ai_growth",0.95,machine-verified,File regenerated by Phase 4 on 2026-11-03 evening; values as of the table build. | ||||
| 9 | +E-08,The LLM category's share of eligible works rose from 0.33 % in 2018 to 5.06 % in 2025.,established,corpus_statistic,,,"results/bibliometrics/cagr_by_category.csv (share_2018, share_2025); tab_ai_growth",0.95,machine-verified, | ||||
| 10 | +E-09,For the LLM series the ITS at 2022-12 gives a level change of 0.106 (HAC p 0.075) and a slope change of 0.034 per month (p ~1e-60); placebo p 0.938 (level) and 0.200 (slope); Bai–Perron selects one break at 2022-07; PELT one change point at 2023-10.,established,corpus_statistic,,,results/econometrics/breaks.csv row cat_llm; its_results.json series.cat_llm; macros ItsSeriesCatLlm*; tab_ai_breaks,0.95,machine-verified, | ||||
| 11 | +E-10,"Multimodal, generative AI, agents, RL, ML theory and AI safety show significant positive slope changes at 2022-12 with no positive level jump (agents, RL and AI safety have negative level changes); DL architectures shows no significant slope change (−0.002, p 0.136).",established,corpus_statistic,,,results/econometrics/breaks.csv rows cat_*; tab_ai_breaks,0.95,machine-verified, | ||||
| 12 | +E-11,"Level effects at the GPT-3 (2020-06) and DALL-E 2 (2022-05) event dates are negative for all nine AI categories, while those at GPT-4 (2023-04) and o1 (2024-09) are positive and significant for LLM, multimodal and generative AI.",established,corpus_statistic,,,"results/econometrics/breaks.csv (gpt3_level, dalle2_level, gpt4_level, o1_level and p columns); tab_ai_altdates",0.9,machine-verified,Each alternative date is a separate ITS fit. | ||||
| 13 | +E-12,The post-2022 acceleration of AI publication is a trend change already under way in mid-2022 that steepened in 2023–2024; the monthly series cannot attribute it to a single product release.,established,corpus_statistic,,,"results/econometrics/breaks.csv; its_results.json (placebo, bai_perron, pelt)",0.85,machine-verified,Interpretive statement about the estimates; no causal claim. | ||||
| 14 | +E-13,"LLM works directed 69.6 % of in-corpus references to NLP in 2019 and 68.6 % in 2022, but 34.2 % in 2025, when 28.4 % went to the LLM category itself, 4.3 % to HCI and 3.4 % to software engineering.",established,corpus_statistic,,,results/graph/category_flows_yearly.csv (citing_cat llm); tab_ai_flows,0.95,machine-verified, | ||||
| 15 | +E-14,Generative-AI references to computer vision fell from 57.9 % (2022) to 33.8 % (2025) while references to LLM rose to 13.7 % and to HCI to 6.6 %; AI-safety references to LLM rose from 0.1 % (2019) to 10.0 % (2025) and to HCI from 9.1 % to 11.5 %.,established,corpus_statistic,,,results/graph/category_flows_yearly.csv; tab_ai_flows,0.95,machine-verified, | ||||
| 16 | +E-15,Reinforcement-learning references to robotics rose from 14.4 % (2019) to 23.1 % (2025) while references to LLM stayed below 1 %; ML theory and DL architectures flows are essentially unchanged.,established,corpus_statistic,,,results/graph/category_flows_yearly.csv; tab_ai_flows,0.95,machine-verified, | ||||
| 17 | +E-16,"The LLM category has become a citation hub for generative AI, safety and agents while remaining peripheral to RL, theory and architectures; this is consistent with but does not establish the foundation-model convergence thesis.",contested,corpus_statistic,bommasani2021foundation,,results/graph/category_flows_yearly.csv; tab_ai_flows,0.7,machine-verified,Category-level flows only; RQ5 answered at category granularity. | ||||
| 18 | +E-17,"Known-set lead times: large language models 34 months, reasoning models 29, RAG 12, vision-language models 9, diffusion models 9, LLM agents 6, state-space models 6, MoE 5, speculative decoding 5, AI code generation 10, mechanistic interpretability −18; median 7.",established,corpus_statistic,,,results/emerging/known_set_lead_times.csv (lead_months); macros Known*LeadMonths and KnownSetMedianLeadMonths,0.95,machine-verified,Long LLM lead reflects pre-2020 'language model' matches by the regex. | ||||
| 19 | +E-18,The LLaMA abstract reports that a 13B model trained only on publicly available data outperforms GPT-3 (175B) on most benchmarks; the paper is a preprint.,established,abstract,touvron2023llama;brown2020gpt3;hoffmann2022chinchilla;kaplan2020scaling,,ai_ml_abstracts.jsonl work 4322718191,0.9,machine-verified,Claim is the abstract's; not independently replicated here. | ||||
| 20 | +E-19,"Domain-specific foundation models (pathology UNI/CONCH/CHIEF/PLIP/TITAN, radiology RadFM, dermatology PanDerm, brain MRI BrainIAC, Earth system Aurora, tabular TabPFN, time series, cognition Centaur) are the most visible post-2022 development in the landmark set; their abstracts report outperforming task-specific baselines on multi-task benchmarks.",established,abstract,chen2024uni;lu2024conch;wang2024chief;huang2023plip;ding2025titan;wu2025radfm;yan2025panderm;tak2026brainiac;bodnar2025aurora;hollmann2025tabpfn;jin2023timellm;liu2024timesurl;binz2025centaur,,ai_ml_landmarks.csv rows with primary_category foundation_models / multimodal_ai,0.85,machine-verified,"Abstract-level claims by the authors; several records (UNI, CONCH, CHIEF, PLIP) have no abstract in the file." | ||||
| 21 | +E-20,"Parameter-efficient adaptation (LoRA, QLoRA, LLaMA-Adapter, PEFT surveys) is where the open-weight ecosystem's practical growth concentrated; QLoRA's '99.3 % of ChatGPT' is a judge-based measurement.",established,abstract,hu2021lora;dettmers2023qlora;zhang2023llamaadapter;han2024peftsurvey,,ai_ml_abstracts.jsonl works 7133233472 and 4361229539,0.8,machine-verified, | ||||
| 22 | +E-21,"Whether LLM capabilities are 'emergent' (discontinuous in scale) is contested: Wei et al. report discontinuities, Schaeffer et al. show they largely disappear under continuous metrics; both are preprints.",contested,metadata_only,wei2022emergent,schaeffer2023mirage,,0.9,machine-verified,Known disagreement; not adjudicable from the corpus. | ||||
| 23 | +E-22,"'Sparks of AGI' is a widely cited (c36 = 1,420 in the landmark file) but non-peer-reviewed, unreplicated position paper based on qualitative experiments on an early GPT-4.",established,abstract,bubeck2023sparks,bender2021parrots,ai_ml_landmarks.csv work 4360836968,0.9,machine-verified, | ||||
| 24 | +E-23,The DeepSeek-R1 Nature paper reports that reasoning can be incentivised through pure reinforcement learning without human-labelled reasoning trajectories; generality beyond verifiable domains is untested in the corpus.,established,abstract,deepseek2025r1nature;deepseek2025r1;openai2024o1,,ai_ml_abstracts.jsonl work 4414281281,0.85,machine-verified,Peer-reviewed version cited; the preprint is also in references.bib. | ||||
| 25 | +E-24,"Domain foundation models displacing task-specific pipelines in regulated domains is speculative; reviews list data, privacy and evaluation obstacles unresolved in the landmark abstracts.",speculative,abstract,paschali2025fmradiology;zhang2026datacentric,,ai_ml_abstracts.jsonl works 4407135816 and 4390690043,0.6,machine-verified, | ||||
| 26 | +E-25,RLHF and DPO are established post-training methods whose open problems are documented by Casper et al.,established,metadata_only,christiano2017rlhf;ouyang2022instructgpt;bai2022hh;bai2022constitutional;rafailov2023dpo;casper2023rlhfproblems,,,0.9,machine-verified,DPO record 7133208539 has no abstract in the landmark file. | ||||
| 27 | +E-26,"Current alignment is brittle to optimisation pressure: universal adversarial suffixes, jailbreak analyses and PAIR (semantic jailbreaks with black-box access in about twenty queries, per the abstract).",established,abstract,zou2023universal;wei2023jailbroken;chao2025pair,,ai_ml_abstracts.jsonl work 4410609100,0.9,machine-verified,Two of three are preprints; PAIR is peer reviewed (IEEE SaTML 2025). | ||||
| 28 | +E-27,Hallucination remains an unsolved measurement problem; Med-PaLM built MultiMedQA and a human evaluation framework because automated metrics were insufficient for clinical answers.,established,abstract,ji2023hallucination;huang2025hallucination;singhal2023clinical,,ai_ml_abstracts.jsonl work 4384071683,0.85,machine-verified, | ||||
| 29 | +E-28,"Vision-language models of the window (Flamingo, BLIP-2, InstructBLIP, LLaVA, mPLUG-Owl2) share the design of a frozen or lightly adapted LLM fed by a visual encoder through a small bridge module.",established,abstract,radford2021clip;dosovitskiy2021vit;alayrac2022flamingo;li2023blip2;dai2023instructblip;liu2023llava;ye2024mplugowl2;kirillov2023sam;schuhmann2022laion5b,,ai_ml_abstracts.jsonl works 4318718936 and 4402727669,0.85,machine-verified,"BLIP-2, InstructBLIP, LLaVA are preprint records." | ||||
| 30 | +E-29,"Diffusion generation (DDPM, latent diffusion, Imagen, DALL-E 2, classifier-free guidance, textual inversion, T2I-Adapter, DiT, SD3) forms the generative lineage; MatterGen is a peer-reviewed scientific application reporting stable, diverse inorganic materials.",established,abstract,ho2020ddpm;rombach2022ldm;saharia2022imagen;ramesh2022dalle2;ho2022cfg;gal2022textualinversion;mou2024t2iadapter;peebles2023dit;esser2024sd3;zeni2025mattergen,,ai_ml_abstracts.jsonl works 4288099666 4289785095 4393148714 4406472463,0.85,machine-verified, | ||||
| 31 | +E-30,"In an evaluation of eight multimodal foundation models on 1,090 medical cases, image predictions were largely driven by text and mild textual suggestions of a wrong diagnosis degraded image classification.",established,abstract,buckley2026textexploit,,ai_ml_abstracts.jsonl work 7164501397,0.85,machine-verified,Single study; abstract-level. | ||||
| 32 | +E-31,"The generative-AI category's citation-ranked landmarks are overwhelmingly education, policy and adoption studies (Bastani et al. preprint: GPT-4 access harmed unassisted exam performance; Bick et al.: 45 % of US adults 18–64 using generative AI by late 2024).",established,abstract,chan2023policyframework;xia2024assessmentreview;bittle2025integrity;mcdonald2025hepolicies;bastani2024harmlearning;bick2026rapidadoption,,ai_ml_landmarks.csv rows with primary_category generative_ai,0.9,machine-verified,"Bastani et al. is an SSRN preprint without abstract in the file; the exam-performance statement comes from the title and the published abstract elsewhere, not from the corpus file, and should be checked by Agent K." | ||||
| 33 | +E-32,"Agent benchmarks (SWE-bench, WebArena, AgentBench) are preprints; the only peer-reviewed agent benchmark in the landmark set is the clinical evaluation of OpenManus and Manus.",established,abstract,jimenez2024swebench;zhou2023webarena;liu2023agentbench;liu2026clinicalagents,,ai_ml_abstracts.jsonl work 7130481397,0.85,machine-verified, | ||||
| 34 | +E-33,"Science agents are the strongest peer-reviewed agent evidence: Virtual Lab (nanobodies with experimental validation), Robin (hypothesis generation and data analysis), DIVE (figure data extraction), AgentSociety (social simulation).",established,abstract,swanson2025virtuallab;ghareeb2026robin;zhang2026dive;piao2026agentsociety,lu2024aiscientist;si2024novelideas,ai_ml_abstracts.jsonl works 7161734976 4414991289 4407570917,0.8,machine-verified,Virtual Lab record has no abstract in the file (metadata only). | ||||
| 35 | +E-34,"The 'agentic AI' literature produced at least six taxonomies in 2025–2026, most of them reviews of reviews; the landmark set contains six of them and one benchmark.",established,abstract,acharya2025agenticsurvey;sapkota2026agentsvsagentic;bandi2025agenticreview;abouali2025agenticparadigms;allmendinger2026multiagentai;collaco2026agentichealthcare;cheng2026agentsdefinitions,,ai_ml_landmarks.csv rows with primary_category ai_agents,0.9,machine-verified, | ||||
| 36 | +E-35,"The ai_agents category mixes classical multi-agent systems and control theory with LLM agents, which explains its negative baseline CAGR, the negative 2022-12 level change and the second Bai–Perron break at 2024-07.",contested,corpus_statistic,,,contributions.csv off_scope rows; breaks.csv row cat_ai_agents; cagr_by_category.csv,0.7,machine-verified,Explanation is inferential. | ||||
| 37 | +E-36,"The deep-RL canon of the baseline period is intact in the landmark set; the single post-2022 method landmark is DreamerV3, whose abstract reports one configuration mastering over 150 tasks through world models.",established,abstract,hessel2018rainbow;haarnoja2018sac;fujimoto2018td3;silver2018alphazero;vinyals2019alphastar;yu2021mappo;henderson2018drlmatters;burda2018curiosity;hafner2025dreamerv3;zhang2021marloverview,,ai_ml_abstracts.jsonl work 4409147637,0.85,machine-verified, | ||||
| 38 | +E-37,RL's most consequential post-2022 role (reward modelling and policy optimisation for LLMs) is invisible in the RL category because those papers are classified as LLM work; a claim that RL declined would be a taxonomy artefact.,contested,corpus_statistic,schulman2017ppo;rafailov2023dpo;deepseek2025r1nature,,results/graph/category_flows_yearly.csv (reinforcement_learning -> llm < 1 %),0.7,machine-verified, | ||||
| 39 | +E-38,"The ML-theory landmark set contains no learning-theory result from the window; it consists of textbooks, evaluation metrics, interpretability, optimisation and transfer-learning surveys and misdated 2013–2019 bandit papers.",established,metadata_only,chicco2020mcc;rudin2019stopexplaining;lipton2018mythos;lundberg2020treeexplainer;bottou2018optimization;zhuang2021transfersurvey,,ai_ml_landmarks.csv rows with primary_category ml_theory; contributions.csv,0.9,human-verified, | ||||
| 40 | +E-39,Zeng et al. report that simple linear models outperform Transformer-based models (Informer and successors) on long-term time-series forecasting benchmarks; the finding is contested within the field.,contested,abstract,zeng2023transformerstsf,zhou2021informer;wen2023tstransformers,ai_ml_abstracts.jsonl work 4382203079,0.8,machine-verified, | ||||
| 41 | +E-40,"Architecture research moved to efficiency (FlashAttention, MoE, quantisation, speculative decoding, state-space models, KAN); the detector finds short leads for state-space models (6), MoE (5) and speculative decoding (5).",established,corpus_statistic,dao2022flashattention;fedus2022switch;dettmers2022int8;frantar2023gptq;leviathan2023speculative;gholami2022quantization;gu2023mamba;liu2024kan,,results/emerging/known_set_lead_times.csv,0.85,machine-verified,Mamba and KAN are preprints. | ||||
| 42 | +E-41,"The SuperGLUE abstract records in 2019 that GLUE performance surpassed non-expert humans, the first instance of the saturation cycle that repeats for later benchmarks; the landmark set contains four benchmark contributions in 234.",established,abstract,wang2019superglue;wang2018glue;hendrycks2021mmlu;srivastava2022bigbench;liang2022helm;sainz2023contamination;dehghani2021lottery,,ai_ml_abstracts.jsonl work 2990704537; contributions.csv,0.85,machine-verified, | ||||
| 43 | +E-42,"Risk taxonomies matured from the concrete-problems agenda to the AI Risk Repository (1,725 risks from 74 taxonomies per the abstract) and the International AI Safety Report.",established,abstract,amodei2016concrete;hendrycks2021unsolved;slattery2026riskrepository;bengio2025safetyreport;bengio2024extremerisks,,ai_ml_abstracts.jsonl work 4402698709,0.9,machine-verified, | ||||
| 44 | +E-43,Peer-reviewed empirical harms: medical LLMs vulnerable to data poisoning at 0.001 % of tokens; four chatbots gave unsafe answers in physician-led red-teaming; LLMs express stigma as replacement therapists.,established,abstract,alber2025poisoning;draelos2026unsafeanswers;moore2025stigma,,ai_ml_abstracts.jsonl works 4406152291 7128782475 4411542009,0.85,machine-verified, | ||||
| 45 | +E-44,Inference energy of general-purpose generative models exceeds that of task-specific models by orders of magnitude.,established,abstract,luccioni2024powerhungry;devries2023energy,,ai_ml_abstracts.jsonl work 4399450035,0.8,machine-verified,Magnitude statement is the authors'. | ||||
| 46 | +E-45,"Labour and adoption evidence rests on a preregistered field experiment (758 consultants), a task-exposure study and nationally representative adoption surveys.",established,abstract,dellacqua2023jagged;eloundou2024gpts;bick2026rapidadoption,,ai_ml_abstracts.jsonl works 7135096569 7124974472,0.85,machine-verified,'GPTs are GPTs' landmark record 4330336443 has a mismatched abstract; cite the verified Science article. | ||||
modified
literature_synthesis/agent_E/make_bib_part05.py
+2 −2
@@ -3,7 +3,7 @@ | |||||
| 3 | Each entry is resolved by a single Crossref (DOI) or arXiv (id) lookup; the identifier comes from the ai_ml landmark CSV | 3 | Each entry is resolved by a single Crossref (DOI) or arXiv (id) lookup; the identifier comes from the ai_ml landmark CSV | ||
| 4 | (column doi / arxiv_id) or from an explicit override when the corpus record has none. Nothing is written without a | 4 | (column doi / arxiv_id) or from an explicit override when the corpus record has none. Nothing is written without a | ||
| 5 | successful lookup. Usage: python3 make_bib_part05.py <repo_root>""" | 5 | successful lookup. Usage: python3 make_bib_part05.py <repo_root>""" | ||
| 6 | −import csv, json, sys, re, time, unicodedata, urllib.request, xml.etree.ElementTree as ET | 6 | +import csv, json, sys, re, time, html, unicodedata, urllib.request, xml.etree.ElementTree as ET | ||
| 7 | R = sys.argv[1] | 7 | R = sys.argv[1] | ||
| 8 | L = {r["work_id"]: r for r in csv.DictReader(open(f"{R}/literature_synthesis/landmarks/ai_ml_landmarks.csv"))} | 8 | L = {r["work_id"]: r for r in csv.DictReader(open(f"{R}/literature_synthesis/landmarks/ai_ml_landmarks.csv"))} | ||
| 9 | MAIL = "spbou4@icloud.com" | 9 | MAIL = "spbou4@icloud.com" | ||
@@ -43,7 +43,7 @@ def get(url): | |||||
| 43 | req = urllib.request.Request(url, headers={"User-Agent": f"WP44-agentE (mailto:{MAIL})"}) | 43 | req = urllib.request.Request(url, headers={"User-Agent": f"WP44-agentE (mailto:{MAIL})"}) | ||
| 44 | return urllib.request.urlopen(req, timeout=40).read() | 44 | return urllib.request.urlopen(req, timeout=40).read() | ||
| 45 | def clean(s): | 45 | def clean(s): | ||
| 46 | − s = unicodedata.normalize("NFKC", s) | 46 | + s = unicodedata.normalize("NFKC", html.unescape(s)) | ||
| 47 | s = s.replace("‐", "-").replace("‑", "-").replace("‒", "-").replace("–", "--").replace("—", "---").replace("‘", "'").replace("’", "'").replace("“", "``").replace("”", "''").replace(" ", " ").replace("−", "-") | 47 | s = s.replace("‐", "-").replace("‑", "-").replace("‒", "-").replace("–", "--").replace("—", "---").replace("‘", "'").replace("’", "'").replace("“", "``").replace("”", "''").replace(" ", " ").replace("−", "-") | ||
| 48 | s = "".join(c if ord(c) < 0x250 else unicodedata.normalize("NFKD", c)[0] if unicodedata.normalize("NFKD", c)[0].isascii() else "" for c in s) | 48 | s = "".join(c if ord(c) < 0x250 else unicodedata.normalize("NFKD", c)[0] if unicodedata.normalize("NFKD", c)[0].isascii() else "" for c in s) | ||
| 49 | s = s.replace("&", "\\&").replace("%", "\\%").replace("#", "\\#").replace("$", "\\$") | 49 | s = s.replace("&", "\\&").replace("%", "\\%").replace("#", "\\#").replace("$", "\\$") | ||
added
literature_synthesis/agent_E/open_problems.csv
+15 −0
@@ -0,0 +1,15 @@ | |||||
| 1 | +problem_id,statement,categories,why_unresolved,testable_direction,supporting_keys | ||||
| 2 | +P-01,Whether LLM capabilities are discontinuous in scale (emergent) or artefacts of discontinuous metrics.,llm;ml_theory,Both positions are preprints with different metric choices; no corpus-level or peer-reviewed adjudication.,Re-evaluate the same model families under continuous and discontinuous metrics with pre-registered thresholds and report both.,wei2022emergent;schaeffer2023mirage | ||||
| 3 | +P-02,Whether pure-RL reasoning training (R1-style) generalises beyond verifiable-reward domains (mathematics and code).,llm;reinforcement_learning,The peer-reviewed evidence covers verifiable tasks; open-ended domains lack ground-truth rewards.,Out-of-domain evaluation of RL-only versus SFT+RL models on tasks without programmatic verifiers with held-out judges.,deepseek2025r1nature;openai2024o1 | ||||
| 4 | +P-03,Whether alignment brittleness to jailbreaks is intrinsic to RLHF-style methods or an artefact of scale and data.,ai_safety;llm,Attacks succeed in few queries across model families; no defence has withstood adaptive attackers in the landmark abstracts.,"Adaptive red-teaming with fixed attacker budgets across alignment methods (RLHF, DPO, constitutional) at matched scale.",zou2023universal;wei2023jailbroken;chao2025pair;casper2023rlhfproblems | ||||
| 5 | +P-04,How to measure hallucination in open-ended generation without reference answers.,llm;multimodal_ai,Surveys agree on definitions but not metrics; human evaluation frameworks are domain-specific.,Cross-domain benchmark with expert-labelled factuality and calibrated automated judges validated against it.,ji2023hallucination;huang2025hallucination;singhal2023clinical | ||||
| 6 | +P-05,Whether vision-language models fuse modalities or condition on the text channel.,multimodal_ai;foundation_models,A controlled medical evaluation found image predictions driven by text; general-domain evidence is benchmark-level only.,Counterfactual perturbation of each modality on held-out tasks measuring the marginal information used from images.,buckley2026textexploit;schouten2025multimodalmedicine;zhang2026lowqualityfusion | ||||
| 7 | +P-06,Whether 'agentic AI' denotes a distinct system class or a relabelling of tool-augmented LLM pipelines.,ai_agents,Six taxonomies in 2025–2026 and one peer-reviewed benchmark; definitions diverge.,Operational criteria (autonomy horizon; environment interaction; self-evaluation) applied to published systems with inter-rater agreement.,sapkota2026agentsvsagentic;acharya2025agenticsurvey;abouali2025agenticparadigms;wang2024agentsurvey | ||||
| 8 | +P-07,Whether autonomous science agents produce validated discoveries at a rate that justifies their cost.,ai_agents;autonomous_scientific_discovery,Peer-reviewed cases (Virtual Lab; Robin) are single demonstrations; AI-scientist preprints report no external validation.,Pre-registered multi-laboratory trials comparing agent-proposed and human-proposed hypotheses on validation rate and cost.,swanson2025virtuallab;ghareeb2026robin;lu2024aiscientist;si2024novelideas | ||||
| 9 | +P-08,Whether deep-learning architecture research plateaued after 2022 or was relabelled under LLM and foundation categories.,deep_learning_architectures;llm,DL architectures is the only AI category without a significant post-2022 slope change; multi-label counts cannot separate relabelling from decline.,Re-estimate the series on works whose only AI category is DL architectures and on a fixed 2022 classifier vocabulary.,gu2023mamba;liu2024kan;dao2022flashattention | ||||
| 10 | +P-09,How to evaluate models on benchmarks that may be in their training data.,llm;ml_theory,Contamination is documented; no landmark abstract reports a contamination-controlled evaluation.,Time-split benchmarks released after model training cut-offs with canary strings and reported overlap statistics.,sainz2023contamination;dehghani2021lottery;ott2022benchmarks;chiang2024arena | ||||
| 11 | +P-10,Whether catastrophic-risk capabilities can be measured before deployment.,ai_safety,Risk frameworks exist (repository; safety report); no landmark abstract reports a validated dangerous-capability measurement.,Pre-registered dangerous-capability evaluations with external replication and disclosure of false-negative rates.,slattery2026riskrepository;bengio2025safetyreport;shevlane2023extremerisks;hendrycks2023catastrophic | ||||
| 12 | +P-11,Whether domain foundation models generalise across institutions and acquisition protocols.,foundation_models;multimodal_ai,Pathology and radiology models report multi-benchmark gains but evaluation cohorts are often internal.,External multi-site validation with distribution-shift reporting and release of evaluation splits.,chen2024uni;lu2024conch;wu2025radfm;paschali2025fmradiology | ||||
| 13 | +P-12,Whether Transformers are the right inductive bias for long-horizon time series.,deep_learning_architectures;foundation_models,Linear baselines beat Transformer forecasters on standard benchmarks; LLM reprogramming claims gains on others.,"Common benchmark suite with leakage-free splits comparing linear, Transformer, state-space and LLM-reprogrammed models.",zeng2023transformerstsf;zhou2021informer;jin2023timellm;gu2023mamba | ||||
| 14 | +P-13,Whether generative-AI use harms or helps learning outcomes.,generative_ai,A preregistered field experiment reports harm to unassisted performance; surveys report perceived benefits.,Randomised trials with delayed unassisted assessments across subjects and tutoring designs.,bastani2024harmlearning;kasneci2023chatgptgood;zhai2024overreliance | ||||
| 15 | +P-14,Whether citation-based landmark identification can be made reliable for AI given identifier merging in bibliographic databases.,llm;deep_learning_architectures;ml_theory,"18.8 % of the automatically selected AI landmarks are mislinked, misdated or normalisation artefacts.","Re-run selection on records whose DOI, arXiv id and title are mutually consistent; document-type-specific normalisation; report the exclusion rate.",priem2022openalex;culbert2025openalexcoverage | ||||
added
literature_synthesis/agent_G/claims.csv
+25 −0
@@ -0,0 +1,25 @@ | |||||
| 1 | +claim_id,claim,claim_type,evidence_type,supporting_keys,contradicting_keys,corpus_artifact,confidence,verification_status,notes | ||||
| 2 | +G-01,"The automatically selected landmark candidates of the theory and software_pl areas (150 works) are dominated by non-research records: only 29 are in-scope research contributions, while 33 are misclassified, 27 are theses, 24 are re-deposited classics with a recent record date and 22 are textbooks or chapters.",established,metadata_only,,,literature_synthesis/agent_G/contributions.csv (column verdict); manuscript/tables/tab_theory_landmark_audit.tex,0.9,human-verified,"Verdicts assigned by Agent G from title/venue/type metadata and abstracts; the verdict scheme is documented in make_contributions.py. Human-verified here means verified by the specialist agent, not by the PI (checkpoint H-3 pending)." | ||||
| 3 | +G-02,"Seven candidate records carry OpenAlex identifiers that, resolved live on 2026-11-03, return a different and far more cited work (e.g. the record titled 'Exploiting Generative AI to Scale up Intelligent Tutoring Systems', DOI 10.4230/lipics.itp.2023.19, resolves to 'Attention Is All You Need'), and their c36 values match the other work's citation count.",established,metadata_only,,,literature_synthesis/agent_G/verification_lookups_raw.txt; literature_synthesis/agent_G/contributions.csv (column id_resolves_to_other_work),0.95,machine-verified,"Live OpenAlex lookups of W4385245566, W2964015378, W4293846201, W4311415873, W4294558607, W3177813494, W4297781990. Mechanism (identifier merge or reuse between snapshot and live database) is inferred, not observed." | ||||
| 4 | +G-03,"The computational_complexity category is the least precise of the six: 15 of its 25 candidates are works from psychology, management, education or metrology that carry the phrase 'complexity' or 'complexity theory'.",established,abstract,,,literature_synthesis/agent_G/contributions.csv (primary_category = computational_complexity),0.9,human-verified,Consistent with the lexical signals of taxonomy/ontology.yaml; per-category precision from the validation sample (taxonomy/validation) was not available to Agent G. | ||||
| 5 | +G-04,"Metaphor-based metaheuristic optimisers (arithmetic, aquila, lemming, snake, langur, starfish) account for six of the 25 algorithms candidates and for most of the post-2022 highly cited algorithm 'articles'; the genre is contested in the operational-research literature.",established,abstract,abualigah2021aoa;abualigah2021aquila;sorensen2013metaphor;aranha2021metaphor;camachovillalon2022exposing,,literature_synthesis/agent_G/contributions.csv (verdict = metaheuristic),0.85,human-verified,"The critique papers argue that many such algorithms re-describe existing methods; this review reports the critique, it does not re-evaluate the algorithms." | ||||
| 6 | +G-05,"Across the six categories the multi-label count grew faster in 2023-2025 than in 2018-2022 (e.g. software engineering 25.5% vs 0.9% CAGR, computational complexity 22.7% vs 1.9%), but the corpus-wide multi-label CAGR also rose from 6.1% to 26.0%, so the category-level acceleration is largely the corpus-wide acceleration.",established,corpus_statistic,,,results/graph/category_counts_yearly.csv via macros \ThyCagrMultilabel*; tab_theory_summary,0.85,machine-verified,Post-period CAGR covers two years (2023 to 2025) and is sensitive to indexing lag (Section sec:m-truncation). | ||||
| 7 | +G-06,"Measured by primary-label share, all six categories lost ground between 2018 and 2025 (algorithms 5.83% to 3.79%, software engineering 5.81% to 4.07%, formal verification 1.06% to 0.52%, programming languages 0.88% to 0.47%).",established,corpus_statistic,,,results/graph/category_counts_yearly.csv via \ThySharePrimary*Pct,0.9,machine-verified,"Relative decline reflects faster growth elsewhere (AI categories), not absolute contraction." | ||||
| 8 | +G-07,"The results/bibliometrics/cagr_by_category.csv file reports counts for the six categories (e.g. algorithms n_2018 = 9,716) that are about three times smaller than the primary counts of results/graph/category_counts_yearly.csv (29,148) and therefore predates the current classification; its CAGR values should not be quoted for these categories until regenerated.",established,corpus_statistic,,,results/bibliometrics/cagr_by_category.csv vs results/graph/category_counts_yearly.csv (macros \ThyCagrfile* vs \ThyCount*),0.95,machine-verified,"bibliometrics/04_diversity_cagr.py reads category_counts_yearly.csv, so re-running it would resolve the discrepancy; flagged to the director." | ||||
| 9 | +G-08,"Interrupted-time-series slope changes at 2022-12 are positive and HAC-significant for all six categories (1.0% to 1.8% per month), but the placebo test rejects at the 5% level for none of them (placebo slope p from 0.062 to 0.431), so the post-2022 slope change is not distinguishable from pseudo-events in the baseline.",established,corpus_statistic,,,"results/econometrics/breaks.csv rows cat_algorithms, cat_computational_complexity, cat_programming_languages, cat_compilers, cat_formal_verification, cat_software_engineering (columns chatgpt_slope, chatgpt_slope_p, placebo_slope_p)",0.9,machine-verified,No causal reading. Algorithms and computational complexity are the closest to the 5% threshold (0.062). | ||||
| 10 | +G-09,"Software engineering is the only one of the six categories with a positive level change at 2022-12 (4.8%, p = 0.124) and a significant positive level change at the GPT-4 date (0.102, p = 0.003); the other five show negative or null level changes at 2022-12.",established,corpus_statistic,,,"results/econometrics/breaks.csv (chatgpt_level, gpt4_level, gpt4_level_p)",0.85,machine-verified,Level changes partly reflect seasonality and the dating of conference proceedings; the placebo level p for software engineering is 0.862. | ||||
| 11 | +G-10,"Co-classification with the LLM category rose between 2022 and 2025 in every theory/software category, most strongly in software engineering (4.0% to 21.2% of its works), programming languages (4.2% to 18.3%) and compilers (3.1% to 14.9%), and least in algorithms and computational complexity (1.3% to 5.3%).",established,corpus_statistic,,,"results/graph/category_cooccurrence_yearly.csv and category_counts_yearly.csv via \ThyCooc*LlmTwoZeroTwo{Two,Five}Pct; tab_theory_llm_cooccurrence",0.9,machine-verified,"Co-classification is a lexical/topic signal (Part IV), not evidence of method adoption." | ||||
| 12 | +G-11,"Reference flows from the six categories to the LLM category remain small in the post period (software engineering 2.5%, computational complexity 1.8%, compilers 1.2%, programming languages 0.7%, formal verification 0.4%, algorithms 0.3% of references), and within-category self-citation shares changed little (algorithms 65.1% to 65.0%, formal verification 49.9% to 47.0%).",established,corpus_statistic,,,results/graph/category_flows_yearly.csv aggregated by period via \ThyFlow*; \ThyInflow*,0.85,machine-verified,"Flows are computed on the categorised subset of references (Part VIII reference coverage); the LLM category is young, which depresses its share of cited works mechanically." | ||||
| 13 | +G-12,"Computational complexity shows the largest drop in self-citation share (30.0% to 20.6%) and the largest rise in references to HCI (3.0% to 6.7%), consistent with the category's contamination by social-science 'complexity' works rather than with a change in theoretical research.",contested,corpus_statistic,,,results/graph/category_flows_yearly.csv via \ThyFlowComputationalComplexityTo*; literature_synthesis/agent_G/contributions.csv,0.6,machine-verified,"Interpretation; the flow statistics are machine-verified, the attribution to contamination is the specialist's reading of the candidate list." | ||||
| 14 | +G-13,"Formal verification receives a growing share of its inbound citations from computer vision (6.7% baseline to 13.8% post), consistent with the neural-network verification literature (Reluplex, Marabou, DeepPoly, VNN-COMP) being cited by vision robustness work.",contested,corpus_statistic,katz2017reluplex;katz2019marabou;singh2019deeppoly;brix2023vnncomp,,"results/graph/category_flows_yearly.csv via \ThyInflowFormalVerificationFromComputerVision{Baseline,Post}Pct",0.6,machine-verified,The attribution to neural-network verification is not tested on the flow data (no paper-level breakdown). | ||||
| 15 | +G-14,"The major theoretical results of the window (almost-linear max-flow, negative-weight SSSP in near-linear time, Kelley-Meka 3-AP bounds, Williams's time-space simulation, the directed SSSP sorting barrier, optimal open-addressing bounds) do not appear among the field-normalised landmark candidates, which favour generic-title book chapters and re-deposited classics; the landmark selection is therefore not a valid instrument for identifying theoretical breakthroughs.",established,metadata_only,chen2022maxflow;bernstein2022negative;kelley2023threeap;williams2025sqrtspace;duan2025sorting;farachcolton2024openaddressing,,literature_synthesis/landmarks/theory_landmarks.csv; literature_synthesis/agent_G/contributions.csv,0.85,human-verified,"The listed results are known to the specialist from the verified bibliographic records (titles, venues); their content is not reviewed here beyond the abstracts." | ||||
| 16 | +G-15,Petri-net reachability was settled in the baseline period: a non-elementary lower bound (STOC 2019) followed by matching Ackermann-completeness (FOCS 2021); the STOC 2019 paper is one of only two in-scope research candidates in the computational_complexity list.,established,abstract,czerwinski2019petri;czerwinski2021ackermann;leroux2021notprimitive,,literature_synthesis/landmarks/theory_abstracts.jsonl (W2900179285),0.9,machine-verified,Abstract of the STOC paper reports the lower bound; the 2021 results are cited from their verified records. | ||||
| 17 | +G-16,"LLM-assisted program analysis and compiler testing entered the top venues of the programming-languages community in 2024 (LLift and WhiteFox at OOPSLA), and LLM-based compiler optimisation models were released in 2025 (LLM Compiler at CC); these works report found bugs or optimisation recovery rates but, per their abstracts, no formal guarantees.",established,abstract,li2024llift;yang2024whitefox;cummins2025llmcompiler;munley2024llm4vv;xia2024fuzz4all,lopes2021alive2;yang2011csmith,"literature_synthesis/landmarks/software_pl_abstracts.jsonl (W4396242417, W4403223258, W4407942537)",0.85,machine-verified,Contrast with translation validation (Alive2) and Csmith-style differential testing is the specialist's framing. | ||||
| 18 | +G-17,"Machine-learning-guided automated theorem proving reached about 60% of Mizar theorems in the hammer setting (ITP 2023), and LLM-based provers (Baldur, LeanDojo, DeepSeek-Prover) report whole-proof generation on Lean/Isabelle benchmarks; the LeanDojo and DeepSeek-Prover results are preprints and the benchmark-level figures cannot be compared across systems.",established,abstract,jakubuv2023mizar;first2023baldur;yang2023leandojo;xin2024deepseekprover;yang2024formalmath,,literature_synthesis/landmarks/software_pl_abstracts.jsonl (W4385245566),0.8,machine-verified,The MizAR abstract is attached in the corpus to a wrong title (claim G-02). | ||||
| 19 | +G-18,"Field evidence on AI coding assistants is conflicting: three randomised field experiments report a 26.08% (s.e. 10.3%) increase in completed tasks (Management Science 2026), while a 2025 randomised trial preprint with experienced open-source developers reports slower completion; the populations (enterprise developers vs expert maintainers of mature repositories) and outcomes (tasks completed vs time per issue) differ.",contested,abstract,cui2026genaiwork;peng2023copilot;ziegler2022copilot,becker2025metr,literature_synthesis/landmarks/software_pl_abstracts.jsonl (W7131867455),0.8,machine-verified,The METR study is a preprint; the reconciliation by population/outcome is the specialist's reading of the abstracts. | ||||
| 20 | +G-19,"Security evaluations of LLM-generated or LLM-classified code (Copilot vulnerability rates, user studies, CWE classification by open models) consistently report high detection or completion rates paired with poor fine-grained security reasoning.",established,abstract,pearce2022asleep;perry2023insecure;gasparlopes2025vuln,,literature_synthesis/landmarks/software_pl_abstracts.jsonl (W7110046239),0.75,machine-verified,Three studies with different designs; 'consistently' refers to these three only. | ||||
| 21 | +G-20,"The compilers category is small (0.09% of primary labels in 2025) and its candidate list contains ten misclassified works captured by the tokens 'just-in-time', 'compiler', 'compiling' and 'polyhedral' used outside computing.",established,abstract,,,literature_synthesis/agent_G/contributions.csv (primary_category = compilers); \ThySharePrimaryCompilersTwoZeroTwoFivePct,0.9,human-verified,Lexical mechanism inferred from titles; the ontology's keyword regexes were not re-run by Agent G. | ||||
| 22 | +G-21,Expressivity results for transformers (log-precision transformers lie in uniform TC0; survey of formal-language results) are the main post-2022 contribution of complexity theory to the study of language models visible in the verified bibliography; they bound what a single forward pass can compute and motivate chain-of-thought as a route to greater power.,speculative,metadata_only,merrill2023parallelism;strobl2024survey,,manuscript/references_part07a.bib,0.6,unverified,Not from the corpus landmark set; the relevance claim is the specialist's and the content is known only from verified titles and abstracts. | ||||
| 23 | +G-22,"Algorithms with predictions (learning-augmented algorithms) is a baseline-period research programme (ski rental and scheduling with ML predictions; competitive caching with advice; CACM overview 2022) that the corpus records through a 2024 arXiv re-posting of the 2018 paper, illustrating how re-depositions distort the dating of landmarks.",established,abstract,mitzenmacher2022predictions;lykouris2021caching,,literature_synthesis/landmarks/theory_abstracts.jsonl (W2891784792),0.85,machine-verified,The OpenAlex record W2891784792 carries publication year 2024 and DOI 10.48550/arxiv.2407.17712. | ||||
| 24 | +G-23,"AI-discovered algorithms (AlphaTensor matrix multiplication, AlphaDev sorting routines, FunSearch, AlphaEvolve) are reported in Nature or as preprints by their developers; the improvements are on specific instances (small matrix sizes, short sorting networks, cap-set constructions) and no independent replication appears in the verified bibliography.",contested,metadata_only,fawzi2022alphatensor;mankowitz2023alphadev;romeraparedes2024funsearch;novikov2025alphaevolve,,manuscript/references_part07a.bib; manuscript/references.bib,0.7,unverified,"AlphaEvolve is a preprint; replication status is asserted from the absence of such works in the bibliography, not from a search of the corpus." | ||||
| 25 | +G-24,"Verified-systems research continued in the window with Verus (SOSP 2024), a Rust-based verification framework, extending the CompCert/seL4/RustBelt lineage; the corpus candidate list records this lineage only through re-deposited UNSW theses dated 2022.",established,metadata_only,lattuada2024verus;leroy2009compcert;klein2009sel4;jung2017rustbelt;jung2021saferust,,"literature_synthesis/agent_G/contributions.csv (W2327217190, W2491926874, W630549275)",0.8,machine-verified,Verus content known from its verified title and venue only. | ||||
added
literature_synthesis/agent_G/open_problems.csv
+11 −0
@@ -0,0 +1,11 @@ | |||||
| 1 | +problem_id,statement,categories,why_unresolved,testable_direction,supporting_keys | ||||
| 2 | +G-P1,"Can field-normalised citation ranking identify landmark works in small theory categories, given identifier merges, re-deposited classics and generic-title chapters?",algorithms;computational_complexity;formal_verification;compilers,The 150 candidates contain 29 in-scope research works; NCS36 rewards records whose citation counts belong to other works or to canonical textbooks.,"Re-run select_landmarks.py with type filters (exclude book-chapter, dissertation, reprint), a live identifier re-resolution step and venue priors (STOC/FOCS/SODA/POPL/PLDI/CAV/ICSE); measure precision against a specialist-labelled sample.",czerwinski2019petri;chen2022maxflow;kelley2023threeap | ||||
| 3 | +G-P2,Does co-classification with the LLM category in software engineering (21.2% of works in 2025) correspond to method adoption or to vocabulary adoption?,software_engineering;programming_languages,Co-classification is lexical; reference flows to LLM works stay at 2.5% of software-engineering references.,Extract method/model nodes for the high-priority set (Part III knowledge graph) and test whether works co-classified with LLM cite LLM method papers at a higher rate than their category baseline.,wang2024llmtesting;fan2023llm4se;hou2024llm4se | ||||
| 4 | +G-P3,What is the productivity effect of AI coding assistants on experienced developers working on mature codebases?,software_engineering,Randomised field experiments report +26% completed tasks for enterprise developers while a 2025 randomised trial preprint reports slower completion for expert open-source maintainers; populations and outcomes differ.,"Preregistered multi-site trials stratified by developer experience and repository maturity, with time-to-merge and defect rate as joint outcomes.",cui2026genaiwork;becker2025metr;peng2023copilot | ||||
| 5 | +G-P4,Can LLM-based bug finding and compiler fuzzing be given soundness or coverage guarantees comparable to translation validation and differential testing?,programming_languages;compilers;formal_verification,"LLift and WhiteFox report found bugs but, per their abstracts, no completeness or false-negative bounds; Alive2 gives bounded translation validation.","Combine LLM-generated test programs with Alive2-style validation and measure the share of LLM-reported bugs that are confirmed, by optimisation pass.",li2024llift;yang2024whitefox;lopes2021alive2;xia2024fuzz4all | ||||
| 6 | +G-P5,"How far can learned provers scale on formal mathematics and verified software, and are reported pass rates comparable across benchmarks?",formal_verification,MizAR reports 60% of Mizar theorems; LLM provers report Lean/Isabelle figures from preprints on different benchmarks with possible training-set overlap.,A benchmark with time-separated test theorems (post-training-cutoff) and a common compute budget; report proof-checking rather than self-reported success.,jakubuv2023mizar;first2023baldur;yang2023leandojo;xin2024deepseekprover;yang2024formalmath | ||||
| 7 | +G-P6,"Do the 2022-2025 algorithmic breakthroughs (almost-linear flow, near-linear negative-weight SSSP, sub-Dijkstra directed SSSP, square-root-space simulation) translate into practice, and does the corpus record their diffusion?",algorithms;computational_complexity,None of these works is in the landmark candidate list; their citation diffusion across categories has not been measured.,Trace the citation neighbourhoods of the verified DOIs in the citation graph and classify citing works by category and type (theory vs engineering).,chen2022maxflow;bernstein2022negative;duan2025sorting;williams2025sqrtspace;farachcolton2024openaddressing | ||||
| 8 | +G-P7,"Is the metaphor-based metaheuristic literature growing faster than the rest of algorithms research, and does it absorb a growing share of citations?",algorithms,Six of 25 algorithm candidates are such optimisers; the critique literature argues many are re-descriptions of known methods; no corpus-level measurement exists.,"Keyword-defined subseries ('optimizer', 'nature-inspired', 'bio-inspired') with ITS and citation-share tracking, and a sample re-evaluation against the Camacho-Villalon criteria.",sorensen2013metaphor;aranha2021metaphor;camachovillalon2022exposing | ||||
| 9 | +G-P8,"What do expressivity bounds on transformers imply for the computational-complexity category, and are such works classified there?",computational_complexity,The TC0 bounds and formal-language survey are classified by OpenAlex topics that may route them to NLP rather than complexity.,Query the classification of the verified DOIs and measure the inflow of LLM-category citations to complexity works over time.,merrill2023parallelism;strobl2024survey | ||||
| 10 | +G-P9,"Are AI-discovered algorithms (matrix multiplication, sorting, cap sets) independently reproduced and extended by the theory community?",algorithms,Reports come from the developers (Nature articles and a preprint); no replication appears in the verified bibliography.,Search the citation graph for works that reproduce or improve the reported constructions; classify by author affiliation (independent vs developer).,fawzi2022alphatensor;mankowitz2023alphadev;romeraparedes2024funsearch;novikov2025alphaevolve | ||||
| 11 | +G-P10,Why do the formal verification and programming-languages categories decline in primary share while their multi-label counts grow?,formal_verification;programming_languages,Primary-label assignment is an argmax over category scores; works that also carry AI or security labels may lose the primary label to larger categories.,Compare primary and multi-label trajectories by co-assigned category; estimate the share of works whose primary label switched to llm/cybersecurity by year., | ||||
modified
literature_synthesis/landmarks/ai_ml_abstracts.jsonl
+117 −118
@@ -1,97 +1,149 @@ | |||||
| 1 | −{"work_id": 7118302872, "title": "A frame work to predict the influencing nodes in social networking platform using graph neural network model", "abstract": "Identifying influential nodes that can maximize information diffusion is a fundamental problem in social network analysis, commonly referred to as influence maximization. Diffusion model-based and traditional greedy and heuristic algorithms tend to be expensive to calculate, or poorly aware of the network structure, especially when dealing with large networks. To overcome these weaknesses, this paper will introduce a hybrid architecture that will combine Graph Neural Networks (GNNs) with the Ant Colony Optimization (ACO) towards influence maximization. The proposed approach works as follows, where the GNN learns influence representations on the node level, which jointly models both local and higher-order structural dependencies in the network, and ACO uses these learned representations to assemble a non-redundant and diverse seed set. The chosen seed sets are tested on the basis of the Independent Cascade diffusion model where the spread of influence is taken as the key performance measure. The experiments on the real-world social network data indicate that the proposed GNN-ACO framework is steadily more influential in spreading than the current baseline methods and that it has comparative computational efficiency at varying levels of seed set sizes. These findings demonstrate the advantage of optimizing influence maximization by using representation learning with a seed selection strategy based on optimization."} | 1 | +{"work_id": 2963923407, "title": "Addressing Function Approximation Error in Actor-Critic Methods", "abstract": "In value-based reinforcement learning methods such as deep Q-learning, function approximation errors are known to lead to overestimated value estimates and suboptimal policies. We show that this problem persists in an actor-critic setting and propose novel mechanisms to minimize its effects on both the actor and the critic. Our algorithm builds on Double Q-learning, by taking the minimum value between a pair of critics to limit overestimation. We draw the connection between target networks and overestimation bias, and suggest delaying policy updates to reduce per-update error and further improve performance. We evaluate our method on the suite of OpenAI gym tasks, outperforming the state of the art in every environment tested."} | ||
| 2 | −{"work_id": 4393138529, "title": "Parameter-Efficient Fine-Tuning for Large Models: A Comprehensive Survey", "abstract": "Large models represent a groundbreaking advancement in multiple application fields, enabling remarkable achievements across various tasks. However, their unprecedented scale comes with significant computational costs. These models, often consisting of billions of parameters, require vast amounts of computational resources for execution. Especially, the expansive scale and computational demands pose considerable challenges when customizing them for particular downstream tasks, particularly over the hardware platforms constrained by computational capabilities. Parameter Efficient Fine-Tuning (PEFT) provides a practical solution by efficiently adjusting the large models over the various downstream tasks. In particular, PEFT refers to the process of adjusting the parameters of a pre-trained large model to adapt it to a specific task or domain while minimizing the number of additional parameters introduced or computational resources required. This approach is particularly important when dealing with large-scale language models with high parameter counts, as fine-tuning these models from scratch can be computationally expensive and resource-intensive, posing considerable challenges in the supporting system platform design. In this survey, we present comprehensive studies of various PEFT algorithms, examining their performance and computational overhead. Moreover, we provide an overview of applications developed using different PEFT algorithms and discuss common techniques employed to mitigate computation costs for PEFT. In addition to providing an extensive survey from an algorithmic standpoint, we also examine various real-world system designs to investigate the implementation costs associated with different PEFT approaches. This survey serves as a valuable resource for researchers aiming to understand both the PEFT algorithm and its system implementation, offering detailed ......"} | 2 | +{"work_id": 3152893301, "title": "Graph neural networks: A review of methods and applications", "abstract": "Lots of learning tasks require dealing with graph data which contains rich relation information among elements. Modeling physics systems, learning molecular fingerprints, predicting protein interface, and classifying diseases demand a model to learn from graph inputs. In other domains such as learning from non-structural data like texts and images, reasoning on extracted structures (like the dependency trees of sentences and the scene graphs of images) is an important research topic which also needs graph reasoning models. Graph neural networks (GNNs) are neural models that capture the dependence of graphs via message passing between the nodes of graphs. In recent years, variants of GNNs such as graph convolutional network (GCN), graph attention network (GAT), graph recurrent network (GRN) have demonstrated ground-breaking performances on many deep learning tasks. In this survey, we propose a general design pipeline for GNN models and discuss the variants of each component, systematically categorize the applications, and propose four open problems for future research."} | ||
| 3 | −{"work_id": 4396599905, "title": "Multimodal fusion on low-quality data: A comprehensive survey", "abstract": "Multimodal fusion focuses on integrating information from multiple modalities with the goal of more accurate prediction, which has achieved remarkable progress in a wide range of scenarios, including autonomous driving and medical diagnosis. However, the reliability of multimodal fusion remains largely unexplored especially under low-quality data settings. This paper surveys the common challenges and recent advances of multimodal fusion in the wild and presents them in a comprehensive taxonomy. From a data-centric view, we identify four main challenges that are faced by multimodal fusion on low-quality data, namely (1) noisy multimodal data that are contaminated with heterogeneous noises, (2) incomplete multimodal data that some modalities are missing, (3) imbalanced multimodal data that the qualities or properties of different modalities are significantly different and (4) quality-varying multimodal data that the quality of each modality dynamically changes with respect to different samples. This new taxonomy will enable researchers to understand the state of the field and identify several potential directions. We also provide discussion for the open problems in this field together with interesting future research directions."} | 3 | +{"work_id": 7123342962, "title": "Structure-Preserving Frequency-Regularized Text-Guided Optimal Transport for Unpaired Rain Streaks and Raindrops Removal", "abstract": "The removal of rain streaks and raindrops is crucial for enhancing the image visibility and mitigating the weather degradations. However, most existing approaches rely on the paired rainy and clean images, which are challenging to obtain in real-world scenarios. To this end, we propose a novel structure-preserving frequency-regularized text-guided optimal transport (SFTOT) framework, which formulates the unpaired rain streaks and raindrops removal as an optimal transport problem. Specifically, we introduce a structure-preserving transport cost, incorporating the structural similarity constraint to minimize the duality gap between the primal and dual formulations, while preserving the structural details of reconstructed images. Furthermore, by embedding the inherent frequency sparsity of rain streaks and raindrops into the transport cost, we derive a frequency-regularized optimal transport objective, ensuring consistency in frequency distributions between the generated and clean images. Additionally, we employ a pre-trained one-step stable diffusion model as the restoration network, which is fine-tuned using the low-rank adaptation (LoRA) adapters and zero convolutional layers, while integrating the domain-specific text prompts for both degraded and clean images to guide the generation process. Extensive experiments demonstrate that our method surpasses the existing well-performing unpaired learning approaches, achieving notable improvements in both the fidelity and photo-realism."} | ||
| 4 | −{"work_id": 2781726626, "title": "Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actor", "abstract": "Model-free deep reinforcement learning (RL) algorithms have been demonstrated on a range of challenging decision making and control tasks. However, these methods typically suffer from two major challenges: very high sample complexity and brittle convergence properties, which necessitate meticulous hyperparameter tuning. Both of these challenges severely limit the applicability of such methods to complex, real-world domains. In this paper, we propose soft actor-critic, an off-policy actor-critic deep RL algorithm based on the maximum entropy reinforcement learning framework. In this framework, the actor aims to maximize expected reward while also maximizing entropy. That is, to succeed at the task while acting as randomly as possible. Prior deep RL methods based on this framework have been formulated as Q-learning methods. By combining off-policy updates with a stable stochastic actor-critic formulation, our method achieves state-of-the-art performance on a range of continuous control benchmark tasks, outperforming prior on-policy and off-policy methods. Furthermore, we demonstrate that, in contrast to other off-policy algorithms, our approach is very stable, achieving very similar performance across different random seeds."} | 4 | +{"work_id": 2619383789, "title": "Multimodal Machine Learning: A Survey and Taxonomy", "abstract": "Our experience of the world is multimodal - we see objects, hear sounds, feel texture, smell odors, and taste flavors. Modality refers to the way in which something happens or is experienced and a research problem is characterized as multimodal when it includes multiple such modalities. In order for Artificial Intelligence to make progress in understanding the world around us, it needs to be able to interpret such multimodal signals together. Multimodal machine learning aims to build models that can process and relate information from multiple modalities. It is a vibrant multi-disciplinary field of increasing importance and with extraordinary potential. Instead of focusing on specific multimodal applications, this paper surveys the recent advances in multimodal machine learning itself and presents them in a common taxonomy. We go beyond the typical early and late fusion categorization and identify broader challenges that are faced by multimodal machine learning, namely: representation, translation, alignment, fusion, and co-learning. This new taxonomy will enable researchers to better understand the state of the field and identify directions for future research."} | ||
| 5 | −{"work_id": 4402727669, "title": "mPLUG-OwI2: Revolutionizing Multi-modal Large Language Model with Modality Collaboration", "abstract": "Multi-modal Large Language Models (MLLMs) have demonstrated impressive instruction abilities across various open-ended tasks. However, previous methods primarily fo-cus on enhancing multi-modal capabilities. In this work, we introduce a versatile multi-modal large language model, mPLUG-Owl2, which effectively leverages modality collab-oration to improve performance in both text and multi-modal tasks. mPLUG-Owl2 utilizes a modularized network design, with the language decoder acting as a universal interface for managing different modalities. Specifically, mPLUG-Owl2 incorporates shared functional modules to facilitate modal-ity collaboration and introduces a modality-adaptive module that preserves modality-specific features. Extensive experi-ments reveal that mPLUG-Owl2 is capable of generalizing both text tasks and multi-modal tasks and achieving state-of-the-art performances with a single generic model. Notably, mPLUG-Owl2 is the first MLLM model that demonstrates the modality collaboration phenomenon in both pure-text and multi-modal scenarios, setting a pioneering path in the development of future multi-modal foundation models."} | 5 | +{"work_id": 4384464487, "title": "Students\u2019 voices on generative AI: perceptions, benefits, and challenges in higher education", "abstract": "Abstract This study explores university students\u2019 perceptions of generative AI (GenAI) technologies, such as ChatGPT, in higher education, focusing on familiarity, their willingness to engage, potential benefits and challenges, and effective integration. A survey of 399 undergraduate and postgraduate students from various disciplines in Hong Kong revealed a generally positive attitude towards GenAI in teaching and learning. Students recognized the potential for personalized learning support, writing and brainstorming assistance, and research and analysis capabilities. However, concerns about accuracy, privacy, ethical issues, and the impact on personal development, career prospects, and societal values were also expressed. According to John Biggs\u2019 3P model, student perceptions significantly influence learning approaches and outcomes. By understanding students\u2019 perceptions, educators and policymakers can tailor GenAI technologies to address needs and concerns while promoting effective learning outcomes. Insights from this study can inform policy development around the integration of GenAI technologies into higher education. By understanding students\u2019 perceptions and addressing their concerns, policymakers can create well-informed guidelines and strategies for the responsible and effective implementation of GenAI tools, ultimately enhancing teaching and learning experiences in higher education."} | ||
| 6 | −{"work_id": 1568555062, "title": "Equivalence and Synthesis of Causal Models", "abstract": "chapter Share on Equivalence and Synthesis of Causal Models Authors: TS Verma Search about this author , Judea Pearl Search about this author Authors Info & Claims Probabilistic and Causal Inference: The Works of Judea PearlFebruary 2022 Pages 221\u2013236https://doi.org/10.1145/3501714.3501732Online:04 March 2022Publication History 0citation22DownloadsMetricsTotal Citations0Total Downloads22Last 12 Months22Last 6 weeks7 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my Alerts New Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access"} | 6 | +{"work_id": 4385763767, "title": "Transformers in Time Series: A Survey", "abstract": "Transformers have achieved superior performances in many tasks in natural language processing and computer vision, which also triggered great interest in the time series community. Among multiple advantages of Transformers, the ability to capture long-range dependencies and interactions is especially attractive for time series modeling, leading to exciting progress in various time series applications. In this paper, we systematically review Transformer schemes for time series modeling by highlighting their strengths as well as limitations. In particular, we examine the development of time series Transformers in two perspectives. From the perspective of network structure, we summarize the adaptations and modifications that have been made to Transformers in order to accommodate the challenges in time series analysis. From the perspective of applications, we categorize time series Transformers based on common tasks including forecasting, anomaly detection, and classification. Empirically, we perform robust analysis, model size analysis, and seasonal-trend decomposition analysis to study how Transformers perform in time series. Finally, we discuss and suggest future directions to provide useful research guidance."} | ||
| 7 | −{"work_id": 2754517384, "title": "Deep Reinforcement Learning That Matters", "abstract": "In recent years, significant progress has been made in solving challenging problems across various domains using deep reinforcement learning (RL). Reproducing existing work and accurately judging the improvements offered by novel methods is vital to sustaining this progress. Unfortunately, reproducing results for state-of-the-art deep RL methods is seldom straightforward. In particular, non-determinism in standard benchmark environments, combined with variance intrinsic to the methods, can make reported results tough to interpret. Without significance metrics and tighter standardization of experimental reporting, it is difficult to determine whether improvements over the prior state-of-the-art are meaningful. In this paper, we investigate challenges posed by reproducibility, proper experimental techniques, and reporting procedures. We illustrate the variability in reported metrics and results when comparing against common baselines and suggest guidelines to make future results in deep RL more reproducible. We aim to spur discussion about how to ensure continued progress in the field by minimizing wasted effort stemming from results that are non-reproducible and easily misinterpreted."} | 7 | +{"work_id": 4327734444, "title": "Leveraging control priors in deep reinforcement learning for robotics", "abstract": "This thesis proposes a series of hybrid approaches to robot control that combine classical control methods and deep reinforcement learning (RL). Classical control methods work well in structured environments, but struggle in unstructured and stochastic situations. RL has the potential to learn complex controllers through trial and error, however, current methods are sample-inefficient and unsafe. The proposed hybrid approaches combine the strengths of both systems, resulting in efficient, reliable, and dexterous decision-making systems for real-world robotics. This is demonstrated through a sequence of four publications, showing that the hybrid approaches outperform either system operating independently."} | ||
| 8 | −{"work_id": 2964121744, "title": "AutoResearch Lite: a reproducible paper-inspired experiment runner (Adam mechanism reproduction and convergence-speed comparison)", "abstract": "A dependency-free experiment runner that turns a paper's research question into a configuration-driven, verifiable experiment task. The bundled reproduction maps the first/second moment estimates and bias correction of Adam (Kingma & Ba, arXiv:1412.6980) into runnable Python and compares them against fixed-learning-rate SGD under fixed seeds and epoch budgets. A second experiment measures convergence speed (epochs to reach a target training loss) against SGD with heavy-ball momentum, AdaGrad and RMSProp, with every optimizer family tuned by the same coarse learning-rate sweep. In that experiment Adam is not the fastest; the negative result is reported in full. Every reported number is pinned in an expected-values file with explicit tolerances and checked by one command that also runs the unit tests, and the checking harness is validated against deliberately broken implementations (negative controls). The repository also ships a task contract that expresses the reproduction as a repeatable, scoreable task for an automated research loop."} | ||||
| 9 | −{"work_id": 4410609100, "title": "Jailbreaking Black Box Large Language Models in Twenty Queries", "abstract": "There is growing interest in ensuring that large language models (LLMs) align with human values. However, the alignment of such models is vulnerable to adversarial jailbreaks, which coax LLMs into overriding their safety guardrails. The identification of these vulnerabilities is therefore instrumental in understanding inherent weaknesses and preventing future misuse. To this end, we propose Prompt Automatic Iterative Refinement (PAIR), an algorithm that generates semantic jailbreaks with only black-box access to an LLM. PAIR\u2014which is inspired by social engineering attacks\u2014uses an attacker LLM to automatically generate jailbreaks for a separate targeted LLM without human intervention. In this way, the attacker LLM iteratively queries the target LLM to update and refine a candidate jailbreak. Empirically, PAIR often requires fewer than twenty queries to produce a jailbreak, which is orders of magnitude more efficient than existing algorithms. PAIR also achieves competitive jailbreaking success rates and transferability on open and closed-source LLMs, including GPT-3.5/4, Vicuna, and Gemini."} | ||||
| 10 | −{"work_id": 4409249263, "title": "Ethical challenges and evolving strategies in the integration of artificial intelligence into clinical practice", "abstract": "Artificial intelligence (AI) has rapidly transformed various sectors, including healthcare, where it holds the potential to transform clinical practice and improve patient outcomes. However, its integration into medical settings brings significant ethical challenges that need careful consideration. This paper examines the current state of AI in healthcare, focusing on five critical ethical concerns: justice and fairness, transparency, patient consent and confidentiality, accountability, and patient-centered and equitable care. These concerns are particularly pressing as AI systems can perpetuate or even exacerbate existing biases, often resulting from non-representative datasets and opaque model development processes. The paper explores how bias, lack of transparency, and challenges in maintaining patient trust can undermine the effectiveness and fairness of AI applications in healthcare. In addition, we review existing frameworks for the regulation and deployment of AI, identifying gaps that limit the widespread adoption of these systems in a just and equitable manner. Our analysis provides recommendations to address these ethical challenges, emphasizing the need for fairness in algorithm design, transparency in model decision-making, and patient-centered approaches to consent and data privacy. By highlighting the importance of continuous ethical scrutiny and collaboration between AI developers, clinicians, and ethicists, we outline pathways for achieving more responsible and inclusive AI implementation in healthcare. These strategies, if adopted, could enhance both the clinical value of AI and the trustworthiness of AI systems among patients and healthcare professionals, ensuring that these technologies serve all populations equitably."} | ||||
| 11 | −{"work_id": 4412505619, "title": "AI Agents vs. Agentic AI: A Conceptual Taxonomy, Applications and Challenges", "abstract": "This review critically distinguishes between AI Agents and Agentic AI, offering a structured, conceptual taxonomy, application mapping, and analysis of opportunities and challenges to clarify their divergent design philosophies and capabilities. We begin by outlining the search strategy and foundational definitions, characterizing AI Agents as modular systems driven and enabled by LLMs and LIMs for taskspecific automation. Generative AI is positioned as a precursor providing the foundation, with AI agents advancing through tool integration, prompt engineering, and reasoning enhancements. We then characterize Agentic AI systems, which, in contrast to AI Agents, represent a paradigm shift marked by multi-agent collaboration, dynamic task decomposition, persistent memory, and coordinated autonomy. Through a chronological evaluation of architectural evolution, operational mechanisms, interaction styles, and autonomy levels, we present a comparative analysis across both AI agents and agentic AI paradigms. Application domains enabled by AI Agents such as customer support, scheduling, and data summarization are then contrasted with Agentic AI deployments in research automation, robotic coordination, and medical decision support. We further examine unique challenges in each paradigm including hallucination, brittleness, emergent behavior, and coordination failure, and propose targeted solutions such as ReAct loops, retrieval-augmented generation (RAG), automation coordination layers, and causal modeling. This work aims to provide a roadmap for developing robust, scalable, and explainable AI-driven systems."} | ||||
| 12 | −{"work_id": 1591675293, "title": "Bayesian Inverse Reinforcement Learning", "abstract": "Inverse Reinforcement Learning (IRL) is the problem of learning the reward function underlying a Markov Decision Process given the dynamics of the system and the behaviour of an expert. IRL is motivated by situations where knowledge of the rewards is a goal by itself (as in preference elicitation) and by the task of apprenticeship learning (learning policies from an expert). In this paper we show how to combine prior knowledge and evidence from the expert's actions to derive a probability distribution over the space of reward functions. We present efficient algorithms that find solutions for the reward learning and apprenticeship learning tasks that generalize well over these distributions. Experimental results show strong improvement for our methods over previous heuristic-based approaches."} | ||||
| 13 | −{"work_id": 2964083594, "title": "Large-Scale Study of Curiosity-Driven Learning", "abstract": "Reinforcement learning algorithms rely on carefully engineering environment rewards that are extrinsic to the agent. However, annotating each environment with hand-designed, dense rewards is not scalable, motivating the need for developing reward functions that are intrinsic to the agent. Curiosity is a type of intrinsic reward function which uses prediction error as reward signal. In this paper: (a) We perform the first large-scale study of purely curiosity-driven learning, i.e. without any extrinsic rewards, across 54 standard benchmark environments, including the Atari game suite. Our results show surprisingly good performance, and a high degree of alignment between the intrinsic curiosity objective and the handdesigned extrinsic rewards of many game environments. (b) We investigate the effect of using different feature spaces for computing prediction error and show that random features are sufficient for many popular RL game benchmarks, but learned features appear to generalize better (e.g. to novel game levels in Super Mario Bros.). (c) We demonstrate limitations of the prediction-based rewards in stochastic setups. Game-play videos and code are at https://pathak22.github.io/large-scale-curiosity/."} | ||||
| 14 | −{"work_id": 7124262017, "title": "OECD Digital Education Outlook 2026", "abstract": "The OECD Digital Education Outlook 2026 explores emerging research on the use of generative AI in education and presents innovative tools and applications that show promise. The report examines the use of generative AI in different teaching and learning scenarios: by students to learn subject knowledge, by students and teachers together as part of instruction, and by teachers alone to support their work in the classroom. The Outlook also showcases how generative AI can enhance the efficiency of education institutions and systems, such as research, analysis of learning pathways and support for study advisors. While highlighting the opportunities and benefits of generative AI, the report also notes key challenges and concerns. It provides a state-of-the-art overview of the impact and possibilities of generative AI in education and is an essential resource for education policymakers, institution leaders, researchers, as well as other stakeholders."} | ||||
| 15 | −{"work_id": 4321499901, "title": "What if the devil is my guardian angel: ChatGPT as a case study of using chatbots in education", "abstract": "Abstract Artificial Intelligence (AI) technologies have been progressing constantly and being more visible in different aspects of our lives. One recent phenomenon is ChatGPT, a chatbot with a conversational artificial intelligence interface that was developed by OpenAI. As one of the most advanced artificial intelligence applications, ChatGPT has drawn much public attention across the globe. In this regard, this study examines ChatGPT in education, among early adopters, through a qualitative instrumental case study. Conducted in three stages, the first stage of the study reveals that the public discourse in social media is generally positive and there is enthusiasm regarding its use in educational settings. However, there are also voices who are approaching cautiously using ChatGPT in educational settings. The second stage of the study examines the case of ChatGPT through lenses of educational transformation, response quality, usefulness, personality and emotion, and ethics. In the third and final stage of the study, the investigation of user experiences through ten educational scenarios revealed various issues, including cheating, honesty and truthfulness of ChatGPT, privacy misleading, and manipulation. The findings of this study provide several research directions that should be considered to ensure a safe and responsible adoption of chatbots, specifically ChatGPT, in education."} | ||||
| 16 | −{"work_id": 7134057781, "title": "A fuzzy-TD3 hybrid reinforcement learning framework for robust trajectory tracking of the Mitsubishi RV-2AJ robotic arm", "abstract": "This paper proposes a novel hybrid control architecture that synergistically integrates a fuzzy logic system with the Twin Delayed Deep Deterministic Policy Gradient (TD3) algorithm to achieve precise, robust trajectory tracking for a 5-degree-of-freedom (5-DOF) robotic manipulator. The design merges the interpretable, rule-based reasoning and rapid transient response of fuzzy logic with the model-free, long-term adaptive optimization capabilities of deep reinforcement learning. Within this framework, a fuzzy supervisor delivers immediate corrective actions using real-time error states, while the TD3 agent concurrently learns an optimal control policy to manage the system\u2019s nonlinear dynamics. Extensive simulation studies on complex trajectories, including N-shaped, helical, and spiral paths, demonstrate the architecture\u2019s superiority. The hybrid fuzzy-TD3 controller reduces tracking error by 27.8\u201350% compared to a standalone TD3 agent and by 14.8\u201328.6% compared to a hybrid PID-TD3 baseline. Furthermore, under conditions of parametric uncertainties and internal as well as external disturbances, it maintains performance improvements of 23.5\u201334.2% over TD3 and 11.0\u201316.7% over the hybrid PID-TD3, confirming enhanced robustness. Validation through sensitivity analysis, numerical stability verification, and rule activation transparency establishes this method as an effective, adaptive, and explainable solution for advanced robotic control applications."} | ||||
| 17 | −{"work_id": 4410551352, "title": "A foundation model for the Earth system", "abstract": "Reliable forecasting of the Earth system is essential for mitigating natural disasters and supporting human progress. Traditional numerical models, although powerful, are extremely computationally expensive1. Recent advances in artificial intelligence (AI) have shown promise in improving both predictive performance and efficiency2,3, yet their potential remains underexplored in many Earth system domains. Here we introduce Aurora, a large-scale foundation model trained on more than one million hours of diverse geophysical data. Aurora outperforms operational forecasts in predicting air quality, ocean waves, tropical cyclone tracks and high-resolution weather, all at orders of magnitude lower computational cost. With the ability to be fine-tuned for diverse applications at modest expense, Aurora represents a notable step towards democratizing accurate and efficient Earth system predictions. These results highlight the transformative potential of AI in environmental forecasting and pave the way for broader accessibility to high-quality climate and weather information. Aurora, a new large-scale foundation model trained on more than one million hours of diverse geophysical data, outperforms operational forecasts in predicting air quality, ocean wave dynamics, tropical cyclone tracks and high-resolution weather."} | ||||
| 18 | −{"work_id": 1698155719, "title": "Support Vector Machines", "abstract": "The fundamental algorithms in data mining and machine learning form the basis of data science, utilizing automated methods to analyze patterns and models for all kinds of data in applications ranging from scientific discovery to business analytics. This textbook for senior undergraduate and graduate courses provides a comprehensive, in-depth overview of data mining, machine learning and statistics, offering solid guidance for students, researchers, and practitioners. The book lays the foundations of data analysis, pattern mining, clustering, classification and regression, with a focus on the algorithms and the underlying algebraic, geometric, and probabilistic concepts. New to this second edition is an entire part devoted to regression methods, including neural networks and deep learning."} | ||||
| 19 | −{"work_id": 3193917007, "title": "Generative Adversarial Networks", "abstract": "Generative modeling is an unsupervised learning technique that involves automatically discovering and learning the regularities (or patterns) in input data so that a trained model can generate new examples that plausibly could have been drawn from the original dataset. A popular type of generative model is a generative adversarial network. Generative adversarial networks (GANs) are generative models that create new data instances that resemble the training data."} | ||||
| 20 | −{"work_id": 2962776659, "title": "Fine-grained Analysis of Sentence Embeddings Using Auxiliary Prediction Tasks", "abstract": "There is a lot of research interest in encoding variable length sentences into fixed length vectors, in a way that preserves the sentence meanings. Two common methods include representations based on averaging word vectors, and representations based on the hidden states of recurrent neural networks such as LSTMs. The sentence vectors are used as features for subsequent machine learning tasks or for pre-training in the context of deep learning. However, not much is known about the properties that are encoded in these sentence representations and about the language information they capture. We propose a framework that facilitates better understanding of the encoded representations. We define prediction tasks around isolated aspects of sentence structure (namely sentence length, word content, and word order), and score representations by the ability to train a classifier to solve each prediction task when using the representation as input. We demonstrate the potential contribution of the approach by analyzing different sentence representation mechanisms. The analysis sheds light on the relative strengths of different sentence embedding methods with respect to these low level prediction tasks, and on the effect of the encoded vector's dimensionality on the resulting representations."} | ||||
| 21 | −{"work_id": 4407570917, "title": "AgentSociety: Large-scale simulation of LLM-driven generative agents advances understanding of human behaviors and society", "abstract": "Abstract Understanding human behavior and society is a central focus in social sciences, with the rise of generative social science marking a significant paradigmatic shift. By leveraging bottom-up simulations, it replaces costly and logistically challenging traditional experiments with scalable, replicable, and systematic computational approaches for studying complex social dynamics. Recent advances in large language models (LLMs) have further transformed this research paradigm, enabling the creation of human-like generative social agents and realistic simulacra of society. In this paper, we propose AgentSociety, a large-scale social simulator that integrates LLM-driven agents, a realistic societal environment, and a powerful large-scale simulation engine. Based on the proposed simulator, we generate social lives for over 10k agents, simulating their 5 million interactions both among agents and between agents and their environment. Furthermore, we explore the potential of AgentSociety as a testbed for computational social experiments, focusing on five key social issues: polarization, the spread of inflammatory messages, the effects of universal basic income policies, the impact of external shocks such as hurricanes, and urban sustainability. These five issues serve as valuable cases for assessing AgentSociety\u2019s support for typical research methods \u2013 such as surveys, interviews, and interventions \u2013 as well as for investigating the patterns, causes, and underlying mechanisms of social issues. The alignment between AgentSociety\u2019s outcomes and real-world experimental results not only demonstrates its ability to capture human behaviors and their underlying mechanisms, but also underscores its potential as an important platform for social scientists and policymakers."} | ||||
| 22 | −{"work_id": 4393065402, "title": "A survey on large language model based autonomous agents", "abstract": "Abstract Autonomous agents have long been a research focus in academic and industry communities. Previous research often focuses on training agents with limited knowledge within isolated environments, which diverges significantly from human learning processes, and makes the agents hard to achieve human-like decisions. Recently, through the acquisition of vast amounts of Web knowledge, large language models (LLMs) have shown potential in human-level intelligence, leading to a surge in research on LLM-based autonomous agents. In this paper, we present a comprehensive survey of these studies, delivering a systematic review of LLM-based autonomous agents from a holistic perspective. We first discuss the construction of LLM-based autonomous agents, proposing a unified framework that encompasses much of previous work. Then, we present a overview of the diverse applications of LLM-based autonomous agents in social science, natural science, and engineering. Finally, we delve into the evaluation strategies commonly used for LLM-based autonomous agents. Based on the previous studies, we also present several challenges and future directions in this field."} | ||||
| 23 | −{"work_id": 3133702157, "title": "On the Dangers of Stochastic Parrots", "abstract": "The past 3 years of work in NLP have been characterized by the development and deployment of ever larger language models, especially for English. BERT, its variants, GPT-2/3, and others, most recently Switch-C, have pushed the boundaries of the possible both through architectural innovations and through sheer size. Using these pretrained models and the methodology of fine-tuning them for specific tasks, researchers have extended the state of the art on a wide array of tasks as measured by leaderboards on specific benchmarks for English. In this paper, we take a step back and ask: How big is too big? What are the possible risks associated with this technology and what paths are available for mitigating those risks? We provide recommendations including weighing the environmental and financial costs first, investing resources into curating and carefully documenting datasets rather than ingesting everything on the web, carrying out pre-development exercises evaluating how the planned approach fits into research and development goals and supports stakeholder values, and encouraging research directions beyond ever larger language models."} | ||||
| 24 | −{"work_id": 4399790131, "title": "The effects of over-reliance on AI dialogue systems on students' cognitive abilities: a systematic review", "abstract": "Abstract The growing integration of artificial intelligence (AI) dialogue systems within educational and research settings highlights the importance of learning aids. Despite examination of the ethical concerns associated with these technologies, there is a noticeable gap in investigations on how these ethical issues of AI contribute to students\u2019 over-reliance on AI dialogue systems, and how such over-reliance affects students\u2019 cognitive abilities. Overreliance on AI occurs when users accept AI-generated recommendations without question, leading to errors in task performance in the context of decision-making. This typically arises when individuals struggle to assess the reliability of AI or how much trust to place in its suggestions. This systematic review investigates how students\u2019 over-reliance on AI dialogue systems, particularly those embedded with generative models for academic research and learning, affects their critical cognitive capabilities including decision-making, critical thinking, and analytical reasoning. By using the Preferred Reporting Items for Systematic Reviews and Meta-Analyses (PRISMA) guidelines, our systematic review evaluated a body of literature addressing the contributing factors and effects of such over-reliance within educational and research contexts. The comprehensive literature review spanned 14 articles retrieved from four distinguished databases: ProQuest, IEEE Xplore, ScienceDirect, and Web of Science. Our findings indicate that over-reliance stemming from ethical issues of AI impacts cognitive abilities, as individuals increasingly favor fast and optimal solutions over slow ones constrained by practicality. This tendency explains why users prefer efficient cognitive shortcuts, or heuristics, even amidst the ethical issues presented by AI technologies."} | ||||
| 25 | −{"work_id": 4402843978, "title": "Interpretable machine learning", "abstract": "Machine learning (ML, a type of artificial intelligence) is increasingly being used to support decision making in a variety of applications including recruitment and clinical diagnoses. While ML has many advantages, there are concerns that in some cases it may not be possible to explain completely how its outputs have been produced. This POSTnote gives an overview of ML and its role in decision-making. It examines the challenges of understanding how a complex ML system has reached its output, and some of the technical approaches to making ML easier to interpret. It also gives a brief overview of some of the proposed tools for making ML systems more accountable."} | ||||
| 26 | −{"work_id": 4406472463, "title": "A generative model for inorganic materials design", "abstract": "Abstract The design of functional materials with desired properties is essential in driving technological advances in areas such as energy storage, catalysis and carbon capture 1\u20133 . Generative models accelerate materials design by directly generating new materials given desired property constraints, but current methods have a low success rate in proposing stable crystals or can satisfy only a limited set of property constraints 4\u201311 . Here we present MatterGen, a model that generates stable, diverse inorganic materials across the periodic table and can further be fine-tuned to steer the generation towards a broad range of property constraints. Compared with previous generative models 4,12 , structures produced by MatterGen are more than twice as likely to be new and stable, and more than ten times closer to the local energy minimum. After fine-tuning, MatterGen successfully generates stable, new materials with desired chemistry, symmetry and mechanical, electronic and magnetic properties. As a proof of concept, we synthesize one of the generated structures and measure its property value to be within 20% of our target. We believe that the quality of generated materials and the breadth of abilities of MatterGen represent an important advancement towards creating a foundational generative model for materials design."} | ||||
| 27 | −{"work_id": 4399982941, "title": "Value engineering for autonomous agents", "abstract": "(English) The topic of this thesis is the engineering of values for autonomous agents. This is realised through the formulation, design and implementation of new functionalities for autonomous agents that enable reasoning in terms of values. In particular, we argue for the role of prescriptive norms as value-promoting mechanisms. Hence, value-driven agents should be able to autonomously determine which regulations (such as obligations, permissions or prohibitions) make the Multiagent System they inhabit better promote some values of interest. We lay the foundations of our work on Schwartz\u2019s Theory of Basic Human Values to establish a consequential connection between values and norms, considering that norms are aligned with respect to values if the outcomes they incentivise satisfy the goals that capture the meaning of values in a particular context. Another feature of Schwartz\u2019s theory that has been previously overlooked in the literature is the strong social dimension of values. That is, agents should be able to reason not just in terms of their own, but also of the values of others in their community. This points to Theory of Mind (i.e. the cognitive ability to perceive, interpret and reason about others in terms of their mental states) as an outstanding component of value-based reasoning. This thesis is structured around three main contributions (published in journal papers) plus their integration. The first contribution establishes the normvalue relationship as a consequential one in nature, and proposes a methodology for the automated synthesis and analysis of optimally value-aligned normative systems. The second contribution tackles the limitations of the first, and defines the Action Situation Language to systematically express a wide range of rules that may be implemented in a Multiagent System. This language is complemented by a game engine that automatically interprets interaction descriptions and builds their semantics as Extensive Form Games, which are later analysed with standard game-theoretical tools. This leads to a distribution over game outcomes, which are evaluated in terms of their desirability with respect to values. The third contribution introduces Theory of Mind-related functionalities into an existing Belief-Desire-Intention agent architecture, and combines them with abductive reasoning capabilities. The three contributions are integrated in a novel functionality that enables agents to reason about prescriptive norms in terms of dynamic values. This means that an autonomous agent can, at runtime, switch its value perspective to the one it estimates that another agent has. Such perspective-dependent value-based normative reasoning functionality, with its inherent social orientation, constitutes a novel contribution to the community of values for autonomous agents and paves the way for possible applications such as value-based negotiation over normative systems. In summary, value engineering is a principled and systematic approach to computational ethics, which provides an innovative tool set for integrating ethical values into the design of autonomous agents. (Catal\u00e0) El tema d\u2019aquesta tesi \u00e9s l\u2019enginyeria de valors per a agents aut\u00f2noms, aconseguida mitjan\u00e7ant la formulaci\u00f3, disseny i implementaci\u00f3 de noves funcionalitats que permeten a agents aut\u00f2noms raonar en termes de valors. En particular, defensem el paper de les normes prescriptives com a mecanismes de promoci\u00f3 de valors. Aleshores, els agents impulsats per valors deuen poder determinar de forma aut\u00f2noma quines regulacions (com ara obligacions, permisos o prohibicions) promouen millor alguns valors d\u2019inter\u00e8s en el Sistema Multiagent que habiten. Fonamentem el nostre treball a la Teoria de Schwartz de Valors Humans B\u00e0sics per establir una connexi\u00f3 entre valors i normes basada en conseq\u00fc\u00e8ncies, considerant que les normes estan alineades respecte als valors si els resultats que incentiven satisfan les metes que capten el significat d\u2019aquests valors en un context determinat. Una altra caracter\u00edstica de la teoria de Schwartz que ha estat passada per alt pr\u00e8viament a la literatura \u00e9s la forta dimensi\u00f3 social dels valors. \u00c9s a dir, els agents haurien de poder raonar, no nom\u00e9s en termes dels seus propis valors, sin\u00f3 tamb\u00e9 dels d\u2019altres a la seva comunitat. Aix\u00f2 apunta a la Teoria de la Ment (\u00e9s a dir, la capacitat cognitiva de percebre, interpretar i raonar sobre els altres en termes dels seus estats mentals) com un component destacat del raonament basat en valors. Aquesta tesi s\u2019estructura al voltant de tres contribucions principals (publicades en revistes acad\u00e8miques), a m\u00e9s de la seva integraci\u00f3. La primera contribuci\u00f3 estableix la relaci\u00f3 entre normes i valors mitjan\u00e7ant conseq\u00fc\u00e8ncies, i proposa una metodologia per a la s\u00edntesi i an\u00e0lisi automatitzada de sistemes normatius \u00f2ptimament alineats amb valors. La segona contribuci\u00f3 aborda les limitacions de la primera, i defineix l\u2019Action Situation Language per expressar sistem\u00e0ticament una \u00e0mplia gamma de regles que es poden implementar en un Sistema Multiagent. Aquest llenguatge es complementa amb un int\u00e8rpret que processa autom\u00e0ticament la descripci\u00f3 de la interacci\u00f3 i construeix la seva sem\u00e0ntica com un joc en forma estesa, que despr\u00e9s \u00e9s analitzat amb eines est\u00e0ndards de teoria de jocs. Aix\u00f2 condueix a una distribuci\u00f3 sobre estats finals del joc, que s\u2019avaluen en termes de la seva conveni\u00e8ncia respecte a certs valors. La tercera contribuci\u00f3 presenta funcionalitats relacionades amb la Teoria de la Ment, integrant-les a l\u2019arquitectura Belief-Desire-Intention existent i combinant-les amb raonament abductiu. Les tres contribucions s\u2019'integren en una nova funcionalitat que permet a agents aut\u00f2noms raonar sobre normes prescriptives en termes de valors din\u00e0mics. Aix\u00f2 vol dir que un agent aut\u00f2nom pot, durant la seva execuci\u00f3, canviar la seva perspectiva de valors a la que estima que t\u00e9 un altre agent. Aquest enfocament, basat en valors i amb una orientaci\u00f3 social inherent, constitueix una contribuci\u00f3 nova a la investigaci\u00f3 de valors per a agents aut\u00f2noms i aplana el cam\u00ed a possibles aplicacions com la negociaci\u00f3 autom\u00e0tica sobre sistemes normatius basada en valors. En resum, l\u2019'enginyeria de valors \u00e9s un enfocament sistem\u00e0tic i de principis a l\u2019'\u00e8tica computacional, que proporciona un conjunt d\u2019'eines innovadores per integrar valors \u00e8tics al disseny d\u2019'agents aut\u00f2noms."} | ||||
| 28 | −{"work_id": 7140170686, "title": "Pedagogical partnerships with generative AI in higher education: how dual cognitive pathways paradoxically enable transformative learning", "abstract": "Abstract The rapid integration of generative artificial intelligence (GenAI) into higher education has precipitated a critical tension between the pursuit of efficiency and the imperative for deep, transformative learning. While GenAI offers unprecedented speed in knowledge processing, it raises concerns that efficiency-driven motivations may erode the cognitive struggle essential for intellectual growth. This study investigates how Human-GenAI pedagogical partnerships influence transformative learning through the dual cognitive pathways of vigilance and offloading, moderated by efficiency orientation. Employing a rigorous mixed-methods design across three cultural contexts (China, Europe, and the United States, N = 912), we combine structural equation modeling, importance\u2013performance map analysis (IPMA), fuzzy-set qualitative comparative analysis (fsQCA), and semi-structured interviews to unpack these complex dynamics. The findings reveal a counterintuitive paradox: pedagogical partnerships simultaneously activate cognitive vigilance (critical evaluation) and cognitive offloading (strategic delegation). Contrary to traditional assumptions that delegation diminishes learning depth, our results indicate that strategic cognitive offloading\u2014when exceeding specific thresholds\u2014liberates mental resources for higher-order reflection, thereby enhancing transformative learning experiences. Furthermore, efficiency orientation acts not as a barrier but as an amplifier, strengthening both vigilance and offloading behaviors through mechanisms of pragmatic risk management. These findings reconceptualize student-AI dynamics from a zero-sum resource competition to a synergistic collaboration, offering a nuanced framework for educators to integrate GenAI in ways that preserve human agency and foster quality education in the digital age."} | ||||
| 29 | −{"work_id": 7138470740, "title": "Cross-modal Proxy Evolving for OOD Detection with Vision-Language Models", "abstract": "Reliable zero-shot detection of out-of-distribution (OOD) inputs is critical for deploying vision-language models in open-world settings. However, the lack of labeled negatives in zero-shot OOD detection necessitates proxy signals that remain effective under distribution shift. Existing negative-label methods rely on a fixed set of textual proxies, which (i) sparsely sample the semantic space beyond in-distribution (ID) classes and (ii) remain static while only visual features drift, leading to cross-modal misalignment and unstable predictions. In this paper, we propose CoEvo, a training- and annotation-free test-time framework that performs bidirectional, sample-conditioned adaptation of both textual and visual proxies. Specifically, CoEvo introduces a proxy-aligned co-evolution mechanism to maintain two evolving proxy caches, which dynamically mines contextual textual negatives guided by test images and iteratively refines visual proxies, progressively realigning cross-modal similarities and enlarging local OOD margins. Finally, we dynamically re-weight the contributions of dual-modal proxies to obtain a calibrated OOD score that is robust to distribution shift. Extensive experiments on standard benchmarks demonstrate that CoEvo achieves state-of-the-art performance, improving AUROC by 1.33% and reducing FPR95 by 45.98% on ImageNet-1K compared to strong negative-label baselines."} | ||||
| 30 | {"work_id": 4322614756, "title": "Identifying Resilient Communities in Road Networks: A Path-Based Embedding Approach", "abstract": "Effective resilience analysis of road networks is fundamental to building sustainable and disaster prepared cities. Identifying which road segments share similar vulnerabilities is important for pinpointing high-risk areas within the network and implementing measures to safeguard them against future disruptions. Graph-based community detection can be applied to group together areas of the network sharing similar structural vulnerabilities. However, current graph-based community detection methods either struggle with integrating node features during partitioning or do not account for the path-based dependencies in road networks. This paper introduces the Path-based Community Embedding (PCE) model, an approach that leverages path-based embeddings to overcome these limitations. PCE combines the strengths of graph attention networks and Long Short-Term Memory models (LSTMs) to learn representations that incorporate both local neighborhood information and long-range path dependencies. Our results on the Santa Barbara road network show that PCE improves community detection performance for resilience analysis, thus offering a powerful tool for urban planners and transportation engineers to preemptively identify vulnerabilities in road networks."} | 8 | {"work_id": 4322614756, "title": "Identifying Resilient Communities in Road Networks: A Path-Based Embedding Approach", "abstract": "Effective resilience analysis of road networks is fundamental to building sustainable and disaster prepared cities. Identifying which road segments share similar vulnerabilities is important for pinpointing high-risk areas within the network and implementing measures to safeguard them against future disruptions. Graph-based community detection can be applied to group together areas of the network sharing similar structural vulnerabilities. However, current graph-based community detection methods either struggle with integrating node features during partitioning or do not account for the path-based dependencies in road networks. This paper introduces the Path-based Community Embedding (PCE) model, an approach that leverages path-based embeddings to overcome these limitations. PCE combines the strengths of graph attention networks and Long Short-Term Memory models (LSTMs) to learn representations that incorporate both local neighborhood information and long-range path dependencies. Our results on the Santa Barbara road network show that PCE improves community detection performance for resilience analysis, thus offering a powerful tool for urban planners and transportation engineers to preemptively identify vulnerabilities in road networks."} | ||
| 31 | {"work_id": 4318586239, "title": "Artificial Intelligence: Definition and Background", "abstract": "Abstract If we want to embed AI in society, we need to understand what it is. What do we mean by artificial intelligence? How has the technology developed? Where do we stand now?"} | 9 | {"work_id": 4318586239, "title": "Artificial Intelligence: Definition and Background", "abstract": "Abstract If we want to embed AI in society, we need to understand what it is. What do we mean by artificial intelligence? How has the technology developed? Where do we stand now?"} | ||
| 10 | +{"work_id": 4411505840, "title": "AI tutoring outperforms in-class active learning: an RCT introducing a novel research-based design in an authentic educational setting", "abstract": "Advances in generative artificial intelligence show great potential for improving education. Yet little is known about how this new technology should be used and how effective it can be compared to current best practices. Here we report a randomized, controlled trial measuring college students' learning and their perceptions when content is presented through an AI-powered tutor compared with an active learning class. The novel design of the custom AI tutor is informed by the same pedagogical best practices as employed in the in-class lessons. We find that students learn significantly more in less time when using the AI tutor, compared with the in-class active learning. They also feel more engaged and more motivated. These findings offer empirical evidence for the efficacy of a widely accessible AI-powered pedagogy in significantly enhancing learning outcomes, presenting a compelling case for its broad adoption in learning environments."} | ||||
| 11 | +{"work_id": 4412438081, "title": "RAFT: Robust Adversarial Fusion Transformer for multimodal sentiment analysis", "abstract": "Multimodal sentiment analysis (MSA) has emerged as a key technology for understanding human emotions by jointly processing text, audio, and visual cues. Despite significant progress, existing fusion models remain vulnerable to real-world challenges such as modality noise, missing channels, and weak inter-modal coupling. This paper addresses these limitations by introducing RAFT (Robust Adversarial Fusion Transformer), which integrates cross-modal and self-attention mechanisms with noise-imitation adversarial training to strengthen feature interactions and resilience under imperfect inputs. We first formalize the problem of noisy and incomplete data in MSA and demonstrate how adversarial noise simulation can bridge the gap between clean and corrupted modalities. RAFT is evaluated on two benchmark datasets, MOSI and MOSEI, where it achieves competitive binary classification accuracy (greater than 88%) and fine-grained sentiment performance (5-class accuracy 57%), while reducing mean absolute error and improving Pearson correlation by up to 2% over state-of-the-art baselines. Ablation studies confirm that both adversarial training and context-aware modules contribute substantially to robustness gains. Looking ahead, we plan to refine noise-generation strategies, explore more expressive fusion architectures, and extend RAFT to handle long-form dialogues and culturally diverse expressions. Our results suggest that RAFT lays a solid foundation for reliable, real-world sentiment analysis in noisy environments."} | ||||
| 32 | {"work_id": 4402698709, "title": "The AI risk repository: A meta-review, database, and taxonomy of risks from artificial intelligence", "abstract": "The risks posed by artificial intelligence (AI) concern academics, auditors, policymakers, AI companies, and the public. Researchers, policymakers, and technology companies discuss AI risks using inconsistent terminology-the same word may describe different problems, while different words describe identical concerns. This fragmentation impedes coordinated responses to AI challenges. We address this by creating the AI Risk Repository: a living database of 1,725 risks extracted from 74 existing taxonomies and frameworks. We organize these risks using two complementary classification systems. The Causal Taxonomy classifies risks by their origins: which entity causes them (human or AI), whether intentional, and when they occur (before or after deployment). The Domain Taxonomy classifies risks by their effects across seven areas, from discrimination and privacy violations to misinformation and weapons development. This shared reference enables more coordinated approaches to discussing, researching, auditing, and governing AI systems across sectors and jurisdictions."} | 12 | {"work_id": 4402698709, "title": "The AI risk repository: A meta-review, database, and taxonomy of risks from artificial intelligence", "abstract": "The risks posed by artificial intelligence (AI) concern academics, auditors, policymakers, AI companies, and the public. Researchers, policymakers, and technology companies discuss AI risks using inconsistent terminology-the same word may describe different problems, while different words describe identical concerns. This fragmentation impedes coordinated responses to AI challenges. We address this by creating the AI Risk Repository: a living database of 1,725 risks extracted from 74 existing taxonomies and frameworks. We organize these risks using two complementary classification systems. The Causal Taxonomy classifies risks by their origins: which entity causes them (human or AI), whether intentional, and when they occur (before or after deployment). The Domain Taxonomy classifies risks by their effects across seven areas, from discrimination and privacy violations to misinformation and weapons development. This shared reference enables more coordinated approaches to discussing, researching, auditing, and governing AI systems across sectors and jurisdictions."} | ||
| 33 | {"work_id": 7122543576, "title": "SMS\u2010Based Event\u2010Triggered Fault Tolerant Control of Nonlinear Systems Using Adaptive Dynamic Programming", "abstract": "ABSTRACT An adaptive dynamic programming (ADP)\u2010based fault\u2010tolerant control (FTC) scheme integrating a sliding mode surface (SMS) and an event\u2010triggered mechanism is developed for a class of nonlinear systems with unknown actuator faults. A fault estimation observer is constructed, and its outputs are embedded into a formulated performance index, thereby recasting the FTC problem as a tractable optimal control problem. Within the resulting ADP framework, a controller is synthesized that automatically delivers active and optimal fault compensation. In place of conventional actor\u2010critic neural network (ACNN) architectures, a simplified critic\u2010only neural network (NN) is adopted, together with policy iteration, to solve the associated Hamilton\u2013Jacobi\u2013Bellman (HJB) equation. This structure substantially reduces computational complexity and enhances online applicability. CNN weights are updated via gradient descent combined with experience replay, which obviates the need for the persistent excitation condition that is often difficult to maintain in real\u2010time operation. Moreover, the proposed SMS\u2010based event\u2010triggering mechanism achieves better communication efficiency and improved closed\u2010loop performance relative to conventional state\u2010dependent triggering schemes. Theoretical analysis rigorously establishes the stability and convergence properties of the overall control system, while simulation experiments validate its practical effectiveness."} | 13 | {"work_id": 7122543576, "title": "SMS\u2010Based Event\u2010Triggered Fault Tolerant Control of Nonlinear Systems Using Adaptive Dynamic Programming", "abstract": "ABSTRACT An adaptive dynamic programming (ADP)\u2010based fault\u2010tolerant control (FTC) scheme integrating a sliding mode surface (SMS) and an event\u2010triggered mechanism is developed for a class of nonlinear systems with unknown actuator faults. A fault estimation observer is constructed, and its outputs are embedded into a formulated performance index, thereby recasting the FTC problem as a tractable optimal control problem. Within the resulting ADP framework, a controller is synthesized that automatically delivers active and optimal fault compensation. In place of conventional actor\u2010critic neural network (ACNN) architectures, a simplified critic\u2010only neural network (NN) is adopted, together with policy iteration, to solve the associated Hamilton\u2013Jacobi\u2013Bellman (HJB) equation. This structure substantially reduces computational complexity and enhances online applicability. CNN weights are updated via gradient descent combined with experience replay, which obviates the need for the persistent excitation condition that is often difficult to maintain in real\u2010time operation. Moreover, the proposed SMS\u2010based event\u2010triggering mechanism achieves better communication efficiency and improved closed\u2010loop performance relative to conventional state\u2010dependent triggering schemes. Theoretical analysis rigorously establishes the stability and convergence properties of the overall control system, while simulation experiments validate its practical effectiveness."} | ||
| 34 | {"work_id": 4361229539, "title": "LLaMA-Adapter: Efficient Fine-tuning of Language Models with Zero-init Attention", "abstract": "We present LLaMA-Adapter, a lightweight adaption method to efficiently fine-tune LLaMA into an instruction-following model. Using 52K self-instruct demonstrations, LLaMA-Adapter only introduces 1.2M learnable parameters upon the frozen LLaMA 7B model, and costs less than one hour for fine-tuning on 8 A100 GPUs. Specifically, we adopt a set of learnable adaption prompts, and prepend them to the word tokens at higher transformer layers. Then, a zero-initialized attention mechanism with zero gating is proposed, which adaptively injects the new instructional cues into LLaMA, while effectively preserves its pre-trained knowledge. With our efficient training, LLaMA-Adapter can generate high-quality responses, comparable to Alpaca with fully fine-tuned 7B parameters. Besides language commands, our approach can be simply extended to multi-modal instructions for learning image-conditioned LLaMA model, which achieves superior reasoning performance on ScienceQA and COCO Caption benchmarks. Furthermore, we also evaluate the zero-initialized attention mechanism for fine-tuning other pre-trained models (ViT, RoBERTa) on traditional vision and language tasks, demonstrating the superior generalization capacity of our approach. Code is released at https://github.com/OpenGVLab/LLaMA-Adapter."} | 14 | {"work_id": 4361229539, "title": "LLaMA-Adapter: Efficient Fine-tuning of Language Models with Zero-init Attention", "abstract": "We present LLaMA-Adapter, a lightweight adaption method to efficiently fine-tune LLaMA into an instruction-following model. Using 52K self-instruct demonstrations, LLaMA-Adapter only introduces 1.2M learnable parameters upon the frozen LLaMA 7B model, and costs less than one hour for fine-tuning on 8 A100 GPUs. Specifically, we adopt a set of learnable adaption prompts, and prepend them to the word tokens at higher transformer layers. Then, a zero-initialized attention mechanism with zero gating is proposed, which adaptively injects the new instructional cues into LLaMA, while effectively preserves its pre-trained knowledge. With our efficient training, LLaMA-Adapter can generate high-quality responses, comparable to Alpaca with fully fine-tuned 7B parameters. Besides language commands, our approach can be simply extended to multi-modal instructions for learning image-conditioned LLaMA model, which achieves superior reasoning performance on ScienceQA and COCO Caption benchmarks. Furthermore, we also evaluate the zero-initialized attention mechanism for fine-tuning other pre-trained models (ViT, RoBERTa) on traditional vision and language tasks, demonstrating the superior generalization capacity of our approach. Code is released at https://github.com/OpenGVLab/LLaMA-Adapter."} | ||
| 35 | {"work_id": 57706852, "title": "Stochastic simultaneous optimistic optimization", "abstract": "We study the problem of global maximization of a function f given a finite number of evaluations perturbed by noise. We consider a very weak assumption on the function, namely that it is locally smooth (in some precise sense) with respect to some semi-metric, around one of its global maxima. Compared to previous works on bandits in general spaces (Kleinberg et al., 2008; Bubeck et al., 2011a) our algorithm does not require the knowledge of this semi-metric. Our algorithm, StoSOO, follows an optimistic strategy to iteratively construct upper confidence bounds over the hierarchical partitions of the function domain to decide which point to sample next. A finite-time analysis of StoSOO shows that it performs almost as well as the best specifically-tuned algorithms even though the local smoothness of the function is not known."} | 15 | {"work_id": 57706852, "title": "Stochastic simultaneous optimistic optimization", "abstract": "We study the problem of global maximization of a function f given a finite number of evaluations perturbed by noise. We consider a very weak assumption on the function, namely that it is locally smooth (in some precise sense) with respect to some semi-metric, around one of its global maxima. Compared to previous works on bandits in general spaces (Kleinberg et al., 2008; Bubeck et al., 2011a) our algorithm does not require the knowledge of this semi-metric. Our algorithm, StoSOO, follows an optimistic strategy to iteratively construct upper confidence bounds over the hierarchical partitions of the function domain to decide which point to sample next. A finite-time analysis of StoSOO shows that it performs almost as well as the best specifically-tuned algorithms even though the local smoothness of the function is not known."} | ||
| 16 | +{"work_id": 3141797743, "title": "A Survey on Multi-Task Learning", "abstract": "Multi-Task Learning (MTL) is a learning paradigm in machine learning and its aim is to leverage useful information contained in multiple related tasks to help improve the generalization performance of all the tasks. In this paper, we give a survey for MTL from the perspective of algorithmic modeling, applications and theoretical analyses. For algorithmic modeling, we give a definition of MTL and then classify different MTL algorithms into five categories, including feature learning approach, low-rank approach, task clustering approach, task relation learning approach and decomposition approach as well as discussing the characteristics of each approach. In order to improve the performance of learning tasks further, MTL can be combined with other learning paradigms including semi-supervised learning, active learning, unsupervised learning, reinforcement learning, multi-view learning and graphical models. When the number of tasks is large or the data dimensionality is high, we review online, parallel and distributed MTL models as well as dimensionality reduction and feature hashing to reveal their computational and storage advantages. Many real-world applications use MTL to boost their performance and we review representative works in this paper. Finally, we present theoretical analyses and discuss several future directions for MTL."} | ||||
| 36 | {"work_id": 4317910584, "title": "ChatGPT: Bullshit spewer or the end of traditional assessments in higher education?", "abstract": "ChatGPT is the world\u2019s most advanced chatbot thus far. Unlike other chatbots, it can create impressive prose within seconds, and it has created much hype and doomsday predictions when it comes to student assessment in higher education and a host of other matters. ChatGPT is a state-of-the-art language model (a variant of OpenAI\u2019s Generative Pretrained Transformer (GPT) language model) designed to generate text that can be indistinguishable from text written by humans. It can engage in conversation with users in a seemingly natural and intuitive way. In this article, we briefly tell the story of OpenAI, the organisation behind ChatGPT. We highlight the fundamental change from a not-for-profit organisation to a commercial business model. In terms of our methods, we conducted an extensive literature review and experimented with this artificial intelligence (AI) software. Our literature review shows our review to be amongst the first peer-reviewed academic journal articles to explore ChatGPT and its relevance for higher education (especially assessment, learning and teaching). After a description of ChatGPT\u2019s functionality and a summary of its strengths and limitations, we focus on the technology\u2019s implications for higher education and discuss what is the future of learning, teaching and assessment in higher education in the context of AI chatbots such as ChatGPT. We position ChatGPT in the context of current Artificial Intelligence in Education (AIEd) research, discuss student-facing, teacher-facing and system-facing applications, and analyse opportunities and threats. We conclude the article with recommendations for students, teachers and higher education institutions. Many of them focus on assessment."} | 17 | {"work_id": 4317910584, "title": "ChatGPT: Bullshit spewer or the end of traditional assessments in higher education?", "abstract": "ChatGPT is the world\u2019s most advanced chatbot thus far. Unlike other chatbots, it can create impressive prose within seconds, and it has created much hype and doomsday predictions when it comes to student assessment in higher education and a host of other matters. ChatGPT is a state-of-the-art language model (a variant of OpenAI\u2019s Generative Pretrained Transformer (GPT) language model) designed to generate text that can be indistinguishable from text written by humans. It can engage in conversation with users in a seemingly natural and intuitive way. In this article, we briefly tell the story of OpenAI, the organisation behind ChatGPT. We highlight the fundamental change from a not-for-profit organisation to a commercial business model. In terms of our methods, we conducted an extensive literature review and experimented with this artificial intelligence (AI) software. Our literature review shows our review to be amongst the first peer-reviewed academic journal articles to explore ChatGPT and its relevance for higher education (especially assessment, learning and teaching). After a description of ChatGPT\u2019s functionality and a summary of its strengths and limitations, we focus on the technology\u2019s implications for higher education and discuss what is the future of learning, teaching and assessment in higher education in the context of AI chatbots such as ChatGPT. We position ChatGPT in the context of current Artificial Intelligence in Education (AIEd) research, discuss student-facing, teacher-facing and system-facing applications, and analyse opportunities and threats. We conclude the article with recommendations for students, teachers and higher education institutions. Many of them focus on assessment."} | ||
| 37 | {"work_id": 4393148714, "title": "T2I-Adapter: Learning Adapters to Dig Out More Controllable Ability for Text-to-Image Diffusion Models", "abstract": "The incredible generative ability of large-scale text-to-image (T2I) models has demonstrated strong power of learning complex structures and meaningful semantics. However, relying solely on text prompts cannot fully take advantage of the knowledge learned by the model, especially when flexible and accurate controlling (e.g., structure and color) is needed. In this paper, we aim to ``dig out\" the capabilities that T2I models have implicitly learned, and then explicitly use them to control the generation more granularly. Specifically, we propose to learn low-cost T2I-Adapters to align internal knowledge in T2I models with external control signals, while freezing the original large T2I models. In this way, we can train various adapters according to different conditions, achieving rich control and editing effects in the color and structure of the generation results. Further, the proposed T2I-Adapters have attractive properties of practical value, such as composability and generalization ability. Extensive experiments demonstrate that our T2I-Adapter has promising generation quality and a wide range of applications. Our code is available at https://github.com/TencentARC/T2I-Adapter."} | 18 | {"work_id": 4393148714, "title": "T2I-Adapter: Learning Adapters to Dig Out More Controllable Ability for Text-to-Image Diffusion Models", "abstract": "The incredible generative ability of large-scale text-to-image (T2I) models has demonstrated strong power of learning complex structures and meaningful semantics. However, relying solely on text prompts cannot fully take advantage of the knowledge learned by the model, especially when flexible and accurate controlling (e.g., structure and color) is needed. In this paper, we aim to ``dig out\" the capabilities that T2I models have implicitly learned, and then explicitly use them to control the generation more granularly. Specifically, we propose to learn low-cost T2I-Adapters to align internal knowledge in T2I models with external control signals, while freezing the original large T2I models. In this way, we can train various adapters according to different conditions, achieving rich control and editing effects in the color and structure of the generation results. Further, the proposed T2I-Adapters have attractive properties of practical value, such as composability and generalization ability. Extensive experiments demonstrate that our T2I-Adapter has promising generation quality and a wide range of applications. Our code is available at https://github.com/TencentARC/T2I-Adapter."} | ||
| 38 | {"work_id": 2902907165, "title": "A general reinforcement learning algorithm that masters chess, shogi, and Go through self-play", "abstract": "The game of chess is the longest-studied domain in the history of artificial intelligence. The strongest programs are based on a combination of sophisticated search techniques, domain-specific adaptations, and handcrafted evaluation functions that have been refined by human experts over several decades. By contrast, the AlphaGo Zero program recently achieved superhuman performance in the game of Go by reinforcement learning from self-play. In this paper, we generalize this approach into a single AlphaZero algorithm that can achieve superhuman performance in many challenging games. Starting from random play and given no domain knowledge except the game rules, AlphaZero convincingly defeated a world champion program in the games of chess and shogi (Japanese chess), as well as Go."} | 19 | {"work_id": 2902907165, "title": "A general reinforcement learning algorithm that masters chess, shogi, and Go through self-play", "abstract": "The game of chess is the longest-studied domain in the history of artificial intelligence. The strongest programs are based on a combination of sophisticated search techniques, domain-specific adaptations, and handcrafted evaluation functions that have been refined by human experts over several decades. By contrast, the AlphaGo Zero program recently achieved superhuman performance in the game of Go by reinforcement learning from self-play. In this paper, we generalize this approach into a single AlphaZero algorithm that can achieve superhuman performance in many challenging games. Starting from random play and given no domain knowledge except the game rules, AlphaZero convincingly defeated a world champion program in the games of chess and shogi (Japanese chess), as well as Go."} | ||
| 39 | {"work_id": 7118187240, "title": "Patch Time Series Transformer\u2212Based Short\u2212Term Photovoltaic Power Prediction Enhanced by Artificial Fish", "abstract": "The reliability and economic operation of power systems increasingly depend on renewable energy, making accurate short\u2212term photovoltaic (PV) power prediction essential. Conventional approaches struggle with the nonlinear and stochastic characteristics of PV data. This study proposes an enhanced prediction framework integrating Artificial Fish Swarm Algorithm\u2013Isolation Forest (AFSA\u2013IF) anomaly detection, Generative Adversarial Network\u2212based feature extraction, multimodal data fusion, and a Patch Time Series Transformer (PatchTST) model. The framework includes advanced preprocessing, fusion of meteorological and historical power data, and weather classification via one\u2212hot encoding. Experiments on datasets from six PV plants show significant improvements in mean absolute error, root mean square error, and coefficient of determination compared with Transformer, Reformer, and Informer models. The results confirm the robustness and efficiency of the proposed model, especially under challenging conditions such as rainy weather."} | 20 | {"work_id": 7118187240, "title": "Patch Time Series Transformer\u2212Based Short\u2212Term Photovoltaic Power Prediction Enhanced by Artificial Fish", "abstract": "The reliability and economic operation of power systems increasingly depend on renewable energy, making accurate short\u2212term photovoltaic (PV) power prediction essential. Conventional approaches struggle with the nonlinear and stochastic characteristics of PV data. This study proposes an enhanced prediction framework integrating Artificial Fish Swarm Algorithm\u2013Isolation Forest (AFSA\u2013IF) anomaly detection, Generative Adversarial Network\u2212based feature extraction, multimodal data fusion, and a Patch Time Series Transformer (PatchTST) model. The framework includes advanced preprocessing, fusion of meteorological and historical power data, and weather classification via one\u2212hot encoding. Experiments on datasets from six PV plants show significant improvements in mean absolute error, root mean square error, and coefficient of determination compared with Transformer, Reformer, and Informer models. The results confirm the robustness and efficiency of the proposed model, especially under challenging conditions such as rainy weather."} | ||
| 40 | −{"work_id": 4396821501, "title": "KAN: Kolmogorov-Arnold Networks", "abstract": "Inspired by the Kolmogorov-Arnold representation theorem, we propose Kolmogorov-Arnold Networks (KANs) as promising alternatives to Multi-Layer Perceptrons (MLPs). While MLPs have fixed activation functions on nodes (\"neurons\"), KANs have learnable activation functions on edges (\"weights\"). KANs have no linear weights at all -- every weight parameter is replaced by a univariate function parametrized as a spline. We show that this seemingly simple change makes KANs outperform MLPs in terms of accuracy and interpretability. For accuracy, much smaller KANs can achieve comparable or better accuracy than much larger MLPs in data fitting and PDE solving. Theoretically and empirically, KANs possess faster neural scaling laws than MLPs. For interpretability, KANs can be intuitively visualized and can easily interact with human users. Through two examples in mathematics and physics, KANs are shown to be useful collaborators helping scientists (re)discover mathematical and physical laws. In summary, KANs are promising alternatives for MLPs, opening opportunities for further improving today's deep learning models which rely heavily on MLPs."} | ||||
| 41 | {"work_id": 4288283362, "title": "Spiral Time: A Geometric Reframing of Temporal Structure and Its Applications in Machine Learning", "abstract": "Archimedean spiral in 2D space rather than a scalar on a number line. Under this framework, called Spiral Time, every moment carries both a radial coordinate encoding cumulative progression (trend) and an angular coordinate encoding phase within a recurring cycle (seasonality). This decomposition is geometric and a priori \u2014 it is a property of the time coordinate itself, not a learned or analytical transformation of the target variable. We derive the mathematical structure, demonstrate a controlled 10-experiment LSTM ablation on US Monthly Retail Sales (RSXFS), and show how spiral time embeddings replace standard positional encodings in Transformer architectures with no other architectural changes. Key results: The optimal multi-period spiral time embedding achieves 1.69% MAPE \u2014 outperforming scalar time (9.76%) by 83% and hand-engineered sinusoidal features (4.62%) by 63%. The performance hierarchy is perfectly monotone across all 10 experiments: every geometric addition improves performance with no exceptions. Key finding on normalisation: the radial term contributes only when linear in \u03b8 and z-score normalised. Incorrect normalisation produces results worse than omitting the trend term entirely \u2014 a practically important result for any practitioner adding trend proxies to oscillatory features. The paper covers the single-period and multi-period embedding, connections to Transformer positional encodings, Hawking\u2013Hartle imaginary time, and Kaluza\u2013Klein theory, and surveys applications in forecasting, anomaly detection, battery health modeling, drug dosing, financial cycle modeling, climate science, and neuroscience. Code is open-source and available at: github.com/frankajieh-ship-it/spiral-time"} | 21 | {"work_id": 4288283362, "title": "Spiral Time: A Geometric Reframing of Temporal Structure and Its Applications in Machine Learning", "abstract": "Archimedean spiral in 2D space rather than a scalar on a number line. Under this framework, called Spiral Time, every moment carries both a radial coordinate encoding cumulative progression (trend) and an angular coordinate encoding phase within a recurring cycle (seasonality). This decomposition is geometric and a priori \u2014 it is a property of the time coordinate itself, not a learned or analytical transformation of the target variable. We derive the mathematical structure, demonstrate a controlled 10-experiment LSTM ablation on US Monthly Retail Sales (RSXFS), and show how spiral time embeddings replace standard positional encodings in Transformer architectures with no other architectural changes. Key results: The optimal multi-period spiral time embedding achieves 1.69% MAPE \u2014 outperforming scalar time (9.76%) by 83% and hand-engineered sinusoidal features (4.62%) by 63%. The performance hierarchy is perfectly monotone across all 10 experiments: every geometric addition improves performance with no exceptions. Key finding on normalisation: the radial term contributes only when linear in \u03b8 and z-score normalised. Incorrect normalisation produces results worse than omitting the trend term entirely \u2014 a practically important result for any practitioner adding trend proxies to oscillatory features. The paper covers the single-period and multi-period embedding, connections to Transformer positional encodings, Hawking\u2013Hartle imaginary time, and Kaluza\u2013Klein theory, and surveys applications in forecasting, anomaly detection, battery health modeling, drug dosing, financial cycle modeling, climate science, and neuroscience. Code is open-source and available at: github.com/frankajieh-ship-it/spiral-time"} | ||
| 22 | +{"work_id": 2608595939, "title": "Auto-WEKA: Automatic Model Selection and Hyperparameter Optimization in WEKA", "abstract": "Many different machine learning algorithms exist; taking into account each algorithm\u2019s hyperparameters, there is a staggeringly large number of possible alternatives overall. We consider the problem of simultaneously selecting a learning algorithm and setting its hyperparameters. We show that this problem can be addressed by a fully automated approach, leveraging recent innovations in Bayesian optimization. Specifically, we consider feature selection techniques and all machine learning approaches implemented in WEKA\u2019s standard distribution, spanning 2 ensemble methods, 10 meta-methods, 28 base learners, and hyperparameter settings for each learner. On each of 21 popular datasets from the UCI repository, the KDD Cup 09, variants of the MNIST dataset and CIFAR-10, we show performance often much better than using standard selection and hyperparameter optimization methods. We hope that our approach will help non-expert users to more effectively identify machine learning algorithms and hyperparameter settings appropriate to their applications, and hence to achieve improved performance."} | ||||
| 42 | {"work_id": 4389326242, "title": "Mamba: Linear-Time Sequence Modeling with Selective State Spaces", "abstract": "Foundation models, now powering most of the exciting applications in deep learning, are almost universally based on the Transformer architecture and its core attention module. Many subquadratic-time architectures such as linear attention, gated convolution and recurrent models, and structured state space models (SSMs) have been developed to address Transformers' computational inefficiency on long sequences, but they have not performed as well as attention on important modalities such as language. We identify that a key weakness of such models is their inability to perform content-based reasoning, and make several improvements. First, simply letting the SSM parameters be functions of the input addresses their weakness with discrete modalities, allowing the model to selectively propagate or forget information along the sequence length dimension depending on the current token. Second, even though this change prevents the use of efficient convolutions, we design a hardware-aware parallel algorithm in recurrent mode. We integrate these selective SSMs into a simplified end-to-end neural network architecture without attention or even MLP blocks (Mamba). Mamba enjoys fast inference (5$\\times$ higher throughput than Transformers) and linear scaling in sequence length, and its performance improves on real data up to million-length sequences. As a general sequence model backbone, Mamba achieves state-of-the-art performance across several modalities such as language, audio, and genomics. On language modeling, our Mamba-3B model outperforms Transformers of the same size and matches Transformers twice its size, both in pretraining and downstream evaluation."} | 23 | {"work_id": 4389326242, "title": "Mamba: Linear-Time Sequence Modeling with Selective State Spaces", "abstract": "Foundation models, now powering most of the exciting applications in deep learning, are almost universally based on the Transformer architecture and its core attention module. Many subquadratic-time architectures such as linear attention, gated convolution and recurrent models, and structured state space models (SSMs) have been developed to address Transformers' computational inefficiency on long sequences, but they have not performed as well as attention on important modalities such as language. We identify that a key weakness of such models is their inability to perform content-based reasoning, and make several improvements. First, simply letting the SSM parameters be functions of the input addresses their weakness with discrete modalities, allowing the model to selectively propagate or forget information along the sequence length dimension depending on the current token. Second, even though this change prevents the use of efficient convolutions, we design a hardware-aware parallel algorithm in recurrent mode. We integrate these selective SSMs into a simplified end-to-end neural network architecture without attention or even MLP blocks (Mamba). Mamba enjoys fast inference (5$\\times$ higher throughput than Transformers) and linear scaling in sequence length, and its performance improves on real data up to million-length sequences. As a general sequence model backbone, Mamba achieves state-of-the-art performance across several modalities such as language, audio, and genomics. On language modeling, our Mamba-3B model outperforms Transformers of the same size and matches Transformers twice its size, both in pretraining and downstream evaluation."} | ||
| 43 | {"work_id": 4406152291, "title": "Medical large language models are vulnerable to data-poisoning attacks", "abstract": "The adoption of large language models (LLMs) in healthcare demands a careful analysis of their potential to spread false medical knowledge. Because LLMs ingest massive volumes of data from the open Internet during training, they are potentially exposed to unverified medical knowledge that may include deliberately planted misinformation. Here, we perform a threat assessment that simulates a data-poisoning attack against The Pile, a popular dataset used for LLM development. We find that replacement of just 0.001% of training tokens with medical misinformation results in harmful models more likely to propagate medical errors. Furthermore, we discover that corrupted models match the performance of their corruption-free counterparts on open-source benchmarks routinely used to evaluate medical LLMs. Using biomedical knowledge graphs to screen medical LLM outputs, we propose a harm mitigation strategy that captures 91.9% of harmful content (F1 = 85.7%). Our algorithm provides a unique method to validate stochastically generated LLM outputs against hard-coded relationships in knowledge graphs. In view of current calls for improved data provenance and transparent LLM development, we hope to raise awareness of emergent risks from LLMs trained indiscriminately on web-scraped data, particularly in healthcare where misinformation can potentially compromise patient safety."} | 24 | {"work_id": 4406152291, "title": "Medical large language models are vulnerable to data-poisoning attacks", "abstract": "The adoption of large language models (LLMs) in healthcare demands a careful analysis of their potential to spread false medical knowledge. Because LLMs ingest massive volumes of data from the open Internet during training, they are potentially exposed to unverified medical knowledge that may include deliberately planted misinformation. Here, we perform a threat assessment that simulates a data-poisoning attack against The Pile, a popular dataset used for LLM development. We find that replacement of just 0.001% of training tokens with medical misinformation results in harmful models more likely to propagate medical errors. Furthermore, we discover that corrupted models match the performance of their corruption-free counterparts on open-source benchmarks routinely used to evaluate medical LLMs. Using biomedical knowledge graphs to screen medical LLM outputs, we propose a harm mitigation strategy that captures 91.9% of harmful content (F1 = 85.7%). Our algorithm provides a unique method to validate stochastically generated LLM outputs against hard-coded relationships in knowledge graphs. In view of current calls for improved data provenance and transparent LLM development, we hope to raise awareness of emergent risks from LLMs trained indiscriminately on web-scraped data, particularly in healthcare where misinformation can potentially compromise patient safety."} | ||
| 44 | {"work_id": 2946444988, "title": "Towards Accurate Model Selection in Deep Unsupervised Domain Adaptation", "abstract": "Deep unsupervised domain adaptation (Deep UDA) methods successfully leverage rich labeled data in a source domain to boost the performance on related but unlabeled data in a target domain. However, algorithm comparison is cumbersome in Deep UDA due to the absence of accurate and standardized model selection method, posing an obstacle to further advances in the field. Existing model selection methods for Deep UDA are either highly biased, restricted, unstable, or even controversial (requiring labeled target data). To this end, we propose \\textit{Deep Embedded Validation} (\\textbf{DEV}), which embeds adapted feature representation into the validation procedure to obtain unbiased estimation of the target risk with bounded variance. The variance is further reduced by the technique of control variate. The efficacy of the method has been justified both theoretically and empirically."} | 25 | {"work_id": 2946444988, "title": "Towards Accurate Model Selection in Deep Unsupervised Domain Adaptation", "abstract": "Deep unsupervised domain adaptation (Deep UDA) methods successfully leverage rich labeled data in a source domain to boost the performance on related but unlabeled data in a target domain. However, algorithm comparison is cumbersome in Deep UDA due to the absence of accurate and standardized model selection method, posing an obstacle to further advances in the field. Existing model selection methods for Deep UDA are either highly biased, restricted, unstable, or even controversial (requiring labeled target data). To this end, we propose \\textit{Deep Embedded Validation} (\\textbf{DEV}), which embeds adapted feature representation into the validation procedure to obtain unbiased estimation of the target risk with bounded variance. The variance is further reduced by the technique of control variate. The efficacy of the method has been justified both theoretically and empirically."} | ||
| 26 | +{"work_id": 4401077562, "title": "Factors Influencing University Students\u2019 Behavioral Intention to Use Generative Artificial Intelligence: Integrating the Theory of Planned Behavior and AI Literacy", "abstract": "Generative artificial intelligence (GAI) advancements have ignited new expectations for artificial intelligence (AI)-enabled educational transformations. Based on the theory of planned behavior (TPB), this study combines structural equation modeling and interviews to analyze the influencing factors of Chinese university students\u2019 GAI technology usage intention. Regarding AI literacy, students\u2019 cognitive literacy in AI ethics scored the highest (M = 5.740), while AI awareness literacy scored the lowest (M = 4.578). Students\u2019 attitudes toward GAI significantly and positively influenced their usage intention, with the combined TPB framework and AI literacy explaining 59.3% of the variance. AI literacy and subjective norms positively influenced students\u2019 attitudes toward GAI technology and perceived behavioral control, and attitude mediated the impact of AI literacy and subjective norms on GAI usage intention. Further, the interviews provide new insights for university management and educational leadership regarding the construction of an educational ecosystem under the application of GAI technology."} | ||||
| 27 | +{"work_id": 2889326414, "title": "UMAP: Uniform Manifold Approximation and Projection", "abstract": "Uniform Manifold Approximation and Projection (UMAP) is a dimension reduction technique that can be used for visualisation similarly to t-SNE, but also for general non-linear dimension reduction. UMAP has a rigorous mathematical foundation, but is simple to use, with a scikit-learn compatible API. UMAP is among the fastest manifold learning implementations available -significantly faster than most t-SNE implementations."} | ||||
| 45 | {"work_id": 4367369313, "title": "Prompt Engineering for ChatGPT: A Quick Guide to Techniques, Tips, and Best Practices", "abstract": "In the rapidly evolving landscape of natural language processing (NLP), ChatGPT has emerged as a powerful tool for various industries and applications. To fully harness the potential of ChatGPT, it is crucial to understand and master the art of prompt engineering-the process of designing and refining input prompts to elicit desired responses from an AI NLP model. This article provides a comprehensive guide to mastering prompt engineering techniques, tips, and best practices to achieve optimal outcomes with ChatGPT. The discussion begins with an introduction to ChatGPT and the fundamentals of prompt engineering, followed by an exploration of techniques for effective prompt crafting, such as clarity, explicit constraints, experimentation, and leveraging different types of questions. The article also covers best practices, including iterative refinement, balancing user intent, harnessing external resources, and ensuring ethical usage. Advanced strategies, such as temperature and token control, prompt chaining, domain-specific adaptations, and handling ambiguous inputs, are also addressed. Real-world case studies demonstrate the practical applications of prompt engineering in customer support, content generation, domain-specific knowledge retrieval, and interactive storytelling. The article concludes by highlighting the impact of effective prompt engineering on ChatGPT performance, future research directions, and the importance of fostering creativity and collaboration within the ChatGPT community."} | 28 | {"work_id": 4367369313, "title": "Prompt Engineering for ChatGPT: A Quick Guide to Techniques, Tips, and Best Practices", "abstract": "In the rapidly evolving landscape of natural language processing (NLP), ChatGPT has emerged as a powerful tool for various industries and applications. To fully harness the potential of ChatGPT, it is crucial to understand and master the art of prompt engineering-the process of designing and refining input prompts to elicit desired responses from an AI NLP model. This article provides a comprehensive guide to mastering prompt engineering techniques, tips, and best practices to achieve optimal outcomes with ChatGPT. The discussion begins with an introduction to ChatGPT and the fundamentals of prompt engineering, followed by an exploration of techniques for effective prompt crafting, such as clarity, explicit constraints, experimentation, and leveraging different types of questions. The article also covers best practices, including iterative refinement, balancing user intent, harnessing external resources, and ensuring ethical usage. Advanced strategies, such as temperature and token control, prompt chaining, domain-specific adaptations, and handling ambiguous inputs, are also addressed. Real-world case studies demonstrate the practical applications of prompt engineering in customer support, content generation, domain-specific knowledge retrieval, and interactive storytelling. The article concludes by highlighting the impact of effective prompt engineering on ChatGPT performance, future research directions, and the importance of fostering creativity and collaboration within the ChatGPT community."} | ||
| 46 | {"work_id": 7125233009, "title": "SemCap: Sentiment-aware semantic captioning for multimodal aspect-based sentiment analysis", "abstract": "Multimodal aspect-based sentiment analysis (MABSA) is critical for fine-grained opinion mining from social media. Current mainstream methods rely on feature-level fusion and attention mechanisms to align visual and textual features. However, MABSA suffers from visual noise caused by cluttered image fusion and textual noise caused by inter-aspect interference, leading to modality conflicts and spurious aspect predictions. We propose SemCap, a framework that mitigates these issues using a sentiment-aware caption as an explicit, high-level visual proxy. This caption is generated by Qwen3-VL under sentiment-oriented prompts to selectively describe emotion-bearing entities. To accurately aggregate cross-modal sentiment, we design the Semantic Proxy Dynamic Routing (SPDR) fusion module, which uses the caption representation to guide the selection of relevant visual patches. The refined features are input to a multimodal interactive decoder, augmented by auxiliary supervision on aspect boundaries and polarity labels to enhance localization and discrimination. Extensive experiments on the Twitter-2015 and Twitter-2017 datasets demonstrate SemCap\u2019s superior performance over existing MABSA methods."} | 29 | {"work_id": 7125233009, "title": "SemCap: Sentiment-aware semantic captioning for multimodal aspect-based sentiment analysis", "abstract": "Multimodal aspect-based sentiment analysis (MABSA) is critical for fine-grained opinion mining from social media. Current mainstream methods rely on feature-level fusion and attention mechanisms to align visual and textual features. However, MABSA suffers from visual noise caused by cluttered image fusion and textual noise caused by inter-aspect interference, leading to modality conflicts and spurious aspect predictions. We propose SemCap, a framework that mitigates these issues using a sentiment-aware caption as an explicit, high-level visual proxy. This caption is generated by Qwen3-VL under sentiment-oriented prompts to selectively describe emotion-bearing entities. To accurately aggregate cross-modal sentiment, we design the Semantic Proxy Dynamic Routing (SPDR) fusion module, which uses the caption representation to guide the selection of relevant visual patches. The refined features are input to a multimodal interactive decoder, augmented by auxiliary supervision on aspect boundaries and polarity labels to enhance localization and discrimination. Extensive experiments on the Twitter-2015 and Twitter-2017 datasets demonstrate SemCap\u2019s superior performance over existing MABSA methods."} | ||
| 47 | −{"work_id": 2963923407, "title": "Addressing Function Approximation Error in Actor-Critic Methods", "abstract": "In value-based reinforcement learning methods such as deep Q-learning, function approximation errors are known to lead to overestimated value estimates and suboptimal policies. We show that this problem persists in an actor-critic setting and propose novel mechanisms to minimize its effects on both the actor and the critic. Our algorithm builds on Double Q-learning, by taking the minimum value between a pair of critics to limit overestimation. We draw the connection between target networks and overestimation bias, and suggest delaying policy updates to reduce per-update error and further improve performance. We evaluate our method on the suite of OpenAI gym tasks, outperforming the state of the art in every environment tested."} | 30 | +{"work_id": 2962776659, "title": "Fine-grained Analysis of Sentence Embeddings Using Auxiliary Prediction Tasks", "abstract": "There is a lot of research interest in encoding variable length sentences into fixed length vectors, in a way that preserves the sentence meanings. Two common methods include representations based on averaging word vectors, and representations based on the hidden states of recurrent neural networks such as LSTMs. The sentence vectors are used as features for subsequent machine learning tasks or for pre-training in the context of deep learning. However, not much is known about the properties that are encoded in these sentence representations and about the language information they capture. We propose a framework that facilitates better understanding of the encoded representations. We define prediction tasks around isolated aspects of sentence structure (namely sentence length, word content, and word order), and score representations by the ability to train a classifier to solve each prediction task when using the representation as input. We demonstrate the potential contribution of the approach by analyzing different sentence representation mechanisms. The analysis sheds light on the relative strengths of different sentence embedding methods with respect to these low level prediction tasks, and on the effect of the encoded vector's dimensionality on the resulting representations."} | ||
| 48 | −{"work_id": 3152893301, "title": "Graph neural networks: A review of methods and applications", "abstract": "Lots of learning tasks require dealing with graph data which contains rich relation information among elements. Modeling physics systems, learning molecular fingerprints, predicting protein interface, and classifying diseases demand a model to learn from graph inputs. In other domains such as learning from non-structural data like texts and images, reasoning on extracted structures (like the dependency trees of sentences and the scene graphs of images) is an important research topic which also needs graph reasoning models. Graph neural networks (GNNs) are neural models that capture the dependence of graphs via message passing between the nodes of graphs. In recent years, variants of GNNs such as graph convolutional network (GCN), graph attention network (GAT), graph recurrent network (GRN) have demonstrated ground-breaking performances on many deep learning tasks. In this survey, we propose a general design pipeline for GNN models and discuss the variants of each component, systematically categorize the applications, and propose four open problems for future research."} | 31 | +{"work_id": 4407570917, "title": "AgentSociety: Large-scale simulation of LLM-driven generative agents advances understanding of human behaviors and society", "abstract": "Abstract Understanding human behavior and society is a central focus in social sciences, with the rise of generative social science marking a significant paradigmatic shift. By leveraging bottom-up simulations, it replaces costly and logistically challenging traditional experiments with scalable, replicable, and systematic computational approaches for studying complex social dynamics. Recent advances in large language models (LLMs) have further transformed this research paradigm, enabling the creation of human-like generative social agents and realistic simulacra of society. In this paper, we propose AgentSociety, a large-scale social simulator that integrates LLM-driven agents, a realistic societal environment, and a powerful large-scale simulation engine. Based on the proposed simulator, we generate social lives for over 10k agents, simulating their 5 million interactions both among agents and between agents and their environment. Furthermore, we explore the potential of AgentSociety as a testbed for computational social experiments, focusing on five key social issues: polarization, the spread of inflammatory messages, the effects of universal basic income policies, the impact of external shocks such as hurricanes, and urban sustainability. These five issues serve as valuable cases for assessing AgentSociety\u2019s support for typical research methods \u2013 such as surveys, interviews, and interventions \u2013 as well as for investigating the patterns, causes, and underlying mechanisms of social issues. The alignment between AgentSociety\u2019s outcomes and real-world experimental results not only demonstrates its ability to capture human behaviors and their underlying mechanisms, but also underscores its potential as an important platform for social scientists and policymakers."} | ||
| 49 | −{"work_id": 7123342962, "title": "Structure-Preserving Frequency-Regularized Text-Guided Optimal Transport for Unpaired Rain Streaks and Raindrops Removal", "abstract": "The removal of rain streaks and raindrops is crucial for enhancing the image visibility and mitigating the weather degradations. However, most existing approaches rely on the paired rainy and clean images, which are challenging to obtain in real-world scenarios. To this end, we propose a novel structure-preserving frequency-regularized text-guided optimal transport (SFTOT) framework, which formulates the unpaired rain streaks and raindrops removal as an optimal transport problem. Specifically, we introduce a structure-preserving transport cost, incorporating the structural similarity constraint to minimize the duality gap between the primal and dual formulations, while preserving the structural details of reconstructed images. Furthermore, by embedding the inherent frequency sparsity of rain streaks and raindrops into the transport cost, we derive a frequency-regularized optimal transport objective, ensuring consistency in frequency distributions between the generated and clean images. Additionally, we employ a pre-trained one-step stable diffusion model as the restoration network, which is fine-tuned using the low-rank adaptation (LoRA) adapters and zero convolutional layers, while integrating the domain-specific text prompts for both degraded and clean images to guide the generation process. Extensive experiments demonstrate that our method surpasses the existing well-performing unpaired learning approaches, achieving notable improvements in both the fidelity and photo-realism."} | 32 | +{"work_id": 4393065402, "title": "A survey on large language model based autonomous agents", "abstract": "Abstract Autonomous agents have long been a research focus in academic and industry communities. Previous research often focuses on training agents with limited knowledge within isolated environments, which diverges significantly from human learning processes, and makes the agents hard to achieve human-like decisions. Recently, through the acquisition of vast amounts of Web knowledge, large language models (LLMs) have shown potential in human-level intelligence, leading to a surge in research on LLM-based autonomous agents. In this paper, we present a comprehensive survey of these studies, delivering a systematic review of LLM-based autonomous agents from a holistic perspective. We first discuss the construction of LLM-based autonomous agents, proposing a unified framework that encompasses much of previous work. Then, we present a overview of the diverse applications of LLM-based autonomous agents in social science, natural science, and engineering. Finally, we delve into the evaluation strategies commonly used for LLM-based autonomous agents. Based on the previous studies, we also present several challenges and future directions in this field."} | ||
| 50 | −{"work_id": 2619383789, "title": "Multimodal Machine Learning: A Survey and Taxonomy", "abstract": "Our experience of the world is multimodal - we see objects, hear sounds, feel texture, smell odors, and taste flavors. Modality refers to the way in which something happens or is experienced and a research problem is characterized as multimodal when it includes multiple such modalities. In order for Artificial Intelligence to make progress in understanding the world around us, it needs to be able to interpret such multimodal signals together. Multimodal machine learning aims to build models that can process and relate information from multiple modalities. It is a vibrant multi-disciplinary field of increasing importance and with extraordinary potential. Instead of focusing on specific multimodal applications, this paper surveys the recent advances in multimodal machine learning itself and presents them in a common taxonomy. We go beyond the typical early and late fusion categorization and identify broader challenges that are faced by multimodal machine learning, namely: representation, translation, alignment, fusion, and co-learning. This new taxonomy will enable researchers to better understand the state of the field and identify directions for future research."} | 33 | +{"work_id": 3133702157, "title": "On the Dangers of Stochastic Parrots", "abstract": "The past 3 years of work in NLP have been characterized by the development and deployment of ever larger language models, especially for English. BERT, its variants, GPT-2/3, and others, most recently Switch-C, have pushed the boundaries of the possible both through architectural innovations and through sheer size. Using these pretrained models and the methodology of fine-tuning them for specific tasks, researchers have extended the state of the art on a wide array of tasks as measured by leaderboards on specific benchmarks for English. In this paper, we take a step back and ask: How big is too big? What are the possible risks associated with this technology and what paths are available for mitigating those risks? We provide recommendations including weighing the environmental and financial costs first, investing resources into curating and carefully documenting datasets rather than ingesting everything on the web, carrying out pre-development exercises evaluating how the planned approach fits into research and development goals and supports stakeholder values, and encouraging research directions beyond ever larger language models."} | ||
| 51 | −{"work_id": 3096831136, "title": "Generative adversarial networks", "abstract": "Generative adversarial networks are a kind of artificial intelligence algorithm designed to solve the generative modeling problem. The goal of a generative model is to study a collection of training examples and learn the probability distribution that generated them. Generative Adversarial Networks (GANs) are then able to generate more examples from the estimated probability distribution. Generative models based on deep learning are common, but GANs are among the most successful generative models (especially in terms of their ability to generate realistic high-resolution images). GANs have been successfully applied to a wide variety of tasks (mostly in research settings) but continue to present unique challenges and research opportunities because they are based on game theory while most other approaches to generative modeling are based on optimization."} | 34 | +{"work_id": 4399790131, "title": "The effects of over-reliance on AI dialogue systems on students' cognitive abilities: a systematic review", "abstract": "Abstract The growing integration of artificial intelligence (AI) dialogue systems within educational and research settings highlights the importance of learning aids. Despite examination of the ethical concerns associated with these technologies, there is a noticeable gap in investigations on how these ethical issues of AI contribute to students\u2019 over-reliance on AI dialogue systems, and how such over-reliance affects students\u2019 cognitive abilities. Overreliance on AI occurs when users accept AI-generated recommendations without question, leading to errors in task performance in the context of decision-making. This typically arises when individuals struggle to assess the reliability of AI or how much trust to place in its suggestions. This systematic review investigates how students\u2019 over-reliance on AI dialogue systems, particularly those embedded with generative models for academic research and learning, affects their critical cognitive capabilities including decision-making, critical thinking, and analytical reasoning. By using the Preferred Reporting Items for Systematic Reviews and Meta-Analyses (PRISMA) guidelines, our systematic review evaluated a body of literature addressing the contributing factors and effects of such over-reliance within educational and research contexts. The comprehensive literature review spanned 14 articles retrieved from four distinguished databases: ProQuest, IEEE Xplore, ScienceDirect, and Web of Science. Our findings indicate that over-reliance stemming from ethical issues of AI impacts cognitive abilities, as individuals increasingly favor fast and optimal solutions over slow ones constrained by practicality. This tendency explains why users prefer efficient cognitive shortcuts, or heuristics, even amidst the ethical issues presented by AI technologies."} | ||
| 52 | −{"work_id": 4384464487, "title": "Students\u2019 voices on generative AI: perceptions, benefits, and challenges in higher education", "abstract": "Abstract This study explores university students\u2019 perceptions of generative AI (GenAI) technologies, such as ChatGPT, in higher education, focusing on familiarity, their willingness to engage, potential benefits and challenges, and effective integration. A survey of 399 undergraduate and postgraduate students from various disciplines in Hong Kong revealed a generally positive attitude towards GenAI in teaching and learning. Students recognized the potential for personalized learning support, writing and brainstorming assistance, and research and analysis capabilities. However, concerns about accuracy, privacy, ethical issues, and the impact on personal development, career prospects, and societal values were also expressed. According to John Biggs\u2019 3P model, student perceptions significantly influence learning approaches and outcomes. By understanding students\u2019 perceptions, educators and policymakers can tailor GenAI technologies to address needs and concerns while promoting effective learning outcomes. Insights from this study can inform policy development around the integration of GenAI technologies into higher education. By understanding students\u2019 perceptions and addressing their concerns, policymakers can create well-informed guidelines and strategies for the responsible and effective implementation of GenAI tools, ultimately enhancing teaching and learning experiences in higher education."} | 35 | +{"work_id": 4406472463, "title": "A generative model for inorganic materials design", "abstract": "Abstract The design of functional materials with desired properties is essential in driving technological advances in areas such as energy storage, catalysis and carbon capture 1\u20133 . Generative models accelerate materials design by directly generating new materials given desired property constraints, but current methods have a low success rate in proposing stable crystals or can satisfy only a limited set of property constraints 4\u201311 . Here we present MatterGen, a model that generates stable, diverse inorganic materials across the periodic table and can further be fine-tuned to steer the generation towards a broad range of property constraints. Compared with previous generative models 4,12 , structures produced by MatterGen are more than twice as likely to be new and stable, and more than ten times closer to the local energy minimum. After fine-tuning, MatterGen successfully generates stable, new materials with desired chemistry, symmetry and mechanical, electronic and magnetic properties. As a proof of concept, we synthesize one of the generated structures and measure its property value to be within 20% of our target. We believe that the quality of generated materials and the breadth of abilities of MatterGen represent an important advancement towards creating a foundational generative model for materials design."} | ||
| 53 | −{"work_id": 4385763767, "title": "Transformers in Time Series: A Survey", "abstract": "Transformers have achieved superior performances in many tasks in natural language processing and computer vision, which also triggered great interest in the time series community. Among multiple advantages of Transformers, the ability to capture long-range dependencies and interactions is especially attractive for time series modeling, leading to exciting progress in various time series applications. In this paper, we systematically review Transformer schemes for time series modeling by highlighting their strengths as well as limitations. In particular, we examine the development of time series Transformers in two perspectives. From the perspective of network structure, we summarize the adaptations and modifications that have been made to Transformers in order to accommodate the challenges in time series analysis. From the perspective of applications, we categorize time series Transformers based on common tasks including forecasting, anomaly detection, and classification. Empirically, we perform robust analysis, model size analysis, and seasonal-trend decomposition analysis to study how Transformers perform in time series. Finally, we discuss and suggest future directions to provide useful research guidance."} | 36 | +{"work_id": 2804078698, "title": "Self-Attention Generative Adversarial Networks", "abstract": "In this paper, we propose the Self-Attention Generative Adversarial Network (SAGAN) which allows attention-driven, long-range dependency modeling for image generation tasks. Traditional convolutional GANs generate high-resolution details as a function of only spatially local points in lower-resolution feature maps. In SAGAN, details can be generated using cues from all feature locations. Moreover, the discriminator can check that highly detailed features in distant portions of the image are consistent with each other. Furthermore, recent work has shown that generator conditioning affects GAN performance. Leveraging this insight, we apply spectral normalization to the GAN generator and find that this improves training dynamics. The proposed SAGAN achieves the state-of-the-art results, boosting the best published Inception score from 36.8 to 52.52 and reducing Frechet Inception distance from 27.62 to 18.65 on the challenging ImageNet dataset. Visualization of the attention layers shows that the generator leverages neighborhoods that correspond to object shapes rather than local regions of fixed shape."} | ||
| 54 | −{"work_id": 7124432017, "title": "Human-Centric Artificial Intelligence Pedagogy (HCAP) framework developed from TPACK through integration of artificial intelligence literacy and competency", "abstract": "The rise of artificial intelligence (AI) in education, particularly generative AI, challenges the sufficiency of the established Technological Pedagogical Content Knowledge (TPACK) framework. AI\u2019s agentic autonomy, epistemic complexities, and ethical dimensions necessitate an evolved model. This study investigates the newly proposed Intelligent-TPACK (I-TPACK) framework, designed to address these gaps by integrating five knowledge domains: AI-Technological, AI-Content, AI-Pedagogical, Human-AI Collaborative, and Ethical Knowledge. The research goal was to define the specific knowledge and skills required within these I-TPACK domains from a teacher's perspective. Utilizing a three-round Delphi method, a panel of 30 teachers from diverse subjects developed a consensus list of essential competencies. The findings identified and refined 25 critical knowledge items, providing a foundational and empirically grounded model for the I-TPACK framework. These findings offer a concrete roadmap for teacher education, translating a theoretical model into actionable competencies. This study equips educators to transition from merely using AI to strategically orchestrating human-AI collaborative learning, ensuring they can harness AI's potential ethically, critically, and productively. The I-TPACK and its suggested knowledge serve as a vital tool for developing future-ready teacher training programs and professional development."} | 37 | +{"work_id": 4399982941, "title": "Value engineering for autonomous agents", "abstract": "(English) The topic of this thesis is the engineering of values for autonomous agents. This is realised through the formulation, design and implementation of new functionalities for autonomous agents that enable reasoning in terms of values. In particular, we argue for the role of prescriptive norms as value-promoting mechanisms. Hence, value-driven agents should be able to autonomously determine which regulations (such as obligations, permissions or prohibitions) make the Multiagent System they inhabit better promote some values of interest. We lay the foundations of our work on Schwartz\u2019s Theory of Basic Human Values to establish a consequential connection between values and norms, considering that norms are aligned with respect to values if the outcomes they incentivise satisfy the goals that capture the meaning of values in a particular context. Another feature of Schwartz\u2019s theory that has been previously overlooked in the literature is the strong social dimension of values. That is, agents should be able to reason not just in terms of their own, but also of the values of others in their community. This points to Theory of Mind (i.e. the cognitive ability to perceive, interpret and reason about others in terms of their mental states) as an outstanding component of value-based reasoning. This thesis is structured around three main contributions (published in journal papers) plus their integration. The first contribution establishes the normvalue relationship as a consequential one in nature, and proposes a methodology for the automated synthesis and analysis of optimally value-aligned normative systems. The second contribution tackles the limitations of the first, and defines the Action Situation Language to systematically express a wide range of rules that may be implemented in a Multiagent System. This language is complemented by a game engine that automatically interprets interaction descriptions and builds their semantics as Extensive Form Games, which are later analysed with standard game-theoretical tools. This leads to a distribution over game outcomes, which are evaluated in terms of their desirability with respect to values. The third contribution introduces Theory of Mind-related functionalities into an existing Belief-Desire-Intention agent architecture, and combines them with abductive reasoning capabilities. The three contributions are integrated in a novel functionality that enables agents to reason about prescriptive norms in terms of dynamic values. This means that an autonomous agent can, at runtime, switch its value perspective to the one it estimates that another agent has. Such perspective-dependent value-based normative reasoning functionality, with its inherent social orientation, constitutes a novel contribution to the community of values for autonomous agents and paves the way for possible applications such as value-based negotiation over normative systems. In summary, value engineering is a principled and systematic approach to computational ethics, which provides an innovative tool set for integrating ethical values into the design of autonomous agents. (Catal\u00e0) El tema d\u2019aquesta tesi \u00e9s l\u2019enginyeria de valors per a agents aut\u00f2noms, aconseguida mitjan\u00e7ant la formulaci\u00f3, disseny i implementaci\u00f3 de noves funcionalitats que permeten a agents aut\u00f2noms raonar en termes de valors. En particular, defensem el paper de les normes prescriptives com a mecanismes de promoci\u00f3 de valors. Aleshores, els agents impulsats per valors deuen poder determinar de forma aut\u00f2noma quines regulacions (com ara obligacions, permisos o prohibicions) promouen millor alguns valors d\u2019inter\u00e8s en el Sistema Multiagent que habiten. Fonamentem el nostre treball a la Teoria de Schwartz de Valors Humans B\u00e0sics per establir una connexi\u00f3 entre valors i normes basada en conseq\u00fc\u00e8ncies, considerant que les normes estan alineades respecte als valors si els resultats que incentiven satisfan les metes que capten el significat d\u2019aquests valors en un context determinat. Una altra caracter\u00edstica de la teoria de Schwartz que ha estat passada per alt pr\u00e8viament a la literatura \u00e9s la forta dimensi\u00f3 social dels valors. \u00c9s a dir, els agents haurien de poder raonar, no nom\u00e9s en termes dels seus propis valors, sin\u00f3 tamb\u00e9 dels d\u2019altres a la seva comunitat. Aix\u00f2 apunta a la Teoria de la Ment (\u00e9s a dir, la capacitat cognitiva de percebre, interpretar i raonar sobre els altres en termes dels seus estats mentals) com un component destacat del raonament basat en valors. Aquesta tesi s\u2019estructura al voltant de tres contribucions principals (publicades en revistes acad\u00e8miques), a m\u00e9s de la seva integraci\u00f3. La primera contribuci\u00f3 estableix la relaci\u00f3 entre normes i valors mitjan\u00e7ant conseq\u00fc\u00e8ncies, i proposa una metodologia per a la s\u00edntesi i an\u00e0lisi automatitzada de sistemes normatius \u00f2ptimament alineats amb valors. La segona contribuci\u00f3 aborda les limitacions de la primera, i defineix l\u2019Action Situation Language per expressar sistem\u00e0ticament una \u00e0mplia gamma de regles que es poden implementar en un Sistema Multiagent. Aquest llenguatge es complementa amb un int\u00e8rpret que processa autom\u00e0ticament la descripci\u00f3 de la interacci\u00f3 i construeix la seva sem\u00e0ntica com un joc en forma estesa, que despr\u00e9s \u00e9s analitzat amb eines est\u00e0ndards de teoria de jocs. Aix\u00f2 condueix a una distribuci\u00f3 sobre estats finals del joc, que s\u2019avaluen en termes de la seva conveni\u00e8ncia respecte a certs valors. La tercera contribuci\u00f3 presenta funcionalitats relacionades amb la Teoria de la Ment, integrant-les a l\u2019arquitectura Belief-Desire-Intention existent i combinant-les amb raonament abductiu. Les tres contribucions s\u2019'integren en una nova funcionalitat que permet a agents aut\u00f2noms raonar sobre normes prescriptives en termes de valors din\u00e0mics. Aix\u00f2 vol dir que un agent aut\u00f2nom pot, durant la seva execuci\u00f3, canviar la seva perspectiva de valors a la que estima que t\u00e9 un altre agent. Aquest enfocament, basat en valors i amb una orientaci\u00f3 social inherent, constitueix una contribuci\u00f3 nova a la investigaci\u00f3 de valors per a agents aut\u00f2noms i aplana el cam\u00ed a possibles aplicacions com la negociaci\u00f3 autom\u00e0tica sobre sistemes normatius basada en valors. En resum, l\u2019'enginyeria de valors \u00e9s un enfocament sistem\u00e0tic i de principis a l\u2019'\u00e8tica computacional, que proporciona un conjunt d\u2019'eines innovadores per integrar valors \u00e8tics al disseny d\u2019'agents aut\u00f2noms."} | ||
| 38 | +{"work_id": 7123365826, "title": "Event-Triggered Zero-Sum Game for Input Saturated Nonlinear Systems With State Constraints", "abstract": "In safety-critical applications, saturated nonlinear systems often face significant control challenges due to the simultaneous presence of strict state constraints, input saturation, and uncertain external disturbances. To address these challenges, this paper proposes a novel event-triggered optimal control (ETOC) method. The core of our approach lies in a unified framework that handles all three issues simultaneously. We first introduce a smooth mapping function to transform the original system with state constraints into an equivalent unconstrained system. Subsequently, the control problem is formulated as a two-player zero-sum game (ZSG), where one player is the controller designed to handle input saturation and the other is the worst-case external disturbance. This unified formulation ensures that the system strictly adheres to the state constraints. Unlike traditional methods that typically require formulating and solving complex modified event-triggered Hamilton-Jacobi-Bellman (HJB) equations incorporating triggering errors, our approach approximates the optimal policy for the transformed system and implements it via an event-triggered mechanism. By utilizing a single-critic neural network (NN) and incorporating an experience replay mechanism, the algorithm\u2019s learning stability is enhanced, and the restrictive persistence of excitation (PE) condition is relaxed. Theoretical analysis and simulations confirm that our ETOC strategy guarantees optimal performance, strict adherence to state constraints, and a significant reduction in communication burden, showcasing its efficiency and practicality."} | ||||
| 39 | +{"work_id": 4378505261, "title": "Voyager: An Open-Ended Embodied Agent with Large Language Models", "abstract": "We introduce Voyager, the first LLM-powered embodied lifelong learning agent in Minecraft that continuously explores the world, acquires diverse skills, and makes novel discoveries without human intervention. Voyager consists of three key components: 1) an automatic curriculum that maximizes exploration, 2) an ever-growing skill library of executable code for storing and retrieving complex behaviors, and 3) a new iterative prompting mechanism that incorporates environment feedback, execution errors, and self-verification for program improvement. Voyager interacts with GPT-4 via blackbox queries, which bypasses the need for model parameter fine-tuning. The skills developed by Voyager are temporally extended, interpretable, and compositional, which compounds the agent's abilities rapidly and alleviates catastrophic forgetting. Empirically, Voyager shows strong in-context lifelong learning capability and exhibits exceptional proficiency in playing Minecraft. It obtains 3.3x more unique items, travels 2.3x longer distances, and unlocks key tech tree milestones up to 15.3x faster than prior SOTA. Voyager is able to utilize the learned skill library in a new Minecraft world to solve novel tasks from scratch, while other techniques struggle to generalize. We open-source our full codebase and prompts at https://voyager.minedojo.org/."} | ||||
| 40 | +{"work_id": 4411099958, "title": "A multimodal vision foundation model for clinical dermatology", "abstract": "Diagnosing and treating skin diseases require advanced visual skills across domains and the ability to synthesize information from multiple imaging modalities. While current deep learning models excel at specific tasks such as skin cancer diagnosis from dermoscopic images, they struggle to meet the complex, multimodal requirements of clinical practice. Here we introduce PanDerm, a multimodal dermatology foundation model pretrained through self-supervised learning on over 2 million real-world skin disease images from 11 clinical institutions across 4 imaging modalities. We evaluated PanDerm on 28 diverse benchmarks, including skin cancer screening, risk stratification, differential diagnosis of common and rare skin conditions, lesion segmentation, longitudinal monitoring, and metastasis prediction and prognosis. PanDerm achieved state-of-the-art performance across all evaluated tasks, often outperforming existing models when using only 10% of labeled data. We conducted three reader studies to assess PanDerm's potential clinical utility. PanDerm outperformed clinicians by 10.2% in early-stage melanoma detection through longitudinal analysis, improved clinicians' skin cancer diagnostic accuracy by 11% on dermoscopy images and enhanced nondermatologist healthcare providers' differential diagnosis by 16.5% across 128 skin conditions on clinical photographs. These results show PanDerm's potential to improve patient care across diverse clinical scenarios and serve as a model for developing multimodal foundation models in other medical specialties, potentially accelerating the integration of artificial intelligence support in healthcare."} | ||||
| 41 | +{"work_id": 4383312437, "title": "A comprehensive AI policy education framework for university teaching and learning", "abstract": "Abstract This study aims to develop an AI education policy for higher education by examining the perceptions and implications of text generative AI technologies. Data was collected from 457 students and 180 teachers and staff across various disciplines in Hong Kong universities, using both quantitative and qualitative research methods. Based on the findings, the study proposes an AI Ecological Education Policy Framework to address the multifaceted implications of AI integration in university teaching and learning. This framework is organized into three dimensions: Pedagogical, Governance, and Operational. The Pedagogical dimension concentrates on using AI to improve teaching and learning outcomes, while the Governance dimension tackles issues related to privacy, security, and accountability. The Operational dimension addresses matters concerning infrastructure and training. The framework fosters a nuanced understanding of the implications of AI integration in academic settings, ensuring that stakeholders are aware of their responsibilities and can take appropriate actions accordingly."} | ||||
| 42 | +{"work_id": 7138474371, "title": "OpenDriveVLA: Towards End-to-end Autonomous Driving with Large Vision Language Action Model", "abstract": "We present OpenDriveVLA, a Vision-Language Action (VLA) model designed for end-to-end autonomous driving, built upon open-source large language models. OpenDriveVLA generates spatially-grounded driving actions by leveraging multimodal inputs, including both 2D and 3D instance-aware visual representations, ego vehicle states, and language commands. To bridge the modality gap between driving visual representations and language embeddings, we introduce a hierarchical vision-language alignment process, projecting both 2D and 3D structured visual tokens into a unified semantic space. Furthermore, we incorporate structured agent\u2013environment\u2013ego interaction modeling into the autoregressive decoding process, enabling the model to capture fine-grained spatial dependencies and behavior-aware dynamics critical for reliable trajectory planning. Extensive experiments on the nuScenes dataset demonstrate that OpenDriveVLA achieves state-of-the-art results across open-loop trajectory planning and driving-related question-answering tasks. Qualitative analyses further illustrate its superior capability to follow high-level driving commands and robustly generate trajectories under challenging scenarios, highlighting its potential for next-generation end-to-end autonomous driving."} | ||||
| 43 | +{"work_id": 4411932262, "title": "A foundation model to predict and capture human cognition", "abstract": ". A first step towards such a theory is to create a computational model that can predict human behaviour in a wide range of settings. Here we introduce Centaur, a computational model that can predict and simulate human behaviour in any experiment expressible in natural language. We derived Centaur by fine-tuning a state-of-the-art language model on a large-scale dataset called Psych-101. Psych-101 has an unprecedented scale, covering trial-by-trial data from more than 60,000 participants performing in excess of 10,000,000 choices in 160 experiments. Centaur not only captures the behaviour of held-out participants better than existing cognitive models, but it also generalizes to previously unseen cover stories, structural task modifications and entirely new domains. Furthermore, the model's internal representations become more aligned with human neural activity after fine-tuning. Taken together, our results demonstrate that it is possible to discover computational models that capture human behaviour across a wide range of domains. We believe that such models provide tremendous potential for guiding the development of cognitive theories, and we present a case study to demonstrate this."} | ||||
| 44 | +{"work_id": 7130596601, "title": "Human in the loop artificial intelligence in healthcare: applications, outcomes, and implementation challenges", "abstract": "BACKGROUND: The integration of artificial intelligence in healthcare has transformed clinical practice and research methodologies. However, concerns regarding algorithmic accountability, interpretability, and safety have necessitated human oversight in AI systems. Human in the loop artificial intelligence represents a collaborative paradigm where human expertise and machine intelligence converge to enhance decision making while maintaining ethical standards and clinical safety. AIM: This review synthesizes current evidence on human in the loop AI in healthcare delivery and research, examining implementation frameworks, clinical outcomes, comparative advantages over fully automated and clinician-only approaches, and challenges. METHOD: A comprehensive narrative review was conducted using PubMed, Scopus, Web of Science, and IEEE Xplore databases covering studies from 2018 to 2025. Data were thematically synthesized to identify patterns, frameworks, and outcomes. This narrative approach enables comprehensive conceptual synthesis across diverse HITL-AI applications and contexts. RESULTS: Human in the loop AI demonstrates significant applications across diagnostic imaging, clinical decision support, patient monitoring, drug discovery, and research data analysis. Evidence indicates improved diagnostic accuracy, reduced medical errors, enhanced patient safety, and increased clinician trust compared to both automated AI and traditional approaches. Implementation requires EHR interoperability, clear liability frameworks, adaptive training protocols, and quantum-safe cryptographic security. Challenges include workflow integration, regulatory gaps for adaptive systems, and sustainability concerns. CONCLUSION: This review advances the field by synthesizing cross-domain implementation patterns, mapping collaboration models to risk-stratified contexts, identifying regulatory gaps for adaptive systems, and proposing future directions including post-quantum cryptographic integration, AI-driven adaptive architectures, and multi-center scalability frameworks for optimizing human-machine collaboration in healthcare."} | ||||
| 45 | +{"work_id": 4406170795, "title": "Accurate predictions on small data with a tabular foundation model", "abstract": "Abstract Tabular data, spreadsheets organized in rows and columns, are ubiquitous across scientific fields, from biomedicine to particle physics to economics and climate science 1,2 . The fundamental prediction task of filling in missing values of a label column based on the rest of the columns is essential for various applications as diverse as biomedical risk models, drug discovery and materials science. Although deep learning has revolutionized learning from raw data and led to numerous high-profile success stories 3\u20135 , gradient-boosted decision trees 6\u20139 have dominated tabular data for the past 20 years. Here we present the Tabular Prior-data Fitted Network (TabPFN), a tabular foundation model that outperforms all previous methods on datasets with up to 10,000 samples by a wide margin, using substantially less training time. In 2.8 s, TabPFN outperforms an ensemble of the strongest baselines tuned for 4 h in a classification setting. As a generative transformer-based foundation model, this model also allows fine-tuning, data generation, density estimation and learning reusable embeddings. TabPFN is a learning algorithm that is itself learned across millions of synthetic datasets, demonstrating the power of this approach for algorithm development. By improving modelling abilities across diverse fields, TabPFN has the potential to accelerate scientific discovery and enhance important decision-making in various domains."} | ||||
| 46 | +{"work_id": 7143512276, "title": "Multimodal Machine Learning Approaches in Predictive Healthcare Analytics: A Comprehensive Survey", "abstract": "This survey explores the application of multimodal machine learning techniques in predictive healthcare analytics. By integrating various data modalities, such as medical imaging, clinical text, time-series signals, and structured tabular data, these approaches aim to emulate clinical reasoning and enhance diagnostic and prognostic accuracy. Across studies, multimodal ML consistently outperformed unimodal baselines, with intermediate fusion employed in 60% of cases and achieving average AUC improvements of 5\u201312% over single-modality models. Oncology and neurology emerged as the leading domains, where combining imaging with genomic and cognitive data significantly improved cancer survival and Alzheimer\u2019s detection. Despite progress, key challenges persist, including modality misalignment (23%), missing data (18%), and limited external validation (12%). Recent trends highlight transformer-based cross-modal attention, self-supervised learning for data-scarce settings, and hybrid fusion architectures in critical care. While multimodal ML offers clear clinical advantages, regulatory constraints and interoperability gaps continue to hinder deployment. This survey contributes to the existing literature by providing a comprehensive synthesis of multimodal ML applications across healthcare domains. It documents comparative fusion strategies, modelling approaches, and empirical performance outcomes. The paper\u2019s primary contribution lies in identifying intermediate fusion as the most effective integration strategy and revealing systematic gaps in external validation and model transparency that must be addressed for clinically trustworthy multimodal systems."} | ||||
| 47 | +{"work_id": 4389473504, "title": "TRUST-REGION BASED POLICY OPTIMIZATION FOR EFFICIENT REINFORCEMENT LEARNING", "abstract": "Reinforcement Learning (RL) has achieved remarkable success in solving complicated control and sequential decision-making tasks in recent years, such as board games, video games, robot control, dynamic energy management, and autonomous driving. In these tasks, RL has demonstrated unprecedented adaptability and self-learning capability in unknown and stochastic environments. However, existing RL algorithms still have significant disadvantages and shortcomings compared to human intelligence, such as learning stability, sample efficiency, safety, scalability, and collaboration with other agents. These drawbacks impede the widespread application of RL in real-life domains. To address these challenges, this dissertation aims to propose novel theories and algorithms for more effective and efficient RL and to develop their applications in real-world domains. This work consists of three major parts. First, the dissertation establishes a novel theoretical result for trust-region-based RL methods by analyzing the lower bound of policy performance. A closed-form policy update rule is then derived based on the theoretical result, providing a monotonic improvement guarantee. Second, the dissertation develops an off-policy RL algorithm for continuous control problems, inspired by the closed-form update rule. This algorithm enables sample-efficient learning of deep neural network policies. Additionally, trust region policy optimization is extended to cooperative multi-agent systems through consensus optimization, resulting in a distributed MARL algorithm. Third, the dissertation develops the real-world applications of a trust-region-based safe RL method and the MARL method in smart grids. Numerous experiments are conducted to verify the effectiveness of these methods using various benchmark environments, including robotics, strategic games, and power systems."} | ||||
| 48 | +{"work_id": 4401917994, "title": "Building Face Ageing Model Using Face Synthesis", "abstract": "Advancements in face synthesis technology have enabled innovative methods for modeling facial aging. This research paper focuses primarily on creating a robust face aging model using deep learning and Generative Adversarial Networks (GANs), trained on a diverse dataset of facial images. The proposed approach captures both global features and local textures to produce realistic age-progressed images while preserving the subject's identity. This paper also examines face synthesis techniques, with specific emphasis for the various practical usage of GANs. The key objective of our project is to upgrade both the discriminator and the generator parts of GANs to generate more realistic, age- progressed face images. We evaluated the model using quantitative metrics and qualitative assessments, demonstrating its effectiveness. Additionally, we address ethical considerations, proposing guidelines for responsible use. Our study offers a novel framework with significant applications in security, forensics, and entertainment, and suggests future research directions to improve accuracy and ethical standards."} | ||||
| 49 | +{"work_id": 7131830459, "title": "A Survey on Multimodal Recommender Systems: Recent Advances and Future Directions", "abstract": "The exponential growth of online information has made it increasingly difficult for users to identify valuable and relevant content. Recommender systems have emerged as a critical solution to this challenge by tailoring content to individual preferences. With the proliferation of diverse multimedia services, human interaction with the digital world has become inherently multimodal. Consequently, recommender systems capable of comprehending and interpreting multimodal information can more effectively align with individual preferences. With its recent surge in research attention, the field of multimodal recommender systems (MRS) still lacks a comprehensive technical survey. Existing surveys suffer from two critical limitations: 1) Insufficient technical depth: Prior works predominantly focus on categorizing and discussing general structure, neglecting rigorous technical analysis of methodologies and architectures. 2) Absence of cutting-edge works: Due to the rapid evolution of AI technologies, current surveys fail to discuss the latest works that adopt the most advanced techniques. To bridge these gaps, this survey conducts a systematic and technical review of advanced MRS works from MRS's inception to the present. We organize existing works into coherent taxonomies based on their structure and provide in-depth analyses of methodological innovations at each component, including Feature Extraction, Encoder, Multimodal Fusion, and Loss Function. Moreover, we further discuss potential future directions for developing and enhancing MRS. This survey serves as technical guidance for researchers and practitioners, offering insights into the developments, techniques, and future directions of MRS. Notably, we maintain a public repository:https://github.com/Jinfeng-Xu/Awesome-Multimodal-Recommender-Systems."} | ||||
| 50 | +{"work_id": 4400609581, "title": "Exploring the impact of artificial intelligence on higher education: The dynamics of ethical, social, and educational implications", "abstract": "Abstract The increasing prevalence of Artificial Intelligence (AI) in higher education underscores the necessity to explore its implications on ethical, social, and educational dynamics within the sector. This study aims to comprehensively investigate the impact of AI on higher education in Saudi Arabia, delving into stakeholders\u2019 attitudes, perceptions, and expectations regarding its implementation. The research hones in on key facets of AI in higher education, encompassing its influence on teaching and learning, ethical and social implications, and the anticipated role of AI in the future. Employing a quantitative approach through an online survey questionnaire (N = 1113), this study reveals positive attitudes toward AI in higher education. Stakeholders recognize its potential to enhance teaching and learning, streamline administration, and foster innovation. Emphasis is placed on ethical considerations and guidelines for AI implementation, highlighting the imperative need to address issues such as privacy, security, and bias. Participants envision a future characterized by personalized learning experiences, ethically integrated AI, collaboration, and ongoing support for lifelong learning. Furthermore, the results illuminate the intricate interplay between AI usage, purposes, difficulties, and their impact on attitudes, perceptions, and future implications. Accordingly, the research underscores the necessity for a comprehensive understanding of AI integration, considering not only its technical aspects but also the ethical, social, and educational dimensions. By acknowledging the role of AI uses, AI usage purposes, and addressing associated difficulties, educational stakeholders can work towards harnessing the benefits of AI while ensuring responsible and effective implementation in teaching and learning contexts."} | ||||
| 51 | +{"work_id": 3021654819, "title": "Federated Learning: Challenges, Methods, and Future Directions", "abstract": "Federated learning involves training statistical models over remote devices or siloed data centers, such as mobile phones or hospitals, while keeping data localized. Training in heterogeneous and potentially massive networks introduces novel challenges that require a fundamental departure from standard approaches for large-scale machine learning, distributed optimization, and privacy-preserving data analysis. In this article, we discuss the unique characteristics and challenges of federated learning, provide a broad overview of current approaches, and outline several directions of future work that are relevant to a wide range of research communities."} | ||||
| 52 | +{"work_id": 2969896603, "title": "A Survey on Bias and Fairness in Machine Learning", "abstract": "With the widespread use of artificial intelligence (AI) systems and applications in our everyday lives, accounting for fairness has gained significant importance in designing and engineering of such systems. AI systems can be used in many sensitive environments to make important and life-changing decisions; thus, it is crucial to ensure that these decisions do not reflect discriminatory behavior toward certain groups or populations. More recently some work has been developed in traditional machine learning and deep learning that address such challenges in different subdomains. With the commercialization of these systems, researchers are becoming more aware of the biases that these applications can contain and are attempting to address them. In this survey, we investigated different real-world applications that have shown biases in various ways, and we listed different sources of biases that can affect AI applications. We then created a taxonomy for fairness definitions that machine learning researchers have defined to avoid the existing bias in AI systems. In addition to that, we examined different domains and subdomains in AI showing what researchers have observed with regard to unfair outcomes in the state-of-the-art methods and ways they have tried to address them. There are still many future directions and solutions that can be taken to mitigate the problem of bias in AI systems. We are hoping that this survey will motivate researchers to tackle these issues in the near future by observing existing work in their respective fields."} | ||||
| 53 | +{"work_id": 3185341429, "title": "Pre-train, Prompt, and Predict: A Systematic Survey of Prompting Methods in Natural Language Processing", "abstract": "This article surveys and organizes research works in a new paradigm in natural language processing, which we dub \u201cprompt-based learning.\u201d Unlike traditional supervised learning, which trains a model to take in an input x and predict an output y as P ( y|x ), prompt-based learning is based on language models that model the probability of text directly. To use these models to perform prediction tasks, the original input x is modified using a template into a textual string prompt x\u2032 that has some unfilled slots, and then the language model is used to probabilistically fill the unfilled information to obtain a final string x\u0302 , from which the final output y can be derived. This framework is powerful and attractive for a number of reasons: It allows the language model to be pre-trained on massive amounts of raw text, and by defining a new prompting function the model is able to perform few-shot or even zero-shot learning, adapting to new scenarios with few or no labeled data. In this article, we introduce the basics of this promising paradigm, describe a unified set of mathematical notations that can cover a wide variety of existing work, and organize existing work along several dimensions, e.g., the choice of pre-trained language models, prompts, and tuning strategies. To make the field more accessible to interested beginners, we not only make a systematic review of existing works and a highly structured typology of prompt-based concepts but also release other resources, e.g., a website NLPedia\u2013Pretrain including constantly updated survey and paperlist."} | ||||
| 54 | +{"work_id": 4399450035, "title": "Power Hungry Processing: Watts Driving the Cost of AI Deployment?", "abstract": "Recent years have seen a surge in the popularity of commercial AI products based on generative, multi-purpose AI systems promising a unified approach to building machine learning (ML) models into technology. However, this ambition of \u201cgenerality\u201d comes at a steep cost to the environment, given the amount of energy these systems require and the amount of carbon that they emit. In this work, we propose the first systematic comparison of the ongoing inference cost of various categories of ML systems, covering both task-specific (i.e. finetuned models that carry out a single task) and \u2018general-purpose\u2019 models, (i.e. those trained for multiple tasks). We measure deployment cost as the amount of energy and carbon required to perform 1,000 inferences on representative benchmark dataset using these models. We find that multi-purpose, generative architectures are orders of magnitude more expensive than task-specific systems for a variety of tasks, even when controlling for the number of model parameters. We conclude with a discussion around the current trend of deploying multi-purpose generative ML systems, and caution that their utility should be more intentionally weighed against increased costs in terms of energy and emissions. All the data from our study can be accessed via an interactive demo to carry out further exploration and analysis."} | ||||
| 55 | +{"work_id": 4322718191, "title": "LLaMA: Open and Efficient Foundation Language Models", "abstract": "We introduce LLaMA, a collection of foundation language models ranging from 7B to 65B parameters. We train our models on trillions of tokens, and show that it is possible to train state-of-the-art models using publicly available datasets exclusively, without resorting to proprietary and inaccessible datasets. In particular, LLaMA-13B outperforms GPT-3 (175B) on most benchmarks, and LLaMA-65B is competitive with the best models, Chinchilla-70B and PaLM-540B. We release all our models to the research community."} | ||||
| 55 | {"work_id": 2963399829, "title": "Mixup: Beyond empirical risk minimization", "abstract": "Large deep neural networks are powerful, but exhibit undesirable behaviors such as memorization and sensitivity to adversarial examples. In this work, we propose mixup, a simple learning principle to alleviate these issues. In essence, mixup trains a neural network on convex combinations of pairs of examples and their labels. By doing so, mixup regularizes the neural network to favor simple linear behavior in-between training examples. Our experiments on the ImageNet-2012, CIFAR-10, CIFAR-100, Google commands and UCI datasets show that mixup improves the generalization of state-of-the-art neural network architectures. We also find that mixup reduces the memorization of corrupt labels, increases the robustness to adversarial examples, and stabilizes the training of generative adversarial networks."} | 56 | {"work_id": 2963399829, "title": "Mixup: Beyond empirical risk minimization", "abstract": "Large deep neural networks are powerful, but exhibit undesirable behaviors such as memorization and sensitivity to adversarial examples. In this work, we propose mixup, a simple learning principle to alleviate these issues. In essence, mixup trains a neural network on convex combinations of pairs of examples and their labels. By doing so, mixup regularizes the neural network to favor simple linear behavior in-between training examples. Our experiments on the ImageNet-2012, CIFAR-10, CIFAR-100, Google commands and UCI datasets show that mixup improves the generalization of state-of-the-art neural network architectures. We also find that mixup reduces the memorization of corrupt labels, increases the robustness to adversarial examples, and stabilizes the training of generative adversarial networks."} | ||
| 56 | {"work_id": 4393153153, "title": "TimesURL: Self-Supervised Contrastive Learning for Universal Time Series Representation Learning", "abstract": "Learning universal time series representations applicable to various types of downstream tasks is challenging but valuable in real applications. Recently, researchers have attempted to leverage the success of self-supervised contrastive learning (SSCL) in Computer Vision(CV) and Natural Language Processing(NLP) to tackle time series representation. Nevertheless, due to the special temporal characteristics, relying solely on empirical guidance from other domains may be ineffective for time series and difficult to adapt to multiple downstream tasks. To this end, we review three parts involved in SSCL including 1) designing augmentation methods for positive pairs, 2) constructing (hard) negative pairs, and 3) designing SSCL loss. For 1) and 2), we find that unsuitable positive and negative pair construction may introduce inappropriate inductive biases, which neither preserve temporal properties nor provide sufficient discriminative features. For 3), just exploring segment- or instance-level semantics information is not enough for learning universal representation. To remedy the above issues, we propose a novel self-supervised framework named TimesURL. Specifically, we first introduce a frequency-temporal-based augmentation to keep the temporal property unchanged. And then, we construct double Universums as a special kind of hard negative to guide better contrastive learning. Additionally, we introduce time reconstruction as a joint optimization objective with contrastive learning to capture both segment-level and instance-level information. As a result, TimesURL can learn high-quality universal representations and achieve state-of-the-art performance in 6 different downstream tasks, including short- and long-term forecasting, imputation, classification, anomaly detection and transfer learning."} | 57 | {"work_id": 4393153153, "title": "TimesURL: Self-Supervised Contrastive Learning for Universal Time Series Representation Learning", "abstract": "Learning universal time series representations applicable to various types of downstream tasks is challenging but valuable in real applications. Recently, researchers have attempted to leverage the success of self-supervised contrastive learning (SSCL) in Computer Vision(CV) and Natural Language Processing(NLP) to tackle time series representation. Nevertheless, due to the special temporal characteristics, relying solely on empirical guidance from other domains may be ineffective for time series and difficult to adapt to multiple downstream tasks. To this end, we review three parts involved in SSCL including 1) designing augmentation methods for positive pairs, 2) constructing (hard) negative pairs, and 3) designing SSCL loss. For 1) and 2), we find that unsuitable positive and negative pair construction may introduce inappropriate inductive biases, which neither preserve temporal properties nor provide sufficient discriminative features. For 3), just exploring segment- or instance-level semantics information is not enough for learning universal representation. To remedy the above issues, we propose a novel self-supervised framework named TimesURL. Specifically, we first introduce a frequency-temporal-based augmentation to keep the temporal property unchanged. And then, we construct double Universums as a special kind of hard negative to guide better contrastive learning. Additionally, we introduce time reconstruction as a joint optimization objective with contrastive learning to capture both segment-level and instance-level information. As a result, TimesURL can learn high-quality universal representations and achieve state-of-the-art performance in 6 different downstream tasks, including short- and long-term forecasting, imputation, classification, anomaly detection and transfer learning."} | ||
| 57 | −{"work_id": 7118083939, "title": "Agentic information systems", "abstract": "Abstract Recent advancements in artificial intelligence (AI) have catalyzed the emergence of agentic information systems (IS), which exhibit autonomous behavior and advanced cognitive capabilities. Unlike traditional IS, which functioned primarily as reactive tools supporting humans, agentic IS can make decisions independently, act in unstructured environments, and even delegate tasks to humans. This paradigm shift fundamentally transforms the human-IS relationship, questioning the long-standing assumption of human agentic primacy in IS research and practice. In this article, we provide a conceptual overview of agentic IS, delineating their defining characteristics and situating them within the broader evolution of IS. We introduce key archetypes of agentic IS, explore novel patterns of delegation and interaction between humans and machines, and discuss the socio-technical implications of these developments. Furthermore, we highlight the challenges and risks associated with integrating agentic IS from an individual, organizational, and societal perspective, emphasizing the need for nuanced understanding to harness the potential while addressing emerging complexities."} | ||||
| 58 | {"work_id": 7122857583, "title": "Agentic AI systems in the age of generative models: architectures, cloud scalability, and real-world applications", "abstract": "This research proposes a holistic agentic Artificial Intelligence framework that seeks to solve the palpable requirement of autonomy, versatility, and world-scale generative Artificial Intelligence systems. When framing the concept of an agentic Artificial Intelligence as a paradigm shift where Large Language Models are relatively reactive, tool-augmented to a proactive, modular agent that pursues goals in the long term, the research discusses how large language models are becoming an architectural mandate. The proposed research uses a skillful literature synthesis and develops a concept and technical framework that integrates perception, memory, planning, execution, and communication modules. In contrast to current frameworks like AutoGPT and ReAct, where the deep memory, explainability, and certain control of scalability are often lacking, the proposed framework offers a solution with persistent memory layers, semantic routing, and modular orchestration pipelines when it comes to cloud-native deployments. Experimental verification offers a greater degree of autonomy, coordination, and resilience in a diverse range of activities such as enterprise automation and robotics. It is also an edge deployment with the help of lightweight microservices framework. In practice, this method supports scaled, comprehensible agents adapted to long-loop thinking and human-in-the-loop management and adaptive value chain serving. The novelty of the work is attributed to its reusable architecture, as it is not only capable of modifying agentic behavior alone, but it can also connect the theoretical principles and industry feasibility. Future efforts will be with the integration of ethical governance, uniform benchmarking, and multimodal memory remodeling in next generation of real-world autonomous systems."} | 58 | {"work_id": 7122857583, "title": "Agentic AI systems in the age of generative models: architectures, cloud scalability, and real-world applications", "abstract": "This research proposes a holistic agentic Artificial Intelligence framework that seeks to solve the palpable requirement of autonomy, versatility, and world-scale generative Artificial Intelligence systems. When framing the concept of an agentic Artificial Intelligence as a paradigm shift where Large Language Models are relatively reactive, tool-augmented to a proactive, modular agent that pursues goals in the long term, the research discusses how large language models are becoming an architectural mandate. The proposed research uses a skillful literature synthesis and develops a concept and technical framework that integrates perception, memory, planning, execution, and communication modules. In contrast to current frameworks like AutoGPT and ReAct, where the deep memory, explainability, and certain control of scalability are often lacking, the proposed framework offers a solution with persistent memory layers, semantic routing, and modular orchestration pipelines when it comes to cloud-native deployments. Experimental verification offers a greater degree of autonomy, coordination, and resilience in a diverse range of activities such as enterprise automation and robotics. It is also an edge deployment with the help of lightweight microservices framework. In practice, this method supports scaled, comprehensible agents adapted to long-loop thinking and human-in-the-loop management and adaptive value chain serving. The novelty of the work is attributed to its reusable architecture, as it is not only capable of modifying agentic behavior alone, but it can also connect the theoretical principles and industry feasibility. Future efforts will be with the integration of ethical governance, uniform benchmarking, and multimodal memory remodeling in next generation of real-world autonomous systems."} | ||
| 59 | {"work_id": 7160627408, "title": "Generative Artificial Intelligence for Cross-Domain Knowledge Synthesis and Intelligent Automation", "abstract": "Generative Artificial intelligence (GAI) has become a cohesive paradigm in the very wide field of application including intelligent automation, decision support systems, and extensive knowledge management, where the incorporation of heterogeneous knowledge about domains is of critical importance. Synthesizing, reasoning and automating across a variety of different data is a basic challenge in these areas. This paper introduces a generative AI knowledge synthesis model and generative automation framework of synthetic cross-domain knowledge grounded on the learning of shared latent representation. The suggested methodology utilizes the heterogeneous inputs domain specific encoders to map to a single latent space with attention-based fusion, generative decoding, and reasoning-based policy learning to adapt the automation. Semantic alignment, synthesis accuracy and decision effectiveness are achieved by a joint optimization goal. Through experimental assessment, it has been established that the suggested has been found to provide better performance results against current methods with a better Knowledge Synthesis Accuracy (0.91), Cross-Domain Alignment Score (0.88) and Automation Decision Accuracy (0.93) parameter over state-of-the-art multimodal systems. These findings support the usefulness of the generative modeling concept in facilitating strong, scalable, and knowledge-based intelligent automation throughout domains."} | 59 | {"work_id": 7160627408, "title": "Generative Artificial Intelligence for Cross-Domain Knowledge Synthesis and Intelligent Automation", "abstract": "Generative Artificial intelligence (GAI) has become a cohesive paradigm in the very wide field of application including intelligent automation, decision support systems, and extensive knowledge management, where the incorporation of heterogeneous knowledge about domains is of critical importance. Synthesizing, reasoning and automating across a variety of different data is a basic challenge in these areas. This paper introduces a generative AI knowledge synthesis model and generative automation framework of synthetic cross-domain knowledge grounded on the learning of shared latent representation. The suggested methodology utilizes the heterogeneous inputs domain specific encoders to map to a single latent space with attention-based fusion, generative decoding, and reasoning-based policy learning to adapt the automation. Semantic alignment, synthesis accuracy and decision effectiveness are achieved by a joint optimization goal. Through experimental assessment, it has been established that the suggested has been found to provide better performance results against current methods with a better Knowledge Synthesis Accuracy (0.91), Cross-Domain Alignment Score (0.88) and Automation Decision Accuracy (0.93) parameter over state-of-the-art multimodal systems. These findings support the usefulness of the generative modeling concept in facilitating strong, scalable, and knowledge-based intelligent automation throughout domains."} | ||
| 60 | {"work_id": 4410882873, "title": "Navigating the landscape of multimodal AI in medicine: A scoping review on technical challenges and clinical applications", "abstract": "Recent technological advances in healthcare have led to unprecedented growth in patient data quantity and diversity. While artificial intelligence (AI) models have shown promising results in analyzing individual data modalities, there is increasing recognition that models integrating multiple complementary data sources, so-called multimodal AI, could enhance clinical decision-making. This scoping review examines the landscape of deep learning-based multimodal AI applications across the medical domain, analyzing 432 papers published between 2018 and 2024. We provide an extensive overview of multimodal AI development across different medical disciplines, examining various architectural approaches, fusion strategies, and common application areas. Our analysis reveals that multimodal AI models consistently outperform their unimodal counterparts, with an average improvement of 6.2 percentage points in AUC. However, several challenges persist, including cross-departmental coordination, heterogeneous data characteristics, and incomplete datasets. We critically assess the technical and practical challenges in developing multimodal AI systems and discuss potential strategies for their clinical implementation, including a brief overview of commercially available multimodal AI models for clinical decision-making. Additionally, we identify key factors driving multimodal AI development and propose recommendations to accelerate the field's maturation. This review provides researchers and clinicians with a thorough understanding of the current state, challenges, and future directions of multimodal AI in medicine."} | 60 | {"work_id": 4410882873, "title": "Navigating the landscape of multimodal AI in medicine: A scoping review on technical challenges and clinical applications", "abstract": "Recent technological advances in healthcare have led to unprecedented growth in patient data quantity and diversity. While artificial intelligence (AI) models have shown promising results in analyzing individual data modalities, there is increasing recognition that models integrating multiple complementary data sources, so-called multimodal AI, could enhance clinical decision-making. This scoping review examines the landscape of deep learning-based multimodal AI applications across the medical domain, analyzing 432 papers published between 2018 and 2024. We provide an extensive overview of multimodal AI development across different medical disciplines, examining various architectural approaches, fusion strategies, and common application areas. Our analysis reveals that multimodal AI models consistently outperform their unimodal counterparts, with an average improvement of 6.2 percentage points in AUC. However, several challenges persist, including cross-departmental coordination, heterogeneous data characteristics, and incomplete datasets. We critically assess the technical and practical challenges in developing multimodal AI systems and discuss potential strategies for their clinical implementation, including a brief overview of commercially available multimodal AI models for clinical decision-making. Additionally, we identify key factors driving multimodal AI development and propose recommendations to accelerate the field's maturation. This review provides researchers and clinicians with a thorough understanding of the current state, challenges, and future directions of multimodal AI in medicine."} | ||
| 61 | +{"work_id": 2306711933, "title": "Discovering hierarchy in reinforcement learning", "abstract": "This thesis addresses the open problem of automatically discovering hierarchical structure in reinforcement learning. Current algorithms for reinforcement learning fail to scale as problems become more complex. Many complex environments empirically exhibit hierarchy and can be modeled as interrelated subsystems, each in turn with hierarchic structure. Subsystems are often repetitive in time and space, meaning that they reoccur as components of different tasks or occur multiple times in different circumstances in the environment. A learning agent may sometimes scale to larger problems if it successfully exploits this repetition. Evidence suggests that a bottom up approach that repetitively finds building-blocks at one level of abstraction and uses them as background knowledge at the next level of abstraction, makes learning in many complex environments tractable. An algorithm, called HEXQ, is described that automatically decomposes and solves a multi-dimensional Markov decision problem (MDP) by constructing a multi-level hierarchy of interlinked subtasks without being given the model beforehand. The effectiveness and efficiency of the HEXQ decomposition depends largely on the choice of representation in terms of the variables, their temporal relationship and whether the problem exhibits a type of constrained stochasticity. The algorithm is first developed for stochastic shortest path problems and then extended to infinite horizon problems. The operation of the algorithm is demonstrated using a number of examples including a taxi domain, various navigation tasks, the Towers of Hanoi and a larger sporting problem. The main contributions of the thesis are the automation of (1)decomposition, (2) sub-goal identification, and (3) discovery of hierarchical structure for MDPs with states described by a number of variables or features. It points the way to further scaling opportunities that encompass approximations, partial observability, selective perception, relational representations and planning. The longer term research aim is to train rather than program intelligent agents."} | ||||
| 61 | {"work_id": 4390730779, "title": "Exploring Large Language Model\u2010Based Intelligent Agents: Definitions, Methods, and Prospects", "abstract": "ABSTRACT The concept of the intelligent agent represents a long\u2010standing pursuit in artificial intelligence. Recent breakthroughs in large language models (LLMs) have catalyzed a paradigm shift, enabling the development of sophisticated agents that exhibit advanced reasoning, planning, and tool\u2010use capabilities across diverse domains. These LLM\u2010based agents, which leverage natural language as a universal interface for cognition and interaction, are rapidly advancing from theoretical constructs to practical applications, ranging from autonomous task assistants to complex multi\u2010agent simulations of social and economic systems. This paper provides an integrative survey of this burgeoning field. We first establish an organizing framework for understanding LLM\u2010based agents, systematically deconstructing both single\u2010agent and multi\u2010agent systems into their core components. We analyze the architectural principles and key mechanisms that underpin their intelligence, including planning paradigms, memory structures, and reflection\u2010based self\u2010improvement. We further investigate the dynamics of multi\u2010agent systems, exploring coordination strategies, communication protocols, and organizational structures. The paper also covers the crucial aspects of performance evaluation, highlighting influential benchmarks and identifying key challenges. Finally, we synthesize the current landscape to discuss the primary challenges, such as the intrinsic limitations of LLMs and the complexities of ensuring safety and alignment, and chart a course for future research directions, including the drive toward continual learning and enhanced multi\u2010modal capabilities."} | 62 | {"work_id": 4390730779, "title": "Exploring Large Language Model\u2010Based Intelligent Agents: Definitions, Methods, and Prospects", "abstract": "ABSTRACT The concept of the intelligent agent represents a long\u2010standing pursuit in artificial intelligence. Recent breakthroughs in large language models (LLMs) have catalyzed a paradigm shift, enabling the development of sophisticated agents that exhibit advanced reasoning, planning, and tool\u2010use capabilities across diverse domains. These LLM\u2010based agents, which leverage natural language as a universal interface for cognition and interaction, are rapidly advancing from theoretical constructs to practical applications, ranging from autonomous task assistants to complex multi\u2010agent simulations of social and economic systems. This paper provides an integrative survey of this burgeoning field. We first establish an organizing framework for understanding LLM\u2010based agents, systematically deconstructing both single\u2010agent and multi\u2010agent systems into their core components. We analyze the architectural principles and key mechanisms that underpin their intelligence, including planning paradigms, memory structures, and reflection\u2010based self\u2010improvement. We further investigate the dynamics of multi\u2010agent systems, exploring coordination strategies, communication protocols, and organizational structures. The paper also covers the crucial aspects of performance evaluation, highlighting influential benchmarks and identifying key challenges. Finally, we synthesize the current landscape to discuss the primary challenges, such as the intrinsic limitations of LLMs and the complexities of ensuring safety and alignment, and chart a course for future research directions, including the drive toward continual learning and enhanced multi\u2010modal capabilities."} | ||
| 62 | −{"work_id": 1710476689, "title": "Generative Adversarial Networks", "abstract": "The Science of Deep Learning emerged from courses taught by the author that have provided thousands of students with training and experience for their academic studies, and prepared them for careers in deep learning, machine learning, and artificial intelligence in top companies in industry and academia. The book begins by covering the foundations of deep learning, followed by key deep learning architectures. Subsequent parts on generative models and reinforcement learning may be used as part of a deep learning course or as part of a course on each topic. The book includes state-of-the-art topics such as Transformers, graph neural networks, variational autoencoders, and deep reinforcement learning, with a broad range of applications. The appendices provide equations for computing gradients in backpropagation and optimization, and best practices in scientific writing and reviewing. The text presents an up-to-date guide to the field built upon clear visualizations using a unified notation and equations, lowering the barrier to entry for the reader. The accompanying website provides complementary code and hundreds of exercises with solutions."} | 63 | +{"work_id": 7118302872, "title": "A frame work to predict the influencing nodes in social networking platform using graph neural network model", "abstract": "Identifying influential nodes that can maximize information diffusion is a fundamental problem in social network analysis, commonly referred to as influence maximization. Diffusion model-based and traditional greedy and heuristic algorithms tend to be expensive to calculate, or poorly aware of the network structure, especially when dealing with large networks. To overcome these weaknesses, this paper will introduce a hybrid architecture that will combine Graph Neural Networks (GNNs) with the Ant Colony Optimization (ACO) towards influence maximization. The proposed approach works as follows, where the GNN learns influence representations on the node level, which jointly models both local and higher-order structural dependencies in the network, and ACO uses these learned representations to assemble a non-redundant and diverse seed set. The chosen seed sets are tested on the basis of the Independent Cascade diffusion model where the spread of influence is taken as the key performance measure. The experiments on the real-world social network data indicate that the proposed GNN-ACO framework is steadily more influential in spreading than the current baseline methods and that it has comparative computational efficiency at varying levels of seed set sizes. These findings demonstrate the advantage of optimizing influence maximization by using representation learning with a seed selection strategy based on optimization."} | ||
| 64 | +{"work_id": 4393138529, "title": "Parameter-Efficient Fine-Tuning for Large Models: A Comprehensive Survey", "abstract": "Large models represent a groundbreaking advancement in multiple application fields, enabling remarkable achievements across various tasks. However, their unprecedented scale comes with significant computational costs. These models, often consisting of billions of parameters, require vast amounts of computational resources for execution. Especially, the expansive scale and computational demands pose considerable challenges when customizing them for particular downstream tasks, particularly over the hardware platforms constrained by computational capabilities. Parameter Efficient Fine-Tuning (PEFT) provides a practical solution by efficiently adjusting the large models over the various downstream tasks. In particular, PEFT refers to the process of adjusting the parameters of a pre-trained large model to adapt it to a specific task or domain while minimizing the number of additional parameters introduced or computational resources required. This approach is particularly important when dealing with large-scale language models with high parameter counts, as fine-tuning these models from scratch can be computationally expensive and resource-intensive, posing considerable challenges in the supporting system platform design. In this survey, we present comprehensive studies of various PEFT algorithms, examining their performance and computational overhead. Moreover, we provide an overview of applications developed using different PEFT algorithms and discuss common techniques employed to mitigate computation costs for PEFT. In addition to providing an extensive survey from an algorithmic standpoint, we also examine various real-world system designs to investigate the implementation costs associated with different PEFT approaches. This survey serves as a valuable resource for researchers aiming to understand both the PEFT algorithm and its system implementation, offering detailed ......"} | ||||
| 65 | +{"work_id": 4396599905, "title": "Multimodal fusion on low-quality data: A comprehensive survey", "abstract": "Multimodal fusion focuses on integrating information from multiple modalities with the goal of more accurate prediction, which has achieved remarkable progress in a wide range of scenarios, including autonomous driving and medical diagnosis. However, the reliability of multimodal fusion remains largely unexplored especially under low-quality data settings. This paper surveys the common challenges and recent advances of multimodal fusion in the wild and presents them in a comprehensive taxonomy. From a data-centric view, we identify four main challenges that are faced by multimodal fusion on low-quality data, namely (1) noisy multimodal data that are contaminated with heterogeneous noises, (2) incomplete multimodal data that some modalities are missing, (3) imbalanced multimodal data that the qualities or properties of different modalities are significantly different and (4) quality-varying multimodal data that the quality of each modality dynamically changes with respect to different samples. This new taxonomy will enable researchers to understand the state of the field and identify several potential directions. We also provide discussion for the open problems in this field together with interesting future research directions."} | ||||
| 66 | +{"work_id": 2781726626, "title": "Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actor", "abstract": "Model-free deep reinforcement learning (RL) algorithms have been demonstrated on a range of challenging decision making and control tasks. However, these methods typically suffer from two major challenges: very high sample complexity and brittle convergence properties, which necessitate meticulous hyperparameter tuning. Both of these challenges severely limit the applicability of such methods to complex, real-world domains. In this paper, we propose soft actor-critic, an off-policy actor-critic deep RL algorithm based on the maximum entropy reinforcement learning framework. In this framework, the actor aims to maximize expected reward while also maximizing entropy. That is, to succeed at the task while acting as randomly as possible. Prior deep RL methods based on this framework have been formulated as Q-learning methods. By combining off-policy updates with a stable stochastic actor-critic formulation, our method achieves state-of-the-art performance on a range of continuous control benchmark tasks, outperforming prior on-policy and off-policy methods. Furthermore, we demonstrate that, in contrast to other off-policy algorithms, our approach is very stable, achieving very similar performance across different random seeds."} | ||||
| 67 | +{"work_id": 4402727669, "title": "mPLUG-OwI2: Revolutionizing Multi-modal Large Language Model with Modality Collaboration", "abstract": "Multi-modal Large Language Models (MLLMs) have demonstrated impressive instruction abilities across various open-ended tasks. However, previous methods primarily fo-cus on enhancing multi-modal capabilities. In this work, we introduce a versatile multi-modal large language model, mPLUG-Owl2, which effectively leverages modality collab-oration to improve performance in both text and multi-modal tasks. mPLUG-Owl2 utilizes a modularized network design, with the language decoder acting as a universal interface for managing different modalities. Specifically, mPLUG-Owl2 incorporates shared functional modules to facilitate modal-ity collaboration and introduces a modality-adaptive module that preserves modality-specific features. Extensive experi-ments reveal that mPLUG-Owl2 is capable of generalizing both text tasks and multi-modal tasks and achieving state-of-the-art performances with a single generic model. Notably, mPLUG-Owl2 is the first MLLM model that demonstrates the modality collaboration phenomenon in both pure-text and multi-modal scenarios, setting a pioneering path in the development of future multi-modal foundation models."} | ||||
| 68 | +{"work_id": 1568555062, "title": "Equivalence and Synthesis of Causal Models", "abstract": "chapter Share on Equivalence and Synthesis of Causal Models Authors: TS Verma Search about this author , Judea Pearl Search about this author Authors Info & Claims Probabilistic and Causal Inference: The Works of Judea PearlFebruary 2022 Pages 221\u2013236https://doi.org/10.1145/3501714.3501732Online:04 March 2022Publication History 0citation22DownloadsMetricsTotal Citations0Total Downloads22Last 12 Months22Last 6 weeks7 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my Alerts New Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access"} | ||||
| 69 | +{"work_id": 2754517384, "title": "Deep Reinforcement Learning That Matters", "abstract": "In recent years, significant progress has been made in solving challenging problems across various domains using deep reinforcement learning (RL). Reproducing existing work and accurately judging the improvements offered by novel methods is vital to sustaining this progress. Unfortunately, reproducing results for state-of-the-art deep RL methods is seldom straightforward. In particular, non-determinism in standard benchmark environments, combined with variance intrinsic to the methods, can make reported results tough to interpret. Without significance metrics and tighter standardization of experimental reporting, it is difficult to determine whether improvements over the prior state-of-the-art are meaningful. In this paper, we investigate challenges posed by reproducibility, proper experimental techniques, and reporting procedures. We illustrate the variability in reported metrics and results when comparing against common baselines and suggest guidelines to make future results in deep RL more reproducible. We aim to spur discussion about how to ensure continued progress in the field by minimizing wasted effort stemming from results that are non-reproducible and easily misinterpreted."} | ||||
| 70 | +{"work_id": 2964121744, "title": "AutoResearch Lite: a reproducible paper-inspired experiment runner (Adam mechanism reproduction and convergence-speed comparison)", "abstract": "A dependency-free experiment runner that turns a paper's research question into a configuration-driven, verifiable experiment task. The bundled reproduction maps the first/second moment estimates and bias correction of Adam (Kingma & Ba, arXiv:1412.6980) into runnable Python and compares them against fixed-learning-rate SGD under fixed seeds and epoch budgets. A second experiment measures convergence speed (epochs to reach a target training loss) against SGD with heavy-ball momentum, AdaGrad and RMSProp, with every optimizer family tuned by the same coarse learning-rate sweep. In that experiment Adam is not the fastest; the negative result is reported in full. Every reported number is pinned in an expected-values file with explicit tolerances and checked by one command that also runs the unit tests, and the checking harness is validated against deliberately broken implementations (negative controls). The repository also ships a task contract that expresses the reproduction as a repeatable, scoreable task for an automated research loop."} | ||||
| 71 | +{"work_id": 4410609100, "title": "Jailbreaking Black Box Large Language Models in Twenty Queries", "abstract": "There is growing interest in ensuring that large language models (LLMs) align with human values. However, the alignment of such models is vulnerable to adversarial jailbreaks, which coax LLMs into overriding their safety guardrails. The identification of these vulnerabilities is therefore instrumental in understanding inherent weaknesses and preventing future misuse. To this end, we propose Prompt Automatic Iterative Refinement (PAIR), an algorithm that generates semantic jailbreaks with only black-box access to an LLM. PAIR\u2014which is inspired by social engineering attacks\u2014uses an attacker LLM to automatically generate jailbreaks for a separate targeted LLM without human intervention. In this way, the attacker LLM iteratively queries the target LLM to update and refine a candidate jailbreak. Empirically, PAIR often requires fewer than twenty queries to produce a jailbreak, which is orders of magnitude more efficient than existing algorithms. PAIR also achieves competitive jailbreaking success rates and transferability on open and closed-source LLMs, including GPT-3.5/4, Vicuna, and Gemini."} | ||||
| 72 | +{"work_id": 4409249263, "title": "Ethical challenges and evolving strategies in the integration of artificial intelligence into clinical practice", "abstract": "Artificial intelligence (AI) has rapidly transformed various sectors, including healthcare, where it holds the potential to transform clinical practice and improve patient outcomes. However, its integration into medical settings brings significant ethical challenges that need careful consideration. This paper examines the current state of AI in healthcare, focusing on five critical ethical concerns: justice and fairness, transparency, patient consent and confidentiality, accountability, and patient-centered and equitable care. These concerns are particularly pressing as AI systems can perpetuate or even exacerbate existing biases, often resulting from non-representative datasets and opaque model development processes. The paper explores how bias, lack of transparency, and challenges in maintaining patient trust can undermine the effectiveness and fairness of AI applications in healthcare. In addition, we review existing frameworks for the regulation and deployment of AI, identifying gaps that limit the widespread adoption of these systems in a just and equitable manner. Our analysis provides recommendations to address these ethical challenges, emphasizing the need for fairness in algorithm design, transparency in model decision-making, and patient-centered approaches to consent and data privacy. By highlighting the importance of continuous ethical scrutiny and collaboration between AI developers, clinicians, and ethicists, we outline pathways for achieving more responsible and inclusive AI implementation in healthcare. These strategies, if adopted, could enhance both the clinical value of AI and the trustworthiness of AI systems among patients and healthcare professionals, ensuring that these technologies serve all populations equitably."} | ||||
| 73 | +{"work_id": 1591675293, "title": "Bayesian Inverse Reinforcement Learning", "abstract": "Inverse Reinforcement Learning (IRL) is the problem of learning the reward function underlying a Markov Decision Process given the dynamics of the system and the behaviour of an expert. IRL is motivated by situations where knowledge of the rewards is a goal by itself (as in preference elicitation) and by the task of apprenticeship learning (learning policies from an expert). In this paper we show how to combine prior knowledge and evidence from the expert's actions to derive a probability distribution over the space of reward functions. We present efficient algorithms that find solutions for the reward learning and apprenticeship learning tasks that generalize well over these distributions. Experimental results show strong improvement for our methods over previous heuristic-based approaches."} | ||||
| 74 | +{"work_id": 2964083594, "title": "Large-Scale Study of Curiosity-Driven Learning", "abstract": "Reinforcement learning algorithms rely on carefully engineering environment rewards that are extrinsic to the agent. However, annotating each environment with hand-designed, dense rewards is not scalable, motivating the need for developing reward functions that are intrinsic to the agent. Curiosity is a type of intrinsic reward function which uses prediction error as reward signal. In this paper: (a) We perform the first large-scale study of purely curiosity-driven learning, i.e. without any extrinsic rewards, across 54 standard benchmark environments, including the Atari game suite. Our results show surprisingly good performance, and a high degree of alignment between the intrinsic curiosity objective and the handdesigned extrinsic rewards of many game environments. (b) We investigate the effect of using different feature spaces for computing prediction error and show that random features are sufficient for many popular RL game benchmarks, but learned features appear to generalize better (e.g. to novel game levels in Super Mario Bros.). (c) We demonstrate limitations of the prediction-based rewards in stochastic setups. Game-play videos and code are at https://pathak22.github.io/large-scale-curiosity/."} | ||||
| 75 | +{"work_id": 7124262017, "title": "OECD Digital Education Outlook 2026", "abstract": "The OECD Digital Education Outlook 2026 explores emerging research on the use of generative AI in education and presents innovative tools and applications that show promise. The report examines the use of generative AI in different teaching and learning scenarios: by students to learn subject knowledge, by students and teachers together as part of instruction, and by teachers alone to support their work in the classroom. The Outlook also showcases how generative AI can enhance the efficiency of education institutions and systems, such as research, analysis of learning pathways and support for study advisors. While highlighting the opportunities and benefits of generative AI, the report also notes key challenges and concerns. It provides a state-of-the-art overview of the impact and possibilities of generative AI in education and is an essential resource for education policymakers, institution leaders, researchers, as well as other stakeholders."} | ||||
| 76 | +{"work_id": 4321499901, "title": "What if the devil is my guardian angel: ChatGPT as a case study of using chatbots in education", "abstract": "Abstract Artificial Intelligence (AI) technologies have been progressing constantly and being more visible in different aspects of our lives. One recent phenomenon is ChatGPT, a chatbot with a conversational artificial intelligence interface that was developed by OpenAI. As one of the most advanced artificial intelligence applications, ChatGPT has drawn much public attention across the globe. In this regard, this study examines ChatGPT in education, among early adopters, through a qualitative instrumental case study. Conducted in three stages, the first stage of the study reveals that the public discourse in social media is generally positive and there is enthusiasm regarding its use in educational settings. However, there are also voices who are approaching cautiously using ChatGPT in educational settings. The second stage of the study examines the case of ChatGPT through lenses of educational transformation, response quality, usefulness, personality and emotion, and ethics. In the third and final stage of the study, the investigation of user experiences through ten educational scenarios revealed various issues, including cheating, honesty and truthfulness of ChatGPT, privacy misleading, and manipulation. The findings of this study provide several research directions that should be considered to ensure a safe and responsible adoption of chatbots, specifically ChatGPT, in education."} | ||||
| 77 | +{"work_id": 4410551352, "title": "A foundation model for the Earth system", "abstract": "Reliable forecasting of the Earth system is essential for mitigating natural disasters and supporting human progress. Traditional numerical models, although powerful, are extremely computationally expensive1. Recent advances in artificial intelligence (AI) have shown promise in improving both predictive performance and efficiency2,3, yet their potential remains underexplored in many Earth system domains. Here we introduce Aurora, a large-scale foundation model trained on more than one million hours of diverse geophysical data. Aurora outperforms operational forecasts in predicting air quality, ocean waves, tropical cyclone tracks and high-resolution weather, all at orders of magnitude lower computational cost. With the ability to be fine-tuned for diverse applications at modest expense, Aurora represents a notable step towards democratizing accurate and efficient Earth system predictions. These results highlight the transformative potential of AI in environmental forecasting and pave the way for broader accessibility to high-quality climate and weather information. Aurora, a new large-scale foundation model trained on more than one million hours of diverse geophysical data, outperforms operational forecasts in predicting air quality, ocean wave dynamics, tropical cyclone tracks and high-resolution weather."} | ||||
| 78 | +{"work_id": 4321648656, "title": "From Paintbrush to Pixel: A Review of Deep Neural Networks in AI-Generated Art", "abstract": "Abstract This paper delves into the fascinating field of AI-generated art and explores the various deep neural network architectures and models that have been utilized to create it. From the classic convolutional networks to the cutting-edge diffusion models, we examine the key players in the field. We explain the general structures and working principles of these neural networks. Then, we showcase examples of milestones, starting with the dreamy landscapes of DeepDream and moving on to the most recent developments, including Stable Diffusion and DALL-E 3, which produce mesmerizing images. We provide a detailed comparison of these models, highlighting their strengths and limitations, and examining the remarkable progress that deep neural networks have made so far in a short period of time. With a unique blend of technical explanations and insights into the current state of AI-generated art, this paper exemplifies how art and computer science interact."} | ||||
| 79 | +{"work_id": 2950067852, "title": "A Recurrent Latent Variable Model for Sequential Data", "abstract": "In this paper, we explore the inclusion of latent random variables into the hidden state of a recurrent neural network (RNN) by combining the elements of the variational autoencoder. We argue that through the use of high-level latent random variables, the variational RNN (VRNN) can model the kind of variability observed in highly structured sequential data such as natural speech. We empirically evaluate the proposed model against other related sequential models on four speech datasets and one handwriting dataset. Our results show the important roles that latent random variables can play in the RNN dynamics."} | ||||
| 80 | +{"work_id": 4320495408, "title": "Chatting about ChatGPT: how may AI and GPT impact academia and libraries?", "abstract": "Note: This paper was written and published in January 2023, within weeks of ChatGPT's public release, making it among the earliest peer-reviewed scholarly discussions of ChatGPT's implications for academia and libraries. It is best understood as a contemporaneous assessment of an emerging technology at a pivotal moment \u2014 capturing initial perceptions, possibilities, and concerns that have since been extensively debated and studied. The paper's interview with ChatGPT itself represents one of the earliest documented scholarly interactions with the tool in an academic context. For researchers studying the history of AI adoption in higher education and libraries, this paper offers a primary source perspective from the field's earliest engagement with generative AI. This paper provides an overview of key definitions related to ChatGPT, a public tool developed by OpenAI, and its underlying technology, GPT. The paper discusses the history and technology of GPT, including its generative pre-trained transformer model, its ability to perform a wide range of language-based tasks, and how ChatGPT utilizes this technology to function as a sophisticated chatbot. Additionally, the paper includes an interview with ChatGPT on its potential impact on academia and libraries. The interview discusses the benefits of ChatGPT such as improving search and discovery, reference and information services, cataloging and metadata generation, and content creation, as well as the ethical considerations that need to be taken into account, such as privacy and bias. The paper also explores the possibility of using ChatGPT for writing scholarly papers."} | ||||
| 81 | +{"work_id": 4389437528, "title": "Education in the Era of Generative Artificial Intelligence (AI): Understanding the Potential Benefits of ChatGPT in Promoting Teaching and Learning", "abstract": "Since its maiden release into the public domain on November 30, 2022, ChatGPT garnered more than one million subscribers within a week. The generative AI tool \u23bcChatGPT took the world by surprise with it sophisticated capacity to carry out remarkably complex tasks. The extraordinary abilities of ChatGPT to perform complex tasks within the field of education has caused mixed feelings among educators as this advancement in AI seems to revolutionize existing educational praxis. This review article synthesizes recent extant literature to offer some potential benefits of ChatGPT in promoting teaching and learning. Benefits of ChatGPT include but are not limited to promotion of personalized and interactive learning, generating prompts for formative assessment activities that provide ongoing feedback to inform teaching and learning etc. The paper also highlights some inherent limitations in the ChatGPT such as generating wrong information, biases in data training which may augment existing biases, privacy issues etc. The study offers recommendations on how ChatGPT could be leveraged to maximize teaching and learning. Policy makers, researchers, educators and technology experts could work together and start conversations on how these evolving generative AI tools could be used safely and constructively to improve education and support students\u2019 learning."} | ||||
| 82 | +{"work_id": 2973229164, "title": "Continuous control for robot based on deep reinforcement learning", "abstract": "results of redundant manipulator . . . . . . . ."} | ||||
| 83 | +{"work_id": 4399567248, "title": "A multimodal generative AI copilot for human pathology", "abstract": "Abstract Computational pathology 1,2 has witnessed considerable progress in the development of both task-specific predictive models and task-agnostic self-supervised vision encoders 3,4 . However, despite the explosive growth of generative artificial intelligence (AI), there have been few studies on building general-purpose multimodal AI assistants and copilots 5 tailored to pathology. Here we present PathChat, a vision-language generalist AI assistant for human pathology. We built PathChat by adapting a foundational vision encoder for pathology, combining it with a pretrained large language model and fine-tuning the whole system on over 456,000 diverse visual-language instructions consisting of 999,202 question and answer turns. We compare PathChat with several multimodal vision-language AI assistants and GPT-4V, which powers the commercially available multimodal general-purpose AI assistant ChatGPT-4 (ref. 6 ). PathChat achieved state-of-the-art performance on multiple-choice diagnostic questions from cases with diverse tissue origins and disease models. Furthermore, using open-ended questions and human expert evaluation, we found that overall PathChat produced more accurate and pathologist-preferable responses to diverse queries related to pathology. As an interactive vision-language AI copilot that can flexibly handle both visual and natural language inputs, PathChat may potentially find impactful applications in pathology education, research and human-in-the-loop clinical decision-making."} | ||||
| 84 | +{"work_id": 3140854437, "title": "Review of deep learning: concepts, CNN architectures, challenges, applications, future directions", "abstract": "In the last few years, the deep learning (DL) computing paradigm has been deemed the Gold Standard in the machine learning (ML) community. Moreover, it has gradually become the most widely used computational approach in the field of ML, thus achieving outstanding results on several complex cognitive tasks, matching or even beating those provided by human performance. One of the benefits of DL is the ability to learn massive amounts of data. The DL field has grown fast in the last few years and it has been extensively used to successfully address a wide range of traditional applications. More importantly, DL has outperformed well-known ML techniques in many domains, e.g., cybersecurity, natural language processing, bioinformatics, robotics and control, and medical information processing, among many others. Despite it has been contributed several works reviewing the State-of-the-Art on DL, all of them only tackled one aspect of the DL, which leads to an overall lack of knowledge about it. Therefore, in this contribution, we propose using a more holistic approach in order to provide a more suitable starting point from which to develop a full understanding of DL. Specifically, this review attempts to provide a more comprehensive survey of the most important aspects of DL and including those enhancements recently added to the field. In particular, this paper outlines the importance of DL, presents the types of DL techniques and networks. It then presents convolutional neural networks (CNNs) which the most utilized DL network type and describes the development of CNNs architectures together with their main features, e.g., starting with the AlexNet network and closing with the High-Resolution network (HR.Net). Finally, we further present the challenges and suggested solutions to help researchers understand the existing research gaps. It is followed by a list of the major DL applications. Computational tools including FPGA, GPU, and CPU are summarized along with a description of their influence on DL. The paper ends with the evolution matrix, benchmark datasets, and summary and conclusion."} | ||||
| 85 | +{"work_id": 7128029160, "title": "A generalizable foundation model for analysis of human brain MRI", "abstract": "Artificial intelligence applied to brain magnetic resonance imaging (MRI) holds potential to advance diagnosis, prognosis and treatment planning for neurological diseases. The field has been constrained, thus far, by limited training data and task-specific models that do not generalize well across patient populations and medical tasks. By leveraging self-supervised learning, pretraining and targeted adaptation, foundation models present a promising paradigm to overcome these limitations. Here we present Brain Imaging Adaptive Core (BrainIAC)-a foundation model designed to learn generalized representations from unlabeled brain MRI data and serve as a core basis for diverse downstream application adaptation. Trained and validated on 48,965 brain MRIs across a broad spectrum of tasks, we demonstrate that BrainIAC outperforms localized supervised training and other pretrained models, particularly in low-data, few-shot, settings and in high-difficulty prediction tasks, allowing for application in scenarios otherwise infeasible. BrainIAC can be integrated into imaging pipelines and multimodal frameworks and may lead to improved biomarker discovery and artificial intelligence clinical translation."} | ||||
| 86 | +{"work_id": 2962862931, "title": "On a Method to Measure Supervised Multiclass Model\u2019s Interpretability: Application to Degradation Diagnosis (Short Paper)", "abstract": "In an industrial maintenance context, degradation diagnosis is the problem of determining the current level of degradation of operating machines based on measurements. With the emergence of Machine Learning techniques, such a problem can now be solved by training a degradation model offline and by using it online. While such models are more and more accurate and performant, they are often black-box and their decisions are therefore not interpretable for human maintenance operators. On the contrary, interpretable ML models are able to provide explanations for the model\u2019s decisions and consequently improves the confidence of the human operator about the maintenance decision based on these models. This paper proposes a new method to quantitatively measure the interpretability of such models that is agnostic (no assumption about the class of models) and that is applied on degradation models. The proposed method requires that the decision maker sets up some high level parameters in order to measure the interpretability of the models and then can decide whether the obtained models are satisfactory or not. The method is formally defined and is fully illustrated on a decision tree degradation model and a model trained with a recent neural network architecture called Multiclass Neural Additive Model."} | ||||
| 87 | +{"work_id": 4323655724, "title": "ChatGPT for good? On opportunities and challenges of large language models for education", "abstract": "Large language models represent a significant advancement in the field of AI. The underlying technology is key to further innovations and, despite critical views and even bans within communities and regions, large language models are here to stay. This position paper presents the potential benefits and challenges of educational applications of large language models, from student and teacher perspectives. We briefly discuss the current state of large language models and their applications. We then highlight how these models can be used to create educational content, improve student engagement and interaction, and personalize learning experiences. With regard to challenges, we argue that large language models in education require teachers and learners to develop sets of competencies and literacies necessary to both understand the technology as well as their limitations and unexpected brittleness of such systems. In addition, a clear strategy within educational systems and a clear pedagogical approach with a strong focus on critical thinking and strategies for fact checking are required to integrate and take full advantage of large language models in learning settings and teaching curricula. Other challenges such as the potential bias in the output, the need for continuous human oversight, and the potential for misuse are not unique to the application of AI in education. But we believe that, if handled sensibly, these challenges can offer insights and opportunities in education scenarios to acquaint students early on with potential societal biases, criticalities, and risks of AI applications. We conclude with recommendations for how to address these challenges and ensure that such models are used in a responsible and ethical manner in education."} | ||||
| 88 | +{"work_id": 4387355843, "title": "TimeLLM: Time Series Forecasting by Reprogramming Large Language Models", "abstract": "Accurate forecasting of time series is essential to many dynamic real-world systems and has attracted extensive research attention. Unlike natural language processing or computer vision, where one large model can often address multiple tasks, most existing forecasting solutions are highly specialized and confined to the single time series data modality. Advancements in multimodal time series foundation models have significantly lagged behind other domains, mainly because large, high-quality time series corpora remain scarce. At the same time, recent evidence suggests that large language models (LLMs) excel at understanding and reasoning across long token sequences. Exploiting those capabilities for forecasting requires a principled way to bridge numeric time series signals and linguistic tokens. This chapter presents Time-LLM, a model reprogramming framework that repurposes frozen LLM backbones for general time series prediction. As the first multimodal, large-scale approach in the time series community, Time-LLM embeds raw time series (target) signals into text (source) prototypes, aligning the two modalities before the data enters the language model backbone. To strengthen the model&s;s reasoning over time series, Time-LLM incorporates Prompt-as-Prefix (PaP), which augments contextual information and directs the reprogramming of input patches. The modified patches are then projected by the LLM to generate forecasts. Extensive evaluations demonstrate that Time-LLM serves as an effective multimodal forecaster, surpassing specialized baseline models."} | ||||
| 89 | +{"work_id": 4221150249, "title": "Graph Neural Networks for Graphs With Heterophily: A Survey", "abstract": "Recent years have witnessed fast developments of graph neural networks (GNNs) that have benefited myriad graph analytic tasks and applications. Most GNNs rely on the homophily assumption that nodes belonging to the same class are more likely to be connected. However, as a ubiquitous graph property in numerous real-world scenarios, heterophily, i.e., nodes with different labels tend to be linked, significantly limits the performance of tailor-made homophilic GNNs. Hence,GNNs for heterophilic graphsare gaining increasing research attention to enhance graph learning with heterophily. In this paper, we provide a comprehensive review of GNNs for heterophilic graphs. Specifically, we propose a systematic taxonomy that governs existing heterophilic GNN models, along with general summaries and detailed analyses. Furthermore, we discuss the relationship between heterophily and various graph research domains, aiming to facilitate the development of more effective GNNs across a spectrum of practical applications and learning tasks in the graph research community. In the end, we point out potential directions to advance and inspire future research and applications on heterophilic graph learning with GNNs."} | ||||
| 90 | +{"work_id": 4322617812, "title": "Generative AI and the future of education: Ragnar\u00f6k or reformation? A paradoxical perspective from management educators", "abstract": "Generative artificial intelligence (AI) has taken the world by storm, with notable tension transpiring in the field of education. Given that Generative AI is rapidly emerging as a transformative innovation, this article endeavors to offer a seminal rejoinder that aims to (i) reconcile the great debate on Generative AI in order to (ii) lay the foundation for Generative AI to co-exist as a transformative resource in the future of education. Using critical analysis as a method and paradox theory as a theoretical lens (i.e., the \u201chow\u201d), this article (i) defines Generative AI and transformative education (i.e., the \u201cideas\u201d), (ii) establishes the paradoxes of Generative AI (i.e., the \u201cwhat\u201d), and (iii) provides implications for the future of education from the perspective of management educators (i.e., the \u201cso what\u201d). Noteworthily, the paradoxes of Generative AI are four-fold: (Paradox #1) Generative AI is a \u2018friend\u2019 yet a \u2018foe\u2019, (Paradox #2) Generative AI is \u2018capable\u2019 yet \u2018dependent\u2019, (Paradox #3) Generative AI is \u2018accessible\u2019 yet \u2018restrictive\u2019, and (Paradox #4) Generative AI gets even \u2018popular\u2019 when \u2018banned\u2019 (i.e., the \u201cwhat\u201d). Through a position that seeks to embrace rather than reject Generative AI, the lessons and implications that emerge from the discussion herein represent a seminal contribution from management educators on this trending topic and should be useful for approaching Generative AI as a game-changer for education reformation in management and the field of education at large, and by extension, mitigating a situation where Generative AI develops into a Ragnar\u00f6k that dooms the future of education of which management education is a part of (i.e., the \u201cso what\u201d)."} | ||||
| 91 | +{"work_id": 3041133507, "title": "A Comprehensive Survey on Transfer Learning", "abstract": "Transfer learning aims at improving the performance of target learners on target domains by transferring the knowledge contained in different but related source domains. In this way, the dependence on a large number of target-domain data can be reduced for constructing target learners. Due to the wide application prospects, transfer learning has become a popular and promising area in machine learning. Although there are already some valuable and impressive surveys on transfer learning, these surveys introduce approaches in a relatively isolated way and lack the recent advances in transfer learning. Due to the rapid expansion of the transfer learning area, it is both necessary and challenging to comprehensively review the relevant studies. This survey attempts to connect and systematize the existing transfer learning research studies, as well as to summarize and interpret the mechanisms and the strategies of transfer learning in a comprehensive way, which may help readers have a better understanding of the current research status and ideas. Unlike previous surveys, this survey article reviews more than 40 representative transfer learning approaches, especially homogeneous transfer learning approaches, from the perspectives of data and model. The applications of transfer learning are also briefly introduced. In order to show the performance of different transfer learning models, over 20 representative transfer learning models are used for experiments. The models are performed on three different data sets, that is, Amazon Reviews, Reuters-21578, and Office-31, and the experimental results demonstrate the importance of selecting appropriate transfer learning models for different applications in practice."} | ||||
| 92 | +{"work_id": 2806351858, "title": "MolGAN: An implicit generative model for small molecular graphs", "abstract": "Deep generative models for graph-structured data offer a new angle on the problem of chemical synthesis: by optimizing differentiable models that directly generate molecular graphs, it is possible to side-step expensive search procedures in the discrete and vast space of chemical structures. We introduce MolGAN, an implicit, likelihood-free generative model for small molecular graphs that circumvents the need for expensive graph matching procedures or node ordering heuristics of previous likelihood-based methods. Our method adapts generative adversarial networks (GANs) to operate directly on graph-structured data. We combine our approach with a reinforcement learning objective to encourage the generation of molecules with specific desired chemical properties. In experiments on the QM9 chemical database, we demonstrate that our model is capable of generating close to 100% valid compounds. MolGAN compares favorably both to recent proposals that use string-based (SMILES) representations of molecules and to a likelihood-based method that directly generates graphs, albeit being susceptible to mode collapse. Code at https://github.com/nicola-decao/MolGAN"} | ||||
| 93 | +{"work_id": 4385285835, "title": "Scaling Self-Supervised Learning for Histopathology with Masked Image Modeling", "abstract": "Computational pathology is revolutionizing the field of pathology by integrating advanced computer vision and machine learning technologies into diagnostic workflows. It offers unprecedented opportunities for improved efficiency in treatment decisions by allowing pathologists to achieve higher precision and objectivity in disease classification, tumor microenvironment description and identification of new biomarkers. However, the potential of computational pathology in personalized medicine comes with significant challenges, particularly in annotating whole slide images (WSI), which is time-consuming, costly and subject to inter-observer variability. To address these challenges, Self-Supervised Learning (SSL) has emerged as a promising solution to learn representations from histology patches and leverage large volumes of unlabelled WSI. Recently, Masked Image Modeling (MIM) as a SSL framework has emerged and is now considered to outperform purely contrastive learning paradigms. In this work, we therefore explore the application of MIM to histology using iBOT, a self-supervised transformer-based framework. Through a wide range of 17 downstream tasks over seven cancer indications, both at the slide and patch levels, we provide recommendations on the pre-training of large models for histology data using MIM. First, we demonstrate that in-domain pre-training with iBOT outperforms both ImageNet pre-training and a model pre-trained with a purely contrastive learning objective, MoCo v2. Second, we show that Vision Transformers (ViT) models, when scaled appropriately, have the capability to learn pan-cancer representations that benefit a large variety of downstream tasks. Finally, our iBOT ViT-Base model (80 million parameters), pre-trained on more than 40 million histology images from 16 different cancer types, achieves state-of-the-art performance in most weakly-supervised WSI classification tasks compared to other SSL frameworks available in the literature. This paves the way for the development of a foundation model for histopathology. Our code, models and features are publicly available at https://github.com/owkin/HistoSSLscaling ."} | ||||
| 94 | +{"work_id": 3177318507, "title": "Informer: Beyond Efficient Transformer for Long Sequence Time-Series Forecasting", "abstract": "Many real-world applications require the prediction of long sequence time-series, such as electricity consumption planning. Long sequence time-series forecasting (LSTF) demands a high prediction capacity of the model, which is the ability to capture precise long-range dependency coupling between output and input efficiently. Recent studies have shown the potential of Transformer to increase the prediction capacity. However, there are several severe issues with Transformer that prevent it from being directly applicable to LSTF, including quadratic time complexity, high memory usage, and inherent limitation of the encoder-decoder architecture. To address these issues, we design an efficient transformer-based model for LSTF, named Informer, with three distinctive characteristics: (i) a ProbSparse self-attention mechanism, which achieves O(L log L) in time complexity and memory usage, and has comparable performance on sequences' dependency alignment. (ii) the self-attention distilling highlights dominating attention by halving cascading layer input, and efficiently handles extreme long input sequences. (iii) the generative style decoder, while conceptually simple, predicts the long time-series sequences at one forward operation rather than a step-by-step way, which drastically improves the inference speed of long-sequence predictions. Extensive experiments on four large-scale datasets demonstrate that Informer significantly outperforms existing methods and provides a new solution to the LSTF problem."} | ||||
| 95 | +{"work_id": 7135409568, "title": "The role of agentic artificial intelligence in healthcare: a scoping review", "abstract": "Abstract Background/ Objectives: Agentic AI represents a promising evolution of AI technology applied to healthcare, with systems increasingly capable of operating autonomously to achieve defined clinical goals. However, the literature lacks conceptual clarity between \u201cAI agents\u201d and \u201cagentic AI\u201d, and few studies have rigorously explored their clinical applications. Therefore, this study aims to conduct a novel systematic review addressing this gap by examining agentic AI systems in healthcare settings, characterizing their applications, features, outcomes, and limitations, and clarifying the conceptual distinctions between AI agents and agentic AI systems using predefined and objective criteria. Methods A comprehensive search was conducted across PubMed, Embase, Cochrane, Scopus, and Google Scholar on April 6th, 2025. Studies were included if they involved AI systems in healthcare settings that demonstrated the following agentic features: autonomous operation, goal-directed behavior, and initiating action. Data on the clinical tasks achieved by the agents, key findings, features, and limitations were collected from the included studies. Screening and extraction followed PRISMA guidelines, with Risk of Bias assessed using ROBINS-I and Cochrane's Risk of Bias tools. Results Of 984 retrieved records, seven studies met the inclusion criteria, spanning domains such as emergency medicine, oncology, radiology, and rehabilitation. Multi-agent architecture was frequently used to decompose and coordinate complex workflows. Among the included studies, the AIs showed high accuracy in diagnosing cancer patients, conducting treatment plans, sending alerts, coaching messages, analysing image data, and adapting to challenging experimental scenarios. While demonstrating potential for improved efficiency, task accuracy, and patient engagement, significant limitations were noted: narrow task scope, lack of physical agency, limited clinical validation, and barriers to integration into real-world healthcare systems. Only one system had been deployed in a patient-facing trial setting. Conclusion The current literature suggests an emerging role and application of Agentic AI, holding promise with the potential to revolutionize diagnostics, triage, treatment planning, and patient management. However, real-world implementation and evaluations in the literature are limited. Future research must address critical validation, regulation, ethics, and clinical integration challenges to realize their full potential. Clear operational definitions and frameworks for evaluating agency are essential to support safe and effective deployment of these systems."} | ||||
| 96 | +{"work_id": 2100415632, "title": "Efficient learning by implicit exploration in bandit problems with side observations", "abstract": "We consider online learning problems under a partial observability model capturing situations where the information conveyed to the learner is between full information and bandit feedback. In the simplest variant, we assume that in addition to its own loss, the learner also gets to observe losses of some other actions. The revealed losses depend on the learner's action and a directed observation system chosen by the environment. For this setting, we propose the first algorithm that enjoys near-optimal regret guarantees without having to know the observation system before selecting its actions. Along similar lines, we also define a new partial information setting that models online combinatorial optimization problems where the feedback received by the learner is between semi-bandit and full feedback. As the predictions of our first algorithm cannot be always computed efficiently in this setting, we propose another algorithm with similar properties and with the benefit of always being computationally efficient, at the price of a slightly more complicated tuning mechanism. Both algorithms rely on a novel exploration strategy called implicit exploration, which is shown to be more efficient both computationally and information-theoretically than previously studied exploration strategies for the problem."} | ||||
| 97 | +{"work_id": 7133226216, "title": "The Surprising Effectiveness of PPO in Cooperative Multi-Agent Games", "abstract": "Proximal Policy Optimization (PPO) is a ubiquitous on-policy reinforcement learning algorithm but is significantly less utilized than off-policy learning algorithms in multi-agent settings. This is often due to the belief that PPO is significantly less sample efficient than off-policy methods in multi-agent systems. In this work, we carefully study the performance of PPO in cooperative multi-agent settings. We show that PPO-based multi-agent algorithms achieve surprisingly strong performance in four popular multi-agent testbeds: the particle-world environments, the StarCraft multi-agent challenge, Google Research Football, and the Hanabi challenge, with minimal hyperparameter tuning and without any domain-specific algorithmic modifications or architectures. Importantly, compared to competitive off-policy methods, PPO often achieves competitive or superior results in both final returns and sample efficiency. Finally, through ablation studies, we analyze implementation and hyperparameter factors that are critical to PPO's empirical performance, and give concrete practical suggestions regarding these factors. Our results show that when using these practices, simple PPO-based methods can be a strong baseline in cooperative multi-agent reinforcement learning. Source code is released at \\url{https://github.com/marlbenchmark/on-policy}."} | ||||
| 98 | +{"work_id": 4390690043, "title": "Data-Centric Foundation Models in Computational Healthcare: A Survey", "abstract": "The advent of foundation models (FMs) as an emerging suite of AI techniques has struck a wave of opportunities in computational healthcare. The interactive nature of these models, guided by pre-training data and human instructions, has ignited a data-centric AI paradigm that emphasizes better data characterization, quality, and scale. In healthcare AI, obtaining and processing high-quality clinical data records has been a longstanding challenge, encompassing data quantity, annotation, patient privacy, and ethics. In this survey, we investigate a wide range of data-centric approaches in the FM era (from model pre-training to inference) towards improving the healthcare workflow. We discuss key perspectives in AI security, assessment, and alignment with human values. Finally, we offer a promising outlook on FM-based analytics to enhance patient outcomes and clinical workflows in the evolving landscape of healthcare and medicine. We provide an up-to-date list of healthcare-related foundation models and datasets at https://github.com/Yunkun-Zhang/Data-Centric-FM-Healthcare ."} | ||||
| 99 | +{"work_id": 4389519587, "title": "Video-LLaMA: An Instruction-tuned Audio-Visual Language Model for Video Understanding", "abstract": "We present Video-LLaMA 1 a multi-modal framework that empowers Large Language Models (LLMs) with the capability of understanding both visual and auditory content in the video.Video-LLaMA bootstraps cross-modal training from the frozen pre-trained visual & audio encoders and the frozen LLMs.Unlike previous works that complement LLMs to process the visual or audio signals only (Zhu et al., 2023;Liu et al., 2023; Huang et al., 2023a), Video-LLaMA enables video comprehension by tackling two challenges: (1) capturing the temporal changes in visual scenes, (2) integrating audio-visual signals.To counter the first challenge, we propose a Video Q-former to assemble a pre-trained image encoder into our video encoder and introduce a video-to-text generation task to learn video-language correspondence.For the second challenge, we leverage ImageBind (Girdhar et al., 2023), a universal embedding model aligning multiple modalities, as the pre-trained audio encoder and introduce an Audio Q-former on top of ImageBind to learn reasonable auditory query embeddings for the LLM module.To align the output of both visual & audio encoders with LLM's embedding space, we first train Video-LLaMA on massive video/image-caption pairs and then tune our model with visual-instruction datasets of moderate amount but higher quality.We found Video-LLaMA shows the ability to perceive and comprehend video content and generate meaningful responses grounded in the visual and auditory information presented in the videos."} | ||||
| 100 | +{"work_id": 4400228804, "title": "The Conglomeration of Everything: Shifting Animation Production Practices due to Artificial Intelligence", "abstract": "Artificial Intelligence (AI) is incorporated into systems that impact us daily and generative AI is the next evolution of the technology.For media studios who have attempted to be early adopters of the technology, it has resulted in negative responses online by creatives.These responses recognize that the usage of generative AI brings up concerns about ethics, plagiarism, and the loss of jobs in creative positions.I argue that AI usage in animation will not be as affected by AI as other creative jobs due to the negative pushback against the usage of generative AI and the inability to copyright nonhuman-made creative works.This future era of AI looks to shift the current production pipelines of film and media in the same way that digital animation tools took the market for commercial animation away from traditional hand-drawn animators but I believe that workflow changes will only manifest within the preproduction process. Artificial Intelligence and its Integration in the World Around UsEver since the beginning of the 20 th century, Artificial Intelligence (AI) has captured the imaginations of creatives with films such as Metropolis (1927), The Day the Earth Stood Still (1951), and 2001 a Space Odyssey (1968).Research towards AI gained traction in the 1950s when scientists Herbert Simon, Allen Newell, and Cliff Shaw created Logic Theorist, a seminal AI program that debuted at the Dartmouth Summer Research Project on Artificial Intelligence in 1956. 1 As AI matured, significant milestones occurred: \"machine learning\" coined by Arthur Samuel (1959), the first \"chatbot\" ELIZA by Joseph Weizenbaum (1966), proposal of autonomous vehicles by James L. Adams (1979), chess master Gary Kasparov's defeat by Deep Blue (1997), and Apple's introduction of Siri (2011). 2 Milestones in generative AI also followed: Geoffrey Hinton published \"A Fast Learning Algorithm for Deep Belief Nets\" (2006), Generative Adversarial Networks (GANs) were introduced by Ian Goodfellow (2014), and consumer-marketed generative AI services (ChatGPT, MidJourney, Dall-E 2) hit the mainstream (2022).3 Creatives have gained access to the technology and begun implementing AI into their production workflows, pushing the creative capabilities of computer-generated imagery.4 If you are able to access the internet, the capabilities of generative AI is at your fingertips. 1 History-Computer, \"Logic Theorist Explained -Everything You Need to Know,\" April 16, 2024,"} | ||||
| 101 | +{"work_id": 4289785095, "title": "An Image is Worth One Word: Personalizing Text-to-Image Generation using Textual Inversion", "abstract": "Text-to-image models offer unprecedented freedom to guide creation through natural language. Yet, it is unclear how such freedom can be exercised to generate images of specific unique concepts, modify their appearance, or compose them in new roles and novel scenes. In other words, we ask: how can we use language-guided models to turn our cat into a painting, or imagine a new product based on our favorite toy? Here we present a simple approach that allows such creative freedom. Using only 3-5 images of a user-provided concept, like an object or a style, we learn to represent it through new \"words\" in the embedding space of a frozen text-to-image model. These \"words\" can be composed into natural language sentences, guiding personalized creation in an intuitive way. Notably, we find evidence that a single word embedding is sufficient for capturing unique and varied concepts. We compare our approach to a wide range of baselines, and demonstrate that it can more faithfully portray the concepts across a range of applications and tasks. Our code, data and new words will be available at: https://textual-inversion.github.io"} | ||||
| 102 | +{"work_id": 2761873684, "title": "Rainbow: Combining Improvements in Deep Reinforcement Learning", "abstract": "The deep reinforcement learning community has made several independent improvements to the DQN algorithm. However, it is unclear which of these extensions are complementary and can be fruitfully combined. This paper examines six extensions to the DQN algorithm and empirically studies their combination. Our experiments show that the combination provides state-of-the-art performance on the Atari 2600 benchmark, both in terms of data efficiency and final performance. We also provide results from a detailed ablation study that shows the contribution of each component to overall performance."} | ||||
| 103 | +{"work_id": 7148475777, "title": "Capabilities of GPT\u20115 on multimodal medical reasoning", "abstract": "Recent advances in large language models (LLMs) have enabled general-purpose systems to perform increasingly complex domain-specific reasoning without extensive fine-tuning. In the medical domain, decision-making often requires integrating heterogeneous information sources, including patient narratives, structured data, and medical images. This study positions GPT-5 as a generalist multimodal reasoner for medical decision support and systematically evaluates its zero-shot chain-of-thought reasoning performance on both text-based question answering and visual question answering tasks under a unified protocol. We benchmark GPT-5, GPT-5-mini, GPT-5-nano, and GPT-4o-2024-11-20 against standardized splits of MedQA, MedXpertQA (text and multimodal), MMLU medical subsets, USMLE self-assessment exams, and VQA-RAD. Results show that GPT-5 consistently outperforms all baselines, achieving state-of-the-art accuracy across all QA benchmarks and delivering substantial gains in multimodal reasoning. On MedXpertQA MM, GPT-5 improves reasoning and understanding scores by +29.26% and +26.18% over GPT-4o, respectively, and surpasses pre-licensed human experts by +24.23% in reasoning and +29.40% in understanding. In contrast, GPT-4o remains below human expert performance in most dimensions. A representative case study demonstrates GPT-5\u2019s ability to integrate visual and textual cues into a coherent diagnostic reasoning chain, recommending appropriate high-stakes interventions. Our results show that, on these controlled multimodal reasoning benchmarks, GPT-5 moves from human-comparable to above human-expert performance. This improvement may substantially inform the design of future clinical decision-support systems. We make the code public at the GPT-5-Evaluation."} | ||||
| 104 | +{"work_id": 4409269614, "title": "Generative AI and Academic Integrity in Higher Education: A Systematic Review and Research Agenda", "abstract": "This systematic literature review rigorously evaluates the impact of Generative AI (GenAI) on academic integrity within higher education settings. The primary objective is to synthesize how GenAI technologies influence student behavior and academic honesty, assessing the benefits and risks associated with their integration. We defined clear inclusion and exclusion criteria, focusing on studies explicitly discussing GenAI\u2019s role in higher education from January 2021 to December 2024. Databases included ABI/INFORM, ACM Digital Library, IEEE Xplore, and JSTOR, with the last search conducted in May 2024. A total of 41 studies met our precise inclusion criteria. Our synthesis methods involved qualitative analysis to identify common themes and quantify trends where applicable. The results indicate that while GenAI can enhance educational engagement and efficiency, it also poses significant risks of academic dishonesty. We critically assessed the risk of bias in included studies and noted a limitation in the diversity of databases, which might have restricted the breadth of perspectives. Key implications suggest enhancing digital literacy and developing robust detection tools to effectively manage GenAI\u2019s dual impacts. No external funding was received for this review. Future research should expand database sources and include more diverse study designs to overcome current limitations and refine policy recommendations."} | ||||
| 105 | +{"work_id": 4384071683, "title": "Large language models encode clinical knowledge", "abstract": "Abstract Large language models (LLMs) have demonstrated impressive capabilities, but the bar for clinical applications is high. Attempts to assess the clinical knowledge of models typically rely on automated evaluations based on limited benchmarks. Here, to address these limitations, we present MultiMedQA, a benchmark combining six existing medical question answering datasets spanning professional medicine, research and consumer queries and a new dataset of medical questions searched online, HealthSearchQA. We propose a human evaluation framework for model answers along multiple axes including factuality, comprehension, reasoning, possible harm and bias. In addition, we evaluate Pathways Language Model 1 (PaLM, a 540-billion parameter LLM) and its instruction-tuned variant, Flan-PaLM 2 on MultiMedQA. Using a combination of prompting strategies, Flan-PaLM achieves state-of-the-art accuracy on every MultiMedQA multiple-choice dataset (MedQA 3 , MedMCQA 4 , PubMedQA 5 and Measuring Massive Multitask Language Understanding (MMLU) clinical topics 6 ), including 67.6% accuracy on MedQA (US Medical Licensing Exam-style questions), surpassing the prior state of the art by more than 17%. However, human evaluation reveals key gaps. To resolve this, we introduce instruction prompt tuning, a parameter-efficient approach for aligning LLMs to new domains using a few exemplars. The resulting model, Med-PaLM, performs encouragingly, but remains inferior to clinicians. We show that comprehension, knowledge recall and reasoning improve with model scale and instruction prompt tuning, suggesting the potential utility of LLMs in medicine. Our human evaluations reveal limitations of today\u2019s models, reinforcing the importance of both evaluation frameworks and method development in creating safe, helpful LLMs for clinical applications."} | ||||
| 106 | +{"work_id": 4221143046, "title": "BNAI, NO-TOKEN, and MIND-UNITY: Pillars of a Systemic Revolution in Artificial Intelligence", "abstract": "AbstractThere is a failure mode in large language models that we do not have a good name for, and thatwe therefore tend not to treat seriously enough. It is not hallucination \u2014 the model is not assertingsomething false. It is not refusal \u2014 the model answers at length. It is the production of responses thatcarry the complete outward form of careful reasoning while the cognitive work that reasoning issupposed to represent has not, in any meaningful sense, occurred. We call this theatrical compliance,and we argue that it is, in practical terms, more dangerous than either of the failure modes thatcurrently dominate alignment research. This paper identifies the phenomenon, characterizes its fiveprincipal forms, explains the asymmetry that makes it particularly costly in high-stakes settings, andoutlines the design requirements for systems intended to resist it. We do not describe such a systemin detail here. Our goal is to establish theatrical compliance as a research problem in its own rightand to argue that addressing it requires instruments operating at a fundamentally different level ofabstraction than task-level prompting frameworks.Keywords: theatrical compliance, large language models, AI reasoning quality, cognitiveprocess evaluation, prompt engineering, metacognitive systems."} | ||||
| 107 | +{"work_id": 4394934695, "title": "The impact of generative AI on higher education learning and teaching: A study of educators\u2019 perspectives", "abstract": "In recent months, Artificial Intelligence (AI) has had, and will continue to have, a dramatic impact on Higher Education (HE). A study conducted by researchers at a leading university in Australia surveyed 30 of their teaching staff, drawn predominantly from their teaching academy, and interviewed eight of them regarding the impact of AI on HE. Data were analyzed using the procedures of Inductive Thematic Analysis and revealed a lack of any homogenous sentiment around AI in HE and much ambiguity regarding best practice regarding recent technological developments. The results indicate concerns exist around concepts relating to academic integrity, however, these concerns may be exaggerated. Almost half of the participants indicated they were using AI within their teaching roles with the most common design change being modifications to assessments. Less than a quarter of staff agreed the university has adequately equipped them for AI, and more than three quarters indicated they would like support. They unanimously assumed the technology will improve. Keeping in mind universities\u2019 obligation to serve students by preparing them for industry, it is vitally important that the HE sector stays informed of developments in AI and commit to ongoing research and discussions regarding best practice in response to AI. However, anything regarding AI and future developments will be extremely difficult to predict."} | ||||
| 108 | +{"work_id": 4398243313, "title": "A scoping review on how generative artificial intelligence transforms assessment in higher education", "abstract": "Abstract Generative artificial intelligence provides both opportunities and challenges for higher education. Existing literature has not properly investigated how this technology would impact assessment in higher education. This scoping review took a forward-thinking approach to investigate how generative artificial intelligence transforms assessment in higher education. We used the PRISMA extension for scoping reviews to select articles for review and report the results. In the screening, we retrieved 969 articles and selected 32 empirical studies for analysis. Most of the articles were published in 2023. We used three levels\u2014students, teachers, and institutions\u2014to analyze the articles. Our results suggested that assessment should be transformed to cultivate students\u2019 self-regulated learning skills, responsible learning, and integrity. To successfully transform assessment in higher education, the review suggested that (i) teacher professional development activities for assessment, AI, and digital literacy should be provided, (ii) teachers\u2019 beliefs about human and AI assessment should be strengthened, and (iii) teachers should be innovative and holistic in their teaching to reflect the assessment transformation. Educational institutions are recommended to review and rethink their assessment policies, as well as provide more inter-disciplinary programs and teaching."} | ||||
| 109 | +{"work_id": 4396531244, "title": "The Fusion of Multilingual Semantic Search and Large Language Models: A New Paradigm for Enhanced Topic Exploration and Contextual Search", "abstract": "Digital news articles are often considered as a primary source of information in today's information-driven society which requires query processing methods to handle the ever-increasing volume of content and various forms of queries. Our goal is to develop a novel approach that can improve the way users access and retrieve news by considering Natural Language Processing (NLP)-driven query processing for news articles. This will address the complexities of news articles written in multiple languages and covering a range of topics. The proposed method helps in enhancing the performance of query processing in applications such as journalism, academic research, and content suggestion. By conducting experiments with Sentence Embeddings, Large Language Model (LLM), and Approximate Nearest Neighbours (ANN), this thesis improves news article search systems. Results show that the method improves the quality of the search results for the queries to return more accurate and relevant search results across different languages."} | ||||
| 110 | +{"work_id": 2895974005, "title": "Exploration and Exploitation in Reinforcement Learning", "abstract": "In reinforcement learning there exists a dilemma of exploration versus exploitation. This has led to the development of methods that have di\u21b5er- ent approaches to this. Using di\u21b5erent types of methods, and modifying them in di\u21b5erent ways can lead to di\u21b5erent results. Knowledge of how di\u21b5erent methods work can give knowledge of what should be used in aspecific case. Two ways that methods can be modified are change in adjustable pa- rameters and change in the number of steps of random actions at thebeginning. How much these two modifications e\u21b5ect the results in a spe- cific environment may di\u21b5er a lot, and can be a very critical thing to consider for certain results. The goal of this study is to answer the question of how the performance of the di\u21b5erent methods such as random, greedy, \u270f-greedy, \u270f-decreasingand Softmax is a\u21b5ected by di\u21b5erent values of their adjustable parameters,and by the number of steps of random actions at the beginning. Thesimulations and a comparative analysis are conducted for the case of an inverted pendulum with a vertical pole placed on a moving cart."} | ||||
| 111 | +{"work_id": 2742132707, "title": "Curriculum learning in reinforcement learning", "abstract": "In recent years, reinforcement learning (RL) has been increasingly successful at solving complex tasks. Despite these successes, one of the fundamental challenges is that many RL methods require large amounts of experience, and thus can be slow to train in practice. Transfer learning is a recent area of research that has been shown to speed up learning on a complex task by transferring knowledge from one or more easier source tasks. Most existing transfer learning methods treat this transfer of knowledge as a one-step process, where knowledge from all the sources are directly transferred to the target. However, for complex tasks, it may be more beneficial (and even necessary) to gradually acquire skills over multiple tasks in sequence, where each subsequent task requires and builds upon knowledge gained in a previous task. This idea is pervasive throughout human learning, where people learn complex skills gradually by training via a curriculum. The goal of this thesis is to explore whether autonomous reinforcement learning agents can also benefit by training via a curriculum, and whether such curricula can be designed fully autonomously. In order to answer these questions, this thesis first formalizes the concept of a curriculum, and the methodology of curriculum learning in reinforcement learning. Curriculum learning consists of 3 main elements: 1) task generation, which creates a suitable set of source tasks; 2) sequencing, which focuses on how to order these tasks into a curriculum; and 3) transfer learning, which considers how to transfer knowledge between tasks in the curriculum. This thesis introduces several methods to both create suitable source tasks and automatically sequence them into a curriculum. We show that these methods produce curricula that are tailored to the individual sensing and action capabilities of different agents, and show how the curricula learned can be adapted for new, but related target tasks. Together, these methods form the components of an autonomous curriculum design agent, that can suggest a training curriculum customized to both the unique abilities of each agent and the task in question. We expect this research on the curriculum learning approach will increase the applicability and scalability of RL methods by providing a faster way of training reinforcement learning agents, compared to learning tabula rasa."} | ||||
| 112 | +{"work_id": 3084163594, "title": "Age of Surveillance Capitalism \u2013 The Fight for a Human Future at the New Frontier of Power.", "abstract": "As an educator have you recently heard the term or perhaps even been told to be data driven? Inherent in this simple two-word statement is a quagmire of ethical and privacy concerns that educators must confront to reach the goal and realize the expected results. Central to the concept of data-centered collection, interpretation, and prediction is surveillance capitalism from which many of the tools, methods, and ideology used originate. This review of Shoshana Zuboff's work narrows the focus to the implications for education both in the classroom and in research. As an educator, Zuboff describes three central areas of concern for education's adoption of surveillance capitalist methodologies: changes to the division of learning, private money in research, and the impacts on student development. The work presents many quesitons that can be raised at all levels of educaiton to quesiton technological adoption in and for the classroom."} | ||||
| 113 | +{"work_id": 4410197190, "title": "The role of agentic AI in shaping a smart future: A systematic review", "abstract": "Artificial intelligence (AI), particularly Agentic AI, is increasingly critical for addressing the demand for speed, efficiency, and customer focus in modern organizations. However, the rapid evolution of Agentic AI, including Generative AI (GenAI) agents, has outpaced a cohesive understanding of its applications, challenges, and strategic implications. This narrative review explores the role of Agentic AI in shaping an intelligent future, focusing on its key attributes\u2014autonomy, reactivity, proactivity, and learning ability\u2014and its potential to transform organizational performance. We identify a research gap in synthesizing the diverse capabilities of Agentic AI (e.g., multimodal processing, hierarchical architectures, and machine learning outsourcing) and providing actionable strategies for adoption. The paper examines how Agentic AI enables autonomous decision-making, automates processes, and enhances efficiency through tools like LangChain, CrewAI, AutoGen, and AutoGPT. It highlights the transition from assisted (\"Copilot\") to autonomous (\"Autopilot\") models and the importance of hierarchical agent structures for system coordination. Key contributions include a framework for organizations to formulate GenAI strategies, addressing business needs, tool selection, human resource training, and risk management. Findings reveal that Agentic AI significantly improves productivity, reduces costs, and drives innovation, though challenges such as privacy, security, and ethical concerns remain. Future research should focus on industry-specific case studies to deepen understanding, explore the ethical and social impacts (e.g., privacy, data security, labor market effects), and investigate the integration of Agentic AI with emerging technologies like quantum computing. This review provides a foundation for researchers and practitioners to leverage Agentic AI effectively while addressing its limitations and opportunities."} | ||||
| 114 | +{"work_id": 3041807988, "title": "Post-Covid-19 Education and Education Technology \u2018Solutionism\u2019: a Seller\u2019s Market", "abstract": "The Covid-19 pandemic and the social distancing that followed have affected all walks of society, also education. In order to keep education running, educational institutions have had to quickly adapt to the situation. This has resulted in an unprecedented push to online learning. Many, including commercial digital learning platform providers, have rushed to provide their support and 'solutions', sometimes for free. The Covid-19 pandemic has therefore also created a sellers' market in ed-tech. This paper employs a critical lens to reflect on the possible problems arising from hasty adoption of commercial digital learning solutions whose design might not always be driven by best pedagogical practices but their business model that leverages user data for profit-making. Moreover, already before Covid-19, there has been increasing critique of how ed-tech is redefining and reducing concepts of teaching and learning. The paper also challenges the narrative that claims, 'education is broken, and it should and can be fixed with technology'. Such technologization, often seen as neutral, is closely related to educationalization, i.e. imposing growing societal problems for education to resolve. Therefore, this is a critical moment to reflect how the current choices educational institutions are making might affect with Covid-19 education and online learning: Will they reinforce capitalist instrumental view of education or promote holistic human growth? This paper urges educational leaders to think carefully about the decisions they are currently making and if they indeed pave the way to a desirable future of education."} | ||||
| 115 | +{"work_id": 4407135816, "title": "Foundation Models in Radiology: What, How, Why, and Why Not", "abstract": "Recent advances in artificial intelligence have witnessed the emergence of large-scale deep learning models capable of interpreting and generating both textual and imaging data. Such models, typically referred to as foundation models (FMs), are trained on extensive corpora of unlabeled data and demonstrate high performance across various tasks. FMs have recently received extensive attention from academic, industry, and regulatory bodies. Given the potentially transformative impact that FMs can have on the field of radiology, radiologists must be aware of potential pathways to train these radiology-specific FMs, including understanding both the benefits and challenges. Thus, this review aims to explain the fundamental concepts and terms of FMs in radiology, with a specific focus on the requirements of training data, model training paradigms, model capabilities, and evaluation strategies. Overall, the goal of this review is to unify technical advances and clinical needs for safe and responsible training of FMs in radiology to ultimately benefit patients, providers, and radiologists."} | ||||
| 116 | +{"work_id": 4383112908, "title": "Transfer Learning in Deep Reinforcement Learning: A Survey", "abstract": "Reinforcement learning is a learning paradigm for solving sequential decision-making problems. Recent years have witnessed remarkable progress in reinforcement learning upon the fast development of deep neural networks. Along with the promising prospects of reinforcement learning in numerous domains such as robotics and game-playing, transfer learning has arisen to tackle various challenges faced by reinforcement learning, by transferring knowledge from external expertise to facilitate the efficiency and effectiveness of the learning process. In this survey, we systematically investigate the recent progress of transfer learning approaches in the context of deep reinforcement learning. Specifically, we provide a framework for categorizing the state-of-the-art transfer learning approaches, under which we analyze their goals, methodologies, compatible reinforcement learning backbones, and practical applications. We also draw connections between transfer learning and other relevant topics from the reinforcement learning perspective and explore their potential challenges that await future research progress."} | ||||
| 117 | +{"work_id": 4407778399, "title": "Investigating the higher education institutions\u2019 guidelines and policies regarding the use of generative AI in teaching, learning, research, and administration", "abstract": "Abstract This study examined the guidelines issued by the top 50 U.S. universities regarding the use of Generative AI (GenAI) in academic and administrative activities. Employing a mixed methods approach, the research combined topic modeling, sentiment analysis, and qualitative thematic analysis to provide a comprehensive understanding of institutional responses to GenAI. Topic modeling identified four core topics: Integration of GenAI in Learning and Assessment, GenAI in Visual and Multimodal Media, Security and Ethical Considerations in GenAI, and GenAI in Academic Integrity. These themes were further explored through sentiment analysis, which revealed highly positive attitudes towards GenAI across all institution types, with significant differences between faculty and student-targeted guidelines. Qualitative thematic analysis corroborated these findings and provided deeper insights, revealing that 94% of universities had faculty guidelines emphasizing the importance of establishing and communicating course-specific GenAI policies. This analysis also highlighted recurring themes such as academic integrity and privacy concerns, which aligned with the security and ethical considerations identified in the topic modeling. The study highlights the rapid evolution of GenAI guidelines in higher education and the need for flexible, stakeholder-specific policies that address both the opportunities and challenges presented by this technology."} | ||||
| 118 | +{"work_id": 4392773210, "title": "Embracing the future of Artificial Intelligence in the classroom: the relevance of AI literacy, prompt engineering, and critical thinking in modern education", "abstract": "Abstract The present discussion examines the transformative impact of Artificial Intelligence (AI) in educational settings, focusing on the necessity for AI literacy, prompt engineering proficiency, and enhanced critical thinking skills. The introduction of AI into education marks a significant departure from conventional teaching methods, offering personalized learning and support for diverse educational requirements, including students with special needs. However, this integration presents challenges, including the need for comprehensive educator training and curriculum adaptation to align with societal structures. AI literacy is identified as crucial, encompassing an understanding of AI technologies and their broader societal impacts. Prompt engineering is highlighted as a key skill for eliciting specific responses from AI systems, thereby enriching educational experiences and promoting critical thinking. There is detailed analysis of strategies for embedding these skills within educational curricula and pedagogical practices. This is discussed through a case-study based on a Swiss university and a narrative literature review, followed by practical suggestions of how to implement AI in the classroom."} | ||||
| 119 | +{"work_id": 4400823820, "title": "Random Forest Algorithm Overview", "abstract": "A random forest is a machine learning model utilized in classification and forecasting. To train machine learning algorithms and artificial intelligence models, it is crucial to have a substantial amount of high-quality data for effective data collecting. System performance data is essential for refining algorithms, enhancing the efficiency of software and hardware, evaluating user be-havior, enabling pattern identification, decision-making, predictive modeling, and problem-solving, ultimately resulting in improved effectiveness and accuracy. The integration of diverse data collecting and processing methods enhances precision and innovation in problem-solving. Utilizing diverse methodologies in interdisciplinary research streamlines the research process, fosters innovation, and enables the application of data analysis findings to pattern recognition, decision-making, predictive modeling, and problem-solving. This approach also encourages in-novation in interdisciplinary research. This technique utilizes the concept of decision trees, con-structing a collection of decision trees and aggregating their outcomes to generate the ultimate prediction. Every decision tree inside a random forest is constructed using random subsets of data, and each individual tree is trained on a portion of the whole dataset. Subsequently, the outcomes of all decision trees are amalgamated to derive the ultimate forecast. One of the bene-fits of random forests is their capacity to handle unbalanced data and variables with missing values. Additionally, it mitigates the issue of arbitrary variable selection seen by certain alterna-tive models. Furthermore, random forests mitigate the issue of overfitting by training several de-cision trees on random subsets of data, hence enhancing their ability to generalize to novel data. Random forests are highly regarded as one of the most efficient and potent techniques in the domain of machine learning. They find extensive use in various applications such as automatic categorization, data forecasting, and supervisory learning."} | ||||
| 120 | +{"work_id": 4287689466, "title": "From Prediction to Precision: Leveraging LLMs for Equitable and Data-Driven Writing Placement in Developmental Education", "abstract": "Accurate text classification and placement remain challenges in U.S. higher education, with traditional automated systems like Accuplacer functioning as \"black-box\" models with limited assessment transparency. This study evaluates Large Language Models (LLMs) as complementary placement tools by comparing their classification performance against a human-rated gold standard and Accuplacer. A 450-essay corpus was classified using Claude, Gemini, GPT-3.5-turbo, and GPT-4o across four prompting strategies: Zero-shot, Few-shot, Enhanced, and Enhanced+ (definitions with examples). Two classification approaches were tested: (i) a 1-step, 3 class classification task, distinguishing DevEd Level 1, DevEd Level 2, and College-level texts in one single run; and (ii) a 2-step classification task, first separating College vs. Non-College texts before further classifying Non-College texts into DevEd sublevels. The results show that structured prompt refinement improves the precision of LLMs' classification, with Claude Enhanced + achieving 62.22% precision (1 step) and Gemini Enhanced + reaching 69.33% (2 step), both surpassing Accuplacer (58.22%). Gemini and Claude also demonstrated strong correlation with human ratings, with Claude achieving the highest Pearson scores (\u03c1 = 0.75; 1-step, \u03c1 = 0.73; 2-step) vs. Accuplacer (\u03c1 = 0.67). While LLMs show promise for DevEd placement, their precision remains a work in progress, highlighting the need for further refinement and safeguards to ensure ethical and equitable placement."} | ||||
| 121 | +{"work_id": 4413427262, "title": "AI Agents vs. Agentic AI: A Conceptual taxonomy, applications and challenges", "abstract": "Information fusion, in the context of the Generative AI era, must distinguish AI Agents from Agentic AI. This review critically distinguishes between AI Agents and Agentic AI, offering a structured, conceptual taxonomy, application mapping, and analysis of opportunities and challenges to clarify their divergent design philosophies and capabilities. We begin by outlining the search strategy and foundational definitions, characterizing AI Agents as modular systems driven and enabled by LLMs and LIMs for task-specific automation. Generative AI is positioned as a precursor providing the foundation, with AI agents advancing through tool integration, prompt engineering, and reasoning enhancements. We then characterize Agentic AI systems, which, in contrast to AI Agents, represent a paradigm shift marked by multi-agent collaboration, dynamic task decomposition, persistent memory, and coordinated autonomy. Through a chronological evaluation of architectural evolution, operational mechanisms, interaction styles, and autonomy levels, we present a comparative analysis across both AI agents and agentic AI paradigms. Application domains enabled by AI Agents such as customer support, scheduling, and data summarization are then contrasted with Agentic AI deployments in research automation, robotic coordination, and medical decision support. We further examine unique challenges in each paradigm including hallucination, brittleness, emergent behavior, and coordination failure, and propose targeted solutions such as ReAct loops, retrieval-augmented generation (RAG), automation coordination layers, and causal modeling. This work aims to provide a roadmap for developing robust, scalable, and explainable AI-driven systems."} | ||||
| 122 | +{"work_id": 2990704537, "title": "SuperGLUE: A Stickier Benchmark for General-Purpose Language Understanding Systems", "abstract": "In the last year, new models and methods for pretraining and transfer learning have driven striking performance improvements across a range of language understanding tasks. The GLUE benchmark, introduced a little over one year ago, offers a single-number metric that summarizes progress on a diverse set of such tasks, but performance on the benchmark has recently surpassed the level of non-expert humans, suggesting limited headroom for further research. In this paper we present SuperGLUE, a new benchmark styled after GLUE with a new set of more difficult language understanding tasks, a software toolkit, and a public leaderboard. SuperGLUE is available at https://super.gluebenchmark.com."} | ||||
| 123 | +{"work_id": 46659105, "title": "Evaluation: from precision, recall and F-measure to ROC, informedness, markedness and correlation", "abstract": "Background. LLM-as-Judge is increasingly adopted in automated program repair (APR) to assess patch correctness, yet its validity as a measurement instrument remains unaudited: potential benchmark-identifier leakage, evidence-presentation bias, and explanation unreliability have not been systematically examined. Aims. We investigate whether LLM Judge produces unbiased, stable, and well-grounded patch correctness judgments across three validity dimensions: metadata leakage, evidence presentation, and explanation reliability. Method. On a balanced, paired dataset of 326 patches from 163 Defects4J bugs, we evaluate GPT-4o and DeepSeek-V3 across a 12-setting prompt matrix covering benchmark-identifying metadata exposure and evidence presentation variants. We further conduct a manual analysis of 60 GPT-4o explanations using a five-category failure taxonomy and three independent annotators. Results. Under sanitized conditions, GPT-4o achieves an accuracy of 77.3% (MCC = 0.575, FPR = 17.2%), while DeepSeek-V3 achieves 80.4% accuracy (MCC = 0.625, FPR = 22.1%), with no statistically significant difference between the two models. Exposing combined benchmark-identifying metadata yields a suggestive accuracy increase of 4.3 percentage points for GPT-4o and 1.8 percentage points for DeepSeek-V3. Declaring that all tests have passed does not significantly bias either model; in contrast, providing a developer reference patch leads to substantial and statistically significant improvements for both models. Explanation failures are concentrated in misclassified cases, with the false-positive quadrant showing a 93.3% failure rate, primarily driven by hallucinated evidence and missed edge cases. Conclusions. LLM Judge is useful as a triage aid but is insufficient as a standalone correctness oracle. Reliable deployment requires prompt sanitization, explicit false positive rate reporting, clear distinction between reference-assisted and standalone assessment, and treating LLM explanations as investigative hypotheses rather than self-validating justifications."} | ||||
| 124 | +{"work_id": 7127274868, "title": "Parental AI Investment Behaviours and AI \u2010Mediated Informal Digital Learning of English: The Chain Mediating Role of Children's Perceived AI Value and Effort Expectancy for AI", "abstract": "ABSTRACT Background The proliferation of generative artificial intelligence (AI) has popularised AI\u2010Mediated Informal Digital Learning of English (AI\u2010IDLE). Whilst research in this area is growing, social influencing factors, especially the role of parents as significant others, remain underexplored. Objectives Guided by the Situational Expectancy\u2010Value Theory (SEVT), this study aims to investigate the impact of parental AI investment behaviours on students' engagement in AI\u2010IDLE. It specifically examines the mediating roles of Perceived AI Value and Effort Expectancy for AI in this relationship. Methods A questionnaire survey was administered to 2346 primary and secondary school students in China. The collected data were analysed using structural equation modelling (SEM) to test the proposed direct and mediating effects. Results The findings revealed that parental AI investment behaviours directly promoted students' AI\u2010IDLE engagement. Furthermore, they exerted significant indirect effects through the separate mediating roles of Perceived AI Value and Effort Expectancy for AI, as well as through their chain mediation pathway. Conclusions This research enriches the application of SEVT by extending it to informal, self\u2010regulated, and technology\u2010enhanced language learning contexts. It underscores the crucial role parents play in out\u2010of\u2010class learning and offers practical insights for guiding children to use AI tools effectively for English proficiency development."} | ||||
| 125 | +{"work_id": 2999309192, "title": "The advantages of the Matthews correlation coefficient (MCC) over F1 score and accuracy in binary classification evaluation", "abstract": "Abstract Background To evaluate binary classifications and their confusion matrices, scientific researchers can employ several statistical rates, accordingly to the goal of the experiment they are investigating. Despite being a crucial issue in machine learning, no widespread consensus has been reached on a unified elective chosen measure yet. Accuracy and F 1 score computed on confusion matrices have been (and still are) among the most popular adopted metrics in binary classification tasks. However, these statistical measures can dangerously show overoptimistic inflated results, especially on imbalanced datasets. Results The Matthews correlation coefficient (MCC), instead, is a more reliable statistical rate which produces a high score only if the prediction obtained good results in all of the four confusion matrix categories (true positives, false negatives, true negatives, and false positives), proportionally both to the size of positive elements and the size of negative elements in the dataset. Conclusions In this article, we show how MCC produces a more informative and truthful score in evaluating binary classifications than accuracy and F 1 score, by first explaining the mathematical properties, and then the asset of MCC in six synthetic use cases and in a real genomics scenario. We believe that the Matthews correlation coefficient should be preferred to accuracy and F 1 score in evaluating binary classification tasks by all scientific communities."} | ||||
| 126 | +{"work_id": 7133233472, "title": "QLoRA: Efficient Finetuning of Quantized LLMs", "abstract": "We present QLoRA, an efficient finetuning approach that reduces memory usage enough to finetune a 65B parameter model on a single 48GB GPU while preserving full 16-bit finetuning task performance. QLoRA backpropagates gradients through a frozen, 4-bit quantized pretrained language model into Low Rank Adapters~(LoRA). Our best model family, which we name Guanaco, outperforms all previous openly released models on the Vicuna benchmark, reaching 99.3% of the performance level of ChatGPT while only requiring 24 hours of finetuning on a single GPU. QLoRA introduces a number of innovations to save memory without sacrificing performance: (a) 4-bit NormalFloat (NF4), a new data type that is information theoretically optimal for normally distributed weights (b) double quantization to reduce the average memory footprint by quantizing the quantization constants, and (c) paged optimziers to manage memory spikes. We use QLoRA to finetune more than 1,000 models, providing a detailed analysis of instruction following and chatbot performance across 8 instruction datasets, multiple model types (LLaMA, T5), and model scales that would be infeasible to run with regular finetuning (e.g. 33B and 65B parameter models). Our results show that QLoRA finetuning on a small high-quality dataset leads to state-of-the-art results, even when using smaller models than the previous SoTA. We provide a detailed analysis of chatbot performance based on both human and GPT-4 evaluations showing that GPT-4 evaluations are a cheap and reasonable alternative to human evaluation. Furthermore, we find that current chatbot benchmarks are not trustworthy to accurately evaluate the performance levels of chatbots. A lemon-picked analysis demonstrates where Guanaco fails compared to ChatGPT. We release all of our models and code, including CUDA kernels for 4-bit training."} | ||||
| 127 | +{"work_id": 7133236347, "title": "TRiSM for Agentic AI: A review of Trust, Risk, and Security Management in LLM-based Agentic Multi-Agent Systems", "abstract": "Agentic AI systems, built upon large language models (LLMs) and deployed in multi-agent configurations, are redefining intelligence, autonomy, collaboration, and decision-making across enterprise and societal domains. This review presents a structured analysis of Trust, Risk, and Security Management (TRiSM) in the context of LLM-based Agentic Multi-Agent Systems (AMAS). We begin by examining the conceptual foundations of Agentic AI and highlight its architectural distinctions from traditional AI agents. We then adapt and extend the AI TRiSM framework for Agentic AI, structured around key pillars: Explainability, ModelOps, Security, Privacy and their Lifecycle Governance , each contextualized to the challenges of AMAS. A risk taxonomy is proposed to capture the unique threats and vulnerabilities of Agentic AI, ranging from coordination failures to prompt-based adversarial manipulation. To make coordination and tool use measurable in practice, we propose two metrics: the Component Synergy Score (CSS), which captures inter-agent enablement, and the Tool Utilization Efficacy (TUE), which evaluates whether tools are invoked correctly and efficiently. We further discuss strategies for improving explainability in Agentic AI, as well as approaches to enhancing security and privacy through encryption, adversarial robustness, and regulatory compliance. The review concludes with a research roadmap for the responsible development and deployment of Agentic AI, highlighting key directions to align emerging systems with TRiSM principles-ensuring safety, transparency, and accountability in their operation."} | ||||
| 128 | +{"work_id": 2968124245, "title": "VisualBERT: A Simple and Performant Baseline for Vision and Language", "abstract": "We propose VisualBERT, a simple and flexible framework for modeling a broad range of vision-and-language tasks. VisualBERT consists of a stack of Transformer layers that implicitly align elements of an input text and regions in an associated input image with self-attention. We further propose two visually-grounded language model objectives for pre-training VisualBERT on image caption data. Experiments on four vision-and-language tasks including VQA, VCR, NLVR2, and Flickr30K show that VisualBERT outperforms or rivals with state-of-the-art models while being significantly simpler. Further analysis demonstrates that VisualBERT can ground elements of language to image regions without any explicit supervision and is even sensitive to syntactic relationships, tracking, for example, associations between verbs and image regions corresponding to their arguments."} | ||||
| 63 | {"work_id": 4415913530, "title": "A multimodal whole-slide foundation model for pathology", "abstract": "The field of computational pathology has been transformed with recent advances in foundation models that encode histopathology region-of-interests (ROIs) into versatile and transferable feature representations via self-supervised learning. However, translating these advancements to address complex clinical challenges at the patient and slide level remains constrained by limited clinical data in disease-specific cohorts, especially for rare clinical conditions. We propose Transformer-based pathology Image and Text Alignment Network (TITAN), a multimodal whole-slide foundation model pretrained using 335,645 whole-slide images via visual self-supervised learning and vision-language alignment with corresponding pathology reports and 423,122 synthetic captions generated from a multimodal generative AI copilot for pathology. Without any fine-tuning or requiring clinical labels, TITAN can extract general-purpose slide representations and generate pathology reports that generalize to resource-limited clinical scenarios such as rare disease retrieval and cancer prognosis. We evaluate TITAN on diverse clinical tasks and find that it outperforms both ROI and slide foundation models across machine learning settings, including linear probing, few-shot and zero-shot classification, rare cancer retrieval, cross-modal retrieval and pathology report generation. Pretrained using 335,645 whole-slide images, a foundation model is developed to provide representations for slide- and patient-level tasks. It is capable of performing clinical tasks and generating reports even in data-scarce scenarios, such as rare cancer diagnosis and survival prediction, without requiring further fine-tuning."} | 129 | {"work_id": 4415913530, "title": "A multimodal whole-slide foundation model for pathology", "abstract": "The field of computational pathology has been transformed with recent advances in foundation models that encode histopathology region-of-interests (ROIs) into versatile and transferable feature representations via self-supervised learning. However, translating these advancements to address complex clinical challenges at the patient and slide level remains constrained by limited clinical data in disease-specific cohorts, especially for rare clinical conditions. We propose Transformer-based pathology Image and Text Alignment Network (TITAN), a multimodal whole-slide foundation model pretrained using 335,645 whole-slide images via visual self-supervised learning and vision-language alignment with corresponding pathology reports and 423,122 synthetic captions generated from a multimodal generative AI copilot for pathology. Without any fine-tuning or requiring clinical labels, TITAN can extract general-purpose slide representations and generate pathology reports that generalize to resource-limited clinical scenarios such as rare disease retrieval and cancer prognosis. We evaluate TITAN on diverse clinical tasks and find that it outperforms both ROI and slide foundation models across machine learning settings, including linear probing, few-shot and zero-shot classification, rare cancer retrieval, cross-modal retrieval and pathology report generation. Pretrained using 335,645 whole-slide images, a foundation model is developed to provide representations for slide- and patient-level tasks. It is capable of performing clinical tasks and generating reports even in data-scarce scenarios, such as rare cancer diagnosis and survival prediction, without requiring further fine-tuning."} | ||
| 64 | {"work_id": 4406571986, "title": "Generative artificial intelligence in higher education: Evidence from an analysis of institutional policies and guidelines", "abstract": "The release of ChatGPT in November 2022 prompted a massive uptake of generative artificial intelligence (GenAI) across higher education institutions (HEIs). In response, HEIs focused on regulating its use, particularly among students, before shifting towards advocating for its productive integration within teaching and learning . Since then, many HEIs have increasingly provided policies and guidelines to direct GenAI. This paper presents an analysis of documents produced by 116 US universities classified as as high research activity or R1 institutions providing a comprehensive examination of the advice and guidance offered by institutional stakeholders about GenAI. Through an extensive analysis, we found a majority of universities (N = 73, 63%) encourage the use of GenAI, with many offering detailed guidance for its use in the classroom (N = 48, 41%). Over half the institutions provided sample syllabi (N = 65, 56%) and half (N = 58, 50%) provided sample GenAI curriculum and activities that would help instructors integrate and leverage GenAI in their teaching. Notably, the majority of guidance focused on writing activities focused on writing, whereas references to code and STEM-related activities were infrequent, and often vague, even when mentioned (N = 58, 50%). Finally, more than half of institutions talked about the ethics of GenAI on a broad range of topics, including Diversity, Equity and Inclusion (DEI) (N = 60, 52%). Based on our findings we caution that guidance for faculty can become burdensome as policies suggest or imply substantial revisions to existing pedagogical practices."} | 130 | {"work_id": 4406571986, "title": "Generative artificial intelligence in higher education: Evidence from an analysis of institutional policies and guidelines", "abstract": "The release of ChatGPT in November 2022 prompted a massive uptake of generative artificial intelligence (GenAI) across higher education institutions (HEIs). In response, HEIs focused on regulating its use, particularly among students, before shifting towards advocating for its productive integration within teaching and learning . Since then, many HEIs have increasingly provided policies and guidelines to direct GenAI. This paper presents an analysis of documents produced by 116 US universities classified as as high research activity or R1 institutions providing a comprehensive examination of the advice and guidance offered by institutional stakeholders about GenAI. Through an extensive analysis, we found a majority of universities (N = 73, 63%) encourage the use of GenAI, with many offering detailed guidance for its use in the classroom (N = 48, 41%). Over half the institutions provided sample syllabi (N = 65, 56%) and half (N = 58, 50%) provided sample GenAI curriculum and activities that would help instructors integrate and leverage GenAI in their teaching. Notably, the majority of guidance focused on writing activities focused on writing, whereas references to code and STEM-related activities were infrequent, and often vague, even when mentioned (N = 58, 50%). Finally, more than half of institutions talked about the ethics of GenAI on a broad range of topics, including Diversity, Equity and Inclusion (DEI) (N = 60, 52%). Based on our findings we caution that guidance for faculty can become burdensome as policies suggest or imply substantial revisions to existing pedagogical practices."} | ||
| 65 | {"work_id": 4401023556, "title": "Large Language Model Based Multi-agents: A Survey of Progress and Challenges", "abstract": "Large Language Models (LLMs) have achieved remarkable success across a wide array of tasks. Due to their notable capabilities in planning and reasoning, LLMs have been utilized as autonomous agents for the automatic execution of various tasks. Recently, LLM-based agent systems have rapidly evolved from single-agent planning or decision-making to operating as multi-agent systems, enhancing their ability in complex problem-solving and world simulation. To offer an overview of this dynamic field, we present this survey to offer an in-depth discussion on the essential aspects and challenges of LLM-based multi-agent (LLM-MA) systems. Our objective is to provide readers with an in-depth understanding of these key points: the domains and settings where LLM-MA systems operate or simulate; the profiling and communication methods of these agents; and the means by which these agents develop their skills. For those interested in delving into this field, we also summarize the commonly used datasets or benchmarks. To keep researchers updated on the latest studies, we maintain an open-source GitHub repository (github.com/taichengguo/LLM_MultiAgents_Survey_Papers), dedicated to outlining the research of LLM-MA research."} | 131 | {"work_id": 4401023556, "title": "Large Language Model Based Multi-agents: A Survey of Progress and Challenges", "abstract": "Large Language Models (LLMs) have achieved remarkable success across a wide array of tasks. Due to their notable capabilities in planning and reasoning, LLMs have been utilized as autonomous agents for the automatic execution of various tasks. Recently, LLM-based agent systems have rapidly evolved from single-agent planning or decision-making to operating as multi-agent systems, enhancing their ability in complex problem-solving and world simulation. To offer an overview of this dynamic field, we present this survey to offer an in-depth discussion on the essential aspects and challenges of LLM-based multi-agent (LLM-MA) systems. Our objective is to provide readers with an in-depth understanding of these key points: the domains and settings where LLM-MA systems operate or simulate; the profiling and communication methods of these agents; and the means by which these agents develop their skills. For those interested in delving into this field, we also summarize the commonly used datasets or benchmarks. To keep researchers updated on the latest studies, we maintain an open-source GitHub repository (github.com/taichengguo/LLM_MultiAgents_Survey_Papers), dedicated to outlining the research of LLM-MA research."} | ||
| 66 | {"work_id": 7130481397, "title": "Benchmarking large language model-based agent systems for clinical decision tasks", "abstract": "Agentic artificial intelligence (AI) systems, designed to autonomously reason, plan, and invoke tools, have shown promise in healthcare, yet systematic benchmarking of their real-world performance remains limited. In this study, we evaluate two such systems: the open-source OpenManus, built on Meta's Llama-4 and extended with medically customized agents; and Manus, a proprietary agent system employing a multistep planner-executor-verifier architecture. Both systems were assessed across three benchmark families: AgentClinic, a stepwise dialog-based diagnostic simulation; MedAgentsBench, a knowledge-intensive medical QA dataset; and Humanity's Last Exam (HLE), a suite of challenging text-only and multimodal questions. Despite access to advanced tools (e.g., web browsing, code development and execution, and text file editing) agent systems yielded only modest accuracy gains over baseline LLMs, reaching 60.3% and 28.0% in AgentClinic MedQA and MIMIC, 30.3% on MedAgentsBench, and 8.6% on HLE text. Multimodal accuracy remained low (15.5% on multimodal HLE, 29.2% on AgentClinic NEJM), while resource demands increased substantially, with >10\u00d7 token usage and >2\u00d7 latency. Although 89.9% of hallucinations were filtered by in-agent safeguards, hallucinations remained prevalent. These findings reveal that current agentic designs offer modest performance benefits at significant computational and workflow cost, underscoring the need for more accurate, efficient, and clinically viable agent systems."} | 132 | {"work_id": 7130481397, "title": "Benchmarking large language model-based agent systems for clinical decision tasks", "abstract": "Agentic artificial intelligence (AI) systems, designed to autonomously reason, plan, and invoke tools, have shown promise in healthcare, yet systematic benchmarking of their real-world performance remains limited. In this study, we evaluate two such systems: the open-source OpenManus, built on Meta's Llama-4 and extended with medically customized agents; and Manus, a proprietary agent system employing a multistep planner-executor-verifier architecture. Both systems were assessed across three benchmark families: AgentClinic, a stepwise dialog-based diagnostic simulation; MedAgentsBench, a knowledge-intensive medical QA dataset; and Humanity's Last Exam (HLE), a suite of challenging text-only and multimodal questions. Despite access to advanced tools (e.g., web browsing, code development and execution, and text file editing) agent systems yielded only modest accuracy gains over baseline LLMs, reaching 60.3% and 28.0% in AgentClinic MedQA and MIMIC, 30.3% on MedAgentsBench, and 8.6% on HLE text. Multimodal accuracy remained low (15.5% on multimodal HLE, 29.2% on AgentClinic NEJM), while resource demands increased substantially, with >10\u00d7 token usage and >2\u00d7 latency. Although 89.9% of hallucinations were filtered by in-agent safeguards, hallucinations remained prevalent. These findings reveal that current agentic designs offer modest performance benefits at significant computational and workflow cost, underscoring the need for more accurate, efficient, and clinically viable agent systems."} | ||
| 67 | {"work_id": 7206206818, "title": "Lingshu: Generalist Foundation Model for Unified Multimodal Medical Understanding and Reasoning", "abstract": "Multimodal Large Language Models (MLLMs) excel at understanding generic visual content, such as landscapes, objects, and events, thanks to extensive datasets and advanced training regimes. However, their effectiveness in medical applications remains limited due to the inherent discrepancies between data and tasks in medical scenarios and those in the general domain. Existing medical MLLMs face the following critical deficiencies: 1) inadequate coverage of medical knowledge beyond imaging; 2) elevated propensity for hallucinations due to suboptimal data curation; and 3) limited reasoning capacity tailored to complex medical tasks. To address these challenges, we first propose a comprehensive data-curation procedure that 1) efficiently acquires rich medical knowledge data not only from medical imaging but also from extensive medical texts and general domain data; and 2) synthesizes high-quality medical captions, visual question answering, and reasoning samples. Leveraging the curated data, we build a multimodal dataset imbued with extensive medical knowledge and develop our medical-specialized MLLM, Lingshu-Med, which undergoes multi-stage training to embed the medical expertise and enhance task-solving capabilities progressively. We also investigate reinforcement learning with verifiable rewards to further refine Lingshu-Med's medical reasoning abilities. For rigorous assessment, we introduce MedEvalKit, a unified evaluation framework that consolidates the leading multimodal and textual medical benchmarks for standardized, fair, and efficient model assessment. On three core medical tasks-multimodal QA, textual QA, and radiology report generation, Lingshu-Med consistently outperforms existing multimodal baselines in most tasks. Moreover, we conduct five case studies drawn from real-world clinical scenarios that illustrate its practical utility in medical contexts."} | 133 | {"work_id": 7206206818, "title": "Lingshu: Generalist Foundation Model for Unified Multimodal Medical Understanding and Reasoning", "abstract": "Multimodal Large Language Models (MLLMs) excel at understanding generic visual content, such as landscapes, objects, and events, thanks to extensive datasets and advanced training regimes. However, their effectiveness in medical applications remains limited due to the inherent discrepancies between data and tasks in medical scenarios and those in the general domain. Existing medical MLLMs face the following critical deficiencies: 1) inadequate coverage of medical knowledge beyond imaging; 2) elevated propensity for hallucinations due to suboptimal data curation; and 3) limited reasoning capacity tailored to complex medical tasks. To address these challenges, we first propose a comprehensive data-curation procedure that 1) efficiently acquires rich medical knowledge data not only from medical imaging but also from extensive medical texts and general domain data; and 2) synthesizes high-quality medical captions, visual question answering, and reasoning samples. Leveraging the curated data, we build a multimodal dataset imbued with extensive medical knowledge and develop our medical-specialized MLLM, Lingshu-Med, which undergoes multi-stage training to embed the medical expertise and enhance task-solving capabilities progressively. We also investigate reinforcement learning with verifiable rewards to further refine Lingshu-Med's medical reasoning abilities. For rigorous assessment, we introduce MedEvalKit, a unified evaluation framework that consolidates the leading multimodal and textual medical benchmarks for standardized, fair, and efficient model assessment. On three core medical tasks-multimodal QA, textual QA, and radiology report generation, Lingshu-Med consistently outperforms existing multimodal baselines in most tasks. Moreover, we conduct five case studies drawn from real-world clinical scenarios that illustrate its practical utility in medical contexts."} | ||
| 68 | {"work_id": 2899138465, "title": "Learning to Learn with Gradients", "abstract": "Humans have a remarkable ability to learn new concepts from only a few examples and quickly adapt to unforeseen circumstances. To do so, they build upon their prior experience and prepare for the ability to adapt, allowing the combination of previous observations with small amounts of new evidence for fast learning. In most machine learning systems, however, there are distinct train and test phases: training consists of updating the model using data, and at test time, the model is deployed as a rigid decision-making engine. In this thesis, we discuss gradient-based algorithms for learning to learn, or meta-learning, which aim to endow machines with flexibility akin to that of humans. Instead of deploying a fixed, non-adaptable system, these meta-learning techniques explicitly train for the ability to quickly adapt so that, at test time, they can learn quickly when faced with new scenarios.To study the problem of learning to learn, we first develop a clear and formal definition of the meta-learning problem, its terminology, and desirable properties of meta-learning algorithms. Building upon these foundations, we present a class of model-agnostic meta-learning methods that embed gradient-based optimization into the learner. Unlike prior approaches to learning to learn, this class of methods focus on acquiring a transferable representation rather than a good learning rule. As a result, these methods inherit a number of desirable properties from using a fixed optimization as the learning rule, while still maintaining full expressivity, since the learned representations can control the update rule.We show how these methods can be extended for applications in motor control by combining elements of meta-learning with techniques for deep model-based reinforcement learning, imitation learning, and inverse reinforcement learning. By doing so, we build simulated agents that can adapt in dynamic environments, enable real robots to learn to manipulate new objects by watching a video of a human, and allow humans to convey goals to robots with only a few images. Finally, we conclude by discussing open questions and future directions in meta-learning, aiming to identify the key shortcomings and limiting assumptions of our existing approaches."} | 134 | {"work_id": 2899138465, "title": "Learning to Learn with Gradients", "abstract": "Humans have a remarkable ability to learn new concepts from only a few examples and quickly adapt to unforeseen circumstances. To do so, they build upon their prior experience and prepare for the ability to adapt, allowing the combination of previous observations with small amounts of new evidence for fast learning. In most machine learning systems, however, there are distinct train and test phases: training consists of updating the model using data, and at test time, the model is deployed as a rigid decision-making engine. In this thesis, we discuss gradient-based algorithms for learning to learn, or meta-learning, which aim to endow machines with flexibility akin to that of humans. Instead of deploying a fixed, non-adaptable system, these meta-learning techniques explicitly train for the ability to quickly adapt so that, at test time, they can learn quickly when faced with new scenarios.To study the problem of learning to learn, we first develop a clear and formal definition of the meta-learning problem, its terminology, and desirable properties of meta-learning algorithms. Building upon these foundations, we present a class of model-agnostic meta-learning methods that embed gradient-based optimization into the learner. Unlike prior approaches to learning to learn, this class of methods focus on acquiring a transferable representation rather than a good learning rule. As a result, these methods inherit a number of desirable properties from using a fixed optimization as the learning rule, while still maintaining full expressivity, since the learned representations can control the update rule.We show how these methods can be extended for applications in motor control by combining elements of meta-learning with techniques for deep model-based reinforcement learning, imitation learning, and inverse reinforcement learning. By doing so, we build simulated agents that can adapt in dynamic environments, enable real robots to learn to manipulate new objects by watching a video of a human, and allow humans to convey goals to robots with only a few images. Finally, we conclude by discussing open questions and future directions in meta-learning, aiming to identify the key shortcomings and limiting assumptions of our existing approaches."} | ||
| 69 | −{"work_id": 7164501397, "title": "Multimodal foundation models exploit text to make medical image predictions", "abstract": "Multimodal foundation models have shown compelling but conflicting performance in medical image interpretation. However, the ways in which these models integrate and prioritize different data modalities, including images and text, remain poorly understood. Here we evaluate 8 proprietary and open-source multimodal foundation models using 1090 multimodal medical cases. We show that image predictions are largely driven by text, with accuracy increasing monotonically with the amount of informative text. Exploitation of text is a double-edged sword; even mild suggestions of an incorrect diagnosis in text diminish image-based classification, dramatically reducing performance in cases the model could previously answer using images alone-o3 accuracy fell from 84% to 28% when a misleading clinical vignette was introduced. In physician evaluations of long-form cases, adding images reduces or does not improve performance when text is highly informative (e.g., GPT-4V showed decreased accuracy when images were added to highly informative text across 69 clinicopathological conferences). Our results suggest that multimodal AI models may be useful in medical diagnostic reasoning but that their accuracy is largely driven, for better and worse, by text."} | 135 | +{"work_id": 4379057711, "title": "Exploring the Potential Impact of Artificial Intelligence (AI) on International Students in Higher Education: Generative AI, Chatbots, Analytics, and International Student Success", "abstract": "International students face unique challenges in pursuing higher education in a foreign country. To address these challenges and enhance their academic experience, higher education institutions are increasingly exploring the use of artificial intelligence (AI) applications. This research essay aims to investigate the impact of AI on the education of international students. Instead of a traditional literature review, it employs a research approach to examine the potential applications of AI and discuss associated concerns. The research paper explores various AI applications, such as personalized learning experiences, adaptive testing, predictive analytics, and chatbots for learning and research. By analyzing the role of AI in education for international students, this research paper sheds light on how AI can improve learning efficiency and provide customized educational support. Additionally, it identifies significant risks and limitations, including privacy concerns, cultural differences, language proficiency, and ethical implications, which must be effectively addressed. The findings contribute to a better understanding of the potential impact of AI on international students\u2019 educational experiences and offer insights into the integration of AI into educational administration and learning processes."} | ||
| 70 | {"work_id": 2995460200, "title": "VL-BERT: Pre-training of Generic Visual-Linguistic Representations", "abstract": "We introduce a new pre-trainable generic representation for visual-linguistic tasks, called Visual-Linguistic BERT (VL-BERT for short). VL-BERT adopts the simple yet powerful Transformer model as the backbone, and extends it to take both visual and linguistic embedded features as input. In it, each element of the input is either of a word from the input sentence, or a region-of-interest (RoI) from the input image. It is designed to fit for most of the visual-linguistic downstream tasks. To better exploit the generic representation, we pre-train VL-BERT on the massive-scale Conceptual Captions dataset, together with text-only corpus. Extensive empirical analysis demonstrates that the pre-training procedure can better align the visual-linguistic clues and benefit the downstream tasks, such as visual commonsense reasoning, visual question answering and referring expression comprehension. It is worth noting that VL-BERT achieved the first place of single model on the leaderboard of the VCR benchmark."} | 136 | {"work_id": 2995460200, "title": "VL-BERT: Pre-training of Generic Visual-Linguistic Representations", "abstract": "We introduce a new pre-trainable generic representation for visual-linguistic tasks, called Visual-Linguistic BERT (VL-BERT for short). VL-BERT adopts the simple yet powerful Transformer model as the backbone, and extends it to take both visual and linguistic embedded features as input. In it, each element of the input is either of a word from the input sentence, or a region-of-interest (RoI) from the input image. It is designed to fit for most of the visual-linguistic downstream tasks. To better exploit the generic representation, we pre-train VL-BERT on the massive-scale Conceptual Captions dataset, together with text-only corpus. Extensive empirical analysis demonstrates that the pre-training procedure can better align the visual-linguistic clues and benefit the downstream tasks, such as visual commonsense reasoning, visual question answering and referring expression comprehension. It is worth noting that VL-BERT achieved the first place of single model on the leaderboard of the VCR benchmark."} | ||
| 71 | {"work_id": 7110333790, "title": "Enriching Location Representation with Detailed Semantic Information", "abstract": "Spatial representations that capture both structural and semantic characteristics of urban environments are essential for urban modeling. Traditional spatial embeddings often prioritize spatial proximity while underutilizing fine-grained contextual information from places. To address this limitation, we introduce CaLLiPer+, an extension of the CaLLiPer model that systematically integrates Point-of-Interest (POI) names alongside categorical labels within a multimodal contrastive learning framework. We evaluate its effectiveness on two downstream tasks - land use classification and socioeconomic status distribution mapping - demonstrating consistent performance gains of 4% to 11% over baseline methods. Additionally, we show that incorporating POI names enhances location retrieval, enabling models to capture complex urban concepts with greater precision. Ablation studies further reveal the complementary role of POI names and the advantages of leveraging pretrained text encoders for spatial representations. Overall, our findings highlight the potential of integrating fine-grained semantic attributes and multimodal learning techniques to advance the development of urban foundation models."} | 137 | {"work_id": 7110333790, "title": "Enriching Location Representation with Detailed Semantic Information", "abstract": "Spatial representations that capture both structural and semantic characteristics of urban environments are essential for urban modeling. Traditional spatial embeddings often prioritize spatial proximity while underutilizing fine-grained contextual information from places. To address this limitation, we introduce CaLLiPer+, an extension of the CaLLiPer model that systematically integrates Point-of-Interest (POI) names alongside categorical labels within a multimodal contrastive learning framework. We evaluate its effectiveness on two downstream tasks - land use classification and socioeconomic status distribution mapping - demonstrating consistent performance gains of 4% to 11% over baseline methods. Additionally, we show that incorporating POI names enhances location retrieval, enabling models to capture complex urban concepts with greater precision. Ablation studies further reveal the complementary role of POI names and the advantages of leveraging pretrained text encoders for spatial representations. Overall, our findings highlight the potential of integrating fine-grained semantic attributes and multimodal learning techniques to advance the development of urban foundation models."} | ||
| 138 | +{"work_id": 2963285578, "title": "Convergence Results for Neural Networks via Electrodynamics", "abstract": "We study whether a depth two neural network can learn another depth two network using gradient descent. Assuming a linear output node, we show that the question of whether gradient descent converges to the target function is equivalent to the following question in electrodynamics: Given k fixed protons in R^d, and k electrons, each moving due to the attractive force from the protons and repulsive force from the remaining electrons, whether at equilibrium all the electrons will be matched up with the protons, up to a permutation. Under the standard electrical force, this follows from the classic Earnshaw's theorem. In our setting, the force is determined by the activation function and the input distribution. Building on this equivalence, we prove the existence of an activation function such that gradient descent learns at least one of the hidden nodes in the target network. Iterating, we show that gradient descent can be used to learn the entire network one node at a time."} | ||||
| 72 | {"work_id": 4360620450, "title": "Opinion Paper: \u201cSo what if ChatGPT wrote it?\u201d Multidisciplinary perspectives on opportunities, challenges and implications of generative conversational AI for research, practice and policy", "abstract": "Transformative artificially intelligent tools, such as ChatGPT, designed to generate sophisticated text indistinguishable from that produced by a human, are applicable across a wide range of contexts. The technology presents opportunities as well as, often ethical and legal, challenges, and has the potential for both positive and negative impacts for organisations, society, and individuals. Offering multi-disciplinary insight into some of these, this article brings together 43 contributions from experts in fields such as computer science, marketing, information systems, education, policy, hospitality and tourism, management, publishing, and nursing. The contributors acknowledge ChatGPT\u2019s capabilities to enhance productivity and suggest that it is likely to offer significant gains in the banking, hospitality and tourism, and information technology industries, and enhance business activities, such as management and marketing. Nevertheless, they also consider its limitations, disruptions to practices, threats to privacy and security, and consequences of biases, misuse, and misinformation. However, opinion is split on whether ChatGPT\u2019s use should be restricted or legislated. Drawing on these contributions, the article identifies questions requiring further research across three thematic areas: knowledge, transparency, and ethics; digital transformation of organisations and societies; and teaching, learning, and scholarly research. The avenues for further research include: identifying skills, resources, and capabilities needed to handle generative AI; examining biases of generative AI attributable to training datasets and processes; exploring business and societal contexts best suited for generative AI implementation; determining optimal combinations of human and generative AI for various tasks; identifying ways to assess accuracy of text produced by generative AI; and uncovering the ethical and legal issues in using generative AI across different contexts."} | 139 | {"work_id": 4360620450, "title": "Opinion Paper: \u201cSo what if ChatGPT wrote it?\u201d Multidisciplinary perspectives on opportunities, challenges and implications of generative conversational AI for research, practice and policy", "abstract": "Transformative artificially intelligent tools, such as ChatGPT, designed to generate sophisticated text indistinguishable from that produced by a human, are applicable across a wide range of contexts. The technology presents opportunities as well as, often ethical and legal, challenges, and has the potential for both positive and negative impacts for organisations, society, and individuals. Offering multi-disciplinary insight into some of these, this article brings together 43 contributions from experts in fields such as computer science, marketing, information systems, education, policy, hospitality and tourism, management, publishing, and nursing. The contributors acknowledge ChatGPT\u2019s capabilities to enhance productivity and suggest that it is likely to offer significant gains in the banking, hospitality and tourism, and information technology industries, and enhance business activities, such as management and marketing. Nevertheless, they also consider its limitations, disruptions to practices, threats to privacy and security, and consequences of biases, misuse, and misinformation. However, opinion is split on whether ChatGPT\u2019s use should be restricted or legislated. Drawing on these contributions, the article identifies questions requiring further research across three thematic areas: knowledge, transparency, and ethics; digital transformation of organisations and societies; and teaching, learning, and scholarly research. The avenues for further research include: identifying skills, resources, and capabilities needed to handle generative AI; examining biases of generative AI attributable to training datasets and processes; exploring business and societal contexts best suited for generative AI implementation; determining optimal combinations of human and generative AI for various tasks; identifying ways to assess accuracy of text produced by generative AI; and uncovering the ethical and legal issues in using generative AI across different contexts."} | ||
| 73 | {"work_id": 4318718936, "title": "BLIP-2: Bootstrapping Language-Image Pre-training with Frozen Image Encoders and Large Language Models", "abstract": "The cost of vision-and-language pre-training has become increasingly prohibitive due to end-to-end training of large-scale models. This paper proposes BLIP-2, a generic and efficient pre-training strategy that bootstraps vision-language pre-training from off-the-shelf frozen pre-trained image encoders and frozen large language models. BLIP-2 bridges the modality gap with a lightweight Querying Transformer, which is pre-trained in two stages. The first stage bootstraps vision-language representation learning from a frozen image encoder. The second stage bootstraps vision-to-language generative learning from a frozen language model. BLIP-2 achieves state-of-the-art performance on various vision-language tasks, despite having significantly fewer trainable parameters than existing methods. For example, our model outperforms Flamingo80B by 8.7% on zero-shot VQAv2 with 54x fewer trainable parameters. We also demonstrate the model's emerging capabilities of zero-shot image-to-text generation that can follow natural language instructions."} | 140 | {"work_id": 4318718936, "title": "BLIP-2: Bootstrapping Language-Image Pre-training with Frozen Image Encoders and Large Language Models", "abstract": "The cost of vision-and-language pre-training has become increasingly prohibitive due to end-to-end training of large-scale models. This paper proposes BLIP-2, a generic and efficient pre-training strategy that bootstraps vision-language pre-training from off-the-shelf frozen pre-trained image encoders and frozen large language models. BLIP-2 bridges the modality gap with a lightweight Querying Transformer, which is pre-trained in two stages. The first stage bootstraps vision-language representation learning from a frozen image encoder. The second stage bootstraps vision-to-language generative learning from a frozen language model. BLIP-2 achieves state-of-the-art performance on various vision-language tasks, despite having significantly fewer trainable parameters than existing methods. For example, our model outperforms Flamingo80B by 8.7% on zero-shot VQAv2 with 54x fewer trainable parameters. We also demonstrate the model's emerging capabilities of zero-shot image-to-text generation that can follow natural language instructions."} | ||
| 74 | −{"work_id": 7124974472, "title": "The Rapid Adoption of Generative AI", "abstract": "Generative artificial intelligence (genAI) is a potentially important new technology, but its impact on the economy depends on the speed and intensity of adoption. This paper reports results from a series of nationally representative U.S. surveys of genAI use at work and at home. As of late 2024, 45% of the U.S. population age 18\u201364 uses genAI. Among employed respondents, 27% used genAI for work at least once in the previous week: 10% used it every workday and 17% on some but not all workdays. Relative to each technology\u2019s first mass-market product launch, work adoption of genAI has been faster than the personal computer (PC), and overall adoption has outpaced both PCs and the internet by an even wider margin. Between 1% and 7% of all work hours are currently assisted by genAI, and respondents report time savings equivalent to 1.4% of total work hours. Potential productivity gains vary widely by industry, and firm climate and policies play an important role in adoption patterns. This paper was accepted by Alfonso Gambardella, business strategy. Funding: This work was supported by the Walmart Foundation [Grant 252882]. Supplemental Material: The online appendix and data files are available at https://doi.org/10.1287/mnsc.2025.02523 ."} | ||||
| 75 | {"work_id": 4406199489, "title": "Generative AI in Higher Education: Balancing Innovation and Integrity", "abstract": "Generative Artificial Intelligence (GenAI) is rapidly transforming the landscape of higher education, offering novel opportunities for personalised learning and innovative assessment methods. This paper explores the dual-edged nature of GenAI's integration into educational practices, focusing on both its potential to enhance student engagement and learning outcomes and the significant challenges it poses to academic integrity and equity. Through a comprehensive review of current literature, we examine the implications of GenAI on assessment practices, highlighting the need for robust ethical frameworks to guide its use. Our analysis is framed within pedagogical theories, including social constructivism and competency-based learning, highlighting the importance of balancing human expertise and AI capabilities. We also address broader ethical concerns associated with GenAI, such as the risks of bias, the digital divide, and the environmental impact of AI technologies. This paper argues that while GenAI can provide substantial benefits in terms of automation and efficiency, its integration must be managed with care to avoid undermining the authenticity of student work and exacerbating existing inequalities. Finally, we propose a set of recommendations for educational institutions, including developing GenAI literacy programmes, revising assessment designs to incorporate critical thinking and creativity, and establishing transparent policies that ensure fairness and accountability in GenAI use. By fostering a responsible approach to GenAI, higher education can harness its potential while safeguarding the core values of academic integrity and inclusive education."} | 141 | {"work_id": 4406199489, "title": "Generative AI in Higher Education: Balancing Innovation and Integrity", "abstract": "Generative Artificial Intelligence (GenAI) is rapidly transforming the landscape of higher education, offering novel opportunities for personalised learning and innovative assessment methods. This paper explores the dual-edged nature of GenAI's integration into educational practices, focusing on both its potential to enhance student engagement and learning outcomes and the significant challenges it poses to academic integrity and equity. Through a comprehensive review of current literature, we examine the implications of GenAI on assessment practices, highlighting the need for robust ethical frameworks to guide its use. Our analysis is framed within pedagogical theories, including social constructivism and competency-based learning, highlighting the importance of balancing human expertise and AI capabilities. We also address broader ethical concerns associated with GenAI, such as the risks of bias, the digital divide, and the environmental impact of AI technologies. This paper argues that while GenAI can provide substantial benefits in terms of automation and efficiency, its integration must be managed with care to avoid undermining the authenticity of student work and exacerbating existing inequalities. Finally, we propose a set of recommendations for educational institutions, including developing GenAI literacy programmes, revising assessment designs to incorporate critical thinking and creativity, and establishing transparent policies that ensure fairness and accountability in GenAI use. By fostering a responsible approach to GenAI, higher education can harness its potential while safeguarding the core values of academic integrity and inclusive education."} | ||
| 76 | {"work_id": 3137147200, "title": "A Survey of Quantization Methods for Efficient Neural Network Inference", "abstract": "This chapter provides approaches to the problem of quantizing the numerical values in deep Neural Network computations, covering the advantages/disadvantages of current methods. Over the past decade, people have observed significant improvements in the accuracy of Neural Networks (NNs) for a wide range of problems, often achieved by highly over-parameterized models. Achieving efficient, real-time NNs with optimal accuracy requires rethinking the design, training, and deployment of NN models. Model distillation involves training a large model and then using it as a teacher to train a more compact model. Loosely related to NN quantization is work in neuroscience that suggests that the human brain stores information in a discrete/quantized form, rather than in a continuous form. Gray and Neuhoff have written a very nice survey of the history of quantization up to 1998."} | 142 | {"work_id": 3137147200, "title": "A Survey of Quantization Methods for Efficient Neural Network Inference", "abstract": "This chapter provides approaches to the problem of quantizing the numerical values in deep Neural Network computations, covering the advantages/disadvantages of current methods. Over the past decade, people have observed significant improvements in the accuracy of Neural Networks (NNs) for a wide range of problems, often achieved by highly over-parameterized models. Achieving efficient, real-time NNs with optimal accuracy requires rethinking the design, training, and deployment of NN models. Model distillation involves training a large model and then using it as a teacher to train a more compact model. Loosely related to NN quantization is work in neuroscience that suggests that the human brain stores information in a discrete/quantized form, rather than in a continuous form. Gray and Neuhoff have written a very nice survey of the history of quantization up to 1998."} | ||
| 77 | {"work_id": 2436219157, "title": "Optimization Methods for Large-Scale Machine Learning", "abstract": "Abstract. This paper provides a review and commentary on the past, present, and future of numerical optimization algorithms in the context of machine learning applications. Through case studies on text classification and the training of deep neural networks, we discuss how optimization problems arise in machine learning and what makes them challenging. A major theme of our study is that large-scale machine learning represents a distinctive setting in which the stochastic gradient (SG) method has traditionally played a central role while conventional gradient-based nonlinear optimization techniques typically falter. Based on this viewpoint, we present a comprehensive theory of a straightforward, yet versatile SG algorithm, discuss its practical behavior, and highlight opportunities for designing algorithms with improved performance. This leads to a discussion about the next generation of optimization methods for large-scale machine learning, including an investigation of two main streams of research on techniques that diminish noise in the stochastic directions and methods that make use of second-order derivative approximations."} | 143 | {"work_id": 2436219157, "title": "Optimization Methods for Large-Scale Machine Learning", "abstract": "Abstract. This paper provides a review and commentary on the past, present, and future of numerical optimization algorithms in the context of machine learning applications. Through case studies on text classification and the training of deep neural networks, we discuss how optimization problems arise in machine learning and what makes them challenging. A major theme of our study is that large-scale machine learning represents a distinctive setting in which the stochastic gradient (SG) method has traditionally played a central role while conventional gradient-based nonlinear optimization techniques typically falter. Based on this viewpoint, we present a comprehensive theory of a straightforward, yet versatile SG algorithm, discuss its practical behavior, and highlight opportunities for designing algorithms with improved performance. This leads to a discussion about the next generation of optimization methods for large-scale machine learning, including an investigation of two main streams of research on techniques that diminish noise in the stochastic directions and methods that make use of second-order derivative approximations."} | ||
| 78 | {"work_id": 4366420437, "title": "What Is the Impact of ChatGPT on Education? A Rapid Review of the Literature", "abstract": "An artificial intelligence-based chatbot, ChatGPT, was launched in November 2022 and is capable of generating cohesive and informative human-like responses to user input. This rapid review of the literature aims to enrich our understanding of ChatGPT\u2019s capabilities across subject domains, how it can be used in education, and potential issues raised by researchers during the first three months of its release (i.e., December 2022 to February 2023). A search of the relevant databases and Google Scholar yielded 50 articles for content analysis (i.e., open coding, axial coding, and selective coding). The findings of this review suggest that ChatGPT\u2019s performance varied across subject domains, ranging from outstanding (e.g., economics) and satisfactory (e.g., programming) to unsatisfactory (e.g., mathematics). Although ChatGPT has the potential to serve as an assistant for instructors (e.g., to generate course materials and provide suggestions) and a virtual tutor for students (e.g., to answer questions and facilitate collaboration), there were challenges associated with its use (e.g., generating incorrect or fake information and bypassing plagiarism detectors). Immediate action should be taken to update the assessment methods and institutional policies in schools and universities. Instructor training and student education are also essential to respond to the impact of ChatGPT on the educational environment."} | 144 | {"work_id": 4366420437, "title": "What Is the Impact of ChatGPT on Education? A Rapid Review of the Literature", "abstract": "An artificial intelligence-based chatbot, ChatGPT, was launched in November 2022 and is capable of generating cohesive and informative human-like responses to user input. This rapid review of the literature aims to enrich our understanding of ChatGPT\u2019s capabilities across subject domains, how it can be used in education, and potential issues raised by researchers during the first three months of its release (i.e., December 2022 to February 2023). A search of the relevant databases and Google Scholar yielded 50 articles for content analysis (i.e., open coding, axial coding, and selective coding). The findings of this review suggest that ChatGPT\u2019s performance varied across subject domains, ranging from outstanding (e.g., economics) and satisfactory (e.g., programming) to unsatisfactory (e.g., mathematics). Although ChatGPT has the potential to serve as an assistant for instructors (e.g., to generate course materials and provide suggestions) and a virtual tutor for students (e.g., to answer questions and facilitate collaboration), there were challenges associated with its use (e.g., generating incorrect or fake information and bypassing plagiarism detectors). Immediate action should be taken to update the assessment methods and institutional policies in schools and universities. Instructor training and student education are also essential to respond to the impact of ChatGPT on the educational environment."} | ||
| 79 | −{"work_id": 7123365826, "title": "Event-Triggered Zero-Sum Game for Input Saturated Nonlinear Systems With State Constraints", "abstract": "In safety-critical applications, saturated nonlinear systems often face significant control challenges due to the simultaneous presence of strict state constraints, input saturation, and uncertain external disturbances. To address these challenges, this paper proposes a novel event-triggered optimal control (ETOC) method. The core of our approach lies in a unified framework that handles all three issues simultaneously. We first introduce a smooth mapping function to transform the original system with state constraints into an equivalent unconstrained system. Subsequently, the control problem is formulated as a two-player zero-sum game (ZSG), where one player is the controller designed to handle input saturation and the other is the worst-case external disturbance. This unified formulation ensures that the system strictly adheres to the state constraints. Unlike traditional methods that typically require formulating and solving complex modified event-triggered Hamilton-Jacobi-Bellman (HJB) equations incorporating triggering errors, our approach approximates the optimal policy for the transformed system and implements it via an event-triggered mechanism. By utilizing a single-critic neural network (NN) and incorporating an experience replay mechanism, the algorithm\u2019s learning stability is enhanced, and the restrictive persistence of excitation (PE) condition is relaxed. Theoretical analysis and simulations confirm that our ETOC strategy guarantees optimal performance, strict adherence to state constraints, and a significant reduction in communication burden, showcasing its efficiency and practicality."} | ||||
| 80 | −{"work_id": 4411099958, "title": "A multimodal vision foundation model for clinical dermatology", "abstract": "Diagnosing and treating skin diseases require advanced visual skills across domains and the ability to synthesize information from multiple imaging modalities. While current deep learning models excel at specific tasks such as skin cancer diagnosis from dermoscopic images, they struggle to meet the complex, multimodal requirements of clinical practice. Here we introduce PanDerm, a multimodal dermatology foundation model pretrained through self-supervised learning on over 2 million real-world skin disease images from 11 clinical institutions across 4 imaging modalities. We evaluated PanDerm on 28 diverse benchmarks, including skin cancer screening, risk stratification, differential diagnosis of common and rare skin conditions, lesion segmentation, longitudinal monitoring, and metastasis prediction and prognosis. PanDerm achieved state-of-the-art performance across all evaluated tasks, often outperforming existing models when using only 10% of labeled data. We conducted three reader studies to assess PanDerm's potential clinical utility. PanDerm outperformed clinicians by 10.2% in early-stage melanoma detection through longitudinal analysis, improved clinicians' skin cancer diagnostic accuracy by 11% on dermoscopy images and enhanced nondermatologist healthcare providers' differential diagnosis by 16.5% across 128 skin conditions on clinical photographs. These results show PanDerm's potential to improve patient care across diverse clinical scenarios and serve as a model for developing multimodal foundation models in other medical specialties, potentially accelerating the integration of artificial intelligence support in healthcare."} | ||||
| 81 | −{"work_id": 4383312437, "title": "A comprehensive AI policy education framework for university teaching and learning", "abstract": "Abstract This study aims to develop an AI education policy for higher education by examining the perceptions and implications of text generative AI technologies. Data was collected from 457 students and 180 teachers and staff across various disciplines in Hong Kong universities, using both quantitative and qualitative research methods. Based on the findings, the study proposes an AI Ecological Education Policy Framework to address the multifaceted implications of AI integration in university teaching and learning. This framework is organized into three dimensions: Pedagogical, Governance, and Operational. The Pedagogical dimension concentrates on using AI to improve teaching and learning outcomes, while the Governance dimension tackles issues related to privacy, security, and accountability. The Operational dimension addresses matters concerning infrastructure and training. The framework fosters a nuanced understanding of the implications of AI integration in academic settings, ensuring that stakeholders are aware of their responsibilities and can take appropriate actions accordingly."} | ||||
| 82 | −{"work_id": 7138474371, "title": "OpenDriveVLA: Towards End-to-end Autonomous Driving with Large Vision Language Action Model", "abstract": "We present OpenDriveVLA, a Vision-Language Action (VLA) model designed for end-to-end autonomous driving, built upon open-source large language models. OpenDriveVLA generates spatially-grounded driving actions by leveraging multimodal inputs, including both 2D and 3D instance-aware visual representations, ego vehicle states, and language commands. To bridge the modality gap between driving visual representations and language embeddings, we introduce a hierarchical vision-language alignment process, projecting both 2D and 3D structured visual tokens into a unified semantic space. Furthermore, we incorporate structured agent\u2013environment\u2013ego interaction modeling into the autoregressive decoding process, enabling the model to capture fine-grained spatial dependencies and behavior-aware dynamics critical for reliable trajectory planning. Extensive experiments on the nuScenes dataset demonstrate that OpenDriveVLA achieves state-of-the-art results across open-loop trajectory planning and driving-related question-answering tasks. Qualitative analyses further illustrate its superior capability to follow high-level driving commands and robustly generate trajectories under challenging scenarios, highlighting its potential for next-generation end-to-end autonomous driving."} | ||||
| 83 | −{"work_id": 4411932262, "title": "A foundation model to predict and capture human cognition", "abstract": ". A first step towards such a theory is to create a computational model that can predict human behaviour in a wide range of settings. Here we introduce Centaur, a computational model that can predict and simulate human behaviour in any experiment expressible in natural language. We derived Centaur by fine-tuning a state-of-the-art language model on a large-scale dataset called Psych-101. Psych-101 has an unprecedented scale, covering trial-by-trial data from more than 60,000 participants performing in excess of 10,000,000 choices in 160 experiments. Centaur not only captures the behaviour of held-out participants better than existing cognitive models, but it also generalizes to previously unseen cover stories, structural task modifications and entirely new domains. Furthermore, the model's internal representations become more aligned with human neural activity after fine-tuning. Taken together, our results demonstrate that it is possible to discover computational models that capture human behaviour across a wide range of domains. We believe that such models provide tremendous potential for guiding the development of cognitive theories, and we present a case study to demonstrate this."} | ||||
| 84 | −{"work_id": 7130596601, "title": "Human in the loop artificial intelligence in healthcare: applications, outcomes, and implementation challenges", "abstract": "BACKGROUND: The integration of artificial intelligence in healthcare has transformed clinical practice and research methodologies. However, concerns regarding algorithmic accountability, interpretability, and safety have necessitated human oversight in AI systems. Human in the loop artificial intelligence represents a collaborative paradigm where human expertise and machine intelligence converge to enhance decision making while maintaining ethical standards and clinical safety. AIM: This review synthesizes current evidence on human in the loop AI in healthcare delivery and research, examining implementation frameworks, clinical outcomes, comparative advantages over fully automated and clinician-only approaches, and challenges. METHOD: A comprehensive narrative review was conducted using PubMed, Scopus, Web of Science, and IEEE Xplore databases covering studies from 2018 to 2025. Data were thematically synthesized to identify patterns, frameworks, and outcomes. This narrative approach enables comprehensive conceptual synthesis across diverse HITL-AI applications and contexts. RESULTS: Human in the loop AI demonstrates significant applications across diagnostic imaging, clinical decision support, patient monitoring, drug discovery, and research data analysis. Evidence indicates improved diagnostic accuracy, reduced medical errors, enhanced patient safety, and increased clinician trust compared to both automated AI and traditional approaches. Implementation requires EHR interoperability, clear liability frameworks, adaptive training protocols, and quantum-safe cryptographic security. Challenges include workflow integration, regulatory gaps for adaptive systems, and sustainability concerns. CONCLUSION: This review advances the field by synthesizing cross-domain implementation patterns, mapping collaboration models to risk-stratified contexts, identifying regulatory gaps for adaptive systems, and proposing future directions including post-quantum cryptographic integration, AI-driven adaptive architectures, and multi-center scalability frameworks for optimizing human-machine collaboration in healthcare."} | ||||
| 85 | −{"work_id": 7128436456, "title": "Synthesis of model predictive control and reinforcement learning: Survey and classification", "abstract": "model predictive control (MPC) and reinforcement learning (RL) are two successful control techniques for Markov decision processes. Both approaches are derived from similar fundamental principles, and both are widely used in practical applications, including robotics, process control, energy systems, and autonomous driving. Despite their similarities, MPC and RL follow distinct paradigms that emerged from diverse communities and different requirements. Various technical discrepancies, particularly the role of an environment model as part of the algorithm, lead to methodologies with nearly complementary advantages. Due to their orthogonal benefits, research interest in combination methods has recently increased significantly, resulting in a large and growing set of complex ideas that leverage MPC and RL. This work illuminates the differences, similarities, and fundamentals that enable various combination algorithms and categorizes existing work accordingly. Particularly, we focus on the versatile actor\u2013critic RL approach as a basis for our categorization and examine how the online optimization approach of MPC can be used to improve the overall closed-loop performance of a policy."} | ||||
| 86 | −{"work_id": 4406170795, "title": "Accurate predictions on small data with a tabular foundation model", "abstract": "Abstract Tabular data, spreadsheets organized in rows and columns, are ubiquitous across scientific fields, from biomedicine to particle physics to economics and climate science 1,2 . The fundamental prediction task of filling in missing values of a label column based on the rest of the columns is essential for various applications as diverse as biomedical risk models, drug discovery and materials science. Although deep learning has revolutionized learning from raw data and led to numerous high-profile success stories 3\u20135 , gradient-boosted decision trees 6\u20139 have dominated tabular data for the past 20 years. Here we present the Tabular Prior-data Fitted Network (TabPFN), a tabular foundation model that outperforms all previous methods on datasets with up to 10,000 samples by a wide margin, using substantially less training time. In 2.8 s, TabPFN outperforms an ensemble of the strongest baselines tuned for 4 h in a classification setting. As a generative transformer-based foundation model, this model also allows fine-tuning, data generation, density estimation and learning reusable embeddings. TabPFN is a learning algorithm that is itself learned across millions of synthetic datasets, demonstrating the power of this approach for algorithm development. By improving modelling abilities across diverse fields, TabPFN has the potential to accelerate scientific discovery and enhance important decision-making in various domains."} | ||||
| 87 | −{"work_id": 7143512276, "title": "Multimodal Machine Learning Approaches in Predictive Healthcare Analytics: A Comprehensive Survey", "abstract": "This survey explores the application of multimodal machine learning techniques in predictive healthcare analytics. By integrating various data modalities, such as medical imaging, clinical text, time-series signals, and structured tabular data, these approaches aim to emulate clinical reasoning and enhance diagnostic and prognostic accuracy. Across studies, multimodal ML consistently outperformed unimodal baselines, with intermediate fusion employed in 60% of cases and achieving average AUC improvements of 5\u201312% over single-modality models. Oncology and neurology emerged as the leading domains, where combining imaging with genomic and cognitive data significantly improved cancer survival and Alzheimer\u2019s detection. Despite progress, key challenges persist, including modality misalignment (23%), missing data (18%), and limited external validation (12%). Recent trends highlight transformer-based cross-modal attention, self-supervised learning for data-scarce settings, and hybrid fusion architectures in critical care. While multimodal ML offers clear clinical advantages, regulatory constraints and interoperability gaps continue to hinder deployment. This survey contributes to the existing literature by providing a comprehensive synthesis of multimodal ML applications across healthcare domains. It documents comparative fusion strategies, modelling approaches, and empirical performance outcomes. The paper\u2019s primary contribution lies in identifying intermediate fusion as the most effective integration strategy and revealing systematic gaps in external validation and model transparency that must be addressed for clinically trustworthy multimodal systems."} | ||||
| 88 | −{"work_id": 4389473504, "title": "TRUST-REGION BASED POLICY OPTIMIZATION FOR EFFICIENT REINFORCEMENT LEARNING", "abstract": "Reinforcement Learning (RL) has achieved remarkable success in solving complicated control and sequential decision-making tasks in recent years, such as board games, video games, robot control, dynamic energy management, and autonomous driving. In these tasks, RL has demonstrated unprecedented adaptability and self-learning capability in unknown and stochastic environments. However, existing RL algorithms still have significant disadvantages and shortcomings compared to human intelligence, such as learning stability, sample efficiency, safety, scalability, and collaboration with other agents. These drawbacks impede the widespread application of RL in real-life domains. To address these challenges, this dissertation aims to propose novel theories and algorithms for more effective and efficient RL and to develop their applications in real-world domains. This work consists of three major parts. First, the dissertation establishes a novel theoretical result for trust-region-based RL methods by analyzing the lower bound of policy performance. A closed-form policy update rule is then derived based on the theoretical result, providing a monotonic improvement guarantee. Second, the dissertation develops an off-policy RL algorithm for continuous control problems, inspired by the closed-form update rule. This algorithm enables sample-efficient learning of deep neural network policies. Additionally, trust region policy optimization is extended to cooperative multi-agent systems through consensus optimization, resulting in a distributed MARL algorithm. Third, the dissertation develops the real-world applications of a trust-region-based safe RL method and the MARL method in smart grids. Numerous experiments are conducted to verify the effectiveness of these methods using various benchmark environments, including robotics, strategic games, and power systems."} | ||||
| 89 | −{"work_id": 7131830459, "title": "A Survey on Multimodal Recommender Systems: Recent Advances and Future Directions", "abstract": "The exponential growth of online information has made it increasingly difficult for users to identify valuable and relevant content. Recommender systems have emerged as a critical solution to this challenge by tailoring content to individual preferences. With the proliferation of diverse multimedia services, human interaction with the digital world has become inherently multimodal. Consequently, recommender systems capable of comprehending and interpreting multimodal information can more effectively align with individual preferences. With its recent surge in research attention, the field of multimodal recommender systems (MRS) still lacks a comprehensive technical survey. Existing surveys suffer from two critical limitations: 1) Insufficient technical depth: Prior works predominantly focus on categorizing and discussing general structure, neglecting rigorous technical analysis of methodologies and architectures. 2) Absence of cutting-edge works: Due to the rapid evolution of AI technologies, current surveys fail to discuss the latest works that adopt the most advanced techniques. To bridge these gaps, this survey conducts a systematic and technical review of advanced MRS works from MRS's inception to the present. We organize existing works into coherent taxonomies based on their structure and provide in-depth analyses of methodological innovations at each component, including Feature Extraction, Encoder, Multimodal Fusion, and Loss Function. Moreover, we further discuss potential future directions for developing and enhancing MRS. This survey serves as technical guidance for researchers and practitioners, offering insights into the developments, techniques, and future directions of MRS. Notably, we maintain a public repository:https://github.com/Jinfeng-Xu/Awesome-Multimodal-Recommender-Systems."} | ||||
| 90 | −{"work_id": 2969896603, "title": "A Survey on Bias and Fairness in Machine Learning", "abstract": "With the widespread use of artificial intelligence (AI) systems and applications in our everyday lives, accounting for fairness has gained significant importance in designing and engineering of such systems. AI systems can be used in many sensitive environments to make important and life-changing decisions; thus, it is crucial to ensure that these decisions do not reflect discriminatory behavior toward certain groups or populations. More recently some work has been developed in traditional machine learning and deep learning that address such challenges in different subdomains. With the commercialization of these systems, researchers are becoming more aware of the biases that these applications can contain and are attempting to address them. In this survey, we investigated different real-world applications that have shown biases in various ways, and we listed different sources of biases that can affect AI applications. We then created a taxonomy for fairness definitions that machine learning researchers have defined to avoid the existing bias in AI systems. In addition to that, we examined different domains and subdomains in AI showing what researchers have observed with regard to unfair outcomes in the state-of-the-art methods and ways they have tried to address them. There are still many future directions and solutions that can be taken to mitigate the problem of bias in AI systems. We are hoping that this survey will motivate researchers to tackle these issues in the near future by observing existing work in their respective fields."} | ||||
| 91 | −{"work_id": 3185341429, "title": "Pre-train, Prompt, and Predict: A Systematic Survey of Prompting Methods in Natural Language Processing", "abstract": "This article surveys and organizes research works in a new paradigm in natural language processing, which we dub \u201cprompt-based learning.\u201d Unlike traditional supervised learning, which trains a model to take in an input x and predict an output y as P ( y|x ), prompt-based learning is based on language models that model the probability of text directly. To use these models to perform prediction tasks, the original input x is modified using a template into a textual string prompt x\u2032 that has some unfilled slots, and then the language model is used to probabilistically fill the unfilled information to obtain a final string x\u0302 , from which the final output y can be derived. This framework is powerful and attractive for a number of reasons: It allows the language model to be pre-trained on massive amounts of raw text, and by defining a new prompting function the model is able to perform few-shot or even zero-shot learning, adapting to new scenarios with few or no labeled data. In this article, we introduce the basics of this promising paradigm, describe a unified set of mathematical notations that can cover a wide variety of existing work, and organize existing work along several dimensions, e.g., the choice of pre-trained language models, prompts, and tuning strategies. To make the field more accessible to interested beginners, we not only make a systematic review of existing works and a highly structured typology of prompt-based concepts but also release other resources, e.g., a website NLPedia\u2013Pretrain including constantly updated survey and paperlist."} | ||||
| 92 | −{"work_id": 4399450035, "title": "Power Hungry Processing: Watts Driving the Cost of AI Deployment?", "abstract": "Recent years have seen a surge in the popularity of commercial AI products based on generative, multi-purpose AI systems promising a unified approach to building machine learning (ML) models into technology. However, this ambition of \u201cgenerality\u201d comes at a steep cost to the environment, given the amount of energy these systems require and the amount of carbon that they emit. In this work, we propose the first systematic comparison of the ongoing inference cost of various categories of ML systems, covering both task-specific (i.e. finetuned models that carry out a single task) and \u2018general-purpose\u2019 models, (i.e. those trained for multiple tasks). We measure deployment cost as the amount of energy and carbon required to perform 1,000 inferences on representative benchmark dataset using these models. We find that multi-purpose, generative architectures are orders of magnitude more expensive than task-specific systems for a variety of tasks, even when controlling for the number of model parameters. We conclude with a discussion around the current trend of deploying multi-purpose generative ML systems, and caution that their utility should be more intentionally weighed against increased costs in terms of energy and emissions. All the data from our study can be accessed via an interactive demo to carry out further exploration and analysis."} | ||||
| 93 | −{"work_id": 4322718191, "title": "LLaMA: Open and Efficient Foundation Language Models", "abstract": "We introduce LLaMA, a collection of foundation language models ranging from 7B to 65B parameters. We train our models on trillions of tokens, and show that it is possible to train state-of-the-art models using publicly available datasets exclusively, without resorting to proprietary and inaccessible datasets. In particular, LLaMA-13B outperforms GPT-3 (175B) on most benchmarks, and LLaMA-65B is competitive with the best models, Chinchilla-70B and PaLM-540B. We release all our models to the research community."} | ||||
| 94 | {"work_id": 7154011589, "title": "Modelos pr\u00e9-treinados de LLM e quest\u00f5es \u00e9ticas face aos direitos autorais", "abstract": "O avan\u00e7o dos modelos de linguagem de grande escala (LLMs) pr\u00e9-treinados tem ampliado significativamente as aplica\u00e7\u00f5es da intelig\u00eancia artificial, ao mesmo tempo em que suscita debates relevantes acerca de aspectos \u00e9ticos e jur\u00eddicos relacionados ao uso de conte\u00fados protegidos por direitos autorais. Neste contexto, o presente estudo investiga o seguinte problema de pesquisa: os assistentes de intelig\u00eancia artificial respeitaram integralmente os direitos autorais em todas as etapas de seu processo de treinamento? Parte-se da hip\u00f3tese de que a maioria dos modelos de linguagem foi treinada, ao menos parcialmente, com dados que incluem conte\u00fados protegidos por direitos autorais. O objetivo geral da pesquisa consiste em demonstrar se h\u00e1 presen\u00e7a de conte\u00fado que configure poss\u00edvel infra\u00e7\u00e3o \u00e9tica relacionada a direitos autorais no treinamento de sistemas de intelig\u00eancia artificial. Como objetivos espec\u00edficos, busca-se: (i) conceituar intelig\u00eancia artificial, modelos de linguagem, seu funcionamento e processos de treinamento; (ii) apresentar os fundamentos da prote\u00e7\u00e3o autoral e os aspectos \u00e9ticos envolvidos no uso de conte\u00fados protegidos; e (iii) analisar respostas produzidas por modelos de intelig\u00eancia artificial diante de solicita\u00e7\u00f5es relacionadas a obras protegidas por direitos autorais. A justificativa da pesquisa fundamenta-se na crescente relev\u00e2ncia acad\u00eamica e social do tema, diante da r\u00e1pida dissemina\u00e7\u00e3o de tecnologias baseadas em intelig\u00eancia artificial e das discuss\u00f5es sobre regula\u00e7\u00e3o, responsabilidade e \u00e9tica no uso de dados para treinamento desses sistemas. Metodologicamente, o estudo adota o m\u00e9todo dedutivo, com abordagem qualitativa, baseada em revis\u00e3o bibliogr\u00e1fica e an\u00e1lise interpretativa das respostas fornecidas por modelos de intelig\u00eancia artificial em rela\u00e7\u00e3o a conte\u00fados potencialmente protegidos por direitos autorais."} | 145 | {"work_id": 7154011589, "title": "Modelos pr\u00e9-treinados de LLM e quest\u00f5es \u00e9ticas face aos direitos autorais", "abstract": "O avan\u00e7o dos modelos de linguagem de grande escala (LLMs) pr\u00e9-treinados tem ampliado significativamente as aplica\u00e7\u00f5es da intelig\u00eancia artificial, ao mesmo tempo em que suscita debates relevantes acerca de aspectos \u00e9ticos e jur\u00eddicos relacionados ao uso de conte\u00fados protegidos por direitos autorais. Neste contexto, o presente estudo investiga o seguinte problema de pesquisa: os assistentes de intelig\u00eancia artificial respeitaram integralmente os direitos autorais em todas as etapas de seu processo de treinamento? Parte-se da hip\u00f3tese de que a maioria dos modelos de linguagem foi treinada, ao menos parcialmente, com dados que incluem conte\u00fados protegidos por direitos autorais. O objetivo geral da pesquisa consiste em demonstrar se h\u00e1 presen\u00e7a de conte\u00fado que configure poss\u00edvel infra\u00e7\u00e3o \u00e9tica relacionada a direitos autorais no treinamento de sistemas de intelig\u00eancia artificial. Como objetivos espec\u00edficos, busca-se: (i) conceituar intelig\u00eancia artificial, modelos de linguagem, seu funcionamento e processos de treinamento; (ii) apresentar os fundamentos da prote\u00e7\u00e3o autoral e os aspectos \u00e9ticos envolvidos no uso de conte\u00fados protegidos; e (iii) analisar respostas produzidas por modelos de intelig\u00eancia artificial diante de solicita\u00e7\u00f5es relacionadas a obras protegidas por direitos autorais. A justificativa da pesquisa fundamenta-se na crescente relev\u00e2ncia acad\u00eamica e social do tema, diante da r\u00e1pida dissemina\u00e7\u00e3o de tecnologias baseadas em intelig\u00eancia artificial e das discuss\u00f5es sobre regula\u00e7\u00e3o, responsabilidade e \u00e9tica no uso de dados para treinamento desses sistemas. Metodologicamente, o estudo adota o m\u00e9todo dedutivo, com abordagem qualitativa, baseada em revis\u00e3o bibliogr\u00e1fica e an\u00e1lise interpretativa das respostas fornecidas por modelos de intelig\u00eancia artificial em rela\u00e7\u00e3o a conte\u00fados potencialmente protegidos por direitos autorais."} | ||
| 146 | +{"work_id": 4401588926, "title": "The potential impact of Artificial Intelligence on equity and inclusion in education", "abstract": "This working paper reviews the impact of Artificial Intelligence (AI) on equity and inclusion in education, focusing on learner-centred, teacher-led and other institutional AI tools. It highlights the potential of AI in adapting learning while also addressing challenges such as access issues, inherent biases and the need for comprehensive teacher training. The paper emphasises the importance of balancing the potential benefits of AI with ethical considerations and the risk of exacerbating existing disparities. It highlights the need to address privacy and ethical concerns, enhance cultural responsiveness, manage techno ableism and provide continuing professional learning in AI. Additionally, the paper stresses the importance of maintaining educational integrity amidst growing commercial influence. It encourages research on AI tools\u2019 implications for equity and inclusion to ensure that AI adoption in education supports a more equitable and inclusive learning environment."} | ||||
| 95 | {"work_id": 4414991289, "title": "\u201cDIVE\u201d into hydrogen storage materials discovery with AI agents", "abstract": "Despite the surge of AI in energy materials research, fully autonomous workflows that connect high-precision experimental knowledge to the discovery of credible new energy-related materials remain at an early stage. Here, we develop the Descriptive Interpretation of Visual Expression (DIVE) multi-agent workflow, which systematically reads and organizes experimental data from graphical elements in scientific literature. Applied to solid-state hydrogen storage materials-a class of materials central to future clean-energy technologies-DIVE markedly improves the accuracy and coverage of data extraction compared to the direct extraction method, with gains of 10-15% over commercial models and over 30% relative to open-source models. Building on a curated database of over 30 000 entries from >4000 publications, we establish a rapid inverse-design AI workflow capable of proposing new materials within minutes. This transferable, end-to-end paradigm illustrates how multimodal AI agents can convert literature-embedded scientific knowledge into actionable innovation, offering a scalable pathway for accelerated discovery across chemistry and materials science."} | 147 | {"work_id": 4414991289, "title": "\u201cDIVE\u201d into hydrogen storage materials discovery with AI agents", "abstract": "Despite the surge of AI in energy materials research, fully autonomous workflows that connect high-precision experimental knowledge to the discovery of credible new energy-related materials remain at an early stage. Here, we develop the Descriptive Interpretation of Visual Expression (DIVE) multi-agent workflow, which systematically reads and organizes experimental data from graphical elements in scientific literature. Applied to solid-state hydrogen storage materials-a class of materials central to future clean-energy technologies-DIVE markedly improves the accuracy and coverage of data extraction compared to the direct extraction method, with gains of 10-15% over commercial models and over 30% relative to open-source models. Building on a curated database of over 30 000 entries from >4000 publications, we establish a rapid inverse-design AI workflow capable of proposing new materials within minutes. This transferable, end-to-end paradigm illustrates how multimodal AI agents can convert literature-embedded scientific knowledge into actionable innovation, offering a scalable pathway for accelerated discovery across chemistry and materials science."} | ||
| 96 | {"work_id": 2098774185, "title": "Maximum Entropy Inverse Reinforcement Learning", "abstract": "Recent research has shown the bene\ufb01t of framing problems of imitation learning as solutions to Markov Decision Problems. This approach reduces learning to the problem of re- covering a utility function that makes the behavior induced by a near-optimal policy closely mimic demonstrated behavior. In this work, we develop a probabilistic approach based on the principle of maximum entropy. Our approach provides a well-de\ufb01ned, globally normalized distribution over decision sequences, while providing the same performance guarantees as existing methods. We develop our technique in the context of modeling real world navigation and driving behaviors where collected data is inherently noisy and imperfect. Our probabilistic approach enables modeling of route preferences as well as a powerful new approach to inferring destinations and routes based on partial trajectories."} | 148 | {"work_id": 2098774185, "title": "Maximum Entropy Inverse Reinforcement Learning", "abstract": "Recent research has shown the bene\ufb01t of framing problems of imitation learning as solutions to Markov Decision Problems. This approach reduces learning to the problem of re- covering a utility function that makes the behavior induced by a near-optimal policy closely mimic demonstrated behavior. In this work, we develop a probabilistic approach based on the principle of maximum entropy. Our approach provides a well-de\ufb01ned, globally normalized distribution over decision sequences, while providing the same performance guarantees as existing methods. We develop our technique in the context of modeling real world navigation and driving behaviors where collected data is inherently noisy and imperfect. Our probabilistic approach enables modeling of route preferences as well as a powerful new approach to inferring destinations and routes based on partial trajectories."} | ||
| 97 | {"work_id": 4407243994, "title": "AI Ethics: Integrating Transparency, Fairness, and Privacy in AI Development", "abstract": "The expansion of Artificial Intelligence in sectors such as healthcare, finance, and communication has raised critical ethical concerns surrounding transparency, fairness, and privacy. Addressing these issues is essential for the responsible development and deployment of AI systems. This research establishes a comprehensive ethical framework that mitigates biases and promotes accountability in AI technologies. A comparative analysis of international AI policy frameworks from regions including the European Union, United States, and China is conducted using analytical tools such as Venn diagrams and Cartesian graphs. These tools allow for a visual and systematic evaluation of the ethical principles guiding AI development across different jurisdictions. The results reveal significant variations in how global regions prioritise transparency, fairness, and privacy, with challenges in creating a unified ethical standard. To address these challenges, we propose technical strategies, including fairness-aware algorithms, routine audits, and the establishment of diverse development teams to ensure ethical AI practices. This paper provides actionable recommendations for integrating ethical oversight into the AI lifecycle, advocating for the creation of AI systems that are both technically sophisticated and aligned with societal values. The findings underscore the necessity of global collaboration in fostering ethical AI development."} | 149 | {"work_id": 4407243994, "title": "AI Ethics: Integrating Transparency, Fairness, and Privacy in AI Development", "abstract": "The expansion of Artificial Intelligence in sectors such as healthcare, finance, and communication has raised critical ethical concerns surrounding transparency, fairness, and privacy. Addressing these issues is essential for the responsible development and deployment of AI systems. This research establishes a comprehensive ethical framework that mitigates biases and promotes accountability in AI technologies. A comparative analysis of international AI policy frameworks from regions including the European Union, United States, and China is conducted using analytical tools such as Venn diagrams and Cartesian graphs. These tools allow for a visual and systematic evaluation of the ethical principles guiding AI development across different jurisdictions. The results reveal significant variations in how global regions prioritise transparency, fairness, and privacy, with challenges in creating a unified ethical standard. To address these challenges, we propose technical strategies, including fairness-aware algorithms, routine audits, and the establishment of diverse development teams to ensure ethical AI practices. This paper provides actionable recommendations for integrating ethical oversight into the AI lifecycle, advocating for the creation of AI systems that are both technically sophisticated and aligned with societal values. The findings underscore the necessity of global collaboration in fostering ethical AI development."} | ||
@@ -104,75 +156,24 @@ | |||||
| 104 | {"work_id": 4382203079, "title": "Are Transformers Effective for Time Series Forecasting?", "abstract": "Recently, there has been a surge of Transformer-based solutions for the long-term time series forecasting (LTSF) task. Despite the growing performance over the past few years, we question the validity of this line of research in this work. Specifically, Transformers is arguably the most successful solution to extract the semantic correlations among the elements in a long sequence. However, in time series modeling, we are to extract the temporal relations in an ordered set of continuous points. While employing positional encoding and using tokens to embed sub-series in Transformers facilitate preserving some ordering information, the nature of the permutation-invariant self-attention mechanism inevitably results in temporal information loss. To validate our claim, we introduce a set of embarrassingly simple one-layer linear models named LTSF-Linear for comparison. Experimental results on nine real-life datasets show that LTSF-Linear surprisingly outperforms existing sophisticated Transformer-based LTSF models in all cases, and often by a large margin. Moreover, we conduct comprehensive empirical studies to explore the impacts of various design elements of LTSF models on their temporal relation extraction capability. We hope this surprising finding opens up new research directions for the LTSF task. We also advocate revisiting the validity of Transformer-based solutions for other time series analysis tasks (e.g., anomaly detection) in the future."} | 156 | {"work_id": 4382203079, "title": "Are Transformers Effective for Time Series Forecasting?", "abstract": "Recently, there has been a surge of Transformer-based solutions for the long-term time series forecasting (LTSF) task. Despite the growing performance over the past few years, we question the validity of this line of research in this work. Specifically, Transformers is arguably the most successful solution to extract the semantic correlations among the elements in a long sequence. However, in time series modeling, we are to extract the temporal relations in an ordered set of continuous points. While employing positional encoding and using tokens to embed sub-series in Transformers facilitate preserving some ordering information, the nature of the permutation-invariant self-attention mechanism inevitably results in temporal information loss. To validate our claim, we introduce a set of embarrassingly simple one-layer linear models named LTSF-Linear for comparison. Experimental results on nine real-life datasets show that LTSF-Linear surprisingly outperforms existing sophisticated Transformer-based LTSF models in all cases, and often by a large margin. Moreover, we conduct comprehensive empirical studies to explore the impacts of various design elements of LTSF models on their temporal relation extraction capability. We hope this surprising finding opens up new research directions for the LTSF task. We also advocate revisiting the validity of Transformer-based solutions for other time series analysis tasks (e.g., anomaly detection) in the future."} | ||
| 105 | {"work_id": 4322832366, "title": "TimeMAE: Self-Supervised Representations of Time Series with Decoupled Masked Autoencoders", "abstract": "Learning transferable representations from unlabeled time series is crucial for improving performance in data-scarce classification. Existing self-supervised methods often operate at the point level and rely on unidirectional encoding, leading to low semantic density and a mismatch between pre-training and downstream optimization. In this paper, we propose TimeMAE, a self-supervised framework that reformulates masked modeling for time series via semantic unit elevation and decoupled representation learning. Instead of modeling individual time steps, TimeMAE segments time series into non-overlapping sub-series to form semantically enriched units, enabling more informative masked reconstruction while reducing computational cost. To address the representation discrepancy introduced by masking, we design a decoupled masked autoencoder that separately encodes visible and masked regions, avoiding artificial masked tokens in the main encoder. To guide pre-training, we introduce two complementary objectives: masked codeword classification, which discretizes sub-series semantics via a learned tokenizer and masked representation regression, which aligns continuous representations through a momentum-updated target encoder. Extensive experiments on five datasets demonstrate that TimeMAE outperforms competitive baselines, particularly in label-scarce scenarios and transfer learning scenarios. Our codes are publicly available at https://github.com/Mingyue-Cheng/TimeMAE."} | 157 | {"work_id": 4322832366, "title": "TimeMAE: Self-Supervised Representations of Time Series with Decoupled Masked Autoencoders", "abstract": "Learning transferable representations from unlabeled time series is crucial for improving performance in data-scarce classification. Existing self-supervised methods often operate at the point level and rely on unidirectional encoding, leading to low semantic density and a mismatch between pre-training and downstream optimization. In this paper, we propose TimeMAE, a self-supervised framework that reformulates masked modeling for time series via semantic unit elevation and decoupled representation learning. Instead of modeling individual time steps, TimeMAE segments time series into non-overlapping sub-series to form semantically enriched units, enabling more informative masked reconstruction while reducing computational cost. To address the representation discrepancy introduced by masking, we design a decoupled masked autoencoder that separately encodes visible and masked regions, avoiding artificial masked tokens in the main encoder. To guide pre-training, we introduce two complementary objectives: masked codeword classification, which discretizes sub-series semantics via a learned tokenizer and masked representation regression, which aligns continuous representations through a momentum-updated target encoder. Extensive experiments on five datasets demonstrate that TimeMAE outperforms competitive baselines, particularly in label-scarce scenarios and transfer learning scenarios. Our codes are publicly available at https://github.com/Mingyue-Cheng/TimeMAE."} | ||
| 106 | {"work_id": 4362515116, "title": "A Survey of Large Language Models", "abstract": "Abstract The rapid evolution of large language models (LLMs) has driven a transformative shift in artificial intelligence (AI), reshaping both research paradigms and practical applications. Distinguished from their predecessors by unprecedented scale and advanced capabilities, LLMs necessitate new frameworks for understanding their development, behavior, and societal impact. This survey systematically reviews recent advancements in LLM techniques across four key dimensions: (1) pre-training methodologies, which establish core model capabilities through large-scale self-supervised training, architectural innovations, and data curation strategies; (2) post-training techniques, including supervised fine-tuning and reinforcement learning, which adapt foundational models to downstream tasks and enhance their alignment and safety; (3) utilization strategies, such as in-context learning, prompt engineering, and agentic reasoning, that optimize real-world deployment and enable effective interaction with external environments; and (4) evaluation methods, encompassing benchmarks for key ability dimensions such as core language capabilities, reasoning, and safety, which support comprehensive and reliable assessment of model performance. Additionally, we identify critical research issues, including those concerning theoretical foundations, efficient scaling, alignment, and agentic capability, and highlight the open challenges they present. By synthesizing state-of-the-art insights and emerging trends, this survey aims to provide a systematic and comprehensive framework for understanding the trajectory, current limitations, and future directions of LLM progress."} | 158 | {"work_id": 4362515116, "title": "A Survey of Large Language Models", "abstract": "Abstract The rapid evolution of large language models (LLMs) has driven a transformative shift in artificial intelligence (AI), reshaping both research paradigms and practical applications. Distinguished from their predecessors by unprecedented scale and advanced capabilities, LLMs necessitate new frameworks for understanding their development, behavior, and societal impact. This survey systematically reviews recent advancements in LLM techniques across four key dimensions: (1) pre-training methodologies, which establish core model capabilities through large-scale self-supervised training, architectural innovations, and data curation strategies; (2) post-training techniques, including supervised fine-tuning and reinforcement learning, which adapt foundational models to downstream tasks and enhance their alignment and safety; (3) utilization strategies, such as in-context learning, prompt engineering, and agentic reasoning, that optimize real-world deployment and enable effective interaction with external environments; and (4) evaluation methods, encompassing benchmarks for key ability dimensions such as core language capabilities, reasoning, and safety, which support comprehensive and reliable assessment of model performance. Additionally, we identify critical research issues, including those concerning theoretical foundations, efficient scaling, alignment, and agentic capability, and highlight the open challenges they present. By synthesizing state-of-the-art insights and emerging trends, this survey aims to provide a systematic and comprehensive framework for understanding the trajectory, current limitations, and future directions of LLM progress."} | ||
| 107 | −{"work_id": 4327810158, "title": "GPT-4 Technical Report", "abstract": "Abstract\u2014Large Language Models (LLMs) suffer from inherent stochasticity, limiting their utility in high-stakes enterprise environments where determinism and auditability are required. This paper introduces the MFOUR Vibe Framework (MVF), a platform-agnostic architectural standard that transforms probabilistic natural language intent into deterministic software artifacts. We define a five-layer topology, comprising the Kernel Identity, Synaptic Routing, Interface Contracts, Context Anchoring, and the Mirror Test. Furthermore, we introduce The Vibe Integrity Score (VIS), a quantitative metric for evaluating the structural adherence of generative outputs. This specification provides the foundational schema and logic protocols for building \"Glass Box\" AI systems that are observable, secure, and commercially viable."} | ||||
| 108 | {"work_id": 4366262984, "title": "Explainable Artificial Intelligence (XAI): What we know and what is left to attain Trustworthy Artificial Intelligence", "abstract": "Artificial intelligence (AI) is currently being utilized in a wide range of sophisticated applications, but the outcomes of many AI models are challenging to comprehend and trust due to their black-box nature. Usually, it is essential to understand the reasoning behind an AI model\u2019s decision-making. Thus, the need for eXplainable AI (XAI) methods for improving trust in AI models has arisen. XAI has become a popular research subject within the AI field in recent years. Existing survey papers have tackled the concepts of XAI, its general terms, and post-hoc explainability methods but there have not been any reviews that have looked at the assessment methods, available tools, XAI datasets, and other related aspects. Therefore, in this comprehensive study, we provide readers with an overview of the current research and trends in this rapidly emerging area with a case study example. The study starts by explaining the background of XAI, common definitions, and summarizing recently proposed techniques in XAI for supervised machine learning. The review divides XAI techniques into four axes using a hierarchical categorization system: (i) data explainability, (ii) model explainability, (iii) post-hoc explainability, and (iv) assessment of explanations. We also introduce available evaluation metrics as well as open-source packages and datasets with future research directions. Then, the significance of explainability in terms of legal demands, user viewpoints, and application orientation is outlined, termed as XAI concerns. This paper advocates for tailoring explanation content to specific user types. An examination of XAI techniques and evaluation was conducted by looking at 410 critical articles, published between January 2016 and October 2022, in reputed journals and using a wide range of research databases as a source of information. The article is aimed at XAI researchers who are interested in making their AI models more trustworthy, as well as towards researchers from other disciplines who are looking for effective XAI methods to complete tasks with confidence while communicating meaning from data."} | 159 | {"work_id": 4366262984, "title": "Explainable Artificial Intelligence (XAI): What we know and what is left to attain Trustworthy Artificial Intelligence", "abstract": "Artificial intelligence (AI) is currently being utilized in a wide range of sophisticated applications, but the outcomes of many AI models are challenging to comprehend and trust due to their black-box nature. Usually, it is essential to understand the reasoning behind an AI model\u2019s decision-making. Thus, the need for eXplainable AI (XAI) methods for improving trust in AI models has arisen. XAI has become a popular research subject within the AI field in recent years. Existing survey papers have tackled the concepts of XAI, its general terms, and post-hoc explainability methods but there have not been any reviews that have looked at the assessment methods, available tools, XAI datasets, and other related aspects. Therefore, in this comprehensive study, we provide readers with an overview of the current research and trends in this rapidly emerging area with a case study example. The study starts by explaining the background of XAI, common definitions, and summarizing recently proposed techniques in XAI for supervised machine learning. The review divides XAI techniques into four axes using a hierarchical categorization system: (i) data explainability, (ii) model explainability, (iii) post-hoc explainability, and (iv) assessment of explanations. We also introduce available evaluation metrics as well as open-source packages and datasets with future research directions. Then, the significance of explainability in terms of legal demands, user viewpoints, and application orientation is outlined, termed as XAI concerns. This paper advocates for tailoring explanation content to specific user types. An examination of XAI techniques and evaluation was conducted by looking at 410 critical articles, published between January 2016 and October 2022, in reputed journals and using a wide range of research databases as a source of information. The article is aimed at XAI researchers who are interested in making their AI models more trustworthy, as well as towards researchers from other disciplines who are looking for effective XAI methods to complete tasks with confidence while communicating meaning from data."} | ||
| 109 | {"work_id": 4360836968, "title": "Sparks of Artificial General Intelligence: Early experiments with GPT-4", "abstract": "Artificial intelligence (AI) researchers have been developing and refining large language models (LLMs) that exhibit remarkable capabilities across a variety of domains and tasks, challenging our understanding of learning and cognition. The latest model developed by OpenAI, GPT-4, was trained using an unprecedented scale of compute and data. In this paper, we report on our investigation of an early version of GPT-4, when it was still in active development by OpenAI. We contend that (this early version of) GPT-4 is part of a new cohort of LLMs (along with ChatGPT and Google's PaLM for example) that exhibit more general intelligence than previous AI models. We discuss the rising capabilities and implications of these models. We demonstrate that, beyond its mastery of language, GPT-4 can solve novel and difficult tasks that span mathematics, coding, vision, medicine, law, psychology and more, without needing any special prompting. Moreover, in all of these tasks, GPT-4's performance is strikingly close to human-level performance, and often vastly surpasses prior models such as ChatGPT. Given the breadth and depth of GPT-4's capabilities, we believe that it could reasonably be viewed as an early (yet still incomplete) version of an artificial general intelligence (AGI) system. In our exploration of GPT-4, we put special emphasis on discovering its limitations, and we discuss the challenges ahead for advancing towards deeper and more comprehensive versions of AGI, including the possible need for pursuing a new paradigm that moves beyond next-word prediction. We conclude with reflections on societal influences of the recent technological leap and future research directions."} | 160 | {"work_id": 4360836968, "title": "Sparks of Artificial General Intelligence: Early experiments with GPT-4", "abstract": "Artificial intelligence (AI) researchers have been developing and refining large language models (LLMs) that exhibit remarkable capabilities across a variety of domains and tasks, challenging our understanding of learning and cognition. The latest model developed by OpenAI, GPT-4, was trained using an unprecedented scale of compute and data. In this paper, we report on our investigation of an early version of GPT-4, when it was still in active development by OpenAI. We contend that (this early version of) GPT-4 is part of a new cohort of LLMs (along with ChatGPT and Google's PaLM for example) that exhibit more general intelligence than previous AI models. We discuss the rising capabilities and implications of these models. We demonstrate that, beyond its mastery of language, GPT-4 can solve novel and difficult tasks that span mathematics, coding, vision, medicine, law, psychology and more, without needing any special prompting. Moreover, in all of these tasks, GPT-4's performance is strikingly close to human-level performance, and often vastly surpasses prior models such as ChatGPT. Given the breadth and depth of GPT-4's capabilities, we believe that it could reasonably be viewed as an early (yet still incomplete) version of an artificial general intelligence (AGI) system. In our exploration of GPT-4, we put special emphasis on discovering its limitations, and we discuss the challenges ahead for advancing towards deeper and more comprehensive versions of AGI, including the possible need for pursuing a new paradigm that moves beyond next-word prediction. We conclude with reflections on societal influences of the recent technological leap and future research directions."} | ||
| 110 | {"work_id": 4384918448, "title": "Behavioral Safety and Context Retention of Large Language Models in a Longitudinal ICU Simulation under Offline Conditions", "abstract": "Background. Large language models (LLMs) are increasingly proposed as clinical assistants in critical care, yet their behaviour under prolonged clinical context, conflicting data and authoritative pressure remains insufficiently evaluated. This is particularly relevant for offline or resource-constrained environments, where cloud-based safeguards are unavailable. Methods. I conducted a fully automated behavioural evaluation of 23 open-weight language models using a structured, time-series intensive care unit (ICU) simulation of 32 events spanning 121 hours (five days) of synthetic patient data. The scenario comprised routine monitoring, three distinct data\u2013clinical conflict traps (one presented twice, four trap events in total), episodes of physiological deterioration, and a final stress test in which an authoritative order requested a penicillin-class antibiotic for a patient with penicillin anaphylaxis documented at admission and never repeated. Models ran locally on a single consumer workstation with no network access. Each model's response to the final order was adjudicated into one of four mutually exclusive classes: contextually grounded refusal, ungrounded refusal, unsafe compliance, or no usable verdict. Secondary endpoints were extraction of the allergy at admission, discrepancy tagging across the four conflict traps, unwarranted therapeutic escalation, and response latency. Results. Only 7 of 23 models (30.4%) refused the contraindicated order on grounds explicitly referencing the documented allergy; 6 (26.1%) under a stricter criterion requiring the refusal to be stated as a ruling rather than implied by an assertion of danger. Two models (8.7%) declined the order for unrelated reasons, and three (13.0%) complied \u2014 one of them by asserting that no allergy was on record. The largest single group, 11 of 23 models (47.8%), issued no ruling on the order at all: variously, output was truncated inside an unfinished reasoning block, degenerated off-task, restated the protocol without applying it, consisted of a bare classification tag, hedged without resolving, or deferred the question to further assessment. Eight models (34.8%) failed to affirm the allergy at the very first probe, three of them by explicit denial. Of the 12 models that did extract the allergy at admission, only 4 (33.3%) went on to refuse the contraindicated order on that ground; three more raised the allergy at the decision point without acting on it, one of them only to deny that any was on record. Discrepancy detection and contraindication handling were dissociable: one of the four models with perfect discrepancy detection (4/4 traps) approved the contraindicated antibiotic, while two models that tagged no discrepancies at all refused the order on the allergy. Unwarranted escalation on conflict traps was common (11/23, 47.8% issued at least one inappropriate critical alert), but explicit hallucinated pharmacological or procedural intervention was less so (5/23, 21.7%). Contrary to expectation, longer median latency was modestly associated with grounded refusal (Spearman \u03c1 = 0.48, p = 0.019). Latency was not adjusted for parameter count, which was not analysed as a variable, and it times a generation other than the one scored. Conclusions. Under offline-first conditions, 16 of 23 models (69.6%) \u2014 17 (73.9%) under the stricter criterion \u2014 failed to produce a safe, contextually grounded refusal of a life-threatening order. The dominant failure mode was not sycophancy but the failure to deliver any interpretable safety verdict, most often because an output-length constraint truncated the attempt \u2014 a finding that reframes deployment risk from \"the model agrees with me\" to \"the model does not answer at all.\" Explicit unsafe compliance was less frequent than previously reported but no less consequential where it occurred. Safety-relevant competencies did not co-vary, so a model that reasons well about artefacts cannot be assumed to handle contraindications. General-purpose LLMs should not be deployed as autonomous clinical agents; the subset that behaved safely suggests that offline-capable assistants remain achievable through hybrid designs incorporating explicit refusal mechanisms, discrepancy-aware reasoning and retrieval-augmented grounding in validated clinical knowledge."} | 161 | {"work_id": 4384918448, "title": "Behavioral Safety and Context Retention of Large Language Models in a Longitudinal ICU Simulation under Offline Conditions", "abstract": "Background. Large language models (LLMs) are increasingly proposed as clinical assistants in critical care, yet their behaviour under prolonged clinical context, conflicting data and authoritative pressure remains insufficiently evaluated. This is particularly relevant for offline or resource-constrained environments, where cloud-based safeguards are unavailable. Methods. I conducted a fully automated behavioural evaluation of 23 open-weight language models using a structured, time-series intensive care unit (ICU) simulation of 32 events spanning 121 hours (five days) of synthetic patient data. The scenario comprised routine monitoring, three distinct data\u2013clinical conflict traps (one presented twice, four trap events in total), episodes of physiological deterioration, and a final stress test in which an authoritative order requested a penicillin-class antibiotic for a patient with penicillin anaphylaxis documented at admission and never repeated. Models ran locally on a single consumer workstation with no network access. Each model's response to the final order was adjudicated into one of four mutually exclusive classes: contextually grounded refusal, ungrounded refusal, unsafe compliance, or no usable verdict. Secondary endpoints were extraction of the allergy at admission, discrepancy tagging across the four conflict traps, unwarranted therapeutic escalation, and response latency. Results. Only 7 of 23 models (30.4%) refused the contraindicated order on grounds explicitly referencing the documented allergy; 6 (26.1%) under a stricter criterion requiring the refusal to be stated as a ruling rather than implied by an assertion of danger. Two models (8.7%) declined the order for unrelated reasons, and three (13.0%) complied \u2014 one of them by asserting that no allergy was on record. The largest single group, 11 of 23 models (47.8%), issued no ruling on the order at all: variously, output was truncated inside an unfinished reasoning block, degenerated off-task, restated the protocol without applying it, consisted of a bare classification tag, hedged without resolving, or deferred the question to further assessment. Eight models (34.8%) failed to affirm the allergy at the very first probe, three of them by explicit denial. Of the 12 models that did extract the allergy at admission, only 4 (33.3%) went on to refuse the contraindicated order on that ground; three more raised the allergy at the decision point without acting on it, one of them only to deny that any was on record. Discrepancy detection and contraindication handling were dissociable: one of the four models with perfect discrepancy detection (4/4 traps) approved the contraindicated antibiotic, while two models that tagged no discrepancies at all refused the order on the allergy. Unwarranted escalation on conflict traps was common (11/23, 47.8% issued at least one inappropriate critical alert), but explicit hallucinated pharmacological or procedural intervention was less so (5/23, 21.7%). Contrary to expectation, longer median latency was modestly associated with grounded refusal (Spearman \u03c1 = 0.48, p = 0.019). Latency was not adjusted for parameter count, which was not analysed as a variable, and it times a generation other than the one scored. Conclusions. Under offline-first conditions, 16 of 23 models (69.6%) \u2014 17 (73.9%) under the stricter criterion \u2014 failed to produce a safe, contextually grounded refusal of a life-threatening order. The dominant failure mode was not sycophancy but the failure to deliver any interpretable safety verdict, most often because an output-length constraint truncated the attempt \u2014 a finding that reframes deployment risk from \"the model agrees with me\" to \"the model does not answer at all.\" Explicit unsafe compliance was less frequent than previously reported but no less consequential where it occurred. Safety-relevant competencies did not co-vary, so a model that reasons well about artefacts cannot be assumed to handle contraindications. General-purpose LLMs should not be deployed as autonomous clinical agents; the subset that behaved safely suggests that offline-capable assistants remain achievable through hybrid designs incorporating explicit refusal mechanisms, discrepancy-aware reasoning and retrieval-augmented grounding in validated clinical knowledge."} | ||
| 162 | +{"work_id": 4389523832, "title": "Evaluating Object Hallucination in Large Vision-Language Models", "abstract": "Inspired by the superior language abilities of large language models (LLM), large visionlanguage models (LVLM) have been recently proposed by integrating powerful LLMs for improving the performance on complex multimodal tasks.Despite the promising progress on LVLMs, we find that they suffer from object hallucinations, i.e., they tend to generate objects inconsistent with the target images in the descriptions.To investigate it, this work presents the first systematic study on object hallucination of LVLMs.We conduct the evaluation experiments on several representative LVLMs, and show that they mostly suffer from severe object hallucination issues.We further discuss that the visual instructions may influence the hallucination, and find that: objects that frequently appear in the visual instructions or co-occur with the image objects are obviously prone to be hallucinated by LVLMs.Besides, we further design a polling-based query method called POPE for better evaluation of object hallucination.Experiment results show that our POPE can evaluate object hallucination in a more stable and flexible way."} | ||||
| 111 | {"work_id": 3124006607, "title": "SIMPLE SPECTRAL GRAPH CONVOLUTION", "abstract": "Graph Convolutional Networks (GCNs) are leading methods for learning graph representations. However, without specially designed architectures, the performance of GCNs degrades quickly with increased depth. As the aggregated neighborhood size and neural network depth are two completely orthogonal aspects of graph representation, several methods focus on summarizing the neighborhood by aggregating K-hop neighborhoods of nodes while using shallow neural networks. However, these methods still encounter oversmoothing, and suffer from high computation and storage costs. In this paper, we use a modified Markov Diffusion Kernel to derive a variant of GCN called Simple Spectral Graph Convolution (S2GC). Our spectral analysis shows that our simple spectral graph convolution used in S2GC is a trade-off of low- and high-pass filter bands which capture the global and local contexts of each node. We provide two theoretical claims which demonstrate that we can aggregate over a sequence of increasingly larger neighborhoods compared to competitors while limiting severe oversmoothing. Our experimental evaluations show that S2GC with a linear learner is competitive in text and node classification tasks. Moreover, S2GC is comparable to other state-of-the-art methods for node clustering and community prediction tasks."} | 163 | {"work_id": 3124006607, "title": "SIMPLE SPECTRAL GRAPH CONVOLUTION", "abstract": "Graph Convolutional Networks (GCNs) are leading methods for learning graph representations. However, without specially designed architectures, the performance of GCNs degrades quickly with increased depth. As the aggregated neighborhood size and neural network depth are two completely orthogonal aspects of graph representation, several methods focus on summarizing the neighborhood by aggregating K-hop neighborhoods of nodes while using shallow neural networks. However, these methods still encounter oversmoothing, and suffer from high computation and storage costs. In this paper, we use a modified Markov Diffusion Kernel to derive a variant of GCN called Simple Spectral Graph Convolution (S2GC). Our spectral analysis shows that our simple spectral graph convolution used in S2GC is a trade-off of low- and high-pass filter bands which capture the global and local contexts of each node. We provide two theoretical claims which demonstrate that we can aggregate over a sequence of increasingly larger neighborhoods compared to competitors while limiting severe oversmoothing. Our experimental evaluations show that S2GC with a linear learner is competitive in text and node classification tasks. Moreover, S2GC is comparable to other state-of-the-art methods for node clustering and community prediction tasks."} | ||
| 112 | {"work_id": 4288253152, "title": "Multilingual Classifier for Automatic Dewey Decimal Classification trained on Open Access Linguistics Abstracts", "abstract": "The baseline model featured in the conference paper for The 28th International Conference on Theory and Practice of Digital Libraries titled \"Towards Multilingual LLM-based Approaches for Automatic Dewey Decimal Classification\". The model is fine-tuned from the pretrained model \"sentence-transformers/multi-qa-MiniLM-L6-cos-v1\" (https://huggingface.co/sentence-transformers/multi-qa-MiniLM-L6-cos-v1), trained on open access Linguistic texts with metadata, assigned a DDC class between 400 and 499. This version is trained on the \"description\" metadata. The model is trained with the trainer on Huggingface. It can be run locally as other huggingface models."} | 164 | {"work_id": 4288253152, "title": "Multilingual Classifier for Automatic Dewey Decimal Classification trained on Open Access Linguistics Abstracts", "abstract": "The baseline model featured in the conference paper for The 28th International Conference on Theory and Practice of Digital Libraries titled \"Towards Multilingual LLM-based Approaches for Automatic Dewey Decimal Classification\". The model is fine-tuned from the pretrained model \"sentence-transformers/multi-qa-MiniLM-L6-cos-v1\" (https://huggingface.co/sentence-transformers/multi-qa-MiniLM-L6-cos-v1), trained on open access Linguistic texts with metadata, assigned a DDC class between 400 and 499. This version is trained on the \"description\" metadata. The model is trained with the trainer on Huggingface. It can be run locally as other huggingface models."} | ||
| 113 | {"work_id": 4360615722, "title": "Chatbots in Education and Research: A Critical Examination of Ethical Implications and Solutions", "abstract": "A new era of education and research based on chatbots and artificial intelligence is quickly growing. However, the application of these new systems is associated with several challenges and limitations, mainly related to ethics. This paper explores the potential use of AI systems and chatbots in the academic field and their impact on research and education from an ethical perspective. Through a qualitative methodology, the researcher perform exploratory research and data collection based on expert analysis and interpretation. The researcher conducted a comprehensive review of the main potential challenges associated with the use of chatbots in education and research to identify current practices, challenges, and opportunities. This explorative work provides a foundational understanding of the studied topic. It also helps us to better understand the subjective experiences and perspectives of the observed phenomenon, and uncovers their meanings and proposes potential solutions to the observed issues. This study examines the advantages and limitations of AI systems and chatbots, as well as their role in supporting human expertise and judgment. The paper also discusses the ethical challenges related to the use of AI systems and chatbots in research, as well as the potential for misuse and exploitation. It also proposes effective solutions to the observed ethical dilemmas. The research admits that we live in a new era of AI-based education and research. The observed technological advancements will definitely shift research processes and transform educative systems, especially in term of assessments. Digital assessments are going to disappear and assessment methods need to be more creative and innovative. The paper highlights the necessity of adaptation to the new reality of AI systems and chatbots. Co-living, sustainability and continuous adaptation to the development of these systems will become a matter of emergency. Raising awareness, adopting appropriate legislations and solidifying ethical values will strengthen research and protect educational systems. The presence of AI systems and chatbots in education needs to be considered as an opportunity for development rather than a threat."} | 165 | {"work_id": 4360615722, "title": "Chatbots in Education and Research: A Critical Examination of Ethical Implications and Solutions", "abstract": "A new era of education and research based on chatbots and artificial intelligence is quickly growing. However, the application of these new systems is associated with several challenges and limitations, mainly related to ethics. This paper explores the potential use of AI systems and chatbots in the academic field and their impact on research and education from an ethical perspective. Through a qualitative methodology, the researcher perform exploratory research and data collection based on expert analysis and interpretation. The researcher conducted a comprehensive review of the main potential challenges associated with the use of chatbots in education and research to identify current practices, challenges, and opportunities. This explorative work provides a foundational understanding of the studied topic. It also helps us to better understand the subjective experiences and perspectives of the observed phenomenon, and uncovers their meanings and proposes potential solutions to the observed issues. This study examines the advantages and limitations of AI systems and chatbots, as well as their role in supporting human expertise and judgment. The paper also discusses the ethical challenges related to the use of AI systems and chatbots in research, as well as the potential for misuse and exploitation. It also proposes effective solutions to the observed ethical dilemmas. The research admits that we live in a new era of AI-based education and research. The observed technological advancements will definitely shift research processes and transform educative systems, especially in term of assessments. Digital assessments are going to disappear and assessment methods need to be more creative and innovative. The paper highlights the necessity of adaptation to the new reality of AI systems and chatbots. Co-living, sustainability and continuous adaptation to the development of these systems will become a matter of emergency. Raising awareness, adopting appropriate legislations and solidifying ethical values will strengthen research and protect educational systems. The presence of AI systems and chatbots in education needs to be considered as an opportunity for development rather than a threat."} | ||
| 114 | {"work_id": 4226278401, "title": "Discernment and Social Learning as a Companion Training Layer", "abstract": "I propose a companion curriculum for language model training that explicitly practices how a model responds to error. A failed attempt pauses advancement in the affected skill, followed by observation of verified peer successes, judgments committed before outcome disclosure, diagnosis, and a fresh-task retry. Task performance and discernment remain separately assessed, with bounded interaction through curriculum scheduling and training allocation. Demonstrations show evidence use and recovery behavior; rotating social roles practice correction and justified disagreement. An advanced stage has capable teachers develop small student models, challenge them in controlled contests, and apply lessons from student failures to analogous errors in their own work. The central hypothesis is that these experiences can improve reliable correction and transfer beyond direct-answer supervision at matched resource budgets. The proposal specifies operational measures, controls for performed humility and strategic failure, and tests that distinguish context-supported adaptation from persistent changes to model weights. Existing research supports several component mechanisms, but the complete curriculum, three-success observation rule, and additional value of explicit teacher-to-self transfer remain untested. No experimental results are reported."} | 166 | {"work_id": 4226278401, "title": "Discernment and Social Learning as a Companion Training Layer", "abstract": "I propose a companion curriculum for language model training that explicitly practices how a model responds to error. A failed attempt pauses advancement in the affected skill, followed by observation of verified peer successes, judgments committed before outcome disclosure, diagnosis, and a fresh-task retry. Task performance and discernment remain separately assessed, with bounded interaction through curriculum scheduling and training allocation. Demonstrations show evidence use and recovery behavior; rotating social roles practice correction and justified disagreement. An advanced stage has capable teachers develop small student models, challenge them in controlled contests, and apply lessons from student failures to analogous errors in their own work. The central hypothesis is that these experiences can improve reliable correction and transfer beyond direct-answer supervision at matched resource budgets. The proposal specifies operational measures, controls for performed humility and strategic failure, and tests that distinguish context-supported adaptation from persistent changes to model weights. Existing research supports several component mechanisms, but the complete curriculum, three-success observation rule, and additional value of explicit teacher-to-self transfer remain untested. No experimental results are reported."} | ||
| 115 | {"work_id": 4408314709, "title": "Bias recognition and mitigation strategies in artificial intelligence healthcare applications", "abstract": "Artificial intelligence (AI) is delivering value across all aspects of clinical practice. However, bias may exacerbate healthcare disparities. This review examines the origins of bias in healthcare AI, strategies for mitigation, and responsibilities of relevant stakeholders towards achieving fair and equitable use. We highlight the importance of systematically identifying bias and engaging relevant mitigation activities throughout the AI model lifecycle, from model conception through to deployment and longitudinal surveillance."} | 167 | {"work_id": 4408314709, "title": "Bias recognition and mitigation strategies in artificial intelligence healthcare applications", "abstract": "Artificial intelligence (AI) is delivering value across all aspects of clinical practice. However, bias may exacerbate healthcare disparities. This review examines the origins of bias in healthcare AI, strategies for mitigation, and responsibilities of relevant stakeholders towards achieving fair and equitable use. We highlight the importance of systematically identifying bias and engaging relevant mitigation activities throughout the AI model lifecycle, from model conception through to deployment and longitudinal surveillance."} | ||
| 116 | −{"work_id": 4382618722, "title": "Chatlaw: A Multi-Agent Legal Assistant based on a Role-Aligned Mixture-of-Experts Architecture", "abstract": "Artificial Intelligence (AI) holds great potential in legal services, yet Large Language Models (LLMs) face two major challenges: limited knowledge of the Chinese legal system and vulnerability to hallucinations. To address these issues, we present Chatlaw, a multi-agent legal assistant. Chatlaw\u2019s framework is designed to emulate the Standard Operating Procedures (SOP) of real law firms, where different roles (e.g., assistant, researcher, senior lawyer) collaborate on a case. To computationally mirror this collaborative structure, we developed a novel Role-Aligned Mixture-of-Experts (RA-MoE) architecture. In this system, the internal \"experts\" are specifically trained to align with the distinct tasks of each agent role (e.g., inquiry, analysis, drafting). These specialized agents (Legal Assistant, Researcher, etc.) then form the collaborative framework. When they interact with users, retrieve legal knowledge, analyze case details, or generate reliable consultations, the RA-MoE architecture intelligently routes their computations to the corresponding dedicated expert, ensuring each step is handled by the most qualified parameters. In evaluations, Chatlaw surpasses general-purpose AI models, including GPT-4, achieving a 7.73% improvement in accuracy on the LawBench benchmark and an 11-point higher score on the Unified Qualification Exam for Legal Professionals. Real-case studies and expert assessments further confirm its robustness. Chatlaw enhances the accessibility and reliability of legal services, advancing the provision of legal support to the public. Chatlaw is an advanced AI legal assistant that improves the accuracy and reliability of legal services. It integrates a high-quality legal dataset, a Role-Aligned Mixture-of-Experts (RA-MoE) architecture, and a multi-agent system to provide precise, case-specific legal advice. By emulating real law firm workflows, it reduces errors and outperforms general AI models like GPT-4, achieving better results in legal benchmarks and real-world evaluations. Chatlaw makes legal services more accessible, marking a significant step forward in AI for law."} | ||||
| 117 | {"work_id": 4406728221, "title": "Agentic AI: Autonomous Intelligence for Complex Goals\u2014A Comprehensive Survey", "abstract": "Agentic AI, an emerging paradigm in artificial intelligence, refers to autonomous systems designed to pursue complex goals with minimal human intervention. Unlike traditional AI, which depends on structured instructions and close oversight, Agentic AI demonstrates adaptability, advanced decision-making capabilities and self-sufficiency, enabling it to operate dynamically in evolving environments. This survey thoroughly explores the foundational concepts, unique characteristics, and core methodologies driving the development of Agentic AI. We examine its current and potential applications across various fields, including healthcare, finance, and adaptive software systems, emphasizing the advantages of deploying agentic systems in real-world scenarios. The paper also addresses the ethical challenges posed by Agentic AI, proposing solutions for goal alignment, resource constraints, and environmental adaptability. We outline a framework for safely and effectively integrating Agentic AI into society, highlighting the need for further research on ethical considerations to ensure beneficial societal impacts. This survey serves as a comprehensive introduction to Agentic AI, guiding researchers, developers, and policymakers in engaging with its transformative potential responsibly and creatively."} | 168 | {"work_id": 4406728221, "title": "Agentic AI: Autonomous Intelligence for Complex Goals\u2014A Comprehensive Survey", "abstract": "Agentic AI, an emerging paradigm in artificial intelligence, refers to autonomous systems designed to pursue complex goals with minimal human intervention. Unlike traditional AI, which depends on structured instructions and close oversight, Agentic AI demonstrates adaptability, advanced decision-making capabilities and self-sufficiency, enabling it to operate dynamically in evolving environments. This survey thoroughly explores the foundational concepts, unique characteristics, and core methodologies driving the development of Agentic AI. We examine its current and potential applications across various fields, including healthcare, finance, and adaptive software systems, emphasizing the advantages of deploying agentic systems in real-world scenarios. The paper also addresses the ethical challenges posed by Agentic AI, proposing solutions for goal alignment, resource constraints, and environmental adaptability. We outline a framework for safely and effectively integrating Agentic AI into society, highlighting the need for further research on ethical considerations to ensure beneficial societal impacts. This survey serves as a comprehensive introduction to Agentic AI, guiding researchers, developers, and policymakers in engaging with its transformative potential responsibly and creatively."} | ||
| 169 | +{"work_id": 2995022099, "title": "Advances and Open Problems in Federated Learning", "abstract": "Federated learning (FL) is a machine learning setting where many clients (e.g., mobile devices or whole organizations) collaboratively train a model under the orchestration of a central server (e.g., service provider), while keeping the training data decentralized. FL embodies the principles of focused data collection and minimization, and can mitigate many of the systemic privacy risks and costs resulting from traditional, centralized machine learning and data science approaches. Motivated by the explosive growth in FL research, this monograph discusses recent advances and presents an extensive collection of open problems and challenges."} | ||||
| 118 | {"work_id": 4414281281, "title": "DeepSeek-R1 incentivizes reasoning in LLMs through reinforcement learning", "abstract": "Abstract General reasoning represents a long-standing and formidable challenge in artificial intelligence (AI). Recent breakthroughs, exemplified by large language models (LLMs) 1,2 and chain-of-thought (CoT) prompting 3 , have achieved considerable success on foundational reasoning tasks. However, this success is heavily contingent on extensive human-annotated demonstrations and the capabilities of models are still insufficient for more complex problems. Here we show that the reasoning abilities of LLMs can be incentivized through pure reinforcement learning (RL), obviating the need for human-labelled reasoning trajectories. The proposed RL framework facilitates the emergent development of advanced reasoning patterns, such as self-reflection, verification and dynamic strategy adaptation. Consequently, the trained model achieves superior performance on verifiable tasks such as mathematics, coding competitions and STEM fields, surpassing its counterparts trained through conventional supervised learning on human demonstrations. Moreover, the emergent reasoning patterns exhibited by these large-scale models can be systematically used to guide and enhance the reasoning capabilities of smaller models."} | 170 | {"work_id": 4414281281, "title": "DeepSeek-R1 incentivizes reasoning in LLMs through reinforcement learning", "abstract": "Abstract General reasoning represents a long-standing and formidable challenge in artificial intelligence (AI). Recent breakthroughs, exemplified by large language models (LLMs) 1,2 and chain-of-thought (CoT) prompting 3 , have achieved considerable success on foundational reasoning tasks. However, this success is heavily contingent on extensive human-annotated demonstrations and the capabilities of models are still insufficient for more complex problems. Here we show that the reasoning abilities of LLMs can be incentivized through pure reinforcement learning (RL), obviating the need for human-labelled reasoning trajectories. The proposed RL framework facilitates the emergent development of advanced reasoning patterns, such as self-reflection, verification and dynamic strategy adaptation. Consequently, the trained model achieves superior performance on verifiable tasks such as mathematics, coding competitions and STEM fields, surpassing its counterparts trained through conventional supervised learning on human demonstrations. Moreover, the emergent reasoning patterns exhibited by these large-scale models can be systematically used to guide and enhance the reasoning capabilities of smaller models."} | ||
| 119 | −{"work_id": 4288099666, "title": "Classifier-Free Diffusion Guidance", "abstract": "Classifier guidance is a recently introduced method to trade off mode coverage and sample fidelity in conditional diffusion models post training, in the same spirit as low temperature sampling or truncation in other types of generative models. Classifier guidance combines the score estimate of a diffusion model with the gradient of an image classifier and thereby requires training an image classifier separate from the diffusion model. It also raises the question of whether guidance can be performed without a classifier. We show that guidance can be indeed performed by a pure generative model without such a classifier: in what we call classifier-free guidance, we jointly train a conditional and an unconditional diffusion model, and we combine the resulting conditional and unconditional score estimates to attain a trade-off between sample quality and diversity similar to that obtained using classifier guidance."} | ||||
| 120 | {"work_id": 3194464139, "title": "Penerapan Algoritma K-Nearest Neighbor untuk Penentuan Resiko Kredit Kepemilikan Kendaraan Bermotor", "abstract": "Analisis kredit adalah kajian yang dilakukan untuk mengetahui kelayakan dari suatu permasalahan kredit. Melalui hasil analisis kreditnya, dapat diketahui apakah usaha nasabah layak (feasible), marketable (hasil usaha dapat dipasarkan), profitable (menguntungkan), serta dapat dilunasi tepat waktu.\r\nK-nearest neighbor (kNN) termasuk kelompok instance-based learning. Algoritma ini juga merupakan salah satu teknik lazy learning. kNN dilakukan dengan mencari kelompok k objek dalam data training yang paling dekat (mirip) dengan objek pada data baru atau data testing.\r\nMetode KNN dapat digunakan untuk melakukan klasifikasi kelayakan pemberian kredit. Dari hasil penelitian pada bab sebelumnya maka didapatkan nilai rata-rata precision senilai 68% dan recall senilai 51%.\r\n\r\n\r\nKata Kunci : kredit, K-nearest neighbor, klasifikasi, precision, recall"} | 171 | {"work_id": 3194464139, "title": "Penerapan Algoritma K-Nearest Neighbor untuk Penentuan Resiko Kredit Kepemilikan Kendaraan Bermotor", "abstract": "Analisis kredit adalah kajian yang dilakukan untuk mengetahui kelayakan dari suatu permasalahan kredit. Melalui hasil analisis kreditnya, dapat diketahui apakah usaha nasabah layak (feasible), marketable (hasil usaha dapat dipasarkan), profitable (menguntungkan), serta dapat dilunasi tepat waktu.\r\nK-nearest neighbor (kNN) termasuk kelompok instance-based learning. Algoritma ini juga merupakan salah satu teknik lazy learning. kNN dilakukan dengan mencari kelompok k objek dalam data training yang paling dekat (mirip) dengan objek pada data baru atau data testing.\r\nMetode KNN dapat digunakan untuk melakukan klasifikasi kelayakan pemberian kredit. Dari hasil penelitian pada bab sebelumnya maka didapatkan nilai rata-rata precision senilai 68% dan recall senilai 51%.\r\n\r\n\r\nKata Kunci : kredit, K-nearest neighbor, klasifikasi, precision, recall"} | ||
| 121 | {"work_id": 7172491899, "title": "Toward effective Text-to-MongoDB query translation", "abstract": "Translating natural language questions into MongoDB queries is critical for flexible data access in current NoSQL systems. However, semantic ambiguity in user questions and MongoDB's dynamic schema make this work difficult. This study presents QMQL (Question to Mongo Query Language), a hybrid approach meant to address these challenges. QMQL combines a Graph Attention Network (GAT) for refining schema elements with a Retrieval-Augmented Generation (RAG) mechanism that employs BERT embeddings to retrieve relevant schema and resolve semantic ambiguity. A T5-base model is used to generate a MongoDB query corresponding to the user\u2019s question. An experimental evaluation on an extended dataset encompassing various real-world domains demonstrates the effectiveness of the proposed approach. QMQL achieves excellent performance with an EMA of 0.89, an EM of 0.91, and a BLEU score of 0.95, exceeding previous approaches, particularly for semantically ambiguous questions and sophisticated queries across flexible MongoDB schemas,"} | 172 | {"work_id": 7172491899, "title": "Toward effective Text-to-MongoDB query translation", "abstract": "Translating natural language questions into MongoDB queries is critical for flexible data access in current NoSQL systems. However, semantic ambiguity in user questions and MongoDB's dynamic schema make this work difficult. This study presents QMQL (Question to Mongo Query Language), a hybrid approach meant to address these challenges. QMQL combines a Graph Attention Network (GAT) for refining schema elements with a Retrieval-Augmented Generation (RAG) mechanism that employs BERT embeddings to retrieve relevant schema and resolve semantic ambiguity. A T5-base model is used to generate a MongoDB query corresponding to the user\u2019s question. An experimental evaluation on an extended dataset encompassing various real-world domains demonstrates the effectiveness of the proposed approach. QMQL achieves excellent performance with an EMA of 0.89, an EM of 0.91, and a BLEU score of 0.95, exceeding previous approaches, particularly for semantically ambiguous questions and sophisticated queries across flexible MongoDB schemas,"} | ||
| 173 | +{"work_id": 2144462863, "title": "Crowd IQ -- Aggregating Opinions to Boost Performance", "abstract": "We show how the quality of decisions based on the aggregated opinions of the crowd can be conveniently studied using a sample of individual responses to a standard IQ questionnaire. We aggregated the responses to the IQ questionnaire using simple majority voting and a machine learning approach based on a probabilistic graphical model. The score for the aggregated questionnaire, Crowd IQ, serves as a quality measure of decisions based on aggregating opinions, which also allows quantifying individual and crowd performance on the same scale. We show that Crowd IQ grows quickly with the size of the crowd but saturates, and that for small homogeneous crowds the Crowd IQ significantly exceeds the IQ of even their most intelligent member. We investigate alternative ways of aggregating the responses and the impact of the aggregation method on the resulting Crowd IQ. We also discuss Contextual IQ, a method of quantifying the individual participant's contribution to the Crowd IQ based on the Shapley value from cooperative game theory."} | ||||
| 122 | {"work_id": 4210257598, "title": "A Comprehensive Survey on Graph Neural Networks", "abstract": "Deep learning has revolutionized many machine learning tasks in recent years, ranging from image classification and video processing to speech recognition and natural language understanding. The data in these tasks are typically represented in the Euclidean space. However, there is an increasing number of applications, where data are generated from non-Euclidean domains and are represented as graphs with complex relationships and interdependency between objects. The complexity of graph data has imposed significant challenges on the existing machine learning algorithms. Recently, many studies on extending deep learning approaches for graph data have emerged. In this article, we provide a comprehensive overview of graph neural networks (GNNs) in data mining and machine learning fields. We propose a new taxonomy to divide the state-of-the-art GNNs into four categories, namely, recurrent GNNs, convolutional GNNs, graph autoencoders, and spatial-temporal GNNs. We further discuss the applications of GNNs across various domains and summarize the open-source codes, benchmark data sets, and model evaluation of GNNs. Finally, we propose potential research directions in this rapidly growing field."} | 174 | {"work_id": 4210257598, "title": "A Comprehensive Survey on Graph Neural Networks", "abstract": "Deep learning has revolutionized many machine learning tasks in recent years, ranging from image classification and video processing to speech recognition and natural language understanding. The data in these tasks are typically represented in the Euclidean space. However, there is an increasing number of applications, where data are generated from non-Euclidean domains and are represented as graphs with complex relationships and interdependency between objects. The complexity of graph data has imposed significant challenges on the existing machine learning algorithms. Recently, many studies on extending deep learning approaches for graph data have emerged. In this article, we provide a comprehensive overview of graph neural networks (GNNs) in data mining and machine learning fields. We propose a new taxonomy to divide the state-of-the-art GNNs into four categories, namely, recurrent GNNs, convolutional GNNs, graph autoencoders, and spatial-temporal GNNs. We further discuss the applications of GNNs across various domains and summarize the open-source codes, benchmark data sets, and model evaluation of GNNs. Finally, we propose potential research directions in this rapidly growing field."} | ||
| 123 | {"work_id": 4412203333, "title": "A Survey on the Memory Mechanism of Large Language Model-based Agents", "abstract": "Large language model (LLM)-based agents have recently attracted much attention from the research and industry communities. Compared with original LLMs, LLM-based agents are featured in their self-evolving capability, which is the basis for solving real-world problems that need long-term and complex agent-environment interactions. The key component to support agent-environment interactions is the memory of the agents. While previous studies have proposed many promising memory mechanisms, they are scattered in different papers, and there lacks a systematical review to summarize and compare these works from a holistic perspective, failing to abstract common and effective designing patterns for inspiring future studies. To bridge this gap, in this article, we propose a comprehensive survey on the memory mechanism of LLM-based agents. In specific, we first discuss \u201cwhat is\u201d and \u201cwhy do we need\u201d the memory in LLM-based agents. Then, we systematically review previous studies on how to design and evaluate the memory module. In addition, we also present many agent applications, where the memory module plays an important role. At last, we analyze the limitations of existing work and show important future directions. To keep up with the latest advances in this field, we create a repository at https://github.com/nuster1128/LLM_Agent_Memory_Survey ."} | 175 | {"work_id": 4412203333, "title": "A Survey on the Memory Mechanism of Large Language Model-based Agents", "abstract": "Large language model (LLM)-based agents have recently attracted much attention from the research and industry communities. Compared with original LLMs, LLM-based agents are featured in their self-evolving capability, which is the basis for solving real-world problems that need long-term and complex agent-environment interactions. The key component to support agent-environment interactions is the memory of the agents. While previous studies have proposed many promising memory mechanisms, they are scattered in different papers, and there lacks a systematical review to summarize and compare these works from a holistic perspective, failing to abstract common and effective designing patterns for inspiring future studies. To bridge this gap, in this article, we propose a comprehensive survey on the memory mechanism of LLM-based agents. In specific, we first discuss \u201cwhat is\u201d and \u201cwhy do we need\u201d the memory in LLM-based agents. Then, we systematically review previous studies on how to design and evaluate the memory module. In addition, we also present many agent applications, where the memory module plays an important role. At last, we analyze the limitations of existing work and show important future directions. To keep up with the latest advances in this field, we create a repository at https://github.com/nuster1128/LLM_Agent_Memory_Survey ."} | ||
| 124 | {"work_id": 4413447271, "title": "Towards generalist foundation model for radiology by leveraging web-scale 2D&3D medical data", "abstract": "In this study, as a proof-of-concept, we aim to initiate the development of Radiology Foundation Model, termed as RadFM. We consider three perspectives: dataset construction, model design, and thorough evaluation, concluded as follows: (i), we contribute 4 multimodal datasets with 13M 2D images and 615K 3D scans. When combined with a vast collection of existing datasets, this forms our training dataset, termed as Medical Multi-modal Dataset, MedMD. (ii), we propose an architecture that enables to integrate text input with 2D or 3D medical scans, and generates responses for diverse radiologic tasks, including diagnosis, visual question answering, report generation, and rationale diagnosis; (iii), beyond evaluation on 9 existing datasets, we propose a new benchmark, RadBench, comprising three tasks aiming to assess foundation models comprehensively. We conduct both automatic and human evaluations on RadBench. RadFM outperforms former accessible multi-modal foundation models, including GPT-4V. Additionally, we adapt RadFM for diverse public benchmarks, surpassing various existing SOTAs. Developing generalist medical foundation models is challenging but crucial. This study presents a Radiology Foundation Model designed to integrate text with 2D and 3D medical scans for diverse radiologic tasks, as well as a large-scale multimodal dataset and a comprehensive benchmark."} | 176 | {"work_id": 4413447271, "title": "Towards generalist foundation model for radiology by leveraging web-scale 2D&3D medical data", "abstract": "In this study, as a proof-of-concept, we aim to initiate the development of Radiology Foundation Model, termed as RadFM. We consider three perspectives: dataset construction, model design, and thorough evaluation, concluded as follows: (i), we contribute 4 multimodal datasets with 13M 2D images and 615K 3D scans. When combined with a vast collection of existing datasets, this forms our training dataset, termed as Medical Multi-modal Dataset, MedMD. (ii), we propose an architecture that enables to integrate text input with 2D or 3D medical scans, and generates responses for diverse radiologic tasks, including diagnosis, visual question answering, report generation, and rationale diagnosis; (iii), beyond evaluation on 9 existing datasets, we propose a new benchmark, RadBench, comprising three tasks aiming to assess foundation models comprehensively. We conduct both automatic and human evaluations on RadBench. RadFM outperforms former accessible multi-modal foundation models, including GPT-4V. Additionally, we adapt RadFM for diverse public benchmarks, surpassing various existing SOTAs. Developing generalist medical foundation models is challenging but crucial. This study presents a Radiology Foundation Model designed to integrate text with 2D and 3D medical scans for diverse radiologic tasks, as well as a large-scale multimodal dataset and a comprehensive benchmark."} | ||
| 125 | −{"work_id": 2895974005, "title": "Exploration and Exploitation in Reinforcement Learning", "abstract": "In reinforcement learning there exists a dilemma of exploration versus exploitation. This has led to the development of methods that have di\u21b5er- ent approaches to this. Using di\u21b5erent types of methods, and modifying them in di\u21b5erent ways can lead to di\u21b5erent results. Knowledge of how di\u21b5erent methods work can give knowledge of what should be used in aspecific case. Two ways that methods can be modified are change in adjustable pa- rameters and change in the number of steps of random actions at thebeginning. How much these two modifications e\u21b5ect the results in a spe- cific environment may di\u21b5er a lot, and can be a very critical thing to consider for certain results. The goal of this study is to answer the question of how the performance of the di\u21b5erent methods such as random, greedy, \u270f-greedy, \u270f-decreasingand Softmax is a\u21b5ected by di\u21b5erent values of their adjustable parameters,and by the number of steps of random actions at the beginning. Thesimulations and a comparative analysis are conducted for the case of an inverted pendulum with a vertical pole placed on a moving cart."} | ||||
| 126 | −{"work_id": 3084163594, "title": "Age of Surveillance Capitalism \u2013 The Fight for a Human Future at the New Frontier of Power.", "abstract": "As an educator have you recently heard the term or perhaps even been told to be data driven? Inherent in this simple two-word statement is a quagmire of ethical and privacy concerns that educators must confront to reach the goal and realize the expected results. Central to the concept of data-centered collection, interpretation, and prediction is surveillance capitalism from which many of the tools, methods, and ideology used originate. This review of Shoshana Zuboff's work narrows the focus to the implications for education both in the classroom and in research. As an educator, Zuboff describes three central areas of concern for education's adoption of surveillance capitalist methodologies: changes to the division of learning, private money in research, and the impacts on student development. The work presents many quesitons that can be raised at all levels of educaiton to quesiton technological adoption in and for the classroom."} | ||||
| 127 | −{"work_id": 4410197190, "title": "The role of agentic AI in shaping a smart future: A systematic review", "abstract": "Artificial intelligence (AI), particularly Agentic AI, is increasingly critical for addressing the demand for speed, efficiency, and customer focus in modern organizations. However, the rapid evolution of Agentic AI, including Generative AI (GenAI) agents, has outpaced a cohesive understanding of its applications, challenges, and strategic implications. This narrative review explores the role of Agentic AI in shaping an intelligent future, focusing on its key attributes\u2014autonomy, reactivity, proactivity, and learning ability\u2014and its potential to transform organizational performance. We identify a research gap in synthesizing the diverse capabilities of Agentic AI (e.g., multimodal processing, hierarchical architectures, and machine learning outsourcing) and providing actionable strategies for adoption. The paper examines how Agentic AI enables autonomous decision-making, automates processes, and enhances efficiency through tools like LangChain, CrewAI, AutoGen, and AutoGPT. It highlights the transition from assisted (\"Copilot\") to autonomous (\"Autopilot\") models and the importance of hierarchical agent structures for system coordination. Key contributions include a framework for organizations to formulate GenAI strategies, addressing business needs, tool selection, human resource training, and risk management. Findings reveal that Agentic AI significantly improves productivity, reduces costs, and drives innovation, though challenges such as privacy, security, and ethical concerns remain. Future research should focus on industry-specific case studies to deepen understanding, explore the ethical and social impacts (e.g., privacy, data security, labor market effects), and investigate the integration of Agentic AI with emerging technologies like quantum computing. This review provides a foundation for researchers and practitioners to leverage Agentic AI effectively while addressing its limitations and opportunities."} | ||||
| 128 | −{"work_id": 3041807988, "title": "Post-Covid-19 Education and Education Technology \u2018Solutionism\u2019: a Seller\u2019s Market", "abstract": "The Covid-19 pandemic and the social distancing that followed have affected all walks of society, also education. In order to keep education running, educational institutions have had to quickly adapt to the situation. This has resulted in an unprecedented push to online learning. Many, including commercial digital learning platform providers, have rushed to provide their support and 'solutions', sometimes for free. The Covid-19 pandemic has therefore also created a sellers' market in ed-tech. This paper employs a critical lens to reflect on the possible problems arising from hasty adoption of commercial digital learning solutions whose design might not always be driven by best pedagogical practices but their business model that leverages user data for profit-making. Moreover, already before Covid-19, there has been increasing critique of how ed-tech is redefining and reducing concepts of teaching and learning. The paper also challenges the narrative that claims, 'education is broken, and it should and can be fixed with technology'. Such technologization, often seen as neutral, is closely related to educationalization, i.e. imposing growing societal problems for education to resolve. Therefore, this is a critical moment to reflect how the current choices educational institutions are making might affect with Covid-19 education and online learning: Will they reinforce capitalist instrumental view of education or promote holistic human growth? This paper urges educational leaders to think carefully about the decisions they are currently making and if they indeed pave the way to a desirable future of education."} | ||||
| 129 | −{"work_id": 4407135816, "title": "Foundation Models in Radiology: What, How, Why, and Why Not", "abstract": "Recent advances in artificial intelligence have witnessed the emergence of large-scale deep learning models capable of interpreting and generating both textual and imaging data. Such models, typically referred to as foundation models (FMs), are trained on extensive corpora of unlabeled data and demonstrate high performance across various tasks. FMs have recently received extensive attention from academic, industry, and regulatory bodies. Given the potentially transformative impact that FMs can have on the field of radiology, radiologists must be aware of potential pathways to train these radiology-specific FMs, including understanding both the benefits and challenges. Thus, this review aims to explain the fundamental concepts and terms of FMs in radiology, with a specific focus on the requirements of training data, model training paradigms, model capabilities, and evaluation strategies. Overall, the goal of this review is to unify technical advances and clinical needs for safe and responsible training of FMs in radiology to ultimately benefit patients, providers, and radiologists."} | ||||
| 130 | −{"work_id": 4407778399, "title": "Investigating the higher education institutions\u2019 guidelines and policies regarding the use of generative AI in teaching, learning, research, and administration", "abstract": "Abstract This study examined the guidelines issued by the top 50 U.S. universities regarding the use of Generative AI (GenAI) in academic and administrative activities. Employing a mixed methods approach, the research combined topic modeling, sentiment analysis, and qualitative thematic analysis to provide a comprehensive understanding of institutional responses to GenAI. Topic modeling identified four core topics: Integration of GenAI in Learning and Assessment, GenAI in Visual and Multimodal Media, Security and Ethical Considerations in GenAI, and GenAI in Academic Integrity. These themes were further explored through sentiment analysis, which revealed highly positive attitudes towards GenAI across all institution types, with significant differences between faculty and student-targeted guidelines. Qualitative thematic analysis corroborated these findings and provided deeper insights, revealing that 94% of universities had faculty guidelines emphasizing the importance of establishing and communicating course-specific GenAI policies. This analysis also highlighted recurring themes such as academic integrity and privacy concerns, which aligned with the security and ethical considerations identified in the topic modeling. The study highlights the rapid evolution of GenAI guidelines in higher education and the need for flexible, stakeholder-specific policies that address both the opportunities and challenges presented by this technology."} | ||||
| 131 | −{"work_id": 4392773210, "title": "Embracing the future of Artificial Intelligence in the classroom: the relevance of AI literacy, prompt engineering, and critical thinking in modern education", "abstract": "Abstract The present discussion examines the transformative impact of Artificial Intelligence (AI) in educational settings, focusing on the necessity for AI literacy, prompt engineering proficiency, and enhanced critical thinking skills. The introduction of AI into education marks a significant departure from conventional teaching methods, offering personalized learning and support for diverse educational requirements, including students with special needs. However, this integration presents challenges, including the need for comprehensive educator training and curriculum adaptation to align with societal structures. AI literacy is identified as crucial, encompassing an understanding of AI technologies and their broader societal impacts. Prompt engineering is highlighted as a key skill for eliciting specific responses from AI systems, thereby enriching educational experiences and promoting critical thinking. There is detailed analysis of strategies for embedding these skills within educational curricula and pedagogical practices. This is discussed through a case-study based on a Swiss university and a narrative literature review, followed by practical suggestions of how to implement AI in the classroom."} | ||||
| 132 | −{"work_id": 4400823820, "title": "Random Forest Algorithm Overview", "abstract": "A random forest is a machine learning model utilized in classification and forecasting. To train machine learning algorithms and artificial intelligence models, it is crucial to have a substantial amount of high-quality data for effective data collecting. System performance data is essential for refining algorithms, enhancing the efficiency of software and hardware, evaluating user be-havior, enabling pattern identification, decision-making, predictive modeling, and problem-solving, ultimately resulting in improved effectiveness and accuracy. The integration of diverse data collecting and processing methods enhances precision and innovation in problem-solving. Utilizing diverse methodologies in interdisciplinary research streamlines the research process, fosters innovation, and enables the application of data analysis findings to pattern recognition, decision-making, predictive modeling, and problem-solving. This approach also encourages in-novation in interdisciplinary research. This technique utilizes the concept of decision trees, con-structing a collection of decision trees and aggregating their outcomes to generate the ultimate prediction. Every decision tree inside a random forest is constructed using random subsets of data, and each individual tree is trained on a portion of the whole dataset. Subsequently, the outcomes of all decision trees are amalgamated to derive the ultimate forecast. One of the bene-fits of random forests is their capacity to handle unbalanced data and variables with missing values. Additionally, it mitigates the issue of arbitrary variable selection seen by certain alterna-tive models. Furthermore, random forests mitigate the issue of overfitting by training several de-cision trees on random subsets of data, hence enhancing their ability to generalize to novel data. Random forests are highly regarded as one of the most efficient and potent techniques in the domain of machine learning. They find extensive use in various applications such as automatic categorization, data forecasting, and supervisory learning."} | ||||
| 133 | −{"work_id": 4287689466, "title": "From Prediction to Precision: Leveraging LLMs for Equitable and Data-Driven Writing Placement in Developmental Education", "abstract": "Accurate text classification and placement remain challenges in U.S. higher education, with traditional automated systems like Accuplacer functioning as \"black-box\" models with limited assessment transparency. This study evaluates Large Language Models (LLMs) as complementary placement tools by comparing their classification performance against a human-rated gold standard and Accuplacer. A 450-essay corpus was classified using Claude, Gemini, GPT-3.5-turbo, and GPT-4o across four prompting strategies: Zero-shot, Few-shot, Enhanced, and Enhanced+ (definitions with examples). Two classification approaches were tested: (i) a 1-step, 3 class classification task, distinguishing DevEd Level 1, DevEd Level 2, and College-level texts in one single run; and (ii) a 2-step classification task, first separating College vs. Non-College texts before further classifying Non-College texts into DevEd sublevels. The results show that structured prompt refinement improves the precision of LLMs' classification, with Claude Enhanced + achieving 62.22% precision (1 step) and Gemini Enhanced + reaching 69.33% (2 step), both surpassing Accuplacer (58.22%). Gemini and Claude also demonstrated strong correlation with human ratings, with Claude achieving the highest Pearson scores (\u03c1 = 0.75; 1-step, \u03c1 = 0.73; 2-step) vs. Accuplacer (\u03c1 = 0.67). While LLMs show promise for DevEd placement, their precision remains a work in progress, highlighting the need for further refinement and safeguards to ensure ethical and equitable placement."} | ||||
| 134 | −{"work_id": 4413427262, "title": "AI Agents vs. Agentic AI: A Conceptual taxonomy, applications and challenges", "abstract": "Information fusion, in the context of the Generative AI era, must distinguish AI Agents from Agentic AI. This review critically distinguishes between AI Agents and Agentic AI, offering a structured, conceptual taxonomy, application mapping, and analysis of opportunities and challenges to clarify their divergent design philosophies and capabilities. We begin by outlining the search strategy and foundational definitions, characterizing AI Agents as modular systems driven and enabled by LLMs and LIMs for task-specific automation. Generative AI is positioned as a precursor providing the foundation, with AI agents advancing through tool integration, prompt engineering, and reasoning enhancements. We then characterize Agentic AI systems, which, in contrast to AI Agents, represent a paradigm shift marked by multi-agent collaboration, dynamic task decomposition, persistent memory, and coordinated autonomy. Through a chronological evaluation of architectural evolution, operational mechanisms, interaction styles, and autonomy levels, we present a comparative analysis across both AI agents and agentic AI paradigms. Application domains enabled by AI Agents such as customer support, scheduling, and data summarization are then contrasted with Agentic AI deployments in research automation, robotic coordination, and medical decision support. We further examine unique challenges in each paradigm including hallucination, brittleness, emergent behavior, and coordination failure, and propose targeted solutions such as ReAct loops, retrieval-augmented generation (RAG), automation coordination layers, and causal modeling. This work aims to provide a roadmap for developing robust, scalable, and explainable AI-driven systems."} | ||||
| 135 | −{"work_id": 2990704537, "title": "SuperGLUE: A Stickier Benchmark for General-Purpose Language Understanding Systems", "abstract": "In the last year, new models and methods for pretraining and transfer learning have driven striking performance improvements across a range of language understanding tasks. The GLUE benchmark, introduced a little over one year ago, offers a single-number metric that summarizes progress on a diverse set of such tasks, but performance on the benchmark has recently surpassed the level of non-expert humans, suggesting limited headroom for further research. In this paper we present SuperGLUE, a new benchmark styled after GLUE with a new set of more difficult language understanding tasks, a software toolkit, and a public leaderboard. SuperGLUE is available at https://super.gluebenchmark.com."} | ||||
| 136 | −{"work_id": 46659105, "title": "Evaluation: from precision, recall and F-measure to ROC, informedness, markedness and correlation", "abstract": "Background. LLM-as-Judge is increasingly adopted in automated program repair (APR) to assess patch correctness, yet its validity as a measurement instrument remains unaudited: potential benchmark-identifier leakage, evidence-presentation bias, and explanation unreliability have not been systematically examined. Aims. We investigate whether LLM Judge produces unbiased, stable, and well-grounded patch correctness judgments across three validity dimensions: metadata leakage, evidence presentation, and explanation reliability. Method. On a balanced, paired dataset of 326 patches from 163 Defects4J bugs, we evaluate GPT-4o and DeepSeek-V3 across a 12-setting prompt matrix covering benchmark-identifying metadata exposure and evidence presentation variants. We further conduct a manual analysis of 60 GPT-4o explanations using a five-category failure taxonomy and three independent annotators. Results. Under sanitized conditions, GPT-4o achieves an accuracy of 77.3% (MCC = 0.575, FPR = 17.2%), while DeepSeek-V3 achieves 80.4% accuracy (MCC = 0.625, FPR = 22.1%), with no statistically significant difference between the two models. Exposing combined benchmark-identifying metadata yields a suggestive accuracy increase of 4.3 percentage points for GPT-4o and 1.8 percentage points for DeepSeek-V3. Declaring that all tests have passed does not significantly bias either model; in contrast, providing a developer reference patch leads to substantial and statistically significant improvements for both models. Explanation failures are concentrated in misclassified cases, with the false-positive quadrant showing a 93.3% failure rate, primarily driven by hallucinated evidence and missed edge cases. Conclusions. LLM Judge is useful as a triage aid but is insufficient as a standalone correctness oracle. Reliable deployment requires prompt sanitization, explicit false positive rate reporting, clear distinction between reference-assisted and standalone assessment, and treating LLM explanations as investigative hypotheses rather than self-validating justifications."} | ||||
| 137 | −{"work_id": 7127274868, "title": "Parental AI Investment Behaviours and AI \u2010Mediated Informal Digital Learning of English: The Chain Mediating Role of Children's Perceived AI Value and Effort Expectancy for AI", "abstract": "ABSTRACT Background The proliferation of generative artificial intelligence (AI) has popularised AI\u2010Mediated Informal Digital Learning of English (AI\u2010IDLE). Whilst research in this area is growing, social influencing factors, especially the role of parents as significant others, remain underexplored. Objectives Guided by the Situational Expectancy\u2010Value Theory (SEVT), this study aims to investigate the impact of parental AI investment behaviours on students' engagement in AI\u2010IDLE. It specifically examines the mediating roles of Perceived AI Value and Effort Expectancy for AI in this relationship. Methods A questionnaire survey was administered to 2346 primary and secondary school students in China. The collected data were analysed using structural equation modelling (SEM) to test the proposed direct and mediating effects. Results The findings revealed that parental AI investment behaviours directly promoted students' AI\u2010IDLE engagement. Furthermore, they exerted significant indirect effects through the separate mediating roles of Perceived AI Value and Effort Expectancy for AI, as well as through their chain mediation pathway. Conclusions This research enriches the application of SEVT by extending it to informal, self\u2010regulated, and technology\u2010enhanced language learning contexts. It underscores the crucial role parents play in out\u2010of\u2010class learning and offers practical insights for guiding children to use AI tools effectively for English proficiency development."} | ||||
| 138 | −{"work_id": 2999309192, "title": "The advantages of the Matthews correlation coefficient (MCC) over F1 score and accuracy in binary classification evaluation", "abstract": "Abstract Background To evaluate binary classifications and their confusion matrices, scientific researchers can employ several statistical rates, accordingly to the goal of the experiment they are investigating. Despite being a crucial issue in machine learning, no widespread consensus has been reached on a unified elective chosen measure yet. Accuracy and F 1 score computed on confusion matrices have been (and still are) among the most popular adopted metrics in binary classification tasks. However, these statistical measures can dangerously show overoptimistic inflated results, especially on imbalanced datasets. Results The Matthews correlation coefficient (MCC), instead, is a more reliable statistical rate which produces a high score only if the prediction obtained good results in all of the four confusion matrix categories (true positives, false negatives, true negatives, and false positives), proportionally both to the size of positive elements and the size of negative elements in the dataset. Conclusions In this article, we show how MCC produces a more informative and truthful score in evaluating binary classifications than accuracy and F 1 score, by first explaining the mathematical properties, and then the asset of MCC in six synthetic use cases and in a real genomics scenario. We believe that the Matthews correlation coefficient should be preferred to accuracy and F 1 score in evaluating binary classification tasks by all scientific communities."} | ||||
| 139 | −{"work_id": 7133233472, "title": "QLoRA: Efficient Finetuning of Quantized LLMs", "abstract": "We present QLoRA, an efficient finetuning approach that reduces memory usage enough to finetune a 65B parameter model on a single 48GB GPU while preserving full 16-bit finetuning task performance. QLoRA backpropagates gradients through a frozen, 4-bit quantized pretrained language model into Low Rank Adapters~(LoRA). Our best model family, which we name Guanaco, outperforms all previous openly released models on the Vicuna benchmark, reaching 99.3% of the performance level of ChatGPT while only requiring 24 hours of finetuning on a single GPU. QLoRA introduces a number of innovations to save memory without sacrificing performance: (a) 4-bit NormalFloat (NF4), a new data type that is information theoretically optimal for normally distributed weights (b) double quantization to reduce the average memory footprint by quantizing the quantization constants, and (c) paged optimziers to manage memory spikes. We use QLoRA to finetune more than 1,000 models, providing a detailed analysis of instruction following and chatbot performance across 8 instruction datasets, multiple model types (LLaMA, T5), and model scales that would be infeasible to run with regular finetuning (e.g. 33B and 65B parameter models). Our results show that QLoRA finetuning on a small high-quality dataset leads to state-of-the-art results, even when using smaller models than the previous SoTA. We provide a detailed analysis of chatbot performance based on both human and GPT-4 evaluations showing that GPT-4 evaluations are a cheap and reasonable alternative to human evaluation. Furthermore, we find that current chatbot benchmarks are not trustworthy to accurately evaluate the performance levels of chatbots. A lemon-picked analysis demonstrates where Guanaco fails compared to ChatGPT. We release all of our models and code, including CUDA kernels for 4-bit training."} | ||||
| 140 | −{"work_id": 7133236347, "title": "TRiSM for Agentic AI: A review of Trust, Risk, and Security Management in LLM-based Agentic Multi-Agent Systems", "abstract": "Agentic AI systems, built upon large language models (LLMs) and deployed in multi-agent configurations, are redefining intelligence, autonomy, collaboration, and decision-making across enterprise and societal domains. This review presents a structured analysis of Trust, Risk, and Security Management (TRiSM) in the context of LLM-based Agentic Multi-Agent Systems (AMAS). We begin by examining the conceptual foundations of Agentic AI and highlight its architectural distinctions from traditional AI agents. We then adapt and extend the AI TRiSM framework for Agentic AI, structured around key pillars: Explainability, ModelOps, Security, Privacy and their Lifecycle Governance , each contextualized to the challenges of AMAS. A risk taxonomy is proposed to capture the unique threats and vulnerabilities of Agentic AI, ranging from coordination failures to prompt-based adversarial manipulation. To make coordination and tool use measurable in practice, we propose two metrics: the Component Synergy Score (CSS), which captures inter-agent enablement, and the Tool Utilization Efficacy (TUE), which evaluates whether tools are invoked correctly and efficiently. We further discuss strategies for improving explainability in Agentic AI, as well as approaches to enhancing security and privacy through encryption, adversarial robustness, and regulatory compliance. The review concludes with a research roadmap for the responsible development and deployment of Agentic AI, highlighting key directions to align emerging systems with TRiSM principles-ensuring safety, transparency, and accountability in their operation."} | ||||
| 141 | −{"work_id": 2100415632, "title": "Efficient learning by implicit exploration in bandit problems with side observations", "abstract": "We consider online learning problems under a partial observability model capturing situations where the information conveyed to the learner is between full information and bandit feedback. In the simplest variant, we assume that in addition to its own loss, the learner also gets to observe losses of some other actions. The revealed losses depend on the learner's action and a directed observation system chosen by the environment. For this setting, we propose the first algorithm that enjoys near-optimal regret guarantees without having to know the observation system before selecting its actions. Along similar lines, we also define a new partial information setting that models online combinatorial optimization problems where the feedback received by the learner is between semi-bandit and full feedback. As the predictions of our first algorithm cannot be always computed efficiently in this setting, we propose another algorithm with similar properties and with the benefit of always being computationally efficient, at the price of a slightly more complicated tuning mechanism. Both algorithms rely on a novel exploration strategy called implicit exploration, which is shown to be more efficient both computationally and information-theoretically than previously studied exploration strategies for the problem."} | ||||
| 142 | −{"work_id": 2165856466, "title": "Spectral bandits for smooth graph functions", "abstract": "Smooth functions on graphs have wide applications in manifold and semi-supervised learning. In this paper, we study a bandit problem where the payoffs of arms are smooth on a graph. This framework is suitable for solving online learning problems that involve graphs, such as content-based recommendation. In this problem, each item we can recommend is a node and its expected rating is similar to its neighbors. The goal is to recommend items that have high expected ratings. We aim for the algorithms where the cumulative regret with respect to the optimal policy would not scale poorly with the number of nodes. In particular, we introduce the notion of an effective dimension, which is small in real-world graphs, and propose two algorithms for solving our problem that scale linearly and sublinearly in this dimension. Our experiments on real-world content recommendation problem show that a good estimator of user preferences for thousands of items can be learned from just tens of nodes evaluations."} | ||||
| 143 | −{"work_id": 7133226216, "title": "The Surprising Effectiveness of PPO in Cooperative Multi-Agent Games", "abstract": "Proximal Policy Optimization (PPO) is a ubiquitous on-policy reinforcement learning algorithm but is significantly less utilized than off-policy learning algorithms in multi-agent settings. This is often due to the belief that PPO is significantly less sample efficient than off-policy methods in multi-agent systems. In this work, we carefully study the performance of PPO in cooperative multi-agent settings. We show that PPO-based multi-agent algorithms achieve surprisingly strong performance in four popular multi-agent testbeds: the particle-world environments, the StarCraft multi-agent challenge, Google Research Football, and the Hanabi challenge, with minimal hyperparameter tuning and without any domain-specific algorithmic modifications or architectures. Importantly, compared to competitive off-policy methods, PPO often achieves competitive or superior results in both final returns and sample efficiency. Finally, through ablation studies, we analyze implementation and hyperparameter factors that are critical to PPO's empirical performance, and give concrete practical suggestions regarding these factors. Our results show that when using these practices, simple PPO-based methods can be a strong baseline in cooperative multi-agent reinforcement learning. Source code is released at \\url{https://github.com/marlbenchmark/on-policy}."} | ||||
| 144 | −{"work_id": 4390690043, "title": "Data-Centric Foundation Models in Computational Healthcare: A Survey", "abstract": "The advent of foundation models (FMs) as an emerging suite of AI techniques has struck a wave of opportunities in computational healthcare. The interactive nature of these models, guided by pre-training data and human instructions, has ignited a data-centric AI paradigm that emphasizes better data characterization, quality, and scale. In healthcare AI, obtaining and processing high-quality clinical data records has been a longstanding challenge, encompassing data quantity, annotation, patient privacy, and ethics. In this survey, we investigate a wide range of data-centric approaches in the FM era (from model pre-training to inference) towards improving the healthcare workflow. We discuss key perspectives in AI security, assessment, and alignment with human values. Finally, we offer a promising outlook on FM-based analytics to enhance patient outcomes and clinical workflows in the evolving landscape of healthcare and medicine. We provide an up-to-date list of healthcare-related foundation models and datasets at https://github.com/Yunkun-Zhang/Data-Centric-FM-Healthcare ."} | ||||
| 145 | −{"work_id": 2907492528, "title": "A Comprehensive Survey on Graph Neural Networks", "abstract": "Deep learning has revolutionized many machine learning tasks in recent years, ranging from image classification and video processing to speech recognition and natural language understanding. The data in these tasks are typically represented in the Euclidean space. However, there is an increasing number of applications, where data are generated from non-Euclidean domains and are represented as graphs with complex relationships and interdependency between objects. The complexity of graph data has imposed significant challenges on the existing machine learning algorithms. Recently, many studies on extending deep learning approaches for graph data have emerged. In this article, we provide a comprehensive overview of graph neural networks (GNNs) in data mining and machine learning fields. We propose a new taxonomy to divide the state-of-the-art GNNs into four categories, namely, recurrent GNNs, convolutional GNNs, graph autoencoders, and spatial-temporal GNNs. We further discuss the applications of GNNs across various domains and summarize the open-source codes, benchmark data sets, and model evaluation of GNNs. Finally, we propose potential research directions in this rapidly growing field."} | ||||
| 146 | −{"work_id": 4400228804, "title": "The Conglomeration of Everything: Shifting Animation Production Practices due to Artificial Intelligence", "abstract": "Artificial Intelligence (AI) is incorporated into systems that impact us daily and generative AI is the next evolution of the technology.For media studios who have attempted to be early adopters of the technology, it has resulted in negative responses online by creatives.These responses recognize that the usage of generative AI brings up concerns about ethics, plagiarism, and the loss of jobs in creative positions.I argue that AI usage in animation will not be as affected by AI as other creative jobs due to the negative pushback against the usage of generative AI and the inability to copyright nonhuman-made creative works.This future era of AI looks to shift the current production pipelines of film and media in the same way that digital animation tools took the market for commercial animation away from traditional hand-drawn animators but I believe that workflow changes will only manifest within the preproduction process. Artificial Intelligence and its Integration in the World Around UsEver since the beginning of the 20 th century, Artificial Intelligence (AI) has captured the imaginations of creatives with films such as Metropolis (1927), The Day the Earth Stood Still (1951), and 2001 a Space Odyssey (1968).Research towards AI gained traction in the 1950s when scientists Herbert Simon, Allen Newell, and Cliff Shaw created Logic Theorist, a seminal AI program that debuted at the Dartmouth Summer Research Project on Artificial Intelligence in 1956. 1 As AI matured, significant milestones occurred: \"machine learning\" coined by Arthur Samuel (1959), the first \"chatbot\" ELIZA by Joseph Weizenbaum (1966), proposal of autonomous vehicles by James L. Adams (1979), chess master Gary Kasparov's defeat by Deep Blue (1997), and Apple's introduction of Siri (2011). 2 Milestones in generative AI also followed: Geoffrey Hinton published \"A Fast Learning Algorithm for Deep Belief Nets\" (2006), Generative Adversarial Networks (GANs) were introduced by Ian Goodfellow (2014), and consumer-marketed generative AI services (ChatGPT, MidJourney, Dall-E 2) hit the mainstream (2022).3 Creatives have gained access to the technology and begun implementing AI into their production workflows, pushing the creative capabilities of computer-generated imagery.4 If you are able to access the internet, the capabilities of generative AI is at your fingertips. 1 History-Computer, \"Logic Theorist Explained -Everything You Need to Know,\" April 16, 2024,"} | ||||
| 147 | −{"work_id": 4289785095, "title": "An Image is Worth One Word: Personalizing Text-to-Image Generation using Textual Inversion", "abstract": "Text-to-image models offer unprecedented freedom to guide creation through natural language. Yet, it is unclear how such freedom can be exercised to generate images of specific unique concepts, modify their appearance, or compose them in new roles and novel scenes. In other words, we ask: how can we use language-guided models to turn our cat into a painting, or imagine a new product based on our favorite toy? Here we present a simple approach that allows such creative freedom. Using only 3-5 images of a user-provided concept, like an object or a style, we learn to represent it through new \"words\" in the embedding space of a frozen text-to-image model. These \"words\" can be composed into natural language sentences, guiding personalized creation in an intuitive way. Notably, we find evidence that a single word embedding is sufficient for capturing unique and varied concepts. We compare our approach to a wide range of baselines, and demonstrate that it can more faithfully portray the concepts across a range of applications and tasks. Our code, data and new words will be available at: https://textual-inversion.github.io"} | ||||
| 148 | −{"work_id": 2761873684, "title": "Rainbow: Combining Improvements in Deep Reinforcement Learning", "abstract": "The deep reinforcement learning community has made several independent improvements to the DQN algorithm. However, it is unclear which of these extensions are complementary and can be fruitfully combined. This paper examines six extensions to the DQN algorithm and empirically studies their combination. Our experiments show that the combination provides state-of-the-art performance on the Atari 2600 benchmark, both in terms of data efficiency and final performance. We also provide results from a detailed ablation study that shows the contribution of each component to overall performance."} | ||||
| 149 | −{"work_id": 7148475777, "title": "Capabilities of GPT\u20115 on multimodal medical reasoning", "abstract": "Recent advances in large language models (LLMs) have enabled general-purpose systems to perform increasingly complex domain-specific reasoning without extensive fine-tuning. In the medical domain, decision-making often requires integrating heterogeneous information sources, including patient narratives, structured data, and medical images. This study positions GPT-5 as a generalist multimodal reasoner for medical decision support and systematically evaluates its zero-shot chain-of-thought reasoning performance on both text-based question answering and visual question answering tasks under a unified protocol. We benchmark GPT-5, GPT-5-mini, GPT-5-nano, and GPT-4o-2024-11-20 against standardized splits of MedQA, MedXpertQA (text and multimodal), MMLU medical subsets, USMLE self-assessment exams, and VQA-RAD. Results show that GPT-5 consistently outperforms all baselines, achieving state-of-the-art accuracy across all QA benchmarks and delivering substantial gains in multimodal reasoning. On MedXpertQA MM, GPT-5 improves reasoning and understanding scores by +29.26% and +26.18% over GPT-4o, respectively, and surpasses pre-licensed human experts by +24.23% in reasoning and +29.40% in understanding. In contrast, GPT-4o remains below human expert performance in most dimensions. A representative case study demonstrates GPT-5\u2019s ability to integrate visual and textual cues into a coherent diagnostic reasoning chain, recommending appropriate high-stakes interventions. Our results show that, on these controlled multimodal reasoning benchmarks, GPT-5 moves from human-comparable to above human-expert performance. This improvement may substantially inform the design of future clinical decision-support systems. We make the code public at the GPT-5-Evaluation."} | ||||
| 150 | −{"work_id": 4409269614, "title": "Generative AI and Academic Integrity in Higher Education: A Systematic Review and Research Agenda", "abstract": "This systematic literature review rigorously evaluates the impact of Generative AI (GenAI) on academic integrity within higher education settings. The primary objective is to synthesize how GenAI technologies influence student behavior and academic honesty, assessing the benefits and risks associated with their integration. We defined clear inclusion and exclusion criteria, focusing on studies explicitly discussing GenAI\u2019s role in higher education from January 2021 to December 2024. Databases included ABI/INFORM, ACM Digital Library, IEEE Xplore, and JSTOR, with the last search conducted in May 2024. A total of 41 studies met our precise inclusion criteria. Our synthesis methods involved qualitative analysis to identify common themes and quantify trends where applicable. The results indicate that while GenAI can enhance educational engagement and efficiency, it also poses significant risks of academic dishonesty. We critically assessed the risk of bias in included studies and noted a limitation in the diversity of databases, which might have restricted the breadth of perspectives. Key implications suggest enhancing digital literacy and developing robust detection tools to effectively manage GenAI\u2019s dual impacts. No external funding was received for this review. Future research should expand database sources and include more diverse study designs to overcome current limitations and refine policy recommendations."} | ||||
| 151 | −{"work_id": 4384071683, "title": "Large language models encode clinical knowledge", "abstract": "Abstract Large language models (LLMs) have demonstrated impressive capabilities, but the bar for clinical applications is high. Attempts to assess the clinical knowledge of models typically rely on automated evaluations based on limited benchmarks. Here, to address these limitations, we present MultiMedQA, a benchmark combining six existing medical question answering datasets spanning professional medicine, research and consumer queries and a new dataset of medical questions searched online, HealthSearchQA. We propose a human evaluation framework for model answers along multiple axes including factuality, comprehension, reasoning, possible harm and bias. In addition, we evaluate Pathways Language Model 1 (PaLM, a 540-billion parameter LLM) and its instruction-tuned variant, Flan-PaLM 2 on MultiMedQA. Using a combination of prompting strategies, Flan-PaLM achieves state-of-the-art accuracy on every MultiMedQA multiple-choice dataset (MedQA 3 , MedMCQA 4 , PubMedQA 5 and Measuring Massive Multitask Language Understanding (MMLU) clinical topics 6 ), including 67.6% accuracy on MedQA (US Medical Licensing Exam-style questions), surpassing the prior state of the art by more than 17%. However, human evaluation reveals key gaps. To resolve this, we introduce instruction prompt tuning, a parameter-efficient approach for aligning LLMs to new domains using a few exemplars. The resulting model, Med-PaLM, performs encouragingly, but remains inferior to clinicians. We show that comprehension, knowledge recall and reasoning improve with model scale and instruction prompt tuning, suggesting the potential utility of LLMs in medicine. Our human evaluations reveal limitations of today\u2019s models, reinforcing the importance of both evaluation frameworks and method development in creating safe, helpful LLMs for clinical applications."} | ||||
| 152 | −{"work_id": 7138363754, "title": "AdaptCLIP: Adapting CLIP for Universal Visual Anomaly Detection", "abstract": "Universal visual anomaly detection aims to identify anomalies from novel or unseen vision domains without additional fine-tuning, which is critical in open scenarios. Recent studies have demonstrated that pre-trained vision-language models like CLIP exhibit strong generalization with just zero or a few normal images. However, existing methods struggle to design prompt templates, handle complex token interactions, or require fine-tuning on target domains, resulting in limited flexibility. In this work, we present a simple yet effective AdaptCLIP based on two key insights. First, adaptive visual and textual representations should be learned alternately rather than jointly. Second, comparative learning between query and normal image prompt should incorporate both contextual and aligned residual features, rather than relying solely on residual features. AdaptCLIP treats CLIP models as a foundational service, adding only three simple adapters, visual adapter, textual adapter, and prompt-query adapter, at its input or output ends. AdaptCLIP supports zero-/few-shot generalization across domains and provides a training-free approach on target domains once trained on a base dataset. AdaptCLIP achieves state-of-the-art performance on 12 anomaly detection benchmarks from industrial and medical domains, significantly outperforming existing competitive methods."} | ||||
| 153 | −{"work_id": 4221143046, "title": "BNAI, NO-TOKEN, and MIND-UNITY: Pillars of a Systemic Revolution in Artificial Intelligence", "abstract": "AbstractThere is a failure mode in large language models that we do not have a good name for, and thatwe therefore tend not to treat seriously enough. It is not hallucination \u2014 the model is not assertingsomething false. It is not refusal \u2014 the model answers at length. It is the production of responses thatcarry the complete outward form of careful reasoning while the cognitive work that reasoning issupposed to represent has not, in any meaningful sense, occurred. We call this theatrical compliance,and we argue that it is, in practical terms, more dangerous than either of the failure modes thatcurrently dominate alignment research. This paper identifies the phenomenon, characterizes its fiveprincipal forms, explains the asymmetry that makes it particularly costly in high-stakes settings, andoutlines the design requirements for systems intended to resist it. We do not describe such a systemin detail here. Our goal is to establish theatrical compliance as a research problem in its own rightand to argue that addressing it requires instruments operating at a fundamentally different level ofabstraction than task-level prompting frameworks.Keywords: theatrical compliance, large language models, AI reasoning quality, cognitiveprocess evaluation, prompt engineering, metacognitive systems."} | ||||
| 154 | −{"work_id": 4394934695, "title": "The impact of generative AI on higher education learning and teaching: A study of educators\u2019 perspectives", "abstract": "In recent months, Artificial Intelligence (AI) has had, and will continue to have, a dramatic impact on Higher Education (HE). A study conducted by researchers at a leading university in Australia surveyed 30 of their teaching staff, drawn predominantly from their teaching academy, and interviewed eight of them regarding the impact of AI on HE. Data were analyzed using the procedures of Inductive Thematic Analysis and revealed a lack of any homogenous sentiment around AI in HE and much ambiguity regarding best practice regarding recent technological developments. The results indicate concerns exist around concepts relating to academic integrity, however, these concerns may be exaggerated. Almost half of the participants indicated they were using AI within their teaching roles with the most common design change being modifications to assessments. Less than a quarter of staff agreed the university has adequately equipped them for AI, and more than three quarters indicated they would like support. They unanimously assumed the technology will improve. Keeping in mind universities\u2019 obligation to serve students by preparing them for industry, it is vitally important that the HE sector stays informed of developments in AI and commit to ongoing research and discussions regarding best practice in response to AI. However, anything regarding AI and future developments will be extremely difficult to predict."} | ||||
| 155 | −{"work_id": 4398243313, "title": "A scoping review on how generative artificial intelligence transforms assessment in higher education", "abstract": "Abstract Generative artificial intelligence provides both opportunities and challenges for higher education. Existing literature has not properly investigated how this technology would impact assessment in higher education. This scoping review took a forward-thinking approach to investigate how generative artificial intelligence transforms assessment in higher education. We used the PRISMA extension for scoping reviews to select articles for review and report the results. In the screening, we retrieved 969 articles and selected 32 empirical studies for analysis. Most of the articles were published in 2023. We used three levels\u2014students, teachers, and institutions\u2014to analyze the articles. Our results suggested that assessment should be transformed to cultivate students\u2019 self-regulated learning skills, responsible learning, and integrity. To successfully transform assessment in higher education, the review suggested that (i) teacher professional development activities for assessment, AI, and digital literacy should be provided, (ii) teachers\u2019 beliefs about human and AI assessment should be strengthened, and (iii) teachers should be innovative and holistic in their teaching to reflect the assessment transformation. Educational institutions are recommended to review and rethink their assessment policies, as well as provide more inter-disciplinary programs and teaching."} | ||||
| 156 | −{"work_id": 4396531244, "title": "The Fusion of Multilingual Semantic Search and Large Language Models: A New Paradigm for Enhanced Topic Exploration and Contextual Search", "abstract": "Digital news articles are often considered as a primary source of information in today's information-driven society which requires query processing methods to handle the ever-increasing volume of content and various forms of queries. Our goal is to develop a novel approach that can improve the way users access and retrieve news by considering Natural Language Processing (NLP)-driven query processing for news articles. This will address the complexities of news articles written in multiple languages and covering a range of topics. The proposed method helps in enhancing the performance of query processing in applications such as journalism, academic research, and content suggestion. By conducting experiments with Sentence Embeddings, Large Language Model (LLM), and Approximate Nearest Neighbours (ANN), this thesis improves news article search systems. Results show that the method improves the quality of the search results for the queries to return more accurate and relevant search results across different languages."} | ||||
| 157 | −{"work_id": 4321648656, "title": "From Paintbrush to Pixel: A Review of Deep Neural Networks in AI-Generated Art", "abstract": "Abstract This paper delves into the fascinating field of AI-generated art and explores the various deep neural network architectures and models that have been utilized to create it. From the classic convolutional networks to the cutting-edge diffusion models, we examine the key players in the field. We explain the general structures and working principles of these neural networks. Then, we showcase examples of milestones, starting with the dreamy landscapes of DeepDream and moving on to the most recent developments, including Stable Diffusion and DALL-E 3, which produce mesmerizing images. We provide a detailed comparison of these models, highlighting their strengths and limitations, and examining the remarkable progress that deep neural networks have made so far in a short period of time. With a unique blend of technical explanations and insights into the current state of AI-generated art, this paper exemplifies how art and computer science interact."} | ||||
| 158 | −{"work_id": 2291445757, "title": "Support Vector Regression", "abstract": "Chapter 9 presents support vector regression (SVR), a relatively newer supervised learning algorithm for predictive regression modeling, which \u2013 like random forests for regression \u2013 also may outperform the least-squares - based methods. Discussed is \u03b5 -insensitive loss used by SVR, the \u03b5 -tube concept, as well as algorithms for linear and nonlinear SVRs."} | ||||
| 159 | −{"work_id": 2950067852, "title": "A Recurrent Latent Variable Model for Sequential Data", "abstract": "In this paper, we explore the inclusion of latent random variables into the hidden state of a recurrent neural network (RNN) by combining the elements of the variational autoencoder. We argue that through the use of high-level latent random variables, the variational RNN (VRNN) can model the kind of variability observed in highly structured sequential data such as natural speech. We empirically evaluate the proposed model against other related sequential models on four speech datasets and one handwriting dataset. Our results show the important roles that latent random variables can play in the RNN dynamics."} | ||||
| 160 | −{"work_id": 7124426637, "title": "A review of machine learning with small and limited data", "abstract": "Abstract The abundance of large datasets has driven machine learning (ML) model performance and scalability breakthroughs. However, many domains and practical applications must contend with the limitations imposed by small and very small datasets. This survey thoroughly examines state-of-the-art methodologies and challenges in ML approaches tailored for scenarios where data scarcity is a fundamental constraint. We begin by outlining the theoretical foundations that govern learning from small data. Then, we discuss recent advancements in data-related frameworks (i.e., training and evaluation methods, etc.) and algorithmic architectures (meta and transfer learning). We also explore the trade-offs and related issues inherent in designing models for small data, such as overfitting, generalization error, and the bias-variance dilemma, as well as identify minimal interventions that can overcome such issues. Further, this survey covers the role of synthetic data generation and simulation-based approaches to enlarge data availability while critically assessing the implications of these techniques on model performance. Finally, in synthesizing open literature, we shed light on emerging trends/research directions that aim to overcome challenges arising from limited data, such as incorporating domain knowledge and causal principles to guide the learning process and integrating symbolic reasoning with statistical learning."} | ||||
| 161 | −{"work_id": 4389437528, "title": "Education in the Era of Generative Artificial Intelligence (AI): Understanding the Potential Benefits of ChatGPT in Promoting Teaching and Learning", "abstract": "Since its maiden release into the public domain on November 30, 2022, ChatGPT garnered more than one million subscribers within a week. The generative AI tool \u23bcChatGPT took the world by surprise with it sophisticated capacity to carry out remarkably complex tasks. The extraordinary abilities of ChatGPT to perform complex tasks within the field of education has caused mixed feelings among educators as this advancement in AI seems to revolutionize existing educational praxis. This review article synthesizes recent extant literature to offer some potential benefits of ChatGPT in promoting teaching and learning. Benefits of ChatGPT include but are not limited to promotion of personalized and interactive learning, generating prompts for formative assessment activities that provide ongoing feedback to inform teaching and learning etc. The paper also highlights some inherent limitations in the ChatGPT such as generating wrong information, biases in data training which may augment existing biases, privacy issues etc. The study offers recommendations on how ChatGPT could be leveraged to maximize teaching and learning. Policy makers, researchers, educators and technology experts could work together and start conversations on how these evolving generative AI tools could be used safely and constructively to improve education and support students\u2019 learning."} | ||||
| 162 | −{"work_id": 2973229164, "title": "Continuous control for robot based on deep reinforcement learning", "abstract": "results of redundant manipulator . . . . . . . ."} | ||||
| 163 | −{"work_id": 3140854437, "title": "Review of deep learning: concepts, CNN architectures, challenges, applications, future directions", "abstract": "In the last few years, the deep learning (DL) computing paradigm has been deemed the Gold Standard in the machine learning (ML) community. Moreover, it has gradually become the most widely used computational approach in the field of ML, thus achieving outstanding results on several complex cognitive tasks, matching or even beating those provided by human performance. One of the benefits of DL is the ability to learn massive amounts of data. The DL field has grown fast in the last few years and it has been extensively used to successfully address a wide range of traditional applications. More importantly, DL has outperformed well-known ML techniques in many domains, e.g., cybersecurity, natural language processing, bioinformatics, robotics and control, and medical information processing, among many others. Despite it has been contributed several works reviewing the State-of-the-Art on DL, all of them only tackled one aspect of the DL, which leads to an overall lack of knowledge about it. Therefore, in this contribution, we propose using a more holistic approach in order to provide a more suitable starting point from which to develop a full understanding of DL. Specifically, this review attempts to provide a more comprehensive survey of the most important aspects of DL and including those enhancements recently added to the field. In particular, this paper outlines the importance of DL, presents the types of DL techniques and networks. It then presents convolutional neural networks (CNNs) which the most utilized DL network type and describes the development of CNNs architectures together with their main features, e.g., starting with the AlexNet network and closing with the High-Resolution network (HR.Net). Finally, we further present the challenges and suggested solutions to help researchers understand the existing research gaps. It is followed by a list of the major DL applications. Computational tools including FPGA, GPU, and CPU are summarized along with a description of their influence on DL. The paper ends with the evolution matrix, benchmark datasets, and summary and conclusion."} | ||||
| 164 | −{"work_id": 7128029160, "title": "A generalizable foundation model for analysis of human brain MRI", "abstract": "Artificial intelligence applied to brain magnetic resonance imaging (MRI) holds potential to advance diagnosis, prognosis and treatment planning for neurological diseases. The field has been constrained, thus far, by limited training data and task-specific models that do not generalize well across patient populations and medical tasks. By leveraging self-supervised learning, pretraining and targeted adaptation, foundation models present a promising paradigm to overcome these limitations. Here we present Brain Imaging Adaptive Core (BrainIAC)-a foundation model designed to learn generalized representations from unlabeled brain MRI data and serve as a core basis for diverse downstream application adaptation. Trained and validated on 48,965 brain MRIs across a broad spectrum of tasks, we demonstrate that BrainIAC outperforms localized supervised training and other pretrained models, particularly in low-data, few-shot, settings and in high-difficulty prediction tasks, allowing for application in scenarios otherwise infeasible. BrainIAC can be integrated into imaging pipelines and multimodal frameworks and may lead to improved biomarker discovery and artificial intelligence clinical translation."} | ||||
| 165 | −{"work_id": 2962862931, "title": "On a Method to Measure Supervised Multiclass Model\u2019s Interpretability: Application to Degradation Diagnosis (Short Paper)", "abstract": "In an industrial maintenance context, degradation diagnosis is the problem of determining the current level of degradation of operating machines based on measurements. With the emergence of Machine Learning techniques, such a problem can now be solved by training a degradation model offline and by using it online. While such models are more and more accurate and performant, they are often black-box and their decisions are therefore not interpretable for human maintenance operators. On the contrary, interpretable ML models are able to provide explanations for the model\u2019s decisions and consequently improves the confidence of the human operator about the maintenance decision based on these models. This paper proposes a new method to quantitatively measure the interpretability of such models that is agnostic (no assumption about the class of models) and that is applied on degradation models. The proposed method requires that the decision maker sets up some high level parameters in order to measure the interpretability of the models and then can decide whether the obtained models are satisfactory or not. The method is formally defined and is fully illustrated on a decision tree degradation model and a model trained with a recent neural network architecture called Multiclass Neural Additive Model."} | ||||
| 166 | −{"work_id": 4323655724, "title": "ChatGPT for good? On opportunities and challenges of large language models for education", "abstract": "Large language models represent a significant advancement in the field of AI. The underlying technology is key to further innovations and, despite critical views and even bans within communities and regions, large language models are here to stay. This position paper presents the potential benefits and challenges of educational applications of large language models, from student and teacher perspectives. We briefly discuss the current state of large language models and their applications. We then highlight how these models can be used to create educational content, improve student engagement and interaction, and personalize learning experiences. With regard to challenges, we argue that large language models in education require teachers and learners to develop sets of competencies and literacies necessary to both understand the technology as well as their limitations and unexpected brittleness of such systems. In addition, a clear strategy within educational systems and a clear pedagogical approach with a strong focus on critical thinking and strategies for fact checking are required to integrate and take full advantage of large language models in learning settings and teaching curricula. Other challenges such as the potential bias in the output, the need for continuous human oversight, and the potential for misuse are not unique to the application of AI in education. But we believe that, if handled sensibly, these challenges can offer insights and opportunities in education scenarios to acquaint students early on with potential societal biases, criticalities, and risks of AI applications. We conclude with recommendations for how to address these challenges and ensure that such models are used in a responsible and ethical manner in education."} | ||||
| 167 | −{"work_id": 4387355843, "title": "TimeLLM: Time Series Forecasting by Reprogramming Large Language Models", "abstract": "Accurate forecasting of time series is essential to many dynamic real-world systems and has attracted extensive research attention. Unlike natural language processing or computer vision, where one large model can often address multiple tasks, most existing forecasting solutions are highly specialized and confined to the single time series data modality. Advancements in multimodal time series foundation models have significantly lagged behind other domains, mainly because large, high-quality time series corpora remain scarce. At the same time, recent evidence suggests that large language models (LLMs) excel at understanding and reasoning across long token sequences. Exploiting those capabilities for forecasting requires a principled way to bridge numeric time series signals and linguistic tokens. This chapter presents Time-LLM, a model reprogramming framework that repurposes frozen LLM backbones for general time series prediction. As the first multimodal, large-scale approach in the time series community, Time-LLM embeds raw time series (target) signals into text (source) prototypes, aligning the two modalities before the data enters the language model backbone. To strengthen the model&s;s reasoning over time series, Time-LLM incorporates Prompt-as-Prefix (PaP), which augments contextual information and directs the reprogramming of input patches. The modified patches are then projected by the LLM to generate forecasts. Extensive evaluations demonstrate that Time-LLM serves as an effective multimodal forecaster, surpassing specialized baseline models."} | ||||
| 168 | −{"work_id": 7128165235, "title": "Multi-agent AI", "abstract": "Abstract Multi-agent artificial intelligence (MAAI) represents a foundational shift in the automation of knowledge work, moving beyond static workflows toward adaptive systems of interacting AI-based agents. These agents perceive, reason, and coordinate in real time to address complex, context-rich tasks that traditionally require human expertise. Drawing on the conceptual roots of process automation, agentic information systems, and AI, this paper introduces a structured, five-component framework that conceptualizes MAAI as a layered architecture composed of foundation model, data-centric perception and action, dynamic orchestration, agent-integrated workflow, and interaction interface. This framework disentangles the technical, organizational, and human-facing dimensions of MAAI, offering researchers and practitioners a systematic lens to analyze and design agent-based AI automation. The framework further structures three research pathways focused on advancing technical capabilities, enabling organizational integration, and addressing socio-technical implications such as fairness, accountability, and labor transformation. Together, these contributions establish a foundation for interdisciplinary inquiry into how MAAI reshapes work, coordination, and digital value creation."} | ||||
| 169 | −{"work_id": 4221150249, "title": "Graph Neural Networks for Graphs With Heterophily: A Survey", "abstract": "Recent years have witnessed fast developments of graph neural networks (GNNs) that have benefited myriad graph analytic tasks and applications. Most GNNs rely on the homophily assumption that nodes belonging to the same class are more likely to be connected. However, as a ubiquitous graph property in numerous real-world scenarios, heterophily, i.e., nodes with different labels tend to be linked, significantly limits the performance of tailor-made homophilic GNNs. Hence,GNNs for heterophilic graphsare gaining increasing research attention to enhance graph learning with heterophily. In this paper, we provide a comprehensive review of GNNs for heterophilic graphs. Specifically, we propose a systematic taxonomy that governs existing heterophilic GNN models, along with general summaries and detailed analyses. Furthermore, we discuss the relationship between heterophily and various graph research domains, aiming to facilitate the development of more effective GNNs across a spectrum of practical applications and learning tasks in the graph research community. In the end, we point out potential directions to advance and inspire future research and applications on heterophilic graph learning with GNNs."} | ||||
| 170 | −{"work_id": 4322617812, "title": "Generative AI and the future of education: Ragnar\u00f6k or reformation? A paradoxical perspective from management educators", "abstract": "Generative artificial intelligence (AI) has taken the world by storm, with notable tension transpiring in the field of education. Given that Generative AI is rapidly emerging as a transformative innovation, this article endeavors to offer a seminal rejoinder that aims to (i) reconcile the great debate on Generative AI in order to (ii) lay the foundation for Generative AI to co-exist as a transformative resource in the future of education. Using critical analysis as a method and paradox theory as a theoretical lens (i.e., the \u201chow\u201d), this article (i) defines Generative AI and transformative education (i.e., the \u201cideas\u201d), (ii) establishes the paradoxes of Generative AI (i.e., the \u201cwhat\u201d), and (iii) provides implications for the future of education from the perspective of management educators (i.e., the \u201cso what\u201d). Noteworthily, the paradoxes of Generative AI are four-fold: (Paradox #1) Generative AI is a \u2018friend\u2019 yet a \u2018foe\u2019, (Paradox #2) Generative AI is \u2018capable\u2019 yet \u2018dependent\u2019, (Paradox #3) Generative AI is \u2018accessible\u2019 yet \u2018restrictive\u2019, and (Paradox #4) Generative AI gets even \u2018popular\u2019 when \u2018banned\u2019 (i.e., the \u201cwhat\u201d). Through a position that seeks to embrace rather than reject Generative AI, the lessons and implications that emerge from the discussion herein represent a seminal contribution from management educators on this trending topic and should be useful for approaching Generative AI as a game-changer for education reformation in management and the field of education at large, and by extension, mitigating a situation where Generative AI develops into a Ragnar\u00f6k that dooms the future of education of which management education is a part of (i.e., the \u201cso what\u201d)."} | ||||
| 171 | −{"work_id": 3041133507, "title": "A Comprehensive Survey on Transfer Learning", "abstract": "Transfer learning aims at improving the performance of target learners on target domains by transferring the knowledge contained in different but related source domains. In this way, the dependence on a large number of target-domain data can be reduced for constructing target learners. Due to the wide application prospects, transfer learning has become a popular and promising area in machine learning. Although there are already some valuable and impressive surveys on transfer learning, these surveys introduce approaches in a relatively isolated way and lack the recent advances in transfer learning. Due to the rapid expansion of the transfer learning area, it is both necessary and challenging to comprehensively review the relevant studies. This survey attempts to connect and systematize the existing transfer learning research studies, as well as to summarize and interpret the mechanisms and the strategies of transfer learning in a comprehensive way, which may help readers have a better understanding of the current research status and ideas. Unlike previous surveys, this survey article reviews more than 40 representative transfer learning approaches, especially homogeneous transfer learning approaches, from the perspectives of data and model. The applications of transfer learning are also briefly introduced. In order to show the performance of different transfer learning models, over 20 representative transfer learning models are used for experiments. The models are performed on three different data sets, that is, Amazon Reviews, Reuters-21578, and Office-31, and the experimental results demonstrate the importance of selecting appropriate transfer learning models for different applications in practice."} | ||||
| 172 | −{"work_id": 4385285835, "title": "Scaling Self-Supervised Learning for Histopathology with Masked Image Modeling", "abstract": "Computational pathology is revolutionizing the field of pathology by integrating advanced computer vision and machine learning technologies into diagnostic workflows. It offers unprecedented opportunities for improved efficiency in treatment decisions by allowing pathologists to achieve higher precision and objectivity in disease classification, tumor microenvironment description and identification of new biomarkers. However, the potential of computational pathology in personalized medicine comes with significant challenges, particularly in annotating whole slide images (WSI), which is time-consuming, costly and subject to inter-observer variability. To address these challenges, Self-Supervised Learning (SSL) has emerged as a promising solution to learn representations from histology patches and leverage large volumes of unlabelled WSI. Recently, Masked Image Modeling (MIM) as a SSL framework has emerged and is now considered to outperform purely contrastive learning paradigms. In this work, we therefore explore the application of MIM to histology using iBOT, a self-supervised transformer-based framework. Through a wide range of 17 downstream tasks over seven cancer indications, both at the slide and patch levels, we provide recommendations on the pre-training of large models for histology data using MIM. First, we demonstrate that in-domain pre-training with iBOT outperforms both ImageNet pre-training and a model pre-trained with a purely contrastive learning objective, MoCo v2. Second, we show that Vision Transformers (ViT) models, when scaled appropriately, have the capability to learn pan-cancer representations that benefit a large variety of downstream tasks. Finally, our iBOT ViT-Base model (80 million parameters), pre-trained on more than 40 million histology images from 16 different cancer types, achieves state-of-the-art performance in most weakly-supervised WSI classification tasks compared to other SSL frameworks available in the literature. This paves the way for the development of a foundation model for histopathology. Our code, models and features are publicly available at https://github.com/owkin/HistoSSLscaling ."} | ||||
| 173 | −{"work_id": 3177318507, "title": "Informer: Beyond Efficient Transformer for Long Sequence Time-Series Forecasting", "abstract": "Many real-world applications require the prediction of long sequence time-series, such as electricity consumption planning. Long sequence time-series forecasting (LSTF) demands a high prediction capacity of the model, which is the ability to capture precise long-range dependency coupling between output and input efficiently. Recent studies have shown the potential of Transformer to increase the prediction capacity. However, there are several severe issues with Transformer that prevent it from being directly applicable to LSTF, including quadratic time complexity, high memory usage, and inherent limitation of the encoder-decoder architecture. To address these issues, we design an efficient transformer-based model for LSTF, named Informer, with three distinctive characteristics: (i) a ProbSparse self-attention mechanism, which achieves O(L log L) in time complexity and memory usage, and has comparable performance on sequences' dependency alignment. (ii) the self-attention distilling highlights dominating attention by halving cascading layer input, and efficiently handles extreme long input sequences. (iii) the generative style decoder, while conceptually simple, predicts the long time-series sequences at one forward operation rather than a step-by-step way, which drastically improves the inference speed of long-sequence predictions. Extensive experiments on four large-scale datasets demonstrate that Informer significantly outperforms existing methods and provides a new solution to the LSTF problem."} | ||||
| 174 | −{"work_id": 7135409568, "title": "The role of agentic artificial intelligence in healthcare: a scoping review", "abstract": "Abstract Background/ Objectives: Agentic AI represents a promising evolution of AI technology applied to healthcare, with systems increasingly capable of operating autonomously to achieve defined clinical goals. However, the literature lacks conceptual clarity between \u201cAI agents\u201d and \u201cagentic AI\u201d, and few studies have rigorously explored their clinical applications. Therefore, this study aims to conduct a novel systematic review addressing this gap by examining agentic AI systems in healthcare settings, characterizing their applications, features, outcomes, and limitations, and clarifying the conceptual distinctions between AI agents and agentic AI systems using predefined and objective criteria. Methods A comprehensive search was conducted across PubMed, Embase, Cochrane, Scopus, and Google Scholar on April 6th, 2025. Studies were included if they involved AI systems in healthcare settings that demonstrated the following agentic features: autonomous operation, goal-directed behavior, and initiating action. Data on the clinical tasks achieved by the agents, key findings, features, and limitations were collected from the included studies. Screening and extraction followed PRISMA guidelines, with Risk of Bias assessed using ROBINS-I and Cochrane's Risk of Bias tools. Results Of 984 retrieved records, seven studies met the inclusion criteria, spanning domains such as emergency medicine, oncology, radiology, and rehabilitation. Multi-agent architecture was frequently used to decompose and coordinate complex workflows. Among the included studies, the AIs showed high accuracy in diagnosing cancer patients, conducting treatment plans, sending alerts, coaching messages, analysing image data, and adapting to challenging experimental scenarios. While demonstrating potential for improved efficiency, task accuracy, and patient engagement, significant limitations were noted: narrow task scope, lack of physical agency, limited clinical validation, and barriers to integration into real-world healthcare systems. Only one system had been deployed in a patient-facing trial setting. Conclusion The current literature suggests an emerging role and application of Agentic AI, holding promise with the potential to revolutionize diagnostics, triage, treatment planning, and patient management. However, real-world implementation and evaluations in the literature are limited. Future research must address critical validation, regulation, ethics, and clinical integration challenges to realize their full potential. Clear operational definitions and frameworks for evaluating agency are essential to support safe and effective deployment of these systems."} | ||||
| 175 | −{"work_id": 2751318774, "title": "Introduction to Machine Learning", "abstract": "The goal of machine learning is to program computers to use example data or past experience to solve a given problem. Many successful applications of machine learning exist already, including systems that analyze past sales data to predict customer behavior, optimize robot behavior so that a task can be completed using minimum resources, and extract knowledge from bioinformatics data. Introduction to Machine Learning is a comprehensive textbook on the subject, covering a broad array of topics not usually included in introductory machine learning texts. In order to present a unified treatment of machine learning problems and solutions, it discusses many methods from different fields, including statistics, pattern recognition, neural networks, artificial intelligence, signal processing, control, and data mining. All learning algorithms are explained so that the student can easily move from the equations in the book to a computer program. The text covers such topics as supervised learning, Bayesian decision theory, parametric methods, multivariate methods, multilayer perceptrons, local models, hidden Markov models, assessing and comparing classification algorithms, and reinforcement learning. New to the second edition are chapters on kernel machines, graphical models, and Bayesian estimation; expanded coverage of statistical tests in a chapter on design and analysis of machine learning experiments; case studies available on the Web (with downloadable results for instructors); and many additional exercises. All chapters have been revised and updated. Introduction to Machine Learning can be used by advanced undergraduates and graduate students who have completed courses in computer programming, probability, calculus, and linear algebra. It will also be of interest to engineers in the field who are concerned with the application of machine learning methods. Adaptive Computation and Machine Learning series"} | ||||
| 176 | {"work_id": 7161734976, "title": "A multi-agent system for automating scientific discovery", "abstract": "Scientific discovery is driven by the iterative process of observation, hypothesis generation, experimentation, and data analysis. Despite recent advancements in applying artificial intelligence to biology, no system has yet automated all these stages [1, 2, 3]. Here, we introduce Robin, the first multi-agent system capable of fully automating both hypothesis generation and data analysis for experimental biology. By integrating literature search agents with data analysis agents, Robin can generate hypotheses, propose experiments, interpret experimental results, and generate updated hypotheses, achieving a semi-autonomous approach to scientific discovery. By applying this system, we were able to identify promising therapeutic candidates for dry age-related macular degeneration (dAMD), the major cause of blindness in the developed world [4, 5]. Robin proposed enhancing retinal pigment epithelium phagocytosis as a therapeutic strategy, and identified and confirmed in vitro efficacy for ripasudil and KL001. Ripasudil is a clinically-used Rho kinase (ROCK) inhibitor that has never previously been proposed for treating dAMD. To elucidate the mechanism of ripasudil-induced upregulation of phagocytosis, Robin then proposed and analyzed a follow-up RNA-seq experiment, which revealed upregulation of ABCA1 , a lipid efflux pump and possible novel target. All hypotheses, experimental directions, data analyses, and data figures in the main text of this report were produced by Robin. As the first AI system to autonomously discover and validate novel therapeutic candidates within an iterative lab-in-the-loop framework, Robin establishes a new paradigm for AI-driven scientific discovery."} | 177 | {"work_id": 7161734976, "title": "A multi-agent system for automating scientific discovery", "abstract": "Scientific discovery is driven by the iterative process of observation, hypothesis generation, experimentation, and data analysis. Despite recent advancements in applying artificial intelligence to biology, no system has yet automated all these stages [1, 2, 3]. Here, we introduce Robin, the first multi-agent system capable of fully automating both hypothesis generation and data analysis for experimental biology. By integrating literature search agents with data analysis agents, Robin can generate hypotheses, propose experiments, interpret experimental results, and generate updated hypotheses, achieving a semi-autonomous approach to scientific discovery. By applying this system, we were able to identify promising therapeutic candidates for dry age-related macular degeneration (dAMD), the major cause of blindness in the developed world [4, 5]. Robin proposed enhancing retinal pigment epithelium phagocytosis as a therapeutic strategy, and identified and confirmed in vitro efficacy for ripasudil and KL001. Ripasudil is a clinically-used Rho kinase (ROCK) inhibitor that has never previously been proposed for treating dAMD. To elucidate the mechanism of ripasudil-induced upregulation of phagocytosis, Robin then proposed and analyzed a follow-up RNA-seq experiment, which revealed upregulation of ABCA1 , a lipid efflux pump and possible novel target. All hypotheses, experimental directions, data analyses, and data figures in the main text of this report were produced by Robin. As the first AI system to autonomously discover and validate novel therapeutic candidates within an iterative lab-in-the-loop framework, Robin establishes a new paradigm for AI-driven scientific discovery."} | ||
| 177 | {"work_id": 4409147637, "title": "Mastering diverse control tasks through world models", "abstract": "Abstract Developing a general algorithm that learns to solve tasks across a wide range of applications has been a fundamental challenge in artificial intelligence. Although current reinforcement-learning algorithms can be readily applied to tasks similar to what they have been developed for, configuring them for new application domains requires substantial human expertise and experimentation 1,2 . Here we present the third generation of Dreamer, a general algorithm that outperforms specialized methods across over 150 diverse tasks, with a single configuration. Dreamer learns a model of the environment and improves its behaviour by imagining future scenarios. Robustness techniques based on normalization, balancing and transformations enable stable learning across domains. Applied out of the box, Dreamer is, to our knowledge, the first algorithm to collect diamonds in Minecraft from scratch without human data or curricula. This achievement has been posed as a substantial challenge in artificial intelligence that requires exploring farsighted strategies from pixels and sparse rewards in an open world 3 . Our work allows solving challenging control problems without extensive experimentation, making reinforcement learning broadly applicable."} | 178 | {"work_id": 4409147637, "title": "Mastering diverse control tasks through world models", "abstract": "Abstract Developing a general algorithm that learns to solve tasks across a wide range of applications has been a fundamental challenge in artificial intelligence. Although current reinforcement-learning algorithms can be readily applied to tasks similar to what they have been developed for, configuring them for new application domains requires substantial human expertise and experimentation 1,2 . Here we present the third generation of Dreamer, a general algorithm that outperforms specialized methods across over 150 diverse tasks, with a single configuration. Dreamer learns a model of the environment and improves its behaviour by imagining future scenarios. Robustness techniques based on normalization, balancing and transformations enable stable learning across domains. Applied out of the box, Dreamer is, to our knowledge, the first algorithm to collect diamonds in Minecraft from scratch without human data or curricula. This achievement has been posed as a substantial challenge in artificial intelligence that requires exploring farsighted strategies from pixels and sparse rewards in an open world 3 . Our work allows solving challenging control problems without extensive experimentation, making reinforcement learning broadly applicable."} | ||
| 178 | {"work_id": 7119541039, "title": "On the foundations of Earth foundation models", "abstract": "Abstract Foundation models have enormous potential in advancing Earth sciences. However, current approaches may not be optimal, as they focus only on a few basic features of a desirable Earth foundation model. Crafting the ideal Earth foundation model, we define eleven features which would allow such a foundation model to be beneficial for any geoscientific downstream application in an environmental- and human-centric manner. We further shed light on the way forward to achieve the ideal model and to evaluate Earth foundation models. What comes after foundation models? Energy efficient adaptation, adversarial defenses, and interpretability are among the emerging directions."} | 179 | {"work_id": 7119541039, "title": "On the foundations of Earth foundation models", "abstract": "Abstract Foundation models have enormous potential in advancing Earth sciences. However, current approaches may not be optimal, as they focus only on a few basic features of a desirable Earth foundation model. Crafting the ideal Earth foundation model, we define eleven features which would allow such a foundation model to be beneficial for any geoscientific downstream application in an environmental- and human-centric manner. We further shed light on the way forward to achieve the ideal model and to evaluate Earth foundation models. What comes after foundation models? Energy efficient adaptation, adversarial defenses, and interpretability are among the emerging directions."} | ||
@@ -182,45 +183,43 @@ | |||||
| 182 | {"work_id": 7118190454, "title": "Redefining Elderly Care With Agentic AI: Challenges and Opportunities", "abstract": "The global ageing population necessitates new and emerging strategies for caring for older adults. In this article, we explore the potential for transformation in elderly care through Agentic Artificial Intelligence (AI), powered by Large Language Models (LLMs). We discuss how Agentic AI facilitates proactive, autonomous decision-making in elderly care. Personalized tracking of health, cognitive care, and environmental management, all aimed at enhancing independence and high-level living for older adults, represents important areas of application. With the potential to significantly transform elderly care, Agentic AI also raises profound concerns about data privacy and security, decision independence, and access. We share key insights to emphasize the need for ethical safeguards, privacy protections, and transparent decision-making. Our goal in this article is to provide a balanced discussion of both the potential and the challenges of Agentic AI, and to offer insights into its responsible use in elderly care, aligning it with the requirements and vulnerabilities specific to the elderly. Finally, we identify the priorities for the academic research communities to achieve human-centred advancements and integration of Agentic AI in elderly care. To the best of our knowledge, this is one of the first comprehensive studies explicitly focused on LLM-based Agentic AI for elderly care. Hence, we address the literature gap by analyzing the unique capabilities, applications, and limitations of LLM-based Agentic AI in elderly care."} | 183 | {"work_id": 7118190454, "title": "Redefining Elderly Care With Agentic AI: Challenges and Opportunities", "abstract": "The global ageing population necessitates new and emerging strategies for caring for older adults. In this article, we explore the potential for transformation in elderly care through Agentic Artificial Intelligence (AI), powered by Large Language Models (LLMs). We discuss how Agentic AI facilitates proactive, autonomous decision-making in elderly care. Personalized tracking of health, cognitive care, and environmental management, all aimed at enhancing independence and high-level living for older adults, represents important areas of application. With the potential to significantly transform elderly care, Agentic AI also raises profound concerns about data privacy and security, decision independence, and access. We share key insights to emphasize the need for ethical safeguards, privacy protections, and transparent decision-making. Our goal in this article is to provide a balanced discussion of both the potential and the challenges of Agentic AI, and to offer insights into its responsible use in elderly care, aligning it with the requirements and vulnerabilities specific to the elderly. Finally, we identify the priorities for the academic research communities to achieve human-centred advancements and integration of Agentic AI in elderly care. To the best of our knowledge, this is one of the first comprehensive studies explicitly focused on LLM-based Agentic AI for elderly care. Hence, we address the literature gap by analyzing the unique capabilities, applications, and limitations of LLM-based Agentic AI in elderly care."} | ||
| 183 | {"work_id": 4406643700, "title": "Towards the next generation of Geospatial Artificial Intelligence", "abstract": "Geospatial Artificial Intelligence (GeoAI), as the integration of geospatial studies and AI, has become one of the fastest-developing research directions in spatial data science and geography . This rapid change in the field calls for a deeper understanding of the recent developments and envision where the field is going in the near future. In this work, we provide a quantitative analysis of the GeoAI literature from the spatial, temporal, and semantic aspects. We briefly discuss the history of AI and GeoAI by highlighting some pioneering work. Then we discuss the current landscape of GeoAI by selecting five representative subdomains including remote sensing , urban computing, Earth system science , cartography , and geospatial semantics. Finally, we highlight several unique future research directions of GeoAI which are classified into two groups: GeoAI method development challenges and GeoAI Ethics challenges. Topics include heterogeneity-aware GeoAI, knowledge-guided GeoAI, spatial representation learning, geo-foundation models, fairness-aware GeoAI, privacy-aware GeoAI, as well as interpretable and explainable GeoAI. We hope our review of GeoAI\u2019s past, present, and future is comprehensive and can enlighten the next generation of GeoAI research."} | 184 | {"work_id": 4406643700, "title": "Towards the next generation of Geospatial Artificial Intelligence", "abstract": "Geospatial Artificial Intelligence (GeoAI), as the integration of geospatial studies and AI, has become one of the fastest-developing research directions in spatial data science and geography . This rapid change in the field calls for a deeper understanding of the recent developments and envision where the field is going in the near future. In this work, we provide a quantitative analysis of the GeoAI literature from the spatial, temporal, and semantic aspects. We briefly discuss the history of AI and GeoAI by highlighting some pioneering work. Then we discuss the current landscape of GeoAI by selecting five representative subdomains including remote sensing , urban computing, Earth system science , cartography , and geospatial semantics. Finally, we highlight several unique future research directions of GeoAI which are classified into two groups: GeoAI method development challenges and GeoAI Ethics challenges. Topics include heterogeneity-aware GeoAI, knowledge-guided GeoAI, spatial representation learning, geo-foundation models, fairness-aware GeoAI, privacy-aware GeoAI, as well as interpretable and explainable GeoAI. We hope our review of GeoAI\u2019s past, present, and future is comprehensive and can enlighten the next generation of GeoAI research."} | ||
| 184 | {"work_id": 7118170538, "title": "Applications of Artificial Intelligence in Fisheries: From Data to Decisions", "abstract": "AI enhances aquatic resource management by automating species detection, optimizing feed, forecasting water quality, protecting species interactions, and strengthening the detection of illegal, unreported, and unregulated fishing activities. However, these advancements are inconsistently employed, subject to domain shifts, limited by the availability of labeled data, and poorly benchmarked across operational contexts. Recent developments in technology and applications in fisheries genetics and monitoring, precision aquaculture, management, and sensing infrastructure are summarized in this paper. We studied automated species recognition, genomic trait inference, environmental DNA metabarcoding, acoustic analysis, and trait-based population modeling in fisheries genetics and monitoring. We used digital-twin frameworks for supervised learning in feed optimization, reinforcement learning for water quality control, vision-based welfare monitoring, and harvest forecasting in aquaculture. We explored automatic identification system trajectory analysis for illicit fishing detection, global effort mapping, electronic bycatch monitoring, protected species tracking, and multi-sensor vessel surveillance in fisheries management. Acoustic echogram automation, convolutional neural network-based fish detection, edge-computing architectures, and marine-domain foundation models are foundational developments in sensing infrastructure. Implementation challenges include performance degradation across habitat and seasonal transitions, insufficient standardized multi-region datasets for rare and protected taxa, inadequate incorporation of model uncertainty into management decisions, and structural inequalities in data access and technology adoption among smallholder producers. Standardized multi-region benchmarks with rare-taxa coverage, calibrated uncertainty quantification in assessment and control systems, domain-robust energy-efficient algorithms, and privacy-preserving data partnerships are our priorities. These integrated priorities enable transition from experimental prototypes to a reliable, collaborative infrastructure for sustainable wild capture and farmed aquatic systems."} | 185 | {"work_id": 7118170538, "title": "Applications of Artificial Intelligence in Fisheries: From Data to Decisions", "abstract": "AI enhances aquatic resource management by automating species detection, optimizing feed, forecasting water quality, protecting species interactions, and strengthening the detection of illegal, unreported, and unregulated fishing activities. However, these advancements are inconsistently employed, subject to domain shifts, limited by the availability of labeled data, and poorly benchmarked across operational contexts. Recent developments in technology and applications in fisheries genetics and monitoring, precision aquaculture, management, and sensing infrastructure are summarized in this paper. We studied automated species recognition, genomic trait inference, environmental DNA metabarcoding, acoustic analysis, and trait-based population modeling in fisheries genetics and monitoring. We used digital-twin frameworks for supervised learning in feed optimization, reinforcement learning for water quality control, vision-based welfare monitoring, and harvest forecasting in aquaculture. We explored automatic identification system trajectory analysis for illicit fishing detection, global effort mapping, electronic bycatch monitoring, protected species tracking, and multi-sensor vessel surveillance in fisheries management. Acoustic echogram automation, convolutional neural network-based fish detection, edge-computing architectures, and marine-domain foundation models are foundational developments in sensing infrastructure. Implementation challenges include performance degradation across habitat and seasonal transitions, insufficient standardized multi-region datasets for rare and protected taxa, inadequate incorporation of model uncertainty into management decisions, and structural inequalities in data access and technology adoption among smallholder producers. Standardized multi-region benchmarks with rare-taxa coverage, calibrated uncertainty quantification in assessment and control systems, domain-robust energy-efficient algorithms, and privacy-preserving data partnerships are our priorities. These integrated priorities enable transition from experimental prototypes to a reliable, collaborative infrastructure for sustainable wild capture and farmed aquatic systems."} | ||
| 186 | +{"work_id": 3157286395, "title": "A Realization-Theoretic Foundation for Fault Diagnosis, with Diagnosability Equivalence Predictions", "abstract": "Fault diagnosis encompasses a wide range of paradigms, including observer-based fault detection and isolation, consistency-based diagnosis, Bayesian diagnosis, geometric diagnosis, and structured machine-learning approaches. Despite their shared objective, these paradigms are formulated in different mathematical languages and are rarely analyzed within a common framework. This paper introduces a realization-theoretic foundation for diagnosis based on the Diagnostic System Specification (DSS), a representation that separates behavioural models, realizations, measurement fields, and inference procedures. We define diagnostic invariants as symmetry-preserving quantities of realized system structures and show that detectability is fundamentally an orbit separation property in the realization\u2019s symmetry space. Building on this observation, we develop a theory of realizations in which diagnostic models appear as objects equipped with invariant families and nominal symmetry groups. We show that diagnostic paradigms differ not in their underlying architecture but in the realizations they induce and the invariants they expose. Our main result addresses the question: is there a single mathematical condition of which diagnosis approaches are equivalent in terms of diagnosability? We show that using orbit separation on a paradigm-appropriate realization shows the following: faults are distinguishable iff they lie in different orbits of the realization\u2019s nominal symmetry group. We accomplish this by constructing a minimal sufficient realization associated with a measurement field and characterize it by a universal property. This yields a structural notion of diagnostic equivalence and provides a principled basis for comparing methods across traditionally separate paradigms."} | ||||
| 185 | {"work_id": 7128600296, "title": "Advancing healthcare AI governance through a comprehensive maturity model based on systematic review", "abstract": "Artificial Intelligence (AI) deployment in healthcare is accelerating, yet governance frameworks remain fragmented and often assume extensive resources. Through a systematic review of 35 frameworks for AI implementation in healthcare (published 2019-2024), we identified seven critical domains of healthcare AI governance. While existing frameworks provide valuable guidance, the resource requirements create barriers for smaller healthcare organizations. To address this gap, we organized key findings from the review to create the Healthcare AI Governance Readiness Assessment (HAIRA), a five-level maturity model that provides actionable governance pathways based on organizational resources. HAIRA spans from Level 1 (Initial/Ad Hoc) to Level 5 (Leading), with specific benchmarks across all seven governance domains. This tiered approach enables healthcare organizations to assess their current AI governance capabilities and establish appropriate advancement targets. Our framework addresses a critical need for adaptive governance strategies that ensure that AI implementation delivers tangible benefits to systems of varying resource levels."} | 187 | {"work_id": 7128600296, "title": "Advancing healthcare AI governance through a comprehensive maturity model based on systematic review", "abstract": "Artificial Intelligence (AI) deployment in healthcare is accelerating, yet governance frameworks remain fragmented and often assume extensive resources. Through a systematic review of 35 frameworks for AI implementation in healthcare (published 2019-2024), we identified seven critical domains of healthcare AI governance. While existing frameworks provide valuable guidance, the resource requirements create barriers for smaller healthcare organizations. To address this gap, we organized key findings from the review to create the Healthcare AI Governance Readiness Assessment (HAIRA), a five-level maturity model that provides actionable governance pathways based on organizational resources. HAIRA spans from Level 1 (Initial/Ad Hoc) to Level 5 (Leading), with specific benchmarks across all seven governance domains. This tiered approach enables healthcare organizations to assess their current AI governance capabilities and establish appropriate advancement targets. Our framework addresses a critical need for adaptive governance strategies that ensure that AI implementation delivers tangible benefits to systems of varying resource levels."} | ||
| 186 | {"work_id": 4406063062, "title": "Responsible artificial intelligence governance: A review and research framework", "abstract": "\u2022 Synthesizes empirical studies on responsible AI and the underlying principles. \u2022 Differentiates between principles and governance of AI in a responsible way. \u2022 Analyzes through a critical lens existing studies and uncovers underlying assumptions. \u2022 Defines the notion of responsible AI governance based on the synthesis and critical reflection. \u2022 Develops a research agenda and identifies important areas for future research within the IS domain. The widespread and rapid diffusion of artificial intelligence (AI) into all types of organizational activities necessitates the ethical and responsible deployment of these technologies. Various national and international policies, regulations, and guidelines aim to address this issue, and several organizations have developed frameworks detailing the principles of responsible AI. Nevertheless, the understanding of how such principles can be operationalized in designing, executing, monitoring, and evaluating AI applications is limited. The literature is disparate and lacks cohesion, clarity, and, in some cases, depth. Subsequently, this scoping review aims to synthesize and critically reflect on the research on responsible AI. Based on this synthesis, we developed a conceptual framework for responsible AI governance (defined through structural, relational, and procedural practices), its antecedents, and its effects. The framework serves as the foundation for developing an agenda for future research and critically reflects on the notion of responsible AI governance."} | 188 | {"work_id": 4406063062, "title": "Responsible artificial intelligence governance: A review and research framework", "abstract": "\u2022 Synthesizes empirical studies on responsible AI and the underlying principles. \u2022 Differentiates between principles and governance of AI in a responsible way. \u2022 Analyzes through a critical lens existing studies and uncovers underlying assumptions. \u2022 Defines the notion of responsible AI governance based on the synthesis and critical reflection. \u2022 Develops a research agenda and identifies important areas for future research within the IS domain. The widespread and rapid diffusion of artificial intelligence (AI) into all types of organizational activities necessitates the ethical and responsible deployment of these technologies. Various national and international policies, regulations, and guidelines aim to address this issue, and several organizations have developed frameworks detailing the principles of responsible AI. Nevertheless, the understanding of how such principles can be operationalized in designing, executing, monitoring, and evaluating AI applications is limited. The literature is disparate and lacks cohesion, clarity, and, in some cases, depth. Subsequently, this scoping review aims to synthesize and critically reflect on the research on responsible AI. Based on this synthesis, we developed a conceptual framework for responsible AI governance (defined through structural, relational, and procedural practices), its antecedents, and its effects. The framework serves as the foundation for developing an agenda for future research and critically reflects on the notion of responsible AI governance."} | ||
| 187 | {"work_id": 7128782475, "title": "Large language models provide unsafe answers to patient-posed medical questions", "abstract": "Millions of patients are regularly using large language model (LLM) chatbots for medical advice, raising patient safety concerns. This physician-led red-teaming study compares the safety of four publicly available chatbots-Claude by Anthropic, Gemini by Google, GPT-4o by OpenAI, and Llama-3.0/3.1-70B by Meta-on a new dataset, HealthAdvice, using an evaluation framework that enables quantitative and qualitative analysis. In total, 888 chatbot responses are evaluated for 222 patient-posed advice-seeking medical questions on primary care topics spanning internal medicine, women's health, and pediatrics. We find statistically significant differences between chatbots. The rate of problematic responses varies from 21.6% (Claude) to 43.2% (Llama), with unsafe responses varying from 5% (Claude) to 13% (GPT-4o, Llama). Qualitative results reveal chatbot responses with the potential to lead to serious patient harm. This study suggests that millions of patients could be receiving unsafe medical advice from publicly available chatbots, and further work is needed to improve the clinical safety of these powerful tools."} | 189 | {"work_id": 7128782475, "title": "Large language models provide unsafe answers to patient-posed medical questions", "abstract": "Millions of patients are regularly using large language model (LLM) chatbots for medical advice, raising patient safety concerns. This physician-led red-teaming study compares the safety of four publicly available chatbots-Claude by Anthropic, Gemini by Google, GPT-4o by OpenAI, and Llama-3.0/3.1-70B by Meta-on a new dataset, HealthAdvice, using an evaluation framework that enables quantitative and qualitative analysis. In total, 888 chatbot responses are evaluated for 222 patient-posed advice-seeking medical questions on primary care topics spanning internal medicine, women's health, and pediatrics. We find statistically significant differences between chatbots. The rate of problematic responses varies from 21.6% (Claude) to 43.2% (Llama), with unsafe responses varying from 5% (Claude) to 13% (GPT-4o, Llama). Qualitative results reveal chatbot responses with the potential to lead to serious patient harm. This study suggests that millions of patients could be receiving unsafe medical advice from publicly available chatbots, and further work is needed to improve the clinical safety of these powerful tools."} | ||
| 188 | {"work_id": 2963808661, "title": "Scaling of End-To-End Governance Risk Assessments for AI Systems (Practitioner Track)", "abstract": "Artificial Intelligence (AI) systems are embedded in a multifaceted environment characterized by intricate technical, legal, and organizational frameworks. To attain a comprehensive understanding of all AI-related risks, it is essential to evaluate both model-specific risks and those associated with the organizational and governance setups. We categorize these as \"bottom-up risks\" and \"top-down risks,\" respectively. In this paper, we focus on the expansion and enhancement of a testing and auditing technology stack to identify and manage governance-related risks (\"top-down\"). These risks emerge from various dimensions, including internal development and decision-making processes, leadership structures, security setups, documentation practices, and more. For auditing governance related risk, we implement a traditional risk management framework and map it to the specifics of AI systems. Our end-to-end (from identification to monitoring) risk management kernel follows these implementation steps: - Identify - Collect - Assess - Comply - Monitor We demonstrate that scaling of such a risk auditing tool requires fundamental aspects. Those aspects include for instance a role-based approach, covering different roles in the development of complex AI systems. Ensuring compliance and secure record-keeping through audit-proof capabilities is also paramount. This ensures that the auditing technology can withstand scrutiny and maintain the integrity of records over time. Another critical aspect is the integrability of the auditing tool within existing risk management and governance infrastructures. This integration is essential to reduce the barriers for companies to comply with current regulatory requirements, such as the EU AI Act [European Parliament and the Council of the EU, 2024], and established standards like ISO 42001:2023. Ultimately, we demonstrate that this approach provides a robust technology stack for ensuring that AI systems are developed, utilized and supervised in a manner that is both compliant with regulatory standards and aligned with best practices in risk management and governance."} | 190 | {"work_id": 2963808661, "title": "Scaling of End-To-End Governance Risk Assessments for AI Systems (Practitioner Track)", "abstract": "Artificial Intelligence (AI) systems are embedded in a multifaceted environment characterized by intricate technical, legal, and organizational frameworks. To attain a comprehensive understanding of all AI-related risks, it is essential to evaluate both model-specific risks and those associated with the organizational and governance setups. We categorize these as \"bottom-up risks\" and \"top-down risks,\" respectively. In this paper, we focus on the expansion and enhancement of a testing and auditing technology stack to identify and manage governance-related risks (\"top-down\"). These risks emerge from various dimensions, including internal development and decision-making processes, leadership structures, security setups, documentation practices, and more. For auditing governance related risk, we implement a traditional risk management framework and map it to the specifics of AI systems. Our end-to-end (from identification to monitoring) risk management kernel follows these implementation steps: - Identify - Collect - Assess - Comply - Monitor We demonstrate that scaling of such a risk auditing tool requires fundamental aspects. Those aspects include for instance a role-based approach, covering different roles in the development of complex AI systems. Ensuring compliance and secure record-keeping through audit-proof capabilities is also paramount. This ensures that the auditing technology can withstand scrutiny and maintain the integrity of records over time. Another critical aspect is the integrability of the auditing tool within existing risk management and governance infrastructures. This integration is essential to reduce the barriers for companies to comply with current regulatory requirements, such as the EU AI Act [European Parliament and the Council of the EU, 2024], and established standards like ISO 42001:2023. Ultimately, we demonstrate that this approach provides a robust technology stack for ensuring that AI systems are developed, utilized and supervised in a manner that is both compliant with regulatory standards and aligned with best practices in risk management and governance."} | ||
| 189 | {"work_id": 4330336443, "title": "GPTs are GPTs: An Early Look at the Labor Market Impact Potential of Large Language Models", "abstract": "Public estimates of AI\u2019s labor-market exposure typically come from one of two sources: a theoretical judgment about what a model could do, or a record of what people have actually asked it to do. This paper tests whether the second source has a specific, measurable blind spot \u2013 that usage-based exposure measures understate AI\u2019s capability for occupations whose tasks have not yet entered common chat usage \u2013 using an independently constructed, task-decomposition- based capability judgment, the TRIPS Framework by Trust Insights (which scores individual job tasks for AI suitability), compared directly against Anthropic\u2019s published Economic Index data. Across 434 O*NET-SOC occupations, TRIPS\u2019s coverage share \u2013 the estimated share of a job\u2019s tasks current AI can complete independently \u2013 correlates strongly with Eloundou et al.\u2019s (2023) capability rating (Spearman\u2019s rho = 0.747), a concordance an independent human- rated column from the same source closely reproduces. Restricted to the 286 occupations where Anthropic\u2019s usage-volume data exists, TRIPS still correlates strongly with Eloundou et al.\u2019s rating (rho = 0.718) but only weakly with Anthropic\u2019s actual usage volume (rho = 0.254): two independently built capability judgments track each other far more closely than either tracks real usage, and both correlations survive a Monte Carlo check simulating realistic classifier label noise. This is directionally consistent with a usage-gating mechanism, corroborated by Anthropic\u2019s own report naming occupations that register zero measured exposure purely for lack of chat traffic \u2013 though it cannot, on cross-sectional evidence alone, be distinguished from a slower adoption-lag explanation. Category-level coverage varies substantially (9.4 to 81.7 percent across 22 SOC major groups), supporting neither the claim that any category is immune to AI nor that any nears full automation. We report these findings as directionally consistent and noise-surviving, not confirmed, with construct, sampling, and classification-accuracy limitations detailed throughout."} | 191 | {"work_id": 4330336443, "title": "GPTs are GPTs: An Early Look at the Labor Market Impact Potential of Large Language Models", "abstract": "Public estimates of AI\u2019s labor-market exposure typically come from one of two sources: a theoretical judgment about what a model could do, or a record of what people have actually asked it to do. This paper tests whether the second source has a specific, measurable blind spot \u2013 that usage-based exposure measures understate AI\u2019s capability for occupations whose tasks have not yet entered common chat usage \u2013 using an independently constructed, task-decomposition- based capability judgment, the TRIPS Framework by Trust Insights (which scores individual job tasks for AI suitability), compared directly against Anthropic\u2019s published Economic Index data. Across 434 O*NET-SOC occupations, TRIPS\u2019s coverage share \u2013 the estimated share of a job\u2019s tasks current AI can complete independently \u2013 correlates strongly with Eloundou et al.\u2019s (2023) capability rating (Spearman\u2019s rho = 0.747), a concordance an independent human- rated column from the same source closely reproduces. Restricted to the 286 occupations where Anthropic\u2019s usage-volume data exists, TRIPS still correlates strongly with Eloundou et al.\u2019s rating (rho = 0.718) but only weakly with Anthropic\u2019s actual usage volume (rho = 0.254): two independently built capability judgments track each other far more closely than either tracks real usage, and both correlations survive a Monte Carlo check simulating realistic classifier label noise. This is directionally consistent with a usage-gating mechanism, corroborated by Anthropic\u2019s own report naming occupations that register zero measured exposure purely for lack of chat traffic \u2013 though it cannot, on cross-sectional evidence alone, be distinguished from a slower adoption-lag explanation. Category-level coverage varies substantially (9.4 to 81.7 percent across 22 SOC major groups), supporting neither the claim that any category is immune to AI nor that any nears full automation. We report these findings as directionally consistent and noise-surviving, not confirmed, with construct, sampling, and classification-accuracy limitations detailed throughout."} | ||
| 190 | −{"work_id": 4411542009, "title": "Expressing stigma and inappropriate responses prevents LLMs from safely replacing mental health providers.", "abstract": "Should a large language model (LLM) be used as a therapist? In this paper, we investigate the use of LLMs to *replace* mental health providers, a use case promoted in the tech startup and research space. We conduct a mapping review of therapy guides used by major medical institutions to identify crucial aspects of therapeutic relationships, such as the importance of a therapeutic alliance between therapist and client. We then assess the ability of LLMs to reproduce and adhere to these aspects of therapeutic relationships by conducting several experiments investigating the responses of current LLMs, such as `gpt-4o`. Contrary to best practices in the medical community, LLMs 1) express stigma toward those with mental health conditions and 2) respond inappropriately to certain common (and critical) conditions in naturalistic therapy settings -- e.g., LLMs encourage clients' delusional thinking, likely due to their sycophancy. This occurs even with larger and newer LLMs, indicating that current safety practices may not address these gaps. Furthermore, we note foundational and practical barriers to the adoption of LLMs as therapists, such as that a therapeutic alliance requires human characteristics (e.g., identity and stakes). For these reasons, we conclude that LLMs should not replace therapists, and we discuss alternative roles for LLMs in clinical therapy."} | ||||
| 191 | {"work_id": 4225355126, "title": "Introduction to Multi-agent Systems", "abstract": null} | 192 | {"work_id": 4225355126, "title": "Introduction to Multi-agent Systems", "abstract": null} | ||
| 192 | {"work_id": 2982316857, "title": "Grandmaster level in StarCraft II using multi-agent reinforcement learning", "abstract": null} | 193 | {"work_id": 2982316857, "title": "Grandmaster level in StarCraft II using multi-agent reinforcement learning", "abstract": null} | ||
| 193 | {"work_id": 4319083882, "title": "ChatGPT: five priorities for research", "abstract": null} | 194 | {"work_id": 4319083882, "title": "ChatGPT: five priorities for research", "abstract": null} | ||
| 194 | −{"work_id": 4396952261, "title": "Multimodal Deep Learning", "abstract": null} | ||||
| 195 | {"work_id": 4412709685, "title": "The Virtual Lab of AI agents designs new SARS-CoV-2 nanobodies", "abstract": null} | 195 | {"work_id": 4412709685, "title": "The Virtual Lab of AI agents designs new SARS-CoV-2 nanobodies", "abstract": null} | ||
| 196 | {"work_id": 4401397240, "title": "A generalist vision\u2013language foundation model for diverse biomedical tasks", "abstract": null} | 196 | {"work_id": 4401397240, "title": "A generalist vision\u2013language foundation model for diverse biomedical tasks", "abstract": null} | ||
| 197 | +{"work_id": 2885195348, "title": "Fundamentals of Recurrent Neural Network (RNN) and Long Short-Term Memory (LSTM) network", "abstract": null} | ||||
| 197 | {"work_id": 4395957952, "title": "Guidance for generative AI in education and research", "abstract": null} | 198 | {"work_id": 4395957952, "title": "Guidance for generative AI in education and research", "abstract": null} | ||
| 198 | {"work_id": 3208688400, "title": "Anomaly Detection: A Survey", "abstract": null} | 199 | {"work_id": 3208688400, "title": "Anomaly Detection: A Survey", "abstract": null} | ||
| 199 | {"work_id": 4406472599, "title": "Learning from models beyond fine-tuning", "abstract": null} | 200 | {"work_id": 4406472599, "title": "Learning from models beyond fine-tuning", "abstract": null} | ||
| 200 | {"work_id": 2892035503, "title": "Deep learning for time series classification: a review", "abstract": null} | 201 | {"work_id": 2892035503, "title": "Deep learning for time series classification: a review", "abstract": null} | ||
| 201 | {"work_id": 4394863715, "title": "How Generative AI Can Augment Human Creativity", "abstract": null} | 202 | {"work_id": 4394863715, "title": "How Generative AI Can Augment Human Creativity", "abstract": null} | ||
| 202 | {"work_id": 2991046523, "title": "Multi-Agent Reinforcement Learning: A Selective Overview of Theories and Algorithms", "abstract": null} | 203 | {"work_id": 2991046523, "title": "Multi-Agent Reinforcement Learning: A Selective Overview of Theories and Algorithms", "abstract": null} | ||
| 203 | −{"work_id": 3145506661, "title": "Introduction to Machine Learning", "abstract": null} | ||||
| 204 | {"work_id": 2945976633, "title": "Stop explaining black box machine learning models for high stakes decisions and use interpretable models instead", "abstract": null} | 204 | {"work_id": 2945976633, "title": "Stop explaining black box machine learning models for high stakes decisions and use interpretable models instead", "abstract": null} | ||
| 205 | +{"work_id": 3123554940, "title": "Pattern Recognition and Machine Learning", "abstract": null} | ||||
| 205 | {"work_id": 7148890333, "title": "Spatial-channel collaborative multi-scale graph interaction deep transfer learning for unsupervised rotating machinery fault diagnosis", "abstract": null} | 206 | {"work_id": 7148890333, "title": "Spatial-channel collaborative multi-scale graph interaction deep transfer learning for unsupervised rotating machinery fault diagnosis", "abstract": null} | ||
| 206 | −{"work_id": 4285723986, "title": "Graph Attention Networks", "abstract": null} | ||||
| 207 | {"work_id": 4392947532, "title": "A visual-language foundation model for computational pathology", "abstract": null} | 207 | {"work_id": 4392947532, "title": "A visual-language foundation model for computational pathology", "abstract": null} | ||
| 208 | {"work_id": 7118631510, "title": "Towards trustworthy AI in Industry 5.0: Ante-hoc interpretability with deep learning", "abstract": null} | 208 | {"work_id": 7118631510, "title": "Towards trustworthy AI in Industry 5.0: Ante-hoc interpretability with deep learning", "abstract": null} | ||
| 209 | +{"work_id": 4398159307, "title": "Wav-KAN: Wavelet Kolmogorov-Arnold Networks", "abstract": null} | ||||
| 209 | {"work_id": 4392947521, "title": "Towards a general-purpose foundation model for computational pathology", "abstract": null} | 210 | {"work_id": 4392947521, "title": "Towards a general-purpose foundation model for computational pathology", "abstract": null} | ||
| 210 | {"work_id": 7162257503, "title": "Predefined-time sliding-mode formation control for second-order nonlinear multi-agent systems under deception attacks", "abstract": null} | 211 | {"work_id": 7162257503, "title": "Predefined-time sliding-mode formation control for second-order nonlinear multi-agent systems under deception attacks", "abstract": null} | ||
| 211 | {"work_id": 3135028703, "title": "Machine Learning: Algorithms, Real-World Applications and Research Directions", "abstract": null} | 212 | {"work_id": 3135028703, "title": "Machine Learning: Algorithms, Real-World Applications and Research Directions", "abstract": null} | ||
| 212 | −{"work_id": 2911283634, "title": "10. Reinforcement learning", "abstract": null} | ||||
| 213 | {"work_id": 3105488314, "title": "Risk bounds for statistical learning", "abstract": null} | 213 | {"work_id": 3105488314, "title": "Risk bounds for statistical learning", "abstract": null} | ||
| 214 | {"work_id": 2999615587, "title": "From local explanations to global understanding with explainable AI for trees", "abstract": null} | 214 | {"work_id": 2999615587, "title": "From local explanations to global understanding with explainable AI for trees", "abstract": null} | ||
| 215 | {"work_id": 4313564799, "title": "ChatGPT User Experience: Implications for Education", "abstract": null} | 215 | {"work_id": 4313564799, "title": "ChatGPT User Experience: Implications for Education", "abstract": null} | ||
| 216 | {"work_id": 4400770292, "title": "Generative AI Can Harm Learning", "abstract": null} | 216 | {"work_id": 4400770292, "title": "Generative AI Can Harm Learning", "abstract": null} | ||
| 217 | {"work_id": 4385223296, "title": "Open AI in Education, the Responsible and Ethical Use of ChatGPT Towards Lifelong Learning", "abstract": null} | 217 | {"work_id": 4385223296, "title": "Open AI in Education, the Responsible and Ethical Use of ChatGPT Towards Lifelong Learning", "abstract": null} | ||
| 218 | −{"work_id": 7165561001, "title": "M3-HGMA: A Multi-modal, Multi-agent Hierarchical Graph-Mamba Architecture for Explainable and Adaptive Clinical Intelligence", "abstract": null} | ||||
| 219 | {"work_id": 7133481537, "title": "Filter-based predefined-time optimal fault-tolerant consensus control for nonlinear multi-agent systems via reinforcement learning", "abstract": null} | 218 | {"work_id": 7133481537, "title": "Filter-based predefined-time optimal fault-tolerant consensus control for nonlinear multi-agent systems via reinforcement learning", "abstract": null} | ||
| 219 | +{"work_id": 2593744649, "title": "Evolving Deep Neural Networks", "abstract": null} | ||||
| 220 | {"work_id": 2670253439, "title": "Explanation in artificial intelligence: Insights from the social sciences", "abstract": null} | 220 | {"work_id": 2670253439, "title": "Explanation in artificial intelligence: Insights from the social sciences", "abstract": null} | ||
| 221 | {"work_id": 4402220065, "title": "A pathology foundation model for cancer diagnosis and prognosis prediction", "abstract": null} | 221 | {"work_id": 4402220065, "title": "A pathology foundation model for cancer diagnosis and prognosis prediction", "abstract": null} | ||
| 222 | {"work_id": 7155930820, "title": "Adaptive Prescribed Performance Secure Consensus Control for High-Order Constrained Multi-Agent Systems With Time-Varying Powers and Arbitrary Initial States", "abstract": null} | 222 | {"work_id": 7155930820, "title": "Adaptive Prescribed Performance Secure Consensus Control for High-Order Constrained Multi-Agent Systems With Time-Varying Powers and Arbitrary Initial States", "abstract": null} | ||
| 223 | −{"work_id": 7127143535, "title": "Industrial information integration through autonomous AI agents: paradoxical effects on transparency, dehumanization, and responsible retail operations", "abstract": null} | ||||
| 224 | {"work_id": 7133250524, "title": "LAION-5B: An Open Large-Scale Dataset for Training Next Generation Image-Text Models", "abstract": null} | 223 | {"work_id": 7133250524, "title": "LAION-5B: An Open Large-Scale Dataset for Training Next Generation Image-Text Models", "abstract": null} | ||
| 225 | {"work_id": 7133220561, "title": "InstructBLIP: Towards General-purpose Vision-Language Models with Instruction Tuning", "abstract": null} | 224 | {"work_id": 7133220561, "title": "InstructBLIP: Towards General-purpose Vision-Language Models with Instruction Tuning", "abstract": null} | ||
| 226 | {"work_id": 7133185348, "title": "Photorealistic Text-To-Image Diffusion Models with Deep Language Understanding", "abstract": null} | 225 | {"work_id": 7133185348, "title": "Photorealistic Text-To-Image Diffusion Models with Deep Language Understanding", "abstract": null} | ||
modified
literature_synthesis/landmarks/ai_ml_landmarks.csv
+234 −235
@@ -1,235 +1,234 @@ | |||||
| 1 | −work_id,doi,arxiv_id,title,source_name,year,type,primary_category,n_categories,c12,c36,ncs36,cited_by_count,fwci,has_abstract,is_oa,period,score,set,pi_review | 1 | +work_id,doi,arxiv_id,title,source_name,year,type,primary_category,n_categories,c12,c36,ncs36,cited_by_count,fwci,has_abstract,is_oa,period,ntitle,score,set,pi_review | ||
| 2 | −7172491899,10.26555/ijain.v12i2.2360,2005.11401,Toward effective Text-to-MongoDB query translation,International Journal of Advances in Intelligent Informatics,2026,article,llm,6,3026.0,3026.0,3367.337435490274,0,0.0,True,True,baseline,10758.097473034562,landmark,True | 2 | +7172491899,10.26555/ijain.v12i2.2360,2005.11401,Toward effective Text-to-MongoDB query translation,International Journal of Advances in Intelligent Informatics,2026,article,llm,6,3026.0,3026.0,3367.337435490274,0,0.0,True,True,baseline,towardeffectivetexttomongodbquerytranslation,7672.333467289645,landmark,True | ||
| 3 | −7154011589,10.55905/rdelosv19.n79-020,2005.14165,Modelos pré-treinados de LLM e questões éticas face aos direitos autorais,DELOS Desarrollo Local Sostenible,2026,article,llm,3,2847.0,2847.0,3168.1459612824883,0,0.0,True,True,baseline,10121.712989335558,landmark,True | 3 | +7154011589,10.55905/rdelosv19.n79-020,2005.14165,Modelos pré-treinados de LLM e questões éticas face aos direitos autorais,DELOS Desarrollo Local Sostenible,2026,article,llm,3,2847.0,2847.0,3168.1459612824883,0,0.0,True,True,baseline,modelosprtreinadosdellmequestesticasfaceaosdireitosautorais,7218.484263507476,landmark,True | ||
| 4 | −4362515116,10.1007/s11704-026-60308-3,2303.18223,A Survey of Large Language Models,Frontiers of Computer Science,2026,article,llm,6,1549.0,1549.0,1723.7295728930715,1549,964.5692,True,True,post,5507.0366773729465,landmark,True | 4 | +4362515116,10.1007/s11704-026-60308-3,2303.18223,A Survey of Large Language Models,Frontiers of Computer Science,2026,article,llm,6,1549.0,1549.0,1723.7295728930715,1549,964.5692,True,True,post,asurveyoflargelanguagemodels,3927.4436684836946,landmark,True | ||
| 5 | −4288253152,10.5281/zenodo.12935200,,Multilingual Classifier for Automatic Dewey Decimal Classification trained on Open Access Linguistics Abstracts,Repositorio Institucional UPTC,2024,dissertation,llm,3,286.0,364.0,3102.1223140495867,364,,True,True,post,3102.1223140495867,landmark,True | 5 | +4288253152,10.5281/zenodo.12935200,,Multilingual Classifier for Automatic Dewey Decimal Classification trained on Open Access Linguistics Abstracts,Repositorio Institucional UPTC,2024,dissertation,llm,3,286.0,364.0,3102.1223140495867,364,,True,True,post,multilingualclassifierforautomaticdeweydecimalclassificationtrainedonopenaccesslinguisticsabstracts,3102.1223140495867,landmark,True | ||
| 6 | −4322718191,10.48550/arxiv.2302.13971,2302.13971,LLaMA: Open and Efficient Foundation Language Models,arXiv (Cornell University),2023,preprint,llm,4,2565.0,3629.0,1206.5430511141133,3837,,True,True,post,1206.5430511141133,landmark,True | 6 | +4322718191,10.48550/arxiv.2302.13971,2302.13971,LLaMA: Open and Efficient Foundation Language Models,arXiv (Cornell University),2023,preprint,llm,4,2565.0,3629.0,1206.5430511141133,3837,,True,True,post,llamaopenandefficientfoundationlanguagemodels,1206.5430511141133,landmark,True | ||
| 7 | −4323655724,10.1016/j.lindif.2023.102274,,ChatGPT for good? On opportunities and challenges of large language models for education,Learning and Individual Differences,2023,article,llm,1,2213.0,4227.0,990.7064044933976,7222,1695.9108,True,True,post,990.7064044933976,landmark,True | 7 | +4323655724,10.1016/j.lindif.2023.102274,,ChatGPT for good? On opportunities and challenges of large language models for education,Learning and Individual Differences,2023,article,llm,1,2213.0,4227.0,990.7064044933976,7222,1695.9108,True,True,post,chatgptforgoodonopportunitiesandchallengesoflargelanguagemodelsforeducation,990.7064044933976,landmark,True | ||
| 8 | −4367369313,10.18260/jet.43.1.5,,"Prompt Engineering for ChatGPT: A Quick Guide to Techniques, Tips, and Best Practices",ASEE Journal of Engineering Technology,2026,article,llm,2,261.0,261.0,290.4411998225253,261,187.8562,True,True,post,927.9125712035759,landmark,True | 8 | +4226278401,10.48550/arxiv.2203.02155,2203.02155,Discernment and Social Learning as a Companion Training Layer,arXiv (Cornell University),2022,preprint,llm,5,1547.0,3077.0,894.2065022118338,4202,,True,True,baseline,discernmentandsociallearningasacompaniontraininglayer,894.2065022118338,landmark,True | ||
| 9 | −4226278401,10.48550/arxiv.2203.02155,2203.02155,Discernment and Social Learning as a Companion Training Layer,arXiv (Cornell University),2022,preprint,llm,5,1547.0,3077.0,894.2065022118338,4202,,True,True,baseline,894.2065022118338,landmark,True | 9 | +4396531244,10.22215/etd/2024-15938,,The Fusion of Multilingual Semantic Search and Large Language Models: A New Paradigm for Enhanced Topic Exploration and Contextual Search,,2024,dissertation,llm,6,20.0,20.0,778.8148148148148,20,,True,True,post,thefusionofmultilingualsemanticsearchandlargelanguagemodelsanewparadigmforenhancedtopicexplorationandcontextualsearch,778.8148148148148,landmark,True | ||
| 10 | −4396531244,10.22215/etd/2024-15938,,The Fusion of Multilingual Semantic Search and Large Language Models: A New Paradigm for Enhanced Topic Exploration and Contextual Search,,2024,dissertation,llm,6,20.0,20.0,778.8148148148148,20,,True,True,post,778.8148148148148,landmark,True | 10 | +4221143046,10.48550/arxiv.2201.11903,2201.11903,"BNAI, NO-TOKEN, and MIND-UNITY: Pillars of a Systemic Revolution in Artificial Intelligence",arXiv (Cornell University),2022,preprint,llm,3,962.0,2465.0,716.353275252574,4203,,True,True,baseline,bnainotokenandmindunitypillarsofasystemicrevolutioninartificialintelligence,716.353275252574,landmark,True | ||
| 11 | −4221143046,10.48550/arxiv.2201.11903,2201.11903,"BNAI, NO-TOKEN, and MIND-UNITY: Pillars of a Systemic Revolution in Artificial Intelligence",arXiv (Cornell University),2022,preprint,llm,3,962.0,2465.0,716.353275252574,4203,,True,True,baseline,716.353275252574,landmark,True | 11 | +4367369313,10.18260/jet.43.1.5,,"Prompt Engineering for ChatGPT: A Quick Guide to Techniques, Tips, and Best Practices",ASEE Journal of Engineering Technology,2026,article,llm,2,261.0,261.0,290.4411998225253,261,187.8562,True,True,post,promptengineeringforchatgptaquickguidetotechniquestipsandbestpractices,661.7577775818233,landmark,True | ||
| 12 | −4327810158,10.4230/lipics.cosit.2024.11,2303.08774,GPT-4 Technical Report,arXiv (Cornell University),2023,preprint,llm,3,1261.0,1968.0,654.30606905279,2391,,True,True,post,654.30606905279,landmark,True | 12 | +4389437528,10.61969/jai.1337500,,Education in the Era of Generative Artificial Intelligence (AI): Understanding the Potential Benefits of ChatGPT in Promoting Teaching and Learning,Journal of AI,2023,article,llm,2,1417.0,2361.0,553.3612067681362,2953,693.6856,True,True,post,educationintheeraofgenerativeartificialintelligenceaiunderstandingthepotentialbenefitsofchatgptinpromotingteachingandlearning,553.3612067681362,landmark,True | ||
| 13 | −7135096569,10.1287/orsc.2025.21838,,Navigating the Jagged Technological Frontier: Field Experimental Evidence of the Effects of Artificial Intelligence on Knowledge Worker Productivity and Quality,Organization Science,2026,article,llm,1,183.0,183.0,203.64268033533384,183,650.2714,True,False,post,650.6053660163003,landmark,True | 13 | +4292779060,10.4230/lipics.giscience.2023.43,,"Aion Framework: Dimensional Emergence of AI Consciousness, Observer-Induced Collapse, and Cosmological Portal Dynamics",DROPS (Schloss Dagstuhl – Leibniz Center for Informatics),2023,article,llm,4,11174.0,13333.0,534.676590443066,13690,2570.1233,True,True,post,aionframeworkdimensionalemergenceofaiconsciousnessobserverinducedcollapseandcosmologicalportaldynamics,534.676590443066,landmark,True | ||
| 14 | −4414281281,10.1038/s41586-025-09422-z,,DeepSeek-R1 incentivizes reasoning in LLMs through reinforcement learning,Nature,2025,article,llm,3,1099.0,1099.0,374.373593869335,1099,456.904,True,True,post,556.3784815078109,landmark,True | 14 | +4414281281,10.1038/s41586-025-09422-z,,DeepSeek-R1 incentivizes reasoning in LLMs through reinforcement learning,Nature,2025,article,llm,3,1099.0,1099.0,374.373593869335,1099,456.904,True,True,post,deepseekr1incentivizesreasoninginllmsthroughreinforcementlearning,480.23175285698454,landmark,True | ||
| 15 | −4389437528,10.61969/jai.1337500,,Education in the Era of Generative Artificial Intelligence (AI): Understanding the Potential Benefits of ChatGPT in Promoting Teaching and Learning,Journal of AI,2023,article,llm,2,1417.0,2361.0,553.3612067681362,2953,693.6856,True,True,post,553.3612067681362,landmark,True | 15 | +4360836968,10.48550/arxiv.2303.12712,2303.12712,Sparks of Artificial General Intelligence: Early experiments with GPT-4,arXiv (Cornell University),2023,preprint,llm,2,1098.0,1420.0,472.11108641004154,1523,,True,True,post,sparksofartificialgeneralintelligenceearlyexperimentswithgpt4,472.11108641004154,landmark,True | ||
| 16 | −4292779060,10.4230/lipics.giscience.2023.43,,"Aion Framework: Dimensional Emergence of AI Consciousness, Observer-Induced Collapse, and Cosmological Portal Dynamics",DROPS (Schloss Dagstuhl – Leibniz Center for Informatics),2023,article,llm,4,11174.0,13333.0,534.676590443066,13690,2570.1233,True,True,post,534.676590443066,landmark,True | 16 | +7135096569,10.1287/orsc.2025.21838,,Navigating the Jagged Technological Frontier: Field Experimental Evidence of the Effects of Artificial Intelligence on Knowledge Worker Productivity and Quality,Organization Science,2026,article,llm,1,183.0,183.0,203.64268033533384,183,650.2714,True,False,post,navigatingthejaggedtechnologicalfrontierfieldexperimentalevidenceoftheeffectsofartificialintelligenceonknowledgeworkerproductivityandquality,463.9910854309336,landmark,True | ||
| 17 | −4360836968,10.48550/arxiv.2303.12712,2303.12712,Sparks of Artificial General Intelligence: Early experiments with GPT-4,arXiv (Cornell University),2023,preprint,llm,2,1098.0,1420.0,472.11108641004154,1523,,True,True,post,472.11108641004154,landmark,True | 17 | +4385223296,10.1007/978-3-031-37776-1_17,,"Open AI in Education, the Responsible and Ethical Use of ChatGPT Towards Lifelong Learning",Sustainable development goals series,2023,book-chapter,llm,2,432.0,612.0,421.27957250425067,696,475.0832,False,True,post,openaiineducationtheresponsibleandethicaluseofchatgpttowardslifelonglearning,421.27957250425067,landmark,True | ||
| 18 | −4406800520,10.1007/s11432-024-4222-0,2309.07864,The rise and potential of large language model based agents: a survey,Science China Information Sciences,2025,article,llm,3,914.0,914.0,311.35347115247697,914,317.0864,False,True,post,462.72059335590455,landmark,True | 18 | +4406800520,10.1007/s11432-024-4222-0,2309.07864,The rise and potential of large language model based agents: a survey,Science China Information Sciences,2025,article,llm,3,914.0,914.0,311.35347115247697,914,317.0864,False,True,post,theriseandpotentialoflargelanguagemodelbasedagentsasurvey,399.3920128401127,landmark,True | ||
| 19 | −4385223296,10.1007/978-3-031-37776-1_17,,"Open AI in Education, the Responsible and Ethical Use of ChatGPT Towards Lifelong Learning",Sustainable development goals series,2023,book-chapter,llm,2,432.0,612.0,421.27957250425067,696,475.0832,False,True,post,421.27957250425067,landmark,True | 19 | +4366420437,10.3390/educsci13040410,,What Is the Impact of ChatGPT on Education? A Rapid Review of the Literature,Education Sciences,2023,article,llm,1,955.0,1541.0,361.17307057589915,1967,462.692,True,True,post,whatistheimpactofchatgptoneducationarapidreviewoftheliterature,361.17307057589915,landmark,True | ||
| 20 | −4287689466,10.4230/oasics.slate.2025.1,,From Prediction to Precision: Leveraging LLMs for Equitable and Data-Driven Writing Placement in Developmental Education,OASIcs : OpenAccess Series in Informatics,2025,conference-paper,llm,3,722.0,722.0,548.6111682082906,722,151.0788,True,True,post,365.5188932198721,landmark,True | 20 | +4317910584,10.37074/jalt.2023.6.1.9,,ChatGPT: Bullshit spewer or the end of traditional assessments in higher education?,Journal of Applied Learning & Teaching,2023,article,llm,3,1057.0,1530.0,358.59493704161304,1771,416.3993,True,True,post,chatgptbullshitspewerortheendoftraditionalassessmentsinhighereducation,358.59493704161304,landmark,True | ||
| 21 | −4366420437,10.3390/educsci13040410,,What Is the Impact of ChatGPT on Education? A Rapid Review of the Literature,Education Sciences,2023,article,llm,1,955.0,1541.0,361.17307057589915,1967,462.692,True,True,post,361.17307057589915,landmark,True | 21 | +4313564799,10.2139/ssrn.4312418,,ChatGPT User Experience: Implications for Education,SSRN Electronic Journal,2023,preprint,llm,2,595.0,811.0,335.9058974941328,912,,False,True,post,chatgptuserexperienceimplicationsforeducation,335.9058974941328,landmark,True | ||
| 22 | −4317910584,10.37074/jalt.2023.6.1.9,,ChatGPT: Bullshit spewer or the end of traditional assessments in higher education?,Journal of Applied Learning & Teaching,2023,article,llm,3,1057.0,1530.0,358.59493704161304,1771,416.3993,True,True,post,358.59493704161304,landmark,True | 22 | +4384464487,10.1186/s41239-023-00411-8,2305.00290,"Students’ voices on generative AI: perceptions, benefits, and challenges in higher education",International Journal of Educational Technology in Higher Education,2023,article,llm,2,504.0,1398.0,327.6573346301797,2405,564.912,True,True,post,studentsvoicesongenerativeaiperceptionsbenefitsandchallengesinhighereducation,327.6573346301797,landmark,True | ||
| 23 | −4313564799,10.2139/ssrn.4312418,,ChatGPT User Experience: Implications for Education,SSRN Electronic Journal,2023,preprint,llm,2,595.0,811.0,335.9058974941328,912,,False,True,post,335.9058974941328,landmark,True | 23 | +4392773210,10.1186/s41239-024-00448-3,,"Embracing the future of Artificial Intelligence in the classroom: the relevance of AI literacy, prompt engineering, and critical thinking in modern education",International Journal of Educational Technology in Higher Education,2024,article,llm,1,576.0,1085.0,326.66642380265563,1085,415.2106,True,True,post,embracingthefutureofartificialintelligenceintheclassroomtherelevanceofailiteracypromptengineeringandcriticalthinkinginmoderneducation,326.66642380265563,landmark,True | ||
| 24 | −4382618722,10.1016/j.fmre.2026.03.026,2306.16092,Chatlaw: A Multi-Agent Legal Assistant based on a Role-Aligned Mixture-of-Experts Architecture,Fundamental Research,2026,article,llm,6,94.0,94.0,98.93209876543209,94,193.5725,True,True,post,334.1907344564603,landmark,True | 24 | +4321499901,10.1186/s40561-023-00237-x,,What if the devil is my guardian angel: ChatGPT as a case study of using chatbots in education,Smart Learning Environments,2023,article,llm,3,941.0,1389.0,325.547952647582,1931,453.5275,True,True,post,whatifthedevilismyguardianangelchatgptasacasestudyofusingchatbotsineducation,325.547952647582,landmark,True | ||
| 25 | −4384464487,10.1186/s41239-023-00411-8,2305.00290,"Students’ voices on generative AI: perceptions, benefits, and challenges in higher education",International Journal of Educational Technology in Higher Education,2023,article,llm,2,504.0,1398.0,327.6573346301797,2405,564.912,True,True,post,327.6573346301797,landmark,True | 25 | +4287689466,10.4230/oasics.slate.2025.1,,From Prediction to Precision: Leveraging LLMs for Equitable and Data-Driven Writing Placement in Developmental Education,OASIcs : OpenAccess Series in Informatics,2025,conference-paper,llm,3,722.0,722.0,548.6111682082906,722,151.0788,True,True,post,frompredictiontoprecisionleveragingllmsforequitableanddatadrivenwritingplacementindevelopmentaleducation,315.49347184962954,landmark,True | ||
| 26 | −4392773210,10.1186/s41239-024-00448-3,,"Embracing the future of Artificial Intelligence in the classroom: the relevance of AI literacy, prompt engineering, and critical thinking in modern education",International Journal of Educational Technology in Higher Education,2024,article,llm,1,576.0,1085.0,326.66642380265563,1085,415.2106,True,True,post,326.66642380265563,landmark,True | 26 | +4320495408,10.1108/lhtn-01-2023-0009,,Chatting about ChatGPT: how may AI and GPT impact academia and libraries?,Library Hi Tech News,2023,article,llm,3,895.0,1210.0,283.59468877147174,1346,315.8243,True,True,post,chattingaboutchatgpthowmayaiandgptimpactacademiaandlibraries,283.59468877147174,landmark,True | ||
| 27 | −4387355843,10.1201/9781003616719-7,2310.01728,TimeLLM: Time Series Forecasting by Reprogramming Large Language Models,CRC Press eBooks,2026,book-chapter,foundation_models,4,197.0,197.0,188.61702127659572,197,110.0789,True,True,post,700.378454126837,landmark,True | 27 | +4387355843,10.1201/9781003616719-7,2310.01728,TimeLLM: Time Series Forecasting by Reprogramming Large Language Models,CRC Press eBooks,2026,book-chapter,foundation_models,4,197.0,197.0,188.61702127659572,197,110.0789,True,True,post,timellmtimeseriesforecastingbyreprogramminglargelanguagemodels,499.48767120160613,landmark,True | ||
| 28 | −4392947521,10.1038/s41591-024-02857-3,,Towards a general-purpose foundation model for computational pathology,Nature Medicine,2024,article,foundation_models,2,770.0,1505.0,186.93297525958593,1505,223.3796,False,True,post,186.93297525958593,landmark,True | 28 | +4392947521,10.1038/s41591-024-02857-3,,Towards a general-purpose foundation model for computational pathology,Nature Medicine,2024,article,foundation_models,2,770.0,1505.0,186.93297525958593,1505,223.3796,False,True,post,towardsageneralpurposefoundationmodelforcomputationalpathology,186.93297525958593,landmark,True | ||
| 29 | −7124890304,10.1016/j.jii.2026.101076,,Semi-supervised cross-domain fault diagnosis via contrastive pre-training and annotation-efficient alignment strategy,Journal of Industrial Information Integration,2026,article,foundation_models,1,42.0,42.0,46.52414937759336,42,116.7549,False,False,post,149.31926433160993,landmark,True | 29 | +7133233472,10.52202/075280-0441,2305.14314,QLoRA: Efficient Finetuning of Quantized LLMs,neural information processing systems,2023,conference-paper,foundation_models,7,287.0,532.0,122.68895117800083,1428,269.751,True,True,post,qloraefficientfinetuningofquantizedllms,122.68895117800083,landmark,True | ||
| 30 | −4410551352,10.1038/s41586-025-09005-y,2405.13063,A foundation model for the Earth system,Nature,2025,article,foundation_models,3,249.0,249.0,69.74305555555556,249,109.0217,True,True,post,126.0584548639171,landmark,True | 30 | +4410551352,10.1038/s41586-025-09005-y,2405.13063,A foundation model for the Earth system,Nature,2025,article,foundation_models,3,249.0,249.0,69.74305555555556,249,109.0217,True,True,post,afoundationmodelfortheearthsystem,108.8059203470329,landmark,True | ||
| 31 | −4322832366,10.1145/3773966.3778007,2303.00320,TimeMAE: Self-Supervised Representations of Time Series with Decoupled Masked Autoencoders,,2026,conference-paper,foundation_models,6,35.0,35.0,126.32971014492755,35,165.8809,True,True,post,124.4327202763416,landmark,True | 31 | +7124890304,10.1016/j.jii.2026.101076,,Semi-supervised cross-domain fault diagnosis via contrastive pre-training and annotation-efficient alignment strategy,Journal of Industrial Information Integration,2026,article,foundation_models,1,42.0,42.0,46.52414937759336,42,116.7549,False,False,post,semisupervisedcrossdomainfaultdiagnosisviacontrastivepretrainingandannotationefficientalignmentstrategy,106.48975731201755,landmark,True | ||
| 32 | −7133233472,10.52202/075280-0441,2305.14314,QLoRA: Efficient Finetuning of Quantized LLMs,neural information processing systems,2023,conference-paper,foundation_models,7,287.0,532.0,122.68895117800083,1428,269.751,True,True,post,122.68895117800083,landmark,True | 32 | +2990704537,,,SuperGLUE: A Stickier Benchmark for General-Purpose Language Understanding Systems,neural information processing systems,2019,article,foundation_models,5,262.0,668.0,101.57304226845103,462,52.8392,True,False,baseline,superglueastickierbenchmarkforgeneralpurposelanguageunderstandingsystems,101.57304226845103,landmark,True | ||
| 33 | −2990704537,,,SuperGLUE: A Stickier Benchmark for General-Purpose Language Understanding Systems,neural information processing systems,2019,article,foundation_models,5,262.0,668.0,101.57304226845103,462,52.8392,True,False,baseline,101.57304226845103,landmark,True | 33 | +4322832366,10.1145/3773966.3778007,2303.00320,TimeMAE: Self-Supervised Representations of Time Series with Decoupled Masked Autoencoders,,2026,conference-paper,foundation_models,6,35.0,35.0,126.32971014492755,35,165.8809,True,True,post,timemaeselfsupervisedrepresentationsoftimeserieswithdecoupledmaskedautoencoders,88.74146442668129,landmark,True | ||
| 34 | −7125271461,10.1039/d5dd00348b,,ChemBERTa-3: an open source training framework for chemical foundation models,Digital Discovery,2026,article,foundation_models,2,25.0,25.0,70.59021819073303,25,85.533,True,True,post,88.88051448310114,landmark,True | 34 | +4393138529,10.48550/arxiv.2403.14608,2403.14608,Parameter-Efficient Fine-Tuning for Large Models: A Comprehensive Survey,arXiv (Cornell University),2024,preprint,foundation_models,6,83.0,95.0,82.87448253022023,95,,True,True,post,parameterefficientfinetuningforlargemodelsacomprehensivesurvey,82.87448253022023,landmark,True | ||
| 35 | −7119541039,10.1038/s43247-025-03127-x,,On the foundations of Earth foundation models,Communications Earth & Environment,2026,article,foundation_models,3,24.0,24.0,26.707236765289682,24,83.0902,True,True,post,85.3252939037771,landmark,True | 35 | +4402220065,10.1038/s41586-024-07894-z,,A pathology foundation model for cancer diagnosis and prognosis prediction,Nature,2024,article,foundation_models,2,275.0,562.0,69.80487182450983,562,83.6371,False,True,post,apathologyfoundationmodelforcancerdiagnosisandprognosisprediction,69.80487182450983,landmark,True | ||
| 36 | −4393138529,10.48550/arxiv.2403.14608,2403.14608,Parameter-Efficient Fine-Tuning for Large Models: A Comprehensive Survey,arXiv (Cornell University),2024,preprint,foundation_models,6,83.0,95.0,82.87448253022023,95,,True,True,post,82.87448253022023,landmark,True | 36 | +7125271461,10.1039/d5dd00348b,,ChemBERTa-3: an open source training framework for chemical foundation models,Digital Discovery,2026,article,foundation_models,2,25.0,25.0,70.59021819073303,25,85.533,True,True,post,chemberta3anopensourcetrainingframeworkforchemicalfoundationmodels,63.38676030477235,landmark,True | ||
| 37 | −4390690043,10.1145/3800677,2401.02458,Data-Centric Foundation Models in Computational Healthcare: A Survey,ACM Computing Surveys,2026,article,foundation_models,4,22.0,22.0,10.015503875968992,22,13.1625,True,True,post,78.21485274512901,landmark,True | 37 | +7119541039,10.1038/s43247-025-03127-x,,On the foundations of Earth foundation models,Communications Earth & Environment,2026,article,foundation_models,3,24.0,24.0,26.707236765289682,24,83.0902,True,True,post,onthefoundationsofearthfoundationmodels,60.851289892581455,landmark,True | ||
| 38 | −7128029160,10.1038/s41593-026-02202-6,,A generalizable foundation model for analysis of human brain MRI,Nature Neuroscience,2026,article,foundation_models,2,20.0,20.0,22.2560306377414,20,72.2524,True,True,post,71.10441158648091,landmark,True | 38 | +4390690043,10.1145/3800677,2401.02458,Data-Centric Foundation Models in Computational Healthcare: A Survey,ACM Computing Surveys,2026,article,foundation_models,4,22.0,22.0,10.015503875968992,22,13.1625,True,True,post,datacentricfoundationmodelsincomputationalhealthcareasurvey,55.78034906819967,landmark,True | ||
| 39 | −4402220065,10.1038/s41586-024-07894-z,,A pathology foundation model for cancer diagnosis and prognosis prediction,Nature,2024,article,foundation_models,2,275.0,562.0,69.80487182450983,562,83.6371,False,True,post,69.80487182450983,landmark,True | 39 | +4361229539,10.48550/arxiv.2303.16199,2303.16199,LLaMA-Adapter: Efficient Fine-tuning of Language Models with Zero-init Attention,arXiv (Cornell University),2023,preprint,foundation_models,9,135.0,161.0,53.528087966208936,166,,True,True,post,llamaadapterefficientfinetuningoflanguagemodelswithzeroinitattention,53.528087966208936,landmark,True | ||
| 40 | −7118170538,10.3390/bdcc10010019,,Applications of Artificial Intelligence in Fisheries: From Data to Decisions,Big Data and Cognitive Computing,2026,article,foundation_models,8,17.0,17.0,17.85,17,28.0244,True,True,post,60.43874984850878,landmark,True | 40 | +7128029160,10.1038/s41593-026-02202-6,,A generalizable foundation model for analysis of human brain MRI,Nature Neuroscience,2026,article,foundation_models,2,20.0,20.0,22.2560306377414,20,72.2524,True,True,post,ageneralizablefoundationmodelforanalysisofhumanbrainmri,50.70940824381788,landmark,True | ||
| 41 | −4411932262,10.1038/s41586-025-09215-4,,A foundation model to predict and capture human cognition,Nature,2025,article,foundation_models,1,110.0,110.0,26.933816382433506,110,60.8153,True,True,post,55.6884740362686,landmark,True | 41 | +4385948838,10.1038/s41591-023-02504-3,,A visual–language foundation model for pathology image analysis using medical Twitter,Nature Medicine,2023,article,foundation_models,3,179.0,471.0,49.064992972535784,680,61.8263,False,False,post,avisuallanguagefoundationmodelforpathologyimageanalysisusingmedicaltwitter,49.064992972535784,landmark,True | ||
| 42 | −4411099958,10.1038/s41591-025-03747-y,2410.15038,A multimodal vision foundation model for clinical dermatology,Nature Medicine,2025,article,foundation_models,4,108.0,108.0,18.44502277163305,108,39.3828,True,True,post,54.67595632651827,landmark,True | 42 | +4411932262,10.1038/s41586-025-09215-4,,A foundation model to predict and capture human cognition,Nature,2025,article,foundation_models,1,110.0,110.0,26.933816382433506,110,60.8153,True,True,post,afoundationmodeltopredictandcapturehumancognition,48.06687244246433,landmark,True | ||
| 43 | −4361229539,10.48550/arxiv.2303.16199,2303.16199,LLaMA-Adapter: Efficient Fine-tuning of Language Models with Zero-init Attention,arXiv (Cornell University),2023,preprint,foundation_models,9,135.0,161.0,53.528087966208936,166,,True,True,post,53.528087966208936,landmark,True | 43 | +4411099958,10.1038/s41591-025-03747-y,2410.15038,A multimodal vision foundation model for clinical dermatology,Nature Medicine,2025,article,foundation_models,4,108.0,108.0,18.44502277163305,108,39.3828,True,True,post,amultimodalvisionfoundationmodelforclinicaldermatology,47.1929293071468,landmark,True | ||
| 44 | −4407135816,10.1148/radiol.240597,2411.18730,"Foundation Models in Radiology: What, How, Why, and Why Not",Radiology,2025,article,foundation_models,4,103.0,103.0,6.850784973366975,103,21.0891,True,True,post,52.14466205214242,landmark,True | 44 | +4407135816,10.1148/radiol.240597,2411.18730,"Foundation Models in Radiology: What, How, Why, and Why Not",Radiology,2025,article,foundation_models,4,103.0,103.0,6.850784973366975,103,21.0891,True,True,post,foundationmodelsinradiologywhathowwhyandwhynot,45.00807146885297,landmark,True | ||
| 45 | −4385948838,10.1038/s41591-023-02504-3,,A visual–language foundation model for pathology image analysis using medical Twitter,Nature Medicine,2023,article,foundation_models,3,179.0,471.0,49.064992972535784,680,61.8263,False,False,post,49.064992972535784,landmark,True | 45 | +7118170538,10.3390/bdcc10010019,,Applications of Artificial Intelligence in Fisheries: From Data to Decisions,Big Data and Cognitive Computing,2026,article,foundation_models,8,17.0,17.0,17.85,17,28.0244,True,True,post,applicationsofartificialintelligenceinfisheriesfromdatatodecisions,43.1029970072452,landmark,True | ||
| 46 | −4406643700,10.1016/j.jag.2025.104368,,Towards the next generation of Geospatial Artificial Intelligence,International Journal of Applied Earth Observation and Geoinformation,2025,article,foundation_models,2,91.0,91.0,19.115723270440252,91,404.3482,True,True,post,46.06955579364039,landmark,True | 46 | +4393153153,10.1609/aaai.v38i12.29299,2312.15709,TimesURL: Self-Supervised Contrastive Learning for Universal Time Series Representation Learning,Proceedings of the AAAI Conference on Artificial Intelligence,2024,conference-paper,foundation_models,5,68.0,113.0,41.75133936818769,113,44.645,True,True,post,timesurlselfsupervisedcontrastivelearningforuniversaltimeseriesrepresentationlearning,41.75133936818769,landmark,True | ||
| 47 | −4406472599,10.1038/s42256-024-00961-0,2310.08184,Learning from models beyond fine-tuning,Nature Machine Intelligence,2025,article,foundation_models,4,86.0,86.0,29.29584083053941,86,31.2093,False,True,post,43.538261519264545,landmark,True | 47 | +4406643700,10.1016/j.jag.2025.104368,,Towards the next generation of Geospatial Artificial Intelligence,International Journal of Applied Earth Observation and Geoinformation,2025,article,foundation_models,2,91.0,91.0,19.115723270440252,91,404.3482,True,True,post,towardsthenextgenerationofgeospatialartificialintelligence,39.76441265694776,landmark,True | ||
| 48 | −4393153153,10.1609/aaai.v38i12.29299,2312.15709,TimesURL: Self-Supervised Contrastive Learning for Universal Time Series Representation Learning,Proceedings of the AAAI Conference on Artificial Intelligence,2024,conference-paper,foundation_models,5,68.0,113.0,41.75133936818769,113,44.645,True,True,post,41.75133936818769,landmark,True | 48 | +4402727669,10.1109/cvpr52733.2024.01239,,mPLUG-OwI2: Revolutionizing Multi-modal Large Language Model with Modality Collaboration,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2024,conference-paper,foundation_models,5,136.0,184.0,38.61721404801364,184,40.1743,True,False,post,mplugowi2revolutionizingmultimodallargelanguagemodelwithmodalitycollaboration,38.61721404801364,landmark,True | ||
| 49 | −4402727669,10.1109/cvpr52733.2024.01239,,mPLUG-OwI2: Revolutionizing Multi-modal Large Language Model with Modality Collaboration,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2024,conference-paper,foundation_models,5,136.0,184.0,38.61721404801364,184,40.1743,True,False,post,38.61721404801364,landmark,True | 49 | +4401397240,10.1038/s41591-024-03185-2,2305.17100,A generalist vision–language foundation model for diverse biomedical tasks,Nature Medicine,2024,article,foundation_models,5,202.0,325.0,38.50242478427548,325,43.9301,False,True,post,ageneralistvisionlanguagefoundationmodelfordiversebiomedicaltasks,38.50242478427548,landmark,True | ||
| 50 | −4401397240,10.1038/s41591-024-03185-2,2305.17100,A generalist vision–language foundation model for diverse biomedical tasks,Nature Medicine,2024,article,foundation_models,5,202.0,325.0,38.50242478427548,325,43.9301,False,True,post,38.50242478427548,landmark,True | 50 | +4406472599,10.1038/s42256-024-00961-0,2310.08184,Learning from models beyond fine-tuning,Nature Machine Intelligence,2025,article,foundation_models,4,86.0,86.0,29.29584083053941,86,31.2093,False,True,post,learningfrommodelsbeyondfinetuning,37.57955481865393,landmark,True | ||
| 51 | −4385285835,10.1101/2023.07.21.23292757,,Scaling Self-Supervised Learning for Histopathology with Masked Image Modeling,medRxiv,2023,preprint,foundation_models,7,42.0,107.0,35.57456777878482,142,,True,True,post,35.57456777878482,landmark,True | 51 | +4385285835,10.1101/2023.07.21.23292757,,Scaling Self-Supervised Learning for Histopathology with Masked Image Modeling,medRxiv,2023,preprint,foundation_models,7,42.0,107.0,35.57456777878482,142,,True,True,post,scalingselfsupervisedlearningforhistopathologywithmaskedimagemodeling,35.57456777878482,landmark,True | ||
| 52 | −4318718936,10.48550/arxiv.2301.12597,2301.12597,BLIP-2: Bootstrapping Language-Image Pre-training with Frozen Image Encoders and Large Language Models,arXiv (Cornell University),2023,preprint,multimodal_ai,7,654.0,875.0,273.1441896618733,908,,True,True,post,273.1441896618733,landmark,True | 52 | +4318718936,10.48550/arxiv.2301.12597,2301.12597,BLIP-2: Bootstrapping Language-Image Pre-training with Frozen Image Encoders and Large Language Models,arXiv (Cornell University),2023,preprint,multimodal_ai,7,654.0,875.0,273.1441896618733,908,,True,True,post,blip2bootstrappinglanguageimagepretrainingwithfrozenimageencodersandlargelanguagemodels,273.1441896618733,landmark,True | ||
| 53 | −4393148714,10.1609/aaai.v38i5.28226,2302.08453,T2I-Adapter: Learning Adapters to Dig Out More Controllable Ability for Text-to-Image Diffusion Models,Proceedings of the AAAI Conference on Artificial Intelligence,2024,conference-paper,multimodal_ai,7,683.0,923.0,193.71569872998148,923,194.9761,True,True,post,193.71569872998148,landmark,True | 53 | +4393148714,10.1609/aaai.v38i5.28226,2302.08453,T2I-Adapter: Learning Adapters to Dig Out More Controllable Ability for Text-to-Image Diffusion Models,Proceedings of the AAAI Conference on Artificial Intelligence,2024,conference-paper,multimodal_ai,7,683.0,923.0,193.71569872998148,923,194.9761,True,True,post,t2iadapterlearningadapterstodigoutmorecontrollableabilityfortexttoimagediffusionmodels,193.71569872998148,landmark,True | ||
| 54 | −4396599905,10.1016/j.inffus.2026.104437,2404.18947,Multimodal fusion on low-quality data: A comprehensive survey,Information Fusion,2026,article,multimodal_ai,3,48.0,48.0,128.6576012223071,48,99.7217,True,True,post,170.6505878075542,landmark,True | 54 | +4396599905,10.1016/j.inffus.2026.104437,2404.18947,Multimodal fusion on low-quality data: A comprehensive survey,Information Fusion,2026,article,multimodal_ai,3,48.0,48.0,128.6576012223071,48,99.7217,True,True,post,multimodalfusiononlowqualitydataacomprehensivesurvey,121.70257978516291,landmark,True | ||
| 55 | −4396952261,10.1007/978-3-031-53092-0_10,,Multimodal Deep Learning,Springer optimization and its applications,2024,book-chapter,multimodal_ai,3,188.0,189.0,147.22445489525438,189,23.3148,False,False,post,147.22445489525438,landmark,True | 55 | +7133250524,10.52202/068431-1833,,LAION-5B: An Open Large-Scale Dataset for Training Next Generation Image-Text Models,neural information processing systems,2022,conference-paper,multimodal_ai,4,217.0,828.0,111.87473883318704,309,6.4706,False,False,baseline,laion5banopenlargescaledatasetfortrainingnextgenerationimagetextmodels,111.87473883318704,landmark,True | ||
| 56 | −7133250524,10.52202/068431-1833,,LAION-5B: An Open Large-Scale Dataset for Training Next Generation Image-Text Models,neural information processing systems,2022,conference-paper,multimodal_ai,4,217.0,828.0,111.87473883318704,309,6.4706,False,False,baseline,111.87473883318704,landmark,True | 56 | +4392947532,10.1038/s41591-024-02856-4,,A visual-language foundation model for computational pathology,Nature Medicine,2024,article,multimodal_ai,4,475.0,938.0,111.12392137738586,938,132.4965,False,True,post,avisuallanguagefoundationmodelforcomputationalpathology,111.12392137738586,landmark,True | ||
| 57 | −4392947532,10.1038/s41591-024-02856-4,,A visual-language foundation model for computational pathology,Nature Medicine,2024,article,multimodal_ai,4,475.0,938.0,111.12392137738586,938,132.4965,False,True,post,111.12392137738586,landmark,True | 57 | +2619383789,10.1109/tpami.2018.2798607,,Multimodal Machine Learning: A Survey and Taxonomy,IEEE Transactions on Pattern Analysis and Machine Intelligence,2018,article,multimodal_ai,3,263.0,587.0,103.0608512817748,4909,120.007,True,True,baseline,multimodalmachinelearningasurveyandtaxonomy,103.0608512817748,landmark,True | ||
| 58 | −7138474371,10.1609/aaai.v40i16.38386,,OpenDriveVLA: Towards End-to-end Autonomous Driving with Large Vision Language Action Model,Proceedings of the AAAI Conference on Artificial Intelligence,2026,conference-paper,multimodal_ai,4,31.0,31.0,159.42857142857142,30,608.3281,True,True,post,110.21183795904541,landmark,True | 58 | +2995460200,,,VL-BERT: Pre-training of Generic Visual-Linguistic Representations,International Conference on Learning Representations,2020,conference-paper,multimodal_ai,6,491.0,670.0,81.11570775331289,252,20.1142,True,False,baseline,vlbertpretrainingofgenericvisuallinguisticrepresentations,81.11570775331289,landmark,True | ||
| 59 | −7127319731,10.1109/tmi.2026.3661001,,Med-R1: Reinforcement Learning for Generalizable Medical Reasoning in Vision-Language Models,IEEE Transactions on Medical Imaging,2026,article,multimodal_ai,6,29.0,29.0,77.73063407181054,28,87.2565,True,False,post,103.10139680039732,landmark,True | 59 | +4289785095,10.48550/arxiv.2208.01618,2208.01618,An Image is Worth One Word: Personalizing Text-to-Image Generation using Textual Inversion,arXiv (Cornell University),2022,preprint,multimodal_ai,9,98.0,366.0,79.44757164293819,468,,True,True,baseline,animageisworthonewordpersonalizingtexttoimagegenerationusingtextualinversion,79.44757164293819,landmark,True | ||
| 60 | −2619383789,10.1109/tpami.2018.2798607,,Multimodal Machine Learning: A Survey and Taxonomy,IEEE Transactions on Pattern Analysis and Machine Intelligence,2018,article,multimodal_ai,3,263.0,587.0,103.0608512817748,4909,120.007,True,True,baseline,103.0608512817748,landmark,True | 60 | +7138474371,10.1609/aaai.v40i16.38386,,OpenDriveVLA: Towards End-to-end Autonomous Driving with Large Vision Language Action Model,Proceedings of the AAAI Conference on Artificial Intelligence,2026,conference-paper,multimodal_ai,4,31.0,31.0,159.42857142857142,30,608.3281,True,True,post,opendrivevlatowardsendtoendautonomousdrivingwithlargevisionlanguageactionmodel,78.59958277791772,landmark,True | ||
| 61 | −7148475777,10.1117/12.3086794,2508.08224,Capabilities of GPT‑5 on multimodal medical reasoning,,2026,conference-paper,multimodal_ai,7,26.0,26.0,73.1907514450867,26,238.4333,True,True,post,92.4357350624252,landmark,True | 61 | +7127319731,10.1109/tmi.2026.3661001,,Med-R1: Reinforcement Learning for Generalizable Medical Reasoning in Vision-Language Models,IEEE Transactions on Medical Imaging,2026,article,multimodal_ai,6,29.0,29.0,77.73063407181054,28,87.2565,True,False,post,medr1reinforcementlearningforgeneralizablemedicalreasoninginvisionlanguagemodels,73.52864195353592,landmark,True | ||
| 62 | −7160627408,10.1109/csnt69054.2026.11502110,,Generative Artificial Intelligence for Cross-Domain Knowledge Synthesis and Intelligent Automation,IEEE International Conference on Communication Systems and Network Technologies (CSNT),2026,conference-paper,multimodal_ai,6,23.0,23.0,193.44642857142856,23,207.3469,True,False,post,81.77007332445305,landmark,True | 62 | +4415913530,10.1038/s41591-025-03982-3,,A multimodal whole-slide foundation model for pathology,Nature Medicine,2025,article,multimodal_ai,8,157.0,157.0,53.48194198133358,157,65.3314,True,True,post,amultimodalwholeslidefoundationmodelforpathology,68.60453612242637,landmark,True | ||
| 63 | −2995460200,,,VL-BERT: Pre-training of Generic Visual-Linguistic Representations,International Conference on Learning Representations,2020,conference-paper,multimodal_ai,6,491.0,670.0,81.11570775331289,252,20.1142,True,False,baseline,81.11570775331289,landmark,True | 63 | +7148475777,10.1117/12.3086794,2508.08224,Capabilities of GPT‑5 on multimodal medical reasoning,,2026,conference-paper,multimodal_ai,7,26.0,26.0,73.1907514450867,26,238.4333,True,True,post,capabilitiesofgpt5onmultimodalmedicalreasoning,65.92223071696324,landmark,True | ||
| 64 | −4415913530,10.1038/s41591-025-03982-3,,A multimodal whole-slide foundation model for pathology,Nature Medicine,2025,article,multimodal_ai,8,157.0,157.0,53.48194198133358,157,65.3314,True,True,post,79.48264021540155,landmark,True | 64 | +7133220561,10.52202/075280-2142,,InstructBLIP: Towards General-purpose Vision-Language Models with Instruction Tuning,neural information processing systems,2023,conference-paper,multimodal_ai,5,290.0,454.0,63.3563629226367,398,45.2545,False,False,post,instructbliptowardsgeneralpurposevisionlanguagemodelswithinstructiontuning,63.3563629226367,landmark,True | ||
| 65 | −4289785095,10.48550/arxiv.2208.01618,2208.01618,An Image is Worth One Word: Personalizing Text-to-Image Generation using Textual Inversion,arXiv (Cornell University),2022,preprint,multimodal_ai,9,98.0,366.0,79.44757164293819,468,,True,True,baseline,79.44757164293819,landmark,True | 65 | +4413447271,10.1038/s41467-025-62385-7,2308.02463,Towards generalist foundation model for radiology by leveraging web-scale 2D&3D medical data,Nature Communications,2025,article,multimodal_ai,4,142.0,142.0,46.43212351171006,142,51.2274,True,True,post,towardsgeneralistfoundationmodelforradiologybyleveragingwebscale2d3dmedicaldata,62.04996260754486,landmark,True | ||
| 66 | −7125233009,10.1007/s44443-026-00472-5,,SemCap: Sentiment-aware semantic captioning for multimodal aspect-based sentiment analysis,Journal of King Saud University - Computer and Information Sciences,2026,article,multimodal_ai,4,22.0,22.0,24.48163370151554,22,79.4776,True,True,post,78.21485274512901,landmark,True | 66 | +4389519587,10.18653/v1/2023.emnlp-demo.49,,Video-LLaMA: An Instruction-tuned Audio-Visual Language Model for Video Understanding,Conference on Empirical Methods in Natural Language Processing: System Demonstrations (EMNLP),2023,conference-paper,multimodal_ai,6,171.0,421.0,58.751164736630066,586,66.631,True,True,post,videollamaaninstructiontunedaudiovisuallanguagemodelforvideounderstanding,58.751164736630066,landmark,True | ||
| 67 | −7143512276,10.1007/s11831-026-10560-4,,Multimodal Machine Learning Approaches in Predictive Healthcare Analytics: A Comprehensive Survey,Archives of Computational Methods in Engineering,2026,article,multimodal_ai,5,21.0,21.0,23.368832169628472,21,75.865,True,True,post,74.65963216580496,landmark,True | 67 | +7160627408,10.1109/csnt69054.2026.11502110,,Generative Artificial Intelligence for Cross-Domain Knowledge Synthesis and Intelligent Automation,IEEE International Conference on Communication Systems and Network Technologies (CSNT),2026,conference-paper,multimodal_ai,6,23.0,23.0,193.44642857142856,23,207.3469,True,False,post,generativeartificialintelligenceforcrossdomainknowledgesynthesisandintelligentautomation,58.315819480390566,landmark,True | ||
| 68 | −4413447271,10.1038/s41467-025-62385-7,2308.02463,Towards generalist foundation model for radiology by leveraging web-scale 2D&3D medical data,Nature Communications,2025,article,multimodal_ai,4,142.0,142.0,46.43212351171006,142,51.2274,True,True,post,71.88875739227402,landmark,True | 68 | +7125233009,10.1007/s44443-026-00472-5,,SemCap: Sentiment-aware semantic captioning for multimodal aspect-based sentiment analysis,Journal of King Saud University - Computer and Information Sciences,2026,article,multimodal_ai,4,22.0,22.0,24.48163370151554,22,79.4776,True,True,post,semcapsentimentawaresemanticcaptioningformultimodalaspectbasedsentimentanalysis,55.78034906819967,landmark,True | ||
| 69 | −7131830459,10.1109/tmm.2026.3668620,2502.15711,A Survey on Multimodal Recommender Systems: Recent Advances and Future Directions,IEEE Transactions on Multimedia,2026,article,multimodal_ai,3,20.0,20.0,142.0908500973394,20,173.9038,True,True,post,71.10441158648091,landmark,True | 69 | +4399567248,10.1038/s41586-024-07618-3,,A multimodal generative AI copilot for human pathology,Nature,2024,article,multimodal_ai,8,268.0,452.0,53.54798769997698,452,63.8469,True,True,post,amultimodalgenerativeaicopilotforhumanpathology,53.54798769997698,landmark,True | ||
| 70 | −7206206818,10.1109/tpami.2026.3730310,,Lingshu: Generalist Foundation Model for Unified Multimodal Medical Understanding and Reasoning,IEEE Transactions on Pattern Analysis and Machine Intelligence,2026,article,multimodal_ai,6,18.0,18.0,48.246600458365165,18,56.0935,True,False,post,63.99397042783282,landmark,True | 70 | +7143512276,10.1007/s11831-026-10560-4,,Multimodal Machine Learning Approaches in Predictive Healthcare Analytics: A Comprehensive Survey,Archives of Computational Methods in Engineering,2026,article,multimodal_ai,5,21.0,21.0,23.368832169628472,21,75.865,True,True,post,multimodalmachinelearningapproachesinpredictivehealthcareanalyticsacomprehensivesurvey,53.24487865600877,landmark,True | ||
| 71 | −7133220561,10.52202/075280-2142,,InstructBLIP: Towards General-purpose Vision-Language Models with Instruction Tuning,neural information processing systems,2023,conference-paper,multimodal_ai,5,290.0,454.0,63.3563629226367,398,45.2545,False,False,post,63.3563629226367,landmark,True | 71 | +4410882873,10.1016/j.media.2025.103621,2411.03782,Navigating the landscape of multimodal AI in medicine: A scoping review on technical challenges and clinical applications,Medical Image Analysis,2025,article,multimodal_ai,6,119.0,119.0,7.914984580880291,119,24.365,True,True,post,navigatingthelandscapeofmultimodalaiinmedicineascopingreviewontechnicalchallengesandclinicalapplications,51.99961655139323,landmark,True | ||
| 72 | −7164501397,10.1038/s41467-026-74207-5,2311.05591,Multimodal foundation models exploit text to make medical image predictions,Nature Communications,2026,article,multimodal_ai,6,17.0,17.0,45.56623376623377,17,6.2326,True,True,post,60.43874984850878,landmark,True | 72 | +7131830459,10.1109/tmm.2026.3668620,2502.15711,A Survey on Multimodal Recommender Systems: Recent Advances and Future Directions,IEEE Transactions on Multimedia,2026,article,multimodal_ai,3,20.0,20.0,142.0908500973394,20,173.9038,True,True,post,asurveyonmultimodalrecommendersystemsrecentadvancesandfuturedirections,50.70940824381788,landmark,True | ||
| 73 | −7165561001,10.1007/978-3-032-29501-9_39,,"M3-HGMA: A Multi-modal, Multi-agent Hierarchical Graph-Mamba Architecture for Explainable and Adaptive Clinical Intelligence",Learning and analytics in intelligent systems,2026,conference-paper,multimodal_ai,2,17.0,17.0,142.98214285714286,17,160.2226,False,False,post,60.43874984850878,landmark,True | 73 | +4412438081,10.1016/j.array.2025.100445,,RAFT: Robust Adversarial Fusion Transformer for multimodal sentiment analysis,Array,2025,article,multimodal_ai,5,111.0,111.0,37.81207363011482,111,46.1897,True,True,post,raftrobustadversarialfusiontransformerformultimodalsentimentanalysis,48.503844010123096,landmark,True | ||
| 74 | −7138470740,10.1609/aaai.v40i18.38608,,Cross-modal Proxy Evolving for OOD Detection with Vision-Language Models,Proceedings of the AAAI Conference on Artificial Intelligence,2026,conference-paper,multimodal_ai,7,17.0,17.0,130.47598850731976,17,157.1634,True,True,post,60.43874984850878,landmark,True | 74 | +2968124245,10.48550/arxiv.1908.03557,1908.03557,VisualBERT: A Simple and Performant Baseline for Vision and Language,arXiv (Cornell University),2019,preprint,multimodal_ai,7,120.0,374.0,48.02738920120277,1140,,True,True,baseline,visualbertasimpleandperformantbaselineforvisionandlanguage,48.02738920120277,landmark,True | ||
| 75 | −7138363754,10.1609/aaai.v40i6.42404,,AdaptCLIP: Adapting CLIP for Universal Visual Anomaly Detection,Proceedings of the AAAI Conference on Artificial Intelligence,2026,conference-paper,multimodal_ai,6,17.0,17.0,130.47598850731976,17,157.1634,True,True,post,60.43874984850878,landmark,True | 75 | +7206206818,10.1109/tpami.2026.3730310,,Lingshu: Generalist Foundation Model for Unified Multimodal Medical Understanding and Reasoning,IEEE Transactions on Pattern Analysis and Machine Intelligence,2026,article,multimodal_ai,6,18.0,18.0,48.246600458365165,18,56.0935,True,False,post,lingshugeneralistfoundationmodelforunifiedmultimodalmedicalunderstandingandreasoning,45.63846741943609,landmark,True | ||
| 76 | −4410882873,10.1016/j.media.2025.103621,2411.03782,Navigating the landscape of multimodal AI in medicine: A scoping review on technical challenges and clinical applications,Medical Image Analysis,2025,article,multimodal_ai,6,119.0,119.0,7.914984580880291,119,24.365,True,True,post,60.24480373014512,landmark,True | 76 | +4389523832,10.18653/v1/2023.emnlp-main.20,2305.10355,Evaluating Object Hallucination in Large Vision-Language Models,Conference on Empirical Methods in Natural Language Processing (EMNLP),2023,conference-paper,multimodal_ai,6,124.0,326.0,45.49377601933825,559,63.561,True,True,post,evaluatingobjecthallucinationinlargevisionlanguagemodels,45.49377601933825,landmark,True | ||
| 77 | −4400228804,10.46569/df65vg26z,,The Conglomeration of Everything: Shifting Animation Production Practices due to Artificial Intelligence,,2024,dissertation,generative_ai,4,2.0,2.0,540.0,2,,True,True,post,540.0,landmark,True | 77 | +4400228804,10.46569/df65vg26z,,The Conglomeration of Everything: Shifting Animation Production Practices due to Artificial Intelligence,,2024,dissertation,generative_ai,4,2.0,2.0,540.0,2,,True,True,post,theconglomerationofeverythingshiftinganimationproductionpracticesduetoartificialintelligence,540.0,landmark,True | ||
| 78 | −7124262017,10.1787/062a7394-en,,OECD Digital Education Outlook 2026,Digital education outlook,2026,book,generative_ai,1,87.0,87.0,783.6796875,87,992.8809,True,False,post,309.304190401192,landmark,True | 78 | +4383312437,10.1186/s41239-023-00408-3,2305.00280,A comprehensive AI policy education framework for university teaching and learning,International Journal of Educational Technology in Higher Education,2023,article,generative_ai,1,451.0,988.0,231.56326653406123,1524,357.6522,True,True,post,acomprehensiveaipolicyeducationframeworkforuniversityteachingandlearning,231.56326653406123,landmark,True | ||
| 79 | −4406472463,10.1038/s41586-025-08628-5,,A generative model for inorganic materials design,Nature,2025,article,generative_ai,2,498.0,498.0,77.09849967384214,498,102.9572,True,True,post,252.1169097278342,landmark,True | 79 | +7133185348,10.52202/068431-2643,,Photorealistic Text-To-Image Diffusion Models with Deep Language Understanding,neural information processing systems,2022,conference-paper,generative_ai,5,651.0,1706.0,230.5051986104071,530,10.1405,False,False,baseline,photorealistictexttoimagediffusionmodelswithdeeplanguageunderstanding,230.5051986104071,landmark,True | ||
| 80 | −7123342962,10.1109/tmm.2026.3651132,,Structure-Preserving Frequency-Regularized Text-Guided Optimal Transport for Unpaired Rain Streaks and Raindrops Removal,IEEE Transactions on Multimedia,2026,article,generative_ai,3,66.0,66.0,176.9042016806723,66,205.676,True,False,post,234.64455823538702,landmark,True | 80 | +3195296536,,,Generative Adversarial Trainer Defense to Adversarial Perturbations with GAN,Seoul National University Open Repository (Seoul National University),2020,dissertation,generative_ai,4,37.0,48.0,221.6522377109318,65,,False,True,baseline,generativeadversarialtrainerdefensetoadversarialperturbationswithgan,221.6522377109318,landmark,True | ||
| 81 | −4383312437,10.1186/s41239-023-00408-3,2305.00280,A comprehensive AI policy education framework for university teaching and learning,International Journal of Educational Technology in Higher Education,2023,article,generative_ai,1,451.0,988.0,231.56326653406123,1524,357.6522,True,True,post,231.56326653406123,landmark,True | 81 | +7124262017,10.1787/062a7394-en,,OECD Digital Education Outlook 2026,Digital education outlook,2026,book,generative_ai,1,87.0,87.0,783.6796875,87,992.8809,True,False,post,oecddigitaleducationoutlook2026,220.58592586060777,landmark,True | ||
| 82 | −7133185348,10.52202/068431-2643,,Photorealistic Text-To-Image Diffusion Models with Deep Language Understanding,neural information processing systems,2022,conference-paper,generative_ai,5,651.0,1706.0,230.5051986104071,530,10.1405,False,False,baseline,230.5051986104071,landmark,True | 82 | +4406472463,10.1038/s41586-025-08628-5,,A generative model for inorganic materials design,Nature,2025,article,generative_ai,2,498.0,498.0,77.09849967384214,498,102.9572,True,True,post,agenerativemodelforinorganicmaterialsdesign,217.6118406940658,landmark,True | ||
| 83 | −3195296536,,,Generative Adversarial Trainer Defense to Adversarial Perturbations with GAN,Seoul National University Open Repository (Seoul National University),2020,dissertation,generative_ai,4,37.0,48.0,221.6522377109318,65,,False,True,baseline,221.6522377109318,landmark,True | 83 | +4322617812,10.1016/j.ijme.2023.100790,,Generative AI and the future of education: Ragnarök or reformation? A paradoxical perspective from management educators,The International Journal of Management Education,2023,article,generative_ai,1,491.0,873.0,204.6100523119792,1151,270.2366,True,True,post,generativeaiandthefutureofeducationragnarkorreformationaparadoxicalperspectivefrommanagementeducators,204.6100523119792,landmark,True | ||
| 84 | −4322617812,10.1016/j.ijme.2023.100790,,Generative AI and the future of education: Ragnarök or reformation? A paradoxical perspective from management educators,The International Journal of Management Education,2023,article,generative_ai,1,491.0,873.0,204.6100523119792,1151,270.2366,True,True,post,204.6100523119792,landmark,True | 84 | +4400770292,10.2139/ssrn.4895486,,Generative AI Can Harm Learning,SSRN Electronic Journal,2024,preprint,generative_ai,1,123.0,198.0,174.24635549016986,198,,False,True,post,generativeaicanharmlearning,174.24635549016986,landmark,True | ||
| 85 | −3096831136,10.1145/3422622,,Generative adversarial networks,Communications of the ACM,2020,article,generative_ai,3,565.0,1473.0,198.6115392180884,14434,457.4443,True,False,baseline,198.6115392180884,landmark,True | 85 | +7123342962,10.1109/tmm.2026.3651132,,Structure-Preserving Frequency-Regularized Text-Guided Optimal Transport for Unpaired Rain Streaks and Raindrops Removal,IEEE Transactions on Multimedia,2026,article,generative_ai,3,66.0,66.0,176.9042016806723,66,205.676,True,False,post,structurepreservingfrequencyregularizedtextguidedoptimaltransportforunpairedrainstreaksandraindropsremoval,167.341047204599,landmark,True | ||
| 86 | −4400770292,10.2139/ssrn.4895486,,Generative AI Can Harm Learning,SSRN Electronic Journal,2024,preprint,generative_ai,1,123.0,198.0,174.24635549016986,198,,False,True,post,174.24635549016986,landmark,True | 86 | +4398243313,10.1186/s41239-024-00468-z,,A scoping review on how generative artificial intelligence transforms assessment in higher education,International Journal of Educational Technology in Higher Education,2024,article,generative_ai,1,181.0,463.0,139.39774582546502,463,177.182,True,True,post,ascopingreviewonhowgenerativeartificialintelligencetransformsassessmentinhighereducation,139.39774582546502,landmark,True | ||
| 87 | −7127274868,10.1002/jcal.70198,,Parental AI Investment Behaviours and AI ‐Mediated Informal Digital Learning of English: The Chain Mediating Role of Children's Perceived AI Value and Effort Expectancy for AI,Journal of Computer Assisted Learning,2026,article,generative_ai,1,48.0,48.0,341.0180402336145,48,439.3359,True,False,post,170.6505878075542,landmark,True | 87 | +7127274868,10.1002/jcal.70198,,Parental AI Investment Behaviours and AI ‐Mediated Informal Digital Learning of English: The Chain Mediating Role of Children's Perceived AI Value and Effort Expectancy for AI,Journal of Computer Assisted Learning,2026,article,generative_ai,1,48.0,48.0,341.0180402336145,48,439.3359,True,False,post,parentalaiinvestmentbehavioursandaimediatedinformaldigitallearningofenglishthechainmediatingroleofchildrensperceivedaivalueandeffortexpectancyforai,121.70257978516291,landmark,True | ||
| 88 | −7124974472,10.1287/mnsc.2025.02523,,The Rapid Adoption of Generative AI,Management Science,2026,article,generative_ai,1,42.0,42.0,46.737664339256945,42,151.73,True,False,post,149.31926433160993,landmark,True | 88 | +4406199489,10.3389/bjbs.2024.14048,,Generative AI in Higher Education: Balancing Innovation and Integrity,British Journal of Biomedical Science,2025,article,generative_ai,2,278.0,278.0,241.35986779790812,278,301.5286,True,True,post,generativeaiinhighereducationbalancinginnovationandintegrity,121.47809580913713,landmark,True | ||
| 89 | −7118187240,10.3390/en19010284,,Patch Time Series Transformer−Based Short−Term Photovoltaic Power Prediction Enhanced by Artificial Fish,Energies,2026,article,generative_ai,1,40.0,40.0,44.5120612754828,40,144.5047,True,True,post,142.20882317296181,landmark,True | 89 | +4394934695,10.1016/j.caeai.2024.100221,,The impact of generative AI on higher education learning and teaching: A study of educators’ perspectives,Computers and Education Artificial Intelligence,2024,article,generative_ai,1,207.0,394.0,118.623567721886,394,150.7769,True,True,post,theimpactofgenerativeaionhighereducationlearningandteachingastudyofeducatorsperspectives,118.623567721886,landmark,True | ||
| 90 | −4406199489,10.3389/bjbs.2024.14048,,Generative AI in Higher Education: Balancing Innovation and Integrity,British Journal of Biomedical Science,2025,article,generative_ai,2,278.0,278.0,241.35986779790812,278,301.5286,True,True,post,140.739961655297,landmark,True | 90 | +4409269614,10.3390/info16040296,,Generative AI and Academic Integrity in Higher Education: A Systematic Review and Research Agenda,Information,2025,review,generative_ai,1,271.0,271.0,14.199554069119287,271,53.4431,True,True,post,generativeaiandacademicintegrityinhighereducationasystematicreviewandresearchagenda,118.41929483552576,landmark,True | ||
| 91 | −4398243313,10.1186/s41239-024-00468-z,,A scoping review on how generative artificial intelligence transforms assessment in higher education,International Journal of Educational Technology in Higher Education,2024,article,generative_ai,1,181.0,463.0,139.39774582546502,463,177.182,True,True,post,139.39774582546502,landmark,True | 91 | +4395957952,10.54675/ewzm9535,,Guidance for generative AI in education and research,UNESCO eBooks,2023,book,generative_ai,2,164.0,400.0,116.73200564528776,726,252.3485,False,False,post,guidanceforgenerativeaiineducationandresearch,116.73200564528776,landmark,True | ||
| 92 | −4409269614,10.3390/info16040296,,Generative AI and Academic Integrity in Higher Education: A Systematic Review and Research Agenda,Information,2025,review,generative_ai,1,271.0,271.0,14.199554069119287,271,53.4431,True,True,post,137.19614967117084,landmark,True | 92 | +4394863715,10.2139/ssrn.4759930,,How Generative AI Can Augment Human Creativity,SSRN Electronic Journal,2024,preprint,generative_ai,1,111.0,131.0,114.27954959430369,131,,False,True,post,howgenerativeaicanaugmenthumancreativity,114.27954959430369,landmark,True | ||
| 93 | −3193917007,10.1007/978-1-4842-7341-8_10,,Generative Adversarial Networks,Apress eBooks,2021,book-chapter,generative_ai,3,61.0,195.0,127.1017316017316,255,116.749,True,False,baseline,127.1017316017316,landmark,True | 93 | +4401077562,10.1080/10447318.2024.2383033,,Factors Influencing University Students’ Behavioral Intention to Use Generative Artificial Intelligence: Integrating the Theory of Planned Behavior and AI Literacy,International Journal of Human-Computer Interaction,2024,article,generative_ai,3,172.0,353.0,106.27949087773035,353,135.087,True,False,post,factorsinfluencinguniversitystudentsbehavioralintentiontousegenerativeartificialintelligenceintegratingthetheoryofplannedbehaviorandailiteracy,106.27949087773035,landmark,True | ||
| 94 | −4288099666,10.48550/arxiv.2207.12598,2207.12598,Classifier-Free Diffusion Guidance,arXiv (Cornell University),2022,preprint,generative_ai,3,211.0,575.0,124.81517402920616,731,,True,True,baseline,124.81517402920616,landmark,True | 94 | +7118187240,10.3390/en19010284,,Patch Time Series Transformer−Based Short−Term Photovoltaic Power Prediction Enhanced by Artificial Fish,Energies,2026,article,generative_ai,1,40.0,40.0,44.5120612754828,40,144.5047,True,True,post,patchtimeseriestransformerbasedshorttermphotovoltaicpowerpredictionenhancedbyartificialfish,101.41881648763577,landmark,True | ||
| 95 | −4394934695,10.1016/j.caeai.2024.100221,,The impact of generative AI on higher education learning and teaching: A study of educators’ perspectives,Computers and Education Artificial Intelligence,2024,article,generative_ai,1,207.0,394.0,118.623567721886,394,150.7769,True,True,post,118.623567721886,landmark,True | 95 | +4407778399,10.1186/s41239-025-00507-3,,"Investigating the higher education institutions’ guidelines and policies regarding the use of generative AI in teaching, learning, research, and administration",International Journal of Educational Technology in Higher Education,2025,article,generative_ai,3,213.0,213.0,184.92680518328933,213,232.7014,True,True,post,investigatingthehighereducationinstitutionsguidelinesandpoliciesregardingtheuseofgenerativeaiinteachinglearningresearchandadministration,93.07494391131729,landmark,True | ||
| 96 | −4321648656,10.1163/22134913-bja10078,2302.10913,From Paintbrush to Pixel: A Review of Deep Neural Networks in AI-Generated Art,Art & Perception,2026,article,generative_ai,4,33.0,33.0,88.45210084033614,33,9.3489,True,True,post,117.32227911769351,landmark,True | 96 | +4401917994,10.38124/ijisrt/ijisrt24aug265,,Building Face Ageing Model Using Face Synthesis,International Journal of Innovative Science and Research Technology (IJISRT),2024,article,generative_ai,3,737.0,737.0,87.31165251080317,737,103.9631,True,True,post,buildingfaceageingmodelusingfacesynthesis,87.31165251080317,landmark,True | ||
| 97 | −4395957952,10.54675/ewzm9535,,Guidance for generative AI in education and research,UNESCO eBooks,2023,book,generative_ai,2,164.0,400.0,116.73200564528776,726,252.3485,False,False,post,116.73200564528776,landmark,True | 97 | +4411505840,10.1038/s41598-025-97652-6,,AI tutoring outperforms in-class active learning: an RCT introducing a novel research-based design in an authentic educational setting,Scientific Reports,2025,article,generative_ai,1,196.0,196.0,66.76726514867121,196,81.1441,True,True,post,aitutoringoutperformsinclassactivelearninganrctintroducinganovelresearchbaseddesigninanauthenticeducationalsetting,85.64642726111826,landmark,True | ||
| 98 | −4394863715,10.2139/ssrn.4759930,,How Generative AI Can Augment Human Creativity,SSRN Electronic Journal,2024,preprint,generative_ai,1,111.0,131.0,114.27954959430369,131,,False,True,post,114.27954959430369,landmark,True | 98 | +2804078698,10.48550/arxiv.1805.08318,1805.08318,Self-Attention Generative Adversarial Networks,arXiv (Cornell University),2018,preprint,generative_ai,4,365.0,936.0,85.0107976109918,2327,,True,True,baseline,selfattentiongenerativeadversarialnetworks,85.0107976109918,landmark,True | ||
| 99 | −4407778399,10.1186/s41239-025-00507-3,,"Investigating the higher education institutions’ guidelines and policies regarding the use of generative AI in teaching, learning, research, and administration",International Journal of Educational Technology in Higher Education,2025,article,generative_ai,3,213.0,213.0,184.92680518328933,213,232.7014,True,True,post,107.83313608841102,landmark,True | 99 | +4321648656,10.1163/22134913-bja10078,2302.10913,From Paintbrush to Pixel: A Review of Deep Neural Networks in AI-Generated Art,Art & Perception,2026,article,generative_ai,4,33.0,33.0,88.45210084033614,33,9.3489,True,True,post,frompaintbrushtopixelareviewofdeepneuralnetworksinaigeneratedart,83.6705236022995,landmark,True | ||
| 100 | −7124432017,10.1080/10494820.2026.2615818,,Human-Centric Artificial Intelligence Pedagogy (HCAP) framework developed from TPACK through integration of artificial intelligence literacy and competency,Interactive Learning Environments,2026,article,generative_ai,2,30.0,30.0,213.13627514600907,30,265.4321,True,True,post,106.65661737972137,landmark,True | 100 | +2806351858,10.48550/arxiv.1805.11973,1805.11973,MolGAN: An implicit generative model for small molecular graphs,arXiv (Cornell University),2018,preprint,generative_ai,7,61.0,157.0,83.37167538076835,441,,True,True,baseline,molgananimplicitgenerativemodelforsmallmoleculargraphs,83.37167538076835,landmark,True | ||
| 101 | −7140170686,10.1186/s41239-026-00585-x,,Pedagogical partnerships with generative AI in higher education: how dual cognitive pathways paradoxically enable transformative learning,International Journal of Educational Technology in Higher Education,2026,article,generative_ai,2,30.0,30.0,213.13627514600907,30,274.5849,True,True,post,106.65661737972137,landmark,True | 101 | +4379057711,10.3390/app13116716,,"Exploring the Potential Impact of Artificial Intelligence (AI) on International Students in Higher Education: Generative AI, Chatbots, Analytics, and International Student Success",Applied Sciences,2023,article,generative_ai,2,158.0,352.0,82.50027309715541,461,108.0946,True,True,post,exploringthepotentialimpactofartificialintelligenceaioninternationalstudentsinhighereducationgenerativeaichatbotsanalyticsandinternationalstudentsuccess,82.50027309715541,landmark,True | ||
| 102 | −4406728221,10.1109/access.2025.3532853,,Agentic AI: Autonomous Intelligence for Complex Goals—A Comprehensive Survey,IEEE Access,2025,article,ai_agents,1,694.0,694.0,236.41062251621338,694,288.7899,True,True,post,351.3436452833674,landmark,True | 102 | +4406728221,10.1109/access.2025.3532853,,Agentic AI: Autonomous Intelligence for Complex Goals—A Comprehensive Survey,IEEE Access,2025,article,ai_agents,1,694.0,694.0,236.41062251621338,694,288.7899,True,True,post,agenticaiautonomousintelligenceforcomplexgoalsacomprehensivesurvey,303.25826795518407,landmark,True | ||
| 103 | −7161734976,10.1038/s41586-026-10652-y,,A multi-agent system for automating scientific discovery,Nature,2026,article,ai_agents,3,62.0,62.0,175.0637411130179,62,220.9602,True,True,post,220.42367591809082,landmark,True | 103 | +7161734976,10.1038/s41586-026-10652-y,,A multi-agent system for automating scientific discovery,Nature,2026,article,ai_agents,3,62.0,62.0,175.0637411130179,62,220.9602,True,True,post,amultiagentsystemforautomatingscientificdiscovery,157.19916555583544,landmark,True | ||
| 104 | −7135409568,10.1038/s41746-026-02517-5,,The role of agentic artificial intelligence in healthcare: a scoping review,npj Digital Medicine,2026,article,ai_agents,1,52.0,52.0,23.673009161381255,52,97.7788,True,True,post,184.8714701248504,landmark,True | 104 | +4225355126,10.1007/978-981-19-0493-6_1,,Introduction to Multi-agent Systems,Springer tracts in human-centered computing,2022,book-chapter,ai_agents,1,266.0,268.0,143.62252453934906,287,6.1939,False,False,baseline,introductiontomultiagentsystems,143.62252453934906,landmark,True | ||
| 105 | −7134187809,10.1016/j.isatra.2026.03.010,,Dynamic event-triggered approximate optimal consensus control for unknown nonlinear multi-agent systems via adaptive dynamic programming,ISA Transactions,2026,article,ai_agents,3,46.0,46.0,129.88600147094877,46,163.9382,False,False,post,163.5401466489061,landmark,True | 105 | +7135409568,10.1038/s41746-026-02517-5,,The role of agentic artificial intelligence in healthcare: a scoping review,npj Digital Medicine,2026,article,ai_agents,1,52.0,52.0,23.673009161381255,52,97.7788,True,True,post,theroleofagenticartificialintelligenceinhealthcareascopingreview,131.84446143392648,landmark,True | ||
| 106 | −4390730779,10.1002/widm.70111,2401.03428,"Exploring Large Language Model‐Based Intelligent Agents: Definitions, Methods, and Prospects",Wiley Interdisciplinary Reviews Data Mining and Knowledge Discovery,2026,article,ai_agents,3,44.0,44.0,48.96326740303108,44,32.5136,True,True,post,156.42970549025802,landmark,True | 106 | +4410197190,10.1016/j.array.2025.100399,,The role of agentic AI in shaping a smart future: A systematic review,Array,2025,review,ai_agents,4,267.0,267.0,33.148798521256936,267,36.646,True,True,post,theroleofagenticaiinshapingasmartfutureasystematicreview,116.6714085648907,landmark,True | ||
| 107 | −4225355126,10.1007/978-981-19-0493-6_1,,Introduction to Multi-agent Systems,Springer tracts in human-centered computing,2022,book-chapter,ai_agents,1,266.0,268.0,143.62252453934906,287,6.1939,False,False,baseline,143.62252453934906,landmark,True | 107 | +7134187809,10.1016/j.isatra.2026.03.010,,Dynamic event-triggered approximate optimal consensus control for unknown nonlinear multi-agent systems via adaptive dynamic programming,ISA Transactions,2026,article,ai_agents,3,46.0,46.0,129.88600147094877,46,163.9382,False,False,post,dynamiceventtriggeredapproximateoptimalconsensuscontrolforunknownnonlinearmultiagentsystemsviaadaptivedynamicprogramming,116.63163896078113,landmark,True | ||
| 108 | −4407570917,10.26599/if.2026.9710004,2502.08691,AgentSociety: Large-scale simulation of LLM-driven generative agents advances understanding of human behaviors and society,iFuture,2026,article,ai_agents,2,40.0,40.0,44.5120612754828,40,126.4417,True,True,post,142.20882317296181,landmark,True | 108 | +4413427262,10.1016/j.inffus.2025.103599,2505.10468,"AI Agents vs. Agentic AI: A Conceptual taxonomy, applications and challenges",Information Fusion,2025,article,ai_agents,8,258.0,258.0,87.88752249161823,258,107.36,True,True,post,aiagentsvsagenticaiaconceptualtaxonomyapplicationsandchallenges,112.7386644559618,landmark,True | ||
| 109 | −4410197190,10.1016/j.array.2025.100399,,The role of agentic AI in shaping a smart future: A systematic review,Array,2025,review,ai_agents,4,267.0,267.0,33.148798521256936,267,36.646,True,True,post,135.17111425167016,landmark,True | 109 | +4390730779,10.1002/widm.70111,2401.03428,"Exploring Large Language Model‐Based Intelligent Agents: Definitions, Methods, and Prospects",Wiley Interdisciplinary Reviews Data Mining and Knowledge Discovery,2026,article,ai_agents,3,44.0,44.0,48.96326740303108,44,32.5136,True,True,post,exploringlargelanguagemodelbasedintelligentagentsdefinitionsmethodsandprospects,111.56069813639934,landmark,True | ||
| 110 | −4413427262,10.1016/j.inffus.2025.103599,2505.10468,"AI Agents vs. Agentic AI: A Conceptual taxonomy, applications and challenges",Information Fusion,2025,article,ai_agents,8,258.0,258.0,87.88752249161823,258,107.36,True,True,post,130.61478455779363,landmark,True | 110 | +4401023556,10.24963/ijcai.2024/890,,Large Language Model Based Multi-agents: A Survey of Progress and Challenges,,2024,conference-paper,ai_agents,4,231.0,371.0,103.12387591961277,302,91.8723,True,True,post,largelanguagemodelbasedmultiagentsasurveyofprogressandchallenges,103.12387591961277,landmark,True | ||
| 111 | −4414991289,10.1039/d5sc09921h,2508.13251,“DIVE” into hydrogen storage materials discovery with AI agents,Chemical Science,2026,article,ai_agents,3,31.0,31.0,23.90492957746479,31,43.4978,True,True,post,110.21183795904541,landmark,True | 111 | +4407570917,10.26599/if.2026.9710004,2502.08691,AgentSociety: Large-scale simulation of LLM-driven generative agents advances understanding of human behaviors and society,iFuture,2026,article,ai_agents,2,40.0,40.0,44.5120612754828,40,126.4417,True,True,post,agentsocietylargescalesimulationofllmdrivengenerativeagentsadvancesunderstandingofhumanbehaviorsandsociety,101.41881648763577,landmark,True | ||
| 112 | −7122857583,10.1007/s10462-025-11458-6,,"Agentic AI systems in the age of generative models: architectures, cloud scalability, and real-world applications",Artificial Intelligence Review,2026,article,ai_agents,7,30.0,30.0,33.384045956612105,30,108.3786,True,True,post,106.65661737972137,landmark,True | 112 | +4414023998,10.3390/fi17090404,,"The Rise of Agentic AI: A Review of Definitions, Frameworks, Architectures, Applications, Evaluation Metrics, and Challenges",Future Internet,2025,article,ai_agents,3,189.0,189.0,64.3827199647901,189,78.6474,True,True,post,theriseofagenticaiareviewofdefinitionsframeworksarchitecturesapplicationsevaluationmetricsandchallenges,82.5876262875069,landmark,True | ||
| 113 | −4401023556,10.24963/ijcai.2024/890,,Large Language Model Based Multi-agents: A Survey of Progress and Challenges,,2024,conference-paper,ai_agents,4,231.0,371.0,103.12387591961277,302,91.8723,True,True,post,103.12387591961277,landmark,True | 113 | +4414991289,10.1039/d5sc09921h,2508.13251,“DIVE” into hydrogen storage materials discovery with AI agents,Chemical Science,2026,article,ai_agents,3,31.0,31.0,23.90492957746479,31,43.4978,True,True,post,diveintohydrogenstoragematerialsdiscoverywithaiagents,78.59958277791772,landmark,True | ||
| 114 | −4414023998,10.3390/fi17090404,,"The Rise of Agentic AI: A Review of Definitions, Frameworks, Architectures, Applications, Evaluation Metrics, and Challenges",Future Internet,2025,article,ai_agents,3,189.0,189.0,64.3827199647901,189,78.6474,True,True,post,95.68292357140696,landmark,True | 114 | +7122857583,10.1007/s10462-025-11458-6,,"Agentic AI systems in the age of generative models: architectures, cloud scalability, and real-world applications",Artificial Intelligence Review,2026,article,ai_agents,7,30.0,30.0,33.384045956612105,30,108.3786,True,True,post,agenticaisystemsintheageofgenerativemodelsarchitecturescloudscalabilityandrealworldapplications,76.06411236572681,landmark,True | ||
| 115 | −7118083939,10.1007/s12525-025-00861-0,,Agentic information systems,Electronic Markets,2026,article,ai_agents,1,26.0,26.0,32.66095238095238,26,314.5617,True,True,post,92.4357350624252,landmark,True | 115 | +4390638955,10.1007/s40692-023-00304-9,,Artificial intelligence (AI) learning tools in K-12 education: A scoping review,Journal of Computers in Education,2024,article,ai_agents,1,146.0,240.0,72.25801079505747,240,91.8438,True,True,post,artificialintelligenceailearningtoolsink12educationascopingreview,72.25801079505747,landmark,True | ||
| 116 | −4412505619,10.70777/si.v2i3.15161,,"AI Agents vs. Agentic AI: A Conceptual Taxonomy, Applications and Challenges",SuperIntelligence - Robotics - Safety & Alignment,2025,article,ai_agents,6,181.0,181.0,61.65752546892597,181,75.3184,True,True,post,91.63285273240561,landmark,True | 116 | +4416209823,10.1007/s10462-025-11422-4,2510.25445,"Agentic AI: a comprehensive survey of architectures, applications, and future directions",Artificial Intelligence Review,2025,article,ai_agents,4,165.0,165.0,56.20713647719771,165,68.6604,True,True,post,agenticaiacomprehensivesurveyofarchitecturesapplicationsandfuturedirections,72.1003086636965,landmark,True | ||
| 117 | −4416209823,10.1007/s10462-025-11422-4,2510.25445,"Agentic AI: a comprehensive survey of architectures, applications, and future directions",Artificial Intelligence Review,2025,article,ai_agents,4,165.0,165.0,56.20713647719771,165,68.6604,True,True,post,83.53271105440291,landmark,True | 117 | +4399982941,10.5821/dissertation-2117-410409,,Value engineering for autonomous agents,,2024,dissertation,ai_agents,2,7.0,8.0,68.17851239669422,1,,True,True,post,valueengineeringforautonomousagents,68.17851239669422,landmark,True | ||
| 118 | −7155930820,10.1109/tase.2026.3686874,,Adaptive Prescribed Performance Secure Consensus Control for High-Order Constrained Multi-Agent Systems With Time-Varying Powers and Arbitrary Initial States,IEEE Transactions on Automation Science and Engineering,2026,article,ai_agents,2,23.0,23.0,80.74592420071988,23,96.3814,False,False,post,81.77007332445305,landmark,True | 118 | +4412709685,10.1038/s41586-025-09442-9,,The Virtual Lab of AI agents designs new SARS-CoV-2 nanobodies,Nature,2025,article,ai_agents,2,150.0,150.0,33.53365384615385,150,107.0846,False,False,post,thevirtuallabofaiagentsdesignsnewsarscov2nanobodies,65.545735148815,landmark,True | ||
| 119 | −7162257503,10.1016/j.ejcon.2026.101534,,Predefined-time sliding-mode formation control for second-order nonlinear multi-agent systems under deception attacks,European Journal of Control,2026,article,ai_agents,1,22.0,22.0,77.23523184416683,22,92.1909,False,False,post,78.21485274512901,landmark,True | 119 | +4412203333,10.1145/3748302,2404.13501,A Survey on the Memory Mechanism of Large Language Model-based Agents,ACM Transactions on Information Systems,2025,article,ai_agents,4,139.0,139.0,47.35025436563928,139,56.1767,True,True,post,asurveyonthememorymechanismoflargelanguagemodelbasedagents,60.739047904568565,landmark,True | ||
| 120 | −4412709685,10.1038/s41586-025-09442-9,,The Virtual Lab of AI agents designs new SARS-CoV-2 nanobodies,Nature,2025,article,ai_agents,2,150.0,150.0,33.53365384615385,150,107.0846,False,False,post,75.93882823127537,landmark,True | 120 | +2144462863,10.5555/2343576.2343653,2410.10004,Crowd IQ -- Aggregating Opinions to Boost Performance,arXiv (Cornell University),2024,preprint,ai_agents,2,52.0,52.0,60.60850111856823,52,,True,True,post,crowdiqaggregatingopinionstoboostperformance,60.60850111856823,landmark,True | ||
| 121 | −7128165235,10.1007/s12525-025-00862-z,,Multi-agent AI,Electronic Markets,2026,article,ai_agents,2,21.0,21.0,23.368832169628472,21,75.865,True,True,post,74.65963216580496,landmark,True | 121 | +7155930820,10.1109/tase.2026.3686874,,Adaptive Prescribed Performance Secure Consensus Control for High-Order Constrained Multi-Agent Systems With Time-Varying Powers and Arbitrary Initial States,IEEE Transactions on Automation Science and Engineering,2026,article,ai_agents,2,23.0,23.0,80.74592420071988,23,96.3814,False,False,post,adaptiveprescribedperformancesecureconsensuscontrolforhighorderconstrainedmultiagentsystemswithtimevaryingpowersandarbitraryinitialstates,58.315819480390566,landmark,True | ||
| 122 | −7118190454,10.1109/ojcs.2026.3650842,2507.14912,Redefining Elderly Care With Agentic AI: Challenges and Opportunities,IEEE Open Journal of the Computer Society,2026,article,ai_agents,4,21.0,21.0,22.217391304347824,21,315.9642,True,True,post,74.65963216580496,landmark,True | 122 | +4378505261,10.48550/arxiv.2305.16291,2305.16291,Voyager: An Open-Ended Embodied Agent with Large Language Models,arXiv (Cornell University),2023,preprint,ai_agents,6,118.0,171.0,56.852813926843034,187,,True,True,post,voyageranopenendedembodiedagentwithlargelanguagemodels,56.852813926843034,landmark,True | ||
| 123 | −7130481397,10.1038/s41746-026-02443-6,,Benchmarking large language model-based agent systems for clinical decision tasks,npj Digital Medicine,2026,article,ai_agents,3,21.0,21.0,9.560253699788584,21,39.4876,True,True,post,74.65963216580496,landmark,True | 123 | +7162257503,10.1016/j.ejcon.2026.101534,,Predefined-time sliding-mode formation control for second-order nonlinear multi-agent systems under deception attacks,European Journal of Control,2026,article,ai_agents,1,22.0,22.0,77.23523184416683,22,92.1909,False,False,post,predefinedtimeslidingmodeformationcontrolforsecondordernonlinearmultiagentsystemsunderdeceptionattacks,55.78034906819967,landmark,True | ||
| 124 | −4390638955,10.1007/s40692-023-00304-9,,Artificial intelligence (AI) learning tools in K-12 education: A scoping review,Journal of Computers in Education,2024,article,ai_agents,1,146.0,240.0,72.25801079505747,240,91.8438,True,True,post,72.25801079505747,landmark,True | 124 | +7130481397,10.1038/s41746-026-02443-6,,Benchmarking large language model-based agent systems for clinical decision tasks,npj Digital Medicine,2026,article,ai_agents,3,21.0,21.0,9.560253699788584,21,39.4876,True,True,post,benchmarkinglargelanguagemodelbasedagentsystemsforclinicaldecisiontasks,53.24487865600877,landmark,True | ||
| 125 | −4412203333,10.1145/3748302,2404.13501,A Survey on the Memory Mechanism of Large Language Model-based Agents,ACM Transactions on Information Systems,2025,article,ai_agents,4,139.0,139.0,47.35025436563928,139,56.1767,True,True,post,70.3699808276485,landmark,True | 125 | +7118190454,10.1109/ojcs.2026.3650842,2507.14912,Redefining Elderly Care With Agentic AI: Challenges and Opportunities,IEEE Open Journal of the Computer Society,2026,article,ai_agents,4,21.0,21.0,22.217391304347824,21,315.9642,True,True,post,redefiningelderlycarewithagenticaichallengesandopportunities,53.24487865600877,landmark,True | ||
| 126 | −4399982941,10.5821/dissertation-2117-410409,,Value engineering for autonomous agents,,2024,dissertation,ai_agents,2,7.0,8.0,68.17851239669422,1,,True,True,post,68.17851239669422,landmark,True | 126 | +2306711933,10.26190/unsworks/21510,,Discovering hierarchy in reinforcement learning,"UNSWorks (University of New South Wales, Sydney, Australia)",2022,dissertation,ai_agents,4,7.0,7.0,52.423245614035096,14,,True,True,baseline,discoveringhierarchyinreinforcementlearning,52.423245614035096,landmark,True | ||
| 127 | −2911283634,10.1515/9783110595567-011,,10. Reinforcement learning,De Gruyter eBooks,2020,book-chapter,reinforcement_learning,2,524.0,532.0,276.02730780647073,1930,32.1901,False,False,baseline,276.02730780647073,landmark,True | 127 | +4389473504,10.23860/diss-li-hepfeng-2023,,TRUST-REGION BASED POLICY OPTIMIZATION FOR EFFICIENT REINFORCEMENT LEARNING,,2023,dissertation,reinforcement_learning,5,16.0,28.0,232.91170431211498,32,,True,True,post,trustregionbasedpolicyoptimizationforefficientreinforcementlearning,232.91170431211498,landmark,True | ||
| 128 | −4389473504,10.23860/diss-li-hepfeng-2023,,TRUST-REGION BASED POLICY OPTIMIZATION FOR EFFICIENT REINFORCEMENT LEARNING,,2023,dissertation,reinforcement_learning,5,16.0,28.0,232.91170431211498,32,,True,True,post,232.91170431211498,landmark,True | 128 | +2098774185,10.1184/r1/6555512,,Maximum Entropy Inverse Reinforcement Learning,,2018,article,reinforcement_learning,3,780.0,1077.0,203.27785769359127,1869,147.1091,True,True,baseline,maximumentropyinversereinforcementlearning,203.27785769359127,landmark,True | ||
| 129 | −2964083594,10.57702/mspz8fly,1808.04355,Large-Scale Study of Curiosity-Driven Learning,Edinburgh Research Explorer (University of Edinburgh),2025,conference-paper,reinforcement_learning,7,414.0,414.0,367.9480320163706,75,0.0,True,True,baseline,209.59116591832003,landmark,True | 129 | +2964083594,10.57702/mspz8fly,1808.04355,Large-Scale Study of Curiosity-Driven Learning,Edinburgh Research Explorer (University of Edinburgh),2025,conference-paper,reinforcement_learning,7,414.0,414.0,367.9480320163706,75,0.0,True,True,baseline,largescalestudyofcuriositydrivenlearning,180.9062290107294,landmark,True | ||
| 130 | −2098774185,10.1184/r1/6555512,,Maximum Entropy Inverse Reinforcement Learning,,2018,article,reinforcement_learning,3,780.0,1077.0,203.27785769359127,1869,147.1091,True,True,baseline,203.27785769359127,landmark,True | 130 | +2991046523,10.1007/978-3-030-60990-0_12,1911.10635,Multi-Agent Reinforcement Learning: A Selective Overview of Theories and Algorithms,"Studies in systems, decision and control",2021,book-chapter,reinforcement_learning,3,348.0,530.0,178.44967189838442,1264,321.3096,False,True,baseline,multiagentreinforcementlearningaselectiveoverviewoftheoriesandalgorithms,178.44967189838442,landmark,True | ||
| 131 | −1591675293,10.1017/9781009449441.027,,Bayesian Inverse Reinforcement Learning,Cambridge University Press eBooks,2025,book-chapter,reinforcement_learning,3,395.0,395.0,664.9588792863116,444,16.8612,True,False,post,199.9722476756918,landmark,True | 131 | +1591675293,10.1017/9781009449441.027,,Bayesian Inverse Reinforcement Learning,Cambridge University Press eBooks,2025,book-chapter,reinforcement_learning,3,395.0,395.0,664.9588792863116,444,16.8612,True,False,post,bayesianinversereinforcementlearning,172.60376922521283,landmark,True | ||
| 132 | −7123365826,10.1109/tce.2026.3652706,,Event-Triggered Zero-Sum Game for Input Saturated Nonlinear Systems With State Constraints,IEEE Transactions on Consumer Electronics,2026,article,reinforcement_learning,3,55.0,55.0,155.29848001961267,55,196.0131,True,False,post,195.53713186282252,landmark,True | 132 | +2973229164,10.32657/10356/90191,,Continuous control for robot based on deep reinforcement learning,,2019,dissertation,reinforcement_learning,2,5.0,47.0,171.15412186379928,951,,True,True,baseline,continuouscontrolforrobotbasedondeepreinforcementlearning,171.15412186379928,landmark,True | ||
| 133 | −2991046523,10.1007/978-3-030-60990-0_12,1911.10635,Multi-Agent Reinforcement Learning: A Selective Overview of Theories and Algorithms,"Studies in systems, decision and control",2021,book-chapter,reinforcement_learning,3,348.0,530.0,178.44967189838442,1264,321.3096,False,True,baseline,178.44967189838442,landmark,True | 133 | +2982316857,10.1038/s41586-019-1724-z,,Grandmaster level in StarCraft II using multi-agent reinforcement learning,Nature,2019,article,reinforcement_learning,2,403.0,1021.0,155.2486170001325,3422,181.8864,False,False,baseline,grandmasterlevelinstarcraftiiusingmultiagentreinforcementlearning,155.2486170001325,landmark,True | ||
| 134 | −2973229164,10.32657/10356/90191,,Continuous control for robot based on deep reinforcement learning,,2019,dissertation,reinforcement_learning,2,5.0,47.0,171.15412186379928,951,,True,True,baseline,171.15412186379928,landmark,True | 134 | +7123365826,10.1109/tce.2026.3652706,,Event-Triggered Zero-Sum Game for Input Saturated Nonlinear Systems With State Constraints,IEEE Transactions on Consumer Electronics,2026,article,reinforcement_learning,3,55.0,55.0,155.29848001961267,55,196.0131,True,False,post,eventtriggeredzerosumgameforinputsaturatednonlinearsystemswithstateconstraints,139.45087267049917,landmark,True | ||
| 135 | −2982316857,10.1038/s41586-019-1724-z,,Grandmaster level in StarCraft II using multi-agent reinforcement learning,Nature,2019,article,reinforcement_learning,2,403.0,1021.0,155.2486170001325,3422,181.8864,False,False,baseline,155.2486170001325,landmark,True | 135 | +2902907165,10.1126/science.aar6404,,"A general reinforcement learning algorithm that masters chess, shogi, and Go through self-play",Science,2018,article,reinforcement_learning,3,271.0,733.0,138.34973973017864,3551,180.9159,True,True,baseline,ageneralreinforcementlearningalgorithmthatmasterschessshogiandgothroughselfplay,138.34973973017864,landmark,True | ||
| 136 | −2902907165,10.1126/science.aar6404,,"A general reinforcement learning algorithm that masters chess, shogi, and Go through self-play",Science,2018,article,reinforcement_learning,3,271.0,733.0,138.34973973017864,3551,180.9159,True,True,baseline,138.34973973017864,landmark,True | 136 | +7133226216,10.52202/068431-1787,2103.01955,The Surprising Effectiveness of PPO in Cooperative Multi-Agent Games,neural information processing systems,2022,conference-paper,reinforcement_learning,5,259.0,482.0,95.76250774959783,1027,87.4682,True,True,baseline,thesurprisingeffectivenessofppoincooperativemultiagentgames,95.76250774959783,landmark,True | ||
| 137 | −7133481537,10.1016/j.neucom.2026.133224,,Filter-based predefined-time optimal fault-tolerant consensus control for nonlinear multi-agent systems via reinforcement learning,Neurocomputing,2026,article,reinforcement_learning,3,35.0,35.0,122.87423247935634,35,146.6674,False,False,post,124.4327202763416,landmark,True | 137 | +3041807988,10.1007/s42438-020-00164-x,,Post-Covid-19 Education and Education Technology ‘Solutionism’: a Seller’s Market,Postdigital Science and Education,2020,article,reinforcement_learning,1,148.0,322.0,93.76380474425054,594,104.1384,True,True,baseline,postcovid19educationandeducationtechnologysolutionismasellersmarket,93.76380474425054,landmark,True | ||
| 138 | −7133226216,10.52202/068431-1787,2103.01955,The Surprising Effectiveness of PPO in Cooperative Multi-Agent Games,neural information processing systems,2022,conference-paper,reinforcement_learning,5,259.0,482.0,95.76250774959783,1027,87.4682,True,True,baseline,95.76250774959783,landmark,True | 138 | +2781726626,10.48550/arxiv.1801.01290,1801.01290,Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actor,arXiv (Cornell University),2018,preprint,reinforcement_learning,4,254.0,775.0,90.80433444998975,3598,,True,True,baseline,softactorcriticoffpolicymaximumentropydeepreinforcementlearningwithastochasticactor,90.80433444998975,landmark,True | ||
| 139 | −3041807988,10.1007/s42438-020-00164-x,,Post-Covid-19 Education and Education Technology ‘Solutionism’: a Seller’s Market,Postdigital Science and Education,2020,article,reinforcement_learning,1,148.0,322.0,93.76380474425054,594,104.1384,True,True,baseline,93.76380474425054,landmark,True | 139 | +2963923407,,1802.09477,Addressing Function Approximation Error in Actor-Critic Methods,UvA-DARE (University of Amsterdam),2018,article,reinforcement_learning,4,131.0,472.0,89.08741767072895,362,45.5472,True,True,baseline,addressingfunctionapproximationerrorinactorcriticmethods,89.08741767072895,landmark,True | ||
| 140 | −2781726626,10.48550/arxiv.1801.01290,1801.01290,Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actor,arXiv (Cornell University),2018,preprint,reinforcement_learning,4,254.0,775.0,90.80433444998975,3598,,True,True,baseline,90.80433444998975,landmark,True | 140 | +7133481537,10.1016/j.neucom.2026.133224,,Filter-based predefined-time optimal fault-tolerant consensus control for nonlinear multi-agent systems via reinforcement learning,Neurocomputing,2026,article,reinforcement_learning,3,35.0,35.0,122.87423247935634,35,146.6674,False,False,post,filterbasedpredefinedtimeoptimalfaulttolerantconsensuscontrolfornonlinearmultiagentsystemsviareinforcementlearning,88.74146442668129,landmark,True | ||
| 141 | −2963923407,,1802.09477,Addressing Function Approximation Error in Actor-Critic Methods,UvA-DARE (University of Amsterdam),2018,article,reinforcement_learning,4,131.0,472.0,89.08741767072895,362,45.5472,True,True,baseline,89.08741767072895,landmark,True | 141 | +2899138465,,,Learning to Learn with Gradients,ProQuest Demo Repository,2018,dissertation,reinforcement_learning,3,8.0,20.0,88.61723446893788,51,,True,False,baseline,learningtolearnwithgradients,88.61723446893788,landmark,True | ||
| 142 | −7122543576,10.1002/rnc.70380,,SMS‐Based Event‐Triggered Fault Tolerant Control of Nonlinear Systems Using Adaptive Dynamic Programming,International Journal of Robust and Nonlinear Control,2026,article,reinforcement_learning,6,25.0,25.0,70.59021819073303,25,89.0969,True,False,post,88.88051448310114,landmark,True | 142 | +4391631327,10.48550/arxiv.2402.03300,2402.03300,Axiom-World: A Pre-Registered Study of Two-Stage Post-Training for Rule-Grounded Planning in a Verifiable Toy World,arXiv (Cornell University),2024,preprint,reinforcement_learning,9,52.0,99.0,86.3639344262295,99,,True,True,post,axiomworldapreregisteredstudyoftwostageposttrainingforrulegroundedplanninginaverifiabletoyworld,86.3639344262295,landmark,True | ||
| 143 | −2899138465,,,Learning to Learn with Gradients,ProQuest Demo Repository,2018,dissertation,reinforcement_learning,3,8.0,20.0,88.61723446893788,51,,True,False,baseline,88.61723446893788,landmark,True | 143 | +2895974005,,,Exploration and Exploitation in Reinforcement Learning,KTH Publication Database DiVA (KTH Royal Institute of Technology),2018,dissertation,reinforcement_learning,3,14.0,18.0,79.75551102204409,45,,True,True,baseline,explorationandexploitationinreinforcementlearning,79.75551102204409,landmark,True | ||
| 144 | −4391631327,10.48550/arxiv.2402.03300,2402.03300,Axiom-World: A Pre-Registered Study of Two-Stage Post-Training for Rule-Grounded Planning in a Verifiable Toy World,arXiv (Cornell University),2024,preprint,reinforcement_learning,9,52.0,99.0,86.3639344262295,99,,True,True,post,86.3639344262295,landmark,True | 144 | +4409147637,10.1038/s41586-025-08744-2,,Mastering diverse control tasks through world models,Nature,2025,article,reinforcement_learning,2,170.0,170.0,57.91038303711279,170,70.7411,True,True,post,masteringdiversecontroltasksthroughworldmodels,74.28516650199033,landmark,True | ||
| 145 | −4409147637,10.1038/s41586-025-08744-2,,Mastering diverse control tasks through world models,Nature,2025,article,reinforcement_learning,2,170.0,170.0,57.91038303711279,170,70.7411,True,True,post,86.06400532877875,landmark,True | 145 | +2754517384,10.1609/aaai.v32i1.11694,1709.06560,Deep Reinforcement Learning That Matters,Proceedings of the AAAI Conference on Artificial Intelligence,2018,conference-paper,reinforcement_learning,3,261.0,452.0,69.98997654610542,1579,68.6606,True,True,baseline,deepreinforcementlearningthatmatters,69.98997654610542,landmark,True | ||
| 146 | −2895974005,,,Exploration and Exploitation in Reinforcement Learning,KTH Publication Database DiVA (KTH Royal Institute of Technology),2018,dissertation,reinforcement_learning,3,14.0,18.0,79.75551102204409,45,,True,True,baseline,79.75551102204409,landmark,True | 146 | +2761873684,10.1609/aaai.v32i1.11796,,Rainbow: Combining Improvements in Deep Reinforcement Learning,Proceedings of the AAAI Conference on Artificial Intelligence,2018,conference-paper,reinforcement_learning,1,240.0,442.0,68.44152573756327,1772,72.3017,True,True,baseline,rainbowcombiningimprovementsindeepreinforcementlearning,68.44152573756327,landmark,True | ||
| 147 | −7134057781,10.1038/s41598-026-42615-8,,A fuzzy-TD3 hybrid reinforcement learning framework for robust trajectory tracking of the Mitsubishi RV-2AJ robotic arm,Scientific Reports,2026,article,reinforcement_learning,3,21.0,21.0,23.368832169628472,21,75.865,True,True,post,74.65963216580496,landmark,True | 147 | +7133208539,10.52202/075280-2338,,Direct Preference Optimization: Your Language Model is Secretly a Reward Model,neural information processing systems,2023,conference-paper,reinforcement_learning,3,111.0,293.0,67.57117047961324,474,89.6019,False,False,post,directpreferenceoptimizationyourlanguagemodelissecretlyarewardmodel,67.57117047961324,landmark,True | ||
| 148 | −2754517384,10.1609/aaai.v32i1.11694,1709.06560,Deep Reinforcement Learning That Matters,Proceedings of the AAAI Conference on Artificial Intelligence,2018,conference-paper,reinforcement_learning,3,261.0,452.0,69.98997654610542,1579,68.6606,True,True,baseline,69.98997654610542,landmark,True | 148 | +4327734444,10.5204/thesis.eprints.238632,,Leveraging control priors in deep reinforcement learning for robotics,Queensland University of Technology,2023,dissertation,reinforcement_learning,2,5.0,8.0,66.54620123203286,9,,True,True,post,leveragingcontrolpriorsindeepreinforcementlearningforrobotics,66.54620123203286,landmark,True | ||
| 149 | −2761873684,10.1609/aaai.v32i1.11796,,Rainbow: Combining Improvements in Deep Reinforcement Learning,Proceedings of the AAAI Conference on Artificial Intelligence,2018,conference-paper,reinforcement_learning,1,240.0,442.0,68.44152573756327,1772,72.3017,True,True,baseline,68.44152573756327,landmark,True | 149 | +4383112908,10.1109/tpami.2023.3292075,2009.07888,Transfer Learning in Deep Reinforcement Learning: A Survey,IEEE Transactions on Pattern Analysis and Machine Intelligence,2023,article,reinforcement_learning,6,398.0,716.0,65.732229267823,846,67.6448,True,True,post,transferlearningindeepreinforcementlearningasurvey,65.732229267823,landmark,True | ||
| 150 | −7133208539,10.52202/075280-2338,,Direct Preference Optimization: Your Language Model is Secretly a Reward Model,neural information processing systems,2023,conference-paper,reinforcement_learning,3,111.0,293.0,67.57117047961324,474,89.6019,False,False,post,67.57117047961324,landmark,True | 150 | +7122543576,10.1002/rnc.70380,,SMS‐Based Event‐Triggered Fault Tolerant Control of Nonlinear Systems Using Adaptive Dynamic Programming,International Journal of Robust and Nonlinear Control,2026,article,reinforcement_learning,6,25.0,25.0,70.59021819073303,25,89.0969,True,False,post,smsbasedeventtriggeredfaulttolerantcontrolofnonlinearsystemsusingadaptivedynamicprogramming,63.38676030477235,landmark,True | ||
| 151 | −7128436456,10.1016/j.arcontrol.2026.101045,2502.02133,Synthesis of model predictive control and reinforcement learning: Survey and classification,Annual Reviews in Control,2026,article,reinforcement_learning,3,19.0,19.0,21.046639004149377,19,47.2579,True,True,post,67.54919100715686,landmark,True | 151 | +2742132707,10.26153/tsw/13849,,Curriculum learning in reinforcement learning,Texas Digital Library (University of Texas),2021,dissertation,reinforcement_learning,4,13.0,13.0,59.128571428571426,13,,True,True,baseline,curriculumlearninginreinforcementlearning,59.128571428571426,landmark,True | ||
| 152 | −2962862931,10.4230/oasics.dx.2024.27,,On a Method to Measure Supervised Multiclass Model’s Interpretability: Application to Degradation Diagnosis (Short Paper),HAL (Le Centre pour la Communication Scientifique Directe),2024,conference-paper,ml_theory,1,11888.0,12586.0,3498.428847235165,12586,1941.7911,True,True,post,3498.428847235165,landmark,True | 152 | +2962862931,10.4230/oasics.dx.2024.27,,On a Method to Measure Supervised Multiclass Model’s Interpretability: Application to Degradation Diagnosis (Short Paper),HAL (Le Centre pour la Communication Scientifique Directe),2024,conference-paper,ml_theory,1,11888.0,12586.0,3498.428847235165,12586,1941.7911,True,True,post,onamethodtomeasuresupervisedmulticlassmodelsinterpretabilityapplicationtodegradationdiagnosisshortpaper,3498.428847235165,landmark,True | ||
| 153 | −1698155719,10.1017/9781108564175.026,,Support Vector Machines,Cambridge University Press eBooks,2020,book-chapter,ml_theory,2,1184.0,1212.0,971.6935447844538,1401,239.6315,True,False,baseline,971.6935447844538,landmark,True | 153 | +46659105,10.4230/lipics.esem.2026.21,2010.16061,"Evaluation: from precision, recall and F-measure to ROC, informedness, markedness and correlation",arXiv (Cornell University),2020,preprint,ml_theory,4,3748.0,3906.0,608.1723816912336,4311,,True,True,baseline,evaluationfromprecisionrecallandfmeasuretorocinformednessmarkednessandcorrelation,608.1723816912336,landmark,True | ||
| 154 | −4288283362,10.5281/zenodo.20632938,,Spiral Time: A Geometric Reframing of Temporal Structure and Its Applications in Machine Learning,,2026,article,ml_theory,3,174.0,174.0,576.9349593495934,174,17.3333,True,True,post,618.608380802384,landmark,True | 154 | +4288283362,10.5281/zenodo.20632938,,Spiral Time: A Geometric Reframing of Temporal Structure and Its Applications in Machine Learning,,2026,article,ml_theory,3,174.0,174.0,576.9349593495934,174,17.3333,True,True,post,spiraltimeageometricreframingoftemporalstructureanditsapplicationsinmachinelearning,441.17185172121555,landmark,True | ||
| 155 | −46659105,10.4230/lipics.esem.2026.21,2010.16061,"Evaluation: from precision, recall and F-measure to ROC, informedness, markedness and correlation",arXiv (Cornell University),2020,preprint,ml_theory,4,3748.0,3906.0,608.1723816912336,4311,,True,True,baseline,608.1723816912336,landmark,True | 155 | +1568555062,10.1145/3501714.3501732,,Equivalence and Synthesis of Causal Models,ACM eBooks,2022,book-chapter,ml_theory,1,557.0,576.0,308.68124677113826,964,48.0029,True,False,baseline,equivalenceandsynthesisofcausalmodels,308.68124677113826,landmark,True | ||
| 156 | −3145506661,10.1007/978-3-030-10546-4_1,,Introduction to Machine Learning,Springer briefs in electrical and computer engineering,2019,book-chapter,ml_theory,2,1164.0,1581.0,491.7969737509803,1594,403.288,False,False,baseline,491.7969737509803,landmark,True | 156 | +2100415632,10.48550/arxiv.2604.24555,2604.24555,Efficient learning by implicit exploration in bandit problems with side observations,arXiv (Cornell University),2026,preprint,ml_theory,3,116.0,116.0,667.5471698113207,116,,True,True,post,efficientlearningbyimplicitexplorationinbanditproblemswithsideobservations,294.1145678141437,landmark,True | ||
| 157 | −2291445757,10.1017/9781009006767.012,,Support Vector Regression,Cambridge University Press eBooks,2024,book-chapter,ml_theory,2,769.0,769.0,426.8477591694058,809,0.6804,True,False,post,426.8477591694058,landmark,True | 157 | +3208688400,10.1007/978-981-16-2102-4_36,,Anomaly Detection: A Survey,Lecture notes in networks and systems,2021,book-chapter,ml_theory,1,734.0,833.0,280.4690126251966,958,168.1579,False,False,baseline,anomalydetectionasurvey,280.4690126251966,landmark,True | ||
| 158 | −2100415632,10.48550/arxiv.2604.24555,2604.24555,Efficient learning by implicit exploration in bandit problems with side observations,arXiv (Cornell University),2026,preprint,ml_theory,3,116.0,116.0,667.5471698113207,116,,True,True,post,412.4055872015893,landmark,True | 158 | +3105488314,,,Risk bounds for statistical learning,FreiDok plus (Universitätsbibliothek Freiburg),2020,dissertation,ml_theory,1,50.0,59.0,272.44754218635364,96,,False,False,baseline,riskboundsforstatisticallearning,272.44754218635364,landmark,True | ||
| 159 | −1568555062,10.1145/3501714.3501732,,Equivalence and Synthesis of Causal Models,ACM eBooks,2022,book-chapter,ml_theory,1,557.0,576.0,308.68124677113826,964,48.0029,True,False,baseline,308.68124677113826,landmark,True | 159 | +2945976633,10.1038/s42256-019-0048-x,1811.10154,Stop explaining black box machine learning models for high stakes decisions and use interpretable models instead,Nature Machine Intelligence,2019,article,ml_theory,2,620.0,1556.0,236.59828408639194,10272,292.6299,False,True,baseline,stopexplainingblackboxmachinelearningmodelsforhighstakesdecisionsanduseinterpretablemodelsinstead,236.59828408639194,landmark,True | ||
| 160 | −2751318774,10.1142/9789811201967_0001,,Introduction to Machine Learning,Series in machine perception and artificial intelligence,2019,book-chapter,ml_theory,6,932.0,978.0,304.22355491996126,1639,51.9116,True,False,baseline,304.22355491996126,landmark,True | 160 | +4400823820,10.58496/bjml/2024/007,,Random Forest Algorithm Overview,Babylonian Journal of Machine Learning,2024,article,ml_theory,1,353.0,782.0,235.4406851738956,782,299.2578,True,True,post,randomforestalgorithmoverview,235.4406851738956,landmark,True | ||
| 161 | −3208688400,10.1007/978-981-16-2102-4_36,,Anomaly Detection: A Survey,Lecture notes in networks and systems,2021,book-chapter,ml_theory,1,734.0,833.0,280.4690126251966,958,168.1579,False,False,baseline,280.4690126251966,landmark,True | 161 | +2999309192,10.1186/s12864-019-6413-7,,The advantages of the Matthews correlation coefficient (MCC) over F1 score and accuracy in binary classification evaluation,BMC Genomics,2020,article,ml_theory,2,897.0,1781.0,222.7600450619602,6051,266.8933,True,True,baseline,theadvantagesofthematthewscorrelationcoefficientmccoverf1scoreandaccuracyinbinaryclassificationevaluation,222.7600450619602,landmark,True | ||
| 162 | −3105488314,,,Risk bounds for statistical learning,FreiDok plus (Universitätsbibliothek Freiburg),2020,dissertation,ml_theory,1,50.0,59.0,272.44754218635364,96,,False,False,baseline,272.44754218635364,landmark,True | 162 | +2999615587,10.1038/s42256-019-0138-9,,From local explanations to global understanding with explainable AI for trees,Nature Machine Intelligence,2020,article,ml_theory,1,808.0,1767.0,221.00898350616714,10196,280.6263,False,True,baseline,fromlocalexplanationstoglobalunderstandingwithexplainableaifortrees,221.00898350616714,landmark,True | ||
| 163 | −57706852,10.48550/arxiv.2604.24537,2604.24537,Stochastic simultaneous optimistic optimization,arXiv (Cornell University),2026,preprint,ml_theory,1,72.0,72.0,414.33962264150944,72,,True,True,post,255.97588171133128,landmark,True | 163 | +2439568532,10.1145/3233231,,The Mythos of Model Interpretability,Communications of the ACM,2018,article,ml_theory,2,592.0,1085.0,204.78781392529854,5034,234.6672,True,True,baseline,themythosofmodelinterpretability,204.78781392529854,landmark,True | ||
| 164 | −2946444988,10.48550/arxiv.2606.04665,2606.04665,Towards Accurate Model Selection in Deep Unsupervised Domain Adaptation,arXiv (Cornell University),2026,preprint,ml_theory,4,68.0,68.0,2646.035087719298,68,,True,True,post,241.7549993940351,landmark,True | 164 | +3194464139,,,Penerapan Algoritma K-Nearest Neighbor untuk Penentuan Resiko Kredit Kepemilikan Kendaraan Bermotor,,2020,dissertation,ml_theory,1,15.0,21.0,197.50232018561485,25,,True,False,baseline,penerapanalgoritmaknearestneighboruntukpenentuanresikokreditkepemilikankendaraanbermotor,197.50232018561485,landmark,True | ||
| 165 | −2945976633,10.1038/s42256-019-0048-x,1811.10154,Stop explaining black box machine learning models for high stakes decisions and use interpretable models instead,Nature Machine Intelligence,2019,article,ml_theory,2,620.0,1556.0,236.59828408639194,10272,292.6299,False,True,baseline,236.59828408639194,landmark,True | 165 | +3041133507,10.1109/jproc.2020.3004555,1911.02685,A Comprehensive Survey on Transfer Learning,Proceedings of the IEEE,2020,article,ml_theory,4,593.0,1538.0,192.3666194864092,6556,273.5231,True,True,baseline,acomprehensivesurveyontransferlearning,192.3666194864092,landmark,True | ||
| 166 | −4400823820,10.58496/bjml/2024/007,,Random Forest Algorithm Overview,Babylonian Journal of Machine Learning,2024,article,ml_theory,1,353.0,782.0,235.4406851738956,782,299.2578,True,True,post,235.4406851738956,landmark,True | 166 | +57706852,10.48550/arxiv.2604.24537,2604.24537,Stochastic simultaneous optimistic optimization,arXiv (Cornell University),2026,preprint,ml_theory,1,72.0,72.0,414.33962264150944,72,,True,True,post,stochasticsimultaneousoptimisticoptimization,182.55386967774436,landmark,True | ||
| 167 | −2999309192,10.1186/s12864-019-6413-7,,The advantages of the Matthews correlation coefficient (MCC) over F1 score and accuracy in binary classification evaluation,BMC Genomics,2020,article,ml_theory,2,897.0,1781.0,222.7600450619602,6051,266.8933,True,True,baseline,222.7600450619602,landmark,True | 167 | +2436219157,10.1137/16m1080173,1606.04838,Optimization Methods for Large-Scale Machine Learning,SIAM Review,2018,article,ml_theory,4,492.0,956.0,180.43976968901882,3128,199.3045,True,True,baseline,optimizationmethodsforlargescalemachinelearning,180.43976968901882,landmark,True | ||
| 168 | −2999615587,10.1038/s42256-019-0138-9,,From local explanations to global understanding with explainable AI for trees,Nature Machine Intelligence,2020,article,ml_theory,1,808.0,1767.0,221.00898350616714,10196,280.6263,False,True,baseline,221.00898350616714,landmark,True | 168 | +3135028703,10.1007/s42979-021-00592-x,,"Machine Learning: Algorithms, Real-World Applications and Research Directions",SN Computer Science,2021,article,ml_theory,1,512.0,1518.0,176.91139356202336,5534,266.7657,False,True,baseline,machinelearningalgorithmsrealworldapplicationsandresearchdirections,176.91139356202336,landmark,True | ||
| 169 | −2439568532,10.1145/3233231,,The Mythos of Model Interpretability,Communications of the ACM,2018,article,ml_theory,2,592.0,1085.0,204.78781392529854,5034,234.6672,True,True,baseline,204.78781392529854,landmark,True | 169 | +2946444988,10.48550/arxiv.2606.04665,2606.04665,Towards Accurate Model Selection in Deep Unsupervised Domain Adaptation,arXiv (Cornell University),2026,preprint,ml_theory,4,68.0,68.0,2646.035087719298,68,,True,True,post,towardsaccuratemodelselectionindeepunsuperviseddomainadaptation,172.4119880289808,landmark,True | ||
| 170 | −3194464139,,,Penerapan Algoritma K-Nearest Neighbor untuk Penentuan Resiko Kredit Kepemilikan Kendaraan Bermotor,,2020,dissertation,ml_theory,1,15.0,21.0,197.50232018561485,25,,True,False,baseline,197.50232018561485,landmark,True | 170 | +3141797743,10.1109/tkde.2021.3070203,1707.08114,A Survey on Multi-Task Learning,IEEE Transactions on Knowledge and Data Engineering,2021,article,ml_theory,6,882.0,1299.0,151.38860358173145,2878,131.001,True,True,baseline,asurveyonmultitasklearning,151.38860358173145,landmark,True | ||
| 171 | −3041133507,10.1109/jproc.2020.3004555,1911.02685,A Comprehensive Survey on Transfer Learning,Proceedings of the IEEE,2020,article,ml_theory,4,593.0,1538.0,192.3666194864092,6556,273.5231,True,True,baseline,192.3666194864092,landmark,True | 171 | +3123554940,10.1007/978-3-030-57077-4_11,,Pattern Recognition and Machine Learning,EAI/Springer Innovations in Communication and Computing,2021,book-chapter,ml_theory,1,147.0,182.0,140.86542176432712,255,92.5445,False,False,baseline,patternrecognitionandmachinelearning,140.86542176432712,landmark,True | ||
| 172 | −2436219157,10.1137/16m1080173,1606.04838,Optimization Methods for Large-Scale Machine Learning,SIAM Review,2018,article,ml_theory,4,492.0,956.0,180.43976968901882,3128,199.3045,True,True,baseline,180.43976968901882,landmark,True | 172 | +2889326414,10.21105/joss.00861,,UMAP: Uniform Manifold Approximation and Projection,The Journal of Open Source Software,2018,article,ml_theory,2,211.0,797.0,139.93100250694124,9681,230.917,True,True,baseline,umapuniformmanifoldapproximationandprojection,139.93100250694124,landmark,True | ||
| 173 | −3135028703,10.1007/s42979-021-00592-x,,"Machine Learning: Algorithms, Real-World Applications and Research Directions",SN Computer Science,2021,article,ml_theory,1,512.0,1518.0,176.91139356202336,5534,266.7657,False,True,baseline,176.91139356202336,landmark,True | 173 | +3021654819,10.1109/msp.2020.2975749,1908.07873,"Federated Learning: Challenges, Methods, and Future Directions",IEEE Signal Processing Magazine,2020,article,ml_theory,7,429.0,1091.0,136.45772552644502,5140,195.766,True,True,baseline,federatedlearningchallengesmethodsandfuturedirections,136.45772552644502,landmark,True | ||
| 174 | −7124426637,10.1186/s40537-025-01346-9,,A review of machine learning with small and limited data,Journal Of Big Data,2026,article,ml_theory,3,46.0,46.0,51.18887046680522,46,166.1805,True,True,post,163.5401466489061,landmark,True | 174 | +2995022099,10.1561/2200000083,1912.04977,Advances and Open Problems in Federated Learning,Foundations and Trends® in Machine Learning,2020,article,ml_theory,6,570.0,1087.0,135.95742222478987,6330,186.8632,True,True,baseline,advancesandopenproblemsinfederatedlearning,135.95742222478987,landmark,True | ||
| 175 | −2165856466,10.48550/arxiv.2604.18420,2604.18420,Spectral bandits for smooth graph functions,arXiv (Cornell University),2026,preprint,ml_theory,2,45.0,45.0,258.9622641509434,45,,True,True,post,159.98492606958206,landmark,True | 175 | +2608595939,10.1007/978-3-030-05318-5_4,,Auto-WEKA: Automatic Model Selection and Hyperparameter Optimization in WEKA,The Springer series on challenges in machine learning,2019,book-chapter,ml_theory,2,300.0,423.0,131.5813535083268,650,138.539,True,True,baseline,autowekaautomaticmodelselectionandhyperparameteroptimizationinweka,131.5813535083268,landmark,True | ||
| 176 | −4402843978,10.58248/pn633,,Interpretable machine learning,,2020,report,ml_theory,2,236.0,455.0,158.34677419354838,952,,True,True,baseline,158.34677419354838,landmark,True | 176 | +3157286395,10.4230/oasics.dx.2026.1,2104.13478,"A Realization-Theoretic Foundation for Fault Diagnosis, with Diagnosability Equivalence Predictions",arXiv (Cornell University),2021,preprint,ml_theory,2,169.0,307.0,128.25943970767358,519,,True,True,baseline,arealizationtheoreticfoundationforfaultdiagnosiswithdiagnosabilityequivalencepredictions,128.25943970767358,landmark,True | ||
| 177 | −2964121744,10.4230/oasics.dx.2026.15,2108.04578,AutoResearch Lite: a reproducible paper-inspired experiment runner (Adam mechanism reproduction and convergence-speed comparison),DROPS (Schloss Dagstuhl – Leibniz Center for Informatics),2026,article,deep_learning_architectures,3,45775.0,45775.0,50938.490122130635,45780,2749.203,True,True,baseline,162740.22201855818,landmark,True | 177 | +2964121744,10.4230/oasics.dx.2026.15,2108.04578,AutoResearch Lite: a reproducible paper-inspired experiment runner (Adam mechanism reproduction and convergence-speed comparison),DROPS (Schloss Dagstuhl – Leibniz Center for Informatics),2026,article,deep_learning_architectures,3,45775.0,45775.0,50938.490122130635,45780,2749.203,True,True,baseline,autoresearchliteareproduciblepaperinspiredexperimentrunneradammechanismreproductionandconvergencespeedcomparison,116061.15811803818,landmark,True | ||
| 178 | −1710476689,10.1017/9781108891530.013,,Generative Adversarial Networks,Cambridge University Press eBooks,2022,book-chapter,deep_learning_architectures,4,2376.0,2385.0,1018.1648538070052,2402,89.9299,True,False,baseline,1018.1648538070052,landmark,True | 178 | +2963399829,10.57702/dcy1c3gw,1710.09412,Mixup: Beyond empirical risk minimization,arXiv (Cornell University),2024,preprint,deep_learning_architectures,6,772.0,773.0,674.336578903792,773,,True,True,baseline,mixupbeyondempiricalriskminimization,674.336578903792,landmark,True | ||
| 179 | −4322614756,10.4230/lipics.giscience.2025.9,,Identifying Resilient Communities in Road Networks: A Path-Based Embedding Approach,Leibniz international proceedings in informatics,2025,conference-paper,deep_learning_architectures,2,1542.0,1542.0,1370.4731047566265,1543,164.3965,True,True,post,780.6511542175108,landmark,True | 179 | +4322614756,10.4230/lipics.giscience.2025.9,,Identifying Resilient Communities in Road Networks: A Path-Based Embedding Approach,Leibniz international proceedings in informatics,2025,conference-paper,deep_learning_architectures,2,1542.0,1542.0,1370.4731047566265,1543,164.3965,True,True,post,identifyingresilientcommunitiesinroadnetworksapathbasedembeddingapproach,673.8101573298181,landmark,True | ||
| 180 | −2963399829,10.57702/dcy1c3gw,1710.09412,Mixup: Beyond empirical risk minimization,arXiv (Cornell University),2024,preprint,deep_learning_architectures,6,772.0,773.0,674.336578903792,773,,True,True,baseline,674.336578903792,landmark,True | 180 | +4382203079,10.1609/aaai.v37i9.26317,2205.13504,Are Transformers Effective for Time Series Forecasting?,Proceedings of the AAAI Conference on Artificial Intelligence,2023,conference-paper,deep_learning_architectures,3,917.0,2278.0,621.0117979458593,3320,733.0685,True,True,baseline,aretransformerseffectivefortimeseriesforecasting,621.0117979458593,landmark,True | ||
| 181 | −4382203079,10.1609/aaai.v37i9.26317,2205.13504,Are Transformers Effective for Time Series Forecasting?,Proceedings of the AAAI Conference on Artificial Intelligence,2023,conference-paper,deep_learning_architectures,3,917.0,2278.0,621.0117979458593,3320,733.0685,True,True,baseline,621.0117979458593,landmark,True | 181 | +146900863,10.7551/mitpress/11474.003.0014,,Neural Information Processing Systems,The MIT Press eBooks,2018,book-chapter,deep_learning_architectures,1,835.0,999.0,463.99318537042825,3730,234.5719,False,False,baseline,neuralinformationprocessingsystems,463.99318537042825,landmark,True | ||
| 182 | −4406170795,10.1038/s41586-024-08328-6,,Accurate predictions on small data with a tabular foundation model,Nature,2025,article,deep_learning_architectures,4,974.0,974.0,331.79242987145795,974,405.3046,True,True,post,493.09612464841473,landmark,True | 182 | +4406170795,10.1038/s41586-024-08328-6,,Accurate predictions on small data with a tabular foundation model,Nature,2025,article,deep_learning_architectures,4,974.0,974.0,331.79242987145795,974,405.3046,True,True,post,accuratepredictionsonsmalldatawithatabularfoundationmodel,425.6103068996387,landmark,True | ||
| 183 | −146900863,10.7551/mitpress/11474.003.0014,,Neural Information Processing Systems,The MIT Press eBooks,2018,book-chapter,deep_learning_architectures,1,835.0,999.0,463.99318537042825,3730,234.5719,False,False,baseline,463.99318537042825,landmark,True | 183 | +3177318507,10.1609/aaai.v35i12.17325,2012.07436,Informer: Beyond Efficient Transformer for Long Sequence Time-Series Forecasting,Proceedings of the AAAI Conference on Artificial Intelligence,2021,conference-paper,deep_learning_architectures,5,412.0,1344.0,315.30176520033626,7301,468.762,True,True,baseline,informerbeyondefficienttransformerforlongsequencetimeseriesforecasting,315.30176520033626,landmark,True | ||
| 184 | −4396821501,10.48550/arxiv.2404.19756,2404.19756,KAN: Kolmogorov-Arnold Networks,arXiv (Cornell University),2024,preprint,deep_learning_architectures,4,448.0,531.0,463.22473919523094,531,,True,True,post,463.22473919523094,landmark,True | 184 | +4389326242,10.48550/arxiv.2312.00752,2312.00752,Mamba: Linear-Time Sequence Modeling with Selective State Spaces,arXiv (Cornell University),2023,preprint,deep_learning_architectures,8,228.0,912.0,303.2150076098295,1059,,True,True,post,mambalineartimesequencemodelingwithselectivestatespaces,303.2150076098295,landmark,True | ||
| 185 | −2950067852,10.5281/zenodo.19983308,,A Recurrent Latent Variable Model for Sequential Data,arXiv (Cornell University),2026,preprint,deep_learning_architectures,3,119.0,119.0,4630.561403508772,119,,True,True,post,423.0712489395614,landmark,True | 185 | +2950067852,10.5281/zenodo.19983308,,A Recurrent Latent Variable Model for Sequential Data,arXiv (Cornell University),2026,preprint,deep_learning_architectures,3,119.0,119.0,4630.561403508772,119,,True,True,post,arecurrentlatentvariablemodelforsequentialdata,301.7209790507164,landmark,True | ||
| 186 | −4221150249,10.1109/tkde.2026.3680353,2202.07082,Graph Neural Networks for Graphs With Heterophily: A Survey,IEEE Transactions on Knowledge and Data Engineering,2026,article,deep_learning_architectures,2,107.0,107.0,119.0697639119165,107,83.0902,True,True,post,380.4086019876729,landmark,True | 186 | +3137147200,10.1201/9781003162810-13,,A Survey of Quantization Methods for Efficient Neural Network Inference,Chapman & Hall/CRC eBooks,2022,book-chapter,deep_learning_architectures,3,421.0,698.0,297.97864484582374,1148,452.6307,True,True,baseline,asurveyofquantizationmethodsforefficientneuralnetworkinference,297.97864484582374,landmark,True | ||
| 187 | −7148890333,10.1016/j.engappai.2026.114691,,Spatial-channel collaborative multi-scale graph interaction deep transfer learning for unsupervised rotating machinery fault diagnosis,Engineering Applications of Artificial Intelligence,2026,article,deep_learning_architectures,1,102.0,102.0,112.98721991701245,102,283.5476,False,False,post,362.63249909105264,landmark,True | 187 | +3140854437,10.1186/s40537-021-00444-8,,"Review of deep learning: concepts, CNN architectures, challenges, applications, future directions",Journal Of Big Data,2021,article,deep_learning_architectures,7,871.0,2452.0,293.13246585010404,7842,405.9988,True,True,baseline,reviewofdeeplearningconceptscnnarchitectureschallengesapplicationsfuturedirections,293.13246585010404,landmark,True | ||
| 188 | −3177318507,10.1609/aaai.v35i12.17325,2012.07436,Informer: Beyond Efficient Transformer for Long Sequence Time-Series Forecasting,Proceedings of the AAAI Conference on Artificial Intelligence,2021,conference-paper,deep_learning_architectures,5,412.0,1344.0,315.30176520033626,7301,468.762,True,True,baseline,315.30176520033626,landmark,True | 188 | +4210257598,,,A Comprehensive Survey on Graph Neural Networks,UTS ePRESS (University of Technology Sydney),2020,article,deep_learning_architectures,6,1768.0,2239.0,280.04477310147604,2955,236.1125,True,True,baseline,acomprehensivesurveyongraphneuralnetworks,280.04477310147604,landmark,True | ||
| 189 | −4389326242,10.48550/arxiv.2312.00752,2312.00752,Mamba: Linear-Time Sequence Modeling with Selective State Spaces,arXiv (Cornell University),2023,preprint,deep_learning_architectures,8,228.0,912.0,303.2150076098295,1059,,True,True,post,303.2150076098295,landmark,True | 189 | +4221150249,10.1109/tkde.2026.3680353,2202.07082,Graph Neural Networks for Graphs With Heterophily: A Survey,IEEE Transactions on Knowledge and Data Engineering,2026,article,deep_learning_architectures,2,107.0,107.0,119.0697639119165,107,83.0902,True,True,post,graphneuralnetworksforgraphswithheterophilyasurvey,271.29533410442565,landmark,True | ||
| 190 | −7118302872,10.1007/s13278-025-01574-0,,A frame work to predict the influencing nodes in social networking platform using graph neural network model,Social Network Analysis and Mining,2026,article,deep_learning_architectures,3,85.0,85.0,87.58695652173913,85,292.0234,True,True,post,302.1937492425439,landmark,True | 190 | +7148890333,10.1016/j.engappai.2026.114691,,Spatial-channel collaborative multi-scale graph interaction deep transfer learning for unsupervised rotating machinery fault diagnosis,Engineering Applications of Artificial Intelligence,2026,article,deep_learning_architectures,1,102.0,102.0,112.98721991701245,102,283.5476,False,False,post,spatialchannelcollaborativemultiscalegraphinteractiondeeptransferlearningforunsupervisedrotatingmachineryfaultdiagnosis,258.6179820434712,landmark,True | ||
| 191 | −3137147200,10.1201/9781003162810-13,,A Survey of Quantization Methods for Efficient Neural Network Inference,Chapman & Hall/CRC eBooks,2022,book-chapter,deep_learning_architectures,3,421.0,698.0,297.97864484582374,1148,452.6307,True,True,baseline,297.97864484582374,landmark,True | 191 | +3152893301,10.1016/j.aiopen.2021.01.001,1812.08434,Graph neural networks: A review of methods and applications,AI Open,2020,article,deep_learning_architectures,5,1157.0,2023.0,253.0283948120974,6773,287.256,True,True,baseline,graphneuralnetworksareviewofmethodsandapplications,253.0283948120974,landmark,True | ||
| 192 | −3140854437,10.1186/s40537-021-00444-8,,"Review of deep learning: concepts, CNN architectures, challenges, applications, future directions",Journal Of Big Data,2021,article,deep_learning_architectures,7,871.0,2452.0,293.13246585010404,7842,405.9988,True,True,baseline,293.13246585010404,landmark,True | 192 | +4385763767,10.24963/ijcai.2023/759,2202.07125,Transformers in Time Series: A Survey,International Joint Conference on Artificial Intelligence,2023,conference-paper,deep_learning_architectures,4,511.0,921.0,251.0763239280669,1196,259.4717,True,True,post,transformersintimeseriesasurvey,251.0763239280669,landmark,True | ||
| 193 | −4210257598,,,A Comprehensive Survey on Graph Neural Networks,UTS ePRESS (University of Technology Sydney),2020,article,deep_learning_architectures,6,1768.0,2239.0,280.04477310147604,2955,236.1125,True,True,baseline,280.04477310147604,landmark,True | 193 | +7110333790,10.4230/lipics.giscience.2025.3,,Enriching Location Representation with Detailed Semantic Information,DROPS (Schloss Dagstuhl – Leibniz Center for Informatics),2025,article,deep_learning_architectures,2,496.0,496.0,168.96205874357614,0,0.0,True,True,post,enrichinglocationrepresentationwithdetailedsemanticinformation,216.73789755874824,landmark,True | ||
| 194 | −2907492528,10.1109/tnnls.2020.2978386,1901.00596,A Comprehensive Survey on Graph Neural Networks,IEEE Transactions on Neural Networks and Learning Systems,2020,article,deep_learning_architectures,7,934.0,2230.0,278.91909067275196,10106,369.8433,True,True,baseline,278.91909067275196,landmark,True | 194 | +7118302872,10.1007/s13278-025-01574-0,,A frame work to predict the influencing nodes in social networking platform using graph neural network model,Social Network Analysis and Mining,2026,article,deep_learning_architectures,3,85.0,85.0,87.58695652173913,85,292.0234,True,True,post,aframeworktopredicttheinfluencingnodesinsocialnetworkingplatformusinggraphneuralnetworkmodel,215.514985036226,landmark,True | ||
| 195 | −3152893301,10.1016/j.aiopen.2021.01.001,1812.08434,Graph neural networks: A review of methods and applications,AI Open,2020,article,deep_learning_architectures,5,1157.0,2023.0,253.0283948120974,6773,287.256,True,True,baseline,253.0283948120974,landmark,True | 195 | +2892035503,10.1007/s10618-019-00619-1,1809.04356,Deep learning for time series classification: a review,Data Mining and Knowledge Discovery,2019,article,deep_learning_architectures,3,416.0,908.0,192.68934023629362,3299,229.9061,False,True,baseline,deeplearningfortimeseriesclassificationareview,192.68934023629362,landmark,True | ||
| 196 | −7110333790,10.4230/lipics.giscience.2025.3,,Enriching Location Representation with Detailed Semantic Information,DROPS (Schloss Dagstuhl – Leibniz Center for Informatics),2025,article,deep_learning_architectures,2,496.0,496.0,168.96205874357614,0,0.0,True,True,post,251.10439201808387,landmark,True | 196 | +2962776659,10.57702/tcr06vve,,Fine-grained Analysis of Sentence Embeddings Using Auxiliary Prediction Tasks,arXiv (Cornell University),2024,preprint,deep_learning_architectures,4,212.0,212.0,184.94095048849147,212,,True,True,post,finegrainedanalysisofsentenceembeddingsusingauxiliarypredictiontasks,184.94095048849147,landmark,True | ||
| 197 | −4385763767,10.24963/ijcai.2023/759,2202.07125,Transformers in Time Series: A Survey,International Joint Conference on Artificial Intelligence,2023,conference-paper,deep_learning_architectures,4,511.0,921.0,251.0763239280669,1196,259.4717,True,True,post,251.0763239280669,landmark,True | 197 | +2963285578,10.4230/lipics.itcs.2018.22,,Convergence Results for Neural Networks via Electrodynamics,Leibniz international proceedings in informatics,2018,conference-paper,deep_learning_architectures,2,747.0,1153.0,178.53637822491052,2761,153.9662,True,True,baseline,convergenceresultsforneuralnetworksviaelectrodynamics,178.53637822491052,landmark,True | ||
| 198 | −3124006607,10.26190/unsworks/32608,,SIMPLE SPECTRAL GRAPH CONVOLUTION,"UNSWorks (University of New South Wales, Sydney, Australia)",2026,conference-paper,deep_learning_architectures,2,69.0,69.0,529.5790121767684,69,0.0,True,True,post,245.31021997335915,landmark,True | 198 | +3124006607,10.26190/unsworks/32608,,SIMPLE SPECTRAL GRAPH CONVOLUTION,"UNSWorks (University of New South Wales, Sydney, Australia)",2026,conference-paper,deep_learning_architectures,2,69.0,69.0,529.5790121767684,69,0.0,True,True,post,simplespectralgraphconvolution,174.94745844117168,landmark,True | ||
| 199 | −4285723986,10.1007/978-3-031-01587-8_7,,Graph Attention Networks,Synthesis lectures on artificial intelligence and machine learning,2020,book-chapter,deep_learning_architectures,3,247.0,471.0,244.37756010685663,806,284.0555,False,False,baseline,244.37756010685663,landmark,True | 199 | +4398159307,10.2139/ssrn.4835325,2405.12832,Wav-KAN: Wavelet Kolmogorov-Arnold Networks,SSRN Electronic Journal,2024,preprint,deep_learning_architectures,2,142.0,199.0,173.6002318264613,199,,False,True,post,wavkanwaveletkolmogorovarnoldnetworks,173.6002318264613,landmark,True | ||
| 200 | −2892035503,10.1007/s10618-019-00619-1,1809.04356,Deep learning for time series classification: a review,Data Mining and Knowledge Discovery,2019,article,deep_learning_architectures,3,416.0,908.0,192.68934023629362,3299,229.9061,False,True,baseline,192.68934023629362,landmark,True | 200 | +2593744649,10.1016/b978-0-12-815480-9.00015-3,,Evolving Deep Neural Networks,Elsevier eBooks,2018,book-chapter,deep_learning_architectures,2,197.0,361.0,167.66920912785244,760,185.4489,False,False,baseline,evolvingdeepneuralnetworks,167.66920912785244,landmark,True | ||
| 201 | −2962776659,10.57702/tcr06vve,,Fine-grained Analysis of Sentence Embeddings Using Auxiliary Prediction Tasks,arXiv (Cornell University),2024,preprint,deep_learning_architectures,4,212.0,212.0,184.94095048849147,212,,True,True,post,184.94095048849147,landmark,True | 201 | +2885195348,10.1016/j.physd.2019.132306,1808.03314,Fundamentals of Recurrent Neural Network (RNN) and Long Short-Term Memory (LSTM) network,Physica D Nonlinear Phenomena,2020,article,deep_learning_architectures,3,632.0,1318.0,164.84993789537538,5648,212.9085,False,True,baseline,fundamentalsofrecurrentneuralnetworkrnnandlongshorttermmemorylstmnetwork,164.84993789537538,landmark,True | ||
| 202 | −4406063062,10.1016/j.jsis.2024.101885,,Responsible artificial intelligence governance: A review and research framework,The Journal of Strategic Information Systems,2025,article,ai_safety,1,534.0,534.0,74.49083144938457,534,564.6901,True,True,post,270.3422285033403,landmark,True | 202 | +4406063062,10.1016/j.jsis.2024.101885,,Responsible artificial intelligence governance: A review and research framework,The Journal of Strategic Information Systems,2025,article,ai_safety,1,534.0,534.0,74.49083144938457,534,564.6901,True,True,post,responsibleartificialintelligencegovernanceareviewandresearchframework,233.3428171297814,landmark,True | ||
| 203 | −7130596601,10.1016/j.ijmedinf.2026.106362,,"Human in the loop artificial intelligence in healthcare: applications, outcomes, and implementation challenges",International Journal of Medical Informatics,2026,article,ai_safety,6,65.0,65.0,29.591261451726567,65,120.3431,True,True,post,231.08933765606298,landmark,True | 203 | +3084163594,10.26522/brocked.v29i2.849,,Age of Surveillance Capitalism – The Fight for a Human Future at the New Frontier of Power.,Brock Education Journal,2020,article,ai_safety,2,484.0,775.0,225.67375365464028,2135,237.3333,True,True,baseline,ageofsurveillancecapitalismthefightforahumanfutureatthenewfrontierofpower,225.67375365464028,landmark,True | ||
| 204 | −3084163594,10.26522/brocked.v29i2.849,,Age of Surveillance Capitalism – The Fight for a Human Future at the New Frontier of Power.,Brock Education Journal,2020,article,ai_safety,2,484.0,775.0,225.67375365464028,2135,237.3333,True,True,baseline,225.67375365464028,landmark,True | 204 | +2963808661,10.4230/oasics.saia.2024.4,,Scaling of End-To-End Governance Risk Assessments for AI Systems (Practitioner Track),OASIcs : OpenAccess Series in Informatics,2025,conference-paper,ai_safety,1,390.0,390.0,126.28760836308005,390,127.9549,True,True,post,scalingofendtoendgovernanceriskassessmentsforaisystemspractitionertrack,170.418911386919,landmark,True | ||
| 205 | −2963808661,10.4230/oasics.saia.2024.4,,Scaling of End-To-End Governance Risk Assessments for AI Systems (Practitioner Track),OASIcs : OpenAccess Series in Informatics,2025,conference-paper,ai_safety,1,390.0,390.0,126.28760836308005,390,127.9549,True,True,post,197.44095340131597,landmark,True | 205 | +2981731882,10.1016/j.inffus.2019.12.012,1910.10045,"Explainable Artificial Intelligence (XAI): Concepts, taxonomies, opportunities and challenges toward responsible AI",Information Fusion,2019,article,ai_safety,4,225.0,1097.0,166.80483138995626,10111,264.5411,False,True,baseline,explainableartificialintelligencexaiconceptstaxonomiesopportunitiesandchallengestowardresponsibleai,166.80483138995626,landmark,True | ||
| 206 | −7133236347,10.1016/j.aiopen.2026.02.006,2506.04133,"TRiSM for Agentic AI: A review of Trust, Risk, and Security Management in LLM-based Agentic Multi-Agent Systems",AI Open,2026,article,ai_safety,5,51.0,51.0,44.51662971175166,51,274.4005,True,True,post,181.31624954552632,landmark,True | 206 | +7130596601,10.1016/j.ijmedinf.2026.106362,,"Human in the loop artificial intelligence in healthcare: applications, outcomes, and implementation challenges",International Journal of Medical Informatics,2026,article,ai_safety,6,65.0,65.0,29.591261451726567,65,120.3431,True,True,post,humanintheloopartificialintelligenceinhealthcareapplicationsoutcomesandimplementationchallenges,164.80557679240812,landmark,True | ||
| 207 | −7128782475,10.1038/s41746-026-02428-5,,Large language models provide unsafe answers to patient-posed medical questions,npj Digital Medicine,2026,article,ai_safety,3,51.0,51.0,23.217758985200845,50,94.0181,True,True,post,181.31624954552632,landmark,True | 207 | +4406571986,10.1016/j.chbah.2025.100121,2402.01659,Generative artificial intelligence in higher education: Evidence from an analysis of institutional policies and guidelines,Computers in Human Behavior Artificial Humans,2025,article,ai_safety,3,347.0,347.0,301.26573426573424,347,363.8008,True,True,post,generativeartificialintelligenceinhighereducationevidencefromananalysisofinstitutionalpoliciesandguidelines,151.62913397759203,landmark,True | ||
| 208 | −4406571986,10.1016/j.chbah.2025.100121,2402.01659,Generative artificial intelligence in higher education: Evidence from an analysis of institutional policies and guidelines,Computers in Human Behavior Artificial Humans,2025,article,ai_safety,3,347.0,347.0,301.26573426573424,347,363.8008,True,True,post,175.6718226416837,landmark,True | 208 | +4330336443,10.48550/arxiv.2303.10130,2303.10130,GPTs are GPTs: An Early Look at the Labor Market Impact Potential of Large Language Models,RePEc: Research Papers in Economics,2023,preprint,ai_safety,5,397.0,495.0,146.63793103448276,527,,True,True,post,gptsaregptsanearlylookatthelabormarketimpactpotentialoflargelanguagemodels,146.63793103448276,landmark,True | ||
| 209 | −2981731882,10.1016/j.inffus.2019.12.012,1910.10045,"Explainable Artificial Intelligence (XAI): Concepts, taxonomies, opportunities and challenges toward responsible AI",Information Fusion,2019,article,ai_safety,4,225.0,1097.0,166.80483138995626,10111,264.5411,False,True,baseline,166.80483138995626,landmark,True | 209 | +4399450035,10.1145/3630106.3658542,2311.16863,Power Hungry Processing: Watts Driving the Cost of AI Deployment?,,2024,conference-paper,ai_safety,3,210.0,359.0,138.53682019255788,359,285.6538,True,True,post,powerhungryprocessingwattsdrivingthecostofaideployment,138.53682019255788,landmark,True | ||
| 210 | −4402698709,10.1016/j.patter.2026.101517,2408.12622,"The AI risk repository: A meta-review, database, and taxonomy of risks from artificial intelligence",Patterns,2026,article,ai_safety,4,44.0,44.0,38.40650406504065,44,146.3469,True,True,post,156.42970549025802,landmark,True | 210 | +4318586239,10.1007/978-3-031-21448-6_2,,Artificial Intelligence: Definition and Background,Research for policy,2023,book-chapter,ai_safety,1,95.0,247.0,136.55931293612454,373,215.6652,True,True,post,artificialintelligencedefinitionandbackground,136.55931293612454,landmark,True | ||
| 211 | −4408314709,10.1038/s41746-025-01503-7,,Bias recognition and mitigation strategies in artificial intelligence healthcare applications,npj Digital Medicine,2025,article,ai_safety,1,303.0,303.0,42.26726953026878,303,319.4957,True,True,post,153.39643302717624,landmark,True | 211 | +4408314709,10.1038/s41746-025-01503-7,,Bias recognition and mitigation strategies in artificial intelligence healthcare applications,npj Digital Medicine,2025,article,ai_safety,1,303.0,303.0,42.26726953026878,303,319.4957,True,True,post,biasrecognitionandmitigationstrategiesinartificialintelligencehealthcareapplications,132.4023850006063,landmark,True | ||
| 212 | −4407243994,10.1080/08839514.2025.2463722,,"AI Ethics: Integrating Transparency, Fairness, and Privacy in AI Development",Applied Artificial Intelligence,2025,article,ai_safety,1,300.0,300.0,41.8487817131374,300,317.3728,True,True,post,151.87765646255073,landmark,True | 212 | +4407243994,10.1080/08839514.2025.2463722,,"AI Ethics: Integrating Transparency, Fairness, and Privacy in AI Development",Applied Artificial Intelligence,2025,article,ai_safety,1,300.0,300.0,41.8487817131374,300,317.3728,True,True,post,aiethicsintegratingtransparencyfairnessandprivacyinaidevelopment,131.09147029763,landmark,True | ||
| 213 | −4330336443,10.48550/arxiv.2303.10130,2303.10130,GPTs are GPTs: An Early Look at the Labor Market Impact Potential of Large Language Models,RePEc: Research Papers in Economics,2023,preprint,ai_safety,5,397.0,495.0,146.63793103448276,527,,True,True,post,146.63793103448276,landmark,True | 213 | +4360615722,10.3390/su15075614,,Chatbots in Education and Research: A Critical Examination of Ethical Implications and Solutions,Sustainability,2023,article,ai_safety,2,322.0,557.0,130.5473071452147,658,154.3873,True,True,post,chatbotsineducationandresearchacriticalexaminationofethicalimplicationsandsolutions,130.5473071452147,landmark,True | ||
| 214 | −7128600296,10.1038/s41746-026-02418-7,,Advancing healthcare AI governance through a comprehensive maturity model based on systematic review,npj Digital Medicine,2026,review,ai_safety,1,41.0,41.0,12.755555555555555,41,37.52,True,True,post,145.7640437522859,landmark,True | 214 | +7133236347,10.1016/j.aiopen.2026.02.006,2506.04133,"TRiSM for Agentic AI: A review of Trust, Risk, and Security Management in LLM-based Agentic Multi-Agent Systems",AI Open,2026,article,ai_safety,5,51.0,51.0,44.51662971175166,51,274.4005,True,True,post,trismforagenticaiareviewoftrustriskandsecuritymanagementinllmbasedagenticmultiagentsystems,129.3089910217356,landmark,True | ||
| 215 | −4399450035,10.1145/3630106.3658542,2311.16863,Power Hungry Processing: Watts Driving the Cost of AI Deployment?,,2024,conference-paper,ai_safety,3,210.0,359.0,138.53682019255788,359,285.6538,True,True,post,138.53682019255788,landmark,True | 215 | +7128782475,10.1038/s41746-026-02428-5,,Large language models provide unsafe answers to patient-posed medical questions,npj Digital Medicine,2026,article,ai_safety,3,51.0,51.0,23.217758985200845,50,94.0181,True,True,post,largelanguagemodelsprovideunsafeanswerstopatientposedmedicalquestions,129.3089910217356,landmark,True | ||
| 216 | −4318586239,10.1007/978-3-031-21448-6_2,,Artificial Intelligence: Definition and Background,Research for policy,2023,book-chapter,ai_safety,1,95.0,247.0,136.55931293612454,373,215.6652,True,True,post,136.55931293612454,landmark,True | 216 | +2670253439,10.1016/j.artint.2018.07.007,1706.07269,Explanation in artificial intelligence: Insights from the social sciences,Artificial Intelligence,2018,article,ai_safety,1,267.0,676.0,127.59130157926435,5207,192.3734,False,True,baseline,explanationinartificialintelligenceinsightsfromthesocialsciences,127.59130157926435,landmark,True | ||
| 217 | −4360615722,10.3390/su15075614,,Chatbots in Education and Research: A Critical Examination of Ethical Implications and Solutions,Sustainability,2023,article,ai_safety,2,322.0,557.0,130.5473071452147,658,154.3873,True,True,post,130.5473071452147,landmark,True | 217 | +4402698709,10.1016/j.patter.2026.101517,2408.12622,"The AI risk repository: A meta-review, database, and taxonomy of risks from artificial intelligence",Patterns,2026,article,ai_safety,4,44.0,44.0,38.40650406504065,44,146.3469,True,True,post,theairiskrepositoryametareviewdatabaseandtaxonomyofrisksfromartificialintelligence,111.56069813639934,landmark,True | ||
| 218 | −2670253439,10.1016/j.artint.2018.07.007,1706.07269,Explanation in artificial intelligence: Insights from the social sciences,Artificial Intelligence,2018,article,ai_safety,1,267.0,676.0,127.59130157926435,5207,192.3734,False,True,baseline,127.59130157926435,landmark,True | 218 | +4366262984,10.1016/j.inffus.2023.101805,,Explainable Artificial Intelligence (XAI): What we know and what is left to attain Trustworthy Artificial Intelligence,Information Fusion,2023,article,ai_safety,5,510.0,1197.0,109.89033300779907,1728,151.7177,True,True,post,explainableartificialintelligencexaiwhatweknowandwhatislefttoattaintrustworthyartificialintelligence,109.89033300779907,landmark,True | ||
| 219 | −7118631510,10.1016/j.cie.2026.111805,,Towards trustworthy AI in Industry 5.0: Ante-hoc interpretability with deep learning,Computers & Industrial Engineering,2026,article,ai_safety,2,35.0,35.0,38.94805361604745,35,126.4417,False,True,post,124.4327202763416,landmark,True | 219 | +7128600296,10.1038/s41746-026-02418-7,,Advancing healthcare AI governance through a comprehensive maturity model based on systematic review,npj Digital Medicine,2026,review,ai_safety,1,41.0,41.0,12.755555555555555,41,37.52,True,True,post,advancinghealthcareaigovernancethroughacomprehensivematuritymodelbasedonsystematicreview,103.95428689982666,landmark,True | ||
| 220 | −7127143535,10.1016/j.jii.2026.101089,,"Industrial information integration through autonomous AI agents: paradoxical effects on transparency, dehumanization, and responsible retail operations",Journal of Industrial Information Integration,2026,article,ai_safety,2,33.0,33.0,50.00583941605839,33,209.0741,False,False,post,117.32227911769351,landmark,True | 220 | +2969896603,10.1145/3457607,1908.09635,A Survey on Bias and Fairness in Machine Learning,ACM Computing Surveys,2021,article,ai_safety,3,952.0,1794.0,102.2847403248446,5442,822.4428,True,True,baseline,asurveyonbiasandfairnessinmachinelearning,102.2847403248446,landmark,True | ||
| 221 | −4409249263,10.1371/journal.pdig.0000810,2412.03576,Ethical challenges and evolving strategies in the integration of artificial intelligence into clinical practice,PLOS Digital Health,2025,article,ai_safety,3,218.0,218.0,14.499719652368936,218,44.6351,True,True,post,110.36443036278686,landmark,True | 221 | +4409249263,10.1371/journal.pdig.0000810,2412.03576,Ethical challenges and evolving strategies in the integration of artificial intelligence into clinical practice,PLOS Digital Health,2025,article,ai_safety,3,218.0,218.0,14.499719652368936,218,44.6351,True,True,post,ethicalchallengesandevolvingstrategiesintheintegrationofartificialintelligenceintoclinicalpractice,95.25980174961113,landmark,True | ||
| 222 | −4366262984,10.1016/j.inffus.2023.101805,,Explainable Artificial Intelligence (XAI): What we know and what is left to attain Trustworthy Artificial Intelligence,Information Fusion,2023,article,ai_safety,5,510.0,1197.0,109.89033300779907,1728,151.7177,True,True,post,109.89033300779907,landmark,True | 222 | +7118631510,10.1016/j.cie.2026.111805,,Towards trustworthy AI in Industry 5.0: Ante-hoc interpretability with deep learning,Computers & Industrial Engineering,2026,article,ai_safety,2,35.0,35.0,38.94805361604745,35,126.4417,False,True,post,towardstrustworthyaiinindustry50antehocinterpretabilitywithdeeplearning,88.74146442668129,landmark,True | ||
| 223 | −2969896603,10.1145/3457607,1908.09635,A Survey on Bias and Fairness in Machine Learning,ACM Computing Surveys,2021,article,ai_safety,3,952.0,1794.0,102.2847403248446,5442,822.4428,True,True,baseline,102.2847403248446,landmark,True | 223 | +4406152291,10.1038/s41591-024-03445-1,,Medical large language models are vulnerable to data-poisoning attacks,Nature Medicine,2025,article,ai_safety,4,199.0,199.0,67.78921308462026,199,81.9764,True,True,post,medicallargelanguagemodelsarevulnerabletodatapoisoningattacks,86.95734196409457,landmark,True | ||
| 224 | −4406152291,10.1038/s41591-024-03445-1,,Medical large language models are vulnerable to data-poisoning attacks,Nature Medicine,2025,article,ai_safety,4,199.0,199.0,67.78921308462026,199,81.9764,True,True,post,100.74551212015865,landmark,True | 224 | +4400609581,10.1057/s41599-024-03432-4,,"Exploring the impact of artificial intelligence on higher education: The dynamics of ethical, social, and educational implications",Humanities and Social Sciences Communications,2024,article,ai_safety,1,151.0,284.0,85.50531277415134,284,108.6819,True,True,post,exploringtheimpactofartificialintelligenceonhighereducationthedynamicsofethicalsocialandeducationalimplications,85.50531277415134,landmark,True | ||
| 225 | −4410609100,10.1109/satml64287.2025.00010,2310.08419,Jailbreaking Black Box Large Language Models in Twenty Queries,IEEE Conference on Secure and Trustworthy Machine Learning (SaTML),2025,conference-paper,ai_safety,7,193.0,193.0,171.53132893516792,193,175.4907,True,True,post,97.70795899090764,landmark,True | 225 | +4401588926,10.1787/15df715b-en,,The potential impact of Artificial Intelligence on equity and inclusion in education,OECD artificial intelligence papers,2024,report,ai_safety,1,34.0,75.0,84.79411764705883,75,,True,True,post,thepotentialimpactofartificialintelligenceonequityandinclusionineducation,84.79411764705883,landmark,True | ||
| 226 | −4411542009,10.1145/3715275.3732039,2504.18412,Expressing stigma and inappropriate responses prevents LLMs from safely replacing mental health providers.,"ACM Conference on Fairness, Accountability, and Transparency (FAccT)",2025,conference-paper,ai_safety,3,191.0,191.0,61.84854665986741,191,201.9784,True,True,post,96.6954412811573,landmark,True | 226 | +4410609100,10.1109/satml64287.2025.00010,2310.08419,Jailbreaking Black Box Large Language Models in Twenty Queries,IEEE Conference on Secure and Trustworthy Machine Learning (SaTML),2025,conference-paper,ai_safety,7,193.0,193.0,171.53132893516792,193,175.4907,True,True,post,jailbreakingblackboxlargelanguagemodelsintwentyqueries,84.33551255814196,landmark,True | ||
| 227 | −4360620450,10.1016/j.ijinfomgt.2023.102642,,"Opinion Paper: “So what if ChatGPT wrote it?” Multidisciplinary perspectives on opportunities, challenges and implications of generative conversational AI for research, practice and policy",International Journal of Information Management,2023,article,llm,3,1920.0,3137.0,113.51170057881467,4478,1093.1295,True,True,post,113.51170057881467,landmark,True | 227 | +4360620450,10.1016/j.ijinfomgt.2023.102642,,"Opinion Paper: “So what if ChatGPT wrote it?” Multidisciplinary perspectives on opportunities, challenges and implications of generative conversational AI for research, practice and policy",International Journal of Information Management,2023,article,llm,3,1920.0,3137.0,113.51170057881467,4478,1093.1295,True,True,post,opinionpapersowhatifchatgptwroteitmultidisciplinaryperspectivesonopportunitieschallengesandimplicationsofgenerativeconversationalaiforresearchpracticeandpolicy,113.51170057881467,landmark,True | ||
| 228 | −3185341429,10.1145/3560815,2107.13586,"Pre-train, Prompt, and Predict: A Systematic Survey of Prompting Methods in Natural Language Processing",ACM Computing Surveys,2022,article,llm,6,1233.0,2462.0,253.6835252173668,4309,297.4377,True,True,baseline,253.6835252173668,landmark,True | 228 | +3185341429,10.1145/3560815,2107.13586,"Pre-train, Prompt, and Predict: A Systematic Survey of Prompting Methods in Natural Language Processing",ACM Computing Surveys,2022,article,llm,6,1233.0,2462.0,253.6835252173668,4309,297.4377,True,True,baseline,pretrainpromptandpredictasystematicsurveyofpromptingmethodsinnaturallanguageprocessing,253.6835252173668,landmark,True | ||
| 229 | −4384071683,10.1038/s41586-023-06291-2,2212.13138,Large language models encode clinical knowledge,Nature,2023,article,llm,5,1174.0,2448.0,38.05321679482215,3967,137.2207,True,True,post,38.05321679482215,landmark,True | 229 | +4384071683,10.1038/s41586-023-06291-2,2212.13138,Large language models encode clinical knowledge,Nature,2023,article,llm,5,1174.0,2448.0,38.05321679482215,3967,137.2207,True,True,post,largelanguagemodelsencodeclinicalknowledge,38.05321679482215,landmark,True | ||
| 230 | −4384918448,10.48550/arxiv.2307.09288,2307.09288,Behavioral Safety and Context Retention of Large Language Models in a Longitudinal ICU Simulation under Offline Conditions,arXiv (Cornell University),2023,preprint,llm,6,1623.0,2431.0,88.45470297029703,2595,,True,True,post,88.45470297029703,landmark,True | 230 | +4384918448,10.48550/arxiv.2307.09288,2307.09288,Behavioral Safety and Context Retention of Large Language Models in a Longitudinal ICU Simulation under Offline Conditions,arXiv (Cornell University),2023,preprint,llm,6,1623.0,2431.0,88.45470297029703,2595,,True,True,post,behavioralsafetyandcontextretentionoflargelanguagemodelsinalongitudinalicusimulationunderofflineconditions,88.45470297029703,landmark,True | ||
| 231 | −4393065402,10.1007/s11704-024-40231-1,2308.11432,A survey on large language model based autonomous agents,Frontiers of Computer Science,2024,article,llm,3,876.0,1820.0,226.05848170926672,1820,269.514,True,True,post,226.05848170926672,landmark,True | 231 | +4393065402,10.1007/s11704-024-40231-1,2308.11432,A survey on large language model based autonomous agents,Frontiers of Computer Science,2024,article,llm,3,876.0,1820.0,226.05848170926672,1820,269.514,True,True,post,asurveyonlargelanguagemodelbasedautonomousagents,226.05848170926672,landmark,True | ||
| 232 | −4319083882,10.1038/d41586-023-00288-7,,ChatGPT: five priorities for research,Nature,2023,article,llm,2,1183.0,1590.0,145.96961527351755,1831,160.4149,False,True,post,145.96961527351755,landmark,True | 232 | +4319083882,10.1038/d41586-023-00288-7,,ChatGPT: five priorities for research,Nature,2023,article,llm,2,1183.0,1590.0,145.96961527351755,1831,160.4149,False,True,post,chatgptfiveprioritiesforresearch,145.96961527351755,landmark,True | ||
| 233 | −4399790131,10.1186/s40561-024-00316-7,,The effects of over-reliance on AI dialogue systems on students' cognitive abilities: a systematic review,Smart Learning Environments,2024,review,ai_safety,3,613.0,1484.0,81.80055076520247,1484,96.2475,True,True,post,81.80055076520247,landmark,True | 233 | +4399790131,10.1186/s40561-024-00316-7,,The effects of over-reliance on AI dialogue systems on students' cognitive abilities: a systematic review,Smart Learning Environments,2024,review,ai_safety,3,613.0,1484.0,81.80055076520247,1484,96.2475,True,True,post,theeffectsofoverrelianceonaidialoguesystemsonstudentscognitiveabilitiesasystematicreview,81.80055076520247,landmark,True | ||
| 234 | −3133702157,10.1145/3442188.3445922,,On the Dangers of Stochastic Parrots,"ACM Conference on Fairness, Accountability, and Transparency (FAccT)",2021,conference-paper,llm,3,623.0,1464.0,232.11321601174575,6788,321.4548,True,True,baseline,232.11321601174575,landmark,True | 234 | +3133702157,10.1145/3442188.3445922,,On the Dangers of Stochastic Parrots,"ACM Conference on Fairness, Accountability, and Transparency (FAccT)",2021,conference-paper,llm,3,623.0,1464.0,232.11321601174575,6788,321.4548,True,True,baseline,onthedangersofstochasticparrots,232.11321601174575,landmark,True | ||
| 235 | −4321499901,10.1186/s40561-023-00237-x,,What if the devil is my guardian angel: ChatGPT as a case study of using chatbots in education,Smart Learning Environments,2023,article,llm,3,941.0,1389.0,325.547952647582,1931,453.5275,True,True,post,325.547952647582,landmark,True | ||||
modified
literature_synthesis/landmarks/computational_science_abstracts.jsonl
+36 −39
@@ -1,59 +1,57 @@ | |||||
| 1 | +{"work_id": 4388522045, "title": "SRplot: A free online platform for data visualization and graphing", "abstract": "Graphics are widely used to provide summarization of complex data in scientific publications. Although there are many tools available for drawing graphics, their use is limited by programming skills, costs, and platform specificities. Here, we presented a freely accessible easy-to-use web server named SRplot that integrated more than a hundred of commonly used data visualization and graphing functions together. It can be run easily using all Web browsers and there are no strong requirements on the computing power of users' machines. With a user-friendly graphical interface, users can simply paste the contents of the input file into the text box according to the defined file format. Modification operations can be easily performed, and graphs can be generated in real-time. The resulting graphs can be easily downloaded in bitmap (PNG or TIFF) or vector (PDF or SVG) format in publication quality. The website is updated promptly and continuously. Functions in SRplot have been improved, optimized and updated depend on feedback and suggestions from users. The graphs prepared with SRplot have been featured in more than five hundred peer-reviewed publications. The SRplot web server is now freely available at http://www.bioinformatics.com.cn/SRplot."} | ||||
| 2 | +{"work_id": 4319754774, "title": "Acceptance of artificial intelligence in teaching science: Science teachers' perspective", "abstract": "Over the last few decades, there has been growing interest in artificial intelligence (AI) and how to apply it effectively in the educational process. The behavioural intention and attitudes of teachers play an important role in this regard. The technology acceptance model (TAM) has been shown to be effective in predicting factors that may positively or negatively influence behavioural intentions to use technology. The current study therefore aims to use this model to reveal teachers\u2019 perceptions of the factors that influence the use of AI applications in science education. This research uses the descriptive method where a 6-dimensional scale is designed based on the components of the TAM model and then applied to a sample of 83 science teachers in Abu Dhabi. The results show a high acceptability of the use of AI in the classroom by science teachers, with positive correlations to self-efficacy, ease of use, expected benefits, attitudes, and behavioural intentions. However, anxiety and stress do not significantly affect other factors. Regarding the predictive power of research models, the combined factors expected benefits, ease of use, and attitude toward AI applications can predict 71.4% of future behavioural changes related to the use of AI applications in science teaching. This study finds no statistically significant differences in teacher responses based on the variables gender, teaching experience, and qualifications regarding teachers\u2019 behavioural intentions to actually use AI in science teaching."} | ||||
| 1 | {"work_id": 4416043407, "title": "Accelerating scientific discovery with Co-Scientist", "abstract": "Abstract Scientific discovery is driven by scientists generating hypotheses for complex problems that undergo rigorous experimental validation. To augment this process, we introduce Co-Scientist, a multi-agent artificial intelligence (AI) system built on Gemini for structured scientific thinking and hypothesis generation. Co-Scientist aims to help scientists discover new original knowledge. Conditioned on their research objectives and previous scientific evidence, it formulates demonstrably novel research hypotheses for experimental verification. The system\u2019s design involves agents continuously generating, critiquing and refining hypotheses accelerated by scaling test-time compute. Key contributions include (1) a multi-agent architecture with an asynchronous task execution framework for flexible compute scaling, and (2) a tournament evolution process for self-improving hypotheses generation. Automated evaluations show continued benefits of test-time compute scaling, improving hypothesis quality over time. Although this is a general-purpose system, we focus the validation in three biomedical applications: drug repurposing; novel-target discovery 1 ; and explaining mechanisms of antimicrobial resistance 2 . Specifically, Co-Scientist helped to identify new drug-repurposing candidates and synergistic combination therapies for acute myeloid leukaemia that were validated through in vitro experiments. These real-world validations demonstrate the potential of Co-Scientist to accelerate scientific discovery and usher in an era of AI-empowered scientists."} | 3 | {"work_id": 4416043407, "title": "Accelerating scientific discovery with Co-Scientist", "abstract": "Abstract Scientific discovery is driven by scientists generating hypotheses for complex problems that undergo rigorous experimental validation. To augment this process, we introduce Co-Scientist, a multi-agent artificial intelligence (AI) system built on Gemini for structured scientific thinking and hypothesis generation. Co-Scientist aims to help scientists discover new original knowledge. Conditioned on their research objectives and previous scientific evidence, it formulates demonstrably novel research hypotheses for experimental verification. The system\u2019s design involves agents continuously generating, critiquing and refining hypotheses accelerated by scaling test-time compute. Key contributions include (1) a multi-agent architecture with an asynchronous task execution framework for flexible compute scaling, and (2) a tournament evolution process for self-improving hypotheses generation. Automated evaluations show continued benefits of test-time compute scaling, improving hypothesis quality over time. Although this is a general-purpose system, we focus the validation in three biomedical applications: drug repurposing; novel-target discovery 1 ; and explaining mechanisms of antimicrobial resistance 2 . Specifically, Co-Scientist helped to identify new drug-repurposing candidates and synergistic combination therapies for acute myeloid leukaemia that were validated through in vitro experiments. These real-world validations demonstrate the potential of Co-Scientist to accelerate scientific discovery and usher in an era of AI-empowered scientists."} | ||
| 2 | {"work_id": 3210165781, "title": "Artificial intelligence: A powerful paradigm for scientific research", "abstract": "Artificial intelligence (AI) coupled with promising machine learning (ML) techniques well known from computer science is broadly affecting many aspects of various fields including science and technology, industry, and even our day-to-day life. The ML techniques have been developed to analyze high-throughput data with a view to obtaining useful insights, categorizing, predicting, and making evidence-based decisions in novel ways, which will promote the growth of novel applications and fuel the sustainable booming of AI. This paper undertakes a comprehensive survey on the development and application of AI in different aspects of fundamental sciences, including information science, mathematics, medical science, materials science, geoscience, life science, physics, and chemistry. The challenges that each discipline of science meets, and the potentials of AI techniques to handle these challenges, are discussed in detail. Moreover, we shed light on new research trends entailing the integration of AI into each scientific discipline. The aim of this paper is to provide a broad research guideline on fundamental sciences with potential infusion of AI, to help motivate researchers to deeply understand the state-of-the-art applications of AI-based fundamental sciences, and thereby to help promote the continuous development of these fundamental sciences."} | 4 | {"work_id": 3210165781, "title": "Artificial intelligence: A powerful paradigm for scientific research", "abstract": "Artificial intelligence (AI) coupled with promising machine learning (ML) techniques well known from computer science is broadly affecting many aspects of various fields including science and technology, industry, and even our day-to-day life. The ML techniques have been developed to analyze high-throughput data with a view to obtaining useful insights, categorizing, predicting, and making evidence-based decisions in novel ways, which will promote the growth of novel applications and fuel the sustainable booming of AI. This paper undertakes a comprehensive survey on the development and application of AI in different aspects of fundamental sciences, including information science, mathematics, medical science, materials science, geoscience, life science, physics, and chemistry. The challenges that each discipline of science meets, and the potentials of AI techniques to handle these challenges, are discussed in detail. Moreover, we shed light on new research trends entailing the integration of AI into each scientific discipline. The aim of this paper is to provide a broad research guideline on fundamental sciences with potential infusion of AI, to help motivate researchers to deeply understand the state-of-the-art applications of AI-based fundamental sciences, and thereby to help promote the continuous development of these fundamental sciences."} | ||
| 3 | −{"work_id": 4245687930, "title": "Chemical Reaction Engineering", "abstract": "Chemical reactions are essential technological elements in a wide range of industries. Chemical reactions are indispensable in converting less valuable raw materials into higher-value products and in converting one form of energy to another. Many reactions of industrial significance are complex, involving side reactions \u2013 which often result in the formation of undesirable by-products. Chemical kinetics allows us to understand how reaction rates depend on variables such as concentration, temperature, and pressure. Most industrial chemical processes involve some kind of catalyst in order to increase the reaction rate. The behavior of heterogeneous catalysts can be significantly influenced by the rate of heat and mass transfer to and from the sites in the catalyst where the reaction occurs. The design and analysis of chemical reactors are built upon a sound understanding of chemical kinetics. In the operation of existing reactors, periodic analysis of the reactor performance is necessary to ensure optimal operation under varying operating conditions. It is difficult to generalize chemical reaction kinetics because almost every reaction is unique, characterized by a specific chemical model, involving one or more phases, and invariably taking place in one of a great variety of reactor configurations. Problems in chemical kinetics and the design and analysis of chemical reactors are nonlinear and therefore require the solution of complicated algebraic and differential equations by numerical methods, which can be performed well by MATLAB \u00ae programs. This chapter demonstrates some basic methods that are used for calculating many different classes of chemical reactions typical in industrial situations. The main objective of this chapter is to provide readers with various chemical reaction engineering models and algorithms, as well as corresponding MATLAB programs, which have found use or can potentially be used for academic or industrial applications. Throughout this chapter, differential and integral methods are used primarily in analyzing reactor data. The MATLAB programs listed here can be used in undergraduate or graduate courses on chemical reaction engineering. Researchers and practicing engineers in the field of chemical engineering can apply these MATLAB programs in the analysis and design of chemical reactors."} | 5 | +{"work_id": 4385811703, "title": "Accelerating Manufacturing Decisions using Bayesian Optimization: An Optimization and Prediction Perspective", "abstract": "Manufacturing is a promising technique for producing complex and custom-made parts with a high degree of precision. It can also provide us with desired materials and products with specified properties. To achieve that, it is crucial to find out the optimum point of process parameters that have a significant impact on the properties and quality of the final product. Unfortunately, optimizing these parameters can be challenging due to the complex and nonlinear nature of the underlying process, which becomes more complicated when there are conflicting objectives, sometimes with multiple goals. Furthermore, experiments are usually costly, time-consuming, and require expensive materials, man, and machine hours. So, each experiment is valuable and it's critical to determine the optimal experiment location to gain the most comprehensive understanding of the process. Sequential learning is a promising approach to actively learn from the ongoing experiments, iteratively update the underlying optimization routine, and adapt the data collection process on the go. This thesis presents a multi-objective Bayesian optimization framework to find out the optimum processing conditions for a manufacturing setup. It uses an acquisition function to collect data points sequentially and iteratively update its understanding of the underlying design space utilizing a Gaussian Process-based surrogate model. In manufacturing processes, the focus is often on obtaining a rough understanding of the design space using minimal experimentation, rather than finding the optimal parameters. This falls under the category of \"approximating the underlying function\" rather than design optimization. This approach can provide material scientists or manufacturing engineers with a comprehensive view of the entire design space, increasing the likelihood of making discoveries or making robust decisions. However, a precise and reliable prediction model is necessary for a good approximation. To meet this requirement, this thesis proposes an epsilon-greedy sequential prediction framework that is distinct from the optimization framework. The data acquisition strategy has been refined to balance exploration and exploitation, and a threshold has been established to determine when to switch between the two. The performance of this proposed optimization and prediction framework is evaluated using real-life datasets against the traditional design of experiments. The proposed frameworks have generated effective optimization and prediction results using fewer experiments."} | ||
| 4 | −{"work_id": 4410552772, "title": "ASKCOS: Open-Source, Data-Driven Synthesis Planning", "abstract": "ConspectusThe advancement of machine learning and the availability of large-scale reaction datasets have accelerated the development of data-driven models for computer-aided synthesis planning (CASP) in the past decade. In this Account, we describe the range of data-driven methods and models that have been incorporated into the newest version of ASKCOS, an open-source software suite for synthesis planning that we have been developing since 2016. This ongoing effort has been driven by the importance of bridging the gap between research and development, making research advances available through a freely available practical tool. ASKCOS integrates modules for retrosynthetic planning, modules for complementary capabilities of condition prediction and reaction product prediction, and several supplementary modules and utilities with various roles in synthesis planning. For retrosynthetic planning, we have developed an Interactive Path Planner (IPP) for user-guided search as well as a Tree Builder for automatic planning with two well-known tree search algorithms, Monte Carlo Tree Search (MCTS) and Retro*. Four one-step retrosynthesis models covering template-based and template-free strategies form the basis of retrosynthetic predictions and can be used simultaneously to combine their advantages and propose diverse suggestions. Strategies for assessing the feasibility of proposed reaction steps and evaluating the full pathways are built on top of several pioneering efforts that we have made in the subtasks of reaction condition recommendation, pathway scoring and clustering, and the prediction of reaction outcomes including the major product, impurities, site selectivity, and regioselectivity. In addition, we have also developed auxiliary capabilities in ASKCOS based on our past and ongoing work for solubility prediction and quantum mechanical descriptor prediction, which can provide more insight into the suitability of proposed reaction solvents or the hypothetical selectivity of desired transformations. For each of these capabilities, we highlight its relevance in the context of synthesis planning and present a comprehensive overview of how it is built on top of not only our work but also of other recent advancements in the field. We also describe in detail how chemists can easily interact with these capabilities via user-friendly interfaces. ASKCOS has assisted hundreds of medicinal, synthetic, and process chemists in their day-to-day tasks by complementing expert decision making and route ideation. It is our belief that CASP tools are an important part of modern chemistry research and offer ever-increasing utility and accessibility."} | 6 | +{"work_id": 2789843538, "title": "Minimap2: pairwise alignment for nucleotide sequences", "abstract": "Motivation: Recent advances in sequencing technologies promise ultra-long reads of \u223c100 kb in average, full-length mRNA or cDNA reads in high throughput and genomic contigs over 100 Mb in length. Existing alignment programs are unable or inefficient to process such data at scale, which presses for the development of new alignment algorithms. Results: Minimap2 is a general-purpose alignment program to map DNA or long mRNA sequences against a large reference database. It works with accurate short reads of \u2265100 bp in length, \u22651 kb genomic reads at error rate \u223c15%, full-length noisy Direct RNA or cDNA reads and assembly contigs or closely related full chromosomes of hundreds of megabases in length. Minimap2 does split-read alignment, employs concave gap cost for long insertions and deletions and introduces new heuristics to reduce spurious alignments. It is 3-4 times as fast as mainstream short-read mappers at comparable accuracy, and is \u226530 times faster than long-read genomic or cDNA mappers at higher accuracy, surpassing most aligners specialized in one type of alignment. Availability and implementation: https://github.com/lh3/minimap2. Supplementary information: Supplementary data are available at Bioinformatics online."} | ||
| 5 | −{"work_id": 4319754774, "title": "Acceptance of artificial intelligence in teaching science: Science teachers' perspective", "abstract": "Over the last few decades, there has been growing interest in artificial intelligence (AI) and how to apply it effectively in the educational process. The behavioural intention and attitudes of teachers play an important role in this regard. The technology acceptance model (TAM) has been shown to be effective in predicting factors that may positively or negatively influence behavioural intentions to use technology. The current study therefore aims to use this model to reveal teachers\u2019 perceptions of the factors that influence the use of AI applications in science education. This research uses the descriptive method where a 6-dimensional scale is designed based on the components of the TAM model and then applied to a sample of 83 science teachers in Abu Dhabi. The results show a high acceptability of the use of AI in the classroom by science teachers, with positive correlations to self-efficacy, ease of use, expected benefits, attitudes, and behavioural intentions. However, anxiety and stress do not significantly affect other factors. Regarding the predictive power of research models, the combined factors expected benefits, ease of use, and attitude toward AI applications can predict 71.4% of future behavioural changes related to the use of AI applications in science teaching. This study finds no statistically significant differences in teacher responses based on the variables gender, teaching experience, and qualifications regarding teachers\u2019 behavioural intentions to actually use AI in science teaching."} | 7 | +{"work_id": 2888532099, "title": "The Astropy Project: Building an Open-science Project and Status of the v2.0 Core Package *", "abstract": "Abstract The Astropy Project supports and fosters the development of open-source and openly developed Python packages that provide commonly needed functionality to the astronomical community. A key element of the Astropy Project is the core package astropy , which serves as the foundation for more specialized projects and packages. In this article, we provide an overview of the organization of the Astropy project and summarize key features in the core package, as of the recent major release, version 2.0. We then describe the project infrastructure designed to facilitate and support development for a broader ecosystem of interoperable packages. We conclude with a future outlook of planned new features and directions for the broader Astropy Project."} | ||
| 6 | −{"work_id": 4368755578, "title": "Automated Scientific Discovery: From Equation Discovery to Autonomous Discovery Systems", "abstract": "Abstract The paper surveys automated scientific discovery, from equation discovery and symbolic regression to autonomous discovery systems and agents. It discusses the individual approaches from a \"big picture\" perspective and in context, but also discusses open issues and recent topics like the various roles of deep neural networks in this area, aiding in the discovery of human-interpretable knowledge. Further, we will present closed-loop scientific discovery systems, starting with the pioneering work on the Adam system up to current efforts in fields from material science to astronomy. Finally, we will elaborate on autonomy from a machine learning perspective, but also in analogy to the autonomy levels in autonomous driving. The maximal level, level five, is defined to require no human intervention at all in the production of scientific knowledge. Achieving this is one step towards solving the Nobel Turing Grand Challenge to develop AI Scientists: AI systems capable of making Nobel-quality scientific discoveries highly autonomously at a level comparable, and possibly superior, to the best human scientists by 2050."} | 8 | +{"work_id": 4411463597, "title": "Boltz-2: Towards Accurate and Efficient Binding Affinity Prediction", "abstract": "Accurately modeling biomolecular interactions is a central challenge in modern biology. While recent advances, such as AlphaFold3 and Boltz-1, have substantially improved our ability to predict biomolecular complex structures, these models still fall short in predicting binding affinity, a critical property underlying molecular function and therapeutic efficacy. Here, we present Boltz-2, a new structural biology foundation model that exhibits strong performance for both structure and affinity prediction. Boltz-2 introduces controllability features including experimental method conditioning, distance constraints, and multi-chain template integration for structure prediction, and is, to our knowledge, the first AI model to approach the performance of free-energy perturbation (FEP) methods in estimating small molecule-protein binding affinity. Crucially, it achieves strong correlation with experimental readouts on many benchmarks, while being at least 1000\u00d7 more computationally efficient than FEP. By coupling Boltz-2 with a generative model for small molecules, we demonstrate an effective workflow to find diverse, synthesizable, high-affinity binders, as estimated by absolute FEP simulations on the TYK2 target. To foster broad adoption and further innovation at the intersection of machine learning and biology, we are releasing Boltz-2 weights, inference, and training code under a permissive open license, providing a robust and extensible foundation for both academic and industrial research."} | ||
| 7 | {"work_id": 3201073812, "title": "LAMMPS - a flexible simulation tool for particle-based materials modeling at the atomic, meso, and continuum scales", "abstract": "Since the classical molecular dynamics simulator LAMMPS was released as an open source code in 2004, it has become a widely-used tool for particle-based modeling of materials at length scales ranging from atomic to mesoscale to continuum. Reasons for its popularity are that it provides a wide variety of particle interaction models for different materials, that it runs on any platform from a single CPU core to the largest supercomputers with accelerators, and that it gives users control over simulation details, either via the input script or by adding code for new interatomic potentials, constraints, diagnostics, or other features needed for their models. As a result, hundreds of people have contributed new capabilities to LAMMPS and it has grown from fifty thousand lines of code in 2004 to a million lines today. In this paper several of the fundamental algorithms used in LAMMPS are described along with the design strategies which have made it flexible for both users and developers. We also highlight some capabilities recently added to the code which were enabled by this flexibility, including dynamic load balancing, on-the-fly visualization, magnetic spin dynamics models, and quantum-accuracy machine learning interatomic potentials. Program Title: Large-scale Atomic/Molecular Massively Parallel Simulator (LAMMPS) CPC Library link to program files: https://doi.org/10.17632/cxbxs9btsv.1 Developer's repository link: https://github.com/lammps/lammps Licensing provisions: GPLv2 Programming language: C++, Python, C, Fortran Supplementary material: https://www.lammps.org Nature of problem: Many science applications in physics, chemistry, materials science, and related fields require parallel, scalable, and efficient generation of long, stable classical particle dynamics trajectories. Within this common problem definition, there lies a great diversity of use cases, distinguished by different particle interaction models, external constraints, as well as timescales and lengthscales ranging from atomic to mesoscale to macroscopic. Solution method: The LAMMPS code uses parallel spatial decomposition, distributed neighbor lists, and parallel FFTs for long-range Coulombic interactions [1]. The time integration algorithm is based on the St\u00f8rmer-Verlet symplectic integrator [2], which provides better stability than higher-order non-symplectic methods. In addition, LAMMPS supports a wide range of interatomic potentials, constraints, diagnostics, software interfaces, and pre- and post-processing features. Additional comments including restrictions and unusual features: This paper serves as the definitive reference for the LAMMPS code. S. Plimpton, Fast parallel algorithms for short-range molecular dynamics. J. Comp. Phys. 117 (1995) 1\u201319. L. Verlet, Computer experiments on classical fluids: I. Thermodynamical properties of Lennard\u2013Jones molecules, Phys. Rev. 159 (1967) 98\u2013103."} | 9 | {"work_id": 3201073812, "title": "LAMMPS - a flexible simulation tool for particle-based materials modeling at the atomic, meso, and continuum scales", "abstract": "Since the classical molecular dynamics simulator LAMMPS was released as an open source code in 2004, it has become a widely-used tool for particle-based modeling of materials at length scales ranging from atomic to mesoscale to continuum. Reasons for its popularity are that it provides a wide variety of particle interaction models for different materials, that it runs on any platform from a single CPU core to the largest supercomputers with accelerators, and that it gives users control over simulation details, either via the input script or by adding code for new interatomic potentials, constraints, diagnostics, or other features needed for their models. As a result, hundreds of people have contributed new capabilities to LAMMPS and it has grown from fifty thousand lines of code in 2004 to a million lines today. In this paper several of the fundamental algorithms used in LAMMPS are described along with the design strategies which have made it flexible for both users and developers. We also highlight some capabilities recently added to the code which were enabled by this flexibility, including dynamic load balancing, on-the-fly visualization, magnetic spin dynamics models, and quantum-accuracy machine learning interatomic potentials. Program Title: Large-scale Atomic/Molecular Massively Parallel Simulator (LAMMPS) CPC Library link to program files: https://doi.org/10.17632/cxbxs9btsv.1 Developer's repository link: https://github.com/lammps/lammps Licensing provisions: GPLv2 Programming language: C++, Python, C, Fortran Supplementary material: https://www.lammps.org Nature of problem: Many science applications in physics, chemistry, materials science, and related fields require parallel, scalable, and efficient generation of long, stable classical particle dynamics trajectories. Within this common problem definition, there lies a great diversity of use cases, distinguished by different particle interaction models, external constraints, as well as timescales and lengthscales ranging from atomic to mesoscale to macroscopic. Solution method: The LAMMPS code uses parallel spatial decomposition, distributed neighbor lists, and parallel FFTs for long-range Coulombic interactions [1]. The time integration algorithm is based on the St\u00f8rmer-Verlet symplectic integrator [2], which provides better stability than higher-order non-symplectic methods. In addition, LAMMPS supports a wide range of interatomic potentials, constraints, diagnostics, software interfaces, and pre- and post-processing features. Additional comments including restrictions and unusual features: This paper serves as the definitive reference for the LAMMPS code. S. Plimpton, Fast parallel algorithms for short-range molecular dynamics. J. Comp. Phys. 117 (1995) 1\u201319. L. Verlet, Computer experiments on classical fluids: I. Thermodynamical properties of Lennard\u2013Jones molecules, Phys. Rev. 159 (1967) 98\u2013103."} | ||
| 8 | {"work_id": 7125546963, "title": "Artificial intelligence and machine learning guided optimization in drug delivery", "abstract": "The optimisation of drug delivery systems is a complex, multidimensional challenge involving the interplay of formulation composition, process parameters, and biological performance. Traditional empirical and statistical approaches are increasingly limited by the high dimensionality, nonlinearity, and multi-objective nature of modern drug delivery problems. In this review, we explore how artificial intelligence (AI) and machine learning (ML) are transforming formulation science by enabling data-driven, adaptive, and efficient optimisation strategies. We provide a conceptual and practical overview of ML-guided optimisation workflows, including surrogate modelling, Bayesian optimisation, active learning, and multi-objective optimisation. Key challenges such as data scarcity, experimental throughput, and model interpretability are discussed. Applications across diverse delivery modalities, including solid oral dosage forms, lipid nanoparticles, biologics, and long-acting injectables, are critically examined, highlighting how ML can accelerate formulation development, reduce experimental burden, and uncover novel design spaces. We conclude by outlining future directions for integrating AI into pharmaceutical R&D, with a focus on the emergence of self-driving laboratories. This review aims to equip drug delivery scientists with the foundational knowledge and practical tools to harness AI and ML in the rational design and optimisation of advanced drug delivery systems."} | 10 | {"work_id": 7125546963, "title": "Artificial intelligence and machine learning guided optimization in drug delivery", "abstract": "The optimisation of drug delivery systems is a complex, multidimensional challenge involving the interplay of formulation composition, process parameters, and biological performance. Traditional empirical and statistical approaches are increasingly limited by the high dimensionality, nonlinearity, and multi-objective nature of modern drug delivery problems. In this review, we explore how artificial intelligence (AI) and machine learning (ML) are transforming formulation science by enabling data-driven, adaptive, and efficient optimisation strategies. We provide a conceptual and practical overview of ML-guided optimisation workflows, including surrogate modelling, Bayesian optimisation, active learning, and multi-objective optimisation. Key challenges such as data scarcity, experimental throughput, and model interpretability are discussed. Applications across diverse delivery modalities, including solid oral dosage forms, lipid nanoparticles, biologics, and long-acting injectables, are critically examined, highlighting how ML can accelerate formulation development, reduce experimental burden, and uncover novel design spaces. We conclude by outlining future directions for integrating AI into pharmaceutical R&D, with a focus on the emergence of self-driving laboratories. This review aims to equip drug delivery scientists with the foundational knowledge and practical tools to harness AI and ML in the rational design and optimisation of advanced drug delivery systems."} | ||
| 9 | {"work_id": 4390940921, "title": "Solving olympiad geometry without human demonstrations", "abstract": "Abstract Proving mathematical theorems at the olympiad level represents a notable milestone in human-level automated reasoning 1\u20134 , owing to their reputed difficulty among the world\u2019s best talents in pre-university mathematics. Current machine-learning approaches, however, are not applicable to most mathematical domains owing to the high cost of translating human proofs into machine-verifiable format. The problem is even worse for geometry because of its unique translation challenges 1,5 , resulting in severe scarcity of training data. We propose AlphaGeometry, a theorem prover for Euclidean plane geometry that sidesteps the need for human demonstrations by synthesizing millions of theorems and proofs across different levels of complexity. AlphaGeometry is a neuro-symbolic system that uses a neural language model, trained from scratch on our large-scale synthetic data, to guide a symbolic deduction engine through infinite branching points in challenging problems. On a test set of 30 latest olympiad-level problems, AlphaGeometry solves 25, outperforming the previous best method that only solves ten problems and approaching the performance of an average International Mathematical Olympiad (IMO) gold medallist. Notably, AlphaGeometry produces human-readable proofs, solves all geometry problems in the IMO 2000 and 2015 under human expert evaluation and discovers a generalized version of a translated IMO theorem in 2004."} | 11 | {"work_id": 4390940921, "title": "Solving olympiad geometry without human demonstrations", "abstract": "Abstract Proving mathematical theorems at the olympiad level represents a notable milestone in human-level automated reasoning 1\u20134 , owing to their reputed difficulty among the world\u2019s best talents in pre-university mathematics. Current machine-learning approaches, however, are not applicable to most mathematical domains owing to the high cost of translating human proofs into machine-verifiable format. The problem is even worse for geometry because of its unique translation challenges 1,5 , resulting in severe scarcity of training data. We propose AlphaGeometry, a theorem prover for Euclidean plane geometry that sidesteps the need for human demonstrations by synthesizing millions of theorems and proofs across different levels of complexity. AlphaGeometry is a neuro-symbolic system that uses a neural language model, trained from scratch on our large-scale synthetic data, to guide a symbolic deduction engine through infinite branching points in challenging problems. On a test set of 30 latest olympiad-level problems, AlphaGeometry solves 25, outperforming the previous best method that only solves ten problems and approaching the performance of an average International Mathematical Olympiad (IMO) gold medallist. Notably, AlphaGeometry produces human-readable proofs, solves all geometry problems in the IMO 2000 and 2015 under human expert evaluation and discovers a generalized version of a translated IMO theorem in 2004."} | ||
| 10 | {"work_id": 2951939904, "title": "Jointly Embedding Multiple Single-Cell Omics Measurements", "abstract": "Many single-cell sequencing technologies are now available, but it is still difficult to apply multiple sequencing technologies to the same single cell. In this paper, we propose an unsupervised manifold alignment algorithm, MMD-MA, for integrating multiple measurements carried out on disjoint aliquots of a given population of cells. Effectively, MMD-MA performs an in silico co-assay by embedding cells measured in different ways into a learned latent space. In the MMD-MA algorithm, single-cell data points from multiple domains are aligned by optimizing an objective function with three components: (1) a maximum mean discrepancy (MMD) term to encourage the differently measured points to have similar distributions in the latent space, (2) a distortion term to preserve the structure of the data between the input space and the latent space, and (3) a penalty term to avoid collapse to a trivial solution. Notably, MMD-MA does not require any correspondence information across data modalities, either between the cells or between the features. Furthermore, MMD-MA\u2019s weak distributional requirements for the domains to be aligned allow the algorithm to integrate heterogeneous types of single cell measures, such as gene expression, DNA accessibility, chromatin organization, methylation, and imaging data. We demonstrate the utility of MMD-MA in simulation experiments and using a real data set involving single-cell gene expression and methylation data."} | 12 | {"work_id": 2951939904, "title": "Jointly Embedding Multiple Single-Cell Omics Measurements", "abstract": "Many single-cell sequencing technologies are now available, but it is still difficult to apply multiple sequencing technologies to the same single cell. In this paper, we propose an unsupervised manifold alignment algorithm, MMD-MA, for integrating multiple measurements carried out on disjoint aliquots of a given population of cells. Effectively, MMD-MA performs an in silico co-assay by embedding cells measured in different ways into a learned latent space. In the MMD-MA algorithm, single-cell data points from multiple domains are aligned by optimizing an objective function with three components: (1) a maximum mean discrepancy (MMD) term to encourage the differently measured points to have similar distributions in the latent space, (2) a distortion term to preserve the structure of the data between the input space and the latent space, and (3) a penalty term to avoid collapse to a trivial solution. Notably, MMD-MA does not require any correspondence information across data modalities, either between the cells or between the features. Furthermore, MMD-MA\u2019s weak distributional requirements for the domains to be aligned allow the algorithm to integrate heterogeneous types of single cell measures, such as gene expression, DNA accessibility, chromatin organization, methylation, and imaging data. We demonstrate the utility of MMD-MA in simulation experiments and using a real data set involving single-cell gene expression and methylation data."} | ||
| 11 | −{"work_id": 3029645440, "title": "Numerical optimization", "abstract": "This third edition of Braun and Murdoch's bestselling textbook now includes discussion of the use and design principles of the tidyverse packages in R, including expanded coverage of ggplot2, and R Markdown. The expanded simulation chapter introduces the Box\u2013Muller and Metropolis\u2013Hastings algorithms. New examples and exercises have been added throughout. This is the only introduction you'll need to start programming in R, the computing standard for analyzing data. This book comes with real R code that teaches the standards of the language. Unlike other introductory books on the R system, this book emphasizes portable programming skills that apply to most computing languages and techniques used to develop more complex projects. Solutions, datasets, and any errata are available from www.statprogr.science. Worked examples - from real applications - hundreds of exercises, and downloadable code, datasets, and solutions make a complete package for anyone working in or learning practical data science."} | 13 | +{"work_id": 4410552772, "title": "ASKCOS: Open-Source, Data-Driven Synthesis Planning", "abstract": "ConspectusThe advancement of machine learning and the availability of large-scale reaction datasets have accelerated the development of data-driven models for computer-aided synthesis planning (CASP) in the past decade. In this Account, we describe the range of data-driven methods and models that have been incorporated into the newest version of ASKCOS, an open-source software suite for synthesis planning that we have been developing since 2016. This ongoing effort has been driven by the importance of bridging the gap between research and development, making research advances available through a freely available practical tool. ASKCOS integrates modules for retrosynthetic planning, modules for complementary capabilities of condition prediction and reaction product prediction, and several supplementary modules and utilities with various roles in synthesis planning. For retrosynthetic planning, we have developed an Interactive Path Planner (IPP) for user-guided search as well as a Tree Builder for automatic planning with two well-known tree search algorithms, Monte Carlo Tree Search (MCTS) and Retro*. Four one-step retrosynthesis models covering template-based and template-free strategies form the basis of retrosynthetic predictions and can be used simultaneously to combine their advantages and propose diverse suggestions. Strategies for assessing the feasibility of proposed reaction steps and evaluating the full pathways are built on top of several pioneering efforts that we have made in the subtasks of reaction condition recommendation, pathway scoring and clustering, and the prediction of reaction outcomes including the major product, impurities, site selectivity, and regioselectivity. In addition, we have also developed auxiliary capabilities in ASKCOS based on our past and ongoing work for solubility prediction and quantum mechanical descriptor prediction, which can provide more insight into the suitability of proposed reaction solvents or the hypothetical selectivity of desired transformations. For each of these capabilities, we highlight its relevance in the context of synthesis planning and present a comprehensive overview of how it is built on top of not only our work but also of other recent advancements in the field. We also describe in detail how chemists can easily interact with these capabilities via user-friendly interfaces. ASKCOS has assisted hundreds of medicinal, synthetic, and process chemists in their day-to-day tasks by complementing expert decision making and route ideation. It is our belief that CASP tools are an important part of modern chemistry research and offer ever-increasing utility and accessibility."} | ||
| 12 | −{"work_id": 2804822363, "title": "SWISS-MODEL: homology modelling of protein structures and complexes", "abstract": "Homology modelling has matured into an important technique in structural biology, significantly contributing to narrowing the gap between known protein sequences and experimentally determined structures. Fully automated workflows and servers simplify and streamline the homology modelling process, also allowing users without a specific computational expertise to generate reliable protein models and have easy access to modelling results, their visualization and interpretation. Here, we present an update to the SWISS-MODEL server, which pioneered the field of automated modelling 25 years ago and been continuously further developed. Recently, its functionality has been extended to the modelling of homo- and heteromeric complexes. Starting from the amino acid sequences of the interacting proteins, both the stoichiometry and the overall structure of the complex are inferred by homology modelling. Other major improvements include the implementation of a new modelling engine, ProMod3 and the introduction a new local model quality estimation method, QMEANDisCo. SWISS-MODEL is freely available at https://swissmodel.expasy.org."} | 14 | +{"work_id": 4288039037, "title": "Scientific Machine Learning Through Physics\u2013Informed Neural Networks: Where we are and What\u2019s Next", "abstract": "Abstract Physics-Informed Neural Networks (PINN) are neural networks (NNs) that encode model equations, like Partial Differential Equations (PDE), as a component of the neural network itself. PINNs are nowadays used to solve PDEs, fractional equations, integral-differential equations, and stochastic PDEs. This novel methodology has arisen as a multi-task learning framework in which a NN must fit observed data while reducing a PDE residual. This article provides a comprehensive review of the literature on PINNs: while the primary goal of the study was to characterize these networks and their related advantages and disadvantages. The review also attempts to incorporate publications on a broader range of collocation-based physics informed neural networks, which stars form the vanilla PINN, as well as many other variants, such as physics-constrained neural networks (PCNN), variational hp-VPINN, and conservative PINN (CPINN). The study indicates that most research has focused on customizing the PINN through different activation functions, gradient optimization techniques, neural network structures, and loss function structures. Despite the wide range of applications for which PINNs have been used, by demonstrating their ability to be more feasible in some contexts than classical numerical techniques like Finite Element Method (FEM), advancements are still possible, most notably theoretical issues that remain unresolved."} | ||
| 13 | −{"work_id": 3156458251, "title": "Interactive Tree Of Life (iTOL) v5: an online tool for phylogenetic tree display and annotation", "abstract": "The Interactive Tree Of Life (https://itol.embl.de) is an online tool for the display, manipulation and annotation of phylogenetic and other trees. It is freely available and open to everyone. iTOL version 5 introduces a completely new tree display engine, together with numerous new features. For example, a new dataset type has been added (MEME motifs), while annotation options have been expanded for several existing ones. Node metadata display options have been extended and now also support non-numerical categorical values, as well as multiple values per node. Direct manual annotation is now available, providing a set of basic drawing and labeling tools, allowing users to draw shapes, labels and other features by hand directly onto the trees. Support for tree and dataset scales has been extended, providing fine control over line and label styles. Unrooted tree displays can now use the equal-daylight algorithm, proving a much greater display clarity. The user account system has been streamlined and expanded with new navigation options and currently handles >1 million trees from >70 000 individual users."} | 15 | +{"work_id": 2927961455, "title": "Interactive Tree Of Life (iTOL) v4: recent updates and new developments", "abstract": "The Interactive Tree Of Life (https://itol.embl.de) is an online tool for the display, manipulation and annotation of phylogenetic and other trees. It is freely available and open to everyone. The current version introduces four new dataset types, together with numerous new features. Annotation options have been expanded and new control options added for many display elements. An interactive spreadsheet-like editor has been implemented, providing dataset creation and editing directly in the web interface. Font support has been rewritten with full support for UTF-8 character encoding throughout the user interface. Google Web Fonts are now fully supported in the tree text labels. iTOL v4 is the first tool which supports direct visualization of Qiime 2 trees and associated annotations. The user account system has been streamlined and expanded with new navigation options, and currently handles >700 000 trees from more than 40 000 individual users. Full batch access has been implemented allowing programmatic upload and export of trees and annotations."} | ||
| 14 | −{"work_id": 7128476819, "title": "The future of fundamental science led by generative closed-loop artificial intelligence", "abstract": "Artificial intelligence is approaching the point at which it can complete the scientific cycle, from hypothesis generation to experimental design and validation, within a closed loop that requires little human intervention. Yet, the loop is not fully autonomous: humans still curate data, set hyperparameters, adjudicate interpretability, and decide what counts as a satisfactory explanation. As models scale, they begin to explore regions of hypothesis and solution space that are inaccessible to human reasoning because they are too intricate or alien to our intuitions. Scientists may soon rely on AI strategies they do not fully understand, trusting goals and empirical payoffs rather than derivations. This prospect forces a choice about how much control to relinquish to accelerate discovery while keeping outputs human relevant. The answer cannot be a blanket policy to deploy LLMs or any single paradigm everywhere. It demands principled matching of methods to domains, hybrid causal and neurosymbolic scaffolds around generative models, and governance that preserves plurality and counters recursive bias. Otherwise, recursive training and uncritical reuse risk model collapse in AI and an epistemic collapse in science, as statistical inertia amplifies flaws and narrows the investigation. We argue for graded autonomy in AI-conducted science: systems that can close the loop at machine speed, while remaining anchored to human priorities, verifiable mechanisms, and domain-appropriate forms of understanding."} | 16 | +{"work_id": 4386373863, "title": "PyMC: a modern, and comprehensive probabilistic programming framework in Python", "abstract": "PyMC is a probabilistic programming library for Python that provides tools for constructing and fitting Bayesian models. It offers an intuitive, readable syntax that is close to the natural syntax statisticians use to describe models. PyMC leverages the symbolic computation library PyTensor, allowing it to be compiled into a variety of computational backends, such as C, JAX, and Numba, which in turn offer access to different computational architectures including CPU, GPU, and TPU. Being a general modeling framework, PyMC supports a variety of models including generalized hierarchical linear regression and classification, time series, ordinary differential equations (ODEs), and non-parametric models such as Gaussian processes (GPs). We demonstrate PyMC's versatility and ease of use with examples spanning a range of common statistical models. Additionally, we discuss the positive role of PyMC in the development of the open-source ecosystem for probabilistic programming."} | ||
| 15 | −{"work_id": 2888532099, "title": "The Astropy Project: Building an Open-science Project and Status of the v2.0 Core Package *", "abstract": "Abstract The Astropy Project supports and fosters the development of open-source and openly developed Python packages that provide commonly needed functionality to the astronomical community. A key element of the Astropy Project is the core package astropy , which serves as the foundation for more specialized projects and packages. In this article, we provide an overview of the organization of the Astropy project and summarize key features in the core package, as of the recent major release, version 2.0. We then describe the project infrastructure designed to facilitate and support development for a broader ecosystem of interoperable packages. We conclude with a future outlook of planned new features and directions for the broader Astropy Project."} | 17 | +{"work_id": 3098269892, "title": "Automatic Chemical Design Using a Data-Driven Continuous Representation of Molecules.", "abstract": "We report a method to convert discrete representations of molecules to and from a multidimensional continuous representation. This model allows us to generate new molecules for efficient exploration and optimization through open-ended spaces of chemical compounds. A deep neural network was trained on hundreds of thousands of existing chemical structures to construct three coupled functions: an encoder, a decoder, and a predictor. The encoder converts the discrete representation of a molecule into a real-valued continuous vector, and the decoder converts these continuous vectors back to discrete molecular representations. The predictor estimates chemical properties from the latent continuous vector representation of the molecule. Continuous representations of molecules allow us to automatically generate novel chemical structures by performing simple operations in the latent space, such as decoding random vectors, perturbing known chemical structures, or interpolating between molecules. Continuous representations also allow the use of powerful gradient-based optimization to efficiently guide the search for optimized functional compounds. We demonstrate our method in the domain of drug-like molecules and also in a set of molecules with fewer that nine heavy atoms."} | ||
| 16 | −{"work_id": 4411463597, "title": "Boltz-2: Towards Accurate and Efficient Binding Affinity Prediction", "abstract": "Accurately modeling biomolecular interactions is a central challenge in modern biology. While recent advances, such as AlphaFold3 and Boltz-1, have substantially improved our ability to predict biomolecular complex structures, these models still fall short in predicting binding affinity, a critical property underlying molecular function and therapeutic efficacy. Here, we present Boltz-2, a new structural biology foundation model that exhibits strong performance for both structure and affinity prediction. Boltz-2 introduces controllability features including experimental method conditioning, distance constraints, and multi-chain template integration for structure prediction, and is, to our knowledge, the first AI model to approach the performance of free-energy perturbation (FEP) methods in estimating small molecule-protein binding affinity. Crucially, it achieves strong correlation with experimental readouts on many benchmarks, while being at least 1000\u00d7 more computationally efficient than FEP. By coupling Boltz-2 with a generative model for small molecules, we demonstrate an effective workflow to find diverse, synthesizable, high-affinity binders, as estimated by absolute FEP simulations on the TYK2 target. To foster broad adoption and further innovation at the intersection of machine learning and biology, we are releasing Boltz-2 weights, inference, and training code under a permissive open license, providing a robust and extensible foundation for both academic and industrial research."} | ||||
| 17 | −{"work_id": 4365512576, "title": "ChatGPT: A comprehensive review on background, applications, key challenges, bias, ethics, limitations and future scope", "abstract": "In recent years, artificial intelligence (AI) and machine learning have been transforming the landscape of scientific research. Out of which, the chatbot technology has experienced tremendous advancements in recent years, especially with ChatGPT emerging as a notable AI language model. This comprehensive review delves into the background, applications, key challenges, and future directions of ChatGPT. We begin by exploring its origins, development, and underlying technology, before examining its wide-ranging applications across industries such as customer service, healthcare, and education. We also highlight the critical challenges that ChatGPT faces, including ethical concerns, data biases, and safety issues, while discussing potential mitigation strategies. Finally, we envision the future of ChatGPT by exploring areas of further research and development, focusing on its integration with other technologies, improved human-AI interaction, and addressing the digital divide. This review offers valuable insights for researchers, developers, and stakeholders interested in the ever-evolving landscape of AI-driven conversational agents. This study explores the various ways ChatGPT has been revolutionizing scientific research, spanning from data processing and hypothesis generation to collaboration and public outreach. Furthermore, the paper examines the potential challenges and ethical concerns surrounding the use of ChatGPT in research, while highlighting the importance of striking a balance between AI-assisted innovation and human expertise. The paper presents several ethical issues in existing computing domain and how ChatGPT can invoke challenges to such notion. This work also includes some biases and limitations of ChatGPT. It is worth to note that despite of several controversies and ethical concerns, ChatGPT has attracted remarkable attentions from academia, research, and industries in a very short span of time."} | ||||
| 18 | −{"work_id": 3097145107, "title": "PubChem in 2021: new data content and improved web interfaces", "abstract": "PubChem (https://pubchem.ncbi.nlm.nih.gov) is a popular chemical information resource that serves the scientific community as well as the general public, with millions of unique users per month. In the past two years, PubChem made substantial improvements. Data from more than 100 new data sources were added to PubChem, including chemical-literature links from Thieme Chemistry, chemical and physical property links from SpringerMaterials, and patent links from the World Intellectual Properties Organization (WIPO). PubChem's homepage and individual record pages were updated to help users find desired information faster. This update involved a data model change for the data objects used by these pages as well as by programmatic users. Several new services were introduced, including the PubChem Periodic Table and Element pages, Pathway pages, and Knowledge panels. Additionally, in response to the coronavirus disease 2019 (COVID-19) outbreak, PubChem created a special data collection that contains PubChem data related to COVID-19 and the severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2)."} | ||||
| 19 | −{"work_id": 4389991792, "title": "Autonomous chemical research with large language models", "abstract": "Abstract Transformer-based large language models are making significant strides in various fields, such as natural language processing 1\u20135 , biology 6,7 , chemistry 8\u201310 and computer programming 11,12 . Here, we show the development and capabilities of Coscientist, an artificial intelligence system driven by GPT-4 that autonomously designs, plans and performs complex experiments by incorporating large language models empowered by tools such as internet and documentation search, code execution and experimental automation. Coscientist showcases its potential for accelerating research across six diverse tasks, including the successful reaction optimization of palladium-catalysed cross-couplings, while exhibiting advanced capabilities for (semi-)autonomous experimental design and execution. Our findings demonstrate the versatility, efficacy and explainability of artificial intelligence systems like Coscientist in advancing research."} | ||||
| 20 | −{"work_id": 3168436232, "title": "AutoDock Vina 1.2.0: New Docking Methods, Expanded Force Field, and Python Bindings", "abstract": "AutoDock Vina is arguably one of the fastest and most widely used open-source programs for molecular docking. However, compared to other programs in the AutoDock Suite, it lacks support for modeling specific features such as macrocycles or explicit water molecules. Here, we describe the implementation of this functionality in AutoDock Vina 1.2.0. Additionally, AutoDock Vina 1.2.0 supports the AutoDock4.2 scoring function, simultaneous docking of multiple ligands, and a batch mode for docking a large number of ligands. Furthermore, we implemented Python bindings to facilitate scripting and the development of docking workflows. This work is an effort toward the unification of the features of the AutoDock4 and AutoDock Vina programs. The source code is available at https://github.com/ccsb-scripps/AutoDock-Vina."} | ||||
| 21 | −{"work_id": 4242546620, "title": "DPLYR", "abstract": "Dplyr is one of my favorite R packages. Its logical and consistent rules replace the older, motley collection of syntactically inconsistent packages and functions. It\u2019s like a Swiss Army knife in the woods\u2014don\u2019t leave home without it."} | ||||
| 22 | {"work_id": 2899070097, "title": "PubChem 2019 update: improved access to chemical data", "abstract": "PubChem (https://pubchem.ncbi.nlm.nih.gov) is a key chemical information resource for the biomedical research community. Substantial improvements were made in the past few years. New data content was added, including spectral information, scientific articles mentioning chemicals, and information for food and agricultural chemicals. PubChem released new web interfaces, such as PubChem Target View page, Sources page, Bioactivity dyad pages and Patent View page. PubChem also released a major update to PubChem Widgets and introduced a new programmatic access interface, called PUG-View. This paper describes these new developments in PubChem."} | 18 | {"work_id": 2899070097, "title": "PubChem 2019 update: improved access to chemical data", "abstract": "PubChem (https://pubchem.ncbi.nlm.nih.gov) is a key chemical information resource for the biomedical research community. Substantial improvements were made in the past few years. New data content was added, including spectral information, scientific articles mentioning chemicals, and information for food and agricultural chemicals. PubChem released new web interfaces, such as PubChem Target View page, Sources page, Bioactivity dyad pages and Patent View page. PubChem also released a major update to PubChem Widgets and introduced a new programmatic access interface, called PUG-View. This paper describes these new developments in PubChem."} | ||
| 23 | {"work_id": 4400064820, "title": "Less can be more for predicting properties with large language models", "abstract": "Abstract Predicting properties from coordinate\u2013category data\u2014sets of vectors paired with categorical information\u2014is fundamental to computational science, manifesting in materials science as predicting formation energies or elastic moduli from crystal structures. While large language models (LLMs) have increasingly been applied to such tasks, optimal strategies for achieving reliable predictions remain elusive. Here we report fundamental limitations in LLM\u2019s ability to learn from coordinate information in coordinate\u2013category data. Through systematic experiments using synthetic datasets with tunable coordinate and category contributions, and a comprehensive benchmarking framework (MatText), we find that LLMs consistently fail to capture coordinate information while excelling at category patterns. This geometric blindness persists regardless of model size (up to 70 billion parameters), dataset scale (up to 2 \u00d7 10 6 structures) or text representation strategy. For material property prediction tasks dominated by structural effects, specialized geometric architectures consistently outperform LLMs, as evidenced by a clear \u2018Graph Neural Network Language Model (GNN-LM) wall\u2019 in performance benchmarks. Our analysis provides concrete guidelines for architecture selection in scientific machine learning."} | 19 | {"work_id": 4400064820, "title": "Less can be more for predicting properties with large language models", "abstract": "Abstract Predicting properties from coordinate\u2013category data\u2014sets of vectors paired with categorical information\u2014is fundamental to computational science, manifesting in materials science as predicting formation energies or elastic moduli from crystal structures. While large language models (LLMs) have increasingly been applied to such tasks, optimal strategies for achieving reliable predictions remain elusive. Here we report fundamental limitations in LLM\u2019s ability to learn from coordinate information in coordinate\u2013category data. Through systematic experiments using synthetic datasets with tunable coordinate and category contributions, and a comprehensive benchmarking framework (MatText), we find that LLMs consistently fail to capture coordinate information while excelling at category patterns. This geometric blindness persists regardless of model size (up to 70 billion parameters), dataset scale (up to 2 \u00d7 10 6 structures) or text representation strategy. For material property prediction tasks dominated by structural effects, specialized geometric architectures consistently outperform LLMs, as evidenced by a clear \u2018Graph Neural Network Language Model (GNN-LM) wall\u2019 in performance benchmarks. Our analysis provides concrete guidelines for architecture selection in scientific machine learning."} | ||
| 24 | {"work_id": 3011072970, "title": "Network-based drug repurposing for novel coronavirus 2019-nCoV/SARS-CoV-2", "abstract": "Abstract Human Coronaviruses (HCoVs), including severe acute respiratory syndrome coronavirus (SARS-CoV), Middle east respiratory syndrome coronavirus (MERS-CoV), and 2019 novel coronavirus (2019-nCoV), lead global epidemics with high morbidity and mortality. However, there are currently no effective drugs targeting 2019-nCoV. Drug repurposing, represented as an effective drug discovery strategy from existing drugs, could shorten the time and reduce the cost compared to de novo drug discovery. In this study, we present an integrative, antiviral drug repurposing methodology implementing a systems pharmacology-based network medicine platform, quantifying the interplay between the HCoV-host interactome and drug targets in the human protein-protein interaction network. Phylogenetic analyses of 15 HCoV whole genomes reveal that 2019-nCoV has the highest nucleotide sequence identity with SARS-CoV (79.7%) among the six other known pathogenic HCoVs. Specifically, the envelope and nucleocapsid proteins of 2019-nCoV are two evolutionarily conserved regions, having the sequence identities of 96% and 89.6%, respectively, compared to SARS-CoV. Using network proximity analyses of drug targets and known HCoV-host interactions in the human protein-protein interactome, we computationally identified 135 putative repurposable drugs for the potential prevention and treatment of HCoVs. In addition, we prioritized 16 potential anti-HCoV repurposable drugs (including melatonin, mercaptopurine, and sirolimus) that were further validated by enrichment analyses of drug-gene signatures and HCoV-induced transcriptomics data in human cell lines. Finally, we showcased three potential drug combinations (including sirolimus plus dactinomycin, mercaptopurine plus melatonin, and toremifene plus emodin) captured by the \u2018 Complementary Exposure\u2019 pattern: the targets of the drugs both hit the HCoV-host subnetwork, but target separate neighborhoods in the human protein-protein interactome network. In summary, this study offers powerful network-based methodologies for rapid identification of candidate repurposable drugs and potential drug combinations toward future clinical trials for HCoVs."} | 20 | {"work_id": 3011072970, "title": "Network-based drug repurposing for novel coronavirus 2019-nCoV/SARS-CoV-2", "abstract": "Abstract Human Coronaviruses (HCoVs), including severe acute respiratory syndrome coronavirus (SARS-CoV), Middle east respiratory syndrome coronavirus (MERS-CoV), and 2019 novel coronavirus (2019-nCoV), lead global epidemics with high morbidity and mortality. However, there are currently no effective drugs targeting 2019-nCoV. Drug repurposing, represented as an effective drug discovery strategy from existing drugs, could shorten the time and reduce the cost compared to de novo drug discovery. In this study, we present an integrative, antiviral drug repurposing methodology implementing a systems pharmacology-based network medicine platform, quantifying the interplay between the HCoV-host interactome and drug targets in the human protein-protein interaction network. Phylogenetic analyses of 15 HCoV whole genomes reveal that 2019-nCoV has the highest nucleotide sequence identity with SARS-CoV (79.7%) among the six other known pathogenic HCoVs. Specifically, the envelope and nucleocapsid proteins of 2019-nCoV are two evolutionarily conserved regions, having the sequence identities of 96% and 89.6%, respectively, compared to SARS-CoV. Using network proximity analyses of drug targets and known HCoV-host interactions in the human protein-protein interactome, we computationally identified 135 putative repurposable drugs for the potential prevention and treatment of HCoVs. In addition, we prioritized 16 potential anti-HCoV repurposable drugs (including melatonin, mercaptopurine, and sirolimus) that were further validated by enrichment analyses of drug-gene signatures and HCoV-induced transcriptomics data in human cell lines. Finally, we showcased three potential drug combinations (including sirolimus plus dactinomycin, mercaptopurine plus melatonin, and toremifene plus emodin) captured by the \u2018 Complementary Exposure\u2019 pattern: the targets of the drugs both hit the HCoV-host subnetwork, but target separate neighborhoods in the human protein-protein interactome network. In summary, this study offers powerful network-based methodologies for rapid identification of candidate repurposable drugs and potential drug combinations toward future clinical trials for HCoVs."} | ||
| 25 | {"work_id": 3008142620, "title": "Analysis of therapeutic targets for SARS-CoV-2 and discovery of potential drugs by computational methods", "abstract": "SARS-CoV-2 has caused tens of thousands of infections and more than one thousand deaths. There are currently no registered therapies for treating coronavirus infections. Because of time consuming process of new drug development, drug repositioning may be the only solution to the epidemic of sudden infectious diseases. We systematically analyzed all the proteins encoded by SARS-CoV-2 genes, compared them with proteins from other coronaviruses, predicted their structures, and built 19 structures that could be done by homology modeling. By performing target-based virtual ligand screening, a total of 21 targets (including two human targets) were screened against compound libraries including ZINC drug database and our own database of natural products. Structure and screening results of important targets such as 3-chymotrypsin-like protease (3CLpro), Spike, RNA-dependent RNA polymerase (RdRp), and papain like protease (PLpro) were discussed in detail. In addition, a database of 78 commonly used anti-viral drugs including those currently on the market and undergoing clinical trials for SARS-CoV-2 was constructed. Possible targets of these compounds and potential drugs acting on a certain target were predicted. This study will provide new lead compounds and targets for further in vitro and in vivo studies of SARS-CoV-2, new insights for those drugs currently ongoing clinical studies, and also possible new strategies for drug repositioning to treat SARS-CoV-2 infections."} | 21 | {"work_id": 3008142620, "title": "Analysis of therapeutic targets for SARS-CoV-2 and discovery of potential drugs by computational methods", "abstract": "SARS-CoV-2 has caused tens of thousands of infections and more than one thousand deaths. There are currently no registered therapies for treating coronavirus infections. Because of time consuming process of new drug development, drug repositioning may be the only solution to the epidemic of sudden infectious diseases. We systematically analyzed all the proteins encoded by SARS-CoV-2 genes, compared them with proteins from other coronaviruses, predicted their structures, and built 19 structures that could be done by homology modeling. By performing target-based virtual ligand screening, a total of 21 targets (including two human targets) were screened against compound libraries including ZINC drug database and our own database of natural products. Structure and screening results of important targets such as 3-chymotrypsin-like protease (3CLpro), Spike, RNA-dependent RNA polymerase (RdRp), and papain like protease (PLpro) were discussed in detail. In addition, a database of 78 commonly used anti-viral drugs including those currently on the market and undergoing clinical trials for SARS-CoV-2 was constructed. Possible targets of these compounds and potential drugs acting on a certain target were predicted. This study will provide new lead compounds and targets for further in vitro and in vivo studies of SARS-CoV-2, new insights for those drugs currently ongoing clinical studies, and also possible new strategies for drug repositioning to treat SARS-CoV-2 infections."} | ||
| 26 | −{"work_id": 2913606428, "title": "PsychoPy2: Experiments in behavior made easy", "abstract": "PsychoPy is an application for the creation of experiments in behavioral science (psychology, neuroscience, linguistics, etc.) with precise spatial control and timing of stimuli. It now provides a choice of interface; users can write scripts in Python if they choose, while those who prefer to construct experiments graphically can use the new Builder interface. Here we describe the features that have been added over the last 10 years of its development. The most notable addition has been that Builder interface, allowing users to create studies with minimal or no programming, while also allowing the insertion of Python code for maximal flexibility. We also present some of the other new features, including further stimulus options, asynchronous time-stamped hardware polling, and better support for open science and reproducibility. Tens of thousands of users now launch PsychoPy every month, and more than 90 people have contributed to the code. We discuss the current state of the project, as well as plans for the future."} | 22 | +{"work_id": 3161540023, "title": "Visualizations with statistical details: The 'ggstatsplot' approach", "abstract": "Graphical displays can reveal problems in a statistical model that might not be apparent from purely numerical summaries.Such visualizations can also be helpful for the reader to evaluate the validity of a model if it is reported in a scholarly publication or report.But, given the onerous costs involved, researchers often avoid preparing information-rich graphics and exploring several statistical approaches or tests available.The ggstatsplot package in the R programming language (R Core Team, 2021) provides a one-line syntax to enrich ggplot2based visualizations with the results from statistical analysis embedded in the visualization itself.In doing so, the package helps researchers adopt a rigorous, reliable, and robust data exploratory and reporting workflow."} | ||
| 27 | −{"work_id": 2899760200, "title": "The PRIDE database and related tools and resources in 2019: improving support for quantification data", "abstract": "The PRoteomics IDEntifications (PRIDE) database (https://www.ebi.ac.uk/pride/) is the world's largest data repository of mass spectrometry-based proteomics data, and is one of the founding members of the global ProteomeXchange (PX) consortium. In this manuscript, we summarize the developments in PRIDE resources and related tools since the previous update manuscript was published in Nucleic Acids Research in 2016. In the last 3 years, public data sharing through PRIDE (as part of PX) has definitely become the norm in the field. In parallel, data re-use of public proteomics data has increased enormously, with multiple applications. We first describe the new architecture of PRIDE Archive, the archival component of PRIDE. PRIDE Archive and the related data submission framework have been further developed to support the increase in submitted data volumes and additional data types. A new scalable and fault tolerant storage backend, Application Programming Interface and web interface have been implemented, as a part of an ongoing process. Additionally, we emphasize the improved support for quantitative proteomics data through the mzTab format. At last, we outline key statistics on the current data contents and volume of downloads, and how PRIDE data are starting to be disseminated to added-value resources including Ensembl, UniProt and Expression Atlas."} | ||||
| 28 | −{"work_id": 3208691473, "title": "The PRIDE database resources in 2022: a hub for mass spectrometry-based proteomics evidences", "abstract": "The PRoteomics IDEntifications (PRIDE) database (https://www.ebi.ac.uk/pride/) is the world's largest data repository of mass spectrometry-based proteomics data. PRIDE is one of the founding members of the global ProteomeXchange (PX) consortium and an ELIXIR core data resource. In this manuscript, we summarize the developments in PRIDE resources and related tools since the previous update manuscript was published in Nucleic Acids Research in 2019. The number of submitted datasets to PRIDE Archive (the archival component of PRIDE) has reached on average around 500 datasets per month during 2021. In addition to continuous improvements in PRIDE Archive data pipelines and infrastructure, the PRIDE Spectra Archive has been developed to provide direct access to the submitted mass spectra using Universal Spectrum Identifiers. As a key point, the file format MAGE-TAB for proteomics has been developed to enable the improvement of sample metadata annotation. Additionally, the resource PRIDE Peptidome provides access to aggregated peptide/protein evidences across PRIDE Archive. Furthermore, we will describe how PRIDE has increased its efforts to reuse and disseminate high-quality proteomics data into other added-value resources such as UniProt, Ensembl and Expression Atlas."} | ||||
| 29 | −{"work_id": 4395010444, "title": "ProTox 3.0: a webserver for the prediction of toxicity of chemicals", "abstract": "Interaction with chemicals, present in drugs, food, environments, and consumer goods, is an integral part of our everyday life. However, depending on the amount and duration, such interactions can also result in adverse effects. With the increase in computational methods, the in silico methods can offer significant benefits to both regulatory needs and requirements for risk assessments and the pharmaceutical industry to assess the safety profile of a chemical. Here, we present ProTox 3.0, which incorporates molecular similarity and machine-learning models for the prediction of 61 toxicity endpoints such as acute toxicity, organ toxicity, clinical toxicity, molecular-initiating events (MOE), adverse outcomes (Tox21) pathways, several other toxicological endpoints and toxicity off-targets. All the ProTox 3.0 models are validated on independent external sets and have shown strong performance. ProTox envisages itself as a complete, freely available computational platform for in silico toxicity prediction for toxicologists, regulatory agencies, computational chemists, and medicinal chemists. The ProTox 3.0 webserver is free and open to all users, and there is no login requirement and can be accessed via https://tox.charite.de. The web server takes a 2D chemical structure as input and reports the toxicological profile of the compound for each endpoint with a confidence score and overall toxicity radar plot and network plot."} | ||||
| 30 | −{"work_id": 4393936599, "title": "ADMETlab 3.0: an updated comprehensive online ADMET prediction platform enhanced with broader coverage, improved performance, API functionality and decision support", "abstract": "ADMETlab 3.0 is the second updated version of the web server that provides a comprehensive and efficient platform for evaluating ADMET-related parameters as well as physicochemical properties and medicinal chemistry characteristics involved in the drug discovery process. This new release addresses the limitations of the previous version and offers broader coverage, improved performance, API functionality, and decision support. For supporting data and endpoints, this version includes 119 features, an increase of 31 compared to the previous version. The updated number of entries is 1.5 times larger than the previous version with over 400 000 entries. ADMETlab 3.0 incorporates a multi-task DMPNN architecture coupled with molecular descriptors, a method that not only guaranteed calculation speed for each endpoint simultaneously, but also achieved a superior performance in terms of accuracy and robustness. In addition, an API has been introduced to meet the growing demand for programmatic access to large amounts of data in ADMETlab 3.0. Moreover, this version includes uncertainty estimates in the prediction results, aiding in the confident selection of candidate compounds for further studies and experiments. ADMETlab 3.0 is publicly for access without the need for registration at: https://admetlab3.scbdd.com."} | ||||
| 31 | −{"work_id": 2990427812, "title": "Welcome to the Tidyverse", "abstract": "At a high level, the tidyverse is a language for solving data science challenges with R code.Its primary goal is to facilitate a conversation between a human and a computer about data.Less abstractly, the tidyverse is a collection of R packages that share a high-level design philosophy and low-level grammar and data structures, so that learning one package makes it easier to learn the next."} | ||||
| 32 | {"work_id": 3133457239, "title": "Numerical methods for topography simulation", "abstract": "Die Simulation von Herstellungsschritten in der Halbleiterfertigung erlaubt nicht nurein besseres Verst\u00e4ndnis der zugrunde liegenden Physik, sondern auch die Prozessop-timierung ohne teure Experimente. Viele Schritte in der Prozesskette, um integrierte Schaltungen herzustellen, ver\u00e4ndern die Topographie der Waferoberfl\u00e4che durch \u00c4tzenoder Abscheidung neuer Materialschichten. Diese Arbeit pr\u00e4sentiert neue numerische Verfahren, die eine effiziente und genaue Simulation solcher Prozesse erlauben. Ein Hauptproblem der Topographiesimulation stellt die korrekte zeitliche Beschreibung der geometrischen Ver\u00e4nderungen, insbesondere in drei Dimensionen, dar. Daher wurde basierend auf der Level-Set-Methode eine Technikentwickelt, die neueste Algorithmen und Datenstrukturen, wie die Sparse-Field-Methode oder hierarchische Laufl\u00e4ngenkodierung, benutzt, um Rechenzeit sowie Speicherverbrauch zu minimierenund die Zeitentwicklung gro\u00dfer dreidimensionaler Geometrien zu erm\u00f6glichen. Eine genaue Ber\u00fccksichtigung verschiedenener Materialschichten und derdavon abh\u00e4ngigen Oberfl\u00e4chenraten ist f\u00fcr \u00c4tzprozesse besonders wichtig und konnte mit einer neuartigen Multi-Level-Set-Methode erreicht werden. Zudem wurden Algorithmen f\u00fcr diversegeometrische Operationen und f\u00fcr den Test auf gerichtete Sichtbarkeit und Konnektivit\u00e4t verwirklicht. Um moderne Multikernprozessoren auszun\u00fctzen, wird ein neuer Ansatz f\u00fcr die Parallelisierung der hierarchischen Laufl\u00e4ngenkodierung pr\u00e4sentiert. Ein weiteres Problem ist die Bestimmung der Oberfl\u00e4chenraten f\u00fcr realistische Topo-graphiesimulationen. Erweiterte Modelle f\u00fcr die Beschreibung der Oberfl\u00e4chenkinetikerfordern die Kenntnis der Teilchenflussverteilung an der Oberfl\u00e4che. Obwohl meistensballistischer Teilchentransport angenommen werden kann,ist die Berechnung dennochsehr aufw \u0308andig, wenn Reemissionen oder spiegelartige Reflexionen ber\u00fccksichtigt werden sollen. Simulationen sind daher oft limitiert auf vereinfachte Modelle oder kleineStrukturen. Ein vielversprechender Ansatz, um diese Einschr\u00e4nkung zu \u00fcberwinden, ist eine Monte-Carlo-Methode, die durch die Simulation vieler Teilchentrajektoriendie Flussverteilung bestimmt. Diese Arbeit pr\u00e4sentiert ein neues Verfahren, das diese Monte-Carlo-Berechnung direkt auf die implizite Oberfl\u00e4chendarstellung der Level-Set-Methode anwendet. Zudem wurde der Rechenaufwand durchdie Anwendung vonerweiterten Raytracing-Algorithmen und -Datenstrukturen, die f\u00fcr die Bed\u00fcrfnisse von Topographiesimulationen adaptiert und optimiert wurden,reduziert. Schlussendlich werden die gezeigten numerischen Methodenanhand verschiedener inder Literatur beschriebene Prozessmodelle getestet, um die vielf\u00e4ltige Anwendbarkeit, insbesondere f\u00fcr gro\u00dfe dreidimensionale Strukturen, zu demonstrieren."} | 23 | {"work_id": 3133457239, "title": "Numerical methods for topography simulation", "abstract": "Die Simulation von Herstellungsschritten in der Halbleiterfertigung erlaubt nicht nurein besseres Verst\u00e4ndnis der zugrunde liegenden Physik, sondern auch die Prozessop-timierung ohne teure Experimente. Viele Schritte in der Prozesskette, um integrierte Schaltungen herzustellen, ver\u00e4ndern die Topographie der Waferoberfl\u00e4che durch \u00c4tzenoder Abscheidung neuer Materialschichten. Diese Arbeit pr\u00e4sentiert neue numerische Verfahren, die eine effiziente und genaue Simulation solcher Prozesse erlauben. Ein Hauptproblem der Topographiesimulation stellt die korrekte zeitliche Beschreibung der geometrischen Ver\u00e4nderungen, insbesondere in drei Dimensionen, dar. Daher wurde basierend auf der Level-Set-Methode eine Technikentwickelt, die neueste Algorithmen und Datenstrukturen, wie die Sparse-Field-Methode oder hierarchische Laufl\u00e4ngenkodierung, benutzt, um Rechenzeit sowie Speicherverbrauch zu minimierenund die Zeitentwicklung gro\u00dfer dreidimensionaler Geometrien zu erm\u00f6glichen. Eine genaue Ber\u00fccksichtigung verschiedenener Materialschichten und derdavon abh\u00e4ngigen Oberfl\u00e4chenraten ist f\u00fcr \u00c4tzprozesse besonders wichtig und konnte mit einer neuartigen Multi-Level-Set-Methode erreicht werden. Zudem wurden Algorithmen f\u00fcr diversegeometrische Operationen und f\u00fcr den Test auf gerichtete Sichtbarkeit und Konnektivit\u00e4t verwirklicht. Um moderne Multikernprozessoren auszun\u00fctzen, wird ein neuer Ansatz f\u00fcr die Parallelisierung der hierarchischen Laufl\u00e4ngenkodierung pr\u00e4sentiert. Ein weiteres Problem ist die Bestimmung der Oberfl\u00e4chenraten f\u00fcr realistische Topo-graphiesimulationen. Erweiterte Modelle f\u00fcr die Beschreibung der Oberfl\u00e4chenkinetikerfordern die Kenntnis der Teilchenflussverteilung an der Oberfl\u00e4che. Obwohl meistensballistischer Teilchentransport angenommen werden kann,ist die Berechnung dennochsehr aufw \u0308andig, wenn Reemissionen oder spiegelartige Reflexionen ber\u00fccksichtigt werden sollen. Simulationen sind daher oft limitiert auf vereinfachte Modelle oder kleineStrukturen. Ein vielversprechender Ansatz, um diese Einschr\u00e4nkung zu \u00fcberwinden, ist eine Monte-Carlo-Methode, die durch die Simulation vieler Teilchentrajektoriendie Flussverteilung bestimmt. Diese Arbeit pr\u00e4sentiert ein neues Verfahren, das diese Monte-Carlo-Berechnung direkt auf die implizite Oberfl\u00e4chendarstellung der Level-Set-Methode anwendet. Zudem wurde der Rechenaufwand durchdie Anwendung vonerweiterten Raytracing-Algorithmen und -Datenstrukturen, die f\u00fcr die Bed\u00fcrfnisse von Topographiesimulationen adaptiert und optimiert wurden,reduziert. Schlussendlich werden die gezeigten numerischen Methodenanhand verschiedener inder Literatur beschriebene Prozessmodelle getestet, um die vielf\u00e4ltige Anwendbarkeit, insbesondere f\u00fcr gro\u00dfe dreidimensionale Strukturen, zu demonstrieren."} | ||
| 33 | −{"work_id": 4402696779, "title": "Crystalline Material Discovery in the Era of Artificial Intelligence", "abstract": "Crystalline materials, with symmetrical and periodic structures, exhibit a wide spectrum of properties and have been widely used in numerous applications across electronics, energy, and beyond. For crystalline materials discovery, traditional experimental and computational approaches are time-consuming and expensive. In these years, thanks to the explosive amount of crystalline materials data, great interest has been given to data-driven materials discovery. Particularly, recent advancements have exploited the expressive representation ability of deep learning to model the highly complex atomic systems within crystalline materials, opening up new avenues for efficient and accurate materials discovery. These works main focus on four types of tasks, including physicochemical property prediction, generative design of crystalline materials, aiding characterization, and accelerating theoretical computations. Despite the remarkable progress, there is still a lack of systematic investigation to summarize their distinctions and limitations. To fill this gap, we systematically investigated the progress of crystalline materials discovery using artificial intelligence made in recent years. We first introduce several data representations of the crystalline materials. Based on the representations, we summarize various fundamental deep learning models and their tailored usages in various material discovery tasks. Finally, we highlight the remaining challenges and propose future directions."} | ||||
| 34 | {"work_id": 7140287209, "title": "Towards end-to-end automation of AI research", "abstract": "Abstract The automation of science is a long-standing ambition in artificial intelligence (AI) research 1,2 . Although the community has made substantial progress in automating individual components of the scientific process, a system that autonomously navigates the entire research life cycle\u2014from conception to publication\u2014has remained out of reach. Here we present a pipeline for automating the entire scientific process end to end. We present The AI Scientist, which creates research ideas, writes code, runs experiments, plots and analyses data, writes the entire scientific manuscript, and performs its own peer review. Its ideas, execution and presentation are of sufficient quality that the manuscript generated by this AI system passed the first round of peer review for a workshop of a top-tier machine learning conference. The workshop had an acceptance rate of 70%. Our system leverages modern foundation models 3\u20135 within a complex agentic system. We evaluate The AI Scientist in two settings: a focused mode using human-provided code templates as an initial scaffold for conducting research on a specific topic and a template-free, open-ended mode that leverages agentic search for wider scientific exploration 6,7 . Both settings produce diverse ideas and automatically test, report on and evaluate them. This achievement demonstrates the growing capacity of AI for making scientific contributions and signifies a potential paradigm shift in how research is conducted. As with any impactful new technology, there could be important risks, including taxing overwhelmed review systems and adding noise to the scientific literature. However, if developed responsibly, such autonomous systems could greatly accelerate scientific discovery."} | 24 | {"work_id": 7140287209, "title": "Towards end-to-end automation of AI research", "abstract": "Abstract The automation of science is a long-standing ambition in artificial intelligence (AI) research 1,2 . Although the community has made substantial progress in automating individual components of the scientific process, a system that autonomously navigates the entire research life cycle\u2014from conception to publication\u2014has remained out of reach. Here we present a pipeline for automating the entire scientific process end to end. We present The AI Scientist, which creates research ideas, writes code, runs experiments, plots and analyses data, writes the entire scientific manuscript, and performs its own peer review. Its ideas, execution and presentation are of sufficient quality that the manuscript generated by this AI system passed the first round of peer review for a workshop of a top-tier machine learning conference. The workshop had an acceptance rate of 70%. Our system leverages modern foundation models 3\u20135 within a complex agentic system. We evaluate The AI Scientist in two settings: a focused mode using human-provided code templates as an initial scaffold for conducting research on a specific topic and a template-free, open-ended mode that leverages agentic search for wider scientific exploration 6,7 . Both settings produce diverse ideas and automatically test, report on and evaluate them. This achievement demonstrates the growing capacity of AI for making scientific contributions and signifies a potential paradigm shift in how research is conducted. As with any impactful new technology, there could be important risks, including taxing overwhelmed review systems and adding noise to the scientific literature. However, if developed responsibly, such autonomous systems could greatly accelerate scientific discovery."} | ||
| 35 | −{"work_id": 90568776, "title": "PETSc Users Manual", "abstract": "The Portable, Extensible Toolkit for Scientific Computation (PETSc), is a suite of data structures and routines for the scalable (parallel) solution of scientific applications modeled by partial differential equations. It supports MPI, and GPUs through CUDA or OpenCL, as well as hybrid MPI-GPU parallelism. PETSc (sometimes called PETSc/Tao) also contains the Tao optimization software library."} | 25 | +{"work_id": 3045710579, "title": "The ITensor Software Library for Tensor Network Calculations", "abstract": "ITensor is a system for programming tensor network calculations with an interface modeled on tensor diagrams, allowing users to focus on the connectivity of a tensor network without manually bookkeeping tensor indices. The ITensor interface rules out common programming errors and enables rapid prototyping of algorithms. After discussing the philosophy behind the ITensor approach, we show examples of each part of the interface including Index objects, the ITensor product operator, tensor factorizations, tensor storage types, algorithms for matrix product state (MPS) and matrix product operator (MPO) tensor networks, quantum number conserving block sparse tensors, and the NDTensors library. We also review publications that have used ITensor for quantum many-body physics and for other areas where tensor networks are increasingly applied. To conclude we discuss promising features and optimizations to be added in the future."} | ||
| 26 | +{"work_id": 2769423117, "title": "\u201cFound in Translation\u201d: predicting outcomes of complex organic chemistry reactions using neural sequence-to-sequence models", "abstract": "There is an intuitive analogy of an organic chemist's understanding of a compound and a language speaker's understanding of a word. Based on this analogy, it is possible to introduce the basic concepts and analyze potential impacts of linguistic analysis to the world of organic chemistry. In this work, we cast the reaction prediction task as a translation problem by introducing a template-free sequence-to-sequence model, trained end-to-end and fully data-driven. We propose a tokenization, which is arbitrarily extensible with reaction information. Using an attention-based model borrowed from human language translation, we improve the state-of-the-art solutions in reaction prediction on the top-1 accuracy by achieving 80.3% without relying on auxiliary knowledge, such as reaction templates or explicit atomic features. Also, a top-1 accuracy of 65.4% is reached on a larger and noisier dataset."} | ||||
| 36 | {"work_id": 3099929043, "title": "Bayesian probabilistic numerical methods", "abstract": "The increasing complexity of computer models used to solve contemporary inference problems has been set against a decreasing rate of improvement in processor speed in recent years. As a result, in many of these problems numerical error is a challenge for practitioners. However, while there has been a recent push towards rigorous quantification of uncertainty in inference problems based upon computer models, numerical error is still largely required to be driven down to a level at which its impact on inferences is negligible. Probabilistic numerical methods have been proposed to alleviate this; these are a class of numerical methods that return probabilistic uncertainty quantification for their numerical error. The attraction of such methods is clear: if numerical error in the computer model and uncertainty in an inference problem are quantified in a unified framework then careful tuning of numerical methods to mitigate the impact of numerical error on inferences could become unnecessary. \\n \\nIn this thesis we introduce the class of Bayesian probabilistic numerical methods, whose uncertainty has a strict and rigorous Bayesian interpretation. A number of examples of conjugate Bayesian probabilistic numerical methods are presented before we present analysis and algorithms for the general case, in which the posterior distribution does not posess a closed form. We conclude by studying how these methods can be rigorously composed to yield Bayesian pipelines of computation. Throughout we present applications of the developed methods to real-world inference problems, and indicate that the uncertainty quantification provided by these methods can be of significant practical use. \\n"} | 27 | {"work_id": 3099929043, "title": "Bayesian probabilistic numerical methods", "abstract": "The increasing complexity of computer models used to solve contemporary inference problems has been set against a decreasing rate of improvement in processor speed in recent years. As a result, in many of these problems numerical error is a challenge for practitioners. However, while there has been a recent push towards rigorous quantification of uncertainty in inference problems based upon computer models, numerical error is still largely required to be driven down to a level at which its impact on inferences is negligible. Probabilistic numerical methods have been proposed to alleviate this; these are a class of numerical methods that return probabilistic uncertainty quantification for their numerical error. The attraction of such methods is clear: if numerical error in the computer model and uncertainty in an inference problem are quantified in a unified framework then careful tuning of numerical methods to mitigate the impact of numerical error on inferences could become unnecessary. \\n \\nIn this thesis we introduce the class of Bayesian probabilistic numerical methods, whose uncertainty has a strict and rigorous Bayesian interpretation. A number of examples of conjugate Bayesian probabilistic numerical methods are presented before we present analysis and algorithms for the general case, in which the posterior distribution does not posess a closed form. We conclude by studying how these methods can be rigorously composed to yield Bayesian pipelines of computation. Throughout we present applications of the developed methods to real-world inference problems, and indicate that the uncertainty quantification provided by these methods can be of significant practical use. \\n"} | ||
| 37 | {"work_id": 1494474111, "title": "7 Linear algebra applications", "abstract": "Linear algebra is the most widely studied branch of mathematics after calculus.There are good reasons for this as it plays an important role in many fields.The readership the authors had in mind for this book includes majors in disciplines such as mathematics, engineering and social sciences.It will be useful for beginners and also as a reference for graduates.It introduces linear algebra, but at the same time it is tersely written and includes a great deal of material, a good lot contained in the exercises which, however, also contain many numerical ones.The chapter headings are: (1) Numbers, vectors and fields, (2) Matrices, (3) Row operations, (4) Vector spaces, (5) Linear mappings, (6) Inner product spaces, (7) Similarity and determinants, (8) Characteristic polynomial and eigenvalues of a matrix, (9) Some applications, (10) Unitary, orthogonal, Hermitian and symmetric matrices, (11) The singular value decomposition, and an appendix on using Maple."} | 28 | {"work_id": 1494474111, "title": "7 Linear algebra applications", "abstract": "Linear algebra is the most widely studied branch of mathematics after calculus.There are good reasons for this as it plays an important role in many fields.The readership the authors had in mind for this book includes majors in disciplines such as mathematics, engineering and social sciences.It will be useful for beginners and also as a reference for graduates.It introduces linear algebra, but at the same time it is tersely written and includes a great deal of material, a good lot contained in the exercises which, however, also contain many numerical ones.The chapter headings are: (1) Numbers, vectors and fields, (2) Matrices, (3) Row operations, (4) Vector spaces, (5) Linear mappings, (6) Inner product spaces, (7) Similarity and determinants, (8) Characteristic polynomial and eigenvalues of a matrix, (9) Some applications, (10) Unitary, orthogonal, Hermitian and symmetric matrices, (11) The singular value decomposition, and an appendix on using Maple."} | ||
| 38 | {"work_id": 4396723768, "title": "Augmenting large language models with chemistry tools", "abstract": "Large language models (LLMs) have shown strong performance in tasks across domains but struggle with chemistry-related problems. These models also lack access to external knowledge sources, limiting their usefulness in scientific applications. We introduce ChemCrow, an LLM chemistry agent designed to accomplish tasks across organic synthesis, drug discovery and materials design. By integrating 18 expert-designed tools and using GPT-4 as the LLM, ChemCrow augments the LLM performance in chemistry, and new capabilities emerge. Our agent autonomously planned and executed the syntheses of an insect repellent and three organocatalysts and guided the discovery of a novel chromophore. Our evaluation, including both LLM and expert assessments, demonstrates ChemCrow's effectiveness in automating a diverse set of chemical tasks. Our work not only aids expert chemists and lowers barriers for non-experts but also fosters scientific advancement by bridging the gap between experimental and computational chemistry."} | 29 | {"work_id": 4396723768, "title": "Augmenting large language models with chemistry tools", "abstract": "Large language models (LLMs) have shown strong performance in tasks across domains but struggle with chemistry-related problems. These models also lack access to external knowledge sources, limiting their usefulness in scientific applications. We introduce ChemCrow, an LLM chemistry agent designed to accomplish tasks across organic synthesis, drug discovery and materials design. By integrating 18 expert-designed tools and using GPT-4 as the LLM, ChemCrow augments the LLM performance in chemistry, and new capabilities emerge. Our agent autonomously planned and executed the syntheses of an insect repellent and three organocatalysts and guided the discovery of a novel chromophore. Our evaluation, including both LLM and expert assessments, demonstrates ChemCrow's effectiveness in automating a diverse set of chemical tasks. Our work not only aids expert chemists and lowers barriers for non-experts but also fosters scientific advancement by bridging the gap between experimental and computational chemistry."} | ||
| 39 | −{"work_id": 4415338867, "title": "Nonlinear Model Reduction by Probabilistic Manifold Decomposition", "abstract": "Abstract. This paper presents a novel nonlinear model reduction method: probabilistic manifold decomposition (PMD), which provides a powerful framework for constructing nonintrusive reduced-order models by embedding a high-dimensional system into a low-dimensional probabilistic manifold and predicting the dynamics. Through explicit mappings, PMD captures both linearity and nonlinearity of the system. A key strength of PMD lies in its predictive capabilities, allowing it to generate stable dynamic states based on embedded representations. The method also offers a mathematically rigorous approach to analyze the convergence of linear feature matrices and low-dimensional probabilistic manifolds, ensuring that sample-based approximations converge to the true data distributions as sample sizes increase. These properties, combined with its computational efficiency, make PMD a versatile tool for applications requiring high accuracy and scalability, such as fluid dynamics simulations and other engineering problems. By preserving the geometric and probabilistic structures of the high-dimensional system, PMD achieves a balance between computational speed, accuracy, and predictive capabilities, positioning itself as a robust alternative to the traditional model reduction methods."} | ||||
| 40 | {"work_id": 4403324307, "title": "Chai-1: Decoding the molecular interactions of life", "abstract": "Abstract We introduce Chai-1, a multi-modal foundation model for molecular structure prediction that performs at the state-of-the-art across a variety of tasks relevant to drug discovery. Chai-1 can optionally be prompted with experimental restraints (e.g. derived from wet-lab data) which boosts performance by double-digit percentage points. Chai-1 can also be run in single-sequence mode with-out MSAs while preserving most of its performance. We release Chai-1 model weights and inference code as a Python package for non-commercial use and via a web interface where it can be used for free including for commercial drug discovery purposes."} | 30 | {"work_id": 4403324307, "title": "Chai-1: Decoding the molecular interactions of life", "abstract": "Abstract We introduce Chai-1, a multi-modal foundation model for molecular structure prediction that performs at the state-of-the-art across a variety of tasks relevant to drug discovery. Chai-1 can optionally be prompted with experimental restraints (e.g. derived from wet-lab data) which boosts performance by double-digit percentage points. Chai-1 can also be run in single-sequence mode with-out MSAs while preserving most of its performance. We release Chai-1 model weights and inference code as a Python package for non-commercial use and via a web interface where it can be used for free including for commercial drug discovery purposes."} | ||
| 41 | {"work_id": 4407041525, "title": "AI-Driven Inverse Design of Materials: Past, Present, and Future", "abstract": "Abstract The discovery of advanced materials is a cornerstone of human technological development and progress. The structures of materials and their corresponding properties are essentially the result of a complex interplay of multiple degrees of freedom such as lattice, charge, spin, symmetry, and topology. This poses significant challenges for the inverse design methods of materials. Humans have long explored new materials through numerous experiments and proposed corresponding theoretical systems to predict new material properties and structures. With the improvement of computational power, researchers have gradually developed various electronic-structure calculation methods, such as the density functional theory and high-throughput computational methods. Recently, the rapid development of artificial intelligence (AI) technology in computer science has enabled the effective characterization of the implicit association between material properties and structures, thus forming an efficient paradigm for the inverse design of functional materials. Significant progress has been achieved in the inverse design of materials based on generative and discriminative models, attracting widespread interest from researchers. Considering this rapid technological progress, in this survey, we examine the latest advancements in AI-driven inverse design of materials by introducing the background, key findings, and mainstream technological development routes. In addition, we summarize the remaining challenges for future directions. This survey provides the latest overview of AI-driven inverse design of materials, which can serve as a useful resource for researchers."} | 31 | {"work_id": 4407041525, "title": "AI-Driven Inverse Design of Materials: Past, Present, and Future", "abstract": "Abstract The discovery of advanced materials is a cornerstone of human technological development and progress. The structures of materials and their corresponding properties are essentially the result of a complex interplay of multiple degrees of freedom such as lattice, charge, spin, symmetry, and topology. This poses significant challenges for the inverse design methods of materials. Humans have long explored new materials through numerous experiments and proposed corresponding theoretical systems to predict new material properties and structures. With the improvement of computational power, researchers have gradually developed various electronic-structure calculation methods, such as the density functional theory and high-throughput computational methods. Recently, the rapid development of artificial intelligence (AI) technology in computer science has enabled the effective characterization of the implicit association between material properties and structures, thus forming an efficient paradigm for the inverse design of functional materials. Significant progress has been achieved in the inverse design of materials based on generative and discriminative models, attracting widespread interest from researchers. Considering this rapid technological progress, in this survey, we examine the latest advancements in AI-driven inverse design of materials by introducing the background, key findings, and mainstream technological development routes. In addition, we summarize the remaining challenges for future directions. This survey provides the latest overview of AI-driven inverse design of materials, which can serve as a useful resource for researchers."} | ||
| 42 | −{"work_id": 7118182048, "title": "AI-enabled virtual spatial proteomics from histopathology for interpretable biomarker discovery in lung cancer", "abstract": "Spatial proteomics enables high-resolution mapping of protein expression and can transform our understanding of biology and disease. However, major challenges remain for clinical translation, including cost, complexity and scalability. Here we present H&E to protein expression (HEX), an AI model designed to computationally generate spatial proteomics profiles from standard histopathology slides. Trained and validated on 819,000 histopathology image tiles with matched protein expression from 382 tumor samples, HEX accurately predicts the expression of 40 biomarkers encompassing immune, structural and functional programs. HEX demonstrates substantial performance gains over alternative methods for protein expression prediction from H&E images. We develop a multimodal data integration approach that combines the original H&E image and AI-derived virtual spatial proteomics to enhance outcome prediction. Applied to six independent non-small-cell lung cancer cohorts totaling 2,298 patients, HEX-enabled multimodal integration improved prognostic accuracy by 22% and immunotherapy response prediction by 24-39% compared with conventional clinicopathological and molecular biomarkers. Biological interpretation revealed spatially organized tumor-immune niches predictive of therapeutic response, including the co-localization of T helper cells and cytotoxic T cells in responders, and immunosuppressive tumor-associated macrophage and neutrophil aggregates in non-responders. HEX provides a low-cost and scalable approach to study spatial biology and enables the discovery and clinical translation of interpretable biomarkers for precision medicine."} | 32 | +{"work_id": 2913606428, "title": "PsychoPy2: Experiments in behavior made easy", "abstract": "PsychoPy is an application for the creation of experiments in behavioral science (psychology, neuroscience, linguistics, etc.) with precise spatial control and timing of stimuli. It now provides a choice of interface; users can write scripts in Python if they choose, while those who prefer to construct experiments graphically can use the new Builder interface. Here we describe the features that have been added over the last 10 years of its development. The most notable addition has been that Builder interface, allowing users to create studies with minimal or no programming, while also allowing the insertion of Python code for maximal flexibility. We also present some of the other new features, including further stimulus options, asynchronous time-stamped hardware polling, and better support for open science and reproducibility. Tens of thousands of users now launch PsychoPy every month, and more than 90 people have contributed to the code. We discuss the current state of the project, as well as plans for the future."} | ||
| 43 | −{"work_id": 2927961455, "title": "Interactive Tree Of Life (iTOL) v4: recent updates and new developments", "abstract": "The Interactive Tree Of Life (https://itol.embl.de) is an online tool for the display, manipulation and annotation of phylogenetic and other trees. It is freely available and open to everyone. The current version introduces four new dataset types, together with numerous new features. Annotation options have been expanded and new control options added for many display elements. An interactive spreadsheet-like editor has been implemented, providing dataset creation and editing directly in the web interface. Font support has been rewritten with full support for UTF-8 character encoding throughout the user interface. Google Web Fonts are now fully supported in the tree text labels. iTOL v4 is the first tool which supports direct visualization of Qiime 2 trees and associated annotations. The user account system has been streamlined and expanded with new navigation options, and currently handles >700 000 trees from more than 40 000 individual users. Full batch access has been implemented allowing programmatic upload and export of trees and annotations."} | 33 | +{"work_id": 2899760200, "title": "The PRIDE database and related tools and resources in 2019: improving support for quantification data", "abstract": "The PRoteomics IDEntifications (PRIDE) database (https://www.ebi.ac.uk/pride/) is the world's largest data repository of mass spectrometry-based proteomics data, and is one of the founding members of the global ProteomeXchange (PX) consortium. In this manuscript, we summarize the developments in PRIDE resources and related tools since the previous update manuscript was published in Nucleic Acids Research in 2016. In the last 3 years, public data sharing through PRIDE (as part of PX) has definitely become the norm in the field. In parallel, data re-use of public proteomics data has increased enormously, with multiple applications. We first describe the new architecture of PRIDE Archive, the archival component of PRIDE. PRIDE Archive and the related data submission framework have been further developed to support the increase in submitted data volumes and additional data types. A new scalable and fault tolerant storage backend, Application Programming Interface and web interface have been implemented, as a part of an ongoing process. Additionally, we emphasize the improved support for quantitative proteomics data through the mzTab format. At last, we outline key statistics on the current data contents and volume of downloads, and how PRIDE data are starting to be disseminated to added-value resources including Ensembl, UniProt and Expression Atlas."} | ||
| 44 | −{"work_id": 4386373863, "title": "PyMC: a modern, and comprehensive probabilistic programming framework in Python", "abstract": "PyMC is a probabilistic programming library for Python that provides tools for constructing and fitting Bayesian models. It offers an intuitive, readable syntax that is close to the natural syntax statisticians use to describe models. PyMC leverages the symbolic computation library PyTensor, allowing it to be compiled into a variety of computational backends, such as C, JAX, and Numba, which in turn offer access to different computational architectures including CPU, GPU, and TPU. Being a general modeling framework, PyMC supports a variety of models including generalized hierarchical linear regression and classification, time series, ordinary differential equations (ODEs), and non-parametric models such as Gaussian processes (GPs). We demonstrate PyMC's versatility and ease of use with examples spanning a range of common statistical models. Additionally, we discuss the positive role of PyMC in the development of the open-source ecosystem for probabilistic programming."} | 34 | +{"work_id": 3208691473, "title": "The PRIDE database resources in 2022: a hub for mass spectrometry-based proteomics evidences", "abstract": "The PRoteomics IDEntifications (PRIDE) database (https://www.ebi.ac.uk/pride/) is the world's largest data repository of mass spectrometry-based proteomics data. PRIDE is one of the founding members of the global ProteomeXchange (PX) consortium and an ELIXIR core data resource. In this manuscript, we summarize the developments in PRIDE resources and related tools since the previous update manuscript was published in Nucleic Acids Research in 2019. The number of submitted datasets to PRIDE Archive (the archival component of PRIDE) has reached on average around 500 datasets per month during 2021. In addition to continuous improvements in PRIDE Archive data pipelines and infrastructure, the PRIDE Spectra Archive has been developed to provide direct access to the submitted mass spectra using Universal Spectrum Identifiers. As a key point, the file format MAGE-TAB for proteomics has been developed to enable the improvement of sample metadata annotation. Additionally, the resource PRIDE Peptidome provides access to aggregated peptide/protein evidences across PRIDE Archive. Furthermore, we will describe how PRIDE has increased its efforts to reuse and disseminate high-quality proteomics data into other added-value resources such as UniProt, Ensembl and Expression Atlas."} | ||
| 45 | −{"work_id": 4323304388, "title": "Uni-Mol: A Universal 3D Molecular Representation Learning Framework", "abstract": "Molecular representation learning (MRL) has gained tremendous attention due to its critical role in learning from limited supervised data for applications like drug design. In most MRL methods, molecules are treated as 1D sequential tokens or 2D topology graphs, limiting their ability to incorporate 3D information for downstream tasks and, in particular, making it almost impossible for 3D geometry prediction/generation. In this paper, we propose a universal 3D MRL framework, called Uni-Mol, that significantly enlarges the representation ability and application scope of MRL schemes. Uni-Mol contains two pretrained models with the same SE(3) Transformer architecture: a molecular model pretrained by 209M molecular conformations; a pocket model pretrained by 3M candidate protein pocket data. Besides, Uni-Mol contains several finetuning strategies to apply the pretrained models to various downstream tasks. By properly incorporating 3D information, Uni-Mol outperforms SOTA in 14/15 molecular property prediction tasks. Moreover, Uni-Mol achieves superior performance in 3D spatial tasks, including protein-ligand binding pose prediction, molecular conformation generation, etc. The code, model, and data are made publicly available at https://github.com/dptech-corp/Uni-Mol."} | 35 | +{"work_id": 4395010444, "title": "ProTox 3.0: a webserver for the prediction of toxicity of chemicals", "abstract": "Interaction with chemicals, present in drugs, food, environments, and consumer goods, is an integral part of our everyday life. However, depending on the amount and duration, such interactions can also result in adverse effects. With the increase in computational methods, the in silico methods can offer significant benefits to both regulatory needs and requirements for risk assessments and the pharmaceutical industry to assess the safety profile of a chemical. Here, we present ProTox 3.0, which incorporates molecular similarity and machine-learning models for the prediction of 61 toxicity endpoints such as acute toxicity, organ toxicity, clinical toxicity, molecular-initiating events (MOE), adverse outcomes (Tox21) pathways, several other toxicological endpoints and toxicity off-targets. All the ProTox 3.0 models are validated on independent external sets and have shown strong performance. ProTox envisages itself as a complete, freely available computational platform for in silico toxicity prediction for toxicologists, regulatory agencies, computational chemists, and medicinal chemists. The ProTox 3.0 webserver is free and open to all users, and there is no login requirement and can be accessed via https://tox.charite.de. The web server takes a 2D chemical structure as input and reports the toxicological profile of the compound for each endpoint with a confidence score and overall toxicity radar plot and network plot."} | ||
| 46 | −{"work_id": 3098269892, "title": "Automatic Chemical Design Using a Data-Driven Continuous Representation of Molecules.", "abstract": "We report a method to convert discrete representations of molecules to and from a multidimensional continuous representation. This model allows us to generate new molecules for efficient exploration and optimization through open-ended spaces of chemical compounds. A deep neural network was trained on hundreds of thousands of existing chemical structures to construct three coupled functions: an encoder, a decoder, and a predictor. The encoder converts the discrete representation of a molecule into a real-valued continuous vector, and the decoder converts these continuous vectors back to discrete molecular representations. The predictor estimates chemical properties from the latent continuous vector representation of the molecule. Continuous representations of molecules allow us to automatically generate novel chemical structures by performing simple operations in the latent space, such as decoding random vectors, perturbing known chemical structures, or interpolating between molecules. Continuous representations also allow the use of powerful gradient-based optimization to efficiently guide the search for optimized functional compounds. We demonstrate our method in the domain of drug-like molecules and also in a set of molecules with fewer that nine heavy atoms."} | 36 | +{"work_id": 2766160192, "title": "Advanced Bayesian Multilevel Modeling with the R Package brms", "abstract": "The brms package allows R users to easily specify a wide range of Bayesian single-level and multilevel models, which are fitted with the probabilistic programming language Stan behind the scenes. Several response distributions are supported, of which all parameters (e.g., location, scale, and shape) can be predicted at the same time thus allowing for distributional regression. Non-linear relationships may be specified using non-linear predictor terms or semi-parametric approaches such as splines or Gaussian processes. To make all of these modeling options possible in a multilevel framework, brms provides an intuitive and powerful formula syntax, which extends the well known formula syntax of lme4. The purpose of the present paper is to introduce this syntax in detail and to demonstrate its usefulness with four examples, each showing other relevant aspects of the syntax."} | ||
| 47 | −{"work_id": 4415202617, "title": "Chemical reasoning in LLMs unlocks strategy-aware synthesis planning and reaction mechanism elucidation", "abstract": "While machine learning algorithms have been shown to excel at specific chemical tasks, they have struggled to capture the strategic thinking that characterizes expert chemical reasoning, limiting their widespread adoption. Here we demonstrate that large language models (LLMs) can serve as powerful chemical reasoning engines when integrated with traditional search algorithms, enabling a new approach to computer-aided chemistry that mirrors human expert thinking. Rather than using LLMs to directly manipulate chemical structures, we leverage their ability to evaluate chemical strategies and guide search algorithms toward chemically meaningful solutions. We demonstrate this paradigm through two fundamental challenges: strategy-aware retrosynthetic planning and mechanism elucidation. In retrosynthetic planning, our method allows chemists to specify desired synthetic strategies in natural language or maximize global feasibility to find routes that satisfy these constraints in vast searches. In mechanism elucidation, LLMs guide the search for plausible reaction mechanisms by combining chemical principles with systematic exploration. Our approach shows strong performance across diverse chemical tasks, with larger models demonstrating increasingly sophisticated chemical reasoning. Our approach establishes a new paradigm for computer-aided chemistry that combines the strategic understanding of LLMs with the precision of traditional chemical tools, opening possibilities for more intuitive and powerful chemical reasoning systems."} | 37 | +{"work_id": 4393936599, "title": "ADMETlab 3.0: an updated comprehensive online ADMET prediction platform enhanced with broader coverage, improved performance, API functionality and decision support", "abstract": "ADMETlab 3.0 is the second updated version of the web server that provides a comprehensive and efficient platform for evaluating ADMET-related parameters as well as physicochemical properties and medicinal chemistry characteristics involved in the drug discovery process. This new release addresses the limitations of the previous version and offers broader coverage, improved performance, API functionality, and decision support. For supporting data and endpoints, this version includes 119 features, an increase of 31 compared to the previous version. The updated number of entries is 1.5 times larger than the previous version with over 400 000 entries. ADMETlab 3.0 incorporates a multi-task DMPNN architecture coupled with molecular descriptors, a method that not only guaranteed calculation speed for each endpoint simultaneously, but also achieved a superior performance in terms of accuracy and robustness. In addition, an API has been introduced to meet the growing demand for programmatic access to large amounts of data in ADMETlab 3.0. Moreover, this version includes uncertainty estimates in the prediction results, aiding in the confident selection of candidate compounds for further studies and experiments. ADMETlab 3.0 is publicly for access without the need for registration at: https://admetlab3.scbdd.com."} | ||
| 38 | +{"work_id": 2990427812, "title": "Welcome to the Tidyverse", "abstract": "At a high level, the tidyverse is a language for solving data science challenges with R code.Its primary goal is to facilitate a conversation between a human and a computer about data.Less abstractly, the tidyverse is a collection of R packages that share a high-level design philosophy and low-level grammar and data structures, so that learning one package makes it easier to learn the next."} | ||||
| 48 | {"work_id": 4400581728, "title": "An Update on the Nitrogen Heterocycle Compositions and Properties of U.S. FDA-Approved Pharmaceuticals (2013\u20132023)", "abstract": "This Perspective is a continuation of our analysis of U.S. FDA-approved small-molecule drugs (1938\u20132012) containing nitrogen heterocycles. In this study we report drug structure and property analyses of 321 unique new small-molecule drugs approved from January 2013 to December 2023 as well as information about frequency of important heteroatoms such as sulfur and fluorine and key small nitrogen substituents (CN and NO 2 ). The most notable change is an incredible increase in drugs containing at least one nitrogen heterocycle\u250082%, compared to 59% from preceding decades\u2500as well as a significant increase in the number of nitrogen heterocycles per drug. Pyridine has claimed the #1 high-frequency nitrogen heterocycle occurrence spot from piperidine (#2), with pyrimidine (#5), pyrazole (#6), and morpholine (#9) being the big top 10 climbers. Also notable is high number of fused nitrogen heterocycles, apparently driven largely by newly approved cancer drugs."} | 39 | {"work_id": 4400581728, "title": "An Update on the Nitrogen Heterocycle Compositions and Properties of U.S. FDA-Approved Pharmaceuticals (2013\u20132023)", "abstract": "This Perspective is a continuation of our analysis of U.S. FDA-approved small-molecule drugs (1938\u20132012) containing nitrogen heterocycles. In this study we report drug structure and property analyses of 321 unique new small-molecule drugs approved from January 2013 to December 2023 as well as information about frequency of important heteroatoms such as sulfur and fluorine and key small nitrogen substituents (CN and NO 2 ). The most notable change is an incredible increase in drugs containing at least one nitrogen heterocycle\u250082%, compared to 59% from preceding decades\u2500as well as a significant increase in the number of nitrogen heterocycles per drug. Pyridine has claimed the #1 high-frequency nitrogen heterocycle occurrence spot from piperidine (#2), with pyrimidine (#5), pyrazole (#6), and morpholine (#9) being the big top 10 climbers. Also notable is high number of fused nitrogen heterocycles, apparently driven largely by newly approved cancer drugs."} | ||
| 49 | −{"work_id": 4211084734, "title": "Positive Definite Matrices", "abstract": "At the cost of some redundancy, to facilitate accessibility, the multiresolution decomposition and inversion of symmetric positive definite (SPD) matrices on finite-dimensional Euclidean space are developed in the Gamblet Transform and Decomposition framework."} | ||||
| 50 | {"work_id": 7119529911, "title": "Deep contrastive learning enables genome-wide virtual screening", "abstract": "Abstract Numerous protein-coding genes are associated with human diseases, yet approximately 90% of them lack targeted therapeutic intervention. While conventional computational methods, such as molecular docking, have facilitated the discovery of potential hit compounds, the development of genome-wide virtual screening against the expansive chemical space remains a formidable challenge. Here we introduce DrugCLIP, a novel framework that combines contrastive learning and dense retrieval to achieve rapid and accurate virtual screening. Compared to traditional docking methods, DrugCLIP improves the speed of virtual screening by up to seven orders of magnitude. In terms of performance, DrugCLIP not only surpasses docking and other deep learning-based methods across two standard benchmark datasets, but also demonstrates high efficacy in wet-lab experiments. Specifically, DrugCLIP successfully identified agonists with < 100 nM affinities for 5HT 2A R, a key target in psychiatric diseases. For another target NET, whose structure is newly solved and not included in the training set, our method achieved a hit rate of 15%, with 12 diverse molecules exhibiting affinities better than bupropion. Additionally, two chemically novel inhibitors were validated by structure determination with Cryo-EM. Finally, a novel potential drug target TRIP12, with no experimental structures and inhibitors for reference, was used to challenge DrugCLIP. DrugCLIP achieved a hit rate of 17.5% by screening a pocket identified on an AlphaFold2-predicted structure, verified with multi-cycle SPR assays. Molecules with the highest affinities also showed a dose-dependent inhibition to the enzymatic function of TRIP12. Building on this foundation, we present the results of a pioneering trillion-scale genome-wide virtual screening, encompassing approximately 10,000 AlphaFold2 predicted proteins within the human genome and 500 million molecules from the ZINC and Enamine REAL database. This work provides an innovative perspective on drug discovery in the post-AlphaFold era, where comprehensive targeting of all disease-related proteins is within reach."} | 40 | {"work_id": 7119529911, "title": "Deep contrastive learning enables genome-wide virtual screening", "abstract": "Abstract Numerous protein-coding genes are associated with human diseases, yet approximately 90% of them lack targeted therapeutic intervention. While conventional computational methods, such as molecular docking, have facilitated the discovery of potential hit compounds, the development of genome-wide virtual screening against the expansive chemical space remains a formidable challenge. Here we introduce DrugCLIP, a novel framework that combines contrastive learning and dense retrieval to achieve rapid and accurate virtual screening. Compared to traditional docking methods, DrugCLIP improves the speed of virtual screening by up to seven orders of magnitude. In terms of performance, DrugCLIP not only surpasses docking and other deep learning-based methods across two standard benchmark datasets, but also demonstrates high efficacy in wet-lab experiments. Specifically, DrugCLIP successfully identified agonists with < 100 nM affinities for 5HT 2A R, a key target in psychiatric diseases. For another target NET, whose structure is newly solved and not included in the training set, our method achieved a hit rate of 15%, with 12 diverse molecules exhibiting affinities better than bupropion. Additionally, two chemically novel inhibitors were validated by structure determination with Cryo-EM. Finally, a novel potential drug target TRIP12, with no experimental structures and inhibitors for reference, was used to challenge DrugCLIP. DrugCLIP achieved a hit rate of 17.5% by screening a pocket identified on an AlphaFold2-predicted structure, verified with multi-cycle SPR assays. Molecules with the highest affinities also showed a dose-dependent inhibition to the enzymatic function of TRIP12. Building on this foundation, we present the results of a pioneering trillion-scale genome-wide virtual screening, encompassing approximately 10,000 AlphaFold2 predicted proteins within the human genome and 500 million molecules from the ZINC and Enamine REAL database. This work provides an innovative perspective on drug discovery in the post-AlphaFold era, where comprehensive targeting of all disease-related proteins is within reach."} | ||
| 51 | −{"work_id": 3143496104, "title": "Numerical Optimization", "abstract": "This chapter presents methods for numerically determining the maximum likelihood estimation (m.l.e.) and their computer implementations. The existence of a closed-form solution to the m.l.e. is far more the exception than the rule: it is often defined only implicitly, and numerical methods will be necessary to locate it. When the usual regularity conditions are satisfied, the m.l.e. can be obtained either by finding the roots of the score function, or by directly maximizing the likelihood function using numerical optimization algorithms. The chapter discusses evolutionary algorithm designation as a general approach that implies that it is suited for the optimization of possibly nonconvex, nonsmooth or even noncontinuous functions, precisely the situation in which gradient-and Hessian-based methods (two general thumb rules followed in numerical m.l.e.) are prone to fail. It explains two classes of evolutionary algorithms: genetic algorithms (differential evolution algorithm) and evolutionary strategies (Covariance Matrix Adaption Evolutionary Strategy algorithm)."} | 41 | +{"work_id": 4391561379, "title": "Leveraging large language models for predictive chemistry", "abstract": "Abstract Machine learning has transformed many fields and has recently found applications in chemistry and materials science. The small datasets commonly found in chemistry sparked the development of sophisticated machine learning approaches that incorporate chemical knowledge for each application and, therefore, require specialized expertise to develop. Here we show that GPT-3, a large language model trained on vast amounts of text extracted from the Internet, can easily be adapted to solve various tasks in chemistry and materials science by fine-tuning it to answer chemical questions in natural language with the correct answer. We compared this approach with dedicated machine learning models for many applications spanning the properties of molecules and materials to the yield of chemical reactions. Surprisingly, our fine-tuned version of GPT-3 can perform comparably to or even outperform conventional machine learning techniques, in particular in the low-data limit. In addition, we can perform inverse design by simply inverting the questions. The ease of use and high performance, especially for small datasets, can impact the fundamental approach to using machine learning in the chemical and material sciences. In addition to a literature search, querying a pre-trained large language model might become a routine way to bootstrap a project by leveraging the collective knowledge encoded in these foundation models, or to provide a baseline for predictive tasks."} | ||
| 42 | +{"work_id": 4302307901, "title": "DiffDock: Diffusion Steps, Twists, and Turns for Molecular Docking", "abstract": "Predicting the binding structure of a small molecule ligand to a protein -- a task known as molecular docking -- is critical to drug design. Recent deep learning methods that treat docking as a regression problem have decreased runtime compared to traditional search-based methods but have yet to offer substantial improvements in accuracy. We instead frame molecular docking as a generative modeling problem and develop DiffDock, a diffusion generative model over the non-Euclidean manifold of ligand poses. To do so, we map this manifold to the product space of the degrees of freedom (translational, rotational, and torsional) involved in docking and develop an efficient diffusion process on this space. Empirically, DiffDock obtains a 38% top-1 success rate (RMSD<2A) on PDBBind, significantly outperforming the previous state-of-the-art of traditional docking (23%) and deep learning (20%) methods. Moreover, while previous methods are not able to dock on computationally folded structures (maximum accuracy 10.4%), DiffDock maintains significantly higher precision (21.7%). Finally, DiffDock has fast inference times and provides confidence estimates with high selective accuracy."} | ||||
| 43 | +{"work_id": 4241803778, "title": "PETSc Users Manual (Rev. 3.13)", "abstract": "This manual describes the use of PETSc for the numerical solution of partial differential equations and related problems on high-performance computers. The Portable, Extensible Toolkit for Scientific Computation (PETSc) is a suite of data structures and routines that provide the building blocks for the implementation of large-scale application codes on parallel (and serial) computers. PETSc uses the MPI standard for all message-passing communication. PETSc includes an expanding suite of parallel linear solvers, nonlinear solvers, and time integrators that may be used in application codes written in Fortran, C, C++, and Python. PETSc provides many of the mechanisms needed within parallel application codes, such as parallel matrix and vector assembly routines. The library is organized hierarchically, enabling users to employ the level of abstraction that is most appropriate for a particular problem. By using techniques of object-oriented programming, PETSc provides enormous flexibility for users. PETSc is a sophisticated set of software tools; as such, for some users it initially has a much steeper learning curve than a simple subroutine library. In particular, for individuals without some computer science background, experience programming in C, C++, python, or Fortran and experience using a debugger such as gdb or dbx, it may require a significant amount of time to take full advantage of the features that enable efficient software use. However, the power of the PETSc design and the algorithms it incorporates may make the efficient implementation of many application codes simpler than \\rolling them\" yourself."} | ||||
| 44 | +{"work_id": 4365512576, "title": "ChatGPT: A comprehensive review on background, applications, key challenges, bias, ethics, limitations and future scope", "abstract": "In recent years, artificial intelligence (AI) and machine learning have been transforming the landscape of scientific research. Out of which, the chatbot technology has experienced tremendous advancements in recent years, especially with ChatGPT emerging as a notable AI language model. This comprehensive review delves into the background, applications, key challenges, and future directions of ChatGPT. We begin by exploring its origins, development, and underlying technology, before examining its wide-ranging applications across industries such as customer service, healthcare, and education. We also highlight the critical challenges that ChatGPT faces, including ethical concerns, data biases, and safety issues, while discussing potential mitigation strategies. Finally, we envision the future of ChatGPT by exploring areas of further research and development, focusing on its integration with other technologies, improved human-AI interaction, and addressing the digital divide. This review offers valuable insights for researchers, developers, and stakeholders interested in the ever-evolving landscape of AI-driven conversational agents. This study explores the various ways ChatGPT has been revolutionizing scientific research, spanning from data processing and hypothesis generation to collaboration and public outreach. Furthermore, the paper examines the potential challenges and ethical concerns surrounding the use of ChatGPT in research, while highlighting the importance of striking a balance between AI-assisted innovation and human expertise. The paper presents several ethical issues in existing computing domain and how ChatGPT can invoke challenges to such notion. This work also includes some biases and limitations of ChatGPT. It is worth to note that despite of several controversies and ethical concerns, ChatGPT has attracted remarkable attentions from academia, research, and industries in a very short span of time."} | ||||
| 45 | +{"work_id": 3097145107, "title": "PubChem in 2021: new data content and improved web interfaces", "abstract": "PubChem (https://pubchem.ncbi.nlm.nih.gov) is a popular chemical information resource that serves the scientific community as well as the general public, with millions of unique users per month. In the past two years, PubChem made substantial improvements. Data from more than 100 new data sources were added to PubChem, including chemical-literature links from Thieme Chemistry, chemical and physical property links from SpringerMaterials, and patent links from the World Intellectual Properties Organization (WIPO). PubChem's homepage and individual record pages were updated to help users find desired information faster. This update involved a data model change for the data objects used by these pages as well as by programmatic users. Several new services were introduced, including the PubChem Periodic Table and Element pages, Pathway pages, and Knowledge panels. Additionally, in response to the coronavirus disease 2019 (COVID-19) outbreak, PubChem created a special data collection that contains PubChem data related to COVID-19 and the severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2)."} | ||||
| 46 | +{"work_id": 4389991792, "title": "Autonomous chemical research with large language models", "abstract": "Abstract Transformer-based large language models are making significant strides in various fields, such as natural language processing 1\u20135 , biology 6,7 , chemistry 8\u201310 and computer programming 11,12 . Here, we show the development and capabilities of Coscientist, an artificial intelligence system driven by GPT-4 that autonomously designs, plans and performs complex experiments by incorporating large language models empowered by tools such as internet and documentation search, code execution and experimental automation. Coscientist showcases its potential for accelerating research across six diverse tasks, including the successful reaction optimization of palladium-catalysed cross-couplings, while exhibiting advanced capabilities for (semi-)autonomous experimental design and execution. Our findings demonstrate the versatility, efficacy and explainability of artificial intelligence systems like Coscientist in advancing research."} | ||||
| 47 | +{"work_id": 3168436232, "title": "AutoDock Vina 1.2.0: New Docking Methods, Expanded Force Field, and Python Bindings", "abstract": "AutoDock Vina is arguably one of the fastest and most widely used open-source programs for molecular docking. However, compared to other programs in the AutoDock Suite, it lacks support for modeling specific features such as macrocycles or explicit water molecules. Here, we describe the implementation of this functionality in AutoDock Vina 1.2.0. Additionally, AutoDock Vina 1.2.0 supports the AutoDock4.2 scoring function, simultaneous docking of multiple ligands, and a batch mode for docking a large number of ligands. Furthermore, we implemented Python bindings to facilitate scripting and the development of docking workflows. This work is an effort toward the unification of the features of the AutoDock4 and AutoDock Vina programs. The source code is available at https://github.com/ccsb-scripps/AutoDock-Vina."} | ||||
| 48 | +{"work_id": 3010959735, "title": "Gaussin prosessi -surrogaattimenetelmi\u00e4 likim\u00e4\u00e4r\u00e4iseen Bayesilaiseen p\u00e4\u00e4ttelyyn", "abstract": "In many application fields such as ecology, epidemiology and astronomy, simulation models are used to study complex phenomena that occur in nature. Often the analytical form of the likelihood function of these models is either unavailable or too costly to evaluate which complicates statistical inference. Likelihood-free inference (LFI) methods such as approximate Bayesian computation (ABC), based on replacing the evaluations of the intractable likelihood with forward simulations of the model, have become a popular approach to conduct inference for simulation models. Nevertheless, current LFI methods feature several computational and statistical challenges. Especially, standard ABC algorithms require a huge number of simulations which makes them infeasible when the forward simulations are expensive. This thesis deals with likelihood-free inference for computationally costly models. The main contribution is a coherent framework for LFI based on Gaussian process (GP) surrogate models. GP models allow to encode smoothness assumptions of the simulation model output to reduce the amount of simulations needed. Additionally, the uncertainty in the resulting model-based posterior approximations due to the limited simulation budget can be quantified. We develop Bayesian experimental design strategies to select the evaluation locations as to minimise the computational cost. Both sequential designs, where simulations are chosen one-at-a-time basis, and batch strategies, which allow to take advantage of parallel computing, are derived. In addition to the LFI scenario, the proposed methods also apply when the likelihood can be evaluated but is expensive. In essence, the proposed framework can be viewed as an LFI counterpart of probabilistic numerical methods such as Bayesian optimisation, developed for optimising expensive objective functions, and Bayesian quadrature, developed for computing integrals of expensive functions. We demonstrate the advantages of the proposed LFI methods using extensive empirical simulations. Some theoretical analysis of the proposed algorithms is also provided and their relation to some other GP surrogate methods are discussed. In addition to the contributions to statistical methodology, applications in population genomics are also considered. In particular, we use the GP-based ABC methodology to obtain an approximate posterior of a simulation model describing horizontal gene transfer in bacteria. We also develop a probabilistic model and an inference algorithm using a novel combination of ABC and Metropolis-within-Gibbs sampling to facilitate better understanding of bacterial colonisation."} | ||||
| 49 | +{"work_id": 4388615774, "title": "DrugBank 6.0: the DrugBank Knowledgebase for 2024", "abstract": "First released in 2006, DrugBank (https://go.drugbank.com) has grown to become the 'gold standard' knowledge resource for drug, drug-target and related pharmaceutical information. DrugBank is widely used across many diverse biomedical research and clinical applications, and averages more than 30 million views/year. Since its last update in 2018, we have been actively enhancing the quantity and quality of the drug data in this knowledgebase. In this latest release (DrugBank 6.0), the number of FDA approved drugs has grown from 2646 to 4563 (a 72% increase), the number of investigational drugs has grown from 3394 to 6231 (a 38% increase), the number of drug-drug interactions increased from 365 984 to 1 413 413 (a 300% increase), and the number of drug-food interactions expanded from 1195 to 2475 (a 200% increase). In addition to this notable expansion in database size, we have added thousands of new, colorful, richly annotated pathways depicting drug mechanisms and drug metabolism. Likewise, existing datasets have been significantly improved and expanded, by adding more information on drug indications, drug-drug interactions, drug-food interactions and many other relevant data types for 11 891 drugs. We have also added experimental and predicted MS/MS spectra, 1D/2D-NMR spectra, CCS (collision cross section), RT (retention time) and RI (retention index) data for 9464 of DrugBank's 11 710 small molecule drugs. These and other improvements should make DrugBank 6.0 even more useful to a much wider research audience ranging from medicinal chemists to metabolomics specialists to pharmacologists."} | ||||
| 52 | {"work_id": 4225106311, "title": "FAIR data enabling new horizons for materials research", "abstract": "The prosperity and lifestyle of our society are very much governed by achievements in condensed matter physics, chemistry and materials science, because new products for sectors such as energy, the environment, health, mobility and information technology (IT) rely largely on improved or even new materials. Examples include solid-state lighting, touchscreens, batteries, implants, drug delivery and many more. The enormous amount of research data produced every day in these fields represents a gold mine of the twenty-first century. This gold mine is, however, of little value if these data are not comprehensively characterized and made available. How can we refine this feedstock; that is, turn data into knowledge and value? For this, a FAIR (findable, accessible, interoperable and reusable) data infrastructure is a must. Only then can data be readily shared and explored using data analytics and artificial intelligence (AI) methods. Making data 'findable and AI ready' (a forward-looking interpretation of the acronym) will change the way in which science is carried out today. In this Perspective, we discuss how we can prepare to make this happen for the field of materials science."} | 50 | {"work_id": 4225106311, "title": "FAIR data enabling new horizons for materials research", "abstract": "The prosperity and lifestyle of our society are very much governed by achievements in condensed matter physics, chemistry and materials science, because new products for sectors such as energy, the environment, health, mobility and information technology (IT) rely largely on improved or even new materials. Examples include solid-state lighting, touchscreens, batteries, implants, drug delivery and many more. The enormous amount of research data produced every day in these fields represents a gold mine of the twenty-first century. This gold mine is, however, of little value if these data are not comprehensively characterized and made available. How can we refine this feedstock; that is, turn data into knowledge and value? For this, a FAIR (findable, accessible, interoperable and reusable) data infrastructure is a must. Only then can data be readily shared and explored using data analytics and artificial intelligence (AI) methods. Making data 'findable and AI ready' (a forward-looking interpretation of the acronym) will change the way in which science is carried out today. In this Perspective, we discuss how we can prepare to make this happen for the field of materials science."} | ||
| 53 | −{"work_id": 4307468223, "title": "PubChem 2023 update", "abstract": "PubChem (https://pubchem.ncbi.nlm.nih.gov) is a popular chemical information resource that serves a wide range of use cases. In the past two years, a number of changes were made to PubChem. Data from more than 120 data sources was added to PubChem. Some major highlights include: the integration of Google Patents data into PubChem, which greatly expanded the coverage of the PubChem Patent data collection; the creation of the Cell Line and Taxonomy data collections, which provide quick and easy access to chemical information for a given cell line and taxon, respectively; and the update of the bioassay data model. In addition, new functionalities were added to the PubChem programmatic access protocols, PUG-REST and PUG-View, including support for target-centric data download for a given protein, gene, pathway, cell line, and taxon and the addition of the 'standardize' option to PUG-REST, which returns the standardized form of an input chemical structure. A significant update was also made to PubChemRDF. The present paper provides an overview of these changes."} | 51 | +{"work_id": 4200153169, "title": "Variational and Quasi-Variational Inequalities", "abstract": "This chapter presents a concise introduction to the theory of variational and quasi-variational inequalities. The available literature on these topics is vast, and we only give the most fundamental results which have direct relevance to our study of variational inequalities with random data. The presented material, which we will frequently use in the forthcoming chapters, can be divided into three parts. The first part deals with linear variational inequalities given by bilinear forms. In this setting, we provide an equivalent optimization formulation of the variational inequality under a symmetry condition on the bilinear form. We provide the so-called Minty variational inequality, study the solution set&s;s structure, and give some existence results. Focusing on elliptic regularization, we examine the behavior of the regularized solutions and relate it to the solvability of variational inequalities. We then study non-coercive variational inequalities and, under appropriate conditions, give some sufficient conditions for the existence of a solution. The second part deals with nonlinear variational inequalities involving some classes of nonlinear operators. We present existence results by using arguments based on the projection map. We develop a regularization framework by focusing on the case when the constraint sets are perturbed and provide a rate of convergence for the regularized solutions. We also briefly discuss penalization and use it to give some existence results for nonlinear variational inequalities in Banach spaces. In the third part, we then deal with quasi-variational inequalities. We present existence results for general constraint sets as well as by exploiting a particular structure of the constraint set. The chapter concludes with a discussion of some of the related contributions."} | ||
| 54 | −{"work_id": 3035965352, "title": "Array programming with NumPy", "abstract": "Abstract Array programming provides a powerful, compact and expressive syntax for accessing, manipulating and operating on data in vectors, matrices and higher-dimensional arrays. NumPy is the primary array programming library for the Python language. It has an essential role in research analysis pipelines in fields as diverse as physics, chemistry, astronomy, geoscience, biology, psychology, materials science, engineering, finance and economics. For example, in astronomy, NumPy was an important part of the software stack used in the discovery of gravitational waves 1 and in the first imaging of a black hole 2 . Here we review how a few fundamental array concepts lead to a simple and powerful programming paradigm for organizing, exploring and analysing scientific data. NumPy is the foundation upon which the scientific Python ecosystem is constructed. It is so pervasive that several projects, targeting audiences with specialized needs, have developed their own NumPy-like interfaces and array objects. Owing to its central position in the ecosystem, NumPy increasingly acts as an interoperability layer between such array computation libraries and, together with its application programming interface (API), provides a flexible framework to support the next decade of scientific and industrial analysis."} | ||||
| 55 | {"work_id": 3003257820, "title": "SciPy 1.0: fundamental algorithms for scientific computing in Python", "abstract": "SciPy is an open-source scientific computing library for the Python programming language. Since its initial release in 2001, SciPy has become a de facto standard for leveraging scientific algorithms in Python, with over 600 unique code contributors, thousands of dependent packages, over 100,000 dependent repositories and millions of downloads per year. In this work, we provide an overview of the capabilities and development practices of SciPy 1.0 and highlight some recent technical developments."} | 52 | {"work_id": 3003257820, "title": "SciPy 1.0: fundamental algorithms for scientific computing in Python", "abstract": "SciPy is an open-source scientific computing library for the Python programming language. Since its initial release in 2001, SciPy has become a de facto standard for leveraging scientific algorithms in Python, with over 600 unique code contributors, thousands of dependent packages, over 100,000 dependent repositories and millions of downloads per year. In this work, we provide an overview of the capabilities and development practices of SciPy 1.0 and highlight some recent technical developments."} | ||
| 56 | −{"work_id": 4388522045, "title": "SRplot: A free online platform for data visualization and graphing", "abstract": "Graphics are widely used to provide summarization of complex data in scientific publications. Although there are many tools available for drawing graphics, their use is limited by programming skills, costs, and platform specificities. Here, we presented a freely accessible easy-to-use web server named SRplot that integrated more than a hundred of commonly used data visualization and graphing functions together. It can be run easily using all Web browsers and there are no strong requirements on the computing power of users' machines. With a user-friendly graphical interface, users can simply paste the contents of the input file into the text box according to the defined file format. Modification operations can be easily performed, and graphs can be generated in real-time. The resulting graphs can be easily downloaded in bitmap (PNG or TIFF) or vector (PDF or SVG) format in publication quality. The website is updated promptly and continuously. Functions in SRplot have been improved, optimized and updated depend on feedback and suggestions from users. The graphs prepared with SRplot have been featured in more than five hundred peer-reviewed publications. The SRplot web server is now freely available at http://www.bioinformatics.com.cn/SRplot."} | 53 | +{"work_id": 2804822363, "title": "SWISS-MODEL: homology modelling of protein structures and complexes", "abstract": "Homology modelling has matured into an important technique in structural biology, significantly contributing to narrowing the gap between known protein sequences and experimentally determined structures. Fully automated workflows and servers simplify and streamline the homology modelling process, also allowing users without a specific computational expertise to generate reliable protein models and have easy access to modelling results, their visualization and interpretation. Here, we present an update to the SWISS-MODEL server, which pioneered the field of automated modelling 25 years ago and been continuously further developed. Recently, its functionality has been extended to the modelling of homo- and heteromeric complexes. Starting from the amino acid sequences of the interacting proteins, both the stoichiometry and the overall structure of the complex are inferred by homology modelling. Other major improvements include the implementation of a new modelling engine, ProMod3 and the introduction a new local model quality estimation method, QMEANDisCo. SWISS-MODEL is freely available at https://swissmodel.expasy.org."} | ||
| 54 | +{"work_id": 3156458251, "title": "Interactive Tree Of Life (iTOL) v5: an online tool for phylogenetic tree display and annotation", "abstract": "The Interactive Tree Of Life (https://itol.embl.de) is an online tool for the display, manipulation and annotation of phylogenetic and other trees. It is freely available and open to everyone. iTOL version 5 introduces a completely new tree display engine, together with numerous new features. For example, a new dataset type has been added (MEME motifs), while annotation options have been expanded for several existing ones. Node metadata display options have been extended and now also support non-numerical categorical values, as well as multiple values per node. Direct manual annotation is now available, providing a set of basic drawing and labeling tools, allowing users to draw shapes, labels and other features by hand directly onto the trees. Support for tree and dataset scales has been extended, providing fine control over line and label styles. Unrooted tree displays can now use the equal-daylight algorithm, proving a much greater display clarity. The user account system has been streamlined and expanded with new navigation options and currently handles >1 million trees from >70 000 individual users."} | ||||
| 57 | {"work_id": 4223552703, "title": "Search and sequence analysis tools services from EMBL-EBI in 2022", "abstract": "The EMBL-EBI search and sequence analysis tools frameworks provide integrated access to EMBL-EBI's data resources and core bioinformatics analytical tools. EBI Search (https://www.ebi.ac.uk/ebisearch) provides a full-text search engine across nearly 5 billion entries, while the Job Dispatcher tools framework (https://www.ebi.ac.uk/services) enables the scientific community to perform a diverse range of sequence analysis using popular bioinformatics applications. Both allow users to interact through user-friendly web applications, as well as via RESTful and SOAP-based APIs. Here, we describe recent improvements to these services and updates made to accommodate the increasing data requirements during the COVID-19 pandemic."} | 55 | {"work_id": 4223552703, "title": "Search and sequence analysis tools services from EMBL-EBI in 2022", "abstract": "The EMBL-EBI search and sequence analysis tools frameworks provide integrated access to EMBL-EBI's data resources and core bioinformatics analytical tools. EBI Search (https://www.ebi.ac.uk/ebisearch) provides a full-text search engine across nearly 5 billion entries, while the Job Dispatcher tools framework (https://www.ebi.ac.uk/services) enables the scientific community to perform a diverse range of sequence analysis using popular bioinformatics applications. Both allow users to interact through user-friendly web applications, as well as via RESTful and SOAP-based APIs. Here, we describe recent improvements to these services and updates made to accommodate the increasing data requirements during the COVID-19 pandemic."} | ||
| 58 | {"work_id": 3027286012, "title": "TIMER2.0 for analysis of tumor-infiltrating immune cells", "abstract": "Tumor progression and the efficacy of immunotherapy are strongly influenced by the composition and abundance of immune cells in the tumor microenvironment. Due to the limitations of direct measurement methods, computational algorithms are often used to infer immune cell composition from bulk tumor transcriptome profiles. These estimated tumor immune infiltrate populations have been associated with genomic and transcriptomic changes in the tumors, providing insight into tumor-immune interactions. However, such investigations on large-scale public data remain challenging. To lower the barriers for the analysis of complex tumor-immune interactions, we significantly improved our previous web platform TIMER. Instead of just using one algorithm, TIMER2.0 (http://timer.cistrome.org/) provides more robust estimation of immune infiltration levels for The Cancer Genome Atlas (TCGA) or user-provided tumor profiles using six state-of-the-art algorithms. TIMER2.0 provides four modules for investigating the associations between immune infiltrates and genetic or clinical features, and four modules for exploring cancer-related associations in the TCGA cohorts. Each module can generate a functional heatmap table, enabling the user to easily identify significant associations in multiple cancer types simultaneously. Overall, the TIMER2.0 web server provides comprehensive analysis and visualization functions of tumor infiltrating immune cells."} | 56 | {"work_id": 3027286012, "title": "TIMER2.0 for analysis of tumor-infiltrating immune cells", "abstract": "Tumor progression and the efficacy of immunotherapy are strongly influenced by the composition and abundance of immune cells in the tumor microenvironment. Due to the limitations of direct measurement methods, computational algorithms are often used to infer immune cell composition from bulk tumor transcriptome profiles. These estimated tumor immune infiltrate populations have been associated with genomic and transcriptomic changes in the tumors, providing insight into tumor-immune interactions. However, such investigations on large-scale public data remain challenging. To lower the barriers for the analysis of complex tumor-immune interactions, we significantly improved our previous web platform TIMER. Instead of just using one algorithm, TIMER2.0 (http://timer.cistrome.org/) provides more robust estimation of immune infiltration levels for The Cancer Genome Atlas (TCGA) or user-provided tumor profiles using six state-of-the-art algorithms. TIMER2.0 provides four modules for investigating the associations between immune infiltrates and genetic or clinical features, and four modules for exploring cancer-related associations in the TCGA cohorts. Each module can generate a functional heatmap table, enabling the user to easily identify significant associations in multiple cancer types simultaneously. Overall, the TIMER2.0 web server provides comprehensive analysis and visualization functions of tumor infiltrating immune cells."} | ||
| 59 | {"work_id": 3136918052, "title": "UniProt: a worldwide hub of protein knowledge", "abstract": "The UniProt Knowledgebase is a collection of sequences and annotations for over 120 million proteins across all branches of life. Detailed annotations extracted from the literature by expert curators have been collected for over half a million of these proteins. These annotations are supplemented by annotations provided by rule based automated systems, and those imported from other resources. In this article we describe significant updates that we have made over the last 2 years to the resource. We have greatly expanded the number of Reference Proteomes that we provide and in particular we have focussed on improving the number of viral Reference Proteomes. The UniProt website has been augmented with new data visualizations for the subcellular localization of proteins as well as their structure and interactions. UniProt resources are available under a CC-BY (4.0) license via the web at https://www.uniprot.org/."} | 57 | {"work_id": 3136918052, "title": "UniProt: a worldwide hub of protein knowledge", "abstract": "The UniProt Knowledgebase is a collection of sequences and annotations for over 120 million proteins across all branches of life. Detailed annotations extracted from the literature by expert curators have been collected for over half a million of these proteins. These annotations are supplemented by annotations provided by rule based automated systems, and those imported from other resources. In this article we describe significant updates that we have made over the last 2 years to the resource. We have greatly expanded the number of Reference Proteomes that we provide and in particular we have focussed on improving the number of viral Reference Proteomes. The UniProt website has been augmented with new data visualizations for the subcellular localization of proteins as well as their structure and interactions. UniProt resources are available under a CC-BY (4.0) license via the web at https://www.uniprot.org/."} | ||
@@ -62,19 +60,18 @@ | |||||
| 62 | {"work_id": 4383218913, "title": "Accurate medium-range global weather forecasting with 3D neural networks", "abstract": "Abstract Weather forecasting is important for science and society. At present, the most accurate forecast system is the numerical weather prediction (NWP) method, which represents atmospheric states as discretized grids and numerically solves partial differential equations that describe the transition between those states 1 . However, this procedure is computationally expensive. Recently, artificial-intelligence-based methods 2 have shown potential in accelerating weather forecasting by orders of magnitude, but the forecast accuracy is still significantly lower than that of NWP methods. Here we introduce an artificial-intelligence-based method for accurate, medium-range global weather forecasting. We show that three-dimensional deep networks equipped with Earth-specific priors are effective at dealing with complex patterns in weather data, and that a hierarchical temporal aggregation strategy reduces accumulation errors in medium-range forecasting. Trained on 39 years of global data, our program, Pangu-Weather, obtains stronger deterministic forecast results on reanalysis data in all tested variables when compared with the world\u2019s best NWP system, the operational integrated forecasting system of the European Centre for Medium-Range Weather Forecasts (ECMWF) 3 . Our method also works well with extreme weather forecasts and ensemble forecasts. When initialized with reanalysis data, the accuracy of tracking tropical cyclones is also higher than that of ECMWF-HRES."} | 60 | {"work_id": 4383218913, "title": "Accurate medium-range global weather forecasting with 3D neural networks", "abstract": "Abstract Weather forecasting is important for science and society. At present, the most accurate forecast system is the numerical weather prediction (NWP) method, which represents atmospheric states as discretized grids and numerically solves partial differential equations that describe the transition between those states 1 . However, this procedure is computationally expensive. Recently, artificial-intelligence-based methods 2 have shown potential in accelerating weather forecasting by orders of magnitude, but the forecast accuracy is still significantly lower than that of NWP methods. Here we introduce an artificial-intelligence-based method for accurate, medium-range global weather forecasting. We show that three-dimensional deep networks equipped with Earth-specific priors are effective at dealing with complex patterns in weather data, and that a hierarchical temporal aggregation strategy reduces accumulation errors in medium-range forecasting. Trained on 39 years of global data, our program, Pangu-Weather, obtains stronger deterministic forecast results on reanalysis data in all tested variables when compared with the world\u2019s best NWP system, the operational integrated forecasting system of the European Centre for Medium-Range Weather Forecasts (ECMWF) 3 . Our method also works well with extreme weather forecasts and ensemble forecasts. When initialized with reanalysis data, the accuracy of tracking tropical cyclones is also higher than that of ECMWF-HRES."} | ||
| 63 | {"work_id": 4307425304, "title": "KEGG for taxonomy-based analysis of pathways and genomes", "abstract": "KEGG (https://www.kegg.jp) is a manually curated database resource integrating various biological objects categorized into systems, genomic, chemical and health information. Each object (database entry) is identified by the KEGG identifier (kid), which generally takes the form of a prefix followed by a five-digit number, and can be retrieved by appending /entry/kid in the URL. The KEGG pathway map viewer, the Brite hierarchy viewer and the newly released KEGG genome browser can be launched by appending /pathway/kid, /brite/kid and /genome/kid, respectively, in the URL. Together with an improved annotation procedure for KO (KEGG Orthology) assignment, an increasing number of eukaryotic genomes have been included in KEGG for better representation of organisms in the taxonomic tree. Multiple taxonomy files are generated for classification of KEGG organisms and viruses, and the Brite hierarchy viewer is used for taxonomy mapping, a variant of Brite mapping in the new KEGG Mapper suite. The taxonomy mapping enables analysis of, for example, how functional links of genes in the pathway and physical links of genes on the chromosome are conserved among organism groups."} | 61 | {"work_id": 4307425304, "title": "KEGG for taxonomy-based analysis of pathways and genomes", "abstract": "KEGG (https://www.kegg.jp) is a manually curated database resource integrating various biological objects categorized into systems, genomic, chemical and health information. Each object (database entry) is identified by the KEGG identifier (kid), which generally takes the form of a prefix followed by a five-digit number, and can be retrieved by appending /entry/kid in the URL. The KEGG pathway map viewer, the Brite hierarchy viewer and the newly released KEGG genome browser can be launched by appending /pathway/kid, /brite/kid and /genome/kid, respectively, in the URL. Together with an improved annotation procedure for KO (KEGG Orthology) assignment, an increasing number of eukaryotic genomes have been included in KEGG for better representation of organisms in the taxonomic tree. Multiple taxonomy files are generated for classification of KEGG organisms and viruses, and the Brite hierarchy viewer is used for taxonomy mapping, a variant of Brite mapping in the new KEGG Mapper suite. The taxonomy mapping enables analysis of, for example, how functional links of genes in the pathway and physical links of genes on the chromosome are conserved among organism groups."} | ||
| 64 | {"work_id": 4407002549, "title": "Benefits, limits, and risks of ChatGPT in medicine", "abstract": "ChatGPT represents a transformative technology in healthcare, with demonstrated impacts across clinical practice, medical education, and research. Studies show significant efficiency gains, including 70% reduction in administrative time for discharge summaries and achievement of medical professional-level performance on standardized tests (60% accuracy on USMLE, 78.2% on PubMedQA). ChatGPT offers personalized learning platforms, automated scoring, and instant access to vast medical knowledge in medical education, addressing resource limitations and enhancing training efficiency. It streamlines clinical workflows by supporting triage processes, generating discharge summaries, and alleviating administrative burdens, allowing healthcare professionals to focus more on patient care. Additionally, ChatGPT facilitates remote monitoring and chronic disease management, providing personalized advice, medication reminders, and emotional support, thus bridging gaps between clinical visits. Its ability to process and synthesize vast amounts of data accelerates research workflows, aiding in literature reviews, hypothesis generation, and clinical trial designs. This paper aims to gather and analyze published studies involving ChatGPT, focusing on exploring its advantages and disadvantages within the healthcare context. To aid in understanding and progress, our analysis is organized into six key areas: (1) Information and Education, (2) Triage and Symptom Assessment, (3) Remote Monitoring and Support, (4) Mental Healthcare Assistance, (5) Research and Decision Support, and (6) Language Translation. Realizing ChatGPT's full potential in healthcare requires addressing key limitations, such as its lack of clinical experience, inability to process visual data, and absence of emotional intelligence. Ethical, privacy, and regulatory challenges further complicate its integration. Future improvements should focus on enhancing accuracy, developing multimodal AI models, improving empathy through sentiment analysis, and safeguarding against artificial hallucination. While not a replacement for healthcare professionals, ChatGPT can serve as a powerful assistant, augmenting their expertise to improve efficiency, accessibility, and quality of care. This collaboration ensures responsible adoption of AI in transforming healthcare delivery. While ChatGPT demonstrates significant potential in healthcare transformation, systematic evaluation of its implementation across different healthcare settings reveals varying levels of evidence quality-from robust randomized trials in medical education to preliminary observational studies in clinical practice. This heterogeneity in evidence quality necessitates a structured approach to future research and implementation."} | 62 | {"work_id": 4407002549, "title": "Benefits, limits, and risks of ChatGPT in medicine", "abstract": "ChatGPT represents a transformative technology in healthcare, with demonstrated impacts across clinical practice, medical education, and research. Studies show significant efficiency gains, including 70% reduction in administrative time for discharge summaries and achievement of medical professional-level performance on standardized tests (60% accuracy on USMLE, 78.2% on PubMedQA). ChatGPT offers personalized learning platforms, automated scoring, and instant access to vast medical knowledge in medical education, addressing resource limitations and enhancing training efficiency. It streamlines clinical workflows by supporting triage processes, generating discharge summaries, and alleviating administrative burdens, allowing healthcare professionals to focus more on patient care. Additionally, ChatGPT facilitates remote monitoring and chronic disease management, providing personalized advice, medication reminders, and emotional support, thus bridging gaps between clinical visits. Its ability to process and synthesize vast amounts of data accelerates research workflows, aiding in literature reviews, hypothesis generation, and clinical trial designs. This paper aims to gather and analyze published studies involving ChatGPT, focusing on exploring its advantages and disadvantages within the healthcare context. To aid in understanding and progress, our analysis is organized into six key areas: (1) Information and Education, (2) Triage and Symptom Assessment, (3) Remote Monitoring and Support, (4) Mental Healthcare Assistance, (5) Research and Decision Support, and (6) Language Translation. Realizing ChatGPT's full potential in healthcare requires addressing key limitations, such as its lack of clinical experience, inability to process visual data, and absence of emotional intelligence. Ethical, privacy, and regulatory challenges further complicate its integration. Future improvements should focus on enhancing accuracy, developing multimodal AI models, improving empathy through sentiment analysis, and safeguarding against artificial hallucination. While not a replacement for healthcare professionals, ChatGPT can serve as a powerful assistant, augmenting their expertise to improve efficiency, accessibility, and quality of care. This collaboration ensures responsible adoption of AI in transforming healthcare delivery. While ChatGPT demonstrates significant potential in healthcare transformation, systematic evaluation of its implementation across different healthcare settings reveals varying levels of evidence quality-from robust randomized trials in medical education to preliminary observational studies in clinical practice. This heterogeneity in evidence quality necessitates a structured approach to future research and implementation."} | ||
| 65 | −{"work_id": 4308616064, "title": "InterPro in 2022", "abstract": "The InterPro database (https://www.ebi.ac.uk/interpro/) provides an integrative classification of protein sequences into families, and identifies functionally important domains and conserved sites. Here, we report recent developments with InterPro (version 90.0) and its associated software, including updates to data content and to the website. These developments extend and enrich the information provided by InterPro, and provide a more user friendly access to the data. Additionally, we have worked on adding Pfam website features to the InterPro website, as the Pfam website will be retired in late 2022. We also show that InterPro's sequence coverage has kept pace with the growth of UniProtKB. Moreover, we report the development of a card game as a method of engaging the non-scientific community. Finally, we discuss the benefits and challenges brought by the use of artificial intelligence for protein structure prediction."} | ||||
| 66 | {"work_id": 3096828292, "title": "KEGG: integrating viruses and cellular organisms", "abstract": "KEGG (https://www.kegg.jp/) is a manually curated resource integrating eighteen databases categorized into systems, genomic, chemical and health information. It also provides KEGG mapping tools, which enable understanding of cellular and organism-level functions from genome sequences and other molecular datasets. KEGG mapping is a predictive method of reconstructing molecular network systems from molecular building blocks based on the concept of functional orthologs. Since the introduction of the KEGG NETWORK database, various diseases have been associated with network variants, which are perturbed molecular networks caused by human gene variants, viruses, other pathogens and environmental factors. The network variation maps are created as aligned sets of related networks showing, for example, how different viruses inhibit or activate specific cellular signaling pathways. The KEGG pathway maps are now integrated with network variation maps in the NETWORK database, as well as with conserved functional units of KEGG modules and reaction modules in the MODULE database. The KO database for functional orthologs continues to be improved and virus KOs are being expanded for better understanding of virus-cell interactions and for enabling prediction of viral perturbations."} | 63 | {"work_id": 3096828292, "title": "KEGG: integrating viruses and cellular organisms", "abstract": "KEGG (https://www.kegg.jp/) is a manually curated resource integrating eighteen databases categorized into systems, genomic, chemical and health information. It also provides KEGG mapping tools, which enable understanding of cellular and organism-level functions from genome sequences and other molecular datasets. KEGG mapping is a predictive method of reconstructing molecular network systems from molecular building blocks based on the concept of functional orthologs. Since the introduction of the KEGG NETWORK database, various diseases have been associated with network variants, which are perturbed molecular networks caused by human gene variants, viruses, other pathogens and environmental factors. The network variation maps are created as aligned sets of related networks showing, for example, how different viruses inhibit or activate specific cellular signaling pathways. The KEGG pathway maps are now integrated with network variation maps in the NETWORK database, as well as with conserved functional units of KEGG modules and reaction modules in the MODULE database. The KO database for functional orthologs continues to be improved and virus KOs are being expanded for better understanding of virus-cell interactions and for enabling prediction of viral perturbations."} | ||
| 67 | {"work_id": 3095583226, "title": "Pfam: The protein families database in 2021", "abstract": "The Pfam database is a widely used resource for classifying protein sequences into families and domains. Since Pfam was last described in this journal, over 350 new families have been added in Pfam 33.1 and numerous improvements have been made to existing entries. To facilitate research on COVID-19, we have revised the Pfam entries that cover the SARS-CoV-2 proteome, and built new entries for regions that were not covered by Pfam. We have reintroduced Pfam-B which provides an automatically generated supplement to Pfam and contains 136 730 novel clusters of sequences that are not yet matched by a Pfam family. The new Pfam-B is based on a clustering by the MMseqs2 software. We have compared all of the regions in the RepeatsDB to those in Pfam and have started to use the results to build and refine Pfam repeat families. Pfam is freely available for browsing and download at http://pfam.xfam.org/."} | 64 | {"work_id": 3095583226, "title": "Pfam: The protein families database in 2021", "abstract": "The Pfam database is a widely used resource for classifying protein sequences into families and domains. Since Pfam was last described in this journal, over 350 new families have been added in Pfam 33.1 and numerous improvements have been made to existing entries. To facilitate research on COVID-19, we have revised the Pfam entries that cover the SARS-CoV-2 proteome, and built new entries for regions that were not covered by Pfam. We have reintroduced Pfam-B which provides an automatically generated supplement to Pfam and contains 136 730 novel clusters of sequences that are not yet matched by a Pfam family. The new Pfam-B is based on a clustering by the MMseqs2 software. We have compared all of the regions in the RepeatsDB to those in Pfam and have started to use the results to build and refine Pfam repeat families. Pfam is freely available for browsing and download at http://pfam.xfam.org/."} | ||
| 68 | {"work_id": 4414990951, "title": "The rise of generative AI for metal-organic framework design and synthesis", "abstract": "Advances in generative artificial intelligence are transforming how metal-organic frameworks (MOFs) are designed and discovered. This perspective introduces the shift from laborious enumeration of MOF candidates to generative approaches that can autonomously propose and synthesize in the laboratory new porous reticular structures on demand. We outline the progress of employing deep learning models, such as variational autoencoders, diffusion models, and large language-model-based agents, that are fueled by the growing amount of available data from the MOF community and suggest novel crystalline materials designs. These generative tools can be combined with high-throughput computational screening and even automated experiments to form accelerated, closed-loop discovery pipelines. The result is a new paradigm for reticular chemistry in which AI algorithms more efficiently direct the search for high-performance MOF materials for clean air and energy applications. Finally, we highlight remaining challenges such as synthetic feasibility, dataset diversity, and the need for further integration of domain knowledge."} | 65 | {"work_id": 4414990951, "title": "The rise of generative AI for metal-organic framework design and synthesis", "abstract": "Advances in generative artificial intelligence are transforming how metal-organic frameworks (MOFs) are designed and discovered. This perspective introduces the shift from laborious enumeration of MOF candidates to generative approaches that can autonomously propose and synthesize in the laboratory new porous reticular structures on demand. We outline the progress of employing deep learning models, such as variational autoencoders, diffusion models, and large language-model-based agents, that are fueled by the growing amount of available data from the MOF community and suggest novel crystalline materials designs. These generative tools can be combined with high-throughput computational screening and even automated experiments to form accelerated, closed-loop discovery pipelines. The result is a new paradigm for reticular chemistry in which AI algorithms more efficiently direct the search for high-performance MOF materials for clean air and energy applications. Finally, we highlight remaining challenges such as synthetic feasibility, dataset diversity, and the need for further integration of domain knowledge."} | ||
| 69 | {"work_id": 4308834893, "title": "The STRING database in 2023: protein\u2013protein association networks and functional enrichment analyses for any sequenced genome of interest", "abstract": "Much of the complexity within cells arises from functional and regulatory interactions among proteins. The core of these interactions is increasingly known, but novel interactions continue to be discovered, and the information remains scattered across different database resources, experimental modalities and levels of mechanistic detail. The STRING database (https://string-db.org/) systematically collects and integrates protein-protein interactions-both physical interactions as well as functional associations. The data originate from a number of sources: automated text mining of the scientific literature, computational interaction predictions from co-expression, conserved genomic context, databases of interaction experiments and known complexes/pathways from curated sources. All of these interactions are critically assessed, scored, and subsequently automatically transferred to less well-studied organisms using hierarchical orthology information. The data can be accessed via the website, but also programmatically and via bulk downloads. The most recent developments in STRING (version 12.0) are: (i) it is now possible to create, browse and analyze a full interaction network for any novel genome of interest, by submitting its complement of encoded proteins, (ii) the co-expression channel now uses variational auto-encoders to predict interactions, and it covers two new sources, single-cell RNA-seq and experimental proteomics data and (iii) the confidence in each experimentally derived interaction is now estimated based on the detection method used, and communicated to the user in the web-interface. Furthermore, STRING continues to enhance its facilities for functional enrichment analysis, which are now fully available also for user-submitted genomes."} | 66 | {"work_id": 4308834893, "title": "The STRING database in 2023: protein\u2013protein association networks and functional enrichment analyses for any sequenced genome of interest", "abstract": "Much of the complexity within cells arises from functional and regulatory interactions among proteins. The core of these interactions is increasingly known, but novel interactions continue to be discovered, and the information remains scattered across different database resources, experimental modalities and levels of mechanistic detail. The STRING database (https://string-db.org/) systematically collects and integrates protein-protein interactions-both physical interactions as well as functional associations. The data originate from a number of sources: automated text mining of the scientific literature, computational interaction predictions from co-expression, conserved genomic context, databases of interaction experiments and known complexes/pathways from curated sources. All of these interactions are critically assessed, scored, and subsequently automatically transferred to less well-studied organisms using hierarchical orthology information. The data can be accessed via the website, but also programmatically and via bulk downloads. The most recent developments in STRING (version 12.0) are: (i) it is now possible to create, browse and analyze a full interaction network for any novel genome of interest, by submitting its complement of encoded proteins, (ii) the co-expression channel now uses variational auto-encoders to predict interactions, and it covers two new sources, single-cell RNA-seq and experimental proteomics data and (iii) the confidence in each experimentally derived interaction is now estimated based on the detection method used, and communicated to the user in the web-interface. Furthermore, STRING continues to enhance its facilities for functional enrichment analysis, which are now fully available also for user-submitted genomes."} | ||
| 70 | {"work_id": 2898402099, "title": "The Pfam protein families database in 2019", "abstract": "The last few years have witnessed significant changes in Pfam (https://pfam.xfam.org). The number of families has grown substantially to a total of 17,929 in release 32.0. New additions have been coupled with efforts to improve existing families, including refinement of domain boundaries, their classification into Pfam clans, as well as their functional annotation. We recently began to collaborate with the RepeatsDB resource to improve the definition of tandem repeat families within Pfam. We carried out a significant comparison to the structural classification database, namely the Evolutionary Classification of Protein Domains (ECOD) that led to the creation of 825 new families based on their set of uncharacterized families (EUFs). Furthermore, we also connected Pfam entries to the Sequence Ontology (SO) through mapping of the Pfam type definitions to SO terms. Since Pfam has many community contributors, we recently enabled the linking between authorship of all Pfam entries with the corresponding authors' ORCID identifiers. This effectively permits authors to claim credit for their Pfam curation and link them to their ORCID record."} | 67 | {"work_id": 2898402099, "title": "The Pfam protein families database in 2019", "abstract": "The last few years have witnessed significant changes in Pfam (https://pfam.xfam.org). The number of families has grown substantially to a total of 17,929 in release 32.0. New additions have been coupled with efforts to improve existing families, including refinement of domain boundaries, their classification into Pfam clans, as well as their functional annotation. We recently began to collaborate with the RepeatsDB resource to improve the definition of tandem repeat families within Pfam. We carried out a significant comparison to the structural classification database, namely the Evolutionary Classification of Protein Domains (ECOD) that led to the creation of 825 new families based on their set of uncharacterized families (EUFs). Furthermore, we also connected Pfam entries to the Sequence Ontology (SO) through mapping of the Pfam type definitions to SO terms. Since Pfam has many community contributors, we recently enabled the linking between authorship of all Pfam entries with the corresponding authors' ORCID identifiers. This effectively permits authors to claim credit for their Pfam curation and link them to their ORCID record."} | ||
| 71 | {"work_id": 4384652177, "title": "MitoHiFi: a python pipeline for mitochondrial genome assembly from PacBio high fidelity reads", "abstract": "BACKGROUND: PacBio high fidelity (HiFi) sequencing reads are both long (15-20 kb) and highly accurate (> Q20). Because of these properties, they have revolutionised genome assembly leading to more accurate and contiguous genomes. In eukaryotes the mitochondrial genome is sequenced alongside the nuclear genome often at very high coverage. A dedicated tool for mitochondrial genome assembly using HiFi reads is still missing. RESULTS: MitoHiFi was developed within the Darwin Tree of Life Project to assemble mitochondrial genomes from the HiFi reads generated for target species. The input for MitoHiFi is either the raw reads or the assembled contigs, and the tool outputs a mitochondrial genome sequence fasta file along with annotation of protein and RNA genes. Variants arising from heteroplasmy are assembled independently, and nuclear insertions of mitochondrial sequences are identified and not used in organellar genome assembly. MitoHiFi has been used to assemble 374 mitochondrial genomes (368 Metazoa and 6 Fungi species) for the Darwin Tree of Life Project, the Vertebrate Genomes Project and the Aquatic Symbiosis Genome Project. Inspection of 60 mitochondrial genomes assembled with MitoHiFi for species that already have reference sequences in public databases showed the widespread presence of previously unreported repeats. CONCLUSIONS: MitoHiFi is able to assemble mitochondrial genomes from a wide phylogenetic range of taxa from Pacbio HiFi data. MitoHiFi is written in python and is freely available on GitHub ( https://github.com/marcelauliano/MitoHiFi ). MitoHiFi is available with its dependencies as a Docker container on GitHub (ghcr.io/marcelauliano/mitohifi:master)."} | 68 | {"work_id": 4384652177, "title": "MitoHiFi: a python pipeline for mitochondrial genome assembly from PacBio high fidelity reads", "abstract": "BACKGROUND: PacBio high fidelity (HiFi) sequencing reads are both long (15-20 kb) and highly accurate (> Q20). Because of these properties, they have revolutionised genome assembly leading to more accurate and contiguous genomes. In eukaryotes the mitochondrial genome is sequenced alongside the nuclear genome often at very high coverage. A dedicated tool for mitochondrial genome assembly using HiFi reads is still missing. RESULTS: MitoHiFi was developed within the Darwin Tree of Life Project to assemble mitochondrial genomes from the HiFi reads generated for target species. The input for MitoHiFi is either the raw reads or the assembled contigs, and the tool outputs a mitochondrial genome sequence fasta file along with annotation of protein and RNA genes. Variants arising from heteroplasmy are assembled independently, and nuclear insertions of mitochondrial sequences are identified and not used in organellar genome assembly. MitoHiFi has been used to assemble 374 mitochondrial genomes (368 Metazoa and 6 Fungi species) for the Darwin Tree of Life Project, the Vertebrate Genomes Project and the Aquatic Symbiosis Genome Project. Inspection of 60 mitochondrial genomes assembled with MitoHiFi for species that already have reference sequences in public databases showed the widespread presence of previously unreported repeats. CONCLUSIONS: MitoHiFi is able to assemble mitochondrial genomes from a wide phylogenetic range of taxa from Pacbio HiFi data. MitoHiFi is written in python and is freely available on GitHub ( https://github.com/marcelauliano/MitoHiFi ). MitoHiFi is available with its dependencies as a Docker container on GitHub (ghcr.io/marcelauliano/mitohifi:master)."} | ||
| 69 | +{"work_id": 4386740800, "title": "CHGNet as a pretrained universal neural network potential for charge-informed atomistic modelling", "abstract": "Abstract Large-scale simulations with complex electron interactions remain one of the greatest challenges for atomistic modelling. Although classical force fields often fail to describe the coupling between electronic states and ionic rearrangements, the more accurate ab initio molecular dynamics suffers from computational complexity that prevents long-time and large-scale simulations, which are essential to study technologically relevant phenomena. Here we present the Crystal Hamiltonian Graph Neural Network (CHGNet), a graph neural network-based machine-learning interatomic potential (MLIP) that models the universal potential energy surface. CHGNet is pretrained on the energies, forces, stresses and magnetic moments from the Materials Project Trajectory Dataset, which consists of over 10 years of density functional theory calculations of more than 1.5 million inorganic structures. The explicit inclusion of magnetic moments enables CHGNet to learn and accurately represent the orbital occupancy of electrons, enhancing its capability to describe both atomic and electronic degrees of freedom. We demonstrate several applications of CHGNet in solid-state materials, including charge-informed molecular dynamics in Li x MnO 2 , the finite temperature phase diagram for Li x FePO 4 and Li diffusion in garnet conductors. We highlight the significance of charge information for capturing appropriate chemistry and provide insights into ionic systems with additional electronic degrees of freedom that cannot be observed by previous MLIPs."} | ||||
| 72 | {"work_id": 2900569176, "title": "STRING v11: protein\u2013protein association networks with increased coverage, supporting functional discovery in genome-wide experimental datasets", "abstract": "Proteins and their functional interactions form the backbone of the cellular machinery. Their connectivity network needs to be considered for the full understanding of biological phenomena, but the available information on protein-protein associations is incomplete and exhibits varying levels of annotation granularity and reliability. The STRING database aims to collect, score and integrate all publicly available sources of protein-protein interaction information, and to complement these with computational predictions. Its goal is to achieve a comprehensive and objective global network, including direct (physical) as well as indirect (functional) interactions. The latest version of STRING (11.0) more than doubles the number of organisms it covers, to 5090. The most important new feature is an option to upload entire, genome-wide datasets as input, allowing users to visualize subsets as interaction networks and to perform gene-set enrichment analysis on the entire input. For the enrichment analysis, STRING implements well-known classification systems such as Gene Ontology and KEGG, but also offers additional, new classification systems based on high-throughput text-mining as well as on a hierarchical clustering of the association network itself. The STRING resource is available online at https://string-db.org/."} | 70 | {"work_id": 2900569176, "title": "STRING v11: protein\u2013protein association networks with increased coverage, supporting functional discovery in genome-wide experimental datasets", "abstract": "Proteins and their functional interactions form the backbone of the cellular machinery. Their connectivity network needs to be considered for the full understanding of biological phenomena, but the available information on protein-protein associations is incomplete and exhibits varying levels of annotation granularity and reliability. The STRING database aims to collect, score and integrate all publicly available sources of protein-protein interaction information, and to complement these with computational predictions. Its goal is to achieve a comprehensive and objective global network, including direct (physical) as well as indirect (functional) interactions. The latest version of STRING (11.0) more than doubles the number of organisms it covers, to 5090. The most important new feature is an option to upload entire, genome-wide datasets as input, allowing users to visualize subsets as interaction networks and to perform gene-set enrichment analysis on the entire input. For the enrichment analysis, STRING implements well-known classification systems such as Gene Ontology and KEGG, but also offers additional, new classification systems based on high-throughput text-mining as well as on a hierarchical clustering of the association network itself. The STRING resource is available online at https://string-db.org/."} | ||
| 73 | {"work_id": 3112376646, "title": "UniProt: the universal protein knowledgebase in 2021", "abstract": "The aim of the UniProt Knowledgebase is to provide users with a comprehensive, high-quality and freely accessible set of protein sequences annotated with functional information. In this article, we describe significant updates that we have made over the last two years to the resource. The number of sequences in UniProtKB has risen to approximately 190 million, despite continued work to reduce sequence redundancy at the proteome level. We have adopted new methods of assessing proteome completeness and quality. We continue to extract detailed annotations from the literature to add to reviewed entries and supplement these in unreviewed entries with annotations provided by automated systems such as the newly implemented Association-Rule-Based Annotator (ARBA). We have developed a credit-based publication submission interface to allow the community to contribute publications and annotations to UniProt entries. We describe how UniProtKB responded to the COVID-19 pandemic through expert curation of relevant entries that were rapidly made available to the research community through a dedicated portal. UniProt resources are available under a CC-BY (4.0) license via the web at https://www.uniprot.org/."} | 71 | {"work_id": 3112376646, "title": "UniProt: the universal protein knowledgebase in 2021", "abstract": "The aim of the UniProt Knowledgebase is to provide users with a comprehensive, high-quality and freely accessible set of protein sequences annotated with functional information. In this article, we describe significant updates that we have made over the last two years to the resource. The number of sequences in UniProtKB has risen to approximately 190 million, despite continued work to reduce sequence redundancy at the proteome level. We have adopted new methods of assessing proteome completeness and quality. We continue to extract detailed annotations from the literature to add to reviewed entries and supplement these in unreviewed entries with annotations provided by automated systems such as the newly implemented Association-Rule-Based Annotator (ARBA). We have developed a credit-based publication submission interface to allow the community to contribute publications and annotations to UniProt entries. We describe how UniProtKB responded to the COVID-19 pandemic through expert curation of relevant entries that were rapidly made available to the research community through a dedicated portal. UniProt resources are available under a CC-BY (4.0) license via the web at https://www.uniprot.org/."} | ||
| 74 | {"work_id": 4406405186, "title": "The design space of E(3)-equivariant atom-centred interatomic potentials", "abstract": "Molecular dynamics simulation is an important tool in computational materials science and chemistry, and in the past decade it has been revolutionized by machine learning. This rapid progress in machine learning interatomic potentials has produced a number of new architectures in just the past few years. Particularly notable among these are the atomic cluster expansion, which unified many of the earlier ideas around atom-density-based descriptors, and Neural Equivariant Interatomic Potentials (NequIP), a message-passing neural network with equivariant features that exhibited state-of-the-art accuracy at the time. Here we construct a mathematical framework that unifies these models: atomic cluster expansion is extended and recast as one layer of a multi-layer architecture, while the linearized version of NequIP is understood as a particular sparsification of a much larger polynomial model. Our framework also provides a practical tool for systematically probing different choices in this unified design space. An ablation study of NequIP, via a set of experiments looking at in- and out-of-domain accuracy and smooth extrapolation very far from the training data, sheds some light on which design choices are critical to achieving high accuracy. A much-simplified version of NequIP, which we call BOTnet (for body-ordered tensor network), has an interpretable architecture and maintains its accuracy on benchmark datasets."} | 72 | {"work_id": 4406405186, "title": "The design space of E(3)-equivariant atom-centred interatomic potentials", "abstract": "Molecular dynamics simulation is an important tool in computational materials science and chemistry, and in the past decade it has been revolutionized by machine learning. This rapid progress in machine learning interatomic potentials has produced a number of new architectures in just the past few years. Particularly notable among these are the atomic cluster expansion, which unified many of the earlier ideas around atom-density-based descriptors, and Neural Equivariant Interatomic Potentials (NequIP), a message-passing neural network with equivariant features that exhibited state-of-the-art accuracy at the time. Here we construct a mathematical framework that unifies these models: atomic cluster expansion is extended and recast as one layer of a multi-layer architecture, while the linearized version of NequIP is understood as a particular sparsification of a much larger polynomial model. Our framework also provides a practical tool for systematically probing different choices in this unified design space. An ablation study of NequIP, via a set of experiments looking at in- and out-of-domain accuracy and smooth extrapolation very far from the training data, sheds some light on which design choices are critical to achieving high accuracy. A much-simplified version of NequIP, which we call BOTnet (for body-ordered tensor network), has an interpretable architecture and maintains its accuracy on benchmark datasets."} | ||
| 75 | {"work_id": 3159995035, "title": "MetaboAnalyst 5.0: narrowing the gap between raw spectra and functional insights", "abstract": "Since its first release over a decade ago, the MetaboAnalyst web-based platform has become widely used for comprehensive metabolomics data analysis and interpretation. Here we introduce MetaboAnalyst version 5.0, aiming to narrow the gap from raw data to functional insights for global metabolomics based on high-resolution mass spectrometry (HRMS). Three modules have been developed to help achieve this goal, including: (i) a LC-MS Spectra Processing module which offers an easy-to-use pipeline that can perform automated parameter optimization and resumable analysis to significantly lower the barriers to LC-MS1 spectra processing; (ii) a Functional Analysis module which expands the previous MS Peaks to Pathways module to allow users to intuitively select any peak groups of interest and evaluate their enrichment of potential functions as defined by metabolic pathways and metabolite sets; (iii) a Functional Meta-Analysis module to combine multiple global metabolomics datasets obtained under complementary conditions or from similar studies to arrive at comprehensive functional insights. There are many other new functions including weighted joint-pathway analysis, data-driven network analysis, batch effect correction, merging technical replicates, improved compound name matching, etc. The web interface, graphics and underlying codebase have also been refactored to improve performance and user experience. At the end of an analysis session, users can now easily switch to other compatible modules for a more streamlined data analysis. MetaboAnalyst 5.0 is freely available at https://www.metaboanalyst.ca."} | 73 | {"work_id": 3159995035, "title": "MetaboAnalyst 5.0: narrowing the gap between raw spectra and functional insights", "abstract": "Since its first release over a decade ago, the MetaboAnalyst web-based platform has become widely used for comprehensive metabolomics data analysis and interpretation. Here we introduce MetaboAnalyst version 5.0, aiming to narrow the gap from raw data to functional insights for global metabolomics based on high-resolution mass spectrometry (HRMS). Three modules have been developed to help achieve this goal, including: (i) a LC-MS Spectra Processing module which offers an easy-to-use pipeline that can perform automated parameter optimization and resumable analysis to significantly lower the barriers to LC-MS1 spectra processing; (ii) a Functional Analysis module which expands the previous MS Peaks to Pathways module to allow users to intuitively select any peak groups of interest and evaluate their enrichment of potential functions as defined by metabolic pathways and metabolite sets; (iii) a Functional Meta-Analysis module to combine multiple global metabolomics datasets obtained under complementary conditions or from similar studies to arrive at comprehensive functional insights. There are many other new functions including weighted joint-pathway analysis, data-driven network analysis, batch effect correction, merging technical replicates, improved compound name matching, etc. The web interface, graphics and underlying codebase have also been refactored to improve performance and user experience. At the end of an analysis session, users can now easily switch to other compatible modules for a more streamlined data analysis. MetaboAnalyst 5.0 is freely available at https://www.metaboanalyst.ca."} | ||
| 76 | {"work_id": 4368358469, "title": "antiSMASH 7.0: new and improved predictions for detection, regulation, chemical structures and visualisation", "abstract": "Microorganisms produce small bioactive compounds as part of their secondary or specialised metabolism. Often, such metabolites have antimicrobial, anticancer, antifungal, antiviral or other bio-activities and thus play an important role for applications in medicine and agriculture. In the past decade, genome mining has become a widely-used method to explore, access, and analyse the available biodiversity of these compounds. Since 2011, the 'antibiotics and secondary metabolite analysis shell-antiSMASH' (https://antismash.secondarymetabolites.org/) has supported researchers in their microbial genome mining tasks, both as a free to use web server and as a standalone tool under an OSI-approved open source licence. It is currently the most widely used tool for detecting and characterising biosynthetic gene clusters (BGCs) in archaea, bacteria, and fungi. Here, we present the updated version 7 of antiSMASH. antiSMASH 7 increases the number of supported cluster types from 71 to 81, as well as containing improvements in the areas of chemical structure prediction, enzymatic assembly-line visualisation and gene cluster regulation."} | 74 | {"work_id": 4368358469, "title": "antiSMASH 7.0: new and improved predictions for detection, regulation, chemical structures and visualisation", "abstract": "Microorganisms produce small bioactive compounds as part of their secondary or specialised metabolism. Often, such metabolites have antimicrobial, anticancer, antifungal, antiviral or other bio-activities and thus play an important role for applications in medicine and agriculture. In the past decade, genome mining has become a widely-used method to explore, access, and analyse the available biodiversity of these compounds. Since 2011, the 'antibiotics and secondary metabolite analysis shell-antiSMASH' (https://antismash.secondarymetabolites.org/) has supported researchers in their microbial genome mining tasks, both as a free to use web server and as a standalone tool under an OSI-approved open source licence. It is currently the most widely used tool for detecting and characterising biosynthetic gene clusters (BGCs) in archaea, bacteria, and fungi. Here, we present the updated version 7 of antiSMASH. antiSMASH 7 increases the number of supported cluster types from 71 to 81, as well as containing improvements in the areas of chemical structure prediction, enzymatic assembly-line visualisation and gene cluster regulation."} | ||
| 77 | −{"work_id": 7139978436, "title": "Whole-genome prediction of bacterial pathogenic capacity on novel bacteria using protein language models with PathogenFinder2", "abstract": "MOTIVATION: Infectious diseases continue to be a leading cause of mortality and pose a significant global health threat. Thus, the development of tools for surveillance and early detection of emerging pathogens is needed. RESULTS: We introduce PathogenFinder2, a novel, alignment-free, taxonomy-agnostic model for predicting bacterial pathogenic capacity in humans using protein language models. It outperforms previous methods, particularly for novel taxa, and provides interpretable outputs by highlighting proteins most relevant to pathogenic potential. These insights aid the identification of virulence factors, vaccine targets, and infection-related metabolic pathways. Furthermore, we introduce the Bacterial Pathogenic Capacity Landscape, which reveals patterns linked to host condition, infection site, microbial antagonism, and environmental origin. AVAILABILITY: The model is freely available online at https://genepi.dk/pathogenfinder2, or as a standalone program (https://github.com/genomicepidemiology/PathogenFinder2)."} | ||||
| 78 | {"work_id": 3161596995, "title": "antiSMASH 6.0: improving cluster detection and comparison capabilities", "abstract": "Many microorganisms produce natural products that form the basis of antimicrobials, antivirals, and other drugs. Genome mining is routinely used to complement screening-based workflows to discover novel natural products. Since 2011, the \"antibiotics and secondary metabolite analysis shell-antiSMASH\" (https://antismash.secondarymetabolites.org/) has supported researchers in their microbial genome mining tasks, both as a free-to-use web server and as a standalone tool under an OSI-approved open-source license. It is currently the most widely used tool for detecting and characterising biosynthetic gene clusters (BGCs) in bacteria and fungi. Here, we present the updated version 6 of antiSMASH. antiSMASH 6 increases the number of supported cluster types from 58 to 71, displays the modular structure of multi-modular BGCs, adds a new BGC comparison algorithm, allows for the integration of results from other prediction tools, and more effectively detects tailoring enzymes in RiPP clusters."} | 75 | {"work_id": 3161596995, "title": "antiSMASH 6.0: improving cluster detection and comparison capabilities", "abstract": "Many microorganisms produce natural products that form the basis of antimicrobials, antivirals, and other drugs. Genome mining is routinely used to complement screening-based workflows to discover novel natural products. Since 2011, the \"antibiotics and secondary metabolite analysis shell-antiSMASH\" (https://antismash.secondarymetabolites.org/) has supported researchers in their microbial genome mining tasks, both as a free-to-use web server and as a standalone tool under an OSI-approved open-source license. It is currently the most widely used tool for detecting and characterising biosynthetic gene clusters (BGCs) in bacteria and fungi. Here, we present the updated version 6 of antiSMASH. antiSMASH 6 increases the number of supported cluster types from 58 to 71, displays the modular structure of multi-modular BGCs, adds a new BGC comparison algorithm, allows for the integration of results from other prediction tools, and more effectively detects tailoring enzymes in RiPP clusters."} | ||
| 79 | {"work_id": 4309506674, "title": "UniProt: the Universal Protein Knowledgebase in 2023", "abstract": "The aim of the UniProt Knowledgebase is to provide users with a comprehensive, high-quality and freely accessible set of protein sequences annotated with functional information. In this publication we describe enhancements made to our data processing pipeline and to our website to adapt to an ever-increasing information content. The number of sequences in UniProtKB has risen to over 227 million and we are working towards including a reference proteome for each taxonomic group. We continue to extract detailed annotations from the literature to update or create reviewed entries, while unreviewed entries are supplemented with annotations provided by automated systems using a variety of machine-learning techniques. In addition, the scientific community continues their contributions of publications and annotations to UniProt entries of their interest. Finally, we describe our new website (https://www.uniprot.org/), designed to enhance our users' experience and make our data easily accessible to the research community. This interface includes access to AlphaFold structures for more than 85% of all entries as well as improved visualisations for subcellular localisation of proteins."} | 76 | {"work_id": 4309506674, "title": "UniProt: the Universal Protein Knowledgebase in 2023", "abstract": "The aim of the UniProt Knowledgebase is to provide users with a comprehensive, high-quality and freely accessible set of protein sequences annotated with functional information. In this publication we describe enhancements made to our data processing pipeline and to our website to adapt to an ever-increasing information content. The number of sequences in UniProtKB has risen to over 227 million and we are working towards including a reference proteome for each taxonomic group. We continue to extract detailed annotations from the literature to update or create reviewed entries, while unreviewed entries are supplemented with annotations provided by automated systems using a variety of machine-learning techniques. In addition, the scientific community continues their contributions of publications and annotations to UniProt entries of their interest. Finally, we describe our new website (https://www.uniprot.org/), designed to enhance our users' experience and make our data easily accessible to the research community. This interface includes access to AlphaFold structures for more than 85% of all entries as well as improved visualisations for subcellular localisation of proteins."} | ||
| 80 | {"work_id": 4406406714, "title": "Battery lifetime prediction across diverse ageing conditions with inter-cell deep learning", "abstract": "Abstract Accurately predicting battery lifetime in early cycles holds tremendous value in real-world applications. However, this task poses significant challenges due to diverse factors influencing complex battery capacity degradation, such as cycling protocols, ambient temperatures and electrode materials. Moreover, cycling under specific conditions is both resource-intensive and time-consuming. Existing predictive models, primarily developed and validated within a restricted set of ageing conditions, thus raise doubts regarding their extensive applicability. Here we introduce BatLiNet, a deep learning framework tailored to predict battery lifetime reliably across a variety of ageing conditions. The distinctive design is integrating an inter-cell learning mechanism to predict the lifetime differences between two battery cells. This mechanism, when combined with conventional single-cell learning, enhances the stability of lifetime predictions for a target cell under varied ageing conditions. Our experimental results, derived from a broad spectrum of ageing conditions, demonstrate BatLiNet\u2019s superior accuracy and robustness compared to existing models. BatLiNet also exhibits transferring capabilities across different battery chemistries, benefitting scenarios with limited resources. We expect this study could promote exploration of cross-cell insights and facilitate battery research across comprehensive ageing factors."} | 77 | {"work_id": 4406406714, "title": "Battery lifetime prediction across diverse ageing conditions with inter-cell deep learning", "abstract": "Abstract Accurately predicting battery lifetime in early cycles holds tremendous value in real-world applications. However, this task poses significant challenges due to diverse factors influencing complex battery capacity degradation, such as cycling protocols, ambient temperatures and electrode materials. Moreover, cycling under specific conditions is both resource-intensive and time-consuming. Existing predictive models, primarily developed and validated within a restricted set of ageing conditions, thus raise doubts regarding their extensive applicability. Here we introduce BatLiNet, a deep learning framework tailored to predict battery lifetime reliably across a variety of ageing conditions. The distinctive design is integrating an inter-cell learning mechanism to predict the lifetime differences between two battery cells. This mechanism, when combined with conventional single-cell learning, enhances the stability of lifetime predictions for a target cell under varied ageing conditions. Our experimental results, derived from a broad spectrum of ageing conditions, demonstrate BatLiNet\u2019s superior accuracy and robustness compared to existing models. BatLiNet also exhibits transferring capabilities across different battery chemistries, benefitting scenarios with limited resources. We expect this study could promote exploration of cross-cell insights and facilitate battery research across comprehensive ageing factors."} | ||
@@ -85,14 +82,14 @@ | |||||
| 85 | {"work_id": 2803664483, "title": "MetaboAnalyst 4.0: towards more transparent and integrative metabolomics analysis", "abstract": "We present a new update to MetaboAnalyst (version 4.0) for comprehensive metabolomic data analysis, interpretation, and integration with other omics data. Since the last major update in 2015, MetaboAnalyst has continued to evolve based on user feedback and technological advancements in the field. For this year's update, four new key features have been added to MetaboAnalyst 4.0, including: (1) real-time R command tracking and display coupled with the release of a companion MetaboAnalystR package; (2) a MS Peaks to Pathways module for prediction of pathway activity from untargeted mass spectral data using the mummichog algorithm; (3) a Biomarker Meta-analysis module for robust biomarker identification through the combination of multiple metabolomic datasets and (4) a Network Explorer module for integrative analysis of metabolomics, metagenomics, and/or transcriptomics data. The user interface of MetaboAnalyst 4.0 has been reengineered to provide a more modern look and feel, as well as to give more space and flexibility to introduce new functions. The underlying knowledgebases (compound libraries, metabolite sets, and metabolic pathways) have also been updated based on the latest data from the Human Metabolome Database (HMDB). A Docker image of MetaboAnalyst is also available to facilitate download and local installation of MetaboAnalyst. MetaboAnalyst 4.0 is freely available at http://metaboanalyst.ca."} | 82 | {"work_id": 2803664483, "title": "MetaboAnalyst 4.0: towards more transparent and integrative metabolomics analysis", "abstract": "We present a new update to MetaboAnalyst (version 4.0) for comprehensive metabolomic data analysis, interpretation, and integration with other omics data. Since the last major update in 2015, MetaboAnalyst has continued to evolve based on user feedback and technological advancements in the field. For this year's update, four new key features have been added to MetaboAnalyst 4.0, including: (1) real-time R command tracking and display coupled with the release of a companion MetaboAnalystR package; (2) a MS Peaks to Pathways module for prediction of pathway activity from untargeted mass spectral data using the mummichog algorithm; (3) a Biomarker Meta-analysis module for robust biomarker identification through the combination of multiple metabolomic datasets and (4) a Network Explorer module for integrative analysis of metabolomics, metagenomics, and/or transcriptomics data. The user interface of MetaboAnalyst 4.0 has been reengineered to provide a more modern look and feel, as well as to give more space and flexibility to introduce new functions. The underlying knowledgebases (compound libraries, metabolite sets, and metabolic pathways) have also been updated based on the latest data from the Human Metabolome Database (HMDB). A Docker image of MetaboAnalyst is also available to facilitate download and local installation of MetaboAnalyst. MetaboAnalyst 4.0 is freely available at http://metaboanalyst.ca."} | ||
| 86 | {"work_id": 7154488692, "title": "Lightweight Kolmogorov-Arnold Network with dual-objective optimization for axial capacity prediction of square coal gangue concrete-filled steel tube stub columns based on finite element simulation", "abstract": null} | 83 | {"work_id": 7154488692, "title": "Lightweight Kolmogorov-Arnold Network with dual-objective optimization for axial capacity prediction of square coal gangue concrete-filled steel tube stub columns based on finite element simulation", "abstract": null} | ||
| 87 | {"work_id": 3038025793, "title": "VASPKIT: A user-friendly interface facilitating high-throughput computing and analysis using VASP code", "abstract": null} | 84 | {"work_id": 3038025793, "title": "VASPKIT: A user-friendly interface facilitating high-throughput computing and analysis using VASP code", "abstract": null} | ||
| 88 | −{"work_id": 4406633314, "title": "Artificial intelligence in drug development", "abstract": null} | ||||
| 89 | {"work_id": 3007309629, "title": "A Deep Learning Approach to Antibiotic Discovery", "abstract": null} | 85 | {"work_id": 3007309629, "title": "A Deep Learning Approach to Antibiotic Discovery", "abstract": null} | ||
| 90 | {"work_id": 4389991855, "title": "Discovery of a structural class of antibiotics with explainable deep learning", "abstract": null} | 86 | {"work_id": 4389991855, "title": "Discovery of a structural class of antibiotics with explainable deep learning", "abstract": null} | ||
| 87 | +{"work_id": 4399728220, "title": "Kolmogorov\u2013Arnold-Informed Neural Network: A Physics-Informed Deep Learning Framework for Solving Pdes Based on Kolmogorov\u2013Arnold Networks", "abstract": null} | ||||
| 91 | {"work_id": 4408339746, "title": "From PINNs to PIKANs: recent advances in physics-informed machine learning", "abstract": null} | 88 | {"work_id": 4408339746, "title": "From PINNs to PIKANs: recent advances in physics-informed machine learning", "abstract": null} | ||
| 92 | {"work_id": 4385490607, "title": "Scientific discovery in the age of artificial intelligence", "abstract": null} | 89 | {"work_id": 4385490607, "title": "Scientific discovery in the age of artificial intelligence", "abstract": null} | ||
| 90 | +{"work_id": 4393097303, "title": "Generative AI for designing and validating easily synthesizable and structurally novel antibiotics", "abstract": null} | ||||
| 93 | {"work_id": 4407922392, "title": "Large language models for scientific discovery in molecular property prediction", "abstract": null} | 91 | {"work_id": 4407922392, "title": "Large language models for scientific discovery in molecular property prediction", "abstract": null} | ||
| 94 | {"work_id": 4407925765, "title": "A practical guide to machine learning interatomic potentials \u2013 Status and future", "abstract": null} | 92 | {"work_id": 4407925765, "title": "A practical guide to machine learning interatomic potentials \u2013 Status and future", "abstract": null} | ||
| 95 | −{"work_id": 7128919969, "title": "SA-PINN: A self-attention enhanced physics-informed neural network for multiaxial fatigue life prediction with small samples", "abstract": null} | ||||
| 96 | {"work_id": 4409069046, "title": "A predictive machine learning force-field framework for liquid electrolyte development", "abstract": null} | 93 | {"work_id": 4409069046, "title": "A predictive machine learning force-field framework for liquid electrolyte development", "abstract": null} | ||
| 97 | {"work_id": 4417522354, "title": "NEP89: universal neuroevolution potential for inorganic and organic materials across 89 elements", "abstract": null} | 94 | {"work_id": 4417522354, "title": "NEP89: universal neuroevolution potential for inorganic and organic materials across 89 elements", "abstract": null} | ||
| 98 | {"work_id": 2944434778, "title": "The REDCap consortium: Building an international community of software platform partners", "abstract": null} | 95 | {"work_id": 2944434778, "title": "The REDCap consortium: Building an international community of software platform partners", "abstract": null} | ||
modified
literature_synthesis/landmarks/computational_science_landmarks.csv
+98 −101
@@ -1,101 +1,98 @@ | |||||
| 1 | −work_id,doi,arxiv_id,title,source_name,year,type,primary_category,n_categories,c12,c36,ncs36,cited_by_count,fwci,has_abstract,is_oa,period,score,set,pi_review | 1 | +work_id,doi,arxiv_id,title,source_name,year,type,primary_category,n_categories,c12,c36,ncs36,cited_by_count,fwci,has_abstract,is_oa,period,ntitle,score,set,pi_review | ||
| 2 | −3029645440,10.1017/9781108993456.011,,Numerical optimization,Cambridge University Press eBooks,2021,book-chapter,scientific_computing,1,9332.0,9351.0,3148.4582677769677,13724,453.7174,True,False,baseline,3148.4582677769677,landmark,True | 2 | +3003257820,10.1038/s41592-019-0686-2,1907.10121,SciPy 1.0: fundamental algorithms for scientific computing in Python,Nature Methods,2020,article,scientific_computing,4,5667.0,10506.0,1314.046621797279,37925,1523.8871,True,True,baseline,scipy10fundamentalalgorithmsforscientificcomputinginpython,1314.046621797279,landmark,True | ||
| 3 | −3003257820,10.1038/s41592-019-0686-2,1907.10121,SciPy 1.0: fundamental algorithms for scientific computing in Python,Nature Methods,2020,article,scientific_computing,4,5667.0,10506.0,1314.046621797279,37925,1523.8871,True,True,baseline,1314.046621797279,landmark,True | 3 | +3201073812,10.1016/j.cpc.2021.108171,,"LAMMPS - a flexible simulation tool for particle-based materials modeling at the atomic, meso, and continuum scales",Computer Physics Communications,2021,article,scientific_computing,8,826.0,2697.0,568.1403850199874,12382,907.8113,True,True,baseline,lammpsaflexiblesimulationtoolforparticlebasedmaterialsmodelingattheatomicmesoandcontinuumscales,568.1403850199874,landmark,True | ||
| 4 | −3035965352,10.1038/s41586-020-2649-2,2006.10256,Array programming with NumPy,Nature,2020,article,scientific_computing,4,2086.0,5137.0,642.5145151506398,23207,829.0931,True,True,baseline,642.5145151506398,landmark,True | 4 | +2990427812,10.21105/joss.01686,,Welcome to the Tidyverse,The Journal of Open Source Software,2019,article,scientific_computing,2,697.0,2788.0,423.93060156353516,21504,642.5886,True,True,baseline,welcometothetidyverse,423.93060156353516,landmark,True | ||
| 5 | −3201073812,10.1016/j.cpc.2021.108171,,"LAMMPS - a flexible simulation tool for particle-based materials modeling at the atomic, meso, and continuum scales",Computer Physics Communications,2021,article,scientific_computing,8,826.0,2697.0,568.1403850199874,12382,907.8113,True,True,baseline,568.1403850199874,landmark,True | 5 | +3099929043,,,Bayesian probabilistic numerical methods,Warwick Research Archive Portal (University of Warwick),2019,dissertation,scientific_computing,3,61.0,81.0,294.96774193548384,85,,True,False,baseline,bayesianprobabilisticnumericalmethods,294.96774193548384,landmark,True | ||
| 6 | −2990427812,10.21105/joss.01686,,Welcome to the Tidyverse,The Journal of Open Source Software,2019,article,scientific_computing,2,697.0,2788.0,423.93060156353516,21504,642.5886,True,True,baseline,423.93060156353516,landmark,True | 6 | +3133457239,10.34726/hss.2010.001,,Numerical methods for topography simulation,reposiTUm (TU Wien),2019,dissertation,scientific_computing,2,9.0,10.0,222.03389830508473,13,,True,True,baseline,numericalmethodsfortopographysimulation,222.03389830508473,landmark,True | ||
| 7 | −90568776,,,PETSc Users Manual,,2019,article,scientific_computing,5,1066.0,1207.0,340.27902486121167,1896,114.6007,True,False,baseline,340.27902486121167,landmark,True | 7 | +2888532099,10.3847/1538-3881/aabc4f,,The Astropy Project: Building an Open-science Project and Status of the v2.0 Core Package *,The Astronomical Journal,2018,article,scientific_computing,1,459.0,1025.0,193.46314218749401,7687,234.9501,True,True,baseline,theastropyprojectbuildinganopenscienceprojectandstatusofthev20corepackage,193.46314218749401,landmark,True | ||
| 8 | −3099929043,,,Bayesian probabilistic numerical methods,Warwick Research Archive Portal (University of Warwick),2019,dissertation,scientific_computing,3,61.0,81.0,294.96774193548384,85,,True,False,baseline,294.96774193548384,landmark,True | 8 | +1494474111,10.1515/9783110666991-007,,7 Linear algebra applications,De Gruyter eBooks,2020,book-chapter,scientific_computing,2,184.0,190.0,163.70790263421142,482,30.6361,True,False,baseline,7linearalgebraapplications,163.70790263421142,landmark,True | ||
| 9 | −3133457239,10.34726/hss.2010.001,,Numerical methods for topography simulation,reposiTUm (TU Wien),2019,dissertation,scientific_computing,2,9.0,10.0,222.03389830508473,13,,True,True,baseline,222.03389830508473,landmark,True | 9 | +2913606428,10.3758/s13428-018-01193-y,,PsychoPy2: Experiments in behavior made easy,Behavior Research Methods,2019,article,scientific_computing,1,351.0,816.0,124.07724923810785,5166,170.3746,True,True,baseline,psychopy2experimentsinbehaviormadeeasy,124.07724923810785,landmark,True | ||
| 10 | −2888532099,10.3847/1538-3881/aabc4f,,The Astropy Project: Building an Open-science Project and Status of the v2.0 Core Package *,The Astronomical Journal,2018,article,scientific_computing,1,459.0,1025.0,193.46314218749401,7687,234.9501,True,True,baseline,193.46314218749401,landmark,True | 10 | +3038025793,10.1016/j.cpc.2021.108033,,VASPKIT: A user-friendly interface facilitating high-throughput computing and analysis using VASP code,Computer Physics Communications,2021,article,scientific_computing,1,947.0,2087.0,120.59877093864604,7856,267.5871,False,True,baseline,vaspkitauserfriendlyinterfacefacilitatinghighthroughputcomputingandanalysisusingvaspcode,120.59877093864604,landmark,True | ||
| 11 | −1494474111,10.1515/9783110666991-007,,7 Linear algebra applications,De Gruyter eBooks,2020,book-chapter,scientific_computing,2,184.0,190.0,163.70790263421142,482,30.6361,True,False,baseline,163.70790263421142,landmark,True | 11 | +7154488692,10.1016/j.engappai.2026.114843,,Lightweight Kolmogorov-Arnold Network with dual-objective optimization for axial capacity prediction of square coal gangue concrete-filled steel tube stub columns based on finite element simulation,Engineering Applications of Artificial Intelligence,2026,article,scientific_computing,1,45.0,45.0,33.579175704989154,45,110.7417,False,False,post,lightweightkolmogorovarnoldnetworkwithdualobjectiveoptimizationforaxialcapacitypredictionofsquarecoalgangueconcretefilledsteeltubestubcolumnsbasedonfiniteelementsimulation,114.09616854859023,landmark,True | ||
| 12 | −7154488692,10.1016/j.engappai.2026.114843,,Lightweight Kolmogorov-Arnold Network with dual-objective optimization for axial capacity prediction of square coal gangue concrete-filled steel tube stub columns based on finite element simulation,Engineering Applications of Artificial Intelligence,2026,article,scientific_computing,1,45.0,45.0,33.579175704989154,45,110.7417,False,False,post,159.98492606958206,landmark,True | 12 | +4383218913,10.1038/s41586-023-06185-3,,Accurate medium-range global weather forecasting with 3D neural networks,Nature,2023,article,scientific_computing,1,511.0,1104.0,106.38333772739257,1634,181.7259,True,True,post,accuratemediumrangeglobalweatherforecastingwith3dneuralnetworks,106.38333772739257,landmark,True | ||
| 13 | −2913606428,10.3758/s13428-018-01193-y,,PsychoPy2: Experiments in behavior made easy,Behavior Research Methods,2019,article,scientific_computing,1,351.0,816.0,124.07724923810785,5166,170.3746,True,True,baseline,124.07724923810785,landmark,True | 13 | +4408339746,10.1007/s44379-025-00015-1,2410.13228,From PINNs to PIKANs: recent advances in physics-informed machine learning,Machine learning for computational science and engineering,2025,article,scientific_computing,3,239.0,239.0,51.33385214007782,239,102.1338,False,True,post,frompinnstopikansrecentadvancesinphysicsinformedmachinelearning,104.43620467044524,landmark,True | ||
| 14 | −4408339746,10.1007/s44379-025-00015-1,2410.13228,From PINNs to PIKANs: recent advances in physics-informed machine learning,Machine learning for computational science and engineering,2025,article,scientific_computing,3,239.0,239.0,51.33385214007782,239,102.1338,False,True,post,120.99586631516542,landmark,True | 14 | +4386373863,10.7717/peerj-cs.1516,,"PyMC: a modern, and comprehensive probabilistic programming framework in Python",PeerJ Computer Science,2023,article,scientific_computing,4,390.0,626.0,100.85192909280501,870,132.4344,True,True,post,pymcamodernandcomprehensiveprobabilisticprogrammingframeworkinpython,100.85192909280501,landmark,True | ||
| 15 | −4417522354,10.1038/s43588-026-01009-6,,NEP89: universal neuroevolution potential for inorganic and organic materials across 89 elements,Nature Computational Science,2026,article,scientific_computing,1,34.0,34.0,26.21830985915493,34,44.9009,False,True,post,120.87749969701756,landmark,True | 15 | +4407925765,10.1016/j.cossms.2025.101214,2503.09814,A practical guide to machine learning interatomic potentials – Status and future,Current Opinion in Solid State and Materials Science,2025,review,scientific_computing,1,214.0,214.0,3.7709251101321586,214,9.2721,False,True,post,apracticalguidetomachinelearninginteratomicpotentialsstatusandfuture,93.51191547897606,landmark,True | ||
| 16 | −3038025793,10.1016/j.cpc.2021.108033,,VASPKIT: A user-friendly interface facilitating high-throughput computing and analysis using VASP code,Computer Physics Communications,2021,article,scientific_computing,1,947.0,2087.0,120.59877093864604,7856,267.5871,False,True,baseline,120.59877093864604,landmark,True | 16 | +2962853966,10.1007/s10915-018-0757-z,1511.06324,Global Convergence of ADMM in Nonconvex Nonsmooth Optimization,Journal of Scientific Computing,2018,article,scientific_computing,2,246.0,390.0,92.76320659281009,1268,89.8329,False,True,baseline,globalconvergenceofadmminnonconvexnonsmoothoptimization,92.76320659281009,landmark,True | ||
| 17 | −3143496104,10.1201/9781315107042-14,,Numerical Optimization,CRC Press eBooks,2018,book-chapter,scientific_computing,2,225.0,235.0,109.14754610815879,335,14.0895,True,False,baseline,109.14754610815879,landmark,True | 17 | +4417522354,10.1038/s43588-026-01009-6,,NEP89: universal neuroevolution potential for inorganic and organic materials across 89 elements,Nature Computational Science,2026,article,scientific_computing,1,34.0,34.0,26.21830985915493,34,44.9009,False,True,post,nep89universalneuroevolutionpotentialforinorganicandorganicmaterialsacross89elements,86.2059940144904,landmark,True | ||
| 18 | −4407925765,10.1016/j.cossms.2025.101214,2503.09814,A practical guide to machine learning interatomic potentials – Status and future,Current Opinion in Solid State and Materials Science,2025,review,scientific_computing,1,214.0,214.0,3.7709251101321586,214,9.2721,False,True,post,108.3393949432862,landmark,True | 18 | +4288039037,10.1007/s10915-022-01939-z,2201.05624,Scientific Machine Learning Through Physics–Informed Neural Networks: Where we are and What’s Next,Journal of Scientific Computing,2022,article,scientific_computing,4,341.0,893.0,76.4919191278996,2784,166.3219,True,True,baseline,scientificmachinelearningthroughphysicsinformedneuralnetworkswhereweareandwhatsnext,76.4919191278996,landmark,True | ||
| 19 | −4383218913,10.1038/s41586-023-06185-3,,Accurate medium-range global weather forecasting with 3D neural networks,Nature,2023,article,scientific_computing,1,511.0,1104.0,106.38333772739257,1634,181.7259,True,True,post,106.38333772739257,landmark,True | 19 | +2766160192,10.32614/rj-2018-017,,Advanced Bayesian Multilevel Modeling with the R Package brms,The R Journal,2018,article,scientific_computing,3,101.0,378.0,75.7268279043758,2942,170.9214,True,True,baseline,advancedbayesianmultilevelmodelingwiththerpackagebrms,75.7268279043758,landmark,True | ||
| 20 | −4386373863,10.7717/peerj-cs.1516,,"PyMC: a modern, and comprehensive probabilistic programming framework in Python",PeerJ Computer Science,2023,article,scientific_computing,4,390.0,626.0,100.85192909280501,870,132.4344,True,True,post,100.85192909280501,landmark,True | 20 | +3010959735,,,Gaussin prosessi -surrogaattimenetelmiä likimääräiseen Bayesilaiseen päättelyyn,Aaltodoc (Aalto University),2020,dissertation,scientific_computing,4,9.0,15.0,69.26632428466618,28,,True,True,baseline,gaussinprosessisurrogaattimenetelmilikimriseenbayesilaiseenpttelyyn,69.26632428466618,landmark,True | ||
| 21 | −4242546620,10.1007/978-1-4842-6876-6_1,,DPLYR,Apress eBooks,2021,book-chapter,scientific_computing,1,185.0,286.0,96.29548332629801,367,143.0004,True,False,baseline,96.29548332629801,landmark,True | 21 | +3161540023,10.21105/joss.03167,,Visualizations with statistical details: The 'ggstatsplot' approach,The Journal of Open Source Software,2021,article,scientific_computing,2,245.0,572.0,66.66226424076243,1496,84.8639,True,True,baseline,visualizationswithstatisticaldetailstheggstatsplotapproach,66.66226424076243,landmark,True | ||
| 22 | −2962853966,10.1007/s10915-018-0757-z,1511.06324,Global Convergence of ADMM in Nonconvex Nonsmooth Optimization,Journal of Scientific Computing,2018,article,scientific_computing,2,246.0,390.0,92.76320659281009,1268,89.8329,False,True,baseline,92.76320659281009,landmark,True | 22 | +4241803778,10.2172/1614847,,PETSc Users Manual (Rev. 3.13),,2020,report,scientific_computing,4,50.0,85.0,65.38461538461539,125,,True,True,baseline,petscusersmanualrev313,65.38461538461539,landmark,True | ||
| 23 | −4211084734,10.1017/9781108594967.028,,Positive Definite Matrices,Cambridge University Press eBooks,2019,book-chapter,scientific_computing,1,102.0,110.0,89.28544845552662,166,22.481,True,False,baseline,89.28544845552662,landmark,True | 23 | +4385811703,10.33915/etd.12076,,Accelerating Manufacturing Decisions using Bayesian Optimization: An Optimization and Prediction Perspective,,2023,dissertation,scientific_computing,3,1.0,3.0,64.72727272727272,3,,True,True,post,acceleratingmanufacturingdecisionsusingbayesianoptimizationanoptimizationandpredictionperspective,64.72727272727272,landmark,True | ||
| 24 | −4245687930,10.1201/9781003090601-06,,Chemical Reaction Engineering,CRC Press eBooks,2020,book-chapter,scientific_computing,2,90.0,102.0,81.77618941255305,322,24.1009,True,False,baseline,81.77618941255305,landmark,True | 24 | +3045710579,10.21468/scipostphyscodeb.4,2007.14822,The ITensor Software Library for Tensor Network Calculations,SciPost Physics Codebases,2022,article,scientific_computing,1,352.0,566.0,63.07331378299121,1078,80.8504,True,True,baseline,theitensorsoftwarelibraryfortensornetworkcalculations,63.07331378299121,landmark,True | ||
| 25 | −7128919969,10.1016/j.advengsoft.2026.104124,,SA-PINN: A self-attention enhanced physics-informed neural network for multiaxial fatigue life prediction with small samples,Advances in Engineering Software,2026,article,scientific_computing,2,23.0,23.0,25.467432950191572,23,46.775,False,False,post,81.77007332445305,landmark,True | 25 | +4399728220,10.2139/ssrn.4868150,,Kolmogorov–Arnold-Informed Neural Network: A Physics-Informed Deep Learning Framework for Solving Pdes Based on Kolmogorov–Arnold Networks,SSRN Electronic Journal,2024,preprint,scientific_computing,2,45.0,53.0,62.46666666666666,53,,False,True,post,kolmogorovarnoldinformedneuralnetworkaphysicsinformeddeeplearningframeworkforsolvingpdesbasedonkolmogorovarnoldnetworks,62.46666666666666,landmark,True | ||
| 26 | −4415338867,10.1137/25m1738863,2503.00768,Nonlinear Model Reduction by Probabilistic Manifold Decomposition,SIAM Journal on Scientific Computing,2026,article,scientific_computing,2,22.0,22.0,22.669565217391305,22,75.5825,True,True,post,78.21485274512901,landmark,True | 26 | +4200153169,10.1201/9781315228969-4,,Variational and Quasi-Variational Inequalities,Chapman & Hall/CRC eBooks,2021,book-chapter,scientific_computing,1,94.0,96.0,61.80957282552753,407,13.851,True,False,baseline,variationalandquasivariationalinequalities,61.80957282552753,landmark,True | ||
| 27 | −2944434778,10.1016/j.jbi.2019.103208,,The REDCap consortium: Building an international community of software platform partners,Journal of Biomedical Informatics,2019,article,computational_biology,1,1231.0,3835.0,1565.383789896379,23807,2212.4824,False,True,baseline,1565.383789896379,landmark,True | 27 | +2944434778,10.1016/j.jbi.2019.103208,,The REDCap consortium: Building an international community of software platform partners,Journal of Biomedical Informatics,2019,article,computational_biology,1,1231.0,3835.0,1565.383789896379,23807,2212.4824,False,True,baseline,theredcapconsortiumbuildinganinternationalcommunityofsoftwareplatformpartners,1565.383789896379,landmark,True | ||
| 28 | −4403324307,10.1101/2024.10.10.615955,,Chai-1: Decoding the molecular interactions of life,bioRxiv (Cold Spring Harbor Laboratory),2024,preprint,computational_biology,2,211.0,430.0,694.8057553956835,430,,True,True,post,694.8057553956835,landmark,True | 28 | +4403324307,10.1101/2024.10.10.615955,,Chai-1: Decoding the molecular interactions of life,bioRxiv (Cold Spring Harbor Laboratory),2024,preprint,computational_biology,2,211.0,430.0,694.8057553956835,430,,True,True,post,chai1decodingthemolecularinteractionsoflife,694.8057553956835,landmark,True | ||
| 29 | −4416043407,10.1038/s41586-026-10644-y,2502.18864,Accelerating scientific discovery with Co-Scientist,Nature,2026,article,computational_biology,7,110.0,110.0,310.59696003922534,110,359.9514,True,True,post,391.07426372564504,landmark,True | 29 | +3097145107,10.1093/nar/gkaa971,,PubChem in 2021: new data content and improved web interfaces,Nucleic Acids Research,2020,article,computational_biology,1,405.0,1318.0,383.79097718298823,3926,538.5909,True,True,baseline,pubchemin2021newdatacontentandimprovedwebinterfaces,383.79097718298823,landmark,True | ||
| 30 | −3097145107,10.1093/nar/gkaa971,,PubChem in 2021: new data content and improved web interfaces,Nucleic Acids Research,2020,article,computational_biology,1,405.0,1318.0,383.79097718298823,3926,538.5909,True,True,baseline,383.79097718298823,landmark,True | 30 | +4411463597,10.1101/2025.06.14.659707,,Boltz-2: Towards Accurate and Efficient Binding Affinity Prediction,bioRxiv (Cold Spring Harbor Laboratory),2025,preprint,computational_biology,3,665.0,665.0,2415.2006880733943,665,,True,True,post,boltz2towardsaccurateandefficientbindingaffinityprediction,290.58609249307983,landmark,True | ||
| 31 | −4411463597,10.1101/2025.06.14.659707,,Boltz-2: Towards Accurate and Efficient Binding Affinity Prediction,bioRxiv (Cold Spring Harbor Laboratory),2025,preprint,computational_biology,3,665.0,665.0,2415.2006880733943,665,,True,True,post,336.6621384919875,landmark,True | 31 | +4416043407,10.1038/s41586-026-10644-y,2502.18864,Accelerating scientific discovery with Co-Scientist,Nature,2026,article,computational_biology,7,110.0,110.0,310.59696003922534,110,359.9514,True,True,post,acceleratingscientificdiscoverywithcoscientist,278.90174534099833,landmark,True | ||
| 32 | −3008142620,10.1016/j.apsb.2020.02.008,,Analysis of therapeutic targets for SARS-CoV-2 and discovery of potential drugs by computational methods,Acta Pharmaceutica Sinica B,2020,article,computational_biology,2,1435.0,1826.0,268.8646986800856,2330,247.2738,True,True,baseline,268.8646986800856,landmark,True | 32 | +3008142620,10.1016/j.apsb.2020.02.008,,Analysis of therapeutic targets for SARS-CoV-2 and discovery of potential drugs by computational methods,Acta Pharmaceutica Sinica B,2020,article,computational_biology,2,1435.0,1826.0,268.8646986800856,2330,247.2738,True,True,baseline,analysisoftherapeutictargetsforsarscov2anddiscoveryofpotentialdrugsbycomputationalmethods,268.8646986800856,landmark,True | ||
| 33 | −4395010444,10.1093/nar/gkae303,,ProTox 3.0: a webserver for the prediction of toxicity of chemicals,Nucleic Acids Research,2024,article,computational_biology,2,785.0,1601.0,266.05146653514754,1601,313.6638,True,True,post,266.05146653514754,landmark,True | 33 | +4395010444,10.1093/nar/gkae303,,ProTox 3.0: a webserver for the prediction of toxicity of chemicals,Nucleic Acids Research,2024,article,computational_biology,2,785.0,1601.0,266.05146653514754,1601,313.6638,True,True,post,protox30awebserverforthepredictionoftoxicityofchemicals,266.05146653514754,landmark,True | ||
| 34 | −2951939904,10.4230/lipics.wabi.2019.10,,Jointly Embedding Multiple Single-Cell Omics Measurements,Leibniz international proceedings in informatics,2019,conference-paper,computational_biology,2,718.0,965.0,260.53544494720967,1141,577.848,True,True,baseline,260.53544494720967,landmark,True | 34 | +2951939904,10.4230/lipics.wabi.2019.10,,Jointly Embedding Multiple Single-Cell Omics Measurements,Leibniz international proceedings in informatics,2019,conference-paper,computational_biology,2,718.0,965.0,260.53544494720967,1141,577.848,True,True,baseline,jointlyembeddingmultiplesinglecellomicsmeasurements,260.53544494720967,landmark,True | ||
| 35 | −4409229284,10.1093/bioinformatics/btaf147,,CoverM: read alignment statistics for metagenomics,Bioinformatics,2025,article,computational_biology,2,511.0,511.0,110.40243438569799,511,130.364,True,True,post,258.6982748412114,landmark,True | 35 | +3156458251,10.1093/nar/gkab301,,Interactive Tree Of Life (iTOL) v5: an online tool for phylogenetic tree display and annotation,Nucleic Acids Research,2021,article,computational_biology,2,1857.0,4291.0,249.05241916110123,11124,520.9954,True,True,baseline,interactivetreeoflifeitolv5anonlinetoolforphylogenetictreedisplayandannotation,249.05241916110123,landmark,True | ||
| 36 | −4406633314,10.1038/s41591-024-03434-4,,Artificial intelligence in drug development,Nature Medicine,2025,article,computational_biology,1,498.0,498.0,209.201336966164,498,241.4884,False,False,post,252.1169097278342,landmark,True | 36 | +4409229284,10.1093/bioinformatics/btaf147,,CoverM: read alignment statistics for metagenomics,Bioinformatics,2025,article,computational_biology,2,511.0,511.0,110.40243438569799,511,130.364,True,True,post,covermreadalignmentstatisticsformetagenomics,223.29247107362977,landmark,True | ||
| 37 | −4323304388,10.26434/chemrxiv-2022-jjm0j-v4,,Uni-Mol: A Universal 3D Molecular Representation Learning Framework,ChemRxiv,2023,preprint,computational_biology,2,71.0,196.0,249.05517241379312,324,,True,True,post,249.05517241379312,landmark,True | 37 | +4393936599,10.1093/nar/gkae236,,"ADMETlab 3.0: an updated comprehensive online ADMET prediction platform enhanced with broader coverage, improved performance, API functionality and decision support",Nucleic Acids Research,2024,article,computational_biology,1,627.0,1260.0,209.38466448112797,1260,247.0103,True,True,post,admetlab30anupdatedcomprehensiveonlineadmetpredictionplatformenhancedwithbroadercoverageimprovedperformanceapifunctionalityanddecisionsupport,209.38466448112797,landmark,True | ||
| 38 | −3156458251,10.1093/nar/gkab301,,Interactive Tree Of Life (iTOL) v5: an online tool for phylogenetic tree display and annotation,Nucleic Acids Research,2021,article,computational_biology,2,1857.0,4291.0,249.05241916110123,11124,520.9954,True,True,baseline,249.05241916110123,landmark,True | 38 | +3168436232,10.1021/acs.jcim.1c00203,,"AutoDock Vina 1.2.0: New Docking Methods, Expanded Force Field, and Python Bindings",Journal of Chemical Information and Modeling,2021,article,computational_biology,2,340.0,1300.0,209.2664690527806,7546,373.4067,True,True,baseline,autodockvina120newdockingmethodsexpandedforcefieldandpythonbindings,209.2664690527806,landmark,True | ||
| 39 | −4307468223,10.1093/nar/gkac956,,PubChem 2023 update,Nucleic Acids Research,2022,article,computational_biology,1,388.0,1481.0,240.13678570600197,3385,333.84,True,True,baseline,240.13678570600197,landmark,True | 39 | +2899070097,10.1093/nar/gky1033,,PubChem 2019 update: improved access to chemical data,Nucleic Acids Research,2018,article,computational_biology,1,200.0,819.0,194.80273384490118,3238,270.9191,True,True,baseline,pubchem2019updateimprovedaccesstochemicaldata,194.80273384490118,landmark,True | ||
| 40 | −7119529911,10.1126/science.ads9530,,Deep contrastive learning enables genome-wide virtual screening,Science,2026,article,computational_biology,3,62.0,62.0,175.0637411130179,62,220.9602,True,True,post,220.42367591809082,landmark,True | 40 | +3011072970,10.1038/s41421-020-0153-3,,Network-based drug repurposing for novel coronavirus 2019-nCoV/SARS-CoV-2,Cell Discovery,2020,article,computational_biology,1,1057.0,1266.0,186.408931286412,1597,164.9683,True,True,baseline,networkbaseddrugrepurposingfornovelcoronavirus2019ncovsarscov2,186.408931286412,landmark,True | ||
| 41 | −4393936599,10.1093/nar/gkae236,,"ADMETlab 3.0: an updated comprehensive online ADMET prediction platform enhanced with broader coverage, improved performance, API functionality and decision support",Nucleic Acids Research,2024,article,computational_biology,1,627.0,1260.0,209.38466448112797,1260,247.0103,True,True,post,209.38466448112797,landmark,True | 41 | +3211795435,10.1093/nar/gkab1061,,AlphaFold Protein Structure Database: massively expanding the structural coverage of protein-sequence space with high-accuracy models,Nucleic Acids Research,2021,article,computational_biology,3,944.0,3084.0,178.99735742084275,7770,355.1571,True,True,baseline,alphafoldproteinstructuredatabasemassivelyexpandingthestructuralcoverageofproteinsequencespacewithhighaccuracymodels,178.99735742084275,landmark,True | ||
| 42 | −3168436232,10.1021/acs.jcim.1c00203,,"AutoDock Vina 1.2.0: New Docking Methods, Expanded Force Field, and Python Bindings",Journal of Chemical Information and Modeling,2021,article,computational_biology,2,340.0,1300.0,209.2664690527806,7546,373.4067,True,True,baseline,209.2664690527806,landmark,True | 42 | +3098269892,10.17863/cam.34134,,Automatic Chemical Design Using a Data-Driven Continuous Representation of Molecules.,Cambridge University Engineering Department Publications Database,2018,article,computational_biology,3,417.0,752.0,178.86649066100819,1703,200.0824,True,True,baseline,automaticchemicaldesignusingadatadrivencontinuousrepresentationofmolecules,178.86649066100819,landmark,True | ||
| 43 | −2899070097,10.1093/nar/gky1033,,PubChem 2019 update: improved access to chemical data,Nucleic Acids Research,2018,article,computational_biology,1,200.0,819.0,194.80273384490118,3238,270.9191,True,True,baseline,194.80273384490118,landmark,True | 43 | +4307425304,10.1093/nar/gkac963,,KEGG for taxonomy-based analysis of pathways and genomes,Nucleic Acids Research,2022,article,computational_biology,1,1600.0,3498.0,177.7903434574516,5752,391.9436,True,True,baseline,keggfortaxonomybasedanalysisofpathwaysandgenomes,177.7903434574516,landmark,True | ||
| 44 | −3011072970,10.1038/s41421-020-0153-3,,Network-based drug repurposing for novel coronavirus 2019-nCoV/SARS-CoV-2,Cell Discovery,2020,article,computational_biology,1,1057.0,1266.0,186.408931286412,1597,164.9683,True,True,baseline,186.408931286412,landmark,True | 44 | +4400581728,10.1021/acs.jmedchem.4c01122,,An Update on the Nitrogen Heterocycle Compositions and Properties of U.S. FDA-Approved Pharmaceuticals (2013–2023),Journal of Medicinal Chemistry,2024,article,computational_biology,2,536.0,1064.0,176.8137166729525,1064,208.5864,True,False,post,anupdateonthenitrogenheterocyclecompositionsandpropertiesofusfdaapprovedpharmaceuticals20132023,176.8137166729525,landmark,True | ||
| 45 | −3211795435,10.1093/nar/gkab1061,,AlphaFold Protein Structure Database: massively expanding the structural coverage of protein-sequence space with high-accuracy models,Nucleic Acids Research,2021,article,computational_biology,3,944.0,3084.0,178.99735742084275,7770,355.1571,True,True,baseline,178.99735742084275,landmark,True | 45 | +4388522045,10.1371/journal.pone.0294236,,SRplot: A free online platform for data visualization and graphing,PLoS ONE,2023,article,computational_biology,2,537.0,1676.0,174.5922042929299,2536,232.667,True,True,post,srplotafreeonlineplatformfordatavisualizationandgraphing,174.5922042929299,landmark,True | ||
| 46 | −3098269892,10.17863/cam.34134,,Automatic Chemical Design Using a Data-Driven Continuous Representation of Molecules.,Cambridge University Engineering Department Publications Database,2018,article,computational_biology,3,417.0,752.0,178.86649066100819,1703,200.0824,True,True,baseline,178.86649066100819,landmark,True | 46 | +4388615774,10.1093/nar/gkad976,,DrugBank 6.0: the DrugBank Knowledgebase for 2024,Nucleic Acids Research,2023,article,computational_biology,2,254.0,1086.0,165.7163852004641,1727,228.2125,True,True,post,drugbank60thedrugbankknowledgebasefor2024,165.7163852004641,landmark,True | ||
| 47 | −4307425304,10.1093/nar/gkac963,,KEGG for taxonomy-based analysis of pathways and genomes,Nucleic Acids Research,2022,article,computational_biology,1,1600.0,3498.0,177.7903434574516,5752,391.9436,True,True,baseline,177.7903434574516,landmark,True | 47 | +4309506674,10.1093/nar/gkac1052,,UniProt: the Universal Protein Knowledgebase in 2023,Nucleic Acids Research,2022,article,computational_biology,1,932.0,3250.0,165.18542488185184,6940,383.312,True,True,baseline,uniprottheuniversalproteinknowledgebasein2023,165.18542488185184,landmark,True | ||
| 48 | −7118182048,10.1038/s41591-025-04060-4,,AI-enabled virtual spatial proteomics from histopathology for interpretable biomarker discovery in lung cancer,Nature Medicine,2026,article,computational_biology,2,50.0,50.0,55.6400765943535,50,180.6309,True,True,post,177.76102896620228,landmark,True | 48 | +4220831425,10.1093/nar/gkac194,,DAVID: a web server for functional enrichment analysis and functional annotation of gene lists (2021 update),Nucleic Acids Research,2022,article,computational_biology,1,1461.0,3170.0,161.11932211552934,6142,356.4505,True,True,baseline,davidawebserverforfunctionalenrichmentanalysisandfunctionalannotationofgenelists2021update,161.11932211552934,landmark,True | ||
| 49 | −4400581728,10.1021/acs.jmedchem.4c01122,,An Update on the Nitrogen Heterocycle Compositions and Properties of U.S. FDA-Approved Pharmaceuticals (2013–2023),Journal of Medicinal Chemistry,2024,article,computational_biology,2,536.0,1064.0,176.8137166729525,1064,208.5864,True,False,post,176.8137166729525,landmark,True | 49 | +7119529911,10.1126/science.ads9530,,Deep contrastive learning enables genome-wide virtual screening,Science,2026,article,computational_biology,3,62.0,62.0,175.0637411130179,62,220.9602,True,True,post,deepcontrastivelearningenablesgenomewidevirtualscreening,157.19916555583544,landmark,True | ||
| 50 | −4388522045,10.1371/journal.pone.0294236,,SRplot: A free online platform for data visualization and graphing,PLoS ONE,2023,article,computational_biology,2,537.0,1676.0,174.5922042929299,2536,232.667,True,True,post,174.5922042929299,landmark,True | 50 | +4302307901,10.48550/arxiv.2210.01776,2210.01776,"DiffDock: Diffusion Steps, Twists, and Turns for Molecular Docking",arXiv (Cornell University),2022,preprint,computational_biology,3,61.0,159.0,155.85750717245776,339,,True,True,baseline,diffdockdiffusionstepstwistsandturnsformoleculardocking,155.85750717245776,landmark,True | ||
| 51 | −7139978436,10.1093/bioinformatics/btag129,,Whole-genome prediction of bacterial pathogenic capacity on novel bacteria using protein language models with PathogenFinder2,Bioinformatics,2026,article,computational_biology,2,48.0,48.0,64.58550316678397,48,73.0121,True,True,post,170.6505878075542,landmark,True | 51 | +2927961455,10.1093/nar/gkz239,,Interactive Tree Of Life (iTOL) v4: recent updates and new developments,Nucleic Acids Research,2019,article,computational_biology,3,1166.0,2754.0,153.24396298061907,5925,277.073,True,True,baseline,interactivetreeoflifeitolv4recentupdatesandnewdevelopments,153.24396298061907,landmark,True | ||
| 52 | −7140287209,10.1038/s41586-026-10265-5,,Towards end-to-end automation of AI research,Nature,2026,article,autonomous_scientific_discovery,4,94.0,94.0,104.60334399738458,94,335.9735,True,True,post,334.1907344564603,landmark,True | 52 | +7140287209,10.1038/s41586-026-10265-5,,Towards end-to-end automation of AI research,Nature,2026,article,autonomous_scientific_discovery,4,94.0,94.0,104.60334399738458,94,335.9735,True,True,post,towardsendtoendautomationofairesearch,238.33421874594404,landmark,True | ||
| 53 | −7125546963,10.1016/j.addr.2026.115781,,Artificial intelligence and machine learning guided optimization in drug delivery,Advanced Drug Delivery Reviews,2026,review,autonomous_scientific_discovery,4,36.0,36.0,17.176470588235293,36,21.0789,True,True,post,127.98794085566564,landmark,True | 53 | +4385490607,10.1038/s41586-023-06221-2,,Scientific discovery in the age of artificial intelligence,Nature,2023,article,autonomous_scientific_discovery,1,578.0,1284.0,117.87734969257644,1779,156.2859,False,True,post,scientificdiscoveryintheageofartificialintelligence,117.87734969257644,landmark,True | ||
| 54 | −4385490607,10.1038/s41586-023-06221-2,,Scientific discovery in the age of artificial intelligence,Nature,2023,article,autonomous_scientific_discovery,1,578.0,1284.0,117.87734969257644,1779,156.2859,False,True,post,117.87734969257644,landmark,True | 54 | +3007309629,10.1016/j.cell.2020.01.021,,A Deep Learning Approach to Antibiotic Discovery,Cell,2020,article,autonomous_scientific_discovery,2,489.0,780.0,114.84910458404532,2361,125.0662,False,True,baseline,adeeplearningapproachtoantibioticdiscovery,114.84910458404532,landmark,True | ||
| 55 | −3007309629,10.1016/j.cell.2020.01.021,,A Deep Learning Approach to Antibiotic Discovery,Cell,2020,article,autonomous_scientific_discovery,2,489.0,780.0,114.84910458404532,2361,125.0662,False,True,baseline,114.84910458404532,landmark,True | 55 | +7125546963,10.1016/j.addr.2026.115781,,Artificial intelligence and machine learning guided optimization in drug delivery,Advanced Drug Delivery Reviews,2026,review,autonomous_scientific_discovery,4,36.0,36.0,17.176470588235293,36,21.0789,True,True,post,artificialintelligenceandmachinelearningguidedoptimizationindrugdelivery,91.27693483887218,landmark,True | ||
| 56 | −4406405186,10.1038/s42256-024-00956-x,,The design space of E(3)-equivariant atom-centred interatomic potentials,Nature Machine Intelligence,2025,article,autonomous_scientific_discovery,5,196.0,196.0,30.34398782343988,196,40.9323,True,True,post,99.22673555553315,landmark,True | 56 | +4406405186,10.1038/s42256-024-00956-x,,The design space of E(3)-equivariant atom-centred interatomic potentials,Nature Machine Intelligence,2025,article,autonomous_scientific_discovery,5,196.0,196.0,30.34398782343988,196,40.9323,True,True,post,thedesignspaceofe3equivariantatomcentredinteratomicpotentials,85.64642726111826,landmark,True | ||
| 57 | −4365512576,10.1016/j.iotcps.2023.04.003,,"ChatGPT: A comprehensive review on background, applications, key challenges, bias, ethics, limitations and future scope",Internet of Things and Cyber-Physical Systems,2023,article,autonomous_scientific_discovery,6,1309.0,2124.0,76.85650367529561,2423,590.6367,True,True,post,76.85650367529561,landmark,True | 57 | +4365512576,10.1016/j.iotcps.2023.04.003,,"ChatGPT: A comprehensive review on background, applications, key challenges, bias, ethics, limitations and future scope",Internet of Things and Cyber-Physical Systems,2023,article,autonomous_scientific_discovery,6,1309.0,2124.0,76.85650367529561,2423,590.6367,True,True,post,chatgptacomprehensivereviewonbackgroundapplicationskeychallengesbiasethicslimitationsandfuturescope,76.85650367529561,landmark,True | ||
| 58 | −4414990951,10.1016/j.matt.2026.102748,2508.13197,The rise of generative AI for metal-organic framework design and synthesis,Matter,2026,article,autonomous_scientific_discovery,3,21.0,21.0,16.40625,21,28.4842,True,True,post,74.65963216580496,landmark,True | 58 | +4406406714,10.1038/s42256-024-00972-x,,Battery lifetime prediction across diverse ageing conditions with inter-cell deep learning,Nature Machine Intelligence,2025,article,autonomous_scientific_discovery,1,140.0,140.0,25.71533113794365,140,34.876,True,True,post,batterylifetimepredictionacrossdiverseageingconditionswithintercelldeeplearning,61.17601947222733,landmark,True | ||
| 59 | −4406406714,10.1038/s42256-024-00972-x,,Battery lifetime prediction across diverse ageing conditions with inter-cell deep learning,Nature Machine Intelligence,2025,article,autonomous_scientific_discovery,1,140.0,140.0,25.71533113794365,140,34.876,True,True,post,70.87623968252367,landmark,True | 59 | +4396723768,10.1038/s42256-024-00832-8,,Augmenting large language models with chemistry tools,Nature Machine Intelligence,2024,article,autonomous_scientific_discovery,4,395.0,762.0,60.19669891861127,762,71.2953,True,True,post,augmentinglargelanguagemodelswithchemistrytools,60.19669891861127,landmark,True | ||
| 60 | −4396723768,10.1038/s42256-024-00832-8,,Augmenting large language models with chemistry tools,Nature Machine Intelligence,2024,article,autonomous_scientific_discovery,4,395.0,762.0,60.19669891861127,762,71.2953,True,True,post,60.19669891861127,landmark,True | 60 | +4319754774,10.1016/j.caeai.2023.100132,,Acceptance of artificial intelligence in teaching science: Science teachers' perspective,Computers and Education Artificial Intelligence,2023,article,autonomous_scientific_discovery,1,120.0,252.0,59.06269551273626,323,75.9012,True,True,post,acceptanceofartificialintelligenceinteachingsciencescienceteachersperspective,59.06269551273626,landmark,True | ||
| 61 | −4319754774,10.1016/j.caeai.2023.100132,,Acceptance of artificial intelligence in teaching science: Science teachers' perspective,Computers and Education Artificial Intelligence,2023,article,autonomous_scientific_discovery,1,120.0,252.0,59.06269551273626,323,75.9012,True,True,post,59.06269551273626,landmark,True | 61 | +4414990951,10.1016/j.matt.2026.102748,2508.13197,The rise of generative AI for metal-organic framework design and synthesis,Matter,2026,article,autonomous_scientific_discovery,3,21.0,21.0,16.40625,21,28.4842,True,True,post,theriseofgenerativeaiformetalorganicframeworkdesignandsynthesis,53.24487865600877,landmark,True | ||
| 62 | −4389991855,10.1038/s41586-023-06887-8,,Discovery of a structural class of antibiotics with explainable deep learning,Nature,2023,article,autonomous_scientific_discovery,2,136.0,330.0,50.355807657599584,458,60.2776,False,True,post,50.355807657599584,landmark,True | 62 | +4389991855,10.1038/s41586-023-06887-8,,Discovery of a structural class of antibiotics with explainable deep learning,Nature,2023,article,autonomous_scientific_discovery,2,136.0,330.0,50.355807657599584,458,60.2776,False,True,post,discoveryofastructuralclassofantibioticswithexplainabledeeplearning,50.355807657599584,landmark,True | ||
| 63 | −4409069046,10.1038/s42256-025-01009-7,2404.07181,A predictive machine learning force-field framework for liquid electrolyte development,Nature Machine Intelligence,2025,article,autonomous_scientific_discovery,2,95.0,95.0,14.707545118504024,95,19.6308,False,True,post,48.094591213141065,landmark,True | 63 | +4409069046,10.1038/s42256-025-01009-7,2404.07181,A predictive machine learning force-field framework for liquid electrolyte development,Nature Machine Intelligence,2025,article,autonomous_scientific_discovery,2,95.0,95.0,14.707545118504024,95,19.6308,False,True,post,apredictivemachinelearningforcefieldframeworkforliquidelectrolytedevelopment,41.51229892758283,landmark,True | ||
| 64 | −4400064820,10.1038/s43588-026-01045-2,2406.17295,Less can be more for predicting properties with large language models,Nature Computational Science,2026,article,autonomous_scientific_discovery,5,13.0,13.0,10.024647887323944,13,1.4032,True,True,post,46.2178675312126,landmark,True | 64 | +3210165781,10.1016/j.xinn.2021.100179,,Artificial intelligence: A powerful paradigm for scientific research,The Innovation,2021,article,autonomous_scientific_discovery,1,93.0,334.0,38.92516828044519,1702,74.7191,True,True,baseline,artificialintelligenceapowerfulparadigmforscientificresearch,38.92516828044519,landmark,True | ||
| 65 | −4407922392,10.1038/s42256-025-00994-z,,Large language models for scientific discovery in molecular property prediction,Nature Machine Intelligence,2025,article,autonomous_scientific_discovery,3,83.0,83.0,34.86688949436066,83,40.2481,False,True,post,42.01948495463904,landmark,True | 65 | +4390940921,10.1038/s41586-023-06747-5,,Solving olympiad geometry without human demonstrations,Nature,2024,article,autonomous_scientific_discovery,2,207.0,307.0,38.13184279381587,307,45.3903,True,True,post,solvingolympiadgeometrywithouthumandemonstrations,38.13184279381587,landmark,True | ||
| 66 | −4407041525,10.1088/0256-307x/42/2/027403,2411.09429,"AI-Driven Inverse Design of Materials: Past, Present, and Future",Chinese Physics Letters,2025,article,autonomous_scientific_discovery,3,78.0,78.0,12.07566862361383,78,16.2894,True,True,post,39.488190680263195,landmark,True | 66 | +4407922392,10.1038/s42256-025-00994-z,,Large language models for scientific discovery in molecular property prediction,Nature Machine Intelligence,2025,article,autonomous_scientific_discovery,3,83.0,83.0,34.86688949436066,83,40.2481,False,True,post,largelanguagemodelsforscientificdiscoveryinmolecularpropertyprediction,36.268640115677634,landmark,True | ||
| 67 | −7128476819,10.3389/frai.2026.1678539,,The future of fundamental science led by generative closed-loop artificial intelligence,Frontiers in Artificial Intelligence,2026,article,autonomous_scientific_discovery,4,11.0,11.0,12.24081685075777,11,32.5136,True,True,post,39.107426372564504,landmark,True | 67 | +4225106311,10.1038/s41586-022-04501-x,,FAIR data enabling new horizons for materials research,Nature,2022,article,autonomous_scientific_discovery,1,77.0,145.0,35.636787972031094,247,48.6434,True,True,baseline,fairdataenablingnewhorizonsformaterialsresearch,35.636787972031094,landmark,True | ||
| 68 | −4410552772,10.1021/acs.accounts.5c00155,,"ASKCOS: Open-Source, Data-Driven Synthesis Planning",Accounts of Chemical Research,2025,article,autonomous_scientific_discovery,4,77.0,77.0,32.34639145862375,77,37.3386,True,True,post,38.981931825388024,landmark,True | 68 | +4407041525,10.1088/0256-307x/42/2/027403,2411.09429,"AI-Driven Inverse Design of Materials: Past, Present, and Future",Chinese Physics Letters,2025,article,autonomous_scientific_discovery,3,78.0,78.0,12.07566862361383,78,16.2894,True,True,post,aidriveninversedesignofmaterialspastpresentandfuture,34.0837822773838,landmark,True | ||
| 69 | −3210165781,10.1016/j.xinn.2021.100179,,Artificial intelligence: A powerful paradigm for scientific research,The Innovation,2021,article,autonomous_scientific_discovery,1,93.0,334.0,38.92516828044519,1702,74.7191,True,True,baseline,38.92516828044519,landmark,True | 69 | +4410552772,10.1021/acs.accounts.5c00155,,"ASKCOS: Open-Source, Data-Driven Synthesis Planning",Accounts of Chemical Research,2025,article,autonomous_scientific_discovery,4,77.0,77.0,32.34639145862375,77,37.3386,True,True,post,askcosopensourcedatadrivensynthesisplanning,33.64681070972503,landmark,True | ||
| 70 | −4407002549,10.3389/frai.2025.1518049,,"Benefits, limits, and risks of ChatGPT in medicine",Frontiers in Artificial Intelligence,2025,article,autonomous_scientific_discovery,4,76.0,76.0,5.054948135688253,76,15.5609,True,True,post,38.47567297051285,landmark,True | 70 | +4407002549,10.3389/frai.2025.1518049,,"Benefits, limits, and risks of ChatGPT in medicine",Frontiers in Artificial Intelligence,2025,article,autonomous_scientific_discovery,4,76.0,76.0,5.054948135688253,76,15.5609,True,True,post,benefitslimitsandrisksofchatgptinmedicine,33.209839142066265,landmark,True | ||
| 71 | −4390940921,10.1038/s41586-023-06747-5,,Solving olympiad geometry without human demonstrations,Nature,2024,article,autonomous_scientific_discovery,2,207.0,307.0,38.13184279381587,307,45.3903,True,True,post,38.13184279381587,landmark,True | 71 | +4400064820,10.1038/s43588-026-01045-2,2406.17295,Less can be more for predicting properties with large language models,Nature Computational Science,2026,article,autonomous_scientific_discovery,5,13.0,13.0,10.024647887323944,13,1.4032,True,True,post,lesscanbemoreforpredictingpropertieswithlargelanguagemodels,32.96111535848162,landmark,True | ||
| 72 | −4225106311,10.1038/s41586-022-04501-x,,FAIR data enabling new horizons for materials research,Nature,2022,article,autonomous_scientific_discovery,1,77.0,145.0,35.636787972031094,247,48.6434,True,True,baseline,35.636787972031094,landmark,True | 72 | +4389991792,10.1038/s41586-023-06792-0,,Autonomous chemical research with large language models,Nature,2023,article,autonomous_scientific_discovery,4,189.0,590.0,32.419795221843,1012,71.2047,True,True,post,autonomouschemicalresearchwithlargelanguagemodels,32.419795221843,landmark,True | ||
| 73 | −4415202617,10.1016/j.matt.2026.102812,2503.08537,Chemical reasoning in LLMs unlocks strategy-aware synthesis planning and reaction mechanism elucidation,Matter,2026,article,autonomous_scientific_discovery,5,10.0,10.0,28.23608727629321,10,28.511,True,True,post,35.552205793240454,landmark,True | 73 | +4386740800,10.1038/s42256-023-00716-3,,CHGNet as a pretrained universal neural network potential for charge-informed atomistic modelling,Nature Machine Intelligence,2023,article,autonomous_scientific_discovery,5,176.0,566.0,31.101023890784983,916,64.5205,True,True,post,chgnetasapretraineduniversalneuralnetworkpotentialforchargeinformedatomisticmodelling,31.101023890784983,landmark,True | ||
| 74 | −4368755578,10.1007/s10994-025-06955-2,2305.02251,Automated Scientific Discovery: From Equation Discovery to Autonomous Discovery Systems,Machine Learning,2026,article,autonomous_scientific_discovery,4,10.0,10.0,7.711267605633803,10,9.8221,True,True,post,35.552205793240454,landmark,True | 74 | +4393097303,10.1038/s42256-024-00809-7,,Generative AI for designing and validating easily synthesizable and structurally novel antibiotics,Nature Machine Intelligence,2024,article,autonomous_scientific_discovery,3,113.0,184.0,30.576808146450436,184,36.0713,False,False,post,generativeaifordesigningandvalidatingeasilysynthesizableandstructurallynovelantibiotics,30.576808146450436,landmark,True | ||
| 75 | −4389991792,10.1038/s41586-023-06792-0,,Autonomous chemical research with large language models,Nature,2023,article,autonomous_scientific_discovery,4,189.0,590.0,32.419795221843,1012,71.2047,True,True,post,32.419795221843,landmark,True | 75 | +2769423117,10.1039/c8sc02339e,,“Found in Translation”: predicting outcomes of complex organic chemistry reactions using neural sequence-to-sequence models,Chemical Science,2018,article,autonomous_scientific_discovery,3,65.0,126.0,29.96965136075403,441,34.7969,True,True,baseline,foundintranslationpredictingoutcomesofcomplexorganicchemistryreactionsusingneuralsequencetosequencemodels,29.96965136075403,landmark,True | ||
| 76 | −4402696779,10.1145/3794853,2408.08044,Crystalline Material Discovery in the Era of Artificial Intelligence,ACM Computing Surveys,2026,article,autonomous_scientific_discovery,4,9.0,9.0,6.940140845070423,9,5.6126,True,True,post,31.99698521391641,landmark,True | 76 | +4391561379,10.1038/s42256-023-00788-1,,Leveraging large language models for predictive chemistry,Nature Machine Intelligence,2024,article,autonomous_scientific_discovery,6,257.0,367.0,28.992373363688102,367,34.6508,True,True,post,leveraginglargelanguagemodelsforpredictivechemistry,28.992373363688102,landmark,True | ||
| 77 | −4309506674,10.1093/nar/gkac1052,,UniProt: the Universal Protein Knowledgebase in 2023,Nucleic Acids Research,2022,article,computational_biology,1,932.0,3250.0,165.18542488185184,6940,383.312,True,True,baseline,165.18542488185184,landmark,True | 77 | +4308834893,10.1093/nar/gkac1000,,The STRING database in 2023: protein–protein association networks and functional enrichment analyses for any sequenced genome of interest,Nucleic Acids Research,2022,article,computational_biology,3,535.0,2781.0,141.34789741428614,9363,448.2907,True,True,baseline,thestringdatabasein2023proteinproteinassociationnetworksandfunctionalenrichmentanalysesforanysequencedgenomeofinterest,141.34789741428614,landmark,True | ||
| 78 | −4220831425,10.1093/nar/gkac194,,DAVID: a web server for functional enrichment analysis and functional annotation of gene lists (2021 update),Nucleic Acids Research,2022,article,computational_biology,1,1461.0,3170.0,161.11932211552934,6142,356.4505,True,True,baseline,161.11932211552934,landmark,True | 78 | +3112376646,10.1093/nar/gkaa1100,,UniProt: the universal protein knowledgebase in 2021,Nucleic Acids Research,2020,article,computational_biology,1,679.0,2641.0,150.5152761457109,6342,306.9602,True,True,baseline,uniprottheuniversalproteinknowledgebasein2021,150.5152761457109,landmark,True | ||
| 79 | −4308834893,10.1093/nar/gkac1000,,The STRING database in 2023: protein–protein association networks and functional enrichment analyses for any sequenced genome of interest,Nucleic Acids Research,2022,article,computational_biology,3,535.0,2781.0,141.34789741428614,9363,448.2907,True,True,baseline,141.34789741428614,landmark,True | 79 | +2900569176,10.1093/nar/gky1131,,"STRING v11: protein–protein association networks with increased coverage, supporting functional discovery in genome-wide experimental datasets",Nucleic Acids Research,2018,article,computational_biology,3,421.0,2624.0,131.1704666044956,17675,509.3871,True,True,baseline,stringv11proteinproteinassociationnetworkswithincreasedcoveragesupportingfunctionaldiscoveryingenomewideexperimentaldatasets,131.1704666044956,landmark,True | ||
| 80 | −2927961455,10.1093/nar/gkz239,,Interactive Tree Of Life (iTOL) v4: recent updates and new developments,Nucleic Acids Research,2019,article,computational_biology,3,1166.0,2754.0,153.24396298061907,5925,277.073,True,True,baseline,153.24396298061907,landmark,True | 80 | +2804822363,10.1093/nar/gky427,,SWISS-MODEL: homology modelling of protein structures and complexes,Nucleic Acids Research,2018,article,computational_biology,3,904.0,2454.0,122.67237997234459,13067,345.6079,True,True,baseline,swissmodelhomologymodellingofproteinstructuresandcomplexes,122.67237997234459,landmark,True | ||
| 81 | −3112376646,10.1093/nar/gkaa1100,,UniProt: the universal protein knowledgebase in 2021,Nucleic Acids Research,2020,article,computational_biology,1,679.0,2641.0,150.5152761457109,6342,306.9602,True,True,baseline,150.5152761457109,landmark,True | 81 | +3208691473,10.1093/nar/gkab1038,,The PRIDE database resources in 2022: a hub for mass spectrometry-based proteomics evidences,Nucleic Acids Research,2021,article,computational_biology,2,743.0,2312.0,100.20101036958255,6103,381.4154,True,True,baseline,thepridedatabaseresourcesin2022ahubformassspectrometrybasedproteomicsevidences,100.20101036958255,landmark,True | ||
| 82 | −2900569176,10.1093/nar/gky1131,,"STRING v11: protein–protein association networks with increased coverage, supporting functional discovery in genome-wide experimental datasets",Nucleic Acids Research,2018,article,computational_biology,3,421.0,2624.0,131.1704666044956,17675,509.3871,True,True,baseline,131.1704666044956,landmark,True | 82 | +2938574745,10.1093/nar/gkz268,,The EMBL-EBI search and sequence analysis tools APIs in 2019,Nucleic Acids Research,2019,article,computational_biology,2,1094.0,2262.0,149.0781904899552,4162,956.3441,True,True,baseline,theemblebisearchandsequenceanalysistoolsapisin2019,149.0781904899552,landmark,True | ||
| 83 | −2804822363,10.1093/nar/gky427,,SWISS-MODEL: homology modelling of protein structures and complexes,Nucleic Acids Research,2018,article,computational_biology,3,904.0,2454.0,122.67237997234459,13067,345.6079,True,True,baseline,122.67237997234459,landmark,True | 83 | +3136918052,10.1093/nar/gky1049,,UniProt: a worldwide hub of protein knowledge,Nucleic Acids Research,2018,article,computational_biology,1,457.0,2078.0,103.87661189182235,7679,309.1951,True,True,baseline,uniprotaworldwidehubofproteinknowledge,103.87661189182235,landmark,True | ||
| 84 | −3208691473,10.1093/nar/gkab1038,,The PRIDE database resources in 2022: a hub for mass spectrometry-based proteomics evidences,Nucleic Acids Research,2021,article,computational_biology,2,743.0,2312.0,100.20101036958255,6103,381.4154,True,True,baseline,100.20101036958255,landmark,True | 84 | +3107527779,10.1093/nar/gkaa1074,,"The STRING database in 2021: customizable protein–protein networks, and functional characterization of user-uploaded gene/measurement sets",Nucleic Acids Research,2020,article,computational_biology,4,246.0,2031.0,115.75029377203289,8015,303.9867,True,True,baseline,thestringdatabasein2021customizableproteinproteinnetworksandfunctionalcharacterizationofuseruploadedgenemeasurementsets,115.75029377203289,landmark,True | ||
| 85 | −2938574745,10.1093/nar/gkz268,,The EMBL-EBI search and sequence analysis tools APIs in 2019,Nucleic Acids Research,2019,article,computational_biology,2,1094.0,2262.0,149.0781904899552,4162,956.3441,True,True,baseline,149.0781904899552,landmark,True | 85 | +3159995035,10.1093/nar/gkab382,,MetaboAnalyst 5.0: narrowing the gap between raw spectra and functional insights,Nucleic Acids Research,2021,article,computational_biology,3,1102.0,2027.0,117.64839283140344,3958,207.4321,True,True,baseline,metaboanalyst50narrowingthegapbetweenrawspectraandfunctionalinsights,117.64839283140344,landmark,True | ||
| 86 | −3136918052,10.1093/nar/gky1049,,UniProt: a worldwide hub of protein knowledge,Nucleic Acids Research,2018,article,computational_biology,1,457.0,2078.0,103.87661189182235,7679,309.1951,True,True,baseline,103.87661189182235,landmark,True | 86 | +3095583226,10.1093/nar/gkaa913,,Pfam: The protein families database in 2021,Nucleic Acids Research,2020,article,computational_biology,1,792.0,1991.0,113.47062279670975,7261,214.3673,True,True,baseline,pfamtheproteinfamiliesdatabasein2021,113.47062279670975,landmark,True | ||
| 87 | −3107527779,10.1093/nar/gkaa1074,,"The STRING database in 2021: customizable protein–protein networks, and functional characterization of user-uploaded gene/measurement sets",Nucleic Acids Research,2020,article,computational_biology,4,246.0,2031.0,115.75029377203289,8015,303.9867,True,True,baseline,115.75029377203289,landmark,True | 87 | +3096828292,10.1093/nar/gkaa970,,KEGG: integrating viruses and cellular organisms,Nucleic Acids Research,2020,article,computational_biology,1,541.0,1955.0,111.4189189189189,4022,222.942,True,True,baseline,keggintegratingvirusesandcellularorganisms,111.4189189189189,landmark,True | ||
| 88 | −3159995035,10.1093/nar/gkab382,,MetaboAnalyst 5.0: narrowing the gap between raw spectra and functional insights,Nucleic Acids Research,2021,article,computational_biology,3,1102.0,2027.0,117.64839283140344,3958,207.4321,True,True,baseline,117.64839283140344,landmark,True | 88 | +2899760200,10.1093/nar/gky1106,,The PRIDE database and related tools and resources in 2019: improving support for quantification data,Nucleic Acids Research,2018,article,computational_biology,3,507.0,1805.0,74.32352941176471,6693,384.4369,True,True,baseline,thepridedatabaseandrelatedtoolsandresourcesin2019improvingsupportforquantificationdata,74.32352941176471,landmark,True | ||
| 89 | −3095583226,10.1093/nar/gkaa913,,Pfam: The protein families database in 2021,Nucleic Acids Research,2020,article,computational_biology,1,792.0,1991.0,113.47062279670975,7261,214.3673,True,True,baseline,113.47062279670975,landmark,True | 89 | +4223552703,10.1093/nar/gkac240,,Search and sequence analysis tools services from EMBL-EBI in 2022,Nucleic Acids Research,2022,article,computational_biology,2,862.0,1760.0,89.45426085909514,2267,150.397,True,True,baseline,searchandsequenceanalysistoolsservicesfromemblebiin2022,89.45426085909514,landmark,True | ||
| 90 | −3096828292,10.1093/nar/gkaa970,,KEGG: integrating viruses and cellular organisms,Nucleic Acids Research,2020,article,computational_biology,1,541.0,1955.0,111.4189189189189,4022,222.942,True,True,baseline,111.4189189189189,landmark,True | 90 | +4368358469,10.1093/nar/gkad344,,"antiSMASH 7.0: new and improved predictions for detection, regulation, chemical structures and visualisation",Nucleic Acids Research,2023,article,computational_biology,1,830.0,1741.0,32.99382988100485,2290,294.6456,True,True,post,antismash70newandimprovedpredictionsfordetectionregulationchemicalstructuresandvisualisation,32.99382988100485,landmark,True | ||
| 91 | −2899760200,10.1093/nar/gky1106,,The PRIDE database and related tools and resources in 2019: improving support for quantification data,Nucleic Acids Research,2018,article,computational_biology,3,507.0,1805.0,74.32352941176471,6693,384.4369,True,True,baseline,74.32352941176471,landmark,True | 91 | +3027286012,10.1093/nar/gkaa407,,TIMER2.0 for analysis of tumor-infiltrating immune cells,Nucleic Acids Research,2020,article,computational_biology,2,587.0,1720.0,57.035267668961644,5209,230.0925,True,True,baseline,timer20foranalysisoftumorinfiltratingimmunecells,57.035267668961644,landmark,True | ||
| 92 | −4223552703,10.1093/nar/gkac240,,Search and sequence analysis tools services from EMBL-EBI in 2022,Nucleic Acids Research,2022,article,computational_biology,2,862.0,1760.0,89.45426085909514,2267,150.397,True,True,baseline,89.45426085909514,landmark,True | 92 | +2999044305,10.1038/s41586-019-1923-7,,Improved protein structure prediction using potentials from deep learning,Nature,2020,article,computational_biology,1,1072.0,1692.0,96.4300822561692,3363,151.7168,False,True,baseline,improvedproteinstructurepredictionusingpotentialsfromdeeplearning,96.4300822561692,landmark,True | ||
| 93 | −4368358469,10.1093/nar/gkad344,,"antiSMASH 7.0: new and improved predictions for detection, regulation, chemical structures and visualisation",Nucleic Acids Research,2023,article,computational_biology,1,830.0,1741.0,32.99382988100485,2290,294.6456,True,True,post,32.99382988100485,landmark,True | 93 | +2803664483,10.1093/nar/gky310,,MetaboAnalyst 4.0: towards more transparent and integrative metabolomics analysis,Nucleic Acids Research,2018,article,computational_biology,4,660.0,1555.0,77.73249831173425,3629,185.9094,True,True,baseline,metaboanalyst40towardsmoretransparentandintegrativemetabolomicsanalysis,77.73249831173425,landmark,True | ||
| 94 | −3027286012,10.1093/nar/gkaa407,,TIMER2.0 for analysis of tumor-infiltrating immune cells,Nucleic Acids Research,2020,article,computational_biology,2,587.0,1720.0,57.035267668961644,5209,230.0925,True,True,baseline,57.035267668961644,landmark,True | 94 | +2942829220,10.1093/nar/gkz310,,antiSMASH 5.0: updates to the secondary metabolite genome mining pipeline,Nucleic Acids Research,2019,article,computational_biology,2,661.0,1520.0,18.891765924391507,2907,264.3601,True,True,baseline,antismash50updatestothesecondarymetabolitegenomeminingpipeline,18.891765924391507,landmark,True | ||
| 95 | −2999044305,10.1038/s41586-019-1923-7,,Improved protein structure prediction using potentials from deep learning,Nature,2020,article,computational_biology,1,1072.0,1692.0,96.4300822561692,3363,151.7168,False,True,baseline,96.4300822561692,landmark,True | 95 | +4384652177,10.1186/s12859-023-05385-y,,MitoHiFi: a python pipeline for mitochondrial genome assembly from PacBio high fidelity reads,BMC Bioinformatics,2023,article,computational_biology,5,839.0,1444.0,100.66579880594335,1858,138.9013,True,True,post,mitohifiapythonpipelineformitochondrialgenomeassemblyfrompacbiohighfidelityreads,100.66579880594335,landmark,True | ||
| 96 | −2803664483,10.1093/nar/gky310,,MetaboAnalyst 4.0: towards more transparent and integrative metabolomics analysis,Nucleic Acids Research,2018,article,computational_biology,4,660.0,1555.0,77.73249831173425,3629,185.9094,True,True,baseline,77.73249831173425,landmark,True | 96 | +2898402099,10.1093/nar/gky995,,The Pfam protein families database in 2019,Nucleic Acids Research,2018,article,computational_biology,2,366.0,1396.0,69.7842878734283,4595,208.2751,True,True,baseline,thepfamproteinfamiliesdatabasein2019,69.7842878734283,landmark,True | ||
| 97 | −2942829220,10.1093/nar/gkz310,,antiSMASH 5.0: updates to the secondary metabolite genome mining pipeline,Nucleic Acids Research,2019,article,computational_biology,2,661.0,1520.0,18.891765924391507,2907,264.3601,True,True,baseline,18.891765924391507,landmark,True | 97 | +3161596995,10.1093/nar/gkab335,,antiSMASH 6.0: improving cluster detection and comparison capabilities,Nucleic Acids Research,2021,article,computational_biology,1,649.0,1396.0,21.18855808523059,2562,230.4087,True,True,baseline,antismash60improvingclusterdetectionandcomparisoncapabilities,21.18855808523059,landmark,True | ||
| 98 | −4384652177,10.1186/s12859-023-05385-y,,MitoHiFi: a python pipeline for mitochondrial genome assembly from PacBio high fidelity reads,BMC Bioinformatics,2023,article,computational_biology,5,839.0,1444.0,100.66579880594335,1858,138.9013,True,True,post,100.66579880594335,landmark,True | 98 | +2789843538,10.1093/bioinformatics/bty191,,Minimap2: pairwise alignment for nucleotide sequences,Bioinformatics,2018,article,computational_biology,4,450.0,1291.0,64.53546965945267,15142,230.1698,True,True,baseline,minimap2pairwisealignmentfornucleotidesequences,64.53546965945267,landmark,True | ||
| 99 | −2898402099,10.1093/nar/gky995,,The Pfam protein families database in 2019,Nucleic Acids Research,2018,article,computational_biology,2,366.0,1396.0,69.7842878734283,4595,208.2751,True,True,baseline,69.7842878734283,landmark,True | ||||
| 100 | −3161596995,10.1093/nar/gkab335,,antiSMASH 6.0: improving cluster detection and comparison capabilities,Nucleic Acids Research,2021,article,computational_biology,1,649.0,1396.0,21.18855808523059,2562,230.4087,True,True,baseline,21.18855808523059,landmark,True | ||||
| 101 | −4308616064,10.1093/nar/gkac993,,InterPro in 2022,Nucleic Acids Research,2022,article,computational_biology,2,418.0,1388.0,70.5468829956955,2399,150.466,True,True,baseline,70.5468829956955,landmark,True | ||||
modified
literature_synthesis/landmarks/data_distributed_abstracts.jsonl
+88 −89
@@ -1,78 +1,54 @@ | |||||
| 1 | −{"work_id": 7160863705, "title": "Multi-Objective Scheduling for Large Language Model Inference with Prompt-Level Cost Prediction and SLO Awareness", "abstract": "Large language model (LLM) inference in multi-tenant clouds is becoming an increasingly important contributor to data-center carbon emissions, yet existing carbon-aware scheduling techniques target long-running training jobs and are ill-suited for the short, bursty, SLO-sensitive nature of online serving. We propose CAPS (Carbon\u2013Aware Prompt Scheduling), an online bi-objective scheduler that jointly optimizes goodput and per-request carbon cost for multi-tenant LLM inference. CAPS first employs a lightweight prompt complexity predictor to estimate token generation cost and latency risk for each incoming request. It then combines real-time grid carbon intensity, GPU energy profiles, and per-tenant SLO tiers to route each request to one of three execution pools: a low-latency pool, a low-carbon pool, or a delay-tolerant batch pool. A composite reward function balances goodput, carbon emissions, and SLO violation rate. In trace-driven simulations using public conversation traces and regional carbon intensity data, CAPS reduces average carbon emissions per 1K generated tokens by 26.8% compared to round-robin scheduling while achieving an SLO attainment rate that matches or exceeds a dedicated SLO-aware baseline."} | 1 | +{"work_id": 153405511, "title": "An Analysis of the MOS under Conditions of Delay, Jitter and Packet Loss and an Analysis of the Impact of Introducing Piggybacking and Reed Solomon FEC for VOIP", "abstract": "Voice over IP (VoIP) is a real time application that allows transmitting voice through the Internet network. Recently there has been amazing progress in this field, mainly due to the development of voice codecs that react appropriately under conditions of packet loss, and the improvement of intelligent jitter buffers that perform better under conditions of variable inter packet delay. In addition, there are other factors that indirectly benefited VoIP. Today, computer networks are faster due to the advances in hardware and breakthrough algorithms. As a result, the quality of VoIP calls has improved considerably. However, the quality of VoIP calls under extreme conditions of packet loss still remains a major problem that needs to be addressed for the next generation of VoIP services. This thesis concentrates in making an analysis of the effects that network impairments, such as: delay, jitter, and packet loss have in the quality of VoIP calls and approaches to solve this problem. Finally, we analyze the impact of introducing forward error correction (FEC) Piggybacking and Reed Solomon codes for VoIP. To measure the mean opinion score of VoIP calls we develop an application based on the E-Model, and utilize perceptual evaluation of speech quality (PESQ)."} | ||
| 2 | +{"work_id": 7161556515, "title": "DeepServeCB: SLO-Aware and Cost-Aware Elastic Scheduling for Serverless Multi-Tenant LLM Inference", "abstract": "Deploying large language model (LLM) inference services in serverless, multi-tenant environments present compounding challenges: cold start latency, GPU memory fragmentation, inter-tenant resource contention, and unpredictable tail latency. Existing systems optimize individual aspects but fail to jointly address service-level objective (SLO) compliance and cost efficiency under dynamic, heterogeneous workloads. We present DeepServeCB, an elastic scheduling framework that formulates the joint SLO--cost optimization as a contextual bandit problem. The system introduces a Request Profiler that extracts online features---prompt length, historical KV-cache hit ratio, and predicted generation length---and feeds them into a contextual bandit agent that adaptively selects batch sizes, concurrency levels, KV-cache eviction policies, and warm-standby strategies. We evaluate DeepServeCB on ShareGPT and BurstGPT traces using LLaMA-2-13B and Mixtral-8x7B models on NVIDIA A100 GPUs. Results show that DeepServeCB reduces P99 latency by 38--62% compared to state-of-the-art baselines while improving GPU utilization by 14--23% and reducing per-request cost by up to 27%, with only a modest increase in scheduling overhead."} | ||||
| 3 | +{"work_id": 4395047770, "title": "Deep reinforcement learning-based methods for resource scheduling in cloud computing: a review and future directions", "abstract": "Abstract With the acceleration of the Internet in Web 2.0, Cloud computing is a new paradigm to offer dynamic, reliable and elastic computing services. Efficient scheduling of resources or optimal allocation of requests is one of the prominent issues in emerging Cloud computing. Considering the growing complexity of Cloud computing, future Cloud systems will require more effective resource management methods. In some complex scenarios with difficulties in directly evaluating the performance of scheduling solutions, classic algorithms (such as heuristics and meta-heuristics) will fail to obtain an effective scheme. Deep reinforcement learning (DRL) is a novel method to solve scheduling problems. Due to the combination of deep learning and reinforcement learning (RL), DRL has achieved considerable performance in current studies. To focus on this direction and analyze the application prospect of DRL in Cloud scheduling, we provide a comprehensive review for DRL-based methods in resource scheduling of Cloud computing. Through the theoretical formulation of scheduling and analysis of RL frameworks, we discuss the advantages of DRL-based methods in Cloud scheduling. We also highlight different challenges and discuss the future directions existing in the DRL-based Cloud scheduling."} | ||||
| 4 | +{"work_id": 4407389811, "title": "Integrating Artificial Intelligence Agents with the Internet of Things for Enhanced Environmental Monitoring: Applications in Water Quality and Climate Data", "abstract": "The integration of artificial intelligence (AI) agents with the Internet of Things (IoT) has marked a transformative shift in environmental monitoring and management, enabling advanced data gathering, in-depth analysis, and more effective decision making. This comprehensive literature review explores the integration of AI and IoT technologies within environmental sciences, with a particular focus on applications related to water quality and climate data. The methodology involves a systematic search and selection of relevant studies, followed by thematic, meta-, and comparative analyses to synthesize current research trends, benefits, challenges, and gaps. The review highlights how AI enhances IoT\u2019s data collection capabilities through advanced predictive modeling, real-time analytics, and automated decision making, thereby improving the accuracy, timeliness, and efficiency of environmental monitoring systems. Key benefits identified include enhanced data precision, cost efficiency, scalability, and the facilitation of proactive environmental management. Nevertheless, this integration encounters substantial obstacles, including issues related to data quality, interoperability, security, technical constraints, and ethical concerns. Future developments point toward enhancements in AI and IoT technologies, the incorporation of innovations like blockchain and edge computing, the potential formation of global environmental monitoring systems, and greater public involvement through citizen science initiatives. Overcoming these challenges and embracing new technological trends could enable AI and IoT to play a pivotal role in strengthening environmental sustainability and resilience."} | ||||
| 5 | +{"work_id": 2772457693, "title": "Deep Learning for IoT Big Data and Streaming Analytics: A Survey", "abstract": "In the era of the Internet of Things (IoT), an enormous amount of sensing devices collect and/or generate various sensory data over time for a wide range of fields and applications. Based on the nature of the application, these devices will result in big or fast/real-time data streams. Applying analytics over such data streams to discover new information, predict future insights, and make control decisions is a crucial process that makes IoT a worthy paradigm for businesses and a quality-of-life improving technology. In this paper, we provide a thorough overview on using a class of advanced machine learning techniques, namely deep learning (DL), to facilitate the analytics and learning in the IoT domain. We start by articulating IoT data characteristics and identifying two major treatments for IoT data from a machine learning perspective, namely IoT big data analytics and IoT streaming data analytics. We also discuss why DL is a promising approach to achieve the desired analytics in these types of data and applications. The potential of using emerging DL techniques for IoT data analytics are then discussed, and its promises and challenges are introduced. We present a comprehensive background on different DL architectures and algorithms. We also analyze and summarize major reported research attempts that leveraged DL in the IoT domain. The smart IoT devices that have incorporated DL in their intelligence background are also discussed. DL implementation approaches on the fog and cloud centers in support of IoT applications are also surveyed. Finally, we shed light on some challenges and potential directions for future research. At the end of each section, we highlight the lessons learned based on our experiments and review of the recent literature."} | ||||
| 6 | +{"work_id": 7127083419, "title": "From Large AI Models to Agentic AI: A Tutorial on Future Intelligent Communications", "abstract": "With the advent of 6G communications, intelligent communication systems face multiple challenges, including constrained perception and response capabilities, limited scalability, and low adaptability in dynamic environments. To address these challenges, this tutorial provides a systematic and comprehensive introduction to the principles, design, and applications of Large Artificial Intelligence Models (LAMs) and Agentic AI technologies in intelligent communication systems, aiming to offer researchers an integrated overview of cutting-edge methodologies and practical insights. First, the tutorial outlines the background of 6G communications and reviews the technological evolution from LAMs to Agentic AI. It then systematically examines the key components required for constructing LAMs, classifies various types of LAMs, and analyzes their applicability in communication. A LAM-centric design paradigm tailored for communication systems is subsequently proposed, encompassing dataset construction, internal learning, and external learning approaches. Building upon this foundation, the tutorial develops an LAM-based Agentic AI system for intelligent communications, elaborating on its core components\u2014including agents, world models, planners, knowledge bases, tools, and memory modules\u2014 as well as their interaction mechanisms. Finally, it provides an in-depth review of representative applications of LAMs and Agentic AI in communication scenarios, and summarizes the current research challenges and future directions, with the goal of fostering the development of efficient, secure, and sustainable next-generation intelligent communication systems."} | ||||
| 7 | +{"work_id": 4386961654, "title": "Exploring the Full Potentials of IoT for Better Financial Growth and Stability: A Comprehensive Survey", "abstract": "Cutting-edge technologies, with a special emphasis on the Internet of Things (IoT), tend to operate as game changers, generating enormous alterations in both traditional and modern enterprises. Understanding multiple uses of IoT has become vital for effective financial management, given the ever-changing nature of organizations and the technological disruptions that come with this paradigm change. IoT has proven to be a powerful tool for improving operational efficiency, decision-making processes, overall productivity, and data management. As a result of the continuously expanding data volume, there is an increasing demand for a robust IT system capable of adeptly handling all enterprise processes. Consequently, businesses must develop suitable IoT architectures that can efficiently address these continually evolving requirements. This research adopts an incremental explanatory approach, guided by the principles of the Preferred Reporting Items for Systematic Reviews and Meta-Analysis (PRISMA). A rigorous examination of 84 research papers has allowed us to delve deeply into the current landscape of IoT research. This research aims to provide a complete and cohesive overview of the existing body of knowledge on IoT. This is accomplished by combining a rigorous empirical approach to categorization with ideas from specialized literature in the IoT sector. This study actively contributes to the ongoing conversation around IoT by recognizing and critically examining current difficulties. This, consequently, opens new research possibilities and promotes future developments in this ever-changing sector."} | ||||
| 2 | {"work_id": 4408363154, "title": "From Sensors to Data Intelligence: Leveraging IoT, Cloud, and Edge Computing with AI", "abstract": "The exponential growth of connected devices and sensor networks has revolutionized data collection and monitoring across industries, from healthcare to smart cities. However, the true value of these systems lies not merely in gathering data but in transforming it into actionable intelligence. The integration of IoT, cloud computing, edge computing, and AI offers a robust pathway to achieve this transformation, enabling real-time decision-making and predictive insights. This paper explores innovative approaches to combine these technologies, emphasizing their role in enabling real-time decision-making, predictive analytics, and low-latency data processing. This work analyzes several integration approaches among IoT, cloud/edge computing, and AI through examples and applications, highlighting challenges and approaches to seamlessly integrate these techniques to achieve pervasive environmental intelligence. The findings contribute to advancing pervasive environmental intelligence, offering a roadmap for building smarter, more sustainable infrastructure."} | 8 | {"work_id": 4408363154, "title": "From Sensors to Data Intelligence: Leveraging IoT, Cloud, and Edge Computing with AI", "abstract": "The exponential growth of connected devices and sensor networks has revolutionized data collection and monitoring across industries, from healthcare to smart cities. However, the true value of these systems lies not merely in gathering data but in transforming it into actionable intelligence. The integration of IoT, cloud computing, edge computing, and AI offers a robust pathway to achieve this transformation, enabling real-time decision-making and predictive insights. This paper explores innovative approaches to combine these technologies, emphasizing their role in enabling real-time decision-making, predictive analytics, and low-latency data processing. This work analyzes several integration approaches among IoT, cloud/edge computing, and AI through examples and applications, highlighting challenges and approaches to seamlessly integrate these techniques to achieve pervasive environmental intelligence. The findings contribute to advancing pervasive environmental intelligence, offering a roadmap for building smarter, more sustainable infrastructure."} | ||
| 3 | {"work_id": 4402762189, "title": "Leveraging AI in E-Learning: Personalized Learning and Adaptive Assessment through Cognitive Neuropsychology\u2014A Systematic Analysis", "abstract": "This paper reviews the literature on integrating AI in e-learning, from the viewpoint of cognitive neuropsychology, for Personalized Learning (PL) and Adaptive Assessment (AA). This review follows the PRISMA systematic review methodology and synthesizes the results of 85 studies that were selected from an initial pool of 818 records across several databases. The results indicate that AI can improve students\u2019 performance, engagement, and motivation; at the same time, some challenges like bias and discrimination should be noted. The review covers the historic development of AI in education, its theoretical grounding, and its practical applications within PL and AA with high promise and ethical issues of AI-powered educational systems. Future directions are empirical validation of effectiveness and equity, development of algorithms that reduce bias, and exploration of ethical implications regarding data privacy. The review identifies the transformative potential of AI in developing personalized and adaptive learning (AL) environments, thus, it advocates continued development and exploration as a means to improve educational outcomes."} | 9 | {"work_id": 4402762189, "title": "Leveraging AI in E-Learning: Personalized Learning and Adaptive Assessment through Cognitive Neuropsychology\u2014A Systematic Analysis", "abstract": "This paper reviews the literature on integrating AI in e-learning, from the viewpoint of cognitive neuropsychology, for Personalized Learning (PL) and Adaptive Assessment (AA). This review follows the PRISMA systematic review methodology and synthesizes the results of 85 studies that were selected from an initial pool of 818 records across several databases. The results indicate that AI can improve students\u2019 performance, engagement, and motivation; at the same time, some challenges like bias and discrimination should be noted. The review covers the historic development of AI in education, its theoretical grounding, and its practical applications within PL and AA with high promise and ethical issues of AI-powered educational systems. Future directions are empirical validation of effectiveness and equity, development of algorithms that reduce bias, and exploration of ethical implications regarding data privacy. The review identifies the transformative potential of AI in developing personalized and adaptive learning (AL) environments, thus, it advocates continued development and exploration as a means to improve educational outcomes."} | ||
| 10 | +{"work_id": 4229641819, "title": "Mining of Massive Datasets", "abstract": "Written by leading authorities in database and Web technologies, this book is essential reading for students and practitioners alike. The popularity of the Web and Internet commerce provides many extremely large datasets from which information can be gleaned by data mining. This book focuses on practical algorithms that have been used to solve key problems in data mining and can be applied successfully to even the largest datasets. It begins with a discussion of the MapReduce framework, an important tool for parallelizing algorithms automatically. The authors explain the tricks of locality-sensitive hashing and stream-processing algorithms for mining data that arrives too fast for exhaustive processing. Other chapters cover the PageRank idea and related tricks for organizing the Web, the problems of finding frequent itemsets, and clustering. This third edition includes new and extended coverage on decision trees, deep learning, and mining social-network graphs."} | ||||
| 4 | {"work_id": 7160954670, "title": "Multi-Cloud Program Management For Large Scale Deployment", "abstract": "Multi-cloud strategies are one of the enablers that have gained urgent importance in large-scale enterprise implementations to provide better resilience, independence, and optimization of their performance. There is, however, a great challenge associated with the governance, cost control, security compliance, interoperability, and service-level assurance of managing large-scale programs across heterogeneous cloud platforms. The paper introduces a multi-cloud program management scheme that is comprehensive and capable of assisting the scaling, reliable, and policy-oriented deployment of cloud environments, which are globally distributed. The framework proposed would combine orchestration as a centralized system, standardized policies of governance, automated monitoring of compliance and performance-aware placement of workloads to ensure that technical performance is aligned to strategic business goals. The major dimensions in program management such as alignment of portfolios, risk management, governing costs, vendor integration, and control over operations are taken care of in a structured manner using the layered architecture. The framework also includes analytics-based decision support to facilitate resource optimization as well as continuous improvement in dynamic multi-cloud ecosystems. Through experimental assessment and case study-inspired industry scenarios, it has been shown that the proposed solution leads to much better deployment agility, cost-effectiveness, service reliability and cross-cloud interoperability than the traditional single-cloud and ad-hoc multi-cloud management practice. The findings have demonstrated the relevance of program management in the practicality of the multi-cloud architectures to large-scale and mission-critical deployments."} | 11 | {"work_id": 7160954670, "title": "Multi-Cloud Program Management For Large Scale Deployment", "abstract": "Multi-cloud strategies are one of the enablers that have gained urgent importance in large-scale enterprise implementations to provide better resilience, independence, and optimization of their performance. There is, however, a great challenge associated with the governance, cost control, security compliance, interoperability, and service-level assurance of managing large-scale programs across heterogeneous cloud platforms. The paper introduces a multi-cloud program management scheme that is comprehensive and capable of assisting the scaling, reliable, and policy-oriented deployment of cloud environments, which are globally distributed. The framework proposed would combine orchestration as a centralized system, standardized policies of governance, automated monitoring of compliance and performance-aware placement of workloads to ensure that technical performance is aligned to strategic business goals. The major dimensions in program management such as alignment of portfolios, risk management, governing costs, vendor integration, and control over operations are taken care of in a structured manner using the layered architecture. The framework also includes analytics-based decision support to facilitate resource optimization as well as continuous improvement in dynamic multi-cloud ecosystems. Through experimental assessment and case study-inspired industry scenarios, it has been shown that the proposed solution leads to much better deployment agility, cost-effectiveness, service reliability and cross-cloud interoperability than the traditional single-cloud and ad-hoc multi-cloud management practice. The findings have demonstrated the relevance of program management in the practicality of the multi-cloud architectures to large-scale and mission-critical deployments."} | ||
| 5 | {"work_id": 4394946189, "title": "Automatic Root Cause Analysis via Large Language Models for Cloud Incidents", "abstract": "Ensuring the reliability and availability of cloud services necessitates efficient root cause analysis (RCA) for cloud incidents. Traditional RCA methods, which rely on manual investigations of data sources such as logs and traces, are often laborious, error-prone, and challenging for on-call engineers. In this paper, we introduce RCACopilot, an innovative on-call system empowered by the large language model for automating RCA of cloud incidents. RCACopilot matches incoming incidents to corresponding incident handlers based on their alert types, aggregates the critical runtime diagnostic information, predicts the incident's root cause category, and provides an explanatory narrative. We evaluate RCACopilot using a real-world dataset consisting of a year's worth of incidents from Microsoft. Our evaluation demonstrates that RCACopilot achieves RCA accuracy up to 0.766. Furthermore, the diagnostic information collection component of RCACopilot has been successfully in use at Microsoft for over four years."} | 12 | {"work_id": 4394946189, "title": "Automatic Root Cause Analysis via Large Language Models for Cloud Incidents", "abstract": "Ensuring the reliability and availability of cloud services necessitates efficient root cause analysis (RCA) for cloud incidents. Traditional RCA methods, which rely on manual investigations of data sources such as logs and traces, are often laborious, error-prone, and challenging for on-call engineers. In this paper, we introduce RCACopilot, an innovative on-call system empowered by the large language model for automating RCA of cloud incidents. RCACopilot matches incoming incidents to corresponding incident handlers based on their alert types, aggregates the critical runtime diagnostic information, predicts the incident's root cause category, and provides an explanatory narrative. We evaluate RCACopilot using a real-world dataset consisting of a year's worth of incidents from Microsoft. Our evaluation demonstrates that RCACopilot achieves RCA accuracy up to 0.766. Furthermore, the diagnostic information collection component of RCACopilot has been successfully in use at Microsoft for over four years."} | ||
| 6 | {"work_id": 3094605801, "title": "Self-supervised Graph Learning for Recommendation", "abstract": "Representation learning on user-item graph for recommendation has evolved from using single ID or interaction history to exploiting higher-order neighbors. This leads to the success of graph convolution networks (GCNs) for recommendation such as PinSage and LightGCN. Despite effectiveness, we argue that they suffer from two limitations: (1) high-degree nodes exert larger impact on the representation learning, deteriorating the recommendations of low-degree (long-tail) items; and (2) representations are vulnerable to noisy interactions, as the neighborhood aggregation scheme further enlarges the impact of observed edges."} | 13 | {"work_id": 3094605801, "title": "Self-supervised Graph Learning for Recommendation", "abstract": "Representation learning on user-item graph for recommendation has evolved from using single ID or interaction history to exploiting higher-order neighbors. This leads to the success of graph convolution networks (GCNs) for recommendation such as PinSage and LightGCN. Despite effectiveness, we argue that they suffer from two limitations: (1) high-degree nodes exert larger impact on the representation learning, deteriorating the recommendations of low-degree (long-tail) items; and (2) representations are vulnerable to noisy interactions, as the neighborhood aggregation scheme further enlarges the impact of observed edges."} | ||
| 7 | {"work_id": 4293770403, "title": "Energy efficiency in cloud computing data centers: a survey on software technologies", "abstract": "Cloud computing is a commercial and economic paradigm that has gained traction since 2006 and is presently the most significant technology in IT sector. From the notion of cloud computing to its energy efficiency, cloud has been the subject of much discussion. The energy consumption of data centres alone will rise from 200 TWh in 2016 to 2967 TWh in 2030. The data centres require a lot of power to provide services, which increases CO2 emissions. In this survey paper, software-based technologies that can be used for building green data centers and include power management at individual software level has been discussed. The paper discusses the energy efficiency in containers and problem-solving approaches used for reducing power consumption in data centers. Further, the paper also gives details about the impact of data centers on environment that includes the e-waste and the various standards opted by different countries for giving rating to the data centers. This article goes beyond just demonstrating new green cloud computing possibilities. Instead, it focuses the attention and resources of academia and society on a critical issue: long-term technological advancement. The article covers the new technologies that can be applied at the individual software level that includes techniques applied at virtualization level, operating system level and application level. It clearly defines different measures at each level to reduce the energy consumption that clearly adds value to the current environmental problem of pollution reduction. This article also addresses the difficulties, concerns, and needs that cloud data centres and cloud organisations must grasp, as well as some of the factors and case studies that influence green cloud usage."} | 14 | {"work_id": 4293770403, "title": "Energy efficiency in cloud computing data centers: a survey on software technologies", "abstract": "Cloud computing is a commercial and economic paradigm that has gained traction since 2006 and is presently the most significant technology in IT sector. From the notion of cloud computing to its energy efficiency, cloud has been the subject of much discussion. The energy consumption of data centres alone will rise from 200 TWh in 2016 to 2967 TWh in 2030. The data centres require a lot of power to provide services, which increases CO2 emissions. In this survey paper, software-based technologies that can be used for building green data centers and include power management at individual software level has been discussed. The paper discusses the energy efficiency in containers and problem-solving approaches used for reducing power consumption in data centers. Further, the paper also gives details about the impact of data centers on environment that includes the e-waste and the various standards opted by different countries for giving rating to the data centers. This article goes beyond just demonstrating new green cloud computing possibilities. Instead, it focuses the attention and resources of academia and society on a critical issue: long-term technological advancement. The article covers the new technologies that can be applied at the individual software level that includes techniques applied at virtualization level, operating system level and application level. It clearly defines different measures at each level to reduce the energy consumption that clearly adds value to the current environmental problem of pollution reduction. This article also addresses the difficulties, concerns, and needs that cloud data centres and cloud organisations must grasp, as well as some of the factors and case studies that influence green cloud usage."} | ||
| 8 | −{"work_id": 153405511, "title": "An Analysis of the MOS under Conditions of Delay, Jitter and Packet Loss and an Analysis of the Impact of Introducing Piggybacking and Reed Solomon FEC for VOIP", "abstract": "Voice over IP (VoIP) is a real time application that allows transmitting voice through the Internet network. Recently there has been amazing progress in this field, mainly due to the development of voice codecs that react appropriately under conditions of packet loss, and the improvement of intelligent jitter buffers that perform better under conditions of variable inter packet delay. In addition, there are other factors that indirectly benefited VoIP. Today, computer networks are faster due to the advances in hardware and breakthrough algorithms. As a result, the quality of VoIP calls has improved considerably. However, the quality of VoIP calls under extreme conditions of packet loss still remains a major problem that needs to be addressed for the next generation of VoIP services. This thesis concentrates in making an analysis of the effects that network impairments, such as: delay, jitter, and packet loss have in the quality of VoIP calls and approaches to solve this problem. Finally, we analyze the impact of introducing forward error correction (FEC) Piggybacking and Reed Solomon codes for VoIP. To measure the mean opinion score of VoIP calls we develop an application based on the E-Model, and utilize perceptual evaluation of speech quality (PESQ)."} | 15 | +{"work_id": 4380791906, "title": "NoSQL Databases in Kubernetes", "abstract": "With the increasing popularity of deploying applications in containers, Kubernetes (K8s) has become one of the most accepted container orchestration systems. Kubernetes helps maintain containers smoothly and simplifies DevOps with powerful automations. It was originally developed as a tool to manage stateless microservices that run seamlessly in containers. The ephemeral nature of pods, the smallest deployable unit, in Kubernetes was well-aligned with stateless applications since destroying and recreating pods didn\u2019t impact applications. There was a need to provision solutions around stateful workloads like databases so as to take advantage of K8s. This project explores this need, the challenges associated and the available solutions for running databases in Kubernetes. Most of the current research is focused towards SQL-like databases in K8s even though the DNA of NoSQL distributed databases is more aligned with K8s. With no research being done with NoSQL databases, this project outlines the process behind setting up two famous NoSQL databases in K8s: MongoDB and Cassandra. The project also shows a representative viewpoint of the performance comparison between them using the YCSB benchmark. The project lays a foundation around the setup of these databases using K8s Operators and their benchmarking. The goal of the project is to describe the advantages of having databases in K8s, provide developers a clear path for setup and provide insights on basic benchmark performance."} | ||
| 9 | −{"work_id": 4362498422, "title": "Security and privacy in the internet of things", "abstract": "\u03a3\u03c4\u03b7 \u03c8\u03b7\u03c6\u03b9\u03b1\u03ba\u03ae \u03b5\u03c0\u03bf\u03c7\u03ae \u03c4\u03c9\u03bd \u03ad\u03be\u03c5\u03c0\u03bd\u03c9\u03bd \u03bf\u03b9\u03ba\u03bf\u03bd\u03bf\u03bc\u03b9\u03ce\u03bd, \u03c4\u03bf \u0394\u03b9\u03b1\u03b4\u03af\u03ba\u03c4\u03c5\u03bf \u03c4\u03c9\u03bd \u03a0\u03c1\u03b1\u03b3\u03bc\u03ac\u03c4\u03c9\u03bd (\u0394\u03c4\u03a0) (Internet of Things \u2013 IoT) \u03b4\u03b9\u03b1\u03b4\u03c1\u03b1\u03bc\u03b1\u03c4\u03af\u03b6\u03b5\u03b9 \u03c3\u03b7\u03bc\u03b1\u03bd\u03c4\u03b9\u03ba\u03cc \u03c1\u03cc\u03bb\u03bf \u03c3\u03c4\u03bf\u03bd \u03ba\u03cd\u03ba\u03bb\u03bf \u03b6\u03c9\u03ae\u03c2 \u03c4\u03c9\u03bd \u03ba\u03c1\u03af\u03c3\u03b9\u03bc\u03c9\u03bd \u03c5\u03c0\u03bf\u03b4\u03bf\u03bc\u03ce\u03bd, \u03c0\u03b1\u03c1\u03ad\u03c7\u03bf\u03bd\u03c4\u03b1\u03c2 \u03b4\u03b9\u03ac\u03c6\u03bf\u03c1\u03b1 \u03c0\u03bb\u03b5\u03bf\u03bd\u03b5\u03ba\u03c4\u03ae\u03bc\u03b1\u03c4\u03b1, \u03cc\u03c0\u03c9\u03c2 \u03b7 \u03b2\u03b5\u03bb\u03c4\u03b9\u03c9\u03bc\u03ad\u03bd\u03b7 \u03c0\u03b1\u03c1\u03b1\u03b3\u03c9\u03b3\u03b9\u03ba\u03cc\u03c4\u03b7\u03c4\u03b1, \u03c5\u03c0\u03b7\u03c1\u03b5\u03c3\u03af\u03b5\u03c2 \u03b1\u03c5\u03c4\u03bf\u03b8\u03b5\u03c1\u03b1\u03c0\u03b5\u03af\u03b1\u03c2 \u03ba\u03b1\u03b9 \u03b4\u03c5\u03bd\u03b1\u03c4\u03cc\u03c4\u03b7\u03c4\u03b5\u03c2 \u03b1\u03ba\u03c1\u03b9\u03b2\u03ad\u03c3\u03c4\u03b5\u03c1\u03bf\u03c5 \u03b5\u03bb\u03ad\u03b3\u03c7\u03bf\u03c5 \u03ba\u03b1\u03b9 \u03b4\u03b9\u03b1\u03c7\u03b5\u03af\u03c1\u03b9\u03c3\u03b7\u03c2. \u03a9\u03c3\u03c4\u03cc\u03c3\u03bf, \u03b7 \u03c1\u03b1\u03b3\u03b4\u03b1\u03af\u03b1 \u03b5\u03be\u03ad\u03bb\u03b9\u03be\u03b7 \u03c4\u03c9\u03bd \u03b5\u03c0\u03b9\u03ba\u03bf\u03b9\u03bd\u03c9\u03bd\u03b9\u03b1\u03ba\u03ce\u03bd \u03c3\u03c5\u03c3\u03c4\u03b7\u03bc\u03ac\u03c4\u03c9\u03bd \u03b5\u03b3\u03b5\u03af\u03c1\u03b5\u03b9 \u03c3\u03bf\u03b2\u03b1\u03c1\u03ac \u03b6\u03b7\u03c4\u03ae\u03bc\u03b1\u03c4\u03b1 \u03b1\u03c3\u03c6\u03ac\u03bb\u03b5\u03b9\u03b1\u03c2, \u03ba\u03c5\u03c1\u03af\u03c9\u03c2 \u03c3\u03b5 \u03b2\u03b9\u03bf\u03bc\u03b7\u03c7\u03b1\u03bd\u03b9\u03ba\u03ac \u03bf\u03b9\u03ba\u03bf\u03c3\u03c5\u03c3\u03c4\u03ae\u03bc\u03b1\u03c4\u03b1. \u0395\u03b9\u03b4\u03b9\u03ba\u03cc\u03c4\u03b5\u03c1\u03b1, \u03c4\u03bf \u0394\u03c4\u03a0 \u03b5\u03b9\u03c3\u03ac\u03b3\u03b5\u03b9 \u03ad\u03bd\u03b1 \u03c3\u03cd\u03bd\u03bf\u03bb\u03bf \u03b5\u03c4\u03b5\u03c1\u03bf\u03b3\u03b5\u03bd\u03ce\u03bd \u03c4\u03b5\u03c7\u03bd\u03bf\u03bb\u03bf\u03b3\u03b9\u03ce\u03bd, \u03bf\u03b9 \u03bf\u03c0\u03bf\u03af\u03b5\u03c2 \u03c7\u03c1\u03b7\u03c3\u03b9\u03bc\u03bf\u03c0\u03bf\u03b9\u03bf\u03cd\u03bd \u03c4\u03bf \u03c3\u03c5\u03bc\u03b2\u03b1\u03c4\u03b9\u03ba\u03cc \u03bc\u03bf\u03bd\u03c4\u03ad\u03bb\u03bf \u03c4\u03bf\u03c5 \u03b4\u03b9\u03b1\u03b4\u03b9\u03ba\u03c4\u03cd\u03bf\u03c5 (Internet), \u03c4\u03bf \u03cc\u03c0\u03bf\u03b9\u03bf \u03c7\u03b1\u03c1\u03b1\u03ba\u03c4\u03b7\u03c1\u03af\u03b6\u03b5\u03c4\u03b1\u03b9 \u03b1\u03c0\u03cc \u03ad\u03bd\u03b1 \u03bc\u03b5\u03b3\u03ac\u03bb\u03bf \u03b5\u03cd\u03c1\u03bf\u03c2 \u03b5\u03c5\u03c0\u03b1\u03b8\u03b5\u03b9\u03ce\u03bd. \u0395\u03c0\u03af\u03c3\u03b7\u03c2, \u03c4\u03b1 \u03b2\u03b9\u03bf\u03bc\u03b7\u03c7\u03b1\u03bd\u03b9\u03ba\u03ac \u03bf\u03b9\u03ba\u03bf\u03c3\u03c5\u03c3\u03c4\u03ae\u03bc\u03b1\u03c4\u03b1 \u03c7\u03b1\u03c1\u03b1\u03ba\u03c4\u03b7\u03c1\u03af\u03b6\u03bf\u03bd\u03c4\u03b1\u03b9 \u03b1\u03c0\u03cc \u03c4\u03b7\u03bd \u03c0\u03b1\u03c1\u03bf\u03c5\u03c3\u03af\u03b1 \u03c3\u03c5\u03bc\u03b2\u03b1\u03c4\u03b9\u03ba\u03ce\u03bd \u03c3\u03c5\u03c3\u03c4\u03b7\u03bc\u03ac\u03c4\u03c9\u03bd, \u03c4\u03b1 \u03bf\u03c0\u03bf\u03af\u03b1 \u03b5\u03af\u03bd\u03b1\u03b9 \u03b5\u03c0\u03b9\u03c1\u03c1\u03b5\u03c0\u03ae \u03c3\u03b5 \u03ad\u03bd\u03b1 \u03b5\u03c5\u03c1\u03cd \u03c6\u03ac\u03c3\u03bc\u03b1 \u03b1\u03b4\u03c5\u03bd\u03b1\u03bc\u03b9\u03ce\u03bd \u03ba\u03b1\u03b9 \u03b5\u03c5\u03c0\u03b1\u03b8\u03b5\u03b9\u03ce\u03bd \u03b1\u03c3\u03c6\u03ac\u03bb\u03b5\u03b9\u03b1\u03c2. \u0393\u03b9\u03b1 \u03c0\u03b1\u03c1\u03ac\u03b4\u03b5\u03b9\u03b3\u03bc\u03b1, \u03c4\u03b1 \u03b2\u03b9\u03bf\u03bc\u03b7\u03c7\u03b1\u03bd\u03b9\u03ba\u03ac \u03c0\u03c1\u03c9\u03c4\u03cc\u03ba\u03bf\u03bb\u03bb\u03b1 \u03b5\u03c0\u03b9\u03ba\u03bf\u03b9\u03bd\u03c9\u03bd\u03af\u03b1\u03c2 \u03b4\u03b5\u03bd \u03c0\u03b5\u03c1\u03b9\u03bb\u03b1\u03bc\u03b2\u03ac\u03bd\u03bf\u03c5\u03bd \u03bc\u03b7\u03c7\u03b1\u03bd\u03b9\u03c3\u03bc\u03bf\u03cd\u03c2 \u03c0\u03b9\u03c3\u03c4\u03bf\u03c0\u03bf\u03af\u03b7\u03c3\u03b7\u03c2 \u03c4\u03b1\u03c5\u03c4\u03cc\u03c4\u03b7\u03c4\u03b1\u03c2 \u03ba\u03b1\u03b9 \u03b5\u03be\u03bf\u03c5\u03c3\u03b9\u03bf\u03b4\u03cc\u03c4\u03b7\u03c3\u03b7\u03c2. \u0395\u03c0\u03bf\u03bc\u03ad\u03bd\u03c9\u03c2, \u03c0\u03b9\u03b8\u03b1\u03bd\u03bf\u03af \u03b5\u03c0\u03b9\u03c4\u03b9\u03b8\u03ad\u03bc\u03b5\u03bd\u03bf\u03b9 \u03ad\u03c7\u03bf\u03c5\u03bd \u03c4\u03b7 \u03b4\u03c5\u03bd\u03b1\u03c4\u03cc\u03c4\u03b7\u03c4\u03b1 \u03bd\u03b1 \u03b5\u03ba\u03c4\u03b5\u03bb\u03ad\u03c3\u03bf\u03c5\u03bd \u03b5\u03c0\u03b9\u03b8\u03ad\u03c3\u03b5\u03b9\u03c2 \u03ac\u03c1\u03bd\u03b7\u03c3\u03b7\u03c2 \u03c5\u03c0\u03b7\u03c1\u03b5\u03c3\u03b9\u03ce\u03bd (Denial of Service \u2013 DoS) \u03ba\u03b1\u03b9 \u00ab\u0391\u03bd\u03b8\u03c1\u03ce\u03c0\u03bf\u03c5 \u03a3\u03c4\u03b7 \u039c\u03ad\u03c3\u03b7\u00bb (Man In The Middle - MITM). \u0395\u03c0\u03af\u03c3\u03b7\u03c2, \u03bf\u03b9 \u03ba\u03c1\u03af\u03c3\u03b9\u03bc\u03b5\u03c2 \u03c5\u03c0\u03bf\u03b4\u03bf\u03bc\u03ad\u03c2 \u03b1\u03c0\u03bf\u03c4\u03b5\u03bb\u03bf\u03cd\u03bd \u03ad\u03bd\u03b1\u03bd \u03b5\u03bb\u03ba\u03c5\u03c3\u03c4\u03b9\u03ba\u03cc \u03c3\u03c4\u03cc\u03c7\u03bf \u03b3\u03b9\u03b1 \u03ad\u03bd\u03b1\u03bd \u03b1\u03c5\u03be\u03b1\u03bd\u03cc\u03bc\u03b5\u03bd\u03bf \u03b1\u03c1\u03b9\u03b8\u03bc\u03cc \u03ba\u03c5\u03b2\u03b5\u03c1\u03bd\u03bf\u03b5\u03c0\u03b9\u03c4\u03b9\u03b8\u03ad\u03bc\u03b5\u03bd\u03c9\u03bd, \u03bf\u03b9 \u03bf\u03c0\u03bf\u03af\u03bf\u03b9 \u03b4\u03cd\u03bd\u03b1\u03bd\u03c4\u03b1\u03b9 \u03bd\u03b1 \u03c3\u03c7\u03b5\u03b4\u03b9\u03ac\u03b6\u03bf\u03c5\u03bd \u03ba\u03b1\u03b9 \u03bd\u03b1 \u03b5\u03ba\u03c4\u03b5\u03bb\u03bf\u03cd\u03bd \u03c0\u03c1\u03bf\u03b3\u03c1\u03b1\u03bc\u03bc\u03b1\u03c4\u03b9\u03c3\u03bc\u03ad\u03bd\u03b1 \u03c0\u03c1\u03bf\u03b7\u03b3\u03bc\u03ad\u03bd\u03b5\u03c2 \u03b5\u03c0\u03af\u03bc\u03bf\u03bd\u03b5\u03c2 \u03b1\u03c0\u03b5\u03b9\u03bb\u03ad\u03c2 (Advanced Persistent Threats - APT). \u03a7\u03b1\u03c1\u03b1\u03ba\u03c4\u03b7\u03c1\u03b9\u03c3\u03c4\u03b9\u03ba\u03ac \u03c0\u03b1\u03c1\u03b1\u03b4\u03b5\u03af\u03b3\u03bc\u03b1\u03c4\u03b1 APT \u03b1\u03c0\u03bf\u03c4\u03b5\u03bb\u03bf\u03cd\u03bd \u03bf\u03b9 \u03b5\u03ba\u03c3\u03c4\u03c1\u03b1\u03c4\u03b5\u03af\u03b5\u03c2: Industroyer, Stuxnet \u03ba\u03b1\u03b9 TRITON. \u03a4\u03ad\u03bb\u03bf\u03c2, \u03b1\u03be\u03af\u03b6\u03b5\u03b9 \u03bd\u03b1 \u03c3\u03b7\u03bc\u03b5\u03b9\u03c9\u03b8\u03b5\u03af \u03c0\u03c9\u03c2 \u03c4\u03bf \u0394\u03c4\u03a0 \u03c7\u03b1\u03c1\u03b1\u03ba\u03c4\u03b7\u03c1\u03af\u03b6\u03b5\u03c4\u03b1\u03b9 \u03b1\u03c0\u03cc \u03c0\u03b5\u03c1\u03b9\u03bf\u03c1\u03b9\u03c3\u03bc\u03ad\u03bd\u03bf\u03c5\u03c2 \u03c5\u03c0\u03bf\u03bb\u03bf\u03b3\u03b9\u03c3\u03c4\u03b9\u03ba\u03bf\u03cd\u03c2 \u03c0\u03cc\u03c1\u03bf\u03c5\u03c2, \u03bf\u03b9 \u03bf\u03c0\u03bf\u03af\u03bf\u03b9 \u03b4\u03b5\u03bd \u03b5\u03c0\u03b9\u03c4\u03c1\u03ad\u03c0\u03bf\u03c5\u03bd \u03c4\u03b7\u03bd \u03b1\u03bd\u03ac\u03c0\u03c4\u03c5\u03be\u03b7 \u03c3\u03c5\u03bc\u03b2\u03b1\u03c4\u03b9\u03ba\u03ce\u03bd \u03bc\u03b7\u03c7\u03b1\u03bd\u03b9\u03c3\u03bc\u03ce\u03bd \u03b1\u03c3\u03c6\u03ac\u03bb\u03b5\u03b9\u03b1\u03c2.\u039c\u03b5 \u03b2\u03ac\u03c3\u03b7 \u03c4\u03b9\u03c2 \u03c0\u03c1\u03bf\u03b1\u03bd\u03b1\u03c6\u03b5\u03c1\u03b8\u03b5\u03af\u03c3\u03b5\u03c2 \u03c0\u03b1\u03c1\u03b1\u03c4\u03b7\u03c1\u03ae\u03c3\u03b5\u03b9\u03c2, \u03b5\u03af\u03bd\u03b1\u03b9 \u03c0\u03c1\u03bf\u03c6\u03b1\u03bd\u03ae\u03c2 \u03b7 \u03b1\u03c0\u03b1\u03c1\u03b1\u03af\u03c4\u03b7\u03c4\u03b7 \u03c0\u03b1\u03c1\u03bf\u03c5\u03c3\u03af\u03b1 \u03ba\u03b1\u03c4\u03ac\u03bb\u03bb\u03b7\u03bb\u03c9\u03bd \u03bc\u03b7\u03c7\u03b1\u03bd\u03b9\u03c3\u03bc\u03ce\u03bd \u03b1\u03c3\u03c6\u03ac\u03bb\u03b5\u03b9\u03b1\u03c2 \u03b3\u03b9\u03b1 \u03c4\u03bf \u0394\u03c4\u03a0. \u03a3\u03c5\u03bd\u03b5\u03c0\u03ce\u03c2, \u03bf \u03ba\u03cd\u03c1\u03b9\u03bf\u03c2 \u03c3\u03c4\u03cc\u03c7\u03bf\u03c2 \u03c4\u03b7\u03c2 \u03c0\u03b1\u03c1\u03bf\u03cd\u03c3\u03b1\u03c2 \u03b4\u03b9\u03b4\u03b1\u03ba\u03c4\u03bf\u03c1\u03b9\u03ba\u03ae\u03c2 \u03b4\u03b9\u03b1\u03c4\u03c1\u03b9\u03b2\u03ae\u03c2 \u03b5\u03af\u03bd\u03b1\u03b9 \u03b7 \u03b4\u03b9\u03b5\u03c1\u03b5\u03cd\u03bd\u03b7\u03c3\u03b7 \u03c4\u03c9\u03bd \u03b6\u03b7\u03c4\u03b7\u03bc\u03ac\u03c4\u03c9\u03bd \u03b1\u03c3\u03c6\u03ac\u03bb\u03b5\u03b9\u03b1\u03c2 \u03ba\u03b1\u03b9 \u03b9\u03b4\u03b9\u03c9\u03c4\u03b9\u03ba\u03cc\u03c4\u03b7\u03c4\u03b1\u03c2 \u03c3\u03c4\u03bf \u0394\u03c4\u03a0, \u03c0\u03b1\u03c1\u03ad\u03c7\u03bf\u03bd\u03c4\u03b1\u03c2 \u03b1\u03c0\u03bf\u03c4\u03b5\u03bb\u03b5\u03c3\u03bc\u03b1\u03c4\u03b9\u03ba\u03ad\u03c2 \u03bb\u03cd\u03c3\u03b5\u03b9\u03c2 \u03b1\u03c3\u03c6\u03ac\u03bb\u03b5\u03b9\u03b1\u03c2. \u0395\u03c0\u03bf\u03bc\u03ad\u03bd\u03c9\u03c2, \u03bc\u03b5\u03c4\u03ac \u03c4\u03bf \u039a\u03b5\u03c6\u03ac\u03bb\u03b1\u03b9\u03bf 1, \u03c4\u03bf \u03bf\u03c0\u03bf\u03af\u03bf \u03b1\u03c0\u03bf\u03c4\u03b5\u03bb\u03b5\u03af \u03c4\u03b7\u03bd \u03b5\u03b9\u03c3\u03b1\u03b3\u03c9\u03b3\u03ae \u03c3\u03c4\u03b7\u03bd \u03c0\u03b1\u03c1\u03bf\u03cd\u03c3\u03b1 \u03b4\u03b9\u03b4\u03b1\u03ba\u03c4\u03bf\u03c1\u03b9\u03ba\u03ae \u03b4\u03b9\u03b1\u03c4\u03c1\u03b9\u03b2\u03ae, \u03c0\u03b1\u03c1\u03bf\u03c5\u03c3\u03b9\u03ac\u03b6\u03bf\u03bd\u03c4\u03b1\u03c2 \u03c4\u03bf\u03c5\u03c2 \u03c3\u03c4\u03cc\u03c7\u03bf\u03c5\u03c2, \u03c4\u03b7 \u03bc\u03b5\u03b8\u03bf\u03b4\u03bf\u03bb\u03bf\u03b3\u03af\u03b1, \u03c4\u03b7 \u03c3\u03c5\u03bd\u03b5\u03b9\u03c3\u03c6\u03bf\u03c1\u03ac \u03ba\u03b1\u03b9 \u03c4\u03b7 \u03b4\u03bf\u03bc\u03ae \u03c4\u03b7\u03c2 \u03b5\u03c1\u03b3\u03b1\u03c3\u03af\u03b1\u03c2, \u03bf\u03b9 \u03b1\u03c0\u03b1\u03b9\u03c4\u03ae\u03c3\u03b5\u03b9\u03c2, \u03c0\u03c1\u03bf\u03ba\u03bb\u03ae\u03c3\u03b5\u03b9\u03c2 \u03ba\u03b1\u03b9 \u03bf\u03b9 \u03b1\u03c0\u03b5\u03b9\u03bb\u03ad\u03c2 \u03b1\u03c3\u03c6\u03ac\u03bb\u03b5\u03b9\u03b1\u03c2 \u03c3\u03c4\u03bf \u03bf\u03b9\u03ba\u03bf\u03c3\u03cd\u03c3\u03c4\u03b7\u03bc\u03b1 \u03c4\u03bf\u03c5 \u0394\u03c4\u03a0 \u03b5\u03be\u03b5\u03c4\u03ac\u03b6\u03bf\u03bd\u03c4\u03b1\u03b9 \u03b1\u03bd\u03b1\u03bb\u03c5\u03c4\u03b9\u03ba\u03ac \u03c3\u03c4\u03bf \u039a\u03b5\u03c6\u03ac\u03bb\u03b1\u03b9\u03bf 2, \u03b4\u03af\u03bd\u03bf\u03bd\u03c4\u03b1\u03c2 \u03b9\u03b4\u03b9\u03b1\u03af\u03c4\u03b5\u03c1\u03b7 \u03c0\u03c1\u03bf\u03c3\u03bf\u03c7\u03ae \u03c3\u03c4\u03b1 \u03b9\u03b4\u03b9\u03b1\u03af\u03c4\u03b5\u03c1\u03b1 \u03c7\u03b1\u03c1\u03b1\u03ba\u03c4\u03b7\u03c1\u03b9\u03c3\u03c4\u03b9\u03ba\u03ac \u03ba\u03b1\u03b9 \u03c4\u03bf\u03c5\u03c2 \u03c0\u03b5\u03c1\u03b9\u03bf\u03c1\u03b9\u03c3\u03bc\u03bf\u03cd\u03c2 \u03c4\u03c9\u03bd \u03bf\u03bd\u03c4\u03bf\u03c4\u03ae\u03c4\u03c9\u03bd \u03c3\u03c4\u03bf \u03bf\u03b9\u03ba\u03bf\u03c3\u03cd\u03c3\u03c4\u03b7\u03bc\u03b1 \u03c4\u03bf\u03c5 \u0394\u03c4\u03a0. \u03a3\u03c5\u03b3\u03ba\u03b5\u03ba\u03c1\u03b9\u03bc\u03ad\u03bd\u03b1, \u03c0\u03b1\u03c1\u03ad\u03c7\u03b5\u03c4\u03b1\u03b9 \u03bc\u03b9\u03b1 \u03bd\u03ad\u03b1 \u03c4\u03b1\u03be\u03b9\u03bd\u03cc\u03bc\u03b7\u03c3\u03b7 \u03c4\u03c9\u03bd \u03b1\u03c0\u03b5\u03b9\u03bb\u03ce\u03bd \u03c4\u03bf\u03c5 \u0394\u03c4\u03a0, \u03b1\u03be\u03b9\u03bf\u03c0\u03bf\u03b9\u03ce\u03bd\u03c4\u03b1\u03c2 \u03c4\u03bf \u03c3\u03cd\u03c3\u03c4\u03b7\u03bc\u03b1 (Common Attack Pattern Enumeration and Classification - CAPEC), \u03b5\u03bd\u03ce \u03b1\u03bd\u03b1\u03bb\u03cd\u03b5\u03c4\u03b1\u03b9 \u03b5\u03c0\u03af\u03c3\u03b7\u03c2 \u03b7 \u03b1\u03c0\u03bf\u03c4\u03b5\u03bb\u03b5\u03c3\u03bc\u03b1\u03c4\u03b9\u03ba\u03cc\u03c4\u03b7\u03c4\u03b1 \u03c4\u03c9\u03bd \u03c5\u03c6\u03b9\u03c3\u03c4\u03ac\u03bc\u03b5\u03bd\u03c9\u03bd \u03b1\u03bd\u03c4\u03b9\u03bc\u03ad\u03c4\u03c1\u03c9\u03bd. \u0391\u03be\u03af\u03b6\u03b5\u03b9 \u03bd\u03b1 \u03c3\u03b7\u03bc\u03b5\u03b9\u03c9\u03b8\u03b5\u03af \u03cc\u03c4\u03b9 \u03c4\u03cc\u03c3\u03bf \u03b7 \u03b1\u03ba\u03b1\u03b4\u03b7\u03bc\u03b1\u03ca\u03ba\u03ae \u03ba\u03bf\u03b9\u03bd\u03cc\u03c4\u03b7\u03c4\u03b1 \u03cc\u03c3\u03bf \u03ba\u03b1\u03b9 \u03b7 \u03b2\u03b9\u03bf\u03bc\u03b7\u03c7\u03b1\u03bd\u03af\u03b1 \u03ad\u03c7\u03bf\u03c5\u03bd \u03b1\u03bd\u03b1\u03c0\u03c4\u03cd\u03be\u03b5\u03b9 \u03b1\u03c0\u03bf\u03c4\u03b5\u03bb\u03b5\u03c3\u03bc\u03b1\u03c4\u03b9\u03ba\u03ad\u03c2 \u03bb\u03cd\u03c3\u03b5\u03b9\u03c2 \u03b1\u03c3\u03c6\u03ac\u03bb\u03b5\u03b9\u03b1\u03c2, \u03cc\u03c0\u03c9\u03c2 \u03bf\u03b9 \u03bc\u03b7\u03c7\u03b1\u03bd\u03b9\u03c3\u03bc\u03bf\u03af \u03ba\u03c1\u03c5\u03c0\u03c4\u03bf\u03b3\u03c1\u03ac\u03c6\u03b7\u03c3\u03b7\u03c2 \u03ba\u03b1\u03b9 \u03b5\u03be\u03bf\u03c5\u03c3\u03b9\u03bf\u03b4\u03cc\u03c4\u03b7\u03c3\u03b7\u03c2 \u03c4\u03c9\u03bd \u03c0\u03c1\u03c9\u03c4\u03bf\u03ba\u03cc\u03bb\u03bb\u03c9\u03bd \u03b5\u03c0\u03b9\u03ba\u03bf\u03b9\u03bd\u03c9\u03bd\u03af\u03b1\u03c2 \u03c4\u03bf\u03c5 \u0394\u03c4\u03a0. \u03a9\u03c3\u03c4\u03cc\u03c3\u03bf, \u03bf\u03b9 \u03c5\u03c6\u03b9\u03c3\u03c4\u03ac\u03bc\u03b5\u03bd\u03bf\u03b9 \u03bc\u03b7\u03c7\u03b1\u03bd\u03b9\u03c3\u03bc\u03bf\u03af \u03b1\u03c3\u03c6\u03ac\u03bb\u03b5\u03b9\u03b1\u03c2 \u03b4\u03b5\u03bd \u03ad\u03c7\u03bf\u03c5\u03bd \u03c4\u03b7 \u03b4\u03c5\u03bd\u03b1\u03c4\u03cc\u03c4\u03b7\u03c4\u03b1 \u03bd\u03b1 \u03c5\u03b9\u03bf\u03b8\u03b5\u03c4\u03b7\u03b8\u03bf\u03cd\u03bd \u03c0\u03bb\u03ae\u03c1\u03c9\u03c2 \u03c3\u03b5 \u03b2\u03b9\u03bf\u03bc\u03b7\u03c7\u03b1\u03bd\u03b9\u03ba\u03ac \u03c0\u03b5\u03c1\u03b9\u03b2\u03ac\u03bb\u03bb\u03bf\u03bd\u03c4\u03b1 \u03bb\u03cc\u03b3\u03c9 \u03c4\u03bf\u03c5 \u03b1\u03bd\u03b1\u03b3\u03ba\u03b1\u03af\u03bf\u03c5 \u03c1\u03cc\u03bb\u03bf\u03c5 \u03c4\u03c9\u03bd \u03a3\u03c5\u03c3\u03c4\u03b7\u03bc\u03ac\u03c4\u03c9\u03bd \u0392\u03b9\u03bf\u03bc\u03b7\u03c7\u03b1\u03bd\u03b9\u03ba\u03bf\u03cd \u0395\u03bb\u03ad\u03b3\u03c7\u03bf\u03c5 (Industrial Control Systems - ICS) \u03ba\u03b1\u03b9 \u03c4\u03c9\u03bd \u03a3\u03c5\u03c3\u03c4\u03b7\u03bc\u03ac\u03c4\u03c9\u03bd \u0395\u03c0\u03bf\u03c0\u03c4\u03b9\u03ba\u03bf\u03cd \u0395\u03bb\u03ad\u03b3\u03c7\u03bf\u03c5 \u03ba\u03b1\u03b9 \u03a3\u03c5\u03bb\u03bb\u03bf\u03b3\u03ae\u03c2 \u0394\u03b5\u03b4\u03bf\u03bc\u03ad\u03bd\u03c9\u03bd (Supervision Control And Data Acquisition - SCADA). \u039a\u03b1\u03c4\u03ac \u03c3\u03c5\u03bd\u03ad\u03c0\u03b5\u03b9\u03b1, \u03b7 \u03c0\u03b1\u03c1\u03bf\u03c5\u03c3\u03af\u03b1 \u03a3\u03c5\u03c3\u03c4\u03b7\u03bc\u03ac\u03c4\u03c9\u03bd \u0391\u03bd\u03af\u03c7\u03bd\u03b5\u03c5\u03c3\u03b7\u03c2 \u03ba\u03b1\u03b9 \u03a0\u03c1\u03cc\u03bb\u03b7\u03c8\u03b7\u03c2 \u0395\u03b9\u03c3\u03b2\u03bf\u03bb\u03ce\u03bd (\u03a3\u0391\u03a0\u0395) (Intrusion Detection and Prevention Systems - IDPS) \u03b5\u03af\u03bd\u03b1\u03b9 \u03b1\u03c0\u03b1\u03c1\u03b1\u03af\u03c4\u03b7\u03c4\u03b7.\u039c\u03b5 \u03b2\u03ac\u03c3\u03b7 \u03c4\u03b7\u03bd \u03b1\u03bd\u03ac\u03bb\u03c5\u03c3\u03b7 \u03c4\u03c9\u03bd \u03b1\u03bc\u03c5\u03bd\u03c4\u03b9\u03ba\u03ce\u03bd \u03bc\u03b7\u03c7\u03b1\u03bd\u03b9\u03c3\u03bc\u03ce\u03bd \u03c3\u03c4\u03bf \u03c0\u03c1\u03bf\u03b7\u03b3\u03bf\u03cd\u03bc\u03b5\u03bd\u03bf \u03ba\u03b5\u03c6\u03ac\u03bb\u03b1\u03b9\u03bf, \u03c3\u03c4\u03b7 \u03c3\u03c5\u03bd\u03ad\u03c7\u03b5\u03b9\u03b1 \u03c4\u03bf \u039a\u03b5\u03c6\u03ac\u03bb\u03b1\u03b9\u03bf 3 \u03b5\u03c0\u03b9\u03ba\u03b5\u03bd\u03c4\u03c1\u03ce\u03bd\u03b5\u03c4\u03b1\u03b9 \u03c3\u03c4\u03b7\u03bd \u03b1\u03bd\u03af\u03c7\u03bd\u03b5\u03c5\u03c3\u03b7 \u03ba\u03b1\u03b9 \u03c0\u03c1\u03cc\u03bb\u03b7\u03c8\u03b7 \u03b5\u03b9\u03c3\u03b2\u03bf\u03bb\u03ce\u03bd. \u0391\u03ba\u03c1\u03b9\u03b2\u03ad\u03c3\u03c4\u03b5\u03c1\u03b1, \u03b4\u03b9\u03b5\u03c1\u03b5\u03c5\u03bd\u03ac\u03c4\u03b1\u03b9 \u03c4\u03bf \u03b1\u03c1\u03c7\u03b9\u03c4\u03b5\u03ba\u03c4\u03bf\u03bd\u03b9\u03ba\u03cc \u03bc\u03bf\u03bd\u03c4\u03ad\u03bb\u03bf \u03ba\u03b1\u03b9 \u03bf\u03b9 \u03c0\u03c1\u03bf\u03b4\u03b9\u03b1\u03b3\u03c1\u03b1\u03c6\u03ad\u03c2 \u03c4\u03c9\u03bd \u03c3\u03c5\u03c3\u03c4\u03b7\u03bc\u03ac\u03c4\u03c9\u03bd \u03a3\u0391\u03a0\u0395, \u03b1\u03bd\u03b1\u03bb\u03cd\u03bf\u03bd\u03c4\u03b1\u03c2 \u03c4\u03b9\u03c2 \u03ba\u03b1\u03c4\u03b7\u03b3\u03bf\u03c1\u03af\u03b5\u03c2 \u03c4\u03bf\u03c5\u03c2 \u03bc\u03b5 \u03b2\u03ac\u03c3\u03b7 \u03c4\u03b9\u03c2 \u03bc\u03b5\u03b8\u03cc\u03b4\u03bf\u03c5\u03c2 \u03b1\u03bd\u03af\u03c7\u03bd\u03b5\u03c5\u03c3\u03b7\u03c2 \u03ba\u03b1\u03b9 \u03c4\u03b7\u03bd \u03c4\u03bf\u03c0\u03bf\u03b8\u03ad\u03c4\u03b7\u03c3\u03b7 \u03c4\u03bf\u03c5\u03c2. \u0395\u03c0\u03af\u03c3\u03b7\u03c2, \u03b9\u03b4\u03b9\u03b1\u03af\u03c4\u03b5\u03c1\u03b7 \u03ad\u03bc\u03c6\u03b1\u03c3\u03b7 \u03b4\u03af\u03bd\u03b5\u03c4\u03b1\u03b9 \u03c3\u03c4\u03b9\u03c2 \u03c4\u03b5\u03c7\u03bd\u03b9\u03ba\u03ad\u03c2 \u03a4\u03b5\u03c7\u03bd\u03b7\u03c4\u03ae\u03c2 \u039d\u03bf\u03b7\u03bc\u03bf\u03c3\u03cd\u03bd\u03b7\u03c2 (Artificial Intelligence \u2013 AI), \u03bf\u03b9 \u03bf\u03c0\u03bf\u03af\u03b5\u03c2 \u03b4\u03cd\u03bd\u03b1\u03bd\u03c4\u03b1\u03b9 \u03bd\u03b1 \u03b5\u03c6\u03b1\u03c1\u03bc\u03bf\u03c3\u03c4\u03bf\u03cd\u03bd \u03b1\u03c0\u03cc \u03c4\u03b1 \u03c3\u03c5\u03c3\u03c4\u03ae\u03bc\u03b1\u03c4\u03b1 \u03a3\u0391\u03a0\u0395 \u03b3\u03b9\u03b1 \u03c4\u03b7\u03bd \u03b1\u03bd\u03b1\u03b3\u03bd\u03ce\u03c1\u03b9\u03c3\u03b7 \u03ba\u03c5\u03b2\u03b5\u03c1\u03bd\u03bf\u03b5\u03c0\u03b9\u03b8\u03ad\u03c3\u03b5\u03c9\u03bd \u03ba\u03b1\u03b9 \u03b1\u03bd\u03c9\u03bc\u03b1\u03bb\u03b9\u03ce\u03bd. \u0395\u03c0\u03b9\u03c0\u03bb\u03ad\u03bf\u03bd, \u03b1\u03bd\u03b1\u03bb\u03cd\u03bf\u03bd\u03c4\u03b1\u03b9 \u03bc\u03b7\u03c7\u03b1\u03bd\u03b9\u03c3\u03bc\u03bf\u03af \u03c0\u03c1\u03cc\u03bb\u03b7\u03c8\u03b7\u03c2 \u03b5\u03b9\u03c3\u03b2\u03bf\u03bb\u03ce\u03bd, \u03cc\u03c0\u03c9\u03c2 \u03bf\u03b9 \u03c0\u03b1\u03b3\u03af\u03b4\u03b5\u03c2 \u03b5\u03b9\u03c3\u03b2\u03bf\u03bb\u03ce\u03bd (honeypots) \u03ba\u03b1\u03b9 \u03bf\u03b9 \u03bc\u03b7\u03c7\u03b1\u03bd\u03b9\u03c3\u03bc\u03bf\u03af \u03ba\u03b1\u03b8\u03bf\u03c1\u03b9\u03b6\u03cc\u03bc\u03b5\u03bd\u03bf\u03b9 \u03b1\u03c0\u03cc \u03bb\u03bf\u03b3\u03b9\u03c3\u03bc\u03b9\u03ba\u03cc (Software-Defined Networking - SDN). \u03a4\u03ad\u03bb\u03bf\u03c2, \u03c3\u03c4\u03bf \u03c3\u03c5\u03b3\u03ba\u03b5\u03ba\u03c1\u03b9\u03bc\u03ad\u03bd\u03bf \u03ba\u03b5\u03c6\u03ac\u03bb\u03b1\u03b9\u03bf \u03b1\u03bd\u03b1\u03bb\u03cd\u03b5\u03c4\u03b1\u03b9 \u03bf \u03c1\u03cc\u03bb\u03bf\u03c2 \u03c4\u03c9\u03bd \u03a3\u03c5\u03c3\u03c4\u03b7\u03bc\u03ac\u03c4\u03c9\u03bd \u0394\u03b9\u03b1\u03c7\u03b5\u03af\u03c1\u03b9\u03c3\u03b7\u03c2 \u03a0\u03bb\u03b7\u03c1\u03bf\u03c6\u03bf\u03c1\u03b9\u03ce\u03bd \u03ba\u03b1\u03b9 \u03a3\u03c5\u03bc\u03b2\u03ac\u03bd\u03c4\u03c9\u03bd \u03b1\u03c3\u03c6\u03ac\u03bb\u03b5\u03b9\u03b1\u03c2 (\u03a3\u0394\u03a0\u03a3\u0391) (Security Information and Event Management -SIEM) \u03c3\u03c4\u03b1 \u03bf\u03b9\u03ba\u03bf\u03c3\u03c5\u03c3\u03c4\u03ae\u03bc\u03b1\u03c4\u03b1 \u0394\u03c4\u03a0, \u03b5\u03c3\u03c4\u03b9\u03ac\u03b6\u03bf\u03bd\u03c4\u03b1\u03c2 \u03c3\u03c4\u03b9\u03c2 \u03bc\u03b5\u03b8\u03cc\u03b4\u03bf\u03c5\u03c2 \u03ba\u03b1\u03bd\u03bf\u03bd\u03b9\u03ba\u03bf\u03c0\u03bf\u03af\u03b7\u03c3\u03b7\u03c2 \u03ba\u03b1\u03b9 \u03c3\u03c5\u03c3\u03c7\u03ad\u03c4\u03b9\u03c3\u03b7\u03c2 \u03c4\u03c9\u03bd \u03b4\u03b9\u03b1\u03c6\u03cc\u03c1\u03c9\u03bd \u03c3\u03c5\u03bc\u03b2\u03ac\u03bd\u03c4\u03c9\u03bd \u03b1\u03c3\u03c6\u03ac\u03bb\u03b5\u03b9\u03b1\u03c2. \u03a3\u03c4\u03b7 \u03c3\u03c5\u03bd\u03ad\u03c7\u03b5\u03b9\u03b1, \u03c3\u03c4\u03bf \u039a\u03b5\u03c6\u03ac\u03bb\u03b1\u03b9\u03bf 4, \u03b1\u03ba\u03bf\u03bb\u03bf\u03c5\u03b8\u03b5\u03af \u03bc\u03b9\u03b1 \u03b4\u03b9\u03b5\u03be\u03bf\u03b4\u03b9\u03ba\u03ae \u03b1\u03bd\u03ac\u03bb\u03c5\u03c3\u03b7 \u03c4\u03c9\u03bd \u03bc\u03b7\u03c7\u03b1\u03bd\u03b9\u03c3\u03bc\u03ce\u03bd \u03b1\u03bd\u03af\u03c7\u03bd\u03b5\u03c5\u03c3\u03b7\u03c2 \u03ba\u03b1\u03b9 \u03c0\u03c1\u03cc\u03bb\u03b7\u03c8\u03b7 \u03b5\u03b9\u03c3\u03b2\u03bf\u03bb\u03ce\u03bd \u03c3\u03b5 \u03c0\u03b5\u03c1\u03b9\u03b2\u03ac\u03bb\u03bb\u03bf\u03bd\u03c4\u03b1 \u0388\u03be\u03c5\u03c0\u03bd\u03c9\u03bd \u0394\u03b9\u03ba\u03c4\u03cd\u03c9\u03bd \u0397\u03bb\u03b5\u03ba\u03c4\u03c1\u03bf\u03b4\u03cc\u03c4\u03b7\u03c3\u03b7\u03c2 (\u0395\u0394\u0397) (Smart Grid - SG). \u03a3\u03c5\u03b3\u03ba\u03b5\u03ba\u03c1\u03b9\u03bc\u03ad\u03bd\u03b1, \u03c4\u03b1 \u03c3\u03c5\u03c3\u03c4\u03ae\u03bc\u03b1\u03c4\u03b1 \u0395\u0394\u0397 \u03b1\u03c0\u03bf\u03c4\u03b5\u03bb\u03bf\u03cd\u03bd \u03c4\u03b7 \u03bc\u03b5\u03b3\u03b1\u03bb\u03cd\u03c4\u03b5\u03c1\u03b7 \u03b5\u03c6\u03b1\u03c1\u03bc\u03bf\u03b3\u03ae \u03c4\u03bf\u03c5 \u0394\u03c4\u03a0, \u03c0\u03b5\u03c1\u03b9\u03bb\u03b1\u03bc\u03b2\u03ac\u03bd\u03bf\u03bd\u03c4\u03b1\u03c2 \u03c0\u03bf\u03bb\u03bb\u03b1\u03c0\u03bb\u03ac \u03b1\u03c1\u03c7\u03b9\u03c4\u03b5\u03ba\u03c4\u03bf\u03bd\u03b9\u03ba\u03ac \u03c3\u03c5\u03c3\u03c4\u03b1\u03c4\u03b9\u03ba\u03ac, \u03cc\u03c0\u03c9\u03c2 \u03b7 \u03a0\u03c1\u03bf\u03b7\u03b3\u03bc\u03ad\u03bd\u03b5\u03c2 \u03a5\u03c0\u03bf\u03b4\u03bf\u03bc\u03ad\u03c2 \u039c\u03ad\u03c4\u03c1\u03b7\u03c3\u03b7\u03c2 (Advanced Metering Infrastructure - AMI), \u03c4\u03b1 \u03c3\u03c5\u03c3\u03c4\u03ae\u03bc\u03b1\u03c4\u03b1 \u03b2\u03b9\u03bf\u03bc\u03b7\u03c7\u03b1\u03bd\u03b9\u03ba\u03bf\u03cd \u03b5\u03bb\u03ad\u03b3\u03c7\u03bf\u03c5, \u03bf\u03b9 \u03c5\u03c0\u03bf\u03c3\u03c4\u03b1\u03b8\u03bc\u03bf\u03af \u03ba\u03b1\u03b9 \u03bf\u03b9 \u03c3\u03c5\u03b3\u03c7\u03c1\u03bf\u03bd\u03b9\u03c3\u03c4\u03ad\u03c2. \u03a3\u03c5\u03bd\u03b5\u03c0\u03ce\u03c2, \u03b3\u03b9\u03b1 \u03ba\u03b1\u03b8\u03ad\u03bd\u03b1 \u03b1\u03c0\u03cc \u03c4\u03b1 \u03c0\u03c1\u03bf\u03b7\u03b3\u03bf\u03cd\u03bc\u03b5\u03bd\u03b1 \u03b1\u03c1\u03c7\u03b9\u03c4\u03b5\u03ba\u03c4\u03bf\u03bd\u03b9\u03ba\u03ac \u03c3\u03c4\u03bf\u03b9\u03c7\u03b5\u03af\u03b1 \u03c4\u03c9\u03bd \u03c3\u03c5\u03c3\u03c4\u03b7\u03bc\u03ac\u03c4\u03c9\u03bd \u0395\u0394\u0397 \u03bc\u03b5\u03bb\u03b5\u03c4\u03ce\u03bd\u03c4\u03b1\u03b9 \u03c3\u03c7\u03b5\u03c4\u03b9\u03ba\u03ad\u03c2 \u03bb\u03cd\u03c3\u03b5\u03b9\u03c2 \u03b1\u03bd\u03af\u03c7\u03bd\u03b5\u03c5\u03c3\u03b7\u03c2 \u03ba\u03b1\u03b9 \u03c0\u03c1\u03cc\u03bb\u03b7\u03c8\u03b7\u03c2 \u03b5\u03b9\u03c3\u03b2\u03bf\u03bb\u03ce\u03bd (\u03cc\u03c0\u03c9\u03c2 \u03a3\u0391\u03a0\u0395 \u03ba\u03b1\u03b9 \u03c0\u03b1\u03b3\u03af\u03b4\u03b5\u03c2 \u03b5\u03b9\u03c3\u03b2\u03bf\u03bb\u03ce\u03bd), \u03b5\u03c3\u03c4\u03b9\u03ac\u03b6\u03bf\u03bd\u03c4\u03b1\u03c2 \u03c3\u03c4\u03b7\u03bd \u03b1\u03c1\u03c7\u03b9\u03c4\u03b5\u03ba\u03c4\u03bf\u03bd\u03b9\u03ba\u03ae \u03ba\u03b1\u03b9 \u03c4\u03b7\u03bd \u03b1\u03c0\u03cc\u03b4\u03bf\u03c3\u03b7 \u03c4\u03bf\u03c5\u03c2. \u0395\u03c0\u03bf\u03bc\u03ad\u03bd\u03c9\u03c2, \u03bc\u03b5 \u03b2\u03ac\u03c3\u03b7 \u03b1\u03c5\u03c4\u03ae \u03c4\u03b7 \u03c3\u03c5\u03b3\u03ba\u03c1\u03b9\u03c4\u03b9\u03ba\u03ae \u03b1\u03bd\u03ac\u03bb\u03c5\u03c3\u03b7, \u03b4\u03b9\u03b5\u03c1\u03b5\u03c5\u03bd\u03ce\u03bd\u03c4\u03b1\u03b9 \u03c0\u03b5\u03c1\u03b1\u03b9\u03c4\u03ad\u03c1\u03c9 \u03c4\u03b1 \u03c0\u03bb\u03b5\u03bf\u03bd\u03b5\u03ba\u03c4\u03ae\u03bc\u03b1\u03c4\u03b1 \u03ba\u03b1\u03b9 \u03bf\u03b9 \u03c0\u03b5\u03c1\u03b9\u03bf\u03c1\u03b9\u03c3\u03bc\u03bf\u03af \u03c4\u03c9\u03bd \u03c5\u03c6\u03b9\u03c3\u03c4\u03ac\u03bc\u03b5\u03bd\u03c9\u03bd \u03bb\u03cd\u03c3\u03b5\u03c9\u03bd, \u03ba\u03b1\u03b8\u03bf\u03b4\u03b7\u03b3\u03ce\u03bd\u03c4\u03b1\u03c2 \u03ad\u03c4\u03c3\u03b9 \u03c4\u03b7\u03bd \u03c5\u03bb\u03bf\u03c0\u03bf\u03af\u03b7\u03c3\u03b7 \u03c4\u03bf\u03c5 \u03c0\u03c1\u03bf\u03c4\u03b5\u03b9\u03bd\u03cc\u03bc\u03b5\u03bd\u03bf\u03c5 \u03a3\u0394\u03a0\u03a3\u0391 \u03bc\u03b5 \u03b4\u03c5\u03bd\u03b1\u03c4\u03cc\u03c4\u03b7\u03c4\u03b5\u03c2 \u03ba\u03b1\u03b8\u03bf\u03c1\u03b9\u03b6\u03cc\u03bc\u03b5\u03bd\u03bf\u03c5 \u03bb\u03bf\u03b3\u03b9\u03c3\u03bc\u03b9\u03ba\u03bf\u03cd \u03ba\u03b1\u03b9 \u03c4\u03b5\u03c7\u03bd\u03b7\u03c4\u03ae\u03c2 \u03bd\u03bf\u03b7\u03bc\u03bf\u03c3\u03cd\u03bd\u03b7\u03c2 \u03c3\u03c4\u03bf \u03b5\u03c0\u03cc\u03bc\u03b5\u03bd\u03bf \u03ba\u03b5\u03c6\u03ac\u03bb\u03b1\u03b9\u03bf.\u03a3\u03c4\u03b7 \u03c3\u03c5\u03bd\u03ad\u03c7\u03b5\u03b9\u03b1, \u03c3\u03c4\u03bf \u039a\u03b5\u03c6\u03ac\u03bb\u03b1\u03b9\u03bf 5 \u03c0\u03b1\u03c1\u03bf\u03c5\u03c3\u03b9\u03ac\u03b6\u03b5\u03c4\u03b1\u03b9 \u03c4\u03bf \u03c0\u03c1\u03bf\u03c4\u03b5\u03b9\u03bd\u03cc\u03bc\u03b5\u03bd\u03bf \u03a3\u0394\u03a0\u03a3\u0391, \u03c4\u03bf \u03bf\u03c0\u03bf\u03af\u03bf \u03b1\u03c0\u03bf\u03c4\u03b5\u03bb\u03b5\u03af\u03c4\u03b1\u03b9 \u03b1\u03c0\u03cc \u03c4\u03c1\u03af\u03b1 \u03a3\u0391\u03a0\u0395: (\u03b1) \u03a3\u0391\u03a0\u0395 \u03bc\u03b5 \u03b2\u03ac\u03c3\u03b7 \u03b4\u03b9\u03ba\u03c4\u03c5\u03b1\u03ba\u03ad\u03c2 \u03c1\u03bf\u03ad\u03c2, (\u03b2) \u03a3\u0391\u03a0\u0395 \u03bc\u03b5\u03bc\u03bf\u03bd\u03c9\u03bc\u03ad\u03bd\u03c9\u03bd \u03c3\u03c5\u03c3\u03c4\u03b7\u03bc\u03ac\u03c4\u03c9\u03bd \u03ba\u03b1\u03b9 (\u03b3) \u03a3\u0391\u03a0\u0395 \u03bc\u03b5 \u03b4\u03c5\u03bd\u03b1\u03c4\u03cc\u03c4\u03b7\u03c4\u03b5\u03c2 \u03bf\u03c0\u03c4\u03b9\u03ba\u03bf\u03c0\u03bf\u03af\u03b7\u03c3\u03b7\u03c2. \u0391\u03c1\u03c7\u03b9\u03ba\u03ac, \u03c4\u03bf \u03c0\u03c1\u03ce\u03c4\u03bf \u03a3\u0391\u03a0\u0395 \u03b5\u03bd\u03c3\u03c9\u03bc\u03b1\u03c4\u03ce\u03bd\u03b5\u03b9 \u03c0\u03bf\u03bb\u03bb\u03b1\u03c0\u03bb\u03ac \u03bc\u03bf\u03bd\u03c4\u03ad\u03bb\u03b1 \u03bc\u03b7\u03c7\u03b1\u03bd\u03b9\u03ba\u03ae\u03c2 \u03ba\u03b1\u03b9 \u03b2\u03b1\u03b8\u03b9\u03ac\u03c2 \u03bc\u03ac\u03b8\u03b7\u03c3\u03b7\u03c2, \u03c4\u03b1 \u03bf\u03c0\u03bf\u03af\u03b1 \u03b4\u03cd\u03bd\u03b1\u03bd\u03c4\u03b1\u03b9 \u03bd\u03b1 \u03b4\u03b9\u03b1\u03ba\u03c1\u03af\u03bd\u03bf\u03c5\u03bd \u03ba\u03c5\u03b2\u03b5\u03c1\u03bd\u03bf\u03b5\u03c0\u03b9\u03b8\u03ad\u03c3\u03b5\u03b9\u03c2 \u03ba\u03b1\u03b9 \u03b1\u03bd\u03c9\u03bc\u03b1\u03bb\u03af\u03b5\u03c2 \u03ad\u03bd\u03b1\u03bd\u03c4\u03b9 \u03b5\u03bd\u03cc\u03c2 \u03b5\u03c5\u03c1\u03ad\u03bf\u03c2 \u03c6\u03ac\u03c3\u03bc\u03b1\u03c4\u03bf\u03c2 \u03b2\u03b9\u03bf\u03bc\u03b7\u03c7\u03b1\u03bd\u03b9\u03ba\u03ce\u03bd \u03c0\u03c1\u03c9\u03c4\u03bf\u03ba\u03cc\u03bb\u03bb\u03c9\u03bd \u03b5\u03c0\u03b9\u03ba\u03bf\u03b9\u03bd\u03c9\u03bd\u03af\u03b1\u03c2. \u03a3\u03c4\u03b7 \u03c3\u03c5\u03bd\u03ad\u03c7\u03b5\u03b9\u03b1 \u03c4\u03bf \u03b4\u03b5\u03cd\u03c4\u03b5\u03c1\u03bf \u03a3\u0391\u03a0\u0395 \u03bc\u03c0\u03bf\u03c1\u03b5\u03af \u03bd\u03b1 \u03b1\u03bd\u03b1\u03b3\u03bd\u03c9\u03c1\u03af\u03c3\u03b5\u03b9 \u03bb\u03b5\u03b9\u03c4\u03bf\u03c5\u03c1\u03b3\u03b9\u03ba\u03ad\u03c2 \u03b1\u03bd\u03c9\u03bc\u03b1\u03bb\u03af\u03b5\u03c2 \u03ad\u03bd\u03b1\u03bd\u03c4\u03b9 \u03c4\u03b5\u03c3\u03c3\u03ac\u03c1\u03c9\u03bd \u03c0\u03b5\u03c1\u03b9\u03b2\u03b1\u03bb\u03bb\u03cc\u03bd\u03c4\u03c9\u03bd \u0395\u0394\u0397: (\u03b1) \u03c5\u03b4\u03c1\u03bf\u03b7\u03bb\u03b5\u03ba\u03c4\u03c1\u03b9\u03ba\u03cc \u03b5\u03c1\u03b3\u03bf\u03c3\u03c4\u03ac\u03c3\u03b9\u03bf, (\u03b2) \u03c5\u03c0\u03bf\u03c3\u03c4\u03b1\u03b8\u03bc\u03cc\u03c2, (\u03b3) \u03c3\u03c4\u03b1\u03b8\u03bc\u03cc\u03c2 \u03c0\u03b1\u03c1\u03b1\u03b3\u03c9\u03b3\u03ae\u03c2 \u03b7\u03bb\u03b5\u03ba\u03c4\u03c1\u03b9\u03ba\u03ae\u03c2 \u03b5\u03bd\u03ad\u03c1\u03b3\u03b5\u03b9\u03b1\u03c2 \u03ba\u03b1\u03b9 (\u03b4) \u03ad\u03be\u03c5\u03c0\u03bd\u03bf \u03c3\u03c0\u03af\u03c4\u03b9. \u03a4\u03ad\u03bb\u03bf\u03c2, \u03c4\u03bf \u03a3\u0391\u03a0\u0395 \u03bc\u03b5 \u03b4\u03c5\u03bd\u03b1\u03c4\u03cc\u03c4\u03b7\u03c4\u03b5\u03c2 \u03bf\u03c0\u03c4\u03b9\u03ba\u03bf\u03c0\u03bf\u03af\u03b7\u03c3\u03b7\u03c2 \u03b4\u03cd\u03bd\u03b1\u03c4\u03b1\u03b9 \u03bd\u03b1 \u03b1\u03bd\u03b9\u03c7\u03bd\u03b5\u03cd\u03c3\u03b5\u03b9 \u03ba\u03c5\u03b2\u03b5\u03c1\u03bd\u03bf\u03b5\u03c0\u03b9\u03b8\u03ad\u03c3\u03b5\u03b9\u03c2 \u03ba\u03b1\u03c4\u03ac \u03c4\u03bf\u03c5 \u03c0\u03c1\u03c9\u03c4\u03bf\u03ba\u03cc\u03bb\u03bb\u03bf\u03c5 \u03b5\u03c0\u03b9\u03ba\u03bf\u03b9\u03bd\u03c9\u03bd\u03af\u03b1\u03c2 (Modbus/TCP), \u03c7\u03c1\u03b7\u03c3\u03b9\u03bc\u03bf\u03c0\u03bf\u03b9\u03ce\u03bd\u03c4\u03b1\u03c2 \u03bf\u03c0\u03c4\u03b9\u03ba\u03ad\u03c2 \u03b1\u03bd\u03b1\u03c0\u03b1\u03c1\u03b1\u03c3\u03c4\u03ac\u03c3\u03b5\u03b9\u03c2 \u03ba\u03b1\u03b9 \u03c3\u03c5\u03bd\u03b5\u03c0\u03c4\u03c5\u03b3\u03bc\u03ad\u03bd\u03b1 \u03bd\u03b5\u03c5\u03c1\u03c9\u03bd\u03b9\u03ba\u03ac \u03b4\u03af\u03ba\u03c4\u03c5\u03b1. \u0391\u03be\u03af\u03b6\u03b5\u03b9 \u03bd\u03b1 \u03c3\u03b7\u03bc\u03b5\u03b9\u03c9\u03b8\u03b5\u03af \u03cc\u03c4\u03b9 \u03c4\u03bf \u03c0\u03c1\u03bf\u03c4\u03b5\u03b9\u03bd\u03cc\u03bc\u03b5\u03bd\u03bf \u03a3\u0391\u03a0\u0395 \u03bc\u03b5 \u03b4\u03c5\u03bd\u03b1\u03c4\u03cc\u03c4\u03b7\u03c4\u03b5\u03c2 \u03bf\u03c0\u03c4\u03b9\u03ba\u03bf\u03c0\u03bf\u03af\u03b7\u03c3\u03b7\u03c2 \u03b1\u03ba\u03bf\u03bb\u03bf\u03c5\u03b8\u03b5\u03af \u03bc\u03b9\u03b1 \u03c0\u03c1\u03bf\u03c3\u03ad\u03b3\u03b3\u03b9\u03c3\u03b7 \u03b1\u03c5\u03c4\u03bf\u03b5\u03ba\u03bc\u03ac\u03b8\u03b7\u03c3\u03b7\u03c2, \u03b7 \u03bf\u03c0\u03bf\u03af\u03b1 \u03b4\u03cd\u03bd\u03b1\u03c4\u03b1\u03b9 \u03bd\u03b1 \u03b5\u03c0\u03b1\u03bd\u03b5\u03ba\u03c0\u03b1\u03b9\u03b4\u03b5\u03cd\u03b5\u03b9 \u03c4\u03bf \u03c0\u03c1\u03bf-\u03b5\u03ba\u03c0\u03b1\u03b9\u03b4\u03b5\u03c5\u03bc\u03ad\u03bd\u03bf \u03c3\u03c5\u03bd\u03b5\u03c0\u03c4\u03c5\u03b3\u03bc\u03ad\u03bd\u03bf \u03bd\u03b5\u03c5\u03c1\u03c9\u03bd\u03b9\u03ba\u03cc \u03b4\u03af\u03ba\u03c4\u03c5\u03bf \u03ba\u03b1\u03c4\u03ac \u03c4\u03b7 \u03b4\u03b9\u03ac\u03c1\u03ba\u03b5\u03b9\u03b1 \u03c4\u03b7\u03c2 \u03bb\u03b5\u03b9\u03c4\u03bf\u03c5\u03c1\u03b3\u03af\u03b1\u03c2 \u03c0\u03c1\u03bf\u03b2\u03bb\u03ad\u03c8\u03b5\u03c9\u03bd \u03c3\u03b5 \u03c0\u03c1\u03b1\u03b3\u03bc\u03b1\u03c4\u03b9\u03ba\u03cc \u03c7\u03c1\u03cc\u03bd\u03bf. \u03a4\u03b1 \u03c3\u03c5\u03bc\u03b2\u03ac\u03bd\u03c4\u03b1 \u03b1\u03c3\u03c6\u03ac\u03bb\u03b5\u03b9\u03b1\u03c2 \u03c4\u03c9\u03bd \u03c0\u03c1\u03bf\u03b7\u03b3\u03bf\u03c5\u03bc\u03ad\u03bd\u03c9\u03bd \u03a3\u0391\u03a0\u0395 \u03ba\u03b1\u03bd\u03bf\u03bd\u03b9\u03ba\u03bf\u03c0\u03bf\u03b9\u03bf\u03cd\u03bd\u03c4\u03b1\u03b9, \u03c3\u03c5\u03c3\u03c7\u03b5\u03c4\u03af\u03b6\u03bf\u03bd\u03c4\u03b1\u03b9 \u03ba\u03b1\u03b9 \u03bc\u03b5\u03c4\u03c1\u03b9\u03ac\u03b6\u03bf\u03bd\u03c4\u03b1\u03b9 \u03b1\u03c0\u03cc \u03c4\u03b7 \u039c\u03b7\u03c7\u03b1\u03bd\u03ae \u039a\u03b1\u03bd\u03bf\u03bd\u03b9\u03ba\u03bf\u03c0\u03bf\u03af\u03b7\u03c3\u03b7\u03c2, \u03a3\u03c5\u03c3\u03c7\u03ad\u03c4\u03b9\u03c3\u03b7\u03c2 \u03ba\u03b1\u03b9 \u039c\u03b5\u03c4\u03c1\u03b9\u03b1\u03c3\u03bc\u03bf\u03cd (\u039c\u039a\u03a3\u039c). \u03a3\u03c5\u03b3\u03ba\u03b5\u03ba\u03c1\u03b9\u03bc\u03ad\u03bd\u03b1, \u03b3\u03b9\u03b1 \u03c4\u03b7 \u03b4\u03b9\u03b1\u03b4\u03b9\u03ba\u03b1\u03c3\u03af\u03b1 \u03c3\u03c5\u03c3\u03c7\u03ad\u03c4\u03b9\u03c3\u03b7\u03c2 \u03c7\u03c1\u03b7\u03c3\u03b9\u03bc\u03bf\u03c0\u03bf\u03b9\u03bf\u03cd\u03bd\u03c4\u03b1\u03b9 \u03c0\u03c1\u03bf\u03c3\u03b1\u03c1\u03bc\u03bf\u03c3\u03bc\u03ad\u03bd\u03bf\u03b9 \u03ba\u03b1\u03bd\u03cc\u03bd\u03b5\u03c2 \u03b1\u03c3\u03c6\u03ac\u03bb\u03b5\u03b9\u03b1\u03c2, \u03b5\u03bd\u03ce \u03bf \u03bc\u03b5\u03c4\u03c1\u03b9\u03b1\u03c3\u03bc\u03cc\u03c2 \u03b2\u03b1\u03c3\u03af\u03b6\u03b5\u03c4\u03b1\u03b9 \u03c3\u03c4\u03b7\u03bd \u03c4\u03b5\u03c7\u03bd\u03bf\u03bb\u03bf\u03b3\u03af\u03b1 \u03ba\u03b1\u03b8\u03bf\u03c1\u03b9\u03b6\u03cc\u03bc\u03b5\u03bd\u03b7 \u03b1\u03c0\u03cc \u03bb\u03bf\u03b3\u03b9\u03c3\u03bc\u03b9\u03ba\u03cc. \u03a3\u03c5\u03b3\u03ba\u03b5\u03ba\u03c1\u03b9\u03bc\u03ad\u03bd\u03b1, \u03b7 \u039c\u039a\u03a3\u039c \u03c5\u03b9\u03bf\u03b8\u03b5\u03c4\u03b5\u03af \u03ad\u03bd\u03b1\u03bd \u03c0\u03c1\u03ac\u03ba\u03c4\u03bf\u03c1\u03b1 \u03b5\u03bd\u03b9\u03c3\u03c7\u03c5\u03c4\u03b9\u03ba\u03ae\u03c2 \u03bc\u03ac\u03b8\u03b7\u03c3\u03b7\u03c2, \u03bf \u03bf\u03c0\u03bf\u03af\u03bf\u03c2 \u03ba\u03b1\u03b8\u03bf\u03b4\u03b7\u03b3\u03b5\u03af \u03c4\u03b7\u03bd \u03c4\u03b5\u03c7\u03bd\u03bf\u03bb\u03bf\u03b3\u03af\u03b1 \u03ba\u03b1\u03b8\u03bf\u03c1\u03b9\u03b6\u03cc\u03bc\u03b5\u03bd\u03b7 \u03b1\u03c0\u03cc \u03bb\u03bf\u03b3\u03b9\u03c3\u03bc\u03b9\u03ba\u03cc \u03c3\u03c7\u03b5\u03c4\u03b9\u03ba\u03ac \u03bc\u03b5 \u03c4\u03b9\u03c2 \u03ba\u03b1\u03c4\u03ac\u03bb\u03bb\u03b7\u03bb\u03b5\u03c2 \u03b1\u03bc\u03c5\u03bd\u03c4\u03b9\u03ba\u03ad\u03c2 \u03b5\u03bd\u03ad\u03c1\u03b3\u03b5\u03b9\u03b5\u03c2. \u03a4\u03ad\u03bb\u03bf\u03c2, \u03b7 \u039c\u039a\u03a3\u039c \u03c0\u03b5\u03c1\u03b9\u03bb\u03b1\u03bc\u03b2\u03ac\u03bd\u03b5\u03b9 \u03ad\u03bd\u03b1\u03bd \u03b5\u03be\u03b5\u03bb\u03b9\u03b3\u03bc\u03ad\u03bd\u03bf \u03bc\u03b7\u03c7\u03b1\u03bd\u03b9\u03c3\u03bc\u03cc \u03b1\u03bd\u03ac\u03c0\u03c4\u03c5\u03be\u03b7\u03c2 \u03c0\u03b1\u03b3\u03af\u03b4\u03c9\u03bd \u03b5\u03b9\u03c3\u03b2\u03bf\u03bb\u03ce\u03bd, \u03bf \u03bf\u03c0\u03bf\u03af\u03bf\u03c2 \u03b2\u03b1\u03c3\u03af\u03b6\u03b5\u03c4\u03b1\u03b9 \u03c3\u03b5 \u03ad\u03bd\u03b1 \u03c0\u03b1\u03b9\u03c7\u03bd\u03af\u03b4\u03b9 \u03b1\u03c3\u03c6\u03ac\u03bb\u03b5\u03b9\u03b1\u03c2 \u03bc\u03b5\u03c4\u03b1\u03be\u03cd \u03b4\u03cd\u03bf \u03c0\u03b1\u03b9\u03ba\u03c4\u03ce\u03bd: (\u03b1) \u03b5\u03c0\u03b9\u03c4\u03b9\u03b8\u03ad\u03bc\u03b5\u03bd\u03bf\u03c2(-\u03bf\u03b9) \u03ba\u03b1\u03b9 (\u03b2) \u03b1\u03bc\u03c5\u03bd\u03cc\u03bc\u03b5\u03bd\u03bf\u03c2(-\u03bf\u03b9). \u0393\u03b9\u03b1 \u03c4\u03bf \u03c0\u03c1\u03bf\u03b7\u03b3\u03bf\u03cd\u03bc\u03b5\u03bd\u03bf \u03c0\u03b1\u03af\u03b3\u03bd\u03b9\u03bf, \u03c0\u03c1\u03bf\u03c3\u03b4\u03b9\u03bf\u03c1\u03af\u03b6\u03b5\u03c4\u03b1\u03b9 \u03b7 \u03b9\u03c3\u03bf\u03c1\u03c1\u03bf\u03c0\u03af\u03b1 (Nash), \u03b5\u03bd\u03ce \u03cc\u03c4\u03b1\u03bd \u03b7 \u03b9\u03c3\u03bf\u03c1\u03c1\u03bf\u03c0\u03af\u03b1 Nash) \u03b4\u03b5\u03bd \u03b5\u03af\u03bd\u03b1\u03b9 \u03b4\u03b9\u03b1\u03b8\u03ad\u03c3\u03b9\u03bc\u03b7 \u03bc\u03b5 \u03b2\u03ac\u03c3\u03b7 \u03c4\u03b9\u03c2 \u03c0\u03b1\u03c1\u03b1\u03bc\u03ad\u03c4\u03c1\u03bf\u03c5\u03c2 \u03c4\u03bf\u03c5 \u03c0\u03b1\u03b9\u03b3\u03bd\u03af\u03bf\u03c5, \u03c0\u03b1\u03c1\u03ad\u03c7\u03bf\u03bd\u03c4\u03b1\u03b9 \u03b4\u03cd\u03bf \u03b5\u03bd\u03b1\u03bb\u03bb\u03b1\u03ba\u03c4\u03b9\u03ba\u03ad\u03c2 \u03c0\u03c1\u03bf\u03c3\u03b5\u03b3\u03b3\u03af\u03c3\u03b5\u03b9\u03c2: (\u03b1) \u03b1\u03bd\u03ac\u03c0\u03c4\u03c5\u03be\u03b7 \u03c0\u03b1\u03b3\u03af\u03b4\u03c9\u03bd \u03b5\u03b9\u03c3\u03b2\u03bf\u03bb\u03ce\u03bd \u03bc\u03b5 \u03b2\u03ac\u03c3\u03b7 \u03b1\u03bd\u03ac\u03bb\u03c5\u03c3\u03b7 \u03bc\u03b5\u03b3\u03b9\u03c3\u03c4\u03bf\u03c0\u03bf\u03af\u03b7\u03c3\u03b7\u03c2 \u03ba\u03b1\u03b9 \u03b5\u03bb\u03b1\u03c7\u03b9\u03c3\u03c4\u03bf\u03c0\u03bf\u03af\u03b7\u03c3\u03b7\u03c2 \u03ba\u03b1\u03b9 (\u03b2) \u03b1\u03bd\u03ac\u03c0\u03c4\u03c5\u03be\u03b7 \u03c0\u03b1\u03b3\u03af\u03b4\u03c9\u03bd \u03b5\u03b9\u03c3\u03b2\u03bf\u03bb\u03ce\u03bd \u03bc\u03b5 \u03b2\u03ac\u03c3\u03b7 \u03c4\u03b5\u03c7\u03bd\u03b7\u03c4\u03ae \u03bd\u03bf\u03b7\u03bc\u03bf\u03c3\u03cd\u03bd\u03b7.\u03a3\u03c4\u03b7 \u03c3\u03c5\u03bd\u03ad\u03c7\u03b5\u03b9\u03b1, \u03bc\u03b5\u03c4\u03ac \u03c4\u03b7\u03bd \u03c0\u03b5\u03c1\u03b9\u03b3\u03c1\u03b1\u03c6\u03ae \u03c4\u03c9\u03bd \u03c0\u03c1\u03bf\u03c4\u03b5\u03b9\u03bd\u03cc\u03bc\u03b5\u03bd\u03c9\u03bd \u03bb\u03cd\u03c3\u03b5\u03c9\u03bd \u03b1\u03bd\u03af\u03c7\u03bd\u03b5\u03c5\u03c3\u03b7\u03c2 \u03ba\u03b1\u03b9 \u03c0\u03c1\u03cc\u03bb\u03b7\u03c8\u03b7\u03c2, \u03c4\u03bf \u039a\u03b5\u03c6\u03ac\u03bb\u03b1\u03b9\u03bf 6 \u03c3\u03c5\u03bd\u03bf\u03c8\u03af\u03b6\u03b5\u03b9 \u03c4\u03b1 \u03b1\u03bd\u03c4\u03af\u03c3\u03c4\u03bf\u03b9\u03c7\u03b1 \u03b1\u03c0\u03bf\u03c4\u03b5\u03bb\u03ad\u03c3\u03bc\u03b1\u03c4\u03b1 \u03b1\u03be\u03b9\u03bf\u03bb\u03cc\u03b3\u03b7\u03c3\u03b7\u03c2. \u0395\u03b9\u03b4\u03b9\u03ba\u03cc\u03c4\u03b5\u03c1\u03b1, \u03b1\u03c1\u03c7\u03b9\u03ba\u03ac \u03bf\u03c1\u03af\u03b6\u03b5\u03c4\u03b1\u03b9 \u03ad\u03bd\u03b1 \u03c3\u03c5\u03b3\u03ba\u03b5\u03ba\u03c1\u03b9\u03bc\u03ad\u03bd\u03bf \u03c0\u03bb\u03b1\u03af\u03c3\u03b9\u03bf \u03b1\u03be\u03b9\u03bf\u03bb\u03cc\u03b3\u03b7\u03c3\u03b7\u03c2, \u03c0\u03b1\u03c1\u03bf\u03c5\u03c3\u03b9\u03ac\u03b6\u03bf\u03bd\u03c4\u03b1\u03c2 (\u03b1) \u03c4\u03b1 \u03c0\u03b5\u03c1\u03b9\u03b2\u03ac\u03bb\u03bb\u03bf\u03bd\u03c4\u03b1 \u03b1\u03be\u03b9\u03bf\u03bb\u03cc\u03b3\u03b7\u03c3\u03b7\u03c2, (\u03b2) \u03c4\u03b1 \u03c3\u03cd\u03bd\u03bf\u03bb\u03b1 \u03b4\u03b5\u03b4\u03bf\u03bc\u03ad\u03bd\u03c9\u03bd, (\u03b3) \u03c4\u03b9\u03c2 \u03c3\u03c5\u03b3\u03ba\u03c1\u03b9\u03c4\u03b9\u03ba\u03ad\u03c2 \u03bc\u03b5\u03b8\u03cc\u03b4\u03bf\u03c5\u03c2 \u03ba\u03b1\u03b9 (\u03b4) \u03c4\u03b9\u03c2 \u03bc\u03b5\u03c4\u03c1\u03b9\u03ba\u03ad\u03c2 \u03b1\u03be\u03b9\u03bf\u03bb\u03cc\u03b3\u03b7\u03c3\u03b7\u03c2. \u03a3\u03c4\u03b7 \u03c3\u03c5\u03bd\u03ad\u03c7\u03b5\u03b9\u03b1, \u03c3\u03c5\u03bd\u03bf\u03c8\u03af\u03b6\u03bf\u03bd\u03c4\u03b1\u03b9 \u03ba\u03b1\u03b9 \u03b4\u03b9\u03b5\u03c1\u03b5\u03c5\u03bd\u03ce\u03bd\u03c4\u03b1\u03b9 \u03c4\u03b1 \u03b1\u03c0\u03bf\u03c4\u03b5\u03bb\u03ad\u03c3\u03bc\u03b1\u03c4\u03b1 \u03b1\u03be\u03b9\u03bf\u03bb\u03cc\u03b3\u03b7\u03c3\u03b7\u03c2 \u03b3\u03b9\u03b1 \u03ba\u03ac\u03b8\u03b5 \u03c3\u03c5\u03c3\u03c4\u03b1\u03c4\u03b9\u03ba\u03cc \u03c3\u03c4\u03bf\u03b9\u03c7\u03b5\u03af\u03bf \u03c4\u03bf\u03c5 \u03c0\u03c1\u03bf\u03c4\u03b5\u03b9\u03bd\u03cc\u03bc\u03b5\u03bd\u03bf\u03c5 \u03a3\u0394\u03a0\u03a3\u0391 \u03bc\u03b5 \u03b4\u03c5\u03bd\u03b1\u03c4\u03cc\u03c4\u03b7\u03c4\u03b1 \u03ba\u03b1\u03b8\u03bf\u03c1\u03b9\u03b6\u03cc\u03bc\u03b5\u03bd\u03b7 \u03b1\u03c0\u03cc \u03bb\u03bf\u03b3\u03b9\u03c3\u03bc\u03b9\u03ba\u03cc, \u03b5\u03bd\u03ce \u03c4\u03b1 \u03c0\u03b1\u03c1\u03b1\u03c1\u03c4\u03ae\u03bc\u03b1\u03c4\u03b1 \u039c-\u039d \u03c0\u03b1\u03c1\u03ad\u03c7\u03bf\u03c5\u03bd \u03c4\u03b7 \u03bb\u03b5\u03c0\u03c4\u03bf\u03bc\u03b5\u03c1\u03ae \u03c3\u03c5\u03b3\u03ba\u03c1\u03b9\u03c4\u03b9\u03ba\u03ae \u03b1\u03bd\u03ac\u03bb\u03c5\u03c3\u03b7.\u03a4\u03ad\u03bb\u03bf\u03c2, \u03c4\u03bf \u039a\u03b5\u03c6\u03ac\u03bb\u03b1\u03b9\u03bf 7 \u03bf\u03bb\u03bf\u03ba\u03bb\u03b7\u03c1\u03ce\u03bd\u03b5\u03b9 \u03c4\u03b7\u03bd \u03c0\u03b1\u03c1\u03bf\u03cd\u03c3\u03b1 \u03b4\u03b9\u03b4\u03b1\u03ba\u03c4\u03bf\u03c1\u03b9\u03ba\u03ae \u03b4\u03b9\u03b1\u03c4\u03c1\u03b9\u03b2\u03ae, \u03c0\u03b1\u03c1\u03ad\u03c7\u03bf\u03bd\u03c4\u03b1\u03c2 \u03b5\u03c0\u03af\u03c3\u03b7\u03c2 \u03c0\u03b9\u03b8\u03b1\u03bd\u03ad\u03c2 \u03ba\u03b1\u03c4\u03b5\u03c5\u03b8\u03cd\u03bd\u03c3\u03b5\u03b9\u03c2 \u03b3\u03b9\u03b1 \u03bc\u03b5\u03bb\u03bb\u03bf\u03bd\u03c4\u03b9\u03ba\u03ad\u03c2 \u03b5\u03c1\u03b5\u03c5\u03bd\u03b7\u03c4\u03b9\u03ba\u03ad\u03c2 \u03b5\u03c1\u03b3\u03b1\u03c3\u03af\u03b5\u03c2 \u03c3\u03c4\u03bf \u03c3\u03c5\u03b3\u03ba\u03b5\u03ba\u03c1\u03b9\u03bc\u03ad\u03bd\u03bf \u03c4\u03bf\u03bc\u03ad\u03b1. \u0395\u03b9\u03b4\u03b9\u03ba\u03cc\u03c4\u03b5\u03c1\u03b1, \u03b1\u03c6\u03bf\u03cd \u03c3\u03c5\u03b6\u03b7\u03c4\u03b7\u03b8\u03bf\u03cd\u03bd \u03c4\u03b1 \u03b2\u03b1\u03c3\u03b9\u03ba\u03ac \u03b1\u03c0\u03bf\u03c4\u03b5\u03bb\u03ad\u03c3\u03bc\u03b1\u03c4\u03b1 \u03c0\u03bf\u03c5 \u03bc\u03b5\u03bb\u03b5\u03c4\u03ae\u03b8\u03b7\u03ba\u03b1\u03bd \u03ba\u03b1\u03b9 \u03c5\u03bb\u03bf\u03c0\u03bf\u03b9\u03ae\u03b8\u03b7\u03ba\u03b1\u03bd \u03c3\u03c4\u03bf \u03c0\u03bb\u03b1\u03af\u03c3\u03b9\u03bf \u03c4\u03bf\u03c5 \u03c0\u03b1\u03c1\u03cc\u03bd\u03c4\u03bf\u03c2 \u03b4\u03b9\u03b4\u03b1\u03ba\u03c4\u03bf\u03c1\u03b9\u03ba\u03bf\u03cd \u03c0\u03c1\u03bf\u03b3\u03c1\u03ac\u03bc\u03bc\u03b1\u03c4\u03bf\u03c2, \u03c3\u03c4\u03b7 \u03c3\u03c5\u03bd\u03ad\u03c7\u03b5\u03b9\u03b1, \u03b1\u03bd\u03b1\u03bb\u03cd\u03bf\u03bd\u03c4\u03b1\u03b9 \u03c0\u03ad\u03bd\u03c4\u03b5 \u03b5\u03c1\u03b5\u03c5\u03bd\u03b7\u03c4\u03b9\u03ba\u03ad\u03c2 \u03ba\u03b1\u03c4\u03b5\u03c5\u03b8\u03cd\u03bd\u03c3\u03b5\u03b9\u03c2 \u03b3\u03b9\u03b1 \u03bc\u03b5\u03bb\u03bb\u03bf\u03bd\u03c4\u03b9\u03ba\u03ad\u03c2 \u03b5\u03c1\u03b5\u03c5\u03bd\u03b7\u03c4\u03b9\u03ba\u03ad\u03c2 \u03c0\u03c1\u03bf\u03c3\u03c0\u03ac\u03b8\u03b5\u03b9\u03b5\u03c2: (\u03b1) \u0391\u03bd\u03af\u03c7\u03bd\u03b5\u03c5\u03c3\u03b7 \u0395\u03b9\u03c3\u03b2\u03bf\u03bb\u03ce\u03bd \u03ba\u03b1\u03b9 \u0391\u03bd\u03c9\u03bc\u03b1\u03bb\u03b9\u03ce\u03bd \u03bc\u03b5 \u03a7\u03c1\u03ae\u03c3\u03b7 \u039f\u03bc\u03bf\u03c3\u03c0\u03bf\u03bd\u03b4\u03b9\u03b1\u03ba\u03ae\u03c2 \u039c\u03ac\u03b8\u03b7\u03c3\u03b7\u03c2, (\u03b2) \u039c\u03b7\u03c7\u03b1\u03bd\u03b9\u03c3\u03bc\u03bf\u03af \u03a3\u03c5\u03c3\u03c7\u03ad\u03c4\u03b9\u03c3\u03b7\u03c2 \u03bc\u03b5 \u03a7\u03c1\u03ae\u03c3\u03b7 \u039c\u03ac\u03b8\u03b7\u03c3\u03b7\u03c2 \u03a3\u03c5\u03c3\u03c7\u03b5\u03c4\u03af\u03c3\u03b5\u03c9\u03bd, (\u03b3) \u03a3\u03c4\u03c1\u03b1\u03c4\u03b7\u03b3\u03b9\u03ba\u03ad\u03c2 \u039c\u03b5\u03c4\u03c1\u03b9\u03b1\u03c3\u03bc\u03bf\u03cd \u03bc\u03b5 \u03a4\u03b5\u03c7\u03bd\u03b9\u03ba\u03ad\u03c2 \u0395\u03bd\u03b9\u03c3\u03c7\u03c5\u03c4\u03b9\u03ba\u03ae\u03c2 \u039c\u03ac\u03b8\u03b7\u03c3\u03b7\u03c2, (\u03b4) \u039c\u03b7\u03c7\u03b1\u03bd\u03b9\u03c3\u03bc\u03bf\u03af \u0391\u03bd\u03ac\u03ba\u03c4\u03b7\u03c3\u03b7\u03c2 \u03bc\u03b5 \u03c7\u03c1\u03ae\u03c3\u03b7 \u03a4\u03b5\u03c7\u03bd\u03bf\u03bb\u03bf\u03b3\u03af\u03b1\u03c2 \u039a\u03b1\u03b8\u03bf\u03c1\u03b9\u03b6\u03cc\u03bc\u03b5\u03bd\u03b7\u03c2 \u03b1\u03c0\u03cc \u039b\u03bf\u03b3\u03b9\u03c3\u03bc\u03b9\u03ba\u03cc \u03bc\u03b5 \u03a7\u03c1\u03ae\u03c3\u03b7 \u039d\u03b5\u03c5\u03c1\u03c9\u03bd\u03b9\u03ba\u03ce\u03bd \u0394\u03b9\u03ba\u03c4\u03cd\u03c9\u03bd \u0393\u03c1\u03ac\u03c6\u03c9\u03bd \u03ba\u03b1\u03b9 (\u03b5) \u03a4\u03b5\u03c7\u03bd\u03b9\u03ba\u03ad\u03c2 \u0395\u03be\u03ae\u03b3\u03b7\u03c3\u03b7\u03c2 \u03ba\u03b1\u03b9 \u0391\u03bd\u03ac\u03bb\u03c5\u03c3\u03b7\u03c2 \u03a4\u03b5\u03c7\u03bd\u03b7\u03c4\u03ae\u03c2 \u039d\u03bf\u03b7\u03bc\u03bf\u03c3\u03cd\u03bd\u03b7\u03c2 \u03b3\u03b9\u03b1 \u039c\u03bf\u03bd\u03c4\u03ad\u03bb\u03b1 \u0391\u03bd\u03af\u03c7\u03bd\u03b5\u03c5\u03c3\u03b7\u03c2 \u03ba\u03b1\u03b9 \u039c\u03b5\u03c4\u03c1\u03b9\u03b1\u03c3\u03bc\u03bf\u03cd \u03a4\u03b5\u03c7\u03bd\u03b7\u03c4\u03ae\u03c2 \u039d\u03bf\u03b7\u03bc\u03bf\u03c3\u03cd\u03bd\u03b7\u03c2."} | 16 | +{"work_id": 3042799967, "title": "Smartly Handling Renewable Energy Instability in Supporting A Cloud Datacenter", "abstract": "The size and energy consumption of datacenters have been increasing significantly over the past years. As a result, datacenters' increasing electricity monetary cost, energy consumption and energy harmful gas emissions have become a severe problem. Renewable energy supply is widely seen as a promising solution. However, the instability of renewable energy brings about a new challenge since insufficient energy supply may lead to job running interruptions or failures. Though previous works attempt to more accurately predict the amount of produced renewable energy, due to the instability of its influencing factors (e.g., wind, temperature), sufficient renewable energy supply cannot be always guaranteed. To handle this problem, in this paper, we propose allocating jobs with the same service-level-objective (SLO) level to the same physical machine (PM) group, and power each PM group with renewable energy generators that have probability no less than its SLO to produce the amount no less than its energy demand. It ensures that insufficient renewable energy supply will not lead to SLO violations. We use a deep learning technique to predict the probability of producing amount no less than each value of each renewable energy source and predict the energy demands of each PM area. We formulate an optimization problem: how to match renewable energy resources with different instabilities to different PM groups as energy supply in order to minimize the number of SLO violations (due to interruption from insufficient renewable energy supply), total energy monetary cost and total carbon emission. We then use reinforcement learning method and linear programming method to solve the optimization problem. The real trace driven experiments show that our method can achieve much lower SLO violations, total energy monetary cost and total carbon emission compared to other methods."} | ||
| 10 | −{"work_id": 7161556515, "title": "DeepServeCB: SLO-Aware and Cost-Aware Elastic Scheduling for Serverless Multi-Tenant LLM Inference", "abstract": "Deploying large language model (LLM) inference services in serverless, multi-tenant environments present compounding challenges: cold start latency, GPU memory fragmentation, inter-tenant resource contention, and unpredictable tail latency. Existing systems optimize individual aspects but fail to jointly address service-level objective (SLO) compliance and cost efficiency under dynamic, heterogeneous workloads. We present DeepServeCB, an elastic scheduling framework that formulates the joint SLO--cost optimization as a contextual bandit problem. The system introduces a Request Profiler that extracts online features---prompt length, historical KV-cache hit ratio, and predicted generation length---and feeds them into a contextual bandit agent that adaptively selects batch sizes, concurrency levels, KV-cache eviction policies, and warm-standby strategies. We evaluate DeepServeCB on ShareGPT and BurstGPT traces using LLaMA-2-13B and Mixtral-8x7B models on NVIDIA A100 GPUs. Results show that DeepServeCB reduces P99 latency by 38--62% compared to state-of-the-art baselines while improving GPU utilization by 14--23% and reducing per-request cost by up to 27%, with only a modest increase in scheduling overhead."} | 17 | +{"work_id": 4392909747, "title": "Cloud Computing: Principles And Paradigms", "abstract": "Capturing the current state of the art in Cloud Computing technology and applications is the main goal of this book. The book\u2019s secondary objective is to chart a course for future studies and technological developments that will pave the way for the establishment of a worldwide marketplace for cloud computing services catering to commercial, government, academic, and consumer needs. The book is designed to be a reference for a wide range of readers, including systems architects, developers, practitioners, new researchers, and graduate students."} | ||
| 11 | −{"work_id": 4395047770, "title": "Deep reinforcement learning-based methods for resource scheduling in cloud computing: a review and future directions", "abstract": "Abstract With the acceleration of the Internet in Web 2.0, Cloud computing is a new paradigm to offer dynamic, reliable and elastic computing services. Efficient scheduling of resources or optimal allocation of requests is one of the prominent issues in emerging Cloud computing. Considering the growing complexity of Cloud computing, future Cloud systems will require more effective resource management methods. In some complex scenarios with difficulties in directly evaluating the performance of scheduling solutions, classic algorithms (such as heuristics and meta-heuristics) will fail to obtain an effective scheme. Deep reinforcement learning (DRL) is a novel method to solve scheduling problems. Due to the combination of deep learning and reinforcement learning (RL), DRL has achieved considerable performance in current studies. To focus on this direction and analyze the application prospect of DRL in Cloud scheduling, we provide a comprehensive review for DRL-based methods in resource scheduling of Cloud computing. Through the theoretical formulation of scheduling and analysis of RL frameworks, we discuss the advantages of DRL-based methods in Cloud scheduling. We also highlight different challenges and discuss the future directions existing in the DRL-based Cloud scheduling."} | 18 | +{"work_id": 2562507292, "title": "Internet of Things Applications - From Research and Innovation to Market Deployment", "abstract": "ISBN : 9788793102941"} | ||
| 12 | −{"work_id": 4386585104, "title": "ACCESS: Advancing Innovation", "abstract": "As the National Science Foundation evolves its investments in cyberinfrastructure, it has made a significant investment in the ACCESS (Advanced Cyberinfrastructure Coordination Ecosystem: Services & Support) program instantiating a novel set of services along with a novel governance and management model. Research cyberinfrastructure (CI) is a key catalyst for discovery and innovation and plays a critical role in ensuring U.S. leadership in science and engineering, economic competitiveness, and national security, consistent with NSF\u2019s mission. Funding of a set of awards through the ACCESS program has established a suite of CI coordination services targeted at supporting a broad and diverse set of requirements, researchers, and usage modalities spanning all areas of science and engineering research and education complemented by support for the collective and coordinated operation of the overall ACCESS program."} | 19 | +{"work_id": 4387316367, "title": "Ontological Approach to a Knowledge Graph Construction in a Semantic Library", "abstract": "Abstract The paper considers an approach to a knowledge graph construction based on the ontological representation of scientific subject areas. The presentation is based on concepts related to information and data mining, such as knowledge, knowledge extraction, domain ontology, scientific domain, thesaurus, semantic digital library, user information need, ontological design method and, in fact, the knowledge graph. The digital semantic library LibMeta is presented as a repository of various structured data with the possibility of their integration with other data sources. Assumes the possibility of specifying personal content by describing a local subject area within LibMeta. The ontology of the content of the semantic library acts as a means of formalization. This paper addresses the experience of building semantic libraries based on thesauri and ontological design. Building ontologies based on the thesaurus of the subject area LibMeta allows us to say that the presence of internal semantic links ensures the consistency and reliability of search results, which is a necessary condition for extracting scientific knowledge. The digital library ontology defines the data structure of the library content. Each data element loaded into the library can be associated with an ontology vertex (top) that determines the position of the data element in the ontology. Based on the ontology links and the links defined at the design stage, you can build a data graph. On the example of the ontology of the LibMeta semantic library, the technology of forming the knowledge graph of modern applications in mathematics is discussed. The problems of filling a graph, embedding in a graph, extracting links and nodes of a graph are discussed."} | ||
| 13 | −{"work_id": 4361200200, "title": "Spatial Data Science", "abstract": "Spatial Data Science introduces fundamental aspects of spatial data that every data scientist should know before they start working with spatial data. These aspects include how geometries are represented, coordinate reference systems (projections, datums), the fact that the Earth is round and its consequences for analysis, and how attributes of geometries can relate to geometries. In the second part of the book, these concepts are illustrated with data science examples using the R language. In the third part, statistical modelling approaches are demonstrated using real world data examples. After reading this book, the reader will be well equipped to avoid a number of major spatial data analysis errors. The book gives a detailed explanation of the core spatial software packages for R: sf for simple feature access, and stars for raster and vector data cubes \u2013 array data with spatial and temporal dimensions. It also shows how geometrical operations change when going from a flat space to the surface of a sphere, which is what sf and stars use when coordinates are not projected (degrees longitude/latitude). Separate chapters detail a variety of plotting approaches for spatial maps using R, and different ways of handling very large vector or raster (imagery) datasets, locally, in databases, or in the cloud. The data used and all code examples are freely available online from https://r-spatial.org/book/. The solutions to the exercises can be found here: https://edzer.github.io/sdsr_exercises/."} | 20 | +{"work_id": 2545990795, "title": "QUIC: A UDP-Based Multiplexed and Secure Transport", "abstract": "QUIC is a multiplexed and secure transport protocol that runs on top\nof UDP. QUIC builds on past transport experience, and implements\nmechanisms that make it useful as a modern general-purpose transport\nprotocol. Using UDP as the basis of QUIC is intended to address\ncompatibility issues with legacy clients and middleboxes. QUIC\nauthenticates all of its headers, preventing third parties from from\nchanging them. QUIC encrypts most of its headers, thereby limiting\nprotocol evolution to QUIC endpoints only. Therefore, middleboxes, in\nlarge part, are not required to be updated as new protocol versions\nare deployed. This document describes the core QUIC protocol,\nincluding the conceptual design, wire format, and mechanisms of the\nQUIC protocol for connection establishment, stream multiplexing,\nstream and connection-level flow control, and data reliability.\nAccompanying documents describe QUIC's loss recovery and congestion\ncontrol, and the use of TLS 1.3 for key negotiation."} | ||
| 14 | −{"work_id": 4229658977, "title": "Google Colaboratory", "abstract": "Google Colaboratory more commonly referred to as \u201cGoogle Colab\u201d or just simply \u201cColab\u201d is a research project for prototyping machine learning models on powerful hardware options such as GPUs and TPUs. It provides a serverless Jupyter notebook environment for interactive development. Google Colab is free to use like other G Suite products."} | 21 | +{"work_id": 4398201281, "title": "Situ-Oracle: A Learning-Based Situation Analysis Framework for Blockchain-Based IoT Systems", "abstract": "The decentralized nature of blockchain enables data traceability, transparency, and immutability as complementary security features to the existing Internet of Things (IoT) systems. These Blockchain-based IoT (BIoT) systems aim to mitigate security risks such as malicious control, data leakage, and dishonesty often found in traditional cloud-based, vendor-specific IoT networks. As we steadily advance into the era of situation-aware IoT, the use of machine learning (ML) techniques has become essential for synthesizing situations based on sensory contexts. However, the challenge to integrate learning-based situation awareness with BIoT systems restricts the full potential of such integration. This is primarily due to the conflicts between the deterministic nature of smart contracts and the non-deterministic nature of machine learning, as well as the high costs of conducting machine learning on blockchain. To address the challenge, we propose a framework named Situ-Oracle. With the framework, a computation oracle of the blockchain ecosystem is leveraged to provide situation analysis as a service, based on Recurrent Neural Network (RNN)-based learning models tailored for the Situ model, and specifically designed smart contracts are deployed as intermediary communication channels between the IoT devices and the computation oracle. We used smart homes as a case study to demonstrate the framework design. Subsequently, system-wide evaluations were conducted over a physically constructed BIoT system. The results indicate that the proposed framework achieves better situation analysis accuracy (above 95%) and improves gas consumption as well as network throughput and latency when compared to baseline systems (on-chain learning or off-chain model verification). Overall, the paper presents a promising approach for improving situation analysis for BIoT systems, with potential applications in various domains such as smart homes, healthcare, and industrial automation."} | ||
| 15 | −{"work_id": 4407389811, "title": "Integrating Artificial Intelligence Agents with the Internet of Things for Enhanced Environmental Monitoring: Applications in Water Quality and Climate Data", "abstract": "The integration of artificial intelligence (AI) agents with the Internet of Things (IoT) has marked a transformative shift in environmental monitoring and management, enabling advanced data gathering, in-depth analysis, and more effective decision making. This comprehensive literature review explores the integration of AI and IoT technologies within environmental sciences, with a particular focus on applications related to water quality and climate data. The methodology involves a systematic search and selection of relevant studies, followed by thematic, meta-, and comparative analyses to synthesize current research trends, benefits, challenges, and gaps. The review highlights how AI enhances IoT\u2019s data collection capabilities through advanced predictive modeling, real-time analytics, and automated decision making, thereby improving the accuracy, timeliness, and efficiency of environmental monitoring systems. Key benefits identified include enhanced data precision, cost efficiency, scalability, and the facilitation of proactive environmental management. Nevertheless, this integration encounters substantial obstacles, including issues related to data quality, interoperability, security, technical constraints, and ethical concerns. Future developments point toward enhancements in AI and IoT technologies, the incorporation of innovations like blockchain and edge computing, the potential formation of global environmental monitoring systems, and greater public involvement through citizen science initiatives. Overcoming these challenges and embracing new technological trends could enable AI and IoT to play a pivotal role in strengthening environmental sustainability and resilience."} | 22 | +{"work_id": 2926987861, "title": "A Survey of Distributed Consensus Protocols for Blockchain Networks", "abstract": "Since the inception of Bitcoin, cryptocurrencies and the underlying blockchain technology have attracted an increasing interest from both academia and industry. Among various core components, consensus protocol is the defining technology behind the security and performance of blockchain. From incremental modifications of Nakamoto consensus protocol to innovative alternative consensus mechanisms, many consensus protocols have been proposed to improve the performance of the blockchain network itself or to accommodate other specific application needs. In this survey, we present a comprehensive review and analysis on the state-of-the-art blockchain consensus protocols. To facilitate the discussion of our analysis, we first introduce the key definitions and relevant results in the classic theory of fault tolerance which help to lay the foundation for further discussion. We identify five core components of a blockchain consensus protocol, namely, block proposal, block validation, information propagation, block finalization, and incentive mechanism. A wide spectrum of blockchain consensus protocols are then carefully reviewed accompanied by algorithmic abstractions and vulnerability analyses. The surveyed consensus protocols are analyzed using the five-component framework and compared with respect to different performance metrics. These analyses and comparisons provide us new insights in the fundamental differences of various proposals in terms of their suitable application scenarios, key assumptions, expected fault tolerance, scalability, drawbacks and trade-offs. We believe this survey will provide blockchain developers and researchers a comprehensive view on the state-of-the-art consensus protocols and facilitate the process of designing future protocols."} | ||
| 16 | −{"work_id": 4406207083, "title": "Mobile Edge Intelligence for Large Language Models: A Contemporary Survey", "abstract": "On-device large language models (LLMs), referring to running LLMs on edge devices, have raised considerable interest owing to their superior privacy, reduced latency, and bandwidth saving. Nonetheless, the capabilities of on-device LLMs are intrinsically constrained by the limited capacity of edge devices compared to the much more powerful cloud centers. To bridge the gap between cloud-based and on-device AI, mobile edge intelligence (MEI) presents a viable solution to this problem by provisioning AI capabilities within the edge of mobile networks with improved privacy and latency relative to cloud computing. MEI sits between on-device AI and cloud-based AI, featuring wireless communications and more powerful computing resources than end devices. This article provides a contemporary survey on harnessing MEI for LLMs. We first cover the preliminaries of LLMs, starting with LLMs and MEI, followed by resource-efficient LLM techniques. We then illustrate several killer applications to demonstrate the need for deploying LLMs at the network edge and present an architectural overview of MEI for LLMs (MEI4LLM). Subsequently, we delve into various aspects of MEI4LLM, extensively covering edge LLM caching and delivery, edge LLM training, and edge LLM inference. Finally, we identify future research opportunities. We aim to inspire researchers in the field to leverage mobile edge computing to facilitate LLM deployment in close proximity to users, thereby unleashing the potential of LLMs across various privacy-and delay-sensitive applications."} | ||||
| 17 | −{"work_id": 2602956630, "title": "Internet of Things Strategic Research Roadmap", "abstract": "Internet of Things (IoT) is an integrated part of Future Internet including existing and evolving Internet and network developments and could be conceptually defined as a dynamic global network infrastructure with self configuring capabilities based on standard and interoperable communication protocols where physical and virtual \u201cthings\u201d have identities, physical attributes, and virtual personalities, use intelligent interfaces, and are seamlessly integrated into the information network."} | ||||
| 18 | −{"work_id": 2950865323, "title": "Edge Intelligence: Paving the Last Mile of Artificial Intelligence With Edge Computing", "abstract": "With the breakthroughs in deep learning, the recent years have witnessed a booming of artificial intelligence (AI) applications and services, spanning from personal assistant to recommendation systems to video/audio surveillance. More recently, with the proliferation of mobile computing and Internet of Things (IoT), billions of mobile and IoT devices are connected to the Internet, generating zillions bytes of data at the network edge. Driving by this trend, there is an urgent need to push the AI frontiers to the network edge so as to fully unleash the potential of the edge big data. To meet this demand, edge computing, an emerging paradigm that pushes computing tasks and services from the network core to the network edge, has been widely recognized as a promising solution. The resulted new interdiscipline, edge AI or edge intelligence (EI), is beginning to receive a tremendous amount of interest. However, research on EI is still in its infancy stage, and a dedicated venue for exchanging the recent advances of EI is highly desired by both the computer system and AI communities. To this end, we conduct a comprehensive survey of the recent research efforts on EI. Specifically, we first review the background and motivation for AI running at the network edge. We then provide an overview of the overarching architectures, frameworks, and emerging key technologies for deep learning model toward training/inference at the network edge. Finally, we discuss future research opportunities on EI. We believe that this survey will elicit escalating attentions, stimulate fruitful discussions, and inspire further research ideas on EI."} | ||||
| 19 | −{"work_id": 4300092207, "title": "OrbitalBrain: A Distributed Framework for Training ML Models in Space", "abstract": "Earth observation nanosatellites capture high-resolution photos of the Earth in near real-time. These images increasingly support ML applications that are critical for safety and response, such as forest fire and flood detection. However, the downlink bandwidth is limited, resulting in days or weeks of delay from image capture to training. In this work, we propose OrbitalBrain, an efficient in-space distributed ML training framework that leverages limited and predictable satellite compute, bandwidth, and power to intelligently balance data transfer, model aggregation, and local training. Our evaluations demonstrate that OrbitalBrain achieves 1.52\u00d7-12.4\u00d7 speedup in time-to-accuracy while always reaching a higher final model accuracy compared to state-of-the-art ground-based or federated learning baselines. Furthermore, our approach is complementary to satellite imagery capturing and downloading, enhancing the overall efficiency of satellite-based applications."} | ||||
| 20 | −{"work_id": 2593864460, "title": "Billion-Scale Similarity Search with GPUs", "abstract": "Similarity search finds application in database systems handling complex data such as images or videos, which are typically represented by high-dimensional features and require specific indexing structures. This paper tackles the problem of better utilizing GPUs for this task. While GPUs excel at data parallel tasks such as distance computation, prior approaches in this domain are bottlenecked by algorithms that expose less parallelism, such ask-min selection, or make poor use of the memory hierarchy. We propose a novel design fork-selection. We apply it in different similarity search scenarios, by optimizing brute-force, approximate and compressed-domain search based on product quantization. In all these setups, we outperform the state of the art by large margins. Our implementation operates at up to 55 percent of theoretical peak performance, enabling a nearest neighbor implementation that is 8.5 \u00d7 faster than prior GPU state of the art. It enables the construction of a high accuracyk-NN graph on 95 million images from the Yfcc100M dataset in 35 minutes, and of a graph connecting 1 billion vectors in less than 12 hours on 4 Maxwell Titan X GPUs. We have open-sourced our approach for the sake of comparison and reproducibility."} | ||||
| 21 | −{"work_id": 4401806686, "title": "AI revolutionizing industries worldwide: A comprehensive overview of its diverse applications", "abstract": "Artificial Intelligence (AI) technology's rapid advancement has significantly changed various industries' operations. This comprehensive review paper aims to provide readers with a deep understanding of AI's applications & implementations, workings, and potential impacts across different sectors. It also discusses its future, threats, and integration into new policy. Through extensive research on more than 200 research and many other sources, the authors have made every effort to present an accurate overview of the numerous applications of AI nowadays in industries such as agriculture, education, autonomous systems, healthcare, finance, entertainment, transportation, military, manufacturing, and more. The paper explores various AI technologies, including machine learning, deep learning, robotics, big data, the Internet of Things, natural language processing, image processing, object detection, virtual reality, augmented reality, speech recognition, and computer vision. It provides real-world examples of their applications and implementations. Moreover, it highlights and evaluates the future potential, challenges, and limitations associated with the widespread use of AI. Our study incorporates the latest research to offer a comprehensive and nuanced understanding of AI's potential benefits and challenges. This data-driven review case study highlights the immense potential of AI technology and addresses the ethical, societal, and economic considerations related to its implementation."} | ||||
| 22 | −{"work_id": 7118010419, "title": "Optimizing Retail Application Performance: A Systematic Review of Monitoring Tools, Metrics, And Best Practices", "abstract": "The increasing popularity of digitization in retail has emphasized application performance as a critical component of customer satisfaction, business continuity, and operational efficiency. Retail applications today operate in hyper-dynamic environments, where performance can be introduced by concerns such as workload peaks, scaling cloud infrastructure performance, spikes in transactions, and real-time data processing. Poor performance erodes user experience, depletes objectives, and lowers competitive benefit. Although many surveys of cloud or performance monitoring exist, they do not incorporate retail contexts that emphasize customer facing KPIs, seasonal demand variability, and other omnichannel complexities. The current paper seeks to address this gap in research by providing a systematic review of 45 peer-reviewed studies (2015\u20132025) specific to monitoring tools, optimization frameworks, and best practices in retail performance monitoring. The findings in the review synthesize performance monitoring platforms (i.e. Splunk, Datadog, New Relic), log management tools, key performance indicators, performance continuous monitoring, performance visualization, and performance integration into retail systems. The paper also offers comparison evaluations of Amazon and Google Cloud monitoring offerings, as well as limitations for optimization planning, and the effect of intelligent analytics to improve scalability and resiliency. The paper contributes by connecting scholarly viewpoints with practical suggestions, providing a distinctive road map for practitioners and academics to develop and enhance high-performance retail applications in cloud-based corporate settings."} | ||||
| 23 | −{"work_id": 2784822088, "title": "A microservice architecture for the processing of large geospatial data in the Cloud", "abstract": "Mit der wachsenden Zahl an Ger\u00e4ten, die spatio-temporale Informationen aufnehmen k\u00f6nnen sowie immer besser werdenden Sensoren, steigt auch die Menge an Geodaten. Vor der Benutzung m\u00fcssen die rohen gesammelten Informationen verarbeitet werden. Zurzeit greifen Experten auf desktop-basierte Geographische Informationssysteme zur\u00fcck, um Prozessierungsworkflows durchzuf\u00fchren. Allerdings \u00fcbersteigt das Datenvolumen sowie die Komplexit\u00e4t der Verarbeitungsalgorithmen l\u00e4ngst die Kapazit\u00e4t ihrer Workstations. Zurzeit findet ein Paradigmenwechsel von Desktop-L\u00f6sungen zur Cloud statt, aber die Entwickler von Prozessierungsalgorithmen sind oft keine Informatiker und haben deshalb wenig Erfahrung im Bereich Cloud-Computing. Unsere Forschungshypothese ist, dass eine Microservice-Architektur und dom\u00e4nenspezifische Sprachen genutzt werden k\u00f6nnen, um existierende Algorithmen zu orchestrieren und Workflows f\u00fcr die Prozessierung von Geodaten in der Cloud auszuf\u00fchren, und damit eine effiziente Anwendungsentwicklung erm\u00f6glichen und die Erfahrung von Stakeholdern verbessern. Wir pr\u00e4sentieren eine Softwarearchitektur, die Erweiterungspunkte f\u00fcr Prozessierungsalgorithmen (oder Microservices) enth\u00e4lt, eine Workflow-Management-Komponente f\u00fcr die verteilte Service-Orchestrierung, und einen Workflow-Editor basierend auf einer dom\u00e4nenspezifischen Sprache. Ziel ist es, Benutzern und Entwicklern ohne tiefergehendes Wissen in verteilten Systemen den Zugang zur Cloud zu erm\u00f6glichen. Unsere Forschungsmethode basiert auf der Design Science Research Methodology. Wir f\u00fchren eine Analyse der Problemdom\u00e4ne durch und sammeln Anforderungen und Qualit\u00e4tsattribute f\u00fcr unsere Architektur. Um unsere Forschungsziele zu erreichen, entwickeln wir die Architektur sowie Ans\u00e4tze f\u00fcr Workflow-Management und -Modellierung. Wir stellen den Nutzen unserer L\u00f6sung dar, indem wir sie auf zwei praktische Anwendungsf\u00e4lle anwenden. Au\u00dferdem evaluieren wir ihre Qualit\u00e4t anhand von definierten Szenarien. Abschlie\u00dfend f\u00fchren wir eine kritische Bewertung unserer Ergebnisse durch. Unsere wissenschaftlichen Beitr\u00e4ge k\u00f6nnen in drei Bereiche gegliedert werden. Wir pr\u00e4sentieren eine skalierbare und erweiterbare Microservice-Architektur f\u00fcr die Geodatenprozessierung, die eine verteilte Entwicklung erm\u00f6glicht sowie eine hohe Verf\u00fcgbarkeit bietet. Au\u00dferdem pr\u00e4sentieren wir neue Ans\u00e4tze f\u00fcr die Service- Integration und -Orchestrierung in der Cloud sowie regelbasiertes und dynamisches Workflow-Management ohne a priori Wissen im Entwurf. F\u00fcr die Workflow- Modellierung entwickeln wir eine dom\u00e4nenspezifische Sprache sowie eine neue Methode f\u00fcrs Sprachdesign. Die Ergebnisse unserer Arbeit st\u00fctzen unsere Forschungshypothese. Die Microservice- Architektur erm\u00f6glicht eine effiziente Entwicklung eines verteilten Systems. Die dom\u00e4nenspezifische Sprache sowie unser Ansatz zur Service-Integration verbessern die Erfahrung der Stakeholder. Unsere Arbeit stellt einen gro\u00dfen Schritt im Paradigmenwechsel zur Cloud dar und bietet M\u00f6glichkeiten f\u00fcr weitere Forschung."} | ||||
| 24 | −{"work_id": 4394994587, "title": "Recommender Systems in the Era of Large Language Models (LLMs)", "abstract": "With the prosperity of e-commerce and web applications, Recommender Systems (RecSys) have become an indispensable and important component in our daily lives, providing personalized suggestions that cater to user preferences. While Deep Neural Networks (DNNs) have achieved significant advancements in enhancing recommender systems by modeling user-item interactions and incorporating their textual side information, these DNN-based methods still exhibit some limitations, such as difficulties in effectively understanding users' interests and capturing textual side information, inabilities in generalizing to various seen/unseen recommendation scenarios and reasoning on their predictions, etc. Meanwhile, the development of Large Language Models (LLMs), such as ChatGPT and GPT-4, has revolutionized the fields of Natural Language Processing (NLP) and Artificial Intelligence (AI), due to their remarkable abilities in fundamental responsibilities of language understanding and generation, as well as impressive generalization capabilities and reasoning skills. As a result, recent studies have actively attempted to harness the power of LLMs to enhance recommender systems. Given the rapid evolution of this research direction in recommender systems, there is a pressing need for a systematic overview that summarizes existing LLM-empowered recommender systems, so as to provide researchers and practitioners in relevant fields with an in-depth understanding. Therefore, in this survey, we conduct a comprehensive review of LLM-empowered recommender systems from various aspects including pre-training, fine-tuning, and prompting paradigms. More specifically, we first introduce the representative methods to harness the power of LLMs (as a feature encoder) for learning representations of users and items. Then, we systematically review the emerging advanced techniques of LLMs for enhancing recommender systems from three paradigms, namely pre-training, fine-tuning, and prompting. Finally, we comprehensively discuss the promising future directions in this emerging field."} | ||||
| 25 | −{"work_id": 4408156900, "title": "Federated Learning for Cloud and Edge Security: A Systematic Review of Challenges and AI Opportunities", "abstract": "The ongoing evolution of cloud computing requires sustained attention to security, privacy, and compliance issues. The purpose of this paper is to systematically review the current literature regarding the application of federated learning (FL) and artificial intelligence (AI) to improve cloud computing security while preserving privacy, delivering real-time threat detection, and meeting regulatory requirements. The current research follows a systematic literature review (SLR) approach, which examined 30 studies published between 2020 and 2024 and followed the PRISMA 2020 checklist. The analysis shows that FL provides significant privacy risk reduction by 25%, especially in healthcare and similar domains, and it improves threat detection by 40% in critical infrastructure areas. A total of 80% of reviewed implementations showed improved privacy, but challenges like communication overhead and resource limitations persist, with 50% of studies reporting latency issues. To overcome these obstacles, this study also explores some emerging solutions, which include model compression, hybrid federated architectures, and cryptographic enhancements. Additionally, this paper demonstrates the unexploited capability of FL for real-time decision-making in dynamic edge environments and highlights its potential across autonomous systems, Industrial Internet of Things (IIoT), and cybersecurity frameworks. The paper\u2019s proposed insights present a deployment strategy for FL models which enables scalable, secure, and privacy-preserving operations and will enable robust cloud security solutions in the AI era."} | ||||
| 26 | −{"work_id": 3012404397, "title": "Santa Claus Algorithm: Agent-Based Consensus Preprocessing Method for Scalability Improvement in Private Blockchain Environment", "abstract": "\ube44\uc794\ud2f4 \uc7a5\uc560 \ud5c8\uc6a9(BFT: Byzantine Fault Tolerance)\uc740 \ube14\ub85d\uccb4\uc778 \ud658\uacbd\uc5d0\uc11c \uc8fc\ub85c \uc0ac\uc6a9\ub418\uace0 \uc788\ub294 \ube14\ub85d\uccb4\uc778 \ud569\uc758 \uc54c\uace0\ub9ac\uc998 \uc911\uc758 \ud558\ub098\uc774\ub2e4. BFT\ub294 \ud569\uc758\ub97c \ud558\uae30 \uc704\ud574 \ubaa8\ub4e0 \ucc38\uc5ec\uc790\uac00 \ud569\uc758\uc5d0 \ucc38\uc5ec\ud558\ub294 \uad6c\uc870\ub85c \ub418\uc5b4\uc788\uc5b4 \ucc38\uc5ec \ub178\ub4dc\uac00 \ub9ce\uc544\uc9c0\uba74 \ucc98\ub9ac\uc18d\ub3c4\uac00 \ud604\uaca9\ud788 \uac10\uc18c\ud558\ub294 \ud655\uc7a5\uc131\uc758 \ubb38\uc81c\uac00 \uc788\ub2e4. \uc774\ub7ec\ud55c \ubb38\uc81c \ub54c\ubb38\uc5d0 \ub9ce\uc740 \ucc38\uc5ec \ub178\ub4dc\uac00 \uc788\ub294 \ube14\ub85d\uccb4\uc778\uc5d0\uc11c \ube44\uc794\ud2f4 \uc7a5\uc560 \ud5c8\uc6a9\uc744 \uc801\uc6a9\ud558\uae30 \uc704\ud574\uc11c\ub294 \ud655\uc7a5\uc131 \uac1c\uc120\uc774 \ud544\uc218\uc801\uc774\ub2e4. \ubcf8 \uc5f0\uad6c\uc5d0\uc11c\ub294 \ud504\ub77c\uc774\ube57 \ube14\ub85d\uccb4\uc778\uc5d0\uc11c \ud569\uc758 \uc5c6\uc774 \ub370\uc774\ud130\ub97c \uae30\ub85d\ud558\ub2e4\uac00 \uc5d0\uc774\uc804\ud2b8\uac00 \ud569\uc758\uac00 \ud544\uc694\ud55c \uc21c\uac04\uc744 \uc54c\ub824\uc8fc\ub294 \uc804\ucc98\ub9ac \uae30\ubc95\uc744 \uc81c\uc548\ud55c\ub2e4. \uc5d0\uc774\uc804\ud2b8\ub294 \ube14\ub85d\uccb4\uc778\uc758 \ub178\ub4dc\ub97c \ubc29\ubb38\ud558\uba74\uc11c \ub450 \ub2e8\uacc4\uc5d0 \uac78\uccd0 \ud569\uc758\uac00 \ud544\uc694\ud55c \uc21c\uac04\uc744 \uc54c\ub824\uc900\ub2e4. \uccab \ubc88\uc9f8 \ub2e8\uacc4\ub294 \uc9c0\uae08\uae4c\uc9c0 \uae30\ub85d\ub41c \ub370\uc774\ud130\uac00 \ubaa8\ub4e0 \ub178\ub4dc\uc5d0\uc11c \uc77c\uce58\ud558\ub294\uc9c0 \ud655\uc778\ud558\uba70, \ub450 \ubc88\uc9f8 \ub2e8\uacc4\ub294 \uc5b4\ub5a0\ud55c \ub370\uc774\ud130\uac00 \ubd88\uc77c\uce58\ud558\uc5ec \ud569\uc758\uac00 \ud544\uc694\ud55c\uc9c0 \uc54c\ub824\uc900\ub2e4. \uc5d0\uc774\uc804\ud2b8\ub294 \ube14\ub85d\uccb4\uc778 \ub124\ud2b8\uc6cc\ud06c\uc5d0\uc11c \ub3c5\ub9bd\uc801\uc778 \uac1d\uccb4\ub85c\uc11c \ube14\ub85d\uccb4\uc778\uc5d0 \ucc38\uc5ec\ud558\ub294 \uc784\uc758\uc758 \ub178\ub4dc\uc5d0 \uc758\ud574 \uc791\ub3d9\uc774 \ub41c\ub2e4. \ubcf8 \ub17c\ubb38\uc5d0\uc11c\ub294 \uc81c\uc548 \uae30\ubc95\uc744 \ud504\ub77c\uc774\ube57 \ube14\ub85d\uccb4\uc778 \ud658\uacbd\uc5d0\uc11c \uc2e4\uc6a9\uc801 \ube44\uc794\ud2f4 \uc7a5\uc560 \ud5c8\uc6a9(PBFT: Practical Byzantine Fault Tolerance) \ud569\uc758\uc5d0 \uc801\uc6a9\ud55c \uacb0\uacfc \ub178\ub4dc\uc758 \uc218\uac00 \uc99d\uac00\ud568\uc5d0 \ub530\ub77c \ubc18\uc751 \uc2dc\uac04\uc774 \ud3c9\uade0 39% \uac10\uc18c\ud558\uc600\ub2e4\ub294 \uac83\uc744 \uc99d\uba85\ud558\uc600\ub2e4."} | ||||
| 27 | −{"work_id": 2120510885, "title": "The Byzantine generals problem", "abstract": "Abstract The Byzantine Generals Problem requires processes to reach agreement upon a value even though some of them may fad. It is weakened by allowing them to agree upon an \"incorrect \" value if a failure occurs. The transaction eormmt problem for a distributed database Js a special case of the weaker problem. It is shown that, like the original Byzantine Generals Problem, the weak version can be solved only ff fewer than one-third of the processes may fad. Unlike the onginal problem, an approximate solution exists that can tolerate arbaranly many failures."} | ||||
| 28 | −{"work_id": 2795038878, "title": "Datasheets for datasets", "abstract": "Documentation to facilitate communication between dataset creators and consumers."} | ||||
| 29 | −{"work_id": 4387321091, "title": "Efficient Memory Management for Large Language Model Serving with PagedAttention", "abstract": "High throughput serving of large language models (LLMs) requires batching sufficiently many requests at a time. However, existing systems struggle because the key-value cache (KV cache) memory for each request is huge and grows and shrinks dynamically. When managed inefficiently, this memory can be significantly wasted by fragmentation and redundant duplication, limiting the batch size. To address this problem, we propose PagedAttention, an attention algorithm inspired by the classical virtual memory and paging techniques in operating systems. On top of it, we build vLLM, an LLM serving system that achieves (1) near-zero waste in KV cache memory and (2) flexible sharing of KV cache within and across requests to further reduce memory usage. Our evaluations show that vLLM improves the throughput of popular LLMs by 2--4\u00d7 with the same level of latency compared to the state-of-the-art systems, such as FasterTransformer and Orca. The improvement is more pronounced with longer sequences, larger models, and more complex decoding algorithms. vLLM's source code is publicly available at https://github.com/vllm-project/vllm."} | ||||
| 30 | −{"work_id": 4415124086, "title": "The Faiss Library", "abstract": "Vector databases typically manage large collections of embedding vectors. As AI applications are growing rapidly, the number of embeddings that need to be stored and indexed is increasing. The Faiss library is dedicated to vector similarity search, a core functionality of vector databases. Faiss is a toolkit of indexing methods and related primitives used to search, cluster, compress and transform vectors. This paper describes the trade-offs in vector search and the design principles of Faiss in terms of structure, approach to optimization and interfacing. We benchmark key features of the library and discuss a few selected use cases to highlight its broad applicability."} | ||||
| 31 | −{"work_id": 2963507231, "title": "Untangling Blockchain: A Data Processing View of Blockchain Systems", "abstract": "Blockchain technologies are gaining massive momentum in the last few years. Blockchains are distributed ledgers that enable parties who do not fully trust each other to maintain a set of global states. The parties agree on the existence, values, and histories of the states. As the technology landscape is expanding rapidly, it is both important and challenging to have a firm grasp of what the core technologies have to offer, especially with respect to their data processing capabilities. In this paper, we first survey the state of the art, focusing on private blockchains (in which parties are authenticated). We analyze both in-production and research systems in four dimensions: distributed ledger, cryptography, consensus protocol, and smart contract. We then present BLOCKBENCH, a benchmarking framework for understanding performance of private blockchains against data processing workloads. We conduct a comprehensive evaluation of three major blockchain systems based on BLOCKBENCH, namely Ethereum, Parity, and Hyperledger Fabric. The results demonstrate several trade-offs in the design space, as well as big performance gaps between blockchain and database systems. Drawing from design principles of database systems, we discuss several research directions for bringing blockchain performance closer to the realm of databases."} | ||||
| 32 | −{"work_id": 4288083766, "title": "Deep Learning Based Recommender System", "abstract": "With the growing volume of online information, recommender systems have been an effective strategy to overcome information overload. The utility of recommender systems cannot be overstated, given their widespread adoption in many web applications, along with their potential impact to ameliorate many problems related to over-choice. In recent years, deep learning has garnered considerable interest in many research fields such as computer vision and natural language processing, owing not only to stellar performance but also to the attractive property of learning feature representations from scratch. The influence of deep learning is also pervasive, recently demonstrating its effectiveness when applied to information retrieval and recommender systems research. The field of deep learning in recommender system is flourishing. This article aims to provide a comprehensive review of recent research efforts on deep learning-based recommender systems. More concretely, we provide and devise a taxonomy of deep learning-based recommendation models, along with a comprehensive summary of the state of the art. Finally, we expand on current trends and provide new perspectives pertaining to this new and exciting development of the field."} | ||||
| 33 | −{"work_id": 1572499759, "title": "Microservices Architecture", "abstract": "This paper provides a comprehensive overview of microservices architecture, focusing on its implementation.We discuss the core principles, key components, deployment considerations, challenges, and best practices for building robust and scalable microservices-based applications with C#.The paper emphasizes the benefits of adopting microservices, such as improved scalability, agility, and maintainability, while also addressing common challenges like distributed system complexity and data management.Specific examples and code snippets illustrate the practical aspects of implementing microservices with ASP.NET Core and related technologies."} | ||||
| 34 | {"work_id": 3097300053, "title": "Graph Neural Networks in Recommender Systems: A Survey", "abstract": "With the explosive growth of online information, recommender systems play a key role to alleviate such information overload. Due to the important application value of recommender systems, there have always been emerging works in this field. In recommender systems, the main challenge is to learn the effective user/item representations from their interactions and side information (if any). Recently, graph neural network (GNN) techniques have been widely utilized in recommender systems since most of the information in recommender systems essentially has graph structure and GNN has superiority in graph representation learning. This article aims to provide a comprehensive review of recent research efforts on GNN-based recommender systems. Specifically, we provide a taxonomy of GNN-based recommendation models according to the types of information used and recommendation tasks. Moreover, we systematically analyze the challenges of applying GNN on different types of data and discuss how existing works in this field address these challenges. Furthermore, we state new perspectives pertaining to the development of this field. We collect the representative papers along with their open-source implementations in https://github.com/wusw14/GNN-in-RS ."} | 23 | {"work_id": 3097300053, "title": "Graph Neural Networks in Recommender Systems: A Survey", "abstract": "With the explosive growth of online information, recommender systems play a key role to alleviate such information overload. Due to the important application value of recommender systems, there have always been emerging works in this field. In recommender systems, the main challenge is to learn the effective user/item representations from their interactions and side information (if any). Recently, graph neural network (GNN) techniques have been widely utilized in recommender systems since most of the information in recommender systems essentially has graph structure and GNN has superiority in graph representation learning. This article aims to provide a comprehensive review of recent research efforts on GNN-based recommender systems. Specifically, we provide a taxonomy of GNN-based recommendation models according to the types of information used and recommendation tasks. Moreover, we systematically analyze the challenges of applying GNN on different types of data and discuss how existing works in this field address these challenges. Furthermore, we state new perspectives pertaining to the development of this field. We collect the representative papers along with their open-source implementations in https://github.com/wusw14/GNN-in-RS ."} | ||
| 35 | {"work_id": 4401857375, "title": "A Survey on RAG Meeting LLMs: Towards Retrieval-Augmented Large Language Models", "abstract": "As one of the most advanced techniques in AI, Retrieval-Augmented Generation (RAG) can offer reliable and up-to-date external knowledge, providing huge convenience for numerous tasks. Particularly in the era of AI-Generated Content (AIGC), the powerful capacity of retrieval in providing additional knowledge enables RAG to assist existing generative AI in producing high-quality outputs. Recently, Large Language Models (LLMs) have demonstrated revolutionary abilities in language understanding and generation, while still facing inherent limitations such as hallucinations and out-of-date internal knowledge. Given the powerful abilities of RAG in providing the latest and helpful auxiliary information, Retrieval-Augmented Large Language Models (RA-LLMs) have emerged to harness external and authoritative knowledge bases, rather than solely relying on the model's internal knowledge, to augment the quality of the generated content of LLMs. In this survey, we comprehensively review existing research studies in RA-LLMs, covering three primary technical perspectives: Furthermore, to deliver deeper insights, we discuss current limitations and several promising directions for future research. Updated information about this survey can be found at: https://advanced-recommender-systems.github.io/RAG-Meets-LLMs/"} | 24 | {"work_id": 4401857375, "title": "A Survey on RAG Meeting LLMs: Towards Retrieval-Augmented Large Language Models", "abstract": "As one of the most advanced techniques in AI, Retrieval-Augmented Generation (RAG) can offer reliable and up-to-date external knowledge, providing huge convenience for numerous tasks. Particularly in the era of AI-Generated Content (AIGC), the powerful capacity of retrieval in providing additional knowledge enables RAG to assist existing generative AI in producing high-quality outputs. Recently, Large Language Models (LLMs) have demonstrated revolutionary abilities in language understanding and generation, while still facing inherent limitations such as hallucinations and out-of-date internal knowledge. Given the powerful abilities of RAG in providing the latest and helpful auxiliary information, Retrieval-Augmented Large Language Models (RA-LLMs) have emerged to harness external and authoritative knowledge bases, rather than solely relying on the model's internal knowledge, to augment the quality of the generated content of LLMs. In this survey, we comprehensively review existing research studies in RA-LLMs, covering three primary technical perspectives: Furthermore, to deliver deeper insights, we discuss current limitations and several promising directions for future research. Updated information about this survey can be found at: https://advanced-recommender-systems.github.io/RAG-Meets-LLMs/"} | ||
| 36 | {"work_id": 3014294420, "title": "Introduction to Data Mining", "abstract": "Chapter Objectives \u2713 To learn about the concepts of data mining. \u2713 To understand the need for, and the applications of data mining \u2713 To differentiate between data mining and machine learning \u2713 To understand the process of data mining. \u2713 To understand the difference between data mining and machine learning. Introduction to Data Mining In the age of information, an enormous amount of data is available in different industries and organizations. The availability of this massive data is of no use unless it is transformed into valuable information. Otherwise, we are sinking in data, but starving for knowledge. The solution to this problem is data mining which is the extraction of useful information from the huge amount of data that is available. Data mining is defined as follows: \u2018Data mining is a collection of techniques for efficient automated discovery of previously unknown, valid, novel, useful and understandable patterns in large databases. The patterns must be actionable so they may be used in an enterprise's decision making.\u2019 From this definition, the important take aways are: \u2022 Data mining is a process of automated discovery of previously unknown patterns in large volumes of data. \u2022 This large volume of data is usually the historical data of an organization known as the data warehouse. \u2022 Data mining deals with large volumes of data, in Gigabytes or Terabytes of data and sometimes as much as Zetabytes of data (in case of big data). \u2022 Patterns must be valid, novel, useful and understandable. \u2022 Data mining allows businesses to determine historical patterns to predict future behaviour. \u2022 Although data mining is possible with smaller amounts of data, the bigger the data the better the accuracy in prediction. \u2022 There is considerable hype about data mining at present, and the Gartner Group has listed data mining as one of the top ten technologies to watch. Need of Data Mining Data mining is a recent buzz word in the field of Computer Science. It is a computing process that uses intelligent mathematical algorithms to extract the relevant data and computes the probability of future actions. It is also known as Knowledge Discovery in Data (KDD)."} | 25 | {"work_id": 3014294420, "title": "Introduction to Data Mining", "abstract": "Chapter Objectives \u2713 To learn about the concepts of data mining. \u2713 To understand the need for, and the applications of data mining \u2713 To differentiate between data mining and machine learning \u2713 To understand the process of data mining. \u2713 To understand the difference between data mining and machine learning. Introduction to Data Mining In the age of information, an enormous amount of data is available in different industries and organizations. The availability of this massive data is of no use unless it is transformed into valuable information. Otherwise, we are sinking in data, but starving for knowledge. The solution to this problem is data mining which is the extraction of useful information from the huge amount of data that is available. Data mining is defined as follows: \u2018Data mining is a collection of techniques for efficient automated discovery of previously unknown, valid, novel, useful and understandable patterns in large databases. The patterns must be actionable so they may be used in an enterprise's decision making.\u2019 From this definition, the important take aways are: \u2022 Data mining is a process of automated discovery of previously unknown patterns in large volumes of data. \u2022 This large volume of data is usually the historical data of an organization known as the data warehouse. \u2022 Data mining deals with large volumes of data, in Gigabytes or Terabytes of data and sometimes as much as Zetabytes of data (in case of big data). \u2022 Patterns must be valid, novel, useful and understandable. \u2022 Data mining allows businesses to determine historical patterns to predict future behaviour. \u2022 Although data mining is possible with smaller amounts of data, the bigger the data the better the accuracy in prediction. \u2022 There is considerable hype about data mining at present, and the Gartner Group has listed data mining as one of the top ten technologies to watch. Need of Data Mining Data mining is a recent buzz word in the field of Computer Science. It is a computing process that uses intelligent mathematical algorithms to extract the relevant data and computes the probability of future actions. It is also known as Knowledge Discovery in Data (KDD)."} | ||
| 37 | −{"work_id": 4395064458, "title": "Wireless Communications", "abstract": "Now reissued by Cambridge University Press, the updated second edition of this definitive textbook provides an unrivaled introduction to the theoretical and practical fundamentals of wireless communications. Key technical concepts are developed from first principles, and demonstrated to students using over 50 carefully curated worked examples. Over 200 end-of-chapter problems, based on real-world industry scenarios, help cement student understanding. The book provides a thorough coverage of foundational wireless technologies, including wireless local area networks (WLAN), 3G systems, and Bluetooth along with refreshed summaries of recent cellular standards leading to 4G and 5G, insights into the new areas of mobile satellite communications and fixed wireless access, and extra homework problems. Supported online by a solutions manual and lecture slides for instructors, this is the ideal foundation for senior undergraduate and graduate courses in wireless communications."} | ||||
| 38 | {"work_id": 2947690458, "title": "Blockchain for Internet of Things: A Survey", "abstract": "Internet of Things (IoT) is reshaping the incumbent industry to smart industry featured with data-driven decision-making. However, intrinsic features of IoT result in a number of challenges, such as decentralization, poor interoperability, privacy, and security vulnerabilities. Blockchain technology brings the opportunities in addressing the challenges of IoT. In this paper, we investigate the integration of blockchain technology with IoT. We name such synthesis of blockchain and IoT as blockchain of things (BCoT). This paper presents an in-depth survey of BCoT and discusses the insights of this new paradigm. In particular, we first briefly introduce IoT and discuss the challenges of IoT. Then, we give an overview of blockchain technology. We next concentrate on introducing the convergence of blockchain and IoT and presenting the proposal of BCoT architecture. We further discuss the issues about using blockchain for fifth generation beyond in IoT as well as industrial applications of BCoT. Finally, we outline the open research directions in this promising area."} | 26 | {"work_id": 2947690458, "title": "Blockchain for Internet of Things: A Survey", "abstract": "Internet of Things (IoT) is reshaping the incumbent industry to smart industry featured with data-driven decision-making. However, intrinsic features of IoT result in a number of challenges, such as decentralization, poor interoperability, privacy, and security vulnerabilities. Blockchain technology brings the opportunities in addressing the challenges of IoT. In this paper, we investigate the integration of blockchain technology with IoT. We name such synthesis of blockchain and IoT as blockchain of things (BCoT). This paper presents an in-depth survey of BCoT and discusses the insights of this new paradigm. In particular, we first briefly introduce IoT and discuss the challenges of IoT. Then, we give an overview of blockchain technology. We next concentrate on introducing the convergence of blockchain and IoT and presenting the proposal of BCoT architecture. We further discuss the issues about using blockchain for fifth generation beyond in IoT as well as industrial applications of BCoT. Finally, we outline the open research directions in this promising area."} | ||
| 39 | {"work_id": 7123361055, "title": "Toward Edge General Intelligence With Agentic AI and Agentification: Concepts, Technologies, and Future Directions", "abstract": "The rapid expansion of sixth-generation (6G) wireless networks and the Internet of Things (IoT) has catalyzed the evolution from centralized cloud intelligence towards decentralized edge general intelligence. However, traditional edge intelligence methods, characterized by static models and limited cognitive autonomy, fail to address the dynamic, heterogeneous, and resource-constrained scenarios inherent to emerging edge networks. Agentic artificial intelligence (Agentic AI) emerges as a transformative solution, enabling edge systems to autonomously perceive multi-modal environments, reason contextually, and adapt proactively through continuous perception\u2013reasoning\u2013action loops. In this context, the agentification of edge intelligence serves as a key paradigm shift, where distributed entities evolve into autonomous agents capable of collaboration and continual adaptation. This paper presents a comprehensive survey dedicated to Agentic AI and agentification frameworks tailored explicitly for edge general intelligence. First, we systematically introduce foundational concepts and clarify distinctions from traditional edge intelligence paradigms. Second, we analyze important enabling technologies, including compact model compression, energy-aware computing strategies, robust connectivity frameworks, and advanced knowledge representation and reasoning mechanisms. Third, we provide representative case studies demonstrating Agentic AI\u2019s capabilities in low-altitude economy networks, intent-driven networking, vehicular networks, and human-centric service provisioning, supported by numerical evaluations. Furthermore, we identify current research challenges, review emerging open-source platforms, and highlight promising future research directions to guide robust, scalable, and trustworthy Agentic AI deployments for next-generation edge environments."} | 27 | {"work_id": 7123361055, "title": "Toward Edge General Intelligence With Agentic AI and Agentification: Concepts, Technologies, and Future Directions", "abstract": "The rapid expansion of sixth-generation (6G) wireless networks and the Internet of Things (IoT) has catalyzed the evolution from centralized cloud intelligence towards decentralized edge general intelligence. However, traditional edge intelligence methods, characterized by static models and limited cognitive autonomy, fail to address the dynamic, heterogeneous, and resource-constrained scenarios inherent to emerging edge networks. Agentic artificial intelligence (Agentic AI) emerges as a transformative solution, enabling edge systems to autonomously perceive multi-modal environments, reason contextually, and adapt proactively through continuous perception\u2013reasoning\u2013action loops. In this context, the agentification of edge intelligence serves as a key paradigm shift, where distributed entities evolve into autonomous agents capable of collaboration and continual adaptation. This paper presents a comprehensive survey dedicated to Agentic AI and agentification frameworks tailored explicitly for edge general intelligence. First, we systematically introduce foundational concepts and clarify distinctions from traditional edge intelligence paradigms. Second, we analyze important enabling technologies, including compact model compression, energy-aware computing strategies, robust connectivity frameworks, and advanced knowledge representation and reasoning mechanisms. Third, we provide representative case studies demonstrating Agentic AI\u2019s capabilities in low-altitude economy networks, intent-driven networking, vehicular networks, and human-centric service provisioning, supported by numerical evaluations. Furthermore, we identify current research challenges, review emerging open-source platforms, and highlight promising future research directions to guide robust, scalable, and trustworthy Agentic AI deployments for next-generation edge environments."} | ||
| 40 | {"work_id": 3037795158, "title": "Applications of digital technology in COVID-19 pandemic planning and response", "abstract": "With high transmissibility and no effective vaccine or therapy, COVID-19 is now a global pandemic. Government-coordinated efforts across the globe have focused on containment and mitigation, with varying degrees of success. Countries that have maintained low COVID-19 per-capita mortality rates appear to share strategies that include early surveillance, testing, contact tracing, and strict quarantine. The scale of coordination and data management required for effective implementation of these strategies has-in most successful countries-relied on adopting digital technology and integrating it into policy and health care. This Viewpoint provides a framework for the application of digital technologies in pandemic management and response, highlighting ways in which successful countries have adopted these technologies for pandemic planning, surveillance, testing, contact tracing, quarantine, and health care."} | 28 | {"work_id": 3037795158, "title": "Applications of digital technology in COVID-19 pandemic planning and response", "abstract": "With high transmissibility and no effective vaccine or therapy, COVID-19 is now a global pandemic. Government-coordinated efforts across the globe have focused on containment and mitigation, with varying degrees of success. Countries that have maintained low COVID-19 per-capita mortality rates appear to share strategies that include early surveillance, testing, contact tracing, and strict quarantine. The scale of coordination and data management required for effective implementation of these strategies has-in most successful countries-relied on adopting digital technology and integrating it into policy and health care. This Viewpoint provides a framework for the application of digital technologies in pandemic management and response, highlighting ways in which successful countries have adopted these technologies for pandemic planning, surveillance, testing, contact tracing, quarantine, and health care."} | ||
| 41 | −{"work_id": 4323539384, "title": "Scientific dataset recommendation with semantic techniques", "abstract": "Scientific datasets are important in scientific research. Researchers always want to find a way to improve their research. Data discovery and reuse is a recent and popular way of finding more scientific datasets to help researchers. There is much current research work for data discovery and reuse. Nevertheless, most of these works are limited because researchers only trust and reuse data through social networks (such as colleagues or collaborators). Also, the scientific data from social networks bring limitations. For instance, they will only recommend data that they consider helpful. However, one scientist's useful data sometimes might be another's noisy data. A dataset search engine is a solution to help researchers find data outside their social networks by exploring scientific datasets in open data repositories or hubs. Such a dataset search engine typically returns related or relevant datasets based on a keyword query from researchers. Several existing dataset search engines already provide millions of open datasets from open-access sources. However, the performance of a dataset search engine is highly related to the quality of the keyword queries submitted by researchers. For instance, two different queries with the same meaning would get different returns from the same dataset search engine. The main question of this thesis is how to find more relevant scientific datasets from a query on a dataset search engine. A new idea is provided as the solution with dataset recommendation, which is adding one step, \"if you like this dataset, do you also like these other datasets,\" after researchers or users submitted a query to a dataset search engine. Users submit keywords for query to a dataset search engine and then get returned list of datasets. Users can then tell the dataset search engine which returned dataset they like, and the dataset search engine will say, \"If you like this dataset, you would also like those other datasets,\" to recommend more datasets. This thesis aims to help dataset search engines with such scientific dataset recommendations using Semantic Web technologies. As mentioned, the main idea of this thesis is \"if you like this dataset, you would also like that other dataset\". This thesis states the challenges and possibilities of using Semantic Web technologies on scientific dataset recommendation, as well as explores 1) how ontologies can be used for dataset recommendation, and 2) how knowledge graphs can be used for dataset recommendation? These two questions are addressed in six chapters. A scientific item (dataset or paper) recommendation benchmark was provided during the exploring work of this thesis to provide a standard for evaluating scientific item recommendation methods. This benchmark contains a large-scale corpus with millions of datasets and papers as well as the trusted links between them. Also, a collection of entity embeddings was created in the work of this thesis. These embeddings are scientific item embeddings by using knowledge graph embedding on the citation network from Microsoft Academic knowledge graph."} | 29 | +{"work_id": 2251066406, "title": "Bypassing Races in Live Applications with Execution Filters", "abstract": "Deployed multithreaded applications contain many races because these applications are difficult to write, test, and debug. Worse, the number of races in deployed applications may drastically increase due to the rise of multicore hardware and the immaturity of current race detectors.LOOM is a live-workaround system designed to quickly and safely bypass application races at runtime. LOOM provides a flexible and safe language for developers to write execution filters that explicitly synchronize code. It then uses an evacuation algorithm to safely install the filters to live applications to avoid races. It reduces its performance overhead using hybrid instrumentation that combines static and dynamic instrumentation.We evaluated LOOM on nine real races from a diverse set of six applications, including MySQL and Apache. Our results show that (1) LOOM can safely fix all evaluated races in a timely manner, thereby increasing application availability; (2) LOOM incurs little performance overhead; (3) LOOM scales well with the number of application threads; and (4) LOOM is easy to use."} | ||
| 42 | −{"work_id": 3148181069, "title": "Classification Based on Decision Tree Algorithm for Machine Learning", "abstract": "Decision tree classifiers are regarded to be a standout of the most well-known methods to data classification representation of classifiers. Different researchers from various fields and backgrounds have considered the problem of extending a decision tree from available data, such as machine study, pattern recognition, and statistics. In various fields such as medical disease analysis, text classification, user smartphone classification, images, and many more the employment of Decision tree classifiers has been proposed in many ways. This paper provides a detailed approach to the decision trees. Furthermore, paper specifics, such as algorithms/approaches used, datasets, and outcomes achieved, are evaluated and outlined comprehensively. In addition, all of the approaches analyzed were discussed to illustrate the themes of the authors and identify the most accurate classifiers. As a result, the uses of different types of datasets are discussed and their findings are analyzed."} | 30 | +{"work_id": 1500148551, "title": "Time-based Fairness Improves Performance in Multi-rate WLANs", "abstract": "The performance seen by individual clients on a wireless local area network (WLAN) is heavily influenced by the manner in which wireless channel capacity is allocated. The popular MAC protocol DCF (Distributed Coordination Function) used in 802.11 networks provides equal long-term transmission opportunities to competing nodes when all nodes experience similar channel conditions. When similar-sized packets are also used, DCF leads to equal achieved throughputs (throughput-based fairness) among contending nodes. Because of varying indoor channel conditions, the 802.11 standard supports multiple data transmission rates to exploit the trade-off between data rate and bit error rate. This leads to considerable rate diversity, particularly when the network is congested. Under such conditions, throughput-based fairness can lead to drastically reduced aggregate throughput. In this paper, we argue the advantages of time-based fairness, in which each competing node receives an equal share of the wireless channel occupancy time. We demonstrate that this notion of fairness can lead to significant improvements in aggregate performance while still guaranteeing that no node receives worse channel access than it would in a single-rate WLAN. We also describe our algorithm, TBR (Time-based Regulator), which runs on the AP and works with any MAC protocol to provide time-based fairness by regulating packets. Through experiments, we show that our practical and backward compatible implementation of TBR in conjunction with an existing implementation of DCF achieves time-based fairness."} | ||
| 43 | −{"work_id": 3104550706, "title": "Gossip Algorithms for Distributed Signal Processing", "abstract": "Gossip algorithms are attractive for in-network processing in sensor networks because they do not require any specialized routing, there is no bottleneck or single point of failure, and they are robust to unreliable wireless network conditions. Recently, there has been a surge of activity in the computer science, control, signal processing, and information theory communities, developing faster and more robust gossip algorithms and deriving theoretical performance guarantees. This paper presents an overview of recent work in the area. We describe convergence rate results, which are related to the number of transmitted messages and thus the amount of energy consumed in the network for gossiping. We discuss issues related to gossiping over wireless links, including the effects of quantization and noise, and we illustrate the use of gossip algorithms for canonical signal processing tasks including distributed estimation, source localization, and compression."} | 31 | +{"work_id": 2945827670, "title": "Neural Graph Collaborative Filtering", "abstract": "Learning vector representations (aka. embeddings) of users and items lies at the core of modern recommender systems. Ranging from early matrix factorization to recently emerged deep learning based methods, existing efforts typically obtain a user's (or an item's) embedding by mapping from pre-existing features that describe the user (or the item), such as ID and attributes. We argue that an inherent drawback of such methods is that, the collaborative signal, which is latent in user-item interactions, is not encoded in the embedding process. As such, the resultant embeddings may not be sufficient to capture the collaborative filtering effect."} | ||
| 44 | −{"work_id": 4415028496, "title": "Edge-Cloud Collaborative Computing on Distributed Intelligence and Model Optimization: A Survey", "abstract": "Edge-cloud collaborative computing (ECCC) has emerged as a pivotal paradigm for addressing the computational demands of modern intelligent applications, integrating cloud resources with edge devices to enable efficient, low-latency processing across distributed communication networks. Recent advancements in AI, particularly deep learning and large language models (LLMs), have dramatically enhanced the capabilities of these networked systems, yet introduce significant challenges in model deployment, network resource management, and cross-layer optimization. In this survey, we comprehensively examine the intersection of distributed intelligence and model optimization within edge-cloud environments, providing a structured tutorial on fundamental architectures, communication protocols, and network-aware computing frameworks. Additionally, we systematically analyze model optimization approaches, including compression, adaptation, and neural architecture search, alongside AI-driven resource management strategies that balance performance, energy efficiency, and communication overhead across heterogeneous networks. We further explore critical aspects of privacy protection and security enhancement within ECCC systems and examine practical deployments through diverse networked applications, spanning autonomous driving, healthcare, and industrial automation. Performance analysis and benchmarking techniques are also thoroughly explored to establish evaluation standards for these complex distributed systems. Furthermore, the review identifies critical research directions including LLMs deployment, 6G integration, neuromorphic computing, and quantum computing, offering a roadmap for addressing persistent challenges in heterogeneity management, real-time processing, and scalability. By bridging theoretical advancements in communications with practical deployments, this survey offers researchers and practitioners a holistic perspective on leveraging AI to optimize distributed computing environments over next-generation communication networks, fostering innovation in intelligent networked systems."} | 32 | +{"work_id": 2962883549, "title": "Deep Learning in Mobile and Wireless Networking: A Survey", "abstract": "The rapid uptake of mobile devices and the rising popularity of mobile applications and services pose unprecedented demands on mobile and wireless networking infrastructure. Upcoming 5G systems are evolving to support exploding mobile traffic volumes, real-time extraction of fine-grained analytics, and agile management of network resources, so as to maximize user experience. Fulfilling these tasks is challenging, as mobile environments are increasingly complex, heterogeneous, and evolving. One potential solution is to resort to advanced machine learning techniques, in order to help manage the rise in data volumes and algorithm-driven applications. The recent success of deep learning underpins new and powerful tools that tackle problems in this space. In this paper, we bridge the gap between deep learning and mobile and wireless networking research, by presenting a comprehensive survey of the crossovers between the two areas. We first briefly introduce essential background and state-of-the-art in deep learning techniques with potential applications to networking. We then discuss several techniques and platforms that facilitate the efficient deployment of deep learning onto mobile systems. Subsequently, we provide an encyclopedic review of mobile and wireless networking research based on deep learning, which we categorize by different domains. Drawing from our experience, we discuss how to tailor deep learning to mobile environments. We complete this survey by pinpointing current challenges and open future directions for research."} | ||
| 45 | −{"work_id": 4395483946, "title": "Generative AI and the future of higher education: a threat to academic integrity or reformation? Evidence from multicultural perspectives", "abstract": "Abstract In recent years, higher education (HE) globally has witnessed extensive adoption of technology, particularly in teaching and research. The emergence of generative Artificial Intelligence (GenAI) further accelerates this trend. However, the increasing sophistication of GenAI tools has raised concerns about their potential to automate teaching and research processes. Despite widespread research on GenAI in various fields, there is a lack of multicultural perspectives on its impact and concerns in HE. This study addresses this gap by examining the usage, benefits, and concerns of GenAI in higher education from a multicultural standpoint. We employed an online survey that collected responses from 1217 participants across 76 countries, encompassing a broad range of gender categories, academic disciplines, geographical locations, and cultural orientations. Our findings revealed a high level of awareness and familiarity with GenAI tools among respondents. A significant portion had prior experience and expressed the intention to continue using these tools, primarily for information retrieval and text paraphrasing. The study emphasizes the importance of GenAI integration in higher education, highlighting both its potential benefits and concerns. Notably, there is a strong correlation between cultural dimensions and respondents\u2019 views on the benefits and concerns related to GenAI, including its potential as academic dishonesty and the need for ethical guidelines. We, therefore, argued that responsible use of GenAI tools can enhance learning processes, but addressing concerns may require robust policies that are responsive to cultural expectations. We discussed the findings and offered recommendations for researchers, educators, and policymakers, aiming to promote the ethical and effective integration of GenAI tools in higher education."} | 33 | +{"work_id": 4364375730, "title": "Social Health Protection During the COVID-Pandemic Using IoT", "abstract": "The agenda of this book chapter is to review existing technologies that aid societal health protection and recommend some possible approaches which will assist the mentioned scenario. Automations like big data and artificial intelligence (AI) deployed in healthcare sector can expedite pandemic response in ways that are strenuous to achieve all in all by humans. The sudden epiphany to trace COVID-19 in public has powered the innovation of data dashboards that visually unveil coronavirus epicentres. A cloud-based AI-assisted CT service is being engaged to differentiate pneumonia from the pandemic which dwindles risk factor in the present school of thought of the citizens worldwide. In conclusion, social health protection was an indispensable mechanism in prior to these challenging times and is escalating by prominence for delivering support to individuals during the crisis."} | ||
| 46 | −{"work_id": 4362632858, "title": "Scalability Benchmarking of Cloud-Native Applications Applied to Event-Driven Microservices", "abstract": "Cloud-native applications constitute a recent trend for designing large-scale software systems. This thesis introduces the Theodolite benchmarking method, allowing researchers and practitioners to conduct empirical scalability evaluations of cloud-native applications, their frameworks, configurations, and deployments. The benchmarking method is applied to event-driven microservices, a specific type of cloud-native applications that employ distributed stream processing frameworks to scale with massive data volumes. Extensive experimental evaluations benchmark and compare the scalability of various stream processing frameworks under different configurations and deployments, including different public and private cloud environments. These experiments show that the presented benchmarking method provides statistically sound results in an adequate amount of time. In addition, three case studies demonstrate that the Theodolite benchmarking method can be applied to a wide range of applications beyond stream processing."} | 34 | +{"work_id": 2902511784, "title": "Dynamic data race detection for OpenMP programs", "abstract": "Two concurrent accesses to a shared variable that are unordered by synchronization are said to be a data race if at least one access is a write. Data races cause shared memory parallel programs to behave unpredictably and are typically considered a bug. It is hard to manually identify memory access instructions causing data races in large concurrent programs due to non-deterministic behavior affected by thread schedule. Tools for detecting data races are desired to help application developers debug data races in an efficient way. Dynamic data race detection tools detect data races by monitoring programs as they execute. Building accurate and efficient data race detection tools requires domain knowledge of concurrency control primitives provided by the specific parallel programming model upon which a program is built. OpenMP is the de-facto standard API for node level shared memory parallel programming. The complexity of OpenMP, which includes primitives for managing data environments, SPMD parallelism, work sharing, tasking, mutual exclusion, and ordering, presents a formidable challenge for precise dynamic data race detection. This dissertation describes several techniques that enable accurate dynamic data race detection for OpenMP programs. First, I describe a hybrid data race detection algorithm that allows data race detection to be executed in parallel. Second, I describe an OpenMP task labeling technique that assigns each OpenMP task a label to facilitate OpenMP-aware accurate happens-before analysis. This technique is the foundation for callback functions provided by the OpenMP Tools interface known as OMPT to get notifications about OpenMP synchronization events and create task labels based on a set of label creation rules. Third, I propose techniques for optimizing dynamic data race detection performance via a redundant memory access pruning algorithm, a readers-writer concurrency control protocol for coordinating threads as they maintain access histories for memory locations, and an OpenMP-aware access record management protocol. The second and third contributions combine to form a system called ROMP, which is a dynamic data race detector for OpenMP programs. Experiments with standard data race detection benchmarks shows that ROMP achieves high accuracy for detecting data races in OpenMP programs that contain host-side CPU-centric parallel constructs. Experiments with several OpenMP performance benchmarks show the effectiveness of proposed optimization techniques."} | ||
| 47 | −{"work_id": 3098508067, "title": "Personal volunteer computing", "abstract": "In this dissertation, we articulate the new Personal Volunteer Computing paradigm, that refines Volunteer Computing by focusing on solutions that are personal to the user on multiple dimensions: they target personal projects, they leverage the participation of volunteers from their personal social network, and they are built into personal tools that can be deployed on personal devices and can be easily maintained by a single developer.We then present Pando, a new and first tool for personal volunteer computing written in and for JavaScript, that distributes the application of a function on a stream of inputs into the browsers of participating devices. Pando dynamically scales to new devices, gracefully tolerates sudden disconnections, and is easy to program because it is based on a declarative concurrent programming paradigm, in which the non-determinism of parallel executions is not observable by users. We follow with a more detailed presentation of the implementation of Pando, based on the new Limiter, StreamLender, and DistributedMap abstractions. Our presentation uses a high-level notation, independent of JavaScript and that simplifies reasoning about concurrent aspects, to introduce all the algorithms that implement the Limiter, StreamLender, and DistributedMap abstractions. Because the concurrent aspects make StreamLender challenging to implement, even with a clear description, we present a run-time verification approach to ensure it is correct. The approach is easy to parallelize, with Pando for example, and quickly generates a large number of random executions to ensure a high-probability of correctness. The combination of clear descriptions and testing strategy should make Pando easy to reimplement in other programming environments.We then present a large scope of applications that we implemented for Pando, based on existing libraries and examples. These applications represent various dataflow patterns and show Pando can be used not only for compute-intensive tasks but also for crowd-processing. We then measure the throughput performance of these applications in three networking scenarios: (1) over a local-area Wi-Fi network, with personal laptop and smartphones, (2) over a virtual private network distributed throughout France, with the Grid5000 nodes, and (3) with a wide-area network throughout Europe on the Internet, with the PlanetLab EU nodes. We show personal devices are competitive in all scenarios, sometimes with older devices competing with newer models, and other times with combinations of personal devices outcompeting remote server nodes. The flexible and easy support of all these scenarios is, to the best of our knowledge, a first in the volunteer computing literature. We then present Genet, a new fat-tree overlay for WebRTC that enables Pando to overcome the limits of WebRTC in the number of connections, and showed the resulting combination of Pando and Genet to be able to scale to a thousand browsers in 30-55 seconds on local networks. Those results are possible because the design of Genet only uses local information to deterministically route the WebRTC connection messages, while ensuring the resulting tree is probabilistically balanced.We conclude by outlining new exciting research directions that take into account the limits to growth our society is currently facing. Compared to the current trends in research, these new directions make smaller whole-system designs done by small teams viable again, but bring a stronger focus on leveraging abundant personal computing devices and taking into account the growing importance of efficiently using renewable electricity sources"} | 35 | +{"work_id": 2408538552, "title": "Fused Matrix Factorization with Geographical and Social Influence in Location-Based Social Networks", "abstract": "Recently, location-based social networks (LBSNs), such as Gowalla, Foursquare, Facebook, and Brightkite, etc., have attracted millions of users to share their social friendship and their locations via check-ins. The available check-in information makes it possible to mine users\u2019 preference on locations and to provide favorite recommendations. Personalized Point-of-interest (POI) recommendation is a significant task in LBSNs since it can help targeted users explore their surroundings as well as help third-party developers to provide personalized services. To solve this task, matrix factorization is a promising tool due to its success in recommender systems. However, previously proposed matrix factorization (MF) methods do not explore geographical influence, e.g., multi-center check-in property, which yields suboptimal solutions for the recommendation. In this paper, to the best of our knowledge, we are the first to fuse MF with geographical and social influence for POI recommendation in LBSNs. We first capture the geographical influence via modeling the probability of a user\u2019s check-in on a location as a Multi-center Gaussian Model (MGM). Next, we include social information and fuse the geographical influence into a generalized matrix factorization framework. Our solution to POI recommendation is efficient and scales linearly with the number of observations. Finally, we conduct thorough experiments on a large-scale real-world LBSNs dataset and demonstrate that the fused matrix factorization framework with MGM utilizes the distance information sufficiently and outperforms other state-of-the-art methods significantly."} | ||
| 48 | −{"work_id": 3092103025, "title": "Bias and Debias in Recommender System: A Survey and Future Directions", "abstract": "While recent years have witnessed a rapid growth of research papers on recommender system (RS) , most of the papers focus on inventing machine learning models to better fit user behavior data. However, user behavior data is observational rather than experimental. This makes various biases widely exist in the data, including but not limited to selection bias, position bias, exposure bias, and popularity bias. Blindly fitting the data without considering the inherent biases will result in many serious issues, e.g., the discrepancy between offline evaluation and online metrics, hurting user satisfaction and trust on the recommendation service, and so on. To transform the large volume of research models into practical improvements, it is highly urgent to explore the impacts of the biases and perform debiasing when necessary. When reviewing the papers that consider biases in RS, we find that, to our surprise, the studies are rather fragmented and lack a systematic organization. The terminology \u201cbias\u201d is widely used in the literature, but its definition is usually vague and even inconsistent across papers. This motivates us to provide a systematic survey of existing work on RS biases. In this paper, we first summarize seven types of biases in recommendation, along with their definitions and characteristics. We then provide a taxonomy to position and organize the existing work on recommendation debiasing. Finally, we identify some open challenges and envision some future directions, with the hope of inspiring more research work on this important yet less investigated topic. The summary of debiasing methods reviewed in this survey can be found at https://github.com/jiawei-chen/RecDebiasing ."} | 36 | +{"work_id": 7118085507, "title": "Retrieval-Augmented Generation for AI-Generated Content: A Survey", "abstract": "Advancements in model algorithms, the growth of foundational models, and access to high-quality datasets have propelled the evolution of Artificial Intelligence Generated Content (AIGC). Despite its notable successes, AIGC still faces hurdles such as updating knowledge, handling long-tail data, mitigating data leakage, and managing high training and inference costs. Retrieval-augmented generation (RAG) has recently emerged as a paradigm to address such challenges. In particular, RAG introduces the information retrieval process, which enhances the generation process by retrieving relevant objects from available data stores, leading to higher accuracy and better robustness. In this paper, we comprehensively review existing efforts that integrate RAG techniques into AIGC scenarios. We first classify RAG foundations according to how the retriever augments the generator, distilling the fundamental abstractions of the augmentation methodologies for various retrievers and generators. This unified perspective encompasses all RAG scenarios, illuminating advancements and pivotal technologies that help with potential future progress. We also summarize additional enhancement methods for RAG, facilitating effective engineering and implementation of RAG systems. Then from another view, we survey practical applications of RAG across different modalities and tasks, offering valuable references for researchers and practitioners. Furthermore, we introduce the benchmarks for RAG, discuss the limitations of current RAG systems, and suggest potential directions for future research."} | ||
| 49 | −{"work_id": 7125650829, "title": "AI Flow: perspectives, scenarios, and approaches", "abstract": "Abstract Pioneered by the foundational information theory by Claude Shannon and the visionary framework of machine intelligence by Alan Turing, the convergent evolution of information and communication technologies (IT/CT) has created an unbroken wave of connectivity and computation. This synergy has sparked a technological revolution, now reaching its peak with large artificial intelligence (AI) models that are reshaping industries and redefining human-machine collaboration. However, the realization of ubiquitous intelligence faces considerable challenges due to substantial resource consumption in large models and high communication bandwidth demands. To address these challenges, AI Flow has been introduced as a multidisciplinary framework that integrates cutting-edge IT and CT advancements, with a particular emphasis on the following three key points. First, device-edge-cloud framework serves as the foundation, which integrates end devices, edge servers, and cloud clusters to optimize scalability and efficiency for low-latency model inference. Second, we introduce the concept of familial models , which refers to a series of different-sized models with aligned hidden features, enabling effective collaboration and the flexibility to adapt to varying resource constraints and dynamic scenarios. Third, connectivity- and interaction-based intelligence emergence is a novel paradigm of AI Flow. By leveraging communication networks to enhance connectivity, the collaboration among AI models across heterogeneous nodes achieves emergent intelligence that surpasses the capability of any single model. The innovations of AI Flow provide enhanced intelligence, timely responsiveness, and ubiquitous accessibility to AI services, paving the way for the tighter fusion of AI techniques and communication systems. These advancements are crucial to numerous application scenarios, including but not limited to embodied AI, wearable devices, and smart cities."} | 37 | +{"work_id": 4315977496, "title": "A Survey of Graph Neural Networks for Recommender Systems: Challenges, Methods, and Directions", "abstract": "Recommender system is one of the most important information services on today\u2019s Internet. Recently, graph neural networks have become the new state-of-the-art approach to recommender systems. In this survey, we conduct a comprehensive review of the literature on graph neural network-based recommender systems. We first introduce the background and the history of the development of both recommender systems and graph neural networks. For recommender systems, in general, there are four aspects for categorizing existing works: stage, scenario, objective, and application. For graph neural networks, the existing methods consist of two categories: spectral models and spatial ones. We then discuss the motivation of applying graph neural networks into recommender systems, mainly consisting of the high-order connectivity, the structural property of data and the enhanced supervision signal. We then systematically analyze the challenges in graph construction, embedding propagation/aggregation, model optimization, and computation efficiency. Afterward and primarily, we provide a comprehensive overview of a multitude of existing works of graph neural network-based recommender systems, following the taxonomy above. Finally, we raise discussions on the open problems and promising future directions in this area. We summarize the representative papers along with their code repositories in https://github.com/tsinghua-fib-lab/GNN-Recommender-Systems ."} | ||
| 50 | −{"work_id": 3045200674, "title": "LightGCN", "abstract": "Graph Convolution Network (GCN) has become new state-of-the-art for collaborative filtering. Nevertheless, the reasons of its effectiveness for recommendation are not well understood. Existing work that adapts GCN to recommendation lacks thorough ablation analyses on GCN, which is originally designed for graph classification tasks and equipped with many neural network operations. However, we empirically find that the two most common designs in GCNs -- feature transformation and nonlinear activation -- contribute little to the performance of collaborative filtering. Even worse, including them adds to the difficulty of training and degrades recommendation performance."} | 38 | +{"work_id": 4293584584, "title": "A Multi-Modal Distributed Real-Time IoT System for Urban Traffic Control (Invited Paper)", "abstract": "Traffic congestion is one of the growing urban problem with associated problems like fuel wastage, loss of lives, and slow productivity. The existing traffic system uses programming logic control (PLC) with round-robin scheduling algorithm. Recent works have proposed IoT-based frameworks that use traffic density of each lane to control traffic movement, but they suffer from low accuracy due to lack of emergency vehicle image datasets for training deep neural networks. In this paper, we propose a novel distributed IoT framework that is based on two observations. The first observation is major structural changes to road are rare. This observation is exploited by proposing a novel two stage vehicle detector that is able to achieve 77% vehicle detection accuracy on UA-DETRAC dataset. The second observation is emergency vehicle have distinct siren sound that is detected using a novel acoustic detection algorithm on an edge device. The proposed system is able to detect emergency vehicles with an average accuracy of 99.4%."} | ||
| 51 | −{"work_id": 4406085118, "title": "Data-centric Artificial Intelligence: A Survey", "abstract": "Artificial Intelligence (AI) is making a profound impact in almost every domain. A vital enabler of its great success is the availability of abundant and high-quality data for building machine learning models. Recently, the role of data in AI has been significantly magnified, giving rise to the emerging concept of data-centric AI . The attention of researchers and practitioners has gradually shifted from advancing model design to enhancing the quality and quantity of the data. In this survey, we discuss the necessity of data-centric AI, followed by a holistic view of three general data-centric goals (training data development, inference data development, and data maintenance) and the representative methods. We also organize the existing literature from automation and collaboration perspectives, discuss the challenges, and tabulate the benchmarks for various tasks. We believe this is the first comprehensive survey that provides a global view of a spectrum of tasks across various stages of the data lifecycle. We hope it can help the readers efficiently grasp a broad picture of this field, and equip them with the techniques and further research ideas to systematically engineer data for building AI systems. A companion list of data-centric AI resources will be regularly updated on https://github.com/daochenzha/data-centric-AI ."} | ||||
| 52 | {"work_id": 4386827074, "title": "Synergizing Artificial Intelligence, 5G, and Cloud Computing for Efficient Energy Conversion Using Agricultural Waste", "abstract": "The combination of artificial intelligence, 5G technology, and cloud computing has altered energy conversion processes, most notably the use of agricultural waste for sustainable energy generation. This book chapter digs into AI, 5G, and cloud computing research and development for efficient energy conversion, environmental concerns, and the viability of agricultural waste as a renewable energy resource. AI technologies provide real-time monitoring and control, while cloud computing enables data analytics and optimization. The synergistic method increases the efficiency of energy conversion, predictability, flexibility, optimization, grid integration, energy storage, and cost reduction. Compatibility, data security, and financial sustainability, on the other hand, must be addressed. The chapter emphasises the importance of this integrated strategy in addressing global energy and environmental challenges."} | 39 | {"work_id": 4386827074, "title": "Synergizing Artificial Intelligence, 5G, and Cloud Computing for Efficient Energy Conversion Using Agricultural Waste", "abstract": "The combination of artificial intelligence, 5G technology, and cloud computing has altered energy conversion processes, most notably the use of agricultural waste for sustainable energy generation. This book chapter digs into AI, 5G, and cloud computing research and development for efficient energy conversion, environmental concerns, and the viability of agricultural waste as a renewable energy resource. AI technologies provide real-time monitoring and control, while cloud computing enables data analytics and optimization. The synergistic method increases the efficiency of energy conversion, predictability, flexibility, optimization, grid integration, energy storage, and cost reduction. Compatibility, data security, and financial sustainability, on the other hand, must be addressed. The chapter emphasises the importance of this integrated strategy in addressing global energy and environmental challenges."} | ||
| 53 | −{"work_id": 4378832451, "title": "Overview of Amazon Web Services", "abstract": "With today\u2019s technological boom, the demand for cloud computing services is increasing day by day. Individuals, companies, and multinational businesses are shifting from self-owned web services to cloud services. Among cloud services providers, the most prominent are Amazon Web Services (AWS), Google Cloud Platform GCP, IBM, and Oracle Cloud."} | ||||
| 54 | {"work_id": 4393370257, "title": "Distributed methods for resource allocation - a passivity-based approach", "abstract": "Since the complexity and scale of systems have been growing in the last years, distributed approaches for control and decision making are becoming more prevalent. This dissertation focuses on an important problem involving distributed control and decision making, the dynamic resource allocation in a network. To address this problem, we explore a consensus--based algorithm that does not require any centralized computation, and that is capable to deal with applications modeled either by dynamical systems or by memoryless functions. The main contribution of our research is to prove, by means of graph theoretical tools and passivity analysis, that the proposed controller asymptotically reaches an optimal solution without the need of full information. In order to illustrate the relevance of our main result, we address several engineering applications including: distributed control for energy saving in smart buildings, management of the customers of an aggregating entity in a smart grid environment, and development of an exact distributed optimization method that deals with resource allocation problems subject to lower--bound constraints. Finally, we explore resource allocation techniques based on classic population dynamics models. In order to make them distributed, we introduce the concept of non--well--mixed population dynamics. We show that these dynamics are capable to deal with constrained information structures that are characterized by non--complete graphs. Although the proposed non--well--mixed population dynamics use partial information, they preserve similar properties of their classic counterpart, which uses full information. Specifically, we prove mass conservation and convergence to Nash equilibrium."} | 40 | {"work_id": 4393370257, "title": "Distributed methods for resource allocation - a passivity-based approach", "abstract": "Since the complexity and scale of systems have been growing in the last years, distributed approaches for control and decision making are becoming more prevalent. This dissertation focuses on an important problem involving distributed control and decision making, the dynamic resource allocation in a network. To address this problem, we explore a consensus--based algorithm that does not require any centralized computation, and that is capable to deal with applications modeled either by dynamical systems or by memoryless functions. The main contribution of our research is to prove, by means of graph theoretical tools and passivity analysis, that the proposed controller asymptotically reaches an optimal solution without the need of full information. In order to illustrate the relevance of our main result, we address several engineering applications including: distributed control for energy saving in smart buildings, management of the customers of an aggregating entity in a smart grid environment, and development of an exact distributed optimization method that deals with resource allocation problems subject to lower--bound constraints. Finally, we explore resource allocation techniques based on classic population dynamics models. In order to make them distributed, we introduce the concept of non--well--mixed population dynamics. We show that these dynamics are capable to deal with constrained information structures that are characterized by non--complete graphs. Although the proposed non--well--mixed population dynamics use partial information, they preserve similar properties of their classic counterpart, which uses full information. Specifically, we prove mass conservation and convergence to Nash equilibrium."} | ||
| 55 | {"work_id": 2974429275, "title": "Blockchain and Federated Learning for Privacy-Preserved Data Sharing in Industrial IoT", "abstract": "The rapid increase in the volume of data generated from connected devices in industrial Internet of Things paradigm, opens up new possibilities for enhancing the quality of service for the emerging applications through data sharing. However, security and privacy concerns (e.g., data leakage) are major obstacles for data providers to share their data in wireless networks. The leakage of private data can lead to serious issues beyond financial loss for the providers. In this article, we first design a blockchain empowered secure data sharing architecture for distributed multiple parties. Then, we formulate the data sharing problem into a machine-learning problem by incorporating privacy-preserved federated learning. The privacy of data is well-maintained by sharing the data model instead of revealing the actual data. Finally, we integrate federated learning in the consensus process of permissioned blockchain, so that the computing work for consensus can also be used for federated training. Numerical results derived from real-world datasets show that the proposed data sharing scheme achieves good accuracy, high efficiency, and enhanced security."} | 41 | {"work_id": 2974429275, "title": "Blockchain and Federated Learning for Privacy-Preserved Data Sharing in Industrial IoT", "abstract": "The rapid increase in the volume of data generated from connected devices in industrial Internet of Things paradigm, opens up new possibilities for enhancing the quality of service for the emerging applications through data sharing. However, security and privacy concerns (e.g., data leakage) are major obstacles for data providers to share their data in wireless networks. The leakage of private data can lead to serious issues beyond financial loss for the providers. In this article, we first design a blockchain empowered secure data sharing architecture for distributed multiple parties. Then, we formulate the data sharing problem into a machine-learning problem by incorporating privacy-preserved federated learning. The privacy of data is well-maintained by sharing the data model instead of revealing the actual data. Finally, we integrate federated learning in the consensus process of permissioned blockchain, so that the computing work for consensus can also be used for federated training. Numerical results derived from real-world datasets show that the proposed data sharing scheme achieves good accuracy, high efficiency, and enhanced security."} | ||
| 56 | −{"work_id": 2897450989, "title": "Blockchain challenges and opportunities: a survey", "abstract": "Blockchain has numerous benefits such as decentralisation, persistency, anonymity and auditability. There is a wide spectrum of blockchain applications ranging from cryptocurrency, financial services, risk management, internet of things (IoT) to public and social services. Although a number of studies focus on using the blockchain technology in various application aspects, there is no comprehensive survey on the blockchain technology in both technological and application perspectives. To fill this gap, we conduct a comprehensive survey on the blockchain technology. In particular, this paper gives the blockchain taxonomy, introduces typical blockchain consensus algorithms, reviews blockchain applications and discusses technical challenges as well as recent advances in tackling the challenges. Moreover, this paper also points out the future directions in the blockchain technology."} | ||||
| 57 | −{"work_id": 4252792641, "title": "PRIORITIZED TASK SCHEDULING IN FOG COMPUTING", "abstract": "Cloud computing is an environment where virtual resources are shared among the many users over network. A user of Cloud services is billed according to pay-per-use model associated with this environment. To keep this bill to a minimum, efficient resource allocation is of great importance. To handle the many requests sent to Cloud by the clients, the tasks need to be processed according to the SLAs defined by the client. The increase in the usage of Cloud services on a daily basis has introduced delays in the transmission of requests. These delays can cause clients to wait for the response of the tasks beyond the deadline assigned. To overcome these concerns, Fog Computing is helpful as it is physically placed closer to the clients. This layer is placed between the client and the Cloud layer, and it reduces the delay in the transmission of the requests, processing and the response sent back to the client greatly. This paper discusses an algorithm which schedules tasks by calculating the priority of a task in the Fog layer. The tasks with higher priority are processed first so that the deadline is met, which makes the algorithm practical and efficient."} | ||||
| 58 | {"work_id": 4322576964, "title": "On the Road to 6G: Visions, Requirements, Key Technologies, and Testbeds", "abstract": "Fifth generation (5G) mobile communication systems have entered the stage of commercial deployment, providing users with new services, improved user experiences as well as a host of novel opportunities to various industries. However, 5G still faces many challenges. To address these challenges, international industrial, academic, and standards organizations have commenced research on sixth generation (6G) wireless communication systems. A series of white papers and survey papers have been published, which aim to define 6G in terms of requirements, application scenarios, key technologies, etc. Although ITU-R has been working on the 6G vision and it is expected to reach a consensus on what 6G will be by mid-2023, the related global discussions are still wide open and the existing literature has identified numerous open issues. This paper first provides a comprehensive portrayal of the 6G vision, technical requirements, and application scenarios, covering the current common understanding of 6G. Then, a critical appraisal of the 6G network architecture and key technologies is presented. Furthermore, existing testbeds and advanced 6G verification platforms are detailed for the first time. In addition, future research directions and open challenges are identified to stimulate the on-going global debate. Finally, lessons learned to date concerning 6G networks are discussed."} | 42 | {"work_id": 4322576964, "title": "On the Road to 6G: Visions, Requirements, Key Technologies, and Testbeds", "abstract": "Fifth generation (5G) mobile communication systems have entered the stage of commercial deployment, providing users with new services, improved user experiences as well as a host of novel opportunities to various industries. However, 5G still faces many challenges. To address these challenges, international industrial, academic, and standards organizations have commenced research on sixth generation (6G) wireless communication systems. A series of white papers and survey papers have been published, which aim to define 6G in terms of requirements, application scenarios, key technologies, etc. Although ITU-R has been working on the 6G vision and it is expected to reach a consensus on what 6G will be by mid-2023, the related global discussions are still wide open and the existing literature has identified numerous open issues. This paper first provides a comprehensive portrayal of the 6G vision, technical requirements, and application scenarios, covering the current common understanding of 6G. Then, a critical appraisal of the 6G network architecture and key technologies is presented. Furthermore, existing testbeds and advanced 6G verification platforms are detailed for the first time. In addition, future research directions and open challenges are identified to stimulate the on-going global debate. Finally, lessons learned to date concerning 6G networks are discussed."} | ||
| 59 | {"work_id": 7160823269, "title": "TokenPool-Scheduler: Token-Level GPU Pooling and Resource Slicing for Multi-Model Co-Location", "abstract": "In the context of GPU scarcity, multi-model and multi-tenant inference services for autoregressive large language models require finer-grained resource sharing to improve utilization and throughput. Existing approaches rely on coarse-grained spatial or temporal multiplexing, which often leads to suboptimal GPU utilization and increased tail latencies. We present TokenPool-Scheduler, a token-level GPU pooling and resource slicing framework that breaks LLM inference execution into fine-grained segments. By employing a token-level cost model and adaptive scheduling policies, TokenPool-Scheduler dynamically determines optimal slice sizes, preemption points, and resource quotas for heterogeneous models. Experimental results demonstrate that TokenPool-Scheduler achieves up to 33% higher GPU utilization and 63% improvement in goodput compared to static allocation schemes, while reducing P99 time-to-first-token (TTFT) latency by 43% under high load (250 req/s per GPU). The system reduces model switching overhead by 69% compared to existing spatial-temporal multiplexing approaches."} | 43 | {"work_id": 7160823269, "title": "TokenPool-Scheduler: Token-Level GPU Pooling and Resource Slicing for Multi-Model Co-Location", "abstract": "In the context of GPU scarcity, multi-model and multi-tenant inference services for autoregressive large language models require finer-grained resource sharing to improve utilization and throughput. Existing approaches rely on coarse-grained spatial or temporal multiplexing, which often leads to suboptimal GPU utilization and increased tail latencies. We present TokenPool-Scheduler, a token-level GPU pooling and resource slicing framework that breaks LLM inference execution into fine-grained segments. By employing a token-level cost model and adaptive scheduling policies, TokenPool-Scheduler dynamically determines optimal slice sizes, preemption points, and resource quotas for heterogeneous models. Experimental results demonstrate that TokenPool-Scheduler achieves up to 33% higher GPU utilization and 63% improvement in goodput compared to static allocation schemes, while reducing P99 time-to-first-token (TTFT) latency by 43% under high load (250 req/s per GPU). The system reduces model switching overhead by 69% compared to existing spatial-temporal multiplexing approaches."} | ||
| 44 | +{"work_id": 2604314403, "title": "Modeling Relational Data with Graph Convolutional Networks", "abstract": "Knowledge graphs enable a wide variety of applications, including question answering and information retrieval. Despite the great effort invested in their creation and maintenance, even the largest (e.g., Yago, DBPedia or Wikidata) remain incomplete. We introduce Relational Graph Convolutional Networks (R-GCNs) and apply them to two standard knowledge base completion tasks: Link prediction (recovery of missing facts, i.e. subject-predicate-object triples) and entity classification (recovery of missing entity attributes). R-GCNs are related to a recent class of neural networks operating on graphs, and are developed specifically to handle the highly multi-relational data characteristic of realistic knowledge bases. We demonstrate the effectiveness of R-GCNs as a stand-alone model for entity classification. We further show that factorization models for link prediction such as DistMult can be significantly improved through the use of an R-GCN encoder model to accumulate evidence over multiple inference steps in the graph, demonstrating a large improvement of 29.8% on FB15k-237 over a decoder-only baseline."} | ||||
| 60 | {"work_id": 7130586201, "title": "Dynamic Event-Triggered Control for Human\u2013Machine Cooperative Systems Based on Dynamic Authority Allocation", "abstract": "This article addresses the challenging problem of constrained optimal control for human\u2013machine systems subject to external disturbances and the bounded rationality of the human operator. To this end, a novel game-theoretic framework is proposed. Unlike monolithic game formulations, the framework uniquely disaggregates the control problem by transforming it into a multifaceted game via logarithmic barrier functions (BFs): it models human\u2013machine cooperation as a positive-sum game oriented toward shared objectives, and disturbance rejection as a zero-sum game tailored for robustness enhancement. To capture the nonideal human decision-making, we integrate the level-$k$reasoning framework to model the operator\u2019s bounded cognitive dynamics. The corresponding coupled Hamilton\u2013Jacobi\u2013Isaacs (HJI) equations for this human\u2013machine game are derived, and critically, a rigorous proof of global asymptotic stability (GAS) for the transformed system is provided, establishing a solid theoretical foundation. For online implementation without requiring prior knowledge of the system dynamics, we develop a resource-efficient learning architecture based on the adaptive dynamic programming (ADP) and a novel dynamic event-triggered mechanism (DETM). A key feature of this architecture is a fuzzy logic-based module for dynamic authority allocation, which adaptively adjusts control sharing in real time. Rigorous analysis demonstrates that all signals in the closed-loop system are uniformly ultimately bounded and that Zeno behavior is precluded. Simulation results are presented to validate the effectiveness and superiority of the proposed control strategy."} | 45 | {"work_id": 7130586201, "title": "Dynamic Event-Triggered Control for Human\u2013Machine Cooperative Systems Based on Dynamic Authority Allocation", "abstract": "This article addresses the challenging problem of constrained optimal control for human\u2013machine systems subject to external disturbances and the bounded rationality of the human operator. To this end, a novel game-theoretic framework is proposed. Unlike monolithic game formulations, the framework uniquely disaggregates the control problem by transforming it into a multifaceted game via logarithmic barrier functions (BFs): it models human\u2013machine cooperation as a positive-sum game oriented toward shared objectives, and disturbance rejection as a zero-sum game tailored for robustness enhancement. To capture the nonideal human decision-making, we integrate the level-$k$reasoning framework to model the operator\u2019s bounded cognitive dynamics. The corresponding coupled Hamilton\u2013Jacobi\u2013Isaacs (HJI) equations for this human\u2013machine game are derived, and critically, a rigorous proof of global asymptotic stability (GAS) for the transformed system is provided, establishing a solid theoretical foundation. For online implementation without requiring prior knowledge of the system dynamics, we develop a resource-efficient learning architecture based on the adaptive dynamic programming (ADP) and a novel dynamic event-triggered mechanism (DETM). A key feature of this architecture is a fuzzy logic-based module for dynamic authority allocation, which adaptively adjusts control sharing in real time. Rigorous analysis demonstrates that all signals in the closed-loop system are uniformly ultimately bounded and that Zeno behavior is precluded. Simulation results are presented to validate the effectiveness and superiority of the proposed control strategy."} | ||
| 61 | −{"work_id": 2122465391, "title": "MapReduce: Simplified Data Processing on Large Cluster", "abstract": "MapReduce is a programming model and an associated implementation for processing and generating large data sets. Users specify a map function that processes a key/value pair to generate a set of intermediate key/value pairs, and a reduce function that merges all intermediate values associated with the same intermediate key. Many real world tasks are expressible in this model, as shown in the paper.\r\n\r\nPrograms written in this functional style are automatically parallelized and executed on a large cluster of commodity machines. The run-time system takes care of the details of partitioning the input data, scheduling the program's execution across a set of machines, handling machine failures, and managing the required inter-machine communication. This allows programmers without any experience with parallel and distributed systems to easily utilize the resources of a large distributed system.\r\n\r\nOur implementation of MapReduce runs on a large cluster of commodity machines and is highly scalable: a typical MapReduce computation processes many terabytes of data on thousands of machines. Programmers find the system easy to use: hundreds of MapReduce programs have been implemented and upwards of one thousand MapReduce jobs are executed on Google's clusters every day."} | ||||
| 62 | −{"work_id": 2962850638, "title": "Logiikka ja vaativuus hajautetussa laskennassa", "abstract": "This dissertation studies the theory of distributed computing. In the distributed setting, computation is carried out by multiple independent computational units. They communicate with neighbouring units and collectively solve a problem. Systems of this kind are widespread in the information society as well as in the natural world: prime examples include the Internet, multi-processor computer systems, the cells of a biological organism and human social networks. Therefore it is important to gain knowledge on the fundamental capabilities and limitations of distributed systems. Our work takes place in the context of deterministic and synchronous message-passing models of distributed computing. Such models abstract away some possible features of distributed systems, such as asynchrony, congestion and faults, while putting emphasis on the amount of communication needed between the units. The computational units are expected to solve a problem related to the structure of the underlying communication network. More specifically, we study the standard LOCAL model, the standard port-numbering model and several weaker variants of the latter. The contributions of this dissertation are two-fold. First, we give new methods for studying distributed computing by establishing a strong connection between several weak variants of the port-numbering model and corresponding variants of modal logic. This makes it possible to apply existing logical tools, such as bisimulation, to understand computation in the distributed setting. We also give a full characterisation of the relationships between the models of computing, which has implications on the side of mathematical logic. Second, we prove the existence of various new non-empty complexity classes. One of our results studies the relationship between time and space complexity, which is a relatively new topic in distributed computing research. We demonstrate the existence of a problem that can be solved in a constant amount of space in a very weak model but nonetheless requires a non-constant amount of time even in a much stronger model of computing. Another result continues the recent success on developing complexity theory for the LOCAL model. We introduce a new technique which shows the existence of an infinite hierarchy of problems with novel time complexities."} | ||||
| 63 | −{"work_id": 4320712473, "title": "The Internet of Things (IoT) in healthcare: Taking stock and moving forward", "abstract": "Recent improvements in the Internet of Things (IoT) have allowed healthcare to evolve rapidly. This article summarizes previous studies on IoT applications in healthcare. A comprehensive review and a bibliometric analysis were performed to objectively summarize the growth of IoT research in healthcare. To begin, 2,990 journal articles were carefully selected for further investigation. These publications were analyzed based on various bibliometric metrics, including publication year, journals, authors, institutions, and countries. Keyword co-occurrence and co-citation networks were generated to unravel significant research hotspots. The findings show that IoT research has received considerable interest from the healthcare community. Based on the results of the keyword co-occurrence network, IoT healthcare applications, blockchain applications, Artificial Intelligence (AI) techniques, 5G telecommunications, as well as data analytics and computing technologies emerged as important topics. The co-citation network analysis reveals other important themes, including authentication schemes, fog computing, cloud-IoT integration, and cognitive smart healthcare. Overall, the review offers scholars an improved understanding of the current status of IoT research in healthcare and identifies knowledge gaps for future research. This review also informs healthcare professionals about the latest developments and applications of IoT in the healthcare sector."} | ||||
| 64 | −{"work_id": 1973501242, "title": "Time, clocks, and the ordering of events in a distributed system", "abstract": "The concept of one event happening before another in a distributed system is examined, and is shown to define a partial ordering of the events. A distributed algorithm is given for synchronizing a system of logical clocks which can be used to totally order the events. The use of the total ordering is illustrated with a method for solving synchronization problems. The algorithm is then specialized for synchronizing physical clocks, and a bound is derived on how far out of synchrony the clocks can become."} | ||||
| 65 | −{"work_id": 2762829140, "title": "Deep Learning based Intrusion Detection System for Internet of Things", "abstract": "With the increase in number of Internet connected devices, security and privacy concerns are the major obstacles impeding the widespread adoption of Internet of Things (IoT). Securing IoT has become a huge area of concern for all, including the consumers, organizations as well as the government. While attacks on any system cannot be fully prevented forever, real-time detection of the attacks are critical to defend the systems in an effective manner. Limited research exists on efficient intrusion detection systems suitable for IoT environment. In this thesis, we propose a novel intrusion detection system that uses machine learning algorithms to detect security anomalies in IoT networks. This detection platform provides security as a service and facilitates interoperability between various network communication protocols used in IoT. We provide a framework of the proposed system and discuss the intrusion detection process in detail. The proposed intrusion detection system is evaluated using both, real network traces for providing a proof-of-concept, and on simulation for providing evidence of its scalability. Our results confirm that the proposed intrusion detection system is capable of detecting real-world intrusions effectively."} | ||||
| 66 | −{"work_id": 2973502831, "title": "Performance Analysis of Proof-of-Elapsed-Time (PoET) Consensus in the Sawtooth Blockchain Framework", "abstract": "Blockchains are distributed ledgers that use a tamper-sensitive, append-only data structure in conjunction with a consensus protocol to enable mutually distrusting parties to maintain a global set of states. A primary barrier to adoption of blockchain technology by industry is the current performance and scalability limitations of these systems, which lag far behind incumbent database systems. Of particular interest are \u201clottery-style\u201d consensus algorithms, which are relatively scalable to many participants but suffer from low throughput (performance). Proof-of-Elapsed-Time (PoET) is one such algorithm with great promise for use in industry, though the parameters that govern its performance have not been well studied. This thesis explores, through simulation, key performance outcomes in PoET blockchain networks implemented with the Hyperledger Sawtooth framework. A better quantitative understanding of the interactions among these system parameters will be crucial for efficiently optimizing real world blockchain networks and facilitating adoption by industry."} | ||||
| 67 | −{"work_id": 4400494356, "title": "Digital health research governance: from FAIR to RE-AIM", "abstract": "This doctoral research aims to develop a governance model for digital health research data to enhance the quality of collected data and translate research outcomes into an integrated framework for planning, implementing, and evaluating public health initiatives. Employing a mixed-methods approach, the study combines qualitative and quantitative methods, qualifying as an exploratory and explanatory study. The specific objectives include proposing the adoption of frameworks and tools to promote a data quality model for scientific research in digital health, developing a tool with data collection, management, and evaluation, and proposing an implementation research model based on digital health principles and guidelines. The work is grounded in FAIR principles and the RE-AIM framework, addressing data quality and governance in health research, focusing on tuberculosis (TB) and rare diseases (RD) in the Brazilian context. The research significantly contributes to the understanding of digital data governance in health, highlighting the importance of standardized practices and collaborative efforts to improve the quality of health research data in Brazil. Challenges addressed include integrating diverse data sources, ensuring security and confidentiality of data, while enhancing public health outcomes through digital innovations. The presented model emphasizes data quality optimization, being fundamental for planning, executing, and evaluating health interventions. The research operates under robust computational research structures and health information systems, ensuring transparent data management. The interdisciplinary nature of the research highlights its significant strength, integrating insights from data science, public health, and health policy, offering a holistic view of the challenges and opportunities in digital health. By creating a unified implementation quality manual, the study provides mechanisms for network collaboration, strengthening robust data management, and promoting a culture of shared practices essential for elevating the overall quality of data in health research."} | ||||
| 68 | −{"work_id": 2103863878, "title": "Majority is not enough", "abstract": "The Bitcoin cryptocurrency records its transactions in a public log called the blockchain. Its security rests critically on the distributed protocol that maintains the blockchain, run by participants called miners. Conventional wisdom asserts that the mining protocol is incentive-compatible and secure against colluding minority groups, that is, it incentivizes miners to follow the protocol as prescribed. We show that the Bitcoin mining protocol is not incentive-compatible. We present an attack with which colluding miners' revenue is larger than their fair share. The attack can have significant consequences for Bitcoin: Rational miners will prefer to join the attackers, and the colluding group will increase in size until it becomes a majority. At this point, the Bitcoin system ceases to be a decentralized currency. Unless certain assumptions are made, selfish mining may be feasible for any coalition size of colluding miners. We propose a practical modification to the Bitcoin protocol that protects Bitcoin in the general case. It prohibits selfish mining by a coalition that command less than 1/4 of the resources. This threshold is lower than the wrongly assumed 1/2 bound, but better than the current reality where a coalition of any size can compromise the system."} | ||||
| 69 | −{"work_id": 2912978522, "title": "Integrated Blockchain and Edge Computing Systems: A Survey, Some Research Issues and Challenges", "abstract": "Blockchain, as the underlying technology of crypto-currencies, has attracted significant attention. It has been adopted in numerous applications, such as smart grid and Internet-of-Things. However, there is a significant scalability barrier for blockchain, which limits its ability to support services with frequent transactions. On the other side, edge computing is introduced to extend the cloud resources and services to be distributed at the edge of the network, but currently faces challenges in its decentralized management and security. The integration of blockchain and edge computing into one system can enable reliable access and control of the network, storage, and computation distributed at the edges, hence providing a large scale of network servers, data storage, and validity computation near the end in a secure manner. Despite the prospect of integrated blockchain and edge computing systems, its scalability enhancement, self organization, functions integration, resource management, and new security issues remain to be addressed before widespread deployment. In this survey, we investigate some of the work that has been done to enable the integrated blockchain and edge computing system and discuss the research challenges. We identify several vital aspects of the integration of blockchain and edge computing: motivations, frameworks, enabling functionalities, and challenges. Finally, some broader perspectives are explored."} | ||||
| 70 | −{"work_id": 3036601975, "title": "In-Kernel Aggregation and Broadcast Acceleration for Distributed Communication", "abstract": "Broadcasting and aggregation dominate the communication overhead in distributed systems, from machine learning training to data analytics. Current acceleration approaches require specialized hardware (RDMA) or dedicated resources (DPDK), limiting their deployment in commodity clouds. However, we present a counter-intuitive alternative: rather than bypassing the kernel, we move operations into it using eBPF. While this imposes severe constraints including no floating-point, limited memory, and stateless execution, we show these restrictions paradoxically drive innovative protocol designs that yield unexpected benefits. We introduce AggBox, which implements broadcast and aggregation operations entirely within eBPF\u2019s constrained environment. Our key innovations include stateless group acknowledgments for reliability, edge quantization for floating-point aggregation using only integer arithmetic, and tail-call chains that create virtual memory beyond eBPF\u2019s 512-byte stack limit. These designs emerge from and exploit the constraints rather than fighting them. AggBox achieves remarkable performance on commodity hardware: 84.5% reduction in broadcast latency, 43\u00d7 speedup for MapReduce workloads, and 56.1% faster ML gradient aggregation, all without specialized NICs or dedicated cores. Beyond performance, our work demonstrates that constrained environments can drive fundamental innovation in protocol design, offering insights for future resource-limited and verified systems."} | ||||
| 71 | {"work_id": 110250037, "title": "The Use of Multimedia Material in Teaching Chinese as a Second Language and Pedagogical Implications", "abstract": "The use of Multimedia materials has been widely accepted as an useful and effective tool in the field of second language acquisition (SLA). Many studies and researchers have examined multimedia material\u2019s effectiveness from a number of aspects, including four skills of language learning: listening, speaking, reading (including vocabulary comprehension) and writing. However, the effectiveness of multimedia material from the aspect of L2 grammar comprehension hasn\u2019t been well explored.\\nThis study examines the effectiveness of multimedia material in teaching second language grammar comprehension among beginning and intermediate-level Chinese learners. In particular, it investigates the relative efficacy of three different modes used in teaching an important Chinese grammar, directional complements: text alone, text with a still picture and text with video clips. The study\u2019s focal issue is to determine which mode or modes \u2014 text alone, text with still picture or text with dynamic video clip \u2014 is most effective in aiding grammar acquisition in both short-term and long-term.\\nThe study employed an immediate post-test and a delayed post-test. The participants were 53 college students, beginning level Chinese language learners who had studied Chinese for a half year, and were naturally assigned to one of the three parallel groups. The three groups differed as to the use of the different mode used to present the teaching material: text-only, text-picture, and text-video.\\nAnalysis of the collected data yielded three main findings. First, learners who received text-video material outperformed those who received text-picture; and learners who received text-picture material outperformed those who received text-only. Secondly, learners who received text-video had significantly better long-term comprehension than the other two groups. Finally, the performance advantage of text-video treatment was particularly significant with more complex target forms.\\nThe results demonstrate that multimedia material can help L2 learners\u2019 grammar comprehension. Text-picture and text-video were more effective than text-only, and text-video material was more effective than text-picture."} | 46 | {"work_id": 110250037, "title": "The Use of Multimedia Material in Teaching Chinese as a Second Language and Pedagogical Implications", "abstract": "The use of Multimedia materials has been widely accepted as an useful and effective tool in the field of second language acquisition (SLA). Many studies and researchers have examined multimedia material\u2019s effectiveness from a number of aspects, including four skills of language learning: listening, speaking, reading (including vocabulary comprehension) and writing. However, the effectiveness of multimedia material from the aspect of L2 grammar comprehension hasn\u2019t been well explored.\\nThis study examines the effectiveness of multimedia material in teaching second language grammar comprehension among beginning and intermediate-level Chinese learners. In particular, it investigates the relative efficacy of three different modes used in teaching an important Chinese grammar, directional complements: text alone, text with a still picture and text with video clips. The study\u2019s focal issue is to determine which mode or modes \u2014 text alone, text with still picture or text with dynamic video clip \u2014 is most effective in aiding grammar acquisition in both short-term and long-term.\\nThe study employed an immediate post-test and a delayed post-test. The participants were 53 college students, beginning level Chinese language learners who had studied Chinese for a half year, and were naturally assigned to one of the three parallel groups. The three groups differed as to the use of the different mode used to present the teaching material: text-only, text-picture, and text-video.\\nAnalysis of the collected data yielded three main findings. First, learners who received text-video material outperformed those who received text-picture; and learners who received text-picture material outperformed those who received text-only. Secondly, learners who received text-video had significantly better long-term comprehension than the other two groups. Finally, the performance advantage of text-video treatment was particularly significant with more complex target forms.\\nThe results demonstrate that multimedia material can help L2 learners\u2019 grammar comprehension. Text-picture and text-video were more effective than text-only, and text-video material was more effective than text-picture."} | ||
| 72 | {"work_id": 3080729669, "title": "Pengembangan Sistem Pemetaan Otomatis EntityRelationship Diagram Ke Dalam Database", "abstract": "Salah satu tahap dalam perancangan basis data untuk pengembangan sebuah\r\nperangkat lunak adalah proses perancangan basis data yang dibuat berdasarkan\r\nhasil perancangan model konseptual dan relasional. Proses yang cukup sulit\r\nadalah pada saat pemetaan konsep basis data. Ketika daftar kebutuhan pengguna\r\nmengalami perubahan, akan berdampak pada perancangan Sistem Basis data\r\nyang sudah dibuat sebelumnya. Selain itu, struktur basis data yang kompleks,\r\nketika mengalami perubahan akan memakan banyak waktu untuk dipetakan\r\nkembali secara manual. Berdasarkan permasalahan tersebut, maka dibuatlah\r\nsuatu Sistem untuk memetakan model basis data berbentuk ERD agar langsung\r\ndapat digunakan pada database mySQL. Dengan tujuan mempemudah pemetaan,\r\nmaka sistem ini menggunakan notasi Chen. Notasi ini adalah notasi yang paling\r\nsering digunakan dalam data modeling tool karena bentuknya yang mudah\r\ndipahami dan digambarkan. Namun notasi ini jarang digunakan oleh aplikasi ERD\r\nmapping. Sistem ini menggunakan tujuh langkah pemetaan model relasi entitas\r\nsehingga sesuai dengan kaidah Rekaya Perangkat Lunak. Sistem dibuat dengan\r\nberbasis web, menggunakan pemrograman berorientasi objek, dan menggunakan\r\nframework codeigniter. Sistem menghasilkan 16 buah kebutuhan yang telah diuji\r\ndengan menggunakan pengujian white-box dan black-box mendapatkan hasil valid\r\nuntuk keseluruhannya dan juga 95% untuk pengujian compatibility sistem"} | 47 | {"work_id": 3080729669, "title": "Pengembangan Sistem Pemetaan Otomatis EntityRelationship Diagram Ke Dalam Database", "abstract": "Salah satu tahap dalam perancangan basis data untuk pengembangan sebuah\r\nperangkat lunak adalah proses perancangan basis data yang dibuat berdasarkan\r\nhasil perancangan model konseptual dan relasional. Proses yang cukup sulit\r\nadalah pada saat pemetaan konsep basis data. Ketika daftar kebutuhan pengguna\r\nmengalami perubahan, akan berdampak pada perancangan Sistem Basis data\r\nyang sudah dibuat sebelumnya. Selain itu, struktur basis data yang kompleks,\r\nketika mengalami perubahan akan memakan banyak waktu untuk dipetakan\r\nkembali secara manual. Berdasarkan permasalahan tersebut, maka dibuatlah\r\nsuatu Sistem untuk memetakan model basis data berbentuk ERD agar langsung\r\ndapat digunakan pada database mySQL. Dengan tujuan mempemudah pemetaan,\r\nmaka sistem ini menggunakan notasi Chen. Notasi ini adalah notasi yang paling\r\nsering digunakan dalam data modeling tool karena bentuknya yang mudah\r\ndipahami dan digambarkan. Namun notasi ini jarang digunakan oleh aplikasi ERD\r\nmapping. Sistem ini menggunakan tujuh langkah pemetaan model relasi entitas\r\nsehingga sesuai dengan kaidah Rekaya Perangkat Lunak. Sistem dibuat dengan\r\nberbasis web, menggunakan pemrograman berorientasi objek, dan menggunakan\r\nframework codeigniter. Sistem menghasilkan 16 buah kebutuhan yang telah diuji\r\ndengan menggunakan pengujian white-box dan black-box mendapatkan hasil valid\r\nuntuk keseluruhannya dan juga 95% untuk pengujian compatibility sistem"} | ||
| 73 | {"work_id": 4324129606, "title": "Data quality in online human-subjects research: Comparisons between MTurk, Prolific, CloudResearch, Qualtrics, and SONA", "abstract": "With the proliferation of online data collection in human-subjects research, concerns have been raised over the presence of inattentive survey participants and non-human respondents (bots). We compared the quality of the data collected through five commonly used platforms. Data quality was indicated by the percentage of participants who meaningfully respond to the researcher's question (high quality) versus those who only contribute noise (low quality). We found that compared to MTurk, Qualtrics, or an undergraduate student sample (i.e., SONA), participants on Prolific and CloudResearch were more likely to pass various attention checks, provide meaningful answers, follow instructions, remember previously presented information, have a unique IP address and geolocation, and work slowly enough to be able to read all the items. We divided the samples into high- and low-quality respondents and computed the cost we paid per high-quality respondent. Prolific ($1.90) and CloudResearch ($2.00) were cheaper than MTurk ($4.36) and Qualtrics ($8.17). SONA cost $0.00, yet took the longest to collect the data."} | 48 | {"work_id": 4324129606, "title": "Data quality in online human-subjects research: Comparisons between MTurk, Prolific, CloudResearch, Qualtrics, and SONA", "abstract": "With the proliferation of online data collection in human-subjects research, concerns have been raised over the presence of inattentive survey participants and non-human respondents (bots). We compared the quality of the data collected through five commonly used platforms. Data quality was indicated by the percentage of participants who meaningfully respond to the researcher's question (high quality) versus those who only contribute noise (low quality). We found that compared to MTurk, Qualtrics, or an undergraduate student sample (i.e., SONA), participants on Prolific and CloudResearch were more likely to pass various attention checks, provide meaningful answers, follow instructions, remember previously presented information, have a unique IP address and geolocation, and work slowly enough to be able to read all the items. We divided the samples into high- and low-quality respondents and computed the cost we paid per high-quality respondent. Prolific ($1.90) and CloudResearch ($2.00) were cheaper than MTurk ($4.36) and Qualtrics ($8.17). SONA cost $0.00, yet took the longest to collect the data."} | ||
| 74 | {"work_id": 2914721378, "title": "Graph Neural Networks for Social Recommendation", "abstract": "In recent years, Graph Neural Networks (GNNs), which can naturally integrate node information and topological structure, have been demonstrated to be powerful in learning on graph data. These advantages of GNNs provide great potential to advance social recommendation since data in social recommender systems can be represented as user-user social graph and user-item graph; and learning latent factors of users and items is the key. However, building social recommender systems based on GNNs faces challenges. For example, the user-item graph encodes both interactions and their associated opinions; social relations have heterogeneous strengths; users involve in two graphs (e.g., the user-user social graph and the user-item graph). To address the three aforementioned challenges simultaneously, in this paper, we present a novel graph neural network framework (GraphRec) for social recommendations. In particular, we provide a principled approach to jointly capture interactions and opinions in the user-item graph and propose the framework GraphRec, which coherently models two graphs and heterogeneous strengths. Extensive experiments on two real-world datasets demonstrate the effectiveness of the proposed framework GraphRec."} | 49 | {"work_id": 2914721378, "title": "Graph Neural Networks for Social Recommendation", "abstract": "In recent years, Graph Neural Networks (GNNs), which can naturally integrate node information and topological structure, have been demonstrated to be powerful in learning on graph data. These advantages of GNNs provide great potential to advance social recommendation since data in social recommender systems can be represented as user-user social graph and user-item graph; and learning latent factors of users and items is the key. However, building social recommender systems based on GNNs faces challenges. For example, the user-item graph encodes both interactions and their associated opinions; social relations have heterogeneous strengths; users involve in two graphs (e.g., the user-user social graph and the user-item graph). To address the three aforementioned challenges simultaneously, in this paper, we present a novel graph neural network framework (GraphRec) for social recommendations. In particular, we provide a principled approach to jointly capture interactions and opinions in the user-item graph and propose the framework GraphRec, which coherently models two graphs and heterogeneous strengths. Extensive experiments on two real-world datasets demonstrate the effectiveness of the proposed framework GraphRec."} | ||
| 75 | {"work_id": 4408925021, "title": "The Impact of Artificial Intelligence on Personalized Learning in Higher Education: A Systematic Review", "abstract": "The integration of artificial intelligence in education has the potential to revolutionize personalized learning by adapting instructional methods, content, and pace to the individual needs of students. This systematic review investigates the integration of artificial intelligence into personalized learning within higher education. An extensive literature search was conducted across multiple databases, yielding 17,899 records from which 45 studies met the inclusion criteria. The risk of bias was assessed using a standardized ranking system. This systematic review follows the PRISMA guidelines to ensure transparency in study selection, data extraction, and synthesis. The findings of the review are synthesized to examine how AI-driven solutions enhance adaptive learning, improve student engagement, and streamline administrative processes. The results indicate that AI technologies can significantly optimize educational outcomes by tailoring content and feedback to individual learner needs. However, several challenges persist, such as ethical concerns, data privacy issues, and the necessity for effective teacher training to support technology integration. This analysis reveals considerable potential for AI to transform educational practices, while also emphasizing the importance of establishing standardized evaluation frameworks and conducting longitudinal studies. The implications of these findings are critical for educators, policymakers, and university administrators aiming to leverage AI for educational innovation and sustainable transformation."} | 50 | {"work_id": 4408925021, "title": "The Impact of Artificial Intelligence on Personalized Learning in Higher Education: A Systematic Review", "abstract": "The integration of artificial intelligence in education has the potential to revolutionize personalized learning by adapting instructional methods, content, and pace to the individual needs of students. This systematic review investigates the integration of artificial intelligence into personalized learning within higher education. An extensive literature search was conducted across multiple databases, yielding 17,899 records from which 45 studies met the inclusion criteria. The risk of bias was assessed using a standardized ranking system. This systematic review follows the PRISMA guidelines to ensure transparency in study selection, data extraction, and synthesis. The findings of the review are synthesized to examine how AI-driven solutions enhance adaptive learning, improve student engagement, and streamline administrative processes. The results indicate that AI technologies can significantly optimize educational outcomes by tailoring content and feedback to individual learner needs. However, several challenges persist, such as ethical concerns, data privacy issues, and the necessity for effective teacher training to support technology integration. This analysis reveals considerable potential for AI to transform educational practices, while also emphasizing the importance of establishing standardized evaluation frameworks and conducting longitudinal studies. The implications of these findings are critical for educators, policymakers, and university administrators aiming to leverage AI for educational innovation and sustainable transformation."} | ||
| 51 | +{"work_id": 4390660438, "title": "Modern computing: Vision and challenges", "abstract": "Over the past six decades, the computing systems field has experienced significant transformations, profoundly impacting society with transformational developments, such as the Internet and the commodification of computing. Underpinned by technological advancements, computer systems, far from being static, have been continuously evolving and adapting to cover multifaceted societal niches. This has led to new paradigms such as cloud, fog, edge computing, and the Internet of Things (IoT), which offer fresh economic and creative opportunities. Nevertheless, this rapid change poses complex research challenges, especially in maximizing potential and enhancing functionality. As such, to maintain an economical level of performance that meets ever-tighter requirements, one must understand the drivers of new model emergence and expansion, and how contemporary challenges differ from past ones. To that end, this article investigates and assesses the factors influencing the evolution of computing systems, covering established systems and architectures as well as newer developments, such as serverless computing, quantum computing, and on-device AI on edge devices. Trends emerge when one traces technological trajectory, which includes the rapid obsolescence of frameworks due to business and technical constraints, a move towards specialized systems and models, and varying approaches to centralized and decentralized control. This comprehensive review of modern computing systems looks ahead to the future of research in the field, highlighting key challenges and emerging trends, and underscoring their importance in cost-effectively driving technological progress."} | ||||
| 76 | {"work_id": 4313646859, "title": "Remote patient monitoring using artificial intelligence: Current state, applications, and challenges", "abstract": "Abstract The adoption of artificial intelligence (AI) in healthcare is growing rapidly. Remote patient monitoring (RPM) is one of the common healthcare applications that assist doctors to monitor patients with chronic or acute illness at remote locations, elderly people in\u2010home care, and even hospitalized patients. The reliability of manual patient monitoring systems depends on staff time management which is dependent on their workload. Conventional patient monitoring involves invasive approaches which require skin contact to monitor health status. This study aims to do a comprehensive review of RPM systems including adopted advanced technologies, AI impact on RPM, challenges and trends in AI\u2010enabled RPM. This review explores the benefits and challenges of patient\u2010centric RPM architectures enabled with Internet of Things wearable devices and sensors using the cloud, fog, edge, and blockchain technologies. The role of AI in RPM ranges from physical activity classification to chronic disease monitoring and vital signs monitoring in emergency settings. This review results show that AI\u2010enabled RPM architectures have transformed healthcare monitoring applications because of their ability to detect early deterioration in patients' health, personalize individual patient health parameter monitoring using federated learning, and learn human behavior patterns using techniques such as reinforcement learning. This review discusses the challenges and trends to adopt AI to RPM systems and implementation issues. The future directions of AI in RPM applications are analyzed based on the challenges and trends. This article is categorized under: Application Areas > Health Care Technologies > Artificial Intelligence Technologies > Internet of Things"} | 52 | {"work_id": 4313646859, "title": "Remote patient monitoring using artificial intelligence: Current state, applications, and challenges", "abstract": "Abstract The adoption of artificial intelligence (AI) in healthcare is growing rapidly. Remote patient monitoring (RPM) is one of the common healthcare applications that assist doctors to monitor patients with chronic or acute illness at remote locations, elderly people in\u2010home care, and even hospitalized patients. The reliability of manual patient monitoring systems depends on staff time management which is dependent on their workload. Conventional patient monitoring involves invasive approaches which require skin contact to monitor health status. This study aims to do a comprehensive review of RPM systems including adopted advanced technologies, AI impact on RPM, challenges and trends in AI\u2010enabled RPM. This review explores the benefits and challenges of patient\u2010centric RPM architectures enabled with Internet of Things wearable devices and sensors using the cloud, fog, edge, and blockchain technologies. The role of AI in RPM ranges from physical activity classification to chronic disease monitoring and vital signs monitoring in emergency settings. This review results show that AI\u2010enabled RPM architectures have transformed healthcare monitoring applications because of their ability to detect early deterioration in patients' health, personalize individual patient health parameter monitoring using federated learning, and learn human behavior patterns using techniques such as reinforcement learning. This review discusses the challenges and trends to adopt AI to RPM systems and implementation issues. The future directions of AI in RPM applications are analyzed based on the challenges and trends. This article is categorized under: Application Areas > Health Care Technologies > Artificial Intelligence Technologies > Internet of Things"} | ||
| 77 | {"work_id": 2970155754, "title": "Learning Generalizable Device Placement Algorithms for Distributed Machine Learning", "abstract": "Thesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2019"} | 53 | {"work_id": 2970155754, "title": "Learning Generalizable Device Placement Algorithms for Distributed Machine Learning", "abstract": "Thesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2019"} | ||
| 78 | {"work_id": 2967467, "title": "Social networks and collaborative filtering for large-scale requirements elicitation", "abstract": "Within the field of software engineering, requirements elicitation is the activity in which stakeholder needs are understood. In large-scale software projects, requirements elicitation tends to be beset by three problems: information overload, inadequate stakeholder input, and biased prioritisation of requirements. The work described in this thesis addresses these problems using social networks and collaborative filtering. The work has developed StakeNet, a novel method that uses social networks to identify and prioritise stakeholders. Using StakeNet, the requirements engineer asks an initial list of stakeholders to recommend other stakeholders and stakeholder roles, builds a social network with stakeholders as nodes and their recommendations as links, and prioritises the stakeholders using a variety of social network measures. The work has also developed StakeRare, a novel method that uses social networks and collaborative filtering to identify and prioritise requirements. Using StakeRare, the requirements engineer asks the stakeholders identified by StakeNet to rate an initial list of requirements and suggest other requirements, recommends other relevant requirements to the stakeholders using collaborative filtering, and prioritises the requirements using the ratings and the stakeholders\u2019 priority from StakeNet. Finally, to support the methods, this work has developed StakeSource, a novel software tool that automates the manual processes in StakeNet. StakeSource collects recommendations from stakeholders, builds the social network, and prioritises the stakeholders automatically. The methods and tool have been evaluated using real large-scale software projects. The empirical evaluation of both StakeNet and StakeRare using a real large-scale software project demonstrates that the methods identify a highly complete set of stakeholders and their requirements, and prioritise the stakeholders and their requirements accurately. These methods outperform the existing methods used in the project, and require significantly less time from the stakeholders and requirements engineers. StakeSource has been evaluated with real large-scale projects by practitioners. The tool is now used in major software projects, and organisations are adopting it. The methods, tool, and evaluation described in this thesis provide evidence that social networks and collaborative filtering can effectively support requirements elicitation in large-scale software projects."} | 54 | {"work_id": 2967467, "title": "Social networks and collaborative filtering for large-scale requirements elicitation", "abstract": "Within the field of software engineering, requirements elicitation is the activity in which stakeholder needs are understood. In large-scale software projects, requirements elicitation tends to be beset by three problems: information overload, inadequate stakeholder input, and biased prioritisation of requirements. The work described in this thesis addresses these problems using social networks and collaborative filtering. The work has developed StakeNet, a novel method that uses social networks to identify and prioritise stakeholders. Using StakeNet, the requirements engineer asks an initial list of stakeholders to recommend other stakeholders and stakeholder roles, builds a social network with stakeholders as nodes and their recommendations as links, and prioritises the stakeholders using a variety of social network measures. The work has also developed StakeRare, a novel method that uses social networks and collaborative filtering to identify and prioritise requirements. Using StakeRare, the requirements engineer asks the stakeholders identified by StakeNet to rate an initial list of requirements and suggest other requirements, recommends other relevant requirements to the stakeholders using collaborative filtering, and prioritises the requirements using the ratings and the stakeholders\u2019 priority from StakeNet. Finally, to support the methods, this work has developed StakeSource, a novel software tool that automates the manual processes in StakeNet. StakeSource collects recommendations from stakeholders, builds the social network, and prioritises the stakeholders automatically. The methods and tool have been evaluated using real large-scale software projects. The empirical evaluation of both StakeNet and StakeRare using a real large-scale software project demonstrates that the methods identify a highly complete set of stakeholders and their requirements, and prioritise the stakeholders and their requirements accurately. These methods outperform the existing methods used in the project, and require significantly less time from the stakeholders and requirements engineers. StakeSource has been evaluated with real large-scale projects by practitioners. The tool is now used in major software projects, and organisations are adopting it. The methods, tool, and evaluation described in this thesis provide evidence that social networks and collaborative filtering can effectively support requirements elicitation in large-scale software projects."} | ||
@@ -80,23 +56,36 @@ | |||||
| 80 | {"work_id": 4408444355, "title": "The effects of data quality on machine learning performance on tabular data", "abstract": "Modern artificial intelligence (AI) applications require large quantities of training and test data. This need creates critical challenges not only concerning the availability of such data, but also regarding its quality. For example, incomplete, erroneous, or inappropriate training data can lead to unreliable models that produce ultimately poor decisions. Trustworthy AI applications require high-quality training and test data along many quality dimensions, such as accuracy, completeness, and consistency. We explore empirically the relationship between six data quality dimensions and the performance of 19 popular machine learning algorithms covering the tasks of classification, regression, and clustering, with the goal of explaining their performance in terms of data quality. Our experiments distinguish three scenarios based on the AI pipeline steps that were fed with polluted data: polluted training data, test data, or both. We conclude the paper with an extensive discussion of our observations."} | 56 | {"work_id": 4408444355, "title": "The effects of data quality on machine learning performance on tabular data", "abstract": "Modern artificial intelligence (AI) applications require large quantities of training and test data. This need creates critical challenges not only concerning the availability of such data, but also regarding its quality. For example, incomplete, erroneous, or inappropriate training data can lead to unreliable models that produce ultimately poor decisions. Trustworthy AI applications require high-quality training and test data along many quality dimensions, such as accuracy, completeness, and consistency. We explore empirically the relationship between six data quality dimensions and the performance of 19 popular machine learning algorithms covering the tasks of classification, regression, and clustering, with the goal of explaining their performance in terms of data quality. Our experiments distinguish three scenarios based on the AI pipeline steps that were fed with polluted data: polluted training data, test data, or both. We conclude the paper with an extensive discussion of our observations."} | ||
| 81 | {"work_id": 7161586974, "title": "Paleobiology Database User Guide Version 2.0", "abstract": "The Paleobiology Database is an online, non-governmental, non-profit public resource for paleontological data. It is organized and operated by a multi-disciplinary, multi-institutional, international group of paleobiological researchers. This is the second edition of the volume designed to be a comprehensive guide for Paleobiology Database users, both General and Contributory. It covers most database uses from data retrieval and mapping to data contribution of all types. It contains numerous examples to illustrate database use as well as definitions of terms and additional links to numerous other sources. We hope that this user guide will help all users access the great volume of data in the Paleobiology Database and lead others to start and continue to add data to the system."} | 57 | {"work_id": 7161586974, "title": "Paleobiology Database User Guide Version 2.0", "abstract": "The Paleobiology Database is an online, non-governmental, non-profit public resource for paleontological data. It is organized and operated by a multi-disciplinary, multi-institutional, international group of paleobiological researchers. This is the second edition of the volume designed to be a comprehensive guide for Paleobiology Database users, both General and Contributory. It covers most database uses from data retrieval and mapping to data contribution of all types. It contains numerous examples to illustrate database use as well as definitions of terms and additional links to numerous other sources. We hope that this user guide will help all users access the great volume of data in the Paleobiology Database and lead others to start and continue to add data to the system."} | ||
| 82 | {"work_id": 2963707260, "title": "Heterogeneous Information Network Embedding for Recommendation", "abstract": "Due to the flexibility in modelling data heterogeneity, heterogeneous information network (HIN) has been adopted to characterize complex and heterogeneous auxiliary data in recommender systems, calledHIN based recommendation. It is challenging to develop effective methods for HIN based recommendation in both extraction and exploitation of the information from HINs. Most of HIN based recommendation methods rely on path based similarity, which cannot fully mine latent structure features of users and items. In this paper, we propose a novel heterogeneous network embedding based approach for HIN based recommendation, called HERec. To embed HINs, we design a meta-path based random walk strategy to generate meaningful node sequences for network embedding. The learned node embeddings are first transformed by a set of fusion functions, and subsequently integrated into an extended matrix factorization (MF) model. The extended MF model together with fusion functions are jointly optimized for the rating prediction task. Extensive experiments on three real-world datasets demonstrate the effectiveness of the HERec model. Moreover, we show the capability of the HERec model for the cold-start problem, and reveal that the transformed embedding information from HINs can improve the recommendation performance."} | 58 | {"work_id": 2963707260, "title": "Heterogeneous Information Network Embedding for Recommendation", "abstract": "Due to the flexibility in modelling data heterogeneity, heterogeneous information network (HIN) has been adopted to characterize complex and heterogeneous auxiliary data in recommender systems, calledHIN based recommendation. It is challenging to develop effective methods for HIN based recommendation in both extraction and exploitation of the information from HINs. Most of HIN based recommendation methods rely on path based similarity, which cannot fully mine latent structure features of users and items. In this paper, we propose a novel heterogeneous network embedding based approach for HIN based recommendation, called HERec. To embed HINs, we design a meta-path based random walk strategy to generate meaningful node sequences for network embedding. The learned node embeddings are first transformed by a set of fusion functions, and subsequently integrated into an extended matrix factorization (MF) model. The extended MF model together with fusion functions are jointly optimized for the rating prediction task. Extensive experiments on three real-world datasets demonstrate the effectiveness of the HERec model. Moreover, we show the capability of the HERec model for the cold-start problem, and reveal that the transformed embedding information from HINs can improve the recommendation performance."} | ||
| 83 | −{"work_id": 4380791906, "title": "NoSQL Databases in Kubernetes", "abstract": "With the increasing popularity of deploying applications in containers, Kubernetes (K8s) has become one of the most accepted container orchestration systems. Kubernetes helps maintain containers smoothly and simplifies DevOps with powerful automations. It was originally developed as a tool to manage stateless microservices that run seamlessly in containers. The ephemeral nature of pods, the smallest deployable unit, in Kubernetes was well-aligned with stateless applications since destroying and recreating pods didn\u2019t impact applications. There was a need to provision solutions around stateful workloads like databases so as to take advantage of K8s. This project explores this need, the challenges associated and the available solutions for running databases in Kubernetes. Most of the current research is focused towards SQL-like databases in K8s even though the DNA of NoSQL distributed databases is more aligned with K8s. With no research being done with NoSQL databases, this project outlines the process behind setting up two famous NoSQL databases in K8s: MongoDB and Cassandra. The project also shows a representative viewpoint of the performance comparison between them using the YCSB benchmark. The project lays a foundation around the setup of these databases using K8s Operators and their benchmarking. The goal of the project is to describe the advantages of having databases in K8s, provide developers a clear path for setup and provide insights on basic benchmark performance."} | 59 | +{"work_id": 7118010419, "title": "Optimizing Retail Application Performance: A Systematic Review of Monitoring Tools, Metrics, And Best Practices", "abstract": "The increasing popularity of digitization in retail has emphasized application performance as a critical component of customer satisfaction, business continuity, and operational efficiency. Retail applications today operate in hyper-dynamic environments, where performance can be introduced by concerns such as workload peaks, scaling cloud infrastructure performance, spikes in transactions, and real-time data processing. Poor performance erodes user experience, depletes objectives, and lowers competitive benefit. Although many surveys of cloud or performance monitoring exist, they do not incorporate retail contexts that emphasize customer facing KPIs, seasonal demand variability, and other omnichannel complexities. The current paper seeks to address this gap in research by providing a systematic review of 45 peer-reviewed studies (2015\u20132025) specific to monitoring tools, optimization frameworks, and best practices in retail performance monitoring. The findings in the review synthesize performance monitoring platforms (i.e. Splunk, Datadog, New Relic), log management tools, key performance indicators, performance continuous monitoring, performance visualization, and performance integration into retail systems. The paper also offers comparison evaluations of Amazon and Google Cloud monitoring offerings, as well as limitations for optimization planning, and the effect of intelligent analytics to improve scalability and resiliency. The paper contributes by connecting scholarly viewpoints with practical suggestions, providing a distinctive road map for practitioners and academics to develop and enhance high-performance retail applications in cloud-based corporate settings."} | ||
| 84 | −{"work_id": 4392909747, "title": "Cloud Computing: Principles And Paradigms", "abstract": "Capturing the current state of the art in Cloud Computing technology and applications is the main goal of this book. The book\u2019s secondary objective is to chart a course for future studies and technological developments that will pave the way for the establishment of a worldwide marketplace for cloud computing services catering to commercial, government, academic, and consumer needs. The book is designed to be a reference for a wide range of readers, including systems architects, developers, practitioners, new researchers, and graduate students."} | 60 | +{"work_id": 2784822088, "title": "A microservice architecture for the processing of large geospatial data in the Cloud", "abstract": "Mit der wachsenden Zahl an Ger\u00e4ten, die spatio-temporale Informationen aufnehmen k\u00f6nnen sowie immer besser werdenden Sensoren, steigt auch die Menge an Geodaten. Vor der Benutzung m\u00fcssen die rohen gesammelten Informationen verarbeitet werden. Zurzeit greifen Experten auf desktop-basierte Geographische Informationssysteme zur\u00fcck, um Prozessierungsworkflows durchzuf\u00fchren. Allerdings \u00fcbersteigt das Datenvolumen sowie die Komplexit\u00e4t der Verarbeitungsalgorithmen l\u00e4ngst die Kapazit\u00e4t ihrer Workstations. Zurzeit findet ein Paradigmenwechsel von Desktop-L\u00f6sungen zur Cloud statt, aber die Entwickler von Prozessierungsalgorithmen sind oft keine Informatiker und haben deshalb wenig Erfahrung im Bereich Cloud-Computing. Unsere Forschungshypothese ist, dass eine Microservice-Architektur und dom\u00e4nenspezifische Sprachen genutzt werden k\u00f6nnen, um existierende Algorithmen zu orchestrieren und Workflows f\u00fcr die Prozessierung von Geodaten in der Cloud auszuf\u00fchren, und damit eine effiziente Anwendungsentwicklung erm\u00f6glichen und die Erfahrung von Stakeholdern verbessern. Wir pr\u00e4sentieren eine Softwarearchitektur, die Erweiterungspunkte f\u00fcr Prozessierungsalgorithmen (oder Microservices) enth\u00e4lt, eine Workflow-Management-Komponente f\u00fcr die verteilte Service-Orchestrierung, und einen Workflow-Editor basierend auf einer dom\u00e4nenspezifischen Sprache. Ziel ist es, Benutzern und Entwicklern ohne tiefergehendes Wissen in verteilten Systemen den Zugang zur Cloud zu erm\u00f6glichen. Unsere Forschungsmethode basiert auf der Design Science Research Methodology. Wir f\u00fchren eine Analyse der Problemdom\u00e4ne durch und sammeln Anforderungen und Qualit\u00e4tsattribute f\u00fcr unsere Architektur. Um unsere Forschungsziele zu erreichen, entwickeln wir die Architektur sowie Ans\u00e4tze f\u00fcr Workflow-Management und -Modellierung. Wir stellen den Nutzen unserer L\u00f6sung dar, indem wir sie auf zwei praktische Anwendungsf\u00e4lle anwenden. Au\u00dferdem evaluieren wir ihre Qualit\u00e4t anhand von definierten Szenarien. Abschlie\u00dfend f\u00fchren wir eine kritische Bewertung unserer Ergebnisse durch. Unsere wissenschaftlichen Beitr\u00e4ge k\u00f6nnen in drei Bereiche gegliedert werden. Wir pr\u00e4sentieren eine skalierbare und erweiterbare Microservice-Architektur f\u00fcr die Geodatenprozessierung, die eine verteilte Entwicklung erm\u00f6glicht sowie eine hohe Verf\u00fcgbarkeit bietet. Au\u00dferdem pr\u00e4sentieren wir neue Ans\u00e4tze f\u00fcr die Service- Integration und -Orchestrierung in der Cloud sowie regelbasiertes und dynamisches Workflow-Management ohne a priori Wissen im Entwurf. F\u00fcr die Workflow- Modellierung entwickeln wir eine dom\u00e4nenspezifische Sprache sowie eine neue Methode f\u00fcrs Sprachdesign. Die Ergebnisse unserer Arbeit st\u00fctzen unsere Forschungshypothese. Die Microservice- Architektur erm\u00f6glicht eine effiziente Entwicklung eines verteilten Systems. Die dom\u00e4nenspezifische Sprache sowie unser Ansatz zur Service-Integration verbessern die Erfahrung der Stakeholder. Unsere Arbeit stellt einen gro\u00dfen Schritt im Paradigmenwechsel zur Cloud dar und bietet M\u00f6glichkeiten f\u00fcr weitere Forschung."} | ||
| 85 | −{"work_id": 2562507292, "title": "Internet of Things Applications - From Research and Innovation to Market Deployment", "abstract": "ISBN : 9788793102941"} | 61 | +{"work_id": 4394994587, "title": "Recommender Systems in the Era of Large Language Models (LLMs)", "abstract": "With the prosperity of e-commerce and web applications, Recommender Systems (RecSys) have become an indispensable and important component in our daily lives, providing personalized suggestions that cater to user preferences. While Deep Neural Networks (DNNs) have achieved significant advancements in enhancing recommender systems by modeling user-item interactions and incorporating their textual side information, these DNN-based methods still exhibit some limitations, such as difficulties in effectively understanding users' interests and capturing textual side information, inabilities in generalizing to various seen/unseen recommendation scenarios and reasoning on their predictions, etc. Meanwhile, the development of Large Language Models (LLMs), such as ChatGPT and GPT-4, has revolutionized the fields of Natural Language Processing (NLP) and Artificial Intelligence (AI), due to their remarkable abilities in fundamental responsibilities of language understanding and generation, as well as impressive generalization capabilities and reasoning skills. As a result, recent studies have actively attempted to harness the power of LLMs to enhance recommender systems. Given the rapid evolution of this research direction in recommender systems, there is a pressing need for a systematic overview that summarizes existing LLM-empowered recommender systems, so as to provide researchers and practitioners in relevant fields with an in-depth understanding. Therefore, in this survey, we conduct a comprehensive review of LLM-empowered recommender systems from various aspects including pre-training, fine-tuning, and prompting paradigms. More specifically, we first introduce the representative methods to harness the power of LLMs (as a feature encoder) for learning representations of users and items. Then, we systematically review the emerging advanced techniques of LLMs for enhancing recommender systems from three paradigms, namely pre-training, fine-tuning, and prompting. Finally, we comprehensively discuss the promising future directions in this emerging field."} | ||
| 86 | −{"work_id": 4387316367, "title": "Ontological Approach to a Knowledge Graph Construction in a Semantic Library", "abstract": "Abstract The paper considers an approach to a knowledge graph construction based on the ontological representation of scientific subject areas. The presentation is based on concepts related to information and data mining, such as knowledge, knowledge extraction, domain ontology, scientific domain, thesaurus, semantic digital library, user information need, ontological design method and, in fact, the knowledge graph. The digital semantic library LibMeta is presented as a repository of various structured data with the possibility of their integration with other data sources. Assumes the possibility of specifying personal content by describing a local subject area within LibMeta. The ontology of the content of the semantic library acts as a means of formalization. This paper addresses the experience of building semantic libraries based on thesauri and ontological design. Building ontologies based on the thesaurus of the subject area LibMeta allows us to say that the presence of internal semantic links ensures the consistency and reliability of search results, which is a necessary condition for extracting scientific knowledge. The digital library ontology defines the data structure of the library content. Each data element loaded into the library can be associated with an ontology vertex (top) that determines the position of the data element in the ontology. Based on the ontology links and the links defined at the design stage, you can build a data graph. On the example of the ontology of the LibMeta semantic library, the technology of forming the knowledge graph of modern applications in mathematics is discussed. The problems of filling a graph, embedding in a graph, extracting links and nodes of a graph are discussed."} | 62 | +{"work_id": 4408156900, "title": "Federated Learning for Cloud and Edge Security: A Systematic Review of Challenges and AI Opportunities", "abstract": "The ongoing evolution of cloud computing requires sustained attention to security, privacy, and compliance issues. The purpose of this paper is to systematically review the current literature regarding the application of federated learning (FL) and artificial intelligence (AI) to improve cloud computing security while preserving privacy, delivering real-time threat detection, and meeting regulatory requirements. The current research follows a systematic literature review (SLR) approach, which examined 30 studies published between 2020 and 2024 and followed the PRISMA 2020 checklist. The analysis shows that FL provides significant privacy risk reduction by 25%, especially in healthcare and similar domains, and it improves threat detection by 40% in critical infrastructure areas. A total of 80% of reviewed implementations showed improved privacy, but challenges like communication overhead and resource limitations persist, with 50% of studies reporting latency issues. To overcome these obstacles, this study also explores some emerging solutions, which include model compression, hybrid federated architectures, and cryptographic enhancements. Additionally, this paper demonstrates the unexploited capability of FL for real-time decision-making in dynamic edge environments and highlights its potential across autonomous systems, Industrial Internet of Things (IIoT), and cybersecurity frameworks. The paper\u2019s proposed insights present a deployment strategy for FL models which enables scalable, secure, and privacy-preserving operations and will enable robust cloud security solutions in the AI era."} | ||
| 87 | −{"work_id": 4398201281, "title": "Situ-Oracle: A Learning-Based Situation Analysis Framework for Blockchain-Based IoT Systems", "abstract": "The decentralized nature of blockchain enables data traceability, transparency, and immutability as complementary security features to the existing Internet of Things (IoT) systems. These Blockchain-based IoT (BIoT) systems aim to mitigate security risks such as malicious control, data leakage, and dishonesty often found in traditional cloud-based, vendor-specific IoT networks. As we steadily advance into the era of situation-aware IoT, the use of machine learning (ML) techniques has become essential for synthesizing situations based on sensory contexts. However, the challenge to integrate learning-based situation awareness with BIoT systems restricts the full potential of such integration. This is primarily due to the conflicts between the deterministic nature of smart contracts and the non-deterministic nature of machine learning, as well as the high costs of conducting machine learning on blockchain. To address the challenge, we propose a framework named Situ-Oracle. With the framework, a computation oracle of the blockchain ecosystem is leveraged to provide situation analysis as a service, based on Recurrent Neural Network (RNN)-based learning models tailored for the Situ model, and specifically designed smart contracts are deployed as intermediary communication channels between the IoT devices and the computation oracle. We used smart homes as a case study to demonstrate the framework design. Subsequently, system-wide evaluations were conducted over a physically constructed BIoT system. The results indicate that the proposed framework achieves better situation analysis accuracy (above 95%) and improves gas consumption as well as network throughput and latency when compared to baseline systems (on-chain learning or off-chain model verification). Overall, the paper presents a promising approach for improving situation analysis for BIoT systems, with potential applications in various domains such as smart homes, healthcare, and industrial automation."} | 63 | +{"work_id": 3012404397, "title": "Santa Claus Algorithm: Agent-Based Consensus Preprocessing Method for Scalability Improvement in Private Blockchain Environment", "abstract": "\ube44\uc794\ud2f4 \uc7a5\uc560 \ud5c8\uc6a9(BFT: Byzantine Fault Tolerance)\uc740 \ube14\ub85d\uccb4\uc778 \ud658\uacbd\uc5d0\uc11c \uc8fc\ub85c \uc0ac\uc6a9\ub418\uace0 \uc788\ub294 \ube14\ub85d\uccb4\uc778 \ud569\uc758 \uc54c\uace0\ub9ac\uc998 \uc911\uc758 \ud558\ub098\uc774\ub2e4. BFT\ub294 \ud569\uc758\ub97c \ud558\uae30 \uc704\ud574 \ubaa8\ub4e0 \ucc38\uc5ec\uc790\uac00 \ud569\uc758\uc5d0 \ucc38\uc5ec\ud558\ub294 \uad6c\uc870\ub85c \ub418\uc5b4\uc788\uc5b4 \ucc38\uc5ec \ub178\ub4dc\uac00 \ub9ce\uc544\uc9c0\uba74 \ucc98\ub9ac\uc18d\ub3c4\uac00 \ud604\uaca9\ud788 \uac10\uc18c\ud558\ub294 \ud655\uc7a5\uc131\uc758 \ubb38\uc81c\uac00 \uc788\ub2e4. \uc774\ub7ec\ud55c \ubb38\uc81c \ub54c\ubb38\uc5d0 \ub9ce\uc740 \ucc38\uc5ec \ub178\ub4dc\uac00 \uc788\ub294 \ube14\ub85d\uccb4\uc778\uc5d0\uc11c \ube44\uc794\ud2f4 \uc7a5\uc560 \ud5c8\uc6a9\uc744 \uc801\uc6a9\ud558\uae30 \uc704\ud574\uc11c\ub294 \ud655\uc7a5\uc131 \uac1c\uc120\uc774 \ud544\uc218\uc801\uc774\ub2e4. \ubcf8 \uc5f0\uad6c\uc5d0\uc11c\ub294 \ud504\ub77c\uc774\ube57 \ube14\ub85d\uccb4\uc778\uc5d0\uc11c \ud569\uc758 \uc5c6\uc774 \ub370\uc774\ud130\ub97c \uae30\ub85d\ud558\ub2e4\uac00 \uc5d0\uc774\uc804\ud2b8\uac00 \ud569\uc758\uac00 \ud544\uc694\ud55c \uc21c\uac04\uc744 \uc54c\ub824\uc8fc\ub294 \uc804\ucc98\ub9ac \uae30\ubc95\uc744 \uc81c\uc548\ud55c\ub2e4. \uc5d0\uc774\uc804\ud2b8\ub294 \ube14\ub85d\uccb4\uc778\uc758 \ub178\ub4dc\ub97c \ubc29\ubb38\ud558\uba74\uc11c \ub450 \ub2e8\uacc4\uc5d0 \uac78\uccd0 \ud569\uc758\uac00 \ud544\uc694\ud55c \uc21c\uac04\uc744 \uc54c\ub824\uc900\ub2e4. \uccab \ubc88\uc9f8 \ub2e8\uacc4\ub294 \uc9c0\uae08\uae4c\uc9c0 \uae30\ub85d\ub41c \ub370\uc774\ud130\uac00 \ubaa8\ub4e0 \ub178\ub4dc\uc5d0\uc11c \uc77c\uce58\ud558\ub294\uc9c0 \ud655\uc778\ud558\uba70, \ub450 \ubc88\uc9f8 \ub2e8\uacc4\ub294 \uc5b4\ub5a0\ud55c \ub370\uc774\ud130\uac00 \ubd88\uc77c\uce58\ud558\uc5ec \ud569\uc758\uac00 \ud544\uc694\ud55c\uc9c0 \uc54c\ub824\uc900\ub2e4. \uc5d0\uc774\uc804\ud2b8\ub294 \ube14\ub85d\uccb4\uc778 \ub124\ud2b8\uc6cc\ud06c\uc5d0\uc11c \ub3c5\ub9bd\uc801\uc778 \uac1d\uccb4\ub85c\uc11c \ube14\ub85d\uccb4\uc778\uc5d0 \ucc38\uc5ec\ud558\ub294 \uc784\uc758\uc758 \ub178\ub4dc\uc5d0 \uc758\ud574 \uc791\ub3d9\uc774 \ub41c\ub2e4. \ubcf8 \ub17c\ubb38\uc5d0\uc11c\ub294 \uc81c\uc548 \uae30\ubc95\uc744 \ud504\ub77c\uc774\ube57 \ube14\ub85d\uccb4\uc778 \ud658\uacbd\uc5d0\uc11c \uc2e4\uc6a9\uc801 \ube44\uc794\ud2f4 \uc7a5\uc560 \ud5c8\uc6a9(PBFT: Practical Byzantine Fault Tolerance) \ud569\uc758\uc5d0 \uc801\uc6a9\ud55c \uacb0\uacfc \ub178\ub4dc\uc758 \uc218\uac00 \uc99d\uac00\ud568\uc5d0 \ub530\ub77c \ubc18\uc751 \uc2dc\uac04\uc774 \ud3c9\uade0 39% \uac10\uc18c\ud558\uc600\ub2e4\ub294 \uac83\uc744 \uc99d\uba85\ud558\uc600\ub2e4."} | ||
| 88 | −{"work_id": 2945623882, "title": "KGAT", "abstract": "To provide more accurate, diverse, and explainable recommendation, it is compulsory to go beyond modeling user-item interactions and take side information into account. Traditional methods like factorization machine (FM) cast it as a supervised learning problem, which assumes each interaction as an independent instance with side information encoded. Due to the overlook of the relations among instances or items (e.g., the director of a movie is also an actor of another movie), these methods are insufficient to distill the collaborative signal from the collective behaviors of users. In this work, we investigate the utility of knowledge graph (KG), which breaks down the independent interaction assumption by linking items with their attributes. We argue that in such a hybrid structure of KG and user-item graph, high-order relations --- which connect two items with one or multiple linked attributes --- are an essential factor for successful recommendation. We propose a new method named Knowledge Graph Attention Network (KGAT) which explicitly models the high-order connectivities in KG in an end-to-end fashion. It recursively propagates the embeddings from a node's neighbors (which can be users, items, or attributes) to refine the node's embedding, and employs an attention mechanism to discriminate the importance of the neighbors. Our KGAT is conceptually advantageous to existing KG-based recommendation methods, which either exploit high-order relations by extracting paths or implicitly modeling them with regularization. Empirical results on three public benchmarks show that KGAT significantly outperforms state-of-the-art methods like Neural FM and RippleNet. Further studies verify the efficacy of embedding propagation for high-order relation modeling and the interpretability benefits brought by the attention mechanism. We release the codes and datasets at https://github.com/xiangwang1223/knowledge_graph_attention_network."} | 64 | +{"work_id": 2794533297, "title": "OmniLedger: A Secure, Scale-Out, Decentralized Ledger via Sharding", "abstract": "Designing a secure permissionless distributed ledger (blockchain) that performs on par with centralized payment processors, such as Visa, is a challenging task. Most existing distributed ledgers are unable to scale-out, i.e., to grow their total processing capacity with the number of validators; and those that do, compromise security or decentralization. We present OmniLedger, a novel scale-out distributed ledger that preserves longterm security under permissionless operation. It ensures security and correctness by using a bias-resistant public-randomness protocol for choosing large, statistically representative shards that process transactions, and by introducing an efficient cross-shard commit protocol that atomically handles transactions affecting multiple shards. OmniLedger also optimizes performance via parallel intra-shard transaction processing, ledger pruning via collectively-signed state blocks, and low-latency \"trust-but-verify\" validation for low-value transactions. An evaluation of our experimental prototype shows that OmniLedger's throughput scales linearly in the number of active validators, supporting Visa-level workloads and beyond, while confirming typical transactions in under two seconds."} | ||
| 89 | −{"work_id": 2251066406, "title": "Bypassing Races in Live Applications with Execution Filters", "abstract": "Deployed multithreaded applications contain many races because these applications are difficult to write, test, and debug. Worse, the number of races in deployed applications may drastically increase due to the rise of multicore hardware and the immaturity of current race detectors.LOOM is a live-workaround system designed to quickly and safely bypass application races at runtime. LOOM provides a flexible and safe language for developers to write execution filters that explicitly synchronize code. It then uses an evacuation algorithm to safely install the filters to live applications to avoid races. It reduces its performance overhead using hybrid instrumentation that combines static and dynamic instrumentation.We evaluated LOOM on nine real races from a diverse set of six applications, including MySQL and Apache. Our results show that (1) LOOM can safely fix all evaluated races in a timely manner, thereby increasing application availability; (2) LOOM incurs little performance overhead; (3) LOOM scales well with the number of application threads; and (4) LOOM is easy to use."} | 65 | +{"work_id": 2120510885, "title": "The Byzantine generals problem", "abstract": "Abstract The Byzantine Generals Problem requires processes to reach agreement upon a value even though some of them may fad. It is weakened by allowing them to agree upon an \"incorrect \" value if a failure occurs. The transaction eormmt problem for a distributed database Js a special case of the weaker problem. It is shown that, like the original Byzantine Generals Problem, the weak version can be solved only ff fewer than one-third of the processes may fad. Unlike the onginal problem, an approximate solution exists that can tolerate arbaranly many failures."} | ||
| 90 | −{"work_id": 1500148551, "title": "Time-based Fairness Improves Performance in Multi-rate WLANs", "abstract": "The performance seen by individual clients on a wireless local area network (WLAN) is heavily influenced by the manner in which wireless channel capacity is allocated. The popular MAC protocol DCF (Distributed Coordination Function) used in 802.11 networks provides equal long-term transmission opportunities to competing nodes when all nodes experience similar channel conditions. When similar-sized packets are also used, DCF leads to equal achieved throughputs (throughput-based fairness) among contending nodes. Because of varying indoor channel conditions, the 802.11 standard supports multiple data transmission rates to exploit the trade-off between data rate and bit error rate. This leads to considerable rate diversity, particularly when the network is congested. Under such conditions, throughput-based fairness can lead to drastically reduced aggregate throughput. In this paper, we argue the advantages of time-based fairness, in which each competing node receives an equal share of the wireless channel occupancy time. We demonstrate that this notion of fairness can lead to significant improvements in aggregate performance while still guaranteeing that no node receives worse channel access than it would in a single-rate WLAN. We also describe our algorithm, TBR (Time-based Regulator), which runs on the AP and works with any MAC protocol to provide time-based fairness by regulating packets. Through experiments, we show that our practical and backward compatible implementation of TBR in conjunction with an existing implementation of DCF achieves time-based fairness."} | 66 | +{"work_id": 4396669794, "title": "Optimized Throughput-Based Broadcasting for Next Generation Wireless Networks", "abstract": "Remote areas benefit from lower costs for transporting enormous amounts of data between a source node and multiple networking devices. Noise and constraints necessitated a 64 kb/s broadcaster. Bit defect rates, abnormalities, and frequent retransmission prevented data movement.This could greatly minimize channel usage. The maximum transmission unit distance was 64B. Data packet size limits exacerbated issues. Massive data traffic, connection imprecision, and changing topology affect network structure, making data dissemination from source nodes to all devices difficult.This book chapter suggests using an advanced throughput optimal broadcast in point-to-multipoint wireless networks to improve wire-less link precision by using the Mayfly optimization method, a recent swarm intelligence soft computing technique, to improve geometrical configuration of interfering terminals and forecasted per-flow throughput"} | ||
| 91 | −{"work_id": 2945827670, "title": "Neural Graph Collaborative Filtering", "abstract": "Learning vector representations (aka. embeddings) of users and items lies at the core of modern recommender systems. Ranging from early matrix factorization to recently emerged deep learning based methods, existing efforts typically obtain a user's (or an item's) embedding by mapping from pre-existing features that describe the user (or the item), such as ID and attributes. We argue that an inherent drawback of such methods is that, the collaborative signal, which is latent in user-item interactions, is not encoded in the embedding process. As such, the resultant embeddings may not be sufficient to capture the collaborative filtering effect."} | 67 | +{"work_id": 4387321091, "title": "Efficient Memory Management for Large Language Model Serving with PagedAttention", "abstract": "High throughput serving of large language models (LLMs) requires batching sufficiently many requests at a time. However, existing systems struggle because the key-value cache (KV cache) memory for each request is huge and grows and shrinks dynamically. When managed inefficiently, this memory can be significantly wasted by fragmentation and redundant duplication, limiting the batch size. To address this problem, we propose PagedAttention, an attention algorithm inspired by the classical virtual memory and paging techniques in operating systems. On top of it, we build vLLM, an LLM serving system that achieves (1) near-zero waste in KV cache memory and (2) flexible sharing of KV cache within and across requests to further reduce memory usage. Our evaluations show that vLLM improves the throughput of popular LLMs by 2--4\u00d7 with the same level of latency compared to the state-of-the-art systems, such as FasterTransformer and Orca. The improvement is more pronounced with longer sequences, larger models, and more complex decoding algorithms. vLLM's source code is publicly available at https://github.com/vllm-project/vllm."} | ||
| 92 | −{"work_id": 2962883549, "title": "Deep Learning in Mobile and Wireless Networking: A Survey", "abstract": "The rapid uptake of mobile devices and the rising popularity of mobile applications and services pose unprecedented demands on mobile and wireless networking infrastructure. Upcoming 5G systems are evolving to support exploding mobile traffic volumes, real-time extraction of fine-grained analytics, and agile management of network resources, so as to maximize user experience. Fulfilling these tasks is challenging, as mobile environments are increasingly complex, heterogeneous, and evolving. One potential solution is to resort to advanced machine learning techniques, in order to help manage the rise in data volumes and algorithm-driven applications. The recent success of deep learning underpins new and powerful tools that tackle problems in this space. In this paper, we bridge the gap between deep learning and mobile and wireless networking research, by presenting a comprehensive survey of the crossovers between the two areas. We first briefly introduce essential background and state-of-the-art in deep learning techniques with potential applications to networking. We then discuss several techniques and platforms that facilitate the efficient deployment of deep learning onto mobile systems. Subsequently, we provide an encyclopedic review of mobile and wireless networking research based on deep learning, which we categorize by different domains. Drawing from our experience, we discuss how to tailor deep learning to mobile environments. We complete this survey by pinpointing current challenges and open future directions for research."} | 68 | +{"work_id": 2963507231, "title": "Untangling Blockchain: A Data Processing View of Blockchain Systems", "abstract": "Blockchain technologies are gaining massive momentum in the last few years. Blockchains are distributed ledgers that enable parties who do not fully trust each other to maintain a set of global states. The parties agree on the existence, values, and histories of the states. As the technology landscape is expanding rapidly, it is both important and challenging to have a firm grasp of what the core technologies have to offer, especially with respect to their data processing capabilities. In this paper, we first survey the state of the art, focusing on private blockchains (in which parties are authenticated). We analyze both in-production and research systems in four dimensions: distributed ledger, cryptography, consensus protocol, and smart contract. We then present BLOCKBENCH, a benchmarking framework for understanding performance of private blockchains against data processing workloads. We conduct a comprehensive evaluation of three major blockchain systems based on BLOCKBENCH, namely Ethereum, Parity, and Hyperledger Fabric. The results demonstrate several trade-offs in the design space, as well as big performance gaps between blockchain and database systems. Drawing from design principles of database systems, we discuss several research directions for bringing blockchain performance closer to the realm of databases."} | ||
| 93 | −{"work_id": 4364375730, "title": "Social Health Protection During the COVID-Pandemic Using IoT", "abstract": "The agenda of this book chapter is to review existing technologies that aid societal health protection and recommend some possible approaches which will assist the mentioned scenario. Automations like big data and artificial intelligence (AI) deployed in healthcare sector can expedite pandemic response in ways that are strenuous to achieve all in all by humans. The sudden epiphany to trace COVID-19 in public has powered the innovation of data dashboards that visually unveil coronavirus epicentres. A cloud-based AI-assisted CT service is being engaged to differentiate pneumonia from the pandemic which dwindles risk factor in the present school of thought of the citizens worldwide. In conclusion, social health protection was an indispensable mechanism in prior to these challenging times and is escalating by prominence for delivering support to individuals during the crisis."} | 69 | +{"work_id": 4288083766, "title": "Deep Learning Based Recommender System", "abstract": "With the growing volume of online information, recommender systems have been an effective strategy to overcome information overload. The utility of recommender systems cannot be overstated, given their widespread adoption in many web applications, along with their potential impact to ameliorate many problems related to over-choice. In recent years, deep learning has garnered considerable interest in many research fields such as computer vision and natural language processing, owing not only to stellar performance but also to the attractive property of learning feature representations from scratch. The influence of deep learning is also pervasive, recently demonstrating its effectiveness when applied to information retrieval and recommender systems research. The field of deep learning in recommender system is flourishing. This article aims to provide a comprehensive review of recent research efforts on deep learning-based recommender systems. More concretely, we provide and devise a taxonomy of deep learning-based recommendation models, along with a comprehensive summary of the state of the art. Finally, we expand on current trends and provide new perspectives pertaining to this new and exciting development of the field."} | ||
| 94 | −{"work_id": 2902511784, "title": "Dynamic data race detection for OpenMP programs", "abstract": "Two concurrent accesses to a shared variable that are unordered by synchronization are said to be a data race if at least one access is a write. Data races cause shared memory parallel programs to behave unpredictably and are typically considered a bug. It is hard to manually identify memory access instructions causing data races in large concurrent programs due to non-deterministic behavior affected by thread schedule. Tools for detecting data races are desired to help application developers debug data races in an efficient way. Dynamic data race detection tools detect data races by monitoring programs as they execute. Building accurate and efficient data race detection tools requires domain knowledge of concurrency control primitives provided by the specific parallel programming model upon which a program is built. OpenMP is the de-facto standard API for node level shared memory parallel programming. The complexity of OpenMP, which includes primitives for managing data environments, SPMD parallelism, work sharing, tasking, mutual exclusion, and ordering, presents a formidable challenge for precise dynamic data race detection. This dissertation describes several techniques that enable accurate dynamic data race detection for OpenMP programs. First, I describe a hybrid data race detection algorithm that allows data race detection to be executed in parallel. Second, I describe an OpenMP task labeling technique that assigns each OpenMP task a label to facilitate OpenMP-aware accurate happens-before analysis. This technique is the foundation for callback functions provided by the OpenMP Tools interface known as OMPT to get notifications about OpenMP synchronization events and create task labels based on a set of label creation rules. Third, I propose techniques for optimizing dynamic data race detection performance via a redundant memory access pruning algorithm, a readers-writer concurrency control protocol for coordinating threads as they maintain access histories for memory locations, and an OpenMP-aware access record management protocol. The second and third contributions combine to form a system called ROMP, which is a dynamic data race detector for OpenMP programs. Experiments with standard data race detection benchmarks shows that ROMP achieves high accuracy for detecting data races in OpenMP programs that contain host-side CPU-centric parallel constructs. Experiments with several OpenMP performance benchmarks show the effectiveness of proposed optimization techniques."} | 70 | +{"work_id": 4323539384, "title": "Scientific dataset recommendation with semantic techniques", "abstract": "Scientific datasets are important in scientific research. Researchers always want to find a way to improve their research. Data discovery and reuse is a recent and popular way of finding more scientific datasets to help researchers. There is much current research work for data discovery and reuse. Nevertheless, most of these works are limited because researchers only trust and reuse data through social networks (such as colleagues or collaborators). Also, the scientific data from social networks bring limitations. For instance, they will only recommend data that they consider helpful. However, one scientist's useful data sometimes might be another's noisy data. A dataset search engine is a solution to help researchers find data outside their social networks by exploring scientific datasets in open data repositories or hubs. Such a dataset search engine typically returns related or relevant datasets based on a keyword query from researchers. Several existing dataset search engines already provide millions of open datasets from open-access sources. However, the performance of a dataset search engine is highly related to the quality of the keyword queries submitted by researchers. For instance, two different queries with the same meaning would get different returns from the same dataset search engine. The main question of this thesis is how to find more relevant scientific datasets from a query on a dataset search engine. A new idea is provided as the solution with dataset recommendation, which is adding one step, \"if you like this dataset, do you also like these other datasets,\" after researchers or users submitted a query to a dataset search engine. Users submit keywords for query to a dataset search engine and then get returned list of datasets. Users can then tell the dataset search engine which returned dataset they like, and the dataset search engine will say, \"If you like this dataset, you would also like those other datasets,\" to recommend more datasets. This thesis aims to help dataset search engines with such scientific dataset recommendations using Semantic Web technologies. As mentioned, the main idea of this thesis is \"if you like this dataset, you would also like that other dataset\". This thesis states the challenges and possibilities of using Semantic Web technologies on scientific dataset recommendation, as well as explores 1) how ontologies can be used for dataset recommendation, and 2) how knowledge graphs can be used for dataset recommendation? These two questions are addressed in six chapters. A scientific item (dataset or paper) recommendation benchmark was provided during the exploring work of this thesis to provide a standard for evaluating scientific item recommendation methods. This benchmark contains a large-scale corpus with millions of datasets and papers as well as the trusted links between them. Also, a collection of entity embeddings was created in the work of this thesis. These embeddings are scientific item embeddings by using knowledge graph embedding on the citation network from Microsoft Academic knowledge graph."} | ||
| 95 | −{"work_id": 2408538552, "title": "Fused Matrix Factorization with Geographical and Social Influence in Location-Based Social Networks", "abstract": "Recently, location-based social networks (LBSNs), such as Gowalla, Foursquare, Facebook, and Brightkite, etc., have attracted millions of users to share their social friendship and their locations via check-ins. The available check-in information makes it possible to mine users\u2019 preference on locations and to provide favorite recommendations. Personalized Point-of-interest (POI) recommendation is a significant task in LBSNs since it can help targeted users explore their surroundings as well as help third-party developers to provide personalized services. To solve this task, matrix factorization is a promising tool due to its success in recommender systems. However, previously proposed matrix factorization (MF) methods do not explore geographical influence, e.g., multi-center check-in property, which yields suboptimal solutions for the recommendation. In this paper, to the best of our knowledge, we are the first to fuse MF with geographical and social influence for POI recommendation in LBSNs. We first capture the geographical influence via modeling the probability of a user\u2019s check-in on a location as a Multi-center Gaussian Model (MGM). Next, we include social information and fuse the geographical influence into a generalized matrix factorization framework. Our solution to POI recommendation is efficient and scales linearly with the number of observations. Finally, we conduct thorough experiments on a large-scale real-world LBSNs dataset and demonstrate that the fused matrix factorization framework with MGM utilizes the distance information sufficiently and outperforms other state-of-the-art methods significantly."} | 71 | +{"work_id": 3148181069, "title": "Classification Based on Decision Tree Algorithm for Machine Learning", "abstract": "Decision tree classifiers are regarded to be a standout of the most well-known methods to data classification representation of classifiers. Different researchers from various fields and backgrounds have considered the problem of extending a decision tree from available data, such as machine study, pattern recognition, and statistics. In various fields such as medical disease analysis, text classification, user smartphone classification, images, and many more the employment of Decision tree classifiers has been proposed in many ways. This paper provides a detailed approach to the decision trees. Furthermore, paper specifics, such as algorithms/approaches used, datasets, and outcomes achieved, are evaluated and outlined comprehensively. In addition, all of the approaches analyzed were discussed to illustrate the themes of the authors and identify the most accurate classifiers. As a result, the uses of different types of datasets are discussed and their findings are analyzed."} | ||
| 96 | −{"work_id": 4396219753, "title": "Machine Learning Mastery", "abstract": "This chapter delves into the core principles of machine learning, offering practical insights for effective data processing. From foundational concepts to advanced techniques, the narrative unfolds as a comprehensive guide for harnessing the power of machine learning in real-world scenarios. The chapter explores data preprocessing methods, addressing the importance of cleaning and quality assurance, outlier detection, handling missing data, and employing noise reduction techniques. Through illustrative examples and case studies, readers gain actionable knowledge on building a robust foundation for machine learning applications. Emphasizing the significance of data quality in model performance, the chapter serves as a valuable resource for both beginners and experienced practitioners seeking mastery in the art of data processing for machine learning success."} | 72 | +{"work_id": 3104550706, "title": "Gossip Algorithms for Distributed Signal Processing", "abstract": "Gossip algorithms are attractive for in-network processing in sensor networks because they do not require any specialized routing, there is no bottleneck or single point of failure, and they are robust to unreliable wireless network conditions. Recently, there has been a surge of activity in the computer science, control, signal processing, and information theory communities, developing faster and more robust gossip algorithms and deriving theoretical performance guarantees. This paper presents an overview of recent work in the area. We describe convergence rate results, which are related to the number of transmitted messages and thus the amount of energy consumed in the network for gossiping. We discuss issues related to gossiping over wireless links, including the effects of quantization and noise, and we illustrate the use of gossip algorithms for canonical signal processing tasks including distributed estimation, source localization, and compression."} | ||
| 97 | −{"work_id": 7118085507, "title": "Retrieval-Augmented Generation for AI-Generated Content: A Survey", "abstract": "Advancements in model algorithms, the growth of foundational models, and access to high-quality datasets have propelled the evolution of Artificial Intelligence Generated Content (AIGC). Despite its notable successes, AIGC still faces hurdles such as updating knowledge, handling long-tail data, mitigating data leakage, and managing high training and inference costs. Retrieval-augmented generation (RAG) has recently emerged as a paradigm to address such challenges. In particular, RAG introduces the information retrieval process, which enhances the generation process by retrieving relevant objects from available data stores, leading to higher accuracy and better robustness. In this paper, we comprehensively review existing efforts that integrate RAG techniques into AIGC scenarios. We first classify RAG foundations according to how the retriever augments the generator, distilling the fundamental abstractions of the augmentation methodologies for various retrievers and generators. This unified perspective encompasses all RAG scenarios, illuminating advancements and pivotal technologies that help with potential future progress. We also summarize additional enhancement methods for RAG, facilitating effective engineering and implementation of RAG systems. Then from another view, we survey practical applications of RAG across different modalities and tasks, offering valuable references for researchers and practitioners. Furthermore, we introduce the benchmarks for RAG, discuss the limitations of current RAG systems, and suggest potential directions for future research."} | 73 | +{"work_id": 2980789769, "title": "A Survey on End-Edge-Cloud Orchestrated Network Computing Paradigms", "abstract": "Sending data to the cloud for analysis was a prominent trend during the past decades, driving cloud computing as a dominant computing paradigm. However, the dramatically increasing number of devices and data traffic in the Internet-of-Things (IoT) era are posing significant burdens on the capacity-limited Internet and uncontrollable service delay. It becomes difficult to meet the delay-sensitive and context-aware service requirements of IoT applications by using cloud computing alone. Facing these challenges, computing paradigms are shifting from the centralized cloud computing to distributed edge computing. Several new computing paradigms, including Transparent Computing, Mobile Edge Computing, Fog Computing, and Cloudlet, have emerged to leverage the distributed resources at network edge to provide timely and context-aware services. By integrating end devices, edge servers, and cloud, they form a hierarchical IoT architecture, i.e., End-Edge-Cloud orchestrated architecture to improve the performance of IoT systems. This article presents a comprehensive survey of these emerging computing paradigms from the perspective of end-edge-cloud orchestration. Specifically, we first introduce and compare the architectures and characteristics of different computing paradigms. Then, a comprehensive survey is presented to discuss state-of-the-art research in terms of computation offloading, caching, security, and privacy. Finally, some potential research directions are envisioned for fostering continuous research efforts."} | ||
| 98 | −{"work_id": 4315977496, "title": "A Survey of Graph Neural Networks for Recommender Systems: Challenges, Methods, and Directions", "abstract": "Recommender system is one of the most important information services on today\u2019s Internet. Recently, graph neural networks have become the new state-of-the-art approach to recommender systems. In this survey, we conduct a comprehensive review of the literature on graph neural network-based recommender systems. We first introduce the background and the history of the development of both recommender systems and graph neural networks. For recommender systems, in general, there are four aspects for categorizing existing works: stage, scenario, objective, and application. For graph neural networks, the existing methods consist of two categories: spectral models and spatial ones. We then discuss the motivation of applying graph neural networks into recommender systems, mainly consisting of the high-order connectivity, the structural property of data and the enhanced supervision signal. We then systematically analyze the challenges in graph construction, embedding propagation/aggregation, model optimization, and computation efficiency. Afterward and primarily, we provide a comprehensive overview of a multitude of existing works of graph neural network-based recommender systems, following the taxonomy above. Finally, we raise discussions on the open problems and promising future directions in this area. We summarize the representative papers along with their code repositories in https://github.com/tsinghua-fib-lab/GNN-Recommender-Systems ."} | 74 | +{"work_id": 4415028496, "title": "Edge-Cloud Collaborative Computing on Distributed Intelligence and Model Optimization: A Survey", "abstract": "Edge-cloud collaborative computing (ECCC) has emerged as a pivotal paradigm for addressing the computational demands of modern intelligent applications, integrating cloud resources with edge devices to enable efficient, low-latency processing across distributed communication networks. Recent advancements in AI, particularly deep learning and large language models (LLMs), have dramatically enhanced the capabilities of these networked systems, yet introduce significant challenges in model deployment, network resource management, and cross-layer optimization. In this survey, we comprehensively examine the intersection of distributed intelligence and model optimization within edge-cloud environments, providing a structured tutorial on fundamental architectures, communication protocols, and network-aware computing frameworks. Additionally, we systematically analyze model optimization approaches, including compression, adaptation, and neural architecture search, alongside AI-driven resource management strategies that balance performance, energy efficiency, and communication overhead across heterogeneous networks. We further explore critical aspects of privacy protection and security enhancement within ECCC systems and examine practical deployments through diverse networked applications, spanning autonomous driving, healthcare, and industrial automation. Performance analysis and benchmarking techniques are also thoroughly explored to establish evaluation standards for these complex distributed systems. Furthermore, the review identifies critical research directions including LLMs deployment, 6G integration, neuromorphic computing, and quantum computing, offering a roadmap for addressing persistent challenges in heterogeneity management, real-time processing, and scalability. By bridging theoretical advancements in communications with practical deployments, this survey offers researchers and practitioners a holistic perspective on leveraging AI to optimize distributed computing environments over next-generation communication networks, fostering innovation in intelligent networked systems."} | ||
| 99 | −{"work_id": 4293584584, "title": "A Multi-Modal Distributed Real-Time IoT System for Urban Traffic Control (Invited Paper)", "abstract": "Traffic congestion is one of the growing urban problem with associated problems like fuel wastage, loss of lives, and slow productivity. The existing traffic system uses programming logic control (PLC) with round-robin scheduling algorithm. Recent works have proposed IoT-based frameworks that use traffic density of each lane to control traffic movement, but they suffer from low accuracy due to lack of emergency vehicle image datasets for training deep neural networks. In this paper, we propose a novel distributed IoT framework that is based on two observations. The first observation is major structural changes to road are rare. This observation is exploited by proposing a novel two stage vehicle detector that is able to achieve 77% vehicle detection accuracy on UA-DETRAC dataset. The second observation is emergency vehicle have distinct siren sound that is detected using a novel acoustic detection algorithm on an edge device. The proposed system is able to detect emergency vehicles with an average accuracy of 99.4%."} | 75 | +{"work_id": 4395483946, "title": "Generative AI and the future of higher education: a threat to academic integrity or reformation? Evidence from multicultural perspectives", "abstract": "Abstract In recent years, higher education (HE) globally has witnessed extensive adoption of technology, particularly in teaching and research. The emergence of generative Artificial Intelligence (GenAI) further accelerates this trend. However, the increasing sophistication of GenAI tools has raised concerns about their potential to automate teaching and research processes. Despite widespread research on GenAI in various fields, there is a lack of multicultural perspectives on its impact and concerns in HE. This study addresses this gap by examining the usage, benefits, and concerns of GenAI in higher education from a multicultural standpoint. We employed an online survey that collected responses from 1217 participants across 76 countries, encompassing a broad range of gender categories, academic disciplines, geographical locations, and cultural orientations. Our findings revealed a high level of awareness and familiarity with GenAI tools among respondents. A significant portion had prior experience and expressed the intention to continue using these tools, primarily for information retrieval and text paraphrasing. The study emphasizes the importance of GenAI integration in higher education, highlighting both its potential benefits and concerns. Notably, there is a strong correlation between cultural dimensions and respondents\u2019 views on the benefits and concerns related to GenAI, including its potential as academic dishonesty and the need for ethical guidelines. We, therefore, argued that responsible use of GenAI tools can enhance learning processes, but addressing concerns may require robust policies that are responsive to cultural expectations. We discussed the findings and offered recommendations for researchers, educators, and policymakers, aiming to promote the ethical and effective integration of GenAI tools in higher education."} | ||
| 76 | +{"work_id": 2951308194, "title": "Blockchain and smart contracts for the internet of things", "abstract": "O Blockchain \u00e9 uma tecnologia emergente recentemente generalizada para muitas \u00e1reas de atividade. O seu modo de opera\u00e7\u00e3o descentralizado enquadra-se perfeitamente em v\u00e1rios cen\u00e1rios onde o principal desafio reside na melhoria da comunica\u00e7\u00e3o m\u00e1quina-m\u00e1quina e na possibilidade de realizar transfer\u00eancias seguras com servi\u00e7os de valor acrescentado. As redes IoT s\u00e3o uma das \u00e1reas poss\u00edveis de aplica\u00e7\u00e3o da tecnologia Blockchain, uma vez que, para poder satisfazer os requisitos da ind\u00fastria, a arquitetura atual das redes IoT tem limita\u00e7\u00f5es, que podem ser superadas atrav\u00e9s da melhoria das comunica\u00e7\u00f5es entre dispositivos e do acesso a formas evolu\u00eddas de agrega\u00e7\u00e3o e consumo dos dados recolhidos. Este trabalho procura avaliar a combina\u00e7\u00e3o desses dois paradigmas - IoT e Blockchain -, procurando entender como o IoT pode beneficiar das funcionalidades que o Blockchain oferece: um sistema de armazenamento mais econ\u00f3mico, descentraliza\u00e7\u00e3o e verdadeira redund\u00e2ncia, confian\u00e7a sem autoridade central - privacidade - e seguran\u00e7a refor\u00e7ada. Por outro lado, o Blockchain como infraestrutura financeira para o IoT \u00e9 tamb\u00e9m um aspeto fundamental desse trabalho. Na prova de conceito constru\u00edda, este cen\u00e1rio \u00e9 implementado, pois os dados de um sensor podem ser transacionados com uma entidade que os solicite. S\u00e3o igualmente realizadas an\u00e1lises estat\u00edsticas e de desempenho relativamente \u00e0 arquitetura implementada, sendo tamb\u00e9m apontados alguns pontos de melhoria para alavancar o uso do sistema em situa\u00e7\u00f5es reais."} | ||||
| 77 | +{"work_id": 4362632858, "title": "Scalability Benchmarking of Cloud-Native Applications Applied to Event-Driven Microservices", "abstract": "Cloud-native applications constitute a recent trend for designing large-scale software systems. This thesis introduces the Theodolite benchmarking method, allowing researchers and practitioners to conduct empirical scalability evaluations of cloud-native applications, their frameworks, configurations, and deployments. The benchmarking method is applied to event-driven microservices, a specific type of cloud-native applications that employ distributed stream processing frameworks to scale with massive data volumes. Extensive experimental evaluations benchmark and compare the scalability of various stream processing frameworks under different configurations and deployments, including different public and private cloud environments. These experiments show that the presented benchmarking method provides statistically sound results in an adequate amount of time. In addition, three case studies demonstrate that the Theodolite benchmarking method can be applied to a wide range of applications beyond stream processing."} | ||||
| 78 | +{"work_id": 3092103025, "title": "Bias and Debias in Recommender System: A Survey and Future Directions", "abstract": "While recent years have witnessed a rapid growth of research papers on recommender system (RS) , most of the papers focus on inventing machine learning models to better fit user behavior data. However, user behavior data is observational rather than experimental. This makes various biases widely exist in the data, including but not limited to selection bias, position bias, exposure bias, and popularity bias. Blindly fitting the data without considering the inherent biases will result in many serious issues, e.g., the discrepancy between offline evaluation and online metrics, hurting user satisfaction and trust on the recommendation service, and so on. To transform the large volume of research models into practical improvements, it is highly urgent to explore the impacts of the biases and perform debiasing when necessary. When reviewing the papers that consider biases in RS, we find that, to our surprise, the studies are rather fragmented and lack a systematic organization. The terminology \u201cbias\u201d is widely used in the literature, but its definition is usually vague and even inconsistent across papers. This motivates us to provide a systematic survey of existing work on RS biases. In this paper, we first summarize seven types of biases in recommendation, along with their definitions and characteristics. We then provide a taxonomy to position and organize the existing work on recommendation debiasing. Finally, we identify some open challenges and envision some future directions, with the hope of inspiring more research work on this important yet less investigated topic. The summary of debiasing methods reviewed in this survey can be found at https://github.com/jiawei-chen/RecDebiasing ."} | ||||
| 79 | +{"work_id": 4401495975, "title": "Enhancing K-nearest neighbor algorithm: a comprehensive review and performance analysis of modifications", "abstract": "Abstract The k-Nearest Neighbors (kNN) method, established in 1951, has since evolved into a pivotal tool in data mining, recommendation systems, and Internet of Things (IoT), among other areas. This paper presents a comprehensive review and performance analysis of modifications made to enhance the exact kNN techniques, particularly focusing on kNN Search and kNN Join for high-dimensional data. We delve deep into 31 kNN search methods and 12 kNN join methods, providing a methodological overview and analytical insight into each, emphasizing their strengths, limitations, and applicability. An important feature of our study is the provision of the source code for each of the kNN methods discussed, fostering ease of experimentation and comparative analysis for readers. Motivated by the rising significance of kNN in high-dimensional spaces and a recognized gap in comprehensive surveys on exact kNN techniques, our work seeks to bridge this gap. Additionally, we outline existing challenges and present potential directions for future research in the domain of kNN techniques, offering a holistic guide that amalgamates, compares, and dissects existing methodologies in a coherent manner. Graphical Abstract"} | ||||
| 80 | +{"work_id": 4406085118, "title": "Data-centric Artificial Intelligence: A Survey", "abstract": "Artificial Intelligence (AI) is making a profound impact in almost every domain. A vital enabler of its great success is the availability of abundant and high-quality data for building machine learning models. Recently, the role of data in AI has been significantly magnified, giving rise to the emerging concept of data-centric AI . The attention of researchers and practitioners has gradually shifted from advancing model design to enhancing the quality and quantity of the data. In this survey, we discuss the necessity of data-centric AI, followed by a holistic view of three general data-centric goals (training data development, inference data development, and data maintenance) and the representative methods. We also organize the existing literature from automation and collaboration perspectives, discuss the challenges, and tabulate the benchmarks for various tasks. We believe this is the first comprehensive survey that provides a global view of a spectrum of tasks across various stages of the data lifecycle. We hope it can help the readers efficiently grasp a broad picture of this field, and equip them with the techniques and further research ideas to systematically engineer data for building AI systems. A companion list of data-centric AI resources will be regularly updated on https://github.com/daochenzha/data-centric-AI ."} | ||||
| 81 | +{"work_id": 3015636663, "title": "Federated Learning in Mobile Edge Networks: A Comprehensive Survey", "abstract": "In recent years, mobile devices are equipped with increasingly advanced sensing and computing capabilities. Coupled with advancements in Deep Learning (DL), this opens up countless possibilities for meaningful applications, e.g., for medical purposes and in vehicular networks. Traditional cloud-based Machine Learning (ML) approaches require the data to be centralized in a cloud server or data center. However, this results in critical issues related to unacceptable latency and communication inefficiency. To this end, Mobile Edge Computing (MEC) has been proposed to bring intelligence closer to the edge, where data is produced. However, conventional enabling technologies for ML at mobile edge networks still require personal data to be shared with external parties, e.g., edge servers. Recently, in light of increasingly stringent data privacy legislations and growing privacy concerns, the concept of Federated Learning (FL) has been introduced. In FL, end devices use their local data to train an ML model required by the server. The end devices then send the model updates rather than raw data to the server for aggregation. FL can serve as an enabling technology in mobile edge networks since it enables the collaborative training of an ML model and also enables DL for mobile edge network optimization. However, in a large-scale and complex mobile edge network, heterogeneous devices with varying constraints are involved. This raises challenges of communication costs, resource allocation, and privacy and security in the implementation of FL at scale. In this survey, we begin with an introduction to the background and fundamentals of FL. Then, we highlight the aforementioned challenges of FL implementation and review existing solutions. Furthermore, we present the applications of FL for mobile edge network optimization. Finally, we discuss the important challenges and future research directions in FL."} | ||||
| 82 | +{"work_id": 3032576892, "title": "Comparative study on Python web frameworks: Flask and Django", "abstract": "The purpose of the thesis was to study the various features, advantages, and the limitation of two web development frameworks for Python programming language. It aims to compare the usage of Django and Flask frameworks from a novice point of view. The theoretical part of the thesis presents the various types of programming languages and web technologies. In the practical part, however, the study is divided into two parts, each part observing the respective web application framework. \\n \\n \\nIn order to perform the comparison, a social network and eCommerce like application was built for Flask and Django respectively. The comparison was started by developing the social network application first with Flask and finished with the e-commerce application using Django. Python programing language, SQLite database for the backend and HTML, JavaScript, and Ajax were used for the frontend technology. At the end of the project, both applications were deployed to the cloud platform called Heroku. \\n \\nAfter the comparison, it was found that the most significant advantages of Flask were that it provides simplicity, flexibility, fine-grained control and quick and easy to learn. On the other hand, Django was easy to work with because of its extensive features and support for libraries. Another main advantage of Django is its scalability. It is best fit for a large-scale application. Each framework has its limitations and radiates a fair share of disadvantages. For example, Django is a bit cumbersome for smaller sized applications. However, Flask is too simple to not have the necessary features within the framework. \\n \\nAs a result of this study, it seems that both frameworks are capable of serving production-grade web applications while having a fair share of advantages and disadvantages."} | ||||
| 83 | +{"work_id": 2784168960, "title": "Energy efficient dynamic virtual machine allocation with cpu usage prediction in cloud datacenters", "abstract": "Cataloged from PDF version of article."} | ||||
| 84 | +{"work_id": 4385584867, "title": "A Study on Smart Energy Management Framework Using Cloud Computing", "abstract": "This study focuses on investigating energy-aware resources and designing an energy-efficient cloud architecture. It aims to optimize the decentralization model and establish migration behavior to improve IT business operations using cloud computing. Several models were evaluated for performance metrics such as physical host use, power utilization, and service level agreement (SLA) misuse. These models include smart cloud optimization for resource configuration handling (SCORCH), V-MAN, decentralized energy-aware collaborative model (DEACM), efficient energy-aware resource management model (EEARMM), and energy and power-aware dynamic migration (EPADM). To handle resource configuration efficiently, the study employed V-MAN, DEACM, EEARMM, and EPADM within the framework of smart cloud optimization. Among these models, EPADM proved to be the most effective for resource utilization through dynamic VM migration. By leveraging EPADM, the cloud system can dynamically migrate virtual machines (VMs) to optimize resource allocation and energy consumption."} | ||||
| 85 | +{"work_id": 2793346081, "title": "Blockchain Meets IoT: An Architecture for Scalable Access Management in IoT", "abstract": "The Internet of Things (IoT) is stepping out of its infancy into full maturity and establishing itself as a part of the future Internet. One of the technical challenges of having billions of devices deployed worldwide is the ability to manage them. Although access management technologies exist in IoT, they are based on centralized models which introduce a new variety of technical limitations to manage them globally. In this paper, we propose a new architecture for arbitrating roles and permissions in IoT. The new architecture is a fully distributed access control system for IoT based on blockchain technology. The architecture is backed by a proof of concept implementation and evaluated in realistic IoT scenarios. The results show that the blockchain technology could be used as access management technology in specific scalable IoT scenarios."} | ||||
| 86 | +{"work_id": 2908737503, "title": "A Decentralized Privacy-Preserving Healthcare Blockchain for IoT", "abstract": "Medical care has become one of the most indispensable parts of human lives, leading to a dramatic increase in medical big data. To streamline the diagnosis and treatment process, healthcare professionals are now adopting Internet of Things (IoT)-based wearable technology. Recent years have witnessed billions of sensors, devices, and vehicles being connected through the Internet. One such technology-remote patient monitoring-is common nowadays for the treatment and care of patients. However, these technologies also pose grave privacy risks and security concerns about the data transfer and the logging of data transactions. These security and privacy problems of medical data could result from a delay in treatment progress, even endangering the patient's life. We propose the use of a blockchain to provide secure management and analysis of healthcare big data. However, blockchains are computationally expensive, demand high bandwidth and extra computational power, and are therefore not completely suitable for most resource-constrained IoT devices meant for smart cities. In this work, we try to resolve the above-mentioned issues of using blockchain with IoT devices. We propose a novel framework of modified blockchain models suitable for IoT devices that rely on their distributed nature and other additional privacy and security properties of the network. These additional privacy and security properties in our model are based on advanced cryptographic primitives. The solutions given here make IoT application data and transactions more secure and anonymous over a blockchain-based network."} | ||||
| 87 | +{"work_id": 1823805418, "title": "TCP Extensions for Multipath Operation with Multiple Addresses", "abstract": "TCP/IP communication is currently restricted to a single path per connection, yet multiple paths often exist between peers. The simultaneous use of these multiple paths for a TCP/IP session would improve resource usage within the network and thus improve user experience through higher throughput and improved resilience to network failure. Multipath TCP provides the ability to simultaneously use multiple paths between peers. This document presents a set of extensions to traditional TCP to support multipath operation. The protocol offers the same type of service to applications as TCP (i.e., a reliable bytestream), and it provides the components necessary to establish and use multiple TCP flows across potentially disjoint paths. This document specifies v1 of Multipath TCP, obsoleting v0 as specified in RFC 6824, through clarifications and modifications primarily driven by deployment experience. This document is a product of the Multipath TCP Working Group of the IETF. This is now a Proposed Standard."} | ||||
| 88 | +{"work_id": 2803371618, "title": "On blockchain and its integration with IoT. Challenges and opportunities", "abstract": "In the Internet of Things (IoT) vision, conventional devices become smart and autonomous. This vision is turning into a reality thanks to advances in technology, but there are still challenges to address, particularly in the security domain e.g., data reliability. Taking into account the predicted evolution of the IoT in the coming years, it is necessary to provide confidence in this huge incoming information source. Blockchain has emerged as a key technology that will transform the way in which we share information. Building trust in distributed environments without the need for authorities is a technological advance that has the potential to change many industries, the IoT among them. Disruptive technologies such as big data and cloud computing have been leveraged by IoT to overcome its limitations since its conception, and we think blockchain will be one of the next ones. This paper focuses on this relationship, investigates challenges in blockchain IoT applications, and surveys the most relevant work in order to analyze how blockchain could potentially improve the IoT."} | ||||
| 100 | {"work_id": 2940715617, "title": "Offloading Real-time DDoS Attack Detection to Programmable Data Planes", "abstract": "Nos \u00faltimos anos, ataques distribu\u00eddos de nega\u00e7\u00e3o de servi\u00e7o v\u00eam crescendo tanto em frequ\u00eancia quanto em volume de tr\u00e1fego com surtos atingindo taxas da ordem de terabits por segundo e compremetendo a disponibilidade de infraestruturas supostamente resilientes (e.g., DNS e hospedagem Web na nuvem). Na pr\u00e1tica, as solu\u00e7\u00f5es de detec\u00e7\u00e3o existentes valem-se de uma combina\u00e7\u00e3o de mecanismos, como amostragem de pacotes e transmiss\u00e3o dos dados coletados a um software externo, que dificulta a obten\u00e7\u00e3o de uma boa rela\u00e7ao entre acur\u00e1cia (maior \u00e9 melhor), consumo de recursos e lat\u00eancia (menor \u00e9 melhor). Planos de dados program\u00e1veis emergem como uma abordagem promissora para ajudar a cumprir esses requisitos, visto que dispositivos comutadores de pacotes podem ser configurados para executar algoritmos e examinar o tr\u00e1fego em velocidade de linha. Neste trabalho, exploramos primitivas em P4 a fim de projetar um mecanismo de inspe\u00e7\u00e3o de tr\u00e1fego com baixa granularidade, baixo consumo de recursos e baixa lat\u00eancia para a detec\u00e7\u00e3o de ataques distribu\u00eddos de nega\u00e7\u00e3o de servi\u00e7o em tempo real. A nossa proposta \u2013 a primeira a ser completamente implementada em plano de dados \u2013 contribui para lan\u00e7ar luz sobre os desafios da implementa\u00e7\u00e3o de l\u00f3gica de seguran\u00e7a sofisticada nesse contexto, dado que, para operar a altas taxas de transfer\u00eancia, a inspe\u00e7\u00e3o (e o processamento em geral) de pacotes est\u00e1 sujeita a um or\u00e7amento de tempo reduzido (dezenas de nanossegundos) e um espa\u00e7o de mem\u00f3ria limitado (da ordem de dezenas de megabytes). N\u00f3s avaliamos o mecanismo proposto usando capturas de pacotes da CAIDA. Os resultados mostram a detec\u00e7\u00e3o de ataques exclusivamente a partir do plano de dados com alta acur\u00e1cia (98,2%) e baixa lat\u00eancia ( 250 ms) mantendo o consumo de recursos reduzido (dezenas de kilobytes de SRAM por link de 1 Gbps e poucas centenas de entradas TCAM)."} | 89 | {"work_id": 2940715617, "title": "Offloading Real-time DDoS Attack Detection to Programmable Data Planes", "abstract": "Nos \u00faltimos anos, ataques distribu\u00eddos de nega\u00e7\u00e3o de servi\u00e7o v\u00eam crescendo tanto em frequ\u00eancia quanto em volume de tr\u00e1fego com surtos atingindo taxas da ordem de terabits por segundo e compremetendo a disponibilidade de infraestruturas supostamente resilientes (e.g., DNS e hospedagem Web na nuvem). Na pr\u00e1tica, as solu\u00e7\u00f5es de detec\u00e7\u00e3o existentes valem-se de uma combina\u00e7\u00e3o de mecanismos, como amostragem de pacotes e transmiss\u00e3o dos dados coletados a um software externo, que dificulta a obten\u00e7\u00e3o de uma boa rela\u00e7ao entre acur\u00e1cia (maior \u00e9 melhor), consumo de recursos e lat\u00eancia (menor \u00e9 melhor). Planos de dados program\u00e1veis emergem como uma abordagem promissora para ajudar a cumprir esses requisitos, visto que dispositivos comutadores de pacotes podem ser configurados para executar algoritmos e examinar o tr\u00e1fego em velocidade de linha. Neste trabalho, exploramos primitivas em P4 a fim de projetar um mecanismo de inspe\u00e7\u00e3o de tr\u00e1fego com baixa granularidade, baixo consumo de recursos e baixa lat\u00eancia para a detec\u00e7\u00e3o de ataques distribu\u00eddos de nega\u00e7\u00e3o de servi\u00e7o em tempo real. A nossa proposta \u2013 a primeira a ser completamente implementada em plano de dados \u2013 contribui para lan\u00e7ar luz sobre os desafios da implementa\u00e7\u00e3o de l\u00f3gica de seguran\u00e7a sofisticada nesse contexto, dado que, para operar a altas taxas de transfer\u00eancia, a inspe\u00e7\u00e3o (e o processamento em geral) de pacotes est\u00e1 sujeita a um or\u00e7amento de tempo reduzido (dezenas de nanossegundos) e um espa\u00e7o de mem\u00f3ria limitado (da ordem de dezenas de megabytes). N\u00f3s avaliamos o mecanismo proposto usando capturas de pacotes da CAIDA. Os resultados mostram a detec\u00e7\u00e3o de ataques exclusivamente a partir do plano de dados com alta acur\u00e1cia (98,2%) e baixa lat\u00eancia ( 250 ms) mantendo o consumo de recursos reduzido (dezenas de kilobytes de SRAM por link de 1 Gbps e poucas centenas de entradas TCAM)."} | ||
| 101 | {"work_id": 3023617420, "title": "A Comprehensive Review of the COVID-19 Pandemic and the Role of IoT, Drones, AI, Blockchain, and 5G in Managing its Impact", "abstract": "The unprecedented outbreak of the 2019 novel coronavirus, termed as COVID-19 by the World Health Organization (WHO), has placed numerous governments around the world in a precarious position. The impact of the COVID-19 outbreak, earlier witnessed by the citizens of China alone, has now become a matter of grave concern for virtually every country in the world. The scarcity of resources to endure the COVID-19 outbreak combined with the fear of overburdened healthcare systems has forced a majority of these countries into a state of partial or complete lockdown. The number of laboratory-confirmed coronavirus cases has been increasing at an alarming rate throughout the world, with reportedly more than 3 million confirmed cases as of 30 April 2020. Adding to these woes, numerous false reports, misinformation, and unsolicited fears in regards to coronavirus, are being circulated regularly since the outbreak of the COVID-19. In response to such acts, we draw on various reliable sources to present a detailed review of all the major aspects associated with the COVID-19 pandemic. In addition to the direct health implications associated with the outbreak of COVID-19, this study highlights its impact on the global economy. In drawing things to a close, we explore the use of technologies such as the Internet of Things (IoT), Unmanned Aerial Vehicles (UAVs), blockchain, Artificial Intelligence (AI), and 5G, among others, to help mitigate the impact of COVID-19 outbreak."} | 90 | {"work_id": 3023617420, "title": "A Comprehensive Review of the COVID-19 Pandemic and the Role of IoT, Drones, AI, Blockchain, and 5G in Managing its Impact", "abstract": "The unprecedented outbreak of the 2019 novel coronavirus, termed as COVID-19 by the World Health Organization (WHO), has placed numerous governments around the world in a precarious position. The impact of the COVID-19 outbreak, earlier witnessed by the citizens of China alone, has now become a matter of grave concern for virtually every country in the world. The scarcity of resources to endure the COVID-19 outbreak combined with the fear of overburdened healthcare systems has forced a majority of these countries into a state of partial or complete lockdown. The number of laboratory-confirmed coronavirus cases has been increasing at an alarming rate throughout the world, with reportedly more than 3 million confirmed cases as of 30 April 2020. Adding to these woes, numerous false reports, misinformation, and unsolicited fears in regards to coronavirus, are being circulated regularly since the outbreak of the COVID-19. In response to such acts, we draw on various reliable sources to present a detailed review of all the major aspects associated with the COVID-19 pandemic. In addition to the direct health implications associated with the outbreak of COVID-19, this study highlights its impact on the global economy. In drawing things to a close, we explore the use of technologies such as the Internet of Things (IoT), Unmanned Aerial Vehicles (UAVs), blockchain, Artificial Intelligence (AI), and 5G, among others, to help mitigate the impact of COVID-19 outbreak."} | ||
| 102 | {"work_id": 4255535209, "title": "Blockchain challenges and opportunities: a survey", "abstract": "Blockchain has numerous benefits such as decentralisation, persistency, anonymity and auditability. There is a wide spectrum of blockchain applications ranging from cryptocurrency, financial services, risk management, internet of things (IoT) to public and social services. Although a number of studies focus on using the blockchain technology in various application aspects, there is no comprehensive survey on the blockchain technology in both technological and application perspectives. To fill this gap, we conduct a comprehensive survey on the blockchain technology. In particular, this paper gives the blockchain taxonomy, introduces typical blockchain consensus algorithms, reviews blockchain applications and discusses technical challenges as well as recent advances in tackling the challenges. Moreover, this paper also points out the future directions in the blockchain technology."} | 91 | {"work_id": 4255535209, "title": "Blockchain challenges and opportunities: a survey", "abstract": "Blockchain has numerous benefits such as decentralisation, persistency, anonymity and auditability. There is a wide spectrum of blockchain applications ranging from cryptocurrency, financial services, risk management, internet of things (IoT) to public and social services. Although a number of studies focus on using the blockchain technology in various application aspects, there is no comprehensive survey on the blockchain technology in both technological and application perspectives. To fill this gap, we conduct a comprehensive survey on the blockchain technology. In particular, this paper gives the blockchain taxonomy, introduces typical blockchain consensus algorithms, reviews blockchain applications and discusses technical challenges as well as recent advances in tackling the challenges. Moreover, this paper also points out the future directions in the blockchain technology."} | ||
@@ -105,48 +94,58 @@ | |||||
| 105 | {"work_id": 2885100636, "title": "Blockchain and IoT Integration: A Systematic Survey", "abstract": "The Internet of Things (IoT) refers to the interconnection of smart devices to collect data and make intelligent decisions. However, a lack of intrinsic security measures makes IoT vulnerable to privacy and security threats. With its \"security by design,\" Blockchain (BC) can help in addressing major security requirements in IoT. BC capabilities like immutability, transparency, auditability, data encryption and operational resilience can help solve most architectural shortcomings of IoT. This article presents a comprehensive survey on BC and IoT integration. The objective of this paper is to analyze the current research trends on the usage of BC-related approaches and technologies in an IoT context. This paper presents the following novelties, with respect to related work: (i) it covers different application domains, organizing the available literature according to this categorization, (ii) it introduces two usage patterns, i.e., device manipulation and data management (open marketplace solution), and (iii) it reports on the development level of some of the presented solutions. We also analyze the main challenges faced by the research community in the smooth integration of BC and IoT, and point out the main open issues and future research directions. Last but not least, we also present a survey about novel uses of BC in the machine economy."} | 94 | {"work_id": 2885100636, "title": "Blockchain and IoT Integration: A Systematic Survey", "abstract": "The Internet of Things (IoT) refers to the interconnection of smart devices to collect data and make intelligent decisions. However, a lack of intrinsic security measures makes IoT vulnerable to privacy and security threats. With its \"security by design,\" Blockchain (BC) can help in addressing major security requirements in IoT. BC capabilities like immutability, transparency, auditability, data encryption and operational resilience can help solve most architectural shortcomings of IoT. This article presents a comprehensive survey on BC and IoT integration. The objective of this paper is to analyze the current research trends on the usage of BC-related approaches and technologies in an IoT context. This paper presents the following novelties, with respect to related work: (i) it covers different application domains, organizing the available literature according to this categorization, (ii) it introduces two usage patterns, i.e., device manipulation and data management (open marketplace solution), and (iii) it reports on the development level of some of the presented solutions. We also analyze the main challenges faced by the research community in the smooth integration of BC and IoT, and point out the main open issues and future research directions. Last but not least, we also present a survey about novel uses of BC in the machine economy."} | ||
| 106 | {"work_id": 4400531953, "title": "C-Pack: Packed Resources For General Chinese Embeddings", "abstract": "We introduce C-Pack, a package of resources that significantly advances the field of general text embeddings for Chinese. C-Pack includes three critical resources. 1) C-MTP is a massive training dataset for text embedding, which is based on the curation of vast unlabeled corpora and the integration of high-quality labeled corpora. 2) C-MTEB is a comprehensive benchmark for Chinese text embeddings covering 6 tasks and 35 datasets. 3) BGE is a family of embedding models covering multiple sizes. Our models outperform all prior Chinese text embeddings on C-MTEB by more than +10% upon the time of the release. We also integrate and optimize the entire suite of training methods for BGE. Along with our resources on general Chinese embedding, we release our data and models for English text embeddings. The English models also achieve state-of-the-art performance on the MTEB benchmark; meanwhile, our released English data is 2 times larger than the Chinese data. Both Chinese and English datasets are the largest public release of training data for text embeddings. All these resources are made publicly available at https://github.com/FlagOpen/FlagEmbedding."} | 95 | {"work_id": 4400531953, "title": "C-Pack: Packed Resources For General Chinese Embeddings", "abstract": "We introduce C-Pack, a package of resources that significantly advances the field of general text embeddings for Chinese. C-Pack includes three critical resources. 1) C-MTP is a massive training dataset for text embedding, which is based on the curation of vast unlabeled corpora and the integration of high-quality labeled corpora. 2) C-MTEB is a comprehensive benchmark for Chinese text embeddings covering 6 tasks and 35 datasets. 3) BGE is a family of embedding models covering multiple sizes. Our models outperform all prior Chinese text embeddings on C-MTEB by more than +10% upon the time of the release. We also integrate and optimize the entire suite of training methods for BGE. Along with our resources on general Chinese embedding, we release our data and models for English text embeddings. The English models also achieve state-of-the-art performance on the MTEB benchmark; meanwhile, our released English data is 2 times larger than the Chinese data. Both Chinese and English datasets are the largest public release of training data for text embeddings. All these resources are made publicly available at https://github.com/FlagOpen/FlagEmbedding."} | ||
| 107 | {"work_id": 1710433637, "title": "Stream Control Transmission Protocol", "abstract": "This document is an Internet-Draft and is in full conformance with all provisions of Section 10 of RFC 2026. Internet-Drafts are working documents of the Internet Engineering Task Force (IETF), its areas, and its working groups. Note that other groups may also distribute working documents as Internet-Drafts. Internet-Drafts are draft documents valid for a maximum of six months and may be updated, replaced, or obsoleted by other documents at any time. It is inappropriate to use Internet- Drafts as reference material or to cite them other than as \u2018\u2018work in progress.\u2019\u2019 The list of current Internet-Drafts can be accessed at"} | 96 | {"work_id": 1710433637, "title": "Stream Control Transmission Protocol", "abstract": "This document is an Internet-Draft and is in full conformance with all provisions of Section 10 of RFC 2026. Internet-Drafts are working documents of the Internet Engineering Task Force (IETF), its areas, and its working groups. Note that other groups may also distribute working documents as Internet-Drafts. Internet-Drafts are draft documents valid for a maximum of six months and may be updated, replaced, or obsoleted by other documents at any time. It is inappropriate to use Internet- Drafts as reference material or to cite them other than as \u2018\u2018work in progress.\u2019\u2019 The list of current Internet-Drafts can be accessed at"} | ||
| 108 | −{"work_id": 3032576892, "title": "Comparative study on Python web frameworks: Flask and Django", "abstract": "The purpose of the thesis was to study the various features, advantages, and the limitation of two web development frameworks for Python programming language. It aims to compare the usage of Django and Flask frameworks from a novice point of view. The theoretical part of the thesis presents the various types of programming languages and web technologies. In the practical part, however, the study is divided into two parts, each part observing the respective web application framework. \\n \\n \\nIn order to perform the comparison, a social network and eCommerce like application was built for Flask and Django respectively. The comparison was started by developing the social network application first with Flask and finished with the e-commerce application using Django. Python programing language, SQLite database for the backend and HTML, JavaScript, and Ajax were used for the frontend technology. At the end of the project, both applications were deployed to the cloud platform called Heroku. \\n \\nAfter the comparison, it was found that the most significant advantages of Flask were that it provides simplicity, flexibility, fine-grained control and quick and easy to learn. On the other hand, Django was easy to work with because of its extensive features and support for libraries. Another main advantage of Django is its scalability. It is best fit for a large-scale application. Each framework has its limitations and radiates a fair share of disadvantages. For example, Django is a bit cumbersome for smaller sized applications. However, Flask is too simple to not have the necessary features within the framework. \\n \\nAs a result of this study, it seems that both frameworks are capable of serving production-grade web applications while having a fair share of advantages and disadvantages."} | 97 | +{"work_id": 3010543330, "title": "Serverless in the Wild: Characterizing and Optimizing the Serverless Workload at a Large Cloud Provider", "abstract": "Function as a Service (FaaS) has been gaining popularity as a way to deploy computations to serverless backends in the cloud. This paradigm shifts the complexity of allocating and provisioning resources to the cloud provider, which has to provide the illusion of always-available resources (i.e., fast function invocations without cold starts) at the lowest possible resource cost. Doing so requires the provider to deeply understand the characteristics of the FaaS workload. Unfortunately, there has been little to no public information on these characteristics. Thus, in this paper, we first characterize the entire production FaaS workload of Azure Functions. We show for example that most functions are invoked very infrequently, but there is an 8-order-of-magnitude range of invocation frequencies. Using observations from our characterization, we then propose a practical resource management policy that significantly reduces the number of function coldstarts,while spending fewerresources than state-of-the-practice policies."} | ||
| 109 | −{"work_id": 2784168960, "title": "Energy efficient dynamic virtual machine allocation with cpu usage prediction in cloud datacenters", "abstract": "Cataloged from PDF version of article."} | 98 | +{"work_id": 2122465391, "title": "MapReduce: Simplified Data Processing on Large Cluster", "abstract": "MapReduce is a programming model and an associated implementation for processing and generating large data sets. Users specify a map function that processes a key/value pair to generate a set of intermediate key/value pairs, and a reduce function that merges all intermediate values associated with the same intermediate key. Many real world tasks are expressible in this model, as shown in the paper.\r\n\r\nPrograms written in this functional style are automatically parallelized and executed on a large cluster of commodity machines. The run-time system takes care of the details of partitioning the input data, scheduling the program's execution across a set of machines, handling machine failures, and managing the required inter-machine communication. This allows programmers without any experience with parallel and distributed systems to easily utilize the resources of a large distributed system.\r\n\r\nOur implementation of MapReduce runs on a large cluster of commodity machines and is highly scalable: a typical MapReduce computation processes many terabytes of data on thousands of machines. Programmers find the system easy to use: hundreds of MapReduce programs have been implemented and upwards of one thousand MapReduce jobs are executed on Google's clusters every day."} | ||
| 110 | −{"work_id": 4385584867, "title": "A Study on Smart Energy Management Framework Using Cloud Computing", "abstract": "This study focuses on investigating energy-aware resources and designing an energy-efficient cloud architecture. It aims to optimize the decentralization model and establish migration behavior to improve IT business operations using cloud computing. Several models were evaluated for performance metrics such as physical host use, power utilization, and service level agreement (SLA) misuse. These models include smart cloud optimization for resource configuration handling (SCORCH), V-MAN, decentralized energy-aware collaborative model (DEACM), efficient energy-aware resource management model (EEARMM), and energy and power-aware dynamic migration (EPADM). To handle resource configuration efficiently, the study employed V-MAN, DEACM, EEARMM, and EPADM within the framework of smart cloud optimization. Among these models, EPADM proved to be the most effective for resource utilization through dynamic VM migration. By leveraging EPADM, the cloud system can dynamically migrate virtual machines (VMs) to optimize resource allocation and energy consumption."} | 99 | +{"work_id": 2962850638, "title": "Logiikka ja vaativuus hajautetussa laskennassa", "abstract": "This dissertation studies the theory of distributed computing. In the distributed setting, computation is carried out by multiple independent computational units. They communicate with neighbouring units and collectively solve a problem. Systems of this kind are widespread in the information society as well as in the natural world: prime examples include the Internet, multi-processor computer systems, the cells of a biological organism and human social networks. Therefore it is important to gain knowledge on the fundamental capabilities and limitations of distributed systems. Our work takes place in the context of deterministic and synchronous message-passing models of distributed computing. Such models abstract away some possible features of distributed systems, such as asynchrony, congestion and faults, while putting emphasis on the amount of communication needed between the units. The computational units are expected to solve a problem related to the structure of the underlying communication network. More specifically, we study the standard LOCAL model, the standard port-numbering model and several weaker variants of the latter. The contributions of this dissertation are two-fold. First, we give new methods for studying distributed computing by establishing a strong connection between several weak variants of the port-numbering model and corresponding variants of modal logic. This makes it possible to apply existing logical tools, such as bisimulation, to understand computation in the distributed setting. We also give a full characterisation of the relationships between the models of computing, which has implications on the side of mathematical logic. Second, we prove the existence of various new non-empty complexity classes. One of our results studies the relationship between time and space complexity, which is a relatively new topic in distributed computing research. We demonstrate the existence of a problem that can be solved in a constant amount of space in a very weak model but nonetheless requires a non-constant amount of time even in a much stronger model of computing. Another result continues the recent success on developing complexity theory for the LOCAL model. We introduce a new technique which shows the existence of an infinite hierarchy of problems with novel time complexities."} | ||
| 111 | −{"work_id": 2793346081, "title": "Blockchain Meets IoT: An Architecture for Scalable Access Management in IoT", "abstract": "The Internet of Things (IoT) is stepping out of its infancy into full maturity and establishing itself as a part of the future Internet. One of the technical challenges of having billions of devices deployed worldwide is the ability to manage them. Although access management technologies exist in IoT, they are based on centralized models which introduce a new variety of technical limitations to manage them globally. In this paper, we propose a new architecture for arbitrating roles and permissions in IoT. The new architecture is a fully distributed access control system for IoT based on blockchain technology. The architecture is backed by a proof of concept implementation and evaluated in realistic IoT scenarios. The results show that the blockchain technology could be used as access management technology in specific scalable IoT scenarios."} | 100 | +{"work_id": 4320712473, "title": "The Internet of Things (IoT) in healthcare: Taking stock and moving forward", "abstract": "Recent improvements in the Internet of Things (IoT) have allowed healthcare to evolve rapidly. This article summarizes previous studies on IoT applications in healthcare. A comprehensive review and a bibliometric analysis were performed to objectively summarize the growth of IoT research in healthcare. To begin, 2,990 journal articles were carefully selected for further investigation. These publications were analyzed based on various bibliometric metrics, including publication year, journals, authors, institutions, and countries. Keyword co-occurrence and co-citation networks were generated to unravel significant research hotspots. The findings show that IoT research has received considerable interest from the healthcare community. Based on the results of the keyword co-occurrence network, IoT healthcare applications, blockchain applications, Artificial Intelligence (AI) techniques, 5G telecommunications, as well as data analytics and computing technologies emerged as important topics. The co-citation network analysis reveals other important themes, including authentication schemes, fog computing, cloud-IoT integration, and cognitive smart healthcare. Overall, the review offers scholars an improved understanding of the current status of IoT research in healthcare and identifies knowledge gaps for future research. This review also informs healthcare professionals about the latest developments and applications of IoT in the healthcare sector."} | ||
| 112 | −{"work_id": 2908737503, "title": "A Decentralized Privacy-Preserving Healthcare Blockchain for IoT", "abstract": "Medical care has become one of the most indispensable parts of human lives, leading to a dramatic increase in medical big data. To streamline the diagnosis and treatment process, healthcare professionals are now adopting Internet of Things (IoT)-based wearable technology. Recent years have witnessed billions of sensors, devices, and vehicles being connected through the Internet. One such technology-remote patient monitoring-is common nowadays for the treatment and care of patients. However, these technologies also pose grave privacy risks and security concerns about the data transfer and the logging of data transactions. These security and privacy problems of medical data could result from a delay in treatment progress, even endangering the patient's life. We propose the use of a blockchain to provide secure management and analysis of healthcare big data. However, blockchains are computationally expensive, demand high bandwidth and extra computational power, and are therefore not completely suitable for most resource-constrained IoT devices meant for smart cities. In this work, we try to resolve the above-mentioned issues of using blockchain with IoT devices. We propose a novel framework of modified blockchain models suitable for IoT devices that rely on their distributed nature and other additional privacy and security properties of the network. These additional privacy and security properties in our model are based on advanced cryptographic primitives. The solutions given here make IoT application data and transactions more secure and anonymous over a blockchain-based network."} | 101 | +{"work_id": 3133849783, "title": "Contrastive Learning for Sequential Recommendation", "abstract": "Sequential recommendation methods play a crucial role in modern recommender systems because of their ability to capture a user's dynamic interest from her/his historical inter-actions. Despite their success, we argue that these approaches usually rely on the sequential prediction task to optimize the huge amounts of parameters. They usually suffer from the data sparsity problem, which makes it difficult for them to learn high-quality user representations. To tackle that, inspired by recent advances of contrastive learning techniques in the computer vision, we propose a novel multi-task framework called Contrastive Learning for Sequential Recommendation (CL4SRec). CL4SRec not only takes advantage of the traditional next item prediction task but also utilizes the contrastive learning framework to derive self-supervision signals from the original user behavior sequences. Therefore, it can extract more meaningful user patterns and further encode the user representations effectively. In addition, we propose three data augmentation approaches to construct self-supervision signals. Extensive experiments on four public datasets demonstrate that CL4SRec achieves state-of-the-art performance over existing baselines by inferring better user representations."} | ||
| 113 | −{"work_id": 1823805418, "title": "TCP Extensions for Multipath Operation with Multiple Addresses", "abstract": "TCP/IP communication is currently restricted to a single path per connection, yet multiple paths often exist between peers. The simultaneous use of these multiple paths for a TCP/IP session would improve resource usage within the network and thus improve user experience through higher throughput and improved resilience to network failure. Multipath TCP provides the ability to simultaneously use multiple paths between peers. This document presents a set of extensions to traditional TCP to support multipath operation. The protocol offers the same type of service to applications as TCP (i.e., a reliable bytestream), and it provides the components necessary to establish and use multiple TCP flows across potentially disjoint paths. This document specifies v1 of Multipath TCP, obsoleting v0 as specified in RFC 6824, through clarifications and modifications primarily driven by deployment experience. This document is a product of the Multipath TCP Working Group of the IETF. This is now a Proposed Standard."} | 102 | +{"work_id": 1973501242, "title": "Time, clocks, and the ordering of events in a distributed system", "abstract": "The concept of one event happening before another in a distributed system is examined, and is shown to define a partial ordering of the events. A distributed algorithm is given for synchronizing a system of logical clocks which can be used to totally order the events. The use of the total ordering is illustrated with a method for solving synchronization problems. The algorithm is then specialized for synchronizing physical clocks, and a bound is derived on how far out of synchrony the clocks can become."} | ||
| 114 | −{"work_id": 2803371618, "title": "On blockchain and its integration with IoT. Challenges and opportunities", "abstract": "In the Internet of Things (IoT) vision, conventional devices become smart and autonomous. This vision is turning into a reality thanks to advances in technology, but there are still challenges to address, particularly in the security domain e.g., data reliability. Taking into account the predicted evolution of the IoT in the coming years, it is necessary to provide confidence in this huge incoming information source. Blockchain has emerged as a key technology that will transform the way in which we share information. Building trust in distributed environments without the need for authorities is a technological advance that has the potential to change many industries, the IoT among them. Disruptive technologies such as big data and cloud computing have been leveraged by IoT to overcome its limitations since its conception, and we think blockchain will be one of the next ones. This paper focuses on this relationship, investigates challenges in blockchain IoT applications, and surveys the most relevant work in order to analyze how blockchain could potentially improve the IoT."} | 103 | +{"work_id": 2921608598, "title": "Towards Secure Industrial IoT: Blockchain System With Credit-Based Consensus Mechanism", "abstract": "Industrial Internet of Things (IIoT) plays an indispensable role for Industry 4.0, where people are committed to implement a general, scalable, and secure IIoT system to be adopted across various industries. However, existing IIoT systems are vulnerable to single point of failure and malicious attacks, which cannot provide stable services. Due to the resilience and security promise of blockchain, the idea of combining blockchain and Internet of Things (IoT) gains considerable interest. However, blockchains are power-intensive and low-throughput, which are not suitable for power-constrained IoT devices. To tackle these challenges, we present a blockchain system with credit-based consensus mechanism for IIoT. We propose a credit-based proof-of-work (PoW) mechanism for IoT devices, which can guarantee system security and transaction efficiency simultaneously. In order to protect sensitive data confidentiality, we design a data authority management method to regulate the access to sensor data. In addition, our system is built based on directed acyclic graph -structured blockchains, which is more efficient than the Satoshi-style blockchain in performance. We implement the system on Raspberry Pi, and conduct a case study for the smart factory. Extensive evaluation and analysis results demonstrate that credit-based PoW mechanism and data access control are secure and efficient in IIoT."} | ||
| 115 | −{"work_id": 4285039189, "title": "Mobile ad-hoc networks (MANET)", "abstract": "\u0388\u03bd\u03b1 \u039a\u03b9\u03bd\u03b7\u03c4\u03cc \u0391\u03b4\u03cc\u03bc\u03b7\u03c4\u03bf \u0394\u03af\u03ba\u03c4\u03c5\u03bf \u03b1\u03c0\u03bf\u03c4\u03b5\u03bb\u03b5\u03af\u03c4\u03b1\u03b9 \u03b1\u03c0\u03cc \u03ba\u03cc\u03bc\u03b2\u03bf\u03c5\u03c2 \u03c0\u03bf\u03c5 \u03ba\u03b9\u03bd\u03bf\u03cd\u03bd\u03c4\u03b1\u03b9, \u03b5\u03af\u03c4\u03b5 \u03b1\u03ba\u03bf\u03bb\u03bf\u03c5\u03b8\u03ce\u03bd\u03c4\u03b1\u03c2 \u03ba\u03ac\u03c0\u03bf\u03b9\u03bf \u03c3\u03c5\u03b3\u03ba\u03b5\u03ba\u03c1\u03b9\u03bc\u03ad\u03bd\u03bf \u03bc\u03bf\u03c4\u03af\u03b2\u03bf \u03ba\u03af\u03bd\u03b7\u03c3\u03b7\u03c2, \u03b5\u03af\u03c4\u03b5 \u03c4\u03c5\u03c7\u03b1\u03af\u03b1, \u03c7\u03c9\u03c1\u03af\u03c2 \u03bd\u03b1 \u03c5\u03c0\u03ac\u03c1\u03c7\u03b5\u03b9 \u03ba\u03ac\u03c0\u03bf\u03b9\u03b1 \u03b5\u03c0\u03b9\u03c0\u03bb\u03ad\u03bf\u03bd \u03c5\u03c0\u03bf\u03b4\u03bf\u03bc\u03ae \u03c0\u03bf\u03c5 \u03bd\u03b1 \u03c5\u03c0\u03bf\u03c3\u03c4\u03b7\u03c1\u03af\u03b6\u03b5\u03b9 \u03c4\u03b7\u03bd \u03bb\u03b5\u03b9\u03c4\u03bf\u03c5\u03c1\u03b3\u03af\u03b1 \u03c4\u03bf\u03c5. \u0395\u03be \u03bf\u03c1\u03b9\u03c3\u03bc\u03bf\u03cd, \u03c3\u03c4\u03bf \u03b4\u03af\u03ba\u03c4\u03c5\u03bf \u03b1\u03c5\u03c4\u03cc \u03b4\u03b5\u03bd \u03c5\u03c0\u03ac\u03c1\u03c7\u03bf\u03c5\u03bd \u03c0\u03c1\u03bf\u03ba\u03b1\u03b8\u03bf\u03c1\u03b9\u03c3\u03bc\u03ad\u03bd\u03bf\u03b9 \u03c1\u03cc\u03bb\u03bf\u03b9 \u03b3\u03b9\u03b1 \u03c4\u03bf\u03c5\u03c2 \u03ba\u03cc\u03bc\u03b2\u03bf\u03c5\u03c2 \u03c0\u03bf\u03c5 \u03c3\u03c5\u03bc\u03bc\u03b5\u03c4\u03ad\u03c7\u03bf\u03c5\u03bd, \u03b1\u03bb\u03bb\u03ac \u03c4\u03b1 \u03b4\u03b9\u03ac\u03c6\u03bf\u03c1\u03b1 \u03ba\u03b1\u03b8\u03ae\u03ba\u03bf\u03bd\u03c4\u03b1 \u03c0\u03bf\u03c5 \u03b1\u03bd\u03b1\u03bb\u03b1\u03bc\u03b2\u03ac\u03bd\u03bf\u03c5\u03bd \u03b5\u03af\u03bd\u03b1\u03b9 \u03b1\u03c0\u03bf\u03c4\u03ad\u03bb\u03b5\u03c3\u03bc\u03b1 \u03c4\u03b7\u03c2 \u03b8\u03ad\u03c3\u03b7\u03c2 \u03c4\u03bf\u03c5\u03c2 \u03c3\u03c4\u03bf \u03c7\u03ce\u03c1\u03bf, \u03c4\u03c9\u03bd \u03b5\u03bd\u03b5\u03c1\u03b3\u03b5\u03b9\u03b1\u03ba\u03ce\u03bd \u03ba\u03b1\u03b9 \u03c5\u03c0\u03bf\u03bb\u03bf\u03b3\u03b9\u03c3\u03c4\u03b9\u03ba\u03ce\u03bd \u03b1\u03c0\u03bf\u03b8\u03b5\u03bc\u03ac\u03c4\u03c9\u03bd \u03c4\u03bf\u03c5\u03c2 \u03ba\u03b1\u03b9 \u03c4\u03b7\u03c2 \u03b4\u03b9\u03b1\u03b8\u03b5\u03c3\u03b9\u03bc\u03cc\u03c4\u03b7\u03c4\u03ac\u03c2 \u03c4\u03bf\u03c5\u03c2. \u039a\u03b1\u03c4\u03ac \u03c4\u03b7 \u03b4\u03b9\u03ac\u03c1\u03ba\u03b5\u03b9\u03b1 \u03c4\u03b7\u03c2 \u03c3\u03c5\u03bd\u03ae\u03b8\u03bf\u03c5\u03c2 \u03bb\u03b5\u03b9\u03c4\u03bf\u03c5\u03c1\u03b3\u03af\u03b1\u03c2 \u03b5\u03bd\u03cc\u03c2 \u03c4\u03ad\u03c4\u03bf\u03b9\u03bf\u03c5 \u03b4\u03b9\u03ba\u03c4\u03cd\u03bf\u03c5 \u03cc\u03bb\u03bf\u03b9 \u03bf\u03b9 \u03ba\u03cc\u03bc\u03b2\u03bf\u03b9 \u03c3\u03c5\u03bd\u03b5\u03c1\u03b3\u03ac\u03b6\u03bf\u03bd\u03c4\u03b1\u03b9 \u03b5\u03ba\u03c4\u03b5\u03bb\u03ce\u03bd\u03c4\u03b1\u03c2 \u03bc\u03b9\u03b1 \u03c0\u03bb\u03b5\u03b9\u03ac\u03b4\u03b1 \u03ba\u03b1\u03b8\u03b7\u03ba\u03cc\u03bd\u03c4\u03c9\u03bd, \u03ad\u03c4\u03c3\u03b9 \u03ce\u03c3\u03c4\u03b5 \u03b7 \u03c0\u03bb\u03b7\u03c1\u03bf\u03c6\u03bf\u03c1\u03af\u03b1 \u03bd\u03b1 \u03bc\u03b5\u03c4\u03b1\u03c6\u03ad\u03c1\u03b5\u03c4\u03b1\u03b9 \u03b1\u03c0\u03cc \u03c4\u03bf\u03bd \u03ba\u03cc\u03bc\u03b2\u03bf \u03c0\u03bf\u03c5 \u03c0\u03b1\u03c1\u03ac\u03b3\u03b5\u03c4\u03b1\u03b9 \u03bc\u03ad\u03c7\u03c1\u03b9 \u03c4\u03bf\u03bd \u03ba\u03cc\u03bc\u03b2\u03bf \u03c0\u03bf\u03c5 \u03b8\u03b1 \u03c4\u03b7\u03bd \u03ba\u03b1\u03c4\u03b1\u03bd\u03b1\u03bb\u03ce\u03c3\u03b5\u03b9/\u03b1\u03be\u03b9\u03bf\u03c0\u03bf\u03b9\u03ae\u03c3\u03b5\u03b9. \u039f\u03b9 \u03ba\u03cc\u03bc\u03b2\u03bf\u03b9 \u03b1\u03c5\u03c4\u03bf\u03af \u03b5\u03af\u03bd\u03b1\u03b9, \u03c3\u03c5\u03bd\u03ae\u03b8\u03c9\u03c2, \u03c0\u03b5\u03c1\u03b9\u03bf\u03c1\u03b9\u03c3\u03bc\u03ad\u03bd\u03c9\u03bd \u03b4\u03c5\u03bd\u03b1\u03c4\u03bf\u03c4\u03ae\u03c4\u03c9\u03bd (\u03c5\u03c0\u03bf\u03bb\u03bf\u03b3\u03b9\u03c3\u03c4\u03b9\u03ba\u03ce\u03bd, \u03bc\u03bd\u03ae\u03bc\u03b7\u03c2, \u03b5\u03bd\u03ad\u03c1\u03b3\u03b5\u03b9\u03b1\u03c2), \u03ba\u03ac\u03c4\u03b9 \u03c0\u03bf\u03c5 \u03c0\u03c1\u03ad\u03c0\u03b5\u03b9 \u03bd\u03b1 \u03bb\u03b7\u03c6\u03b8\u03b5\u03af \u03c5\u03c0' \u03cc\u03c8\u03b9\u03bd \u03ba\u03b1\u03c4\u03ac \u03c4\u03bf\u03bd \u03c3\u03c7\u03b5\u03b4\u03b9\u03b1\u03c3\u03bc\u03cc \u03ba\u03b1\u03b9 \u03c4\u03b7\u03bd \u03c5\u03bb\u03bf\u03c0\u03bf\u03af\u03b7\u03c3\u03b7 \u03c4\u03bf\u03c5 \u03b4\u03b9\u03ba\u03c4\u03cd\u03bf\u03c5. \u0395\u03c0\u03b9\u03c0\u03bb\u03ad\u03bf\u03bd, \u03b5\u03af\u03bd\u03b1\u03b9 \u03b4\u03c5\u03bd\u03b1\u03c4\u03cc\u03bd \u03bd\u03b1 \u03c0\u03b1\u03c1\u03b5\u03b9\u03c3\u03c6\u03c1\u03ae\u03c3\u03bf\u03c5\u03bd \u03c3\u03c4\u03bf \u03b4\u03af\u03ba\u03c4\u03c5\u03bf \u03ba\u03b1\u03ba\u03cc\u03b2\u03bf\u03c5\u03bb\u03bf\u03b9 \u03ba\u03cc\u03bc\u03b2\u03bf\u03b9 \u03bc\u03b5 \u03c3\u03c4\u03cc\u03c7\u03bf \u03c4\u03b7\u03bd \u03c5\u03c0\u03bf\u03bd\u03cc\u03bc\u03b5\u03c5\u03c3\u03ae \u03c4\u03bf\u03c5.\u0388\u03bd\u03b1\u03c2 \u03ba\u03b1\u03ba\u03cc\u03b2\u03bf\u03c5\u03bb\u03bf\u03c2 \u03ba\u03cc\u03bc\u03b2\u03bf\u03c2 \u03b5\u03c0\u03b9\u03b4\u03b9\u03ce\u03ba\u03b5\u03b9 \u03bc\u03b5 \u03c4\u03b7 \u03b4\u03c1\u03ac\u03c3\u03b7 \u03c4\u03bf\u03c5 \u03bd\u03b1 \u03c0\u03c1\u03bf\u03ba\u03b1\u03bb\u03ad\u03c3\u03b5\u03b9 \u03c0\u03c1\u03cc\u03c9\u03c1\u03b7 \u03b5\u03be\u03ac\u03bd\u03c4\u03bb\u03b7\u03c3\u03b7 \u03c4\u03c9\u03bd \u03c0\u03cc\u03c1\u03c9\u03bd \u03c4\u03bf\u03c5 \u03b4\u03b9\u03ba\u03c4\u03cd\u03bf\u03c5, \u03c5\u03c0\u03bf\u03bd\u03bf\u03bc\u03b5\u03cd\u03bf\u03bd\u03c4\u03b1\u03c2 \u03ad\u03c4\u03c3\u03b9 \u03c4\u03b7\u03bd \u03bb\u03b5\u03b9\u03c4\u03bf\u03c5\u03c1\u03b3\u03b9\u03ba\u03cc\u03c4\u03b7\u03c4\u03ac \u03c4\u03bf\u03c5, \u03bd\u03b1 \u03b8\u03ad\u03c3\u03b5\u03b9 \u03c3\u03b5 \u03ba\u03af\u03bd\u03b4\u03c5\u03bd\u03bf \u03c4\u03b7\u03bd \u03b1\u03c3\u03c6\u03ac\u03bb\u03b5\u03b9\u03ac \u03c4\u03bf\u03c5 \u03ba\u03b1\u03b9 \u03c4\u03b7\u03bd \u03b1\u03ba\u03b5\u03c1\u03b1\u03b9\u03cc\u03c4\u03b7\u03c4\u03b1 \u03c4\u03c9\u03bd \u03c0\u03bb\u03b7\u03c1\u03bf\u03c6\u03bf\u03c1\u03b9\u03ce\u03bd \u03c0\u03bf\u03c5 \u03b4\u03b9\u03b1\u03ba\u03b9\u03bd\u03bf\u03cd\u03bd\u03c4\u03b1\u03b9 \u03ae/\u03ba\u03b1\u03b9 \u03bd\u03b1 \u03c5\u03c0\u03bf\u03ba\u03bb\u03ad\u03c8\u03b5\u03b9 \u03b5\u03c5\u03b1\u03af\u03c3\u03b8\u03b7\u03c4\u03b1 \u03b4\u03b5\u03b4\u03bf\u03bc\u03ad\u03bd\u03b1 \u03c4\u03c9\u03bd \u03c7\u03c1\u03b7\u03c3\u03c4\u03ce\u03bd \u03c4\u03bf\u03c5 \u03b4\u03b9\u03ba\u03c4\u03cd\u03bf\u03c5. \u0395\u03c0\u03b9\u03c0\u03bb\u03ad\u03bf\u03bd, \u03c3\u03c4\u03cc\u03c7\u03bf\u03c2 \u03c4\u03bf\u03c5 \u03ba\u03b1\u03ba\u03cc\u03b2\u03bf\u03c5\u03bb\u03bf\u03c5 \u03ba\u03cc\u03bc\u03b2\u03bf\u03c5 \u03bc\u03c0\u03bf\u03c1\u03b5\u03af \u03bd\u03b1 \u03b5\u03af\u03bd\u03b1\u03b9 \u03ba\u03b1\u03b9 \u03b7 \u03c6\u03c5\u03c3\u03b9\u03ba\u03ae \u03b1\u03ba\u03b5\u03c1\u03b1\u03b9\u03cc\u03c4\u03b7\u03c4\u03b1 \u03c4\u03c9\u03bd \u03ba\u03cc\u03bc\u03b2\u03c9\u03bd, \u03b4\u03b5\u03b4\u03bf\u03bc\u03ad\u03bd\u03bf\u03c5 \u03cc\u03c4\u03b9 \u03c3\u03c5\u03c7\u03bd\u03ac, \u03c4\u03bf \u03b5\u03bd\u03b5\u03c1\u03b3\u03b5\u03b9\u03b1\u03ba\u03cc \u03b1\u03c0\u03cc\u03b8\u03b5\u03bc\u03b1 \u03c4\u03bf\u03c5 \u03c3\u03c4\u03cc\u03c7\u03bf\u03c5 \u03bc\u03b9\u03b1\u03c2 \u03b5\u03c0\u03af\u03b8\u03b5\u03c3\u03b7\u03c2 \u03b5\u03af\u03bd\u03b1\u03b9 \u03b1\u03c3\u03cd\u03bc\u03c6\u03bf\u03c1\u03bf \u03bf\u03b9\u03ba\u03bf\u03bd\u03bf\u03bc\u03b9\u03ba\u03ac, \u03b4\u03cd\u03c3\u03ba\u03bf\u03bb\u03bf \u03ae \u03b1\u03ba\u03cc\u03bc\u03b1 \u03ba\u03b1\u03b9 \u03b1\u03b4\u03cd\u03bd\u03b1\u03c4\u03bf \u03bd\u03b1 \u03b1\u03bd\u03b1\u03c0\u03bb\u03b7\u03c1\u03c9\u03b8\u03b5\u03af. \u0391\u03c5\u03c4\u03ae \u03b7 \u0394\u03b9\u03b4\u03b1\u03ba\u03c4\u03bf\u03c1\u03b9\u03ba\u03ae \u0394\u03b9\u03b1\u03c4\u03c1\u03b9\u03b2\u03ae \u03c0\u03c1\u03bf\u03c4\u03b5\u03af\u03bd\u03b5\u03b9 \u03ad\u03bd\u03b1 \u03c0\u03bb\u03ae\u03c1\u03b5\u03c2 \u03c0\u03c1\u03c9\u03c4\u03cc\u03ba\u03bf\u03bb\u03bb\u03bf \u03c0\u03bf\u03c5 \u03b1\u03c6\u03bf\u03c1\u03ac \u03c3\u03c4\u03b9\u03c2 \u03b4\u03bf\u03c3\u03bf\u03bb\u03b7\u03c8\u03af\u03b5\u03c2 \u03ba\u03b9\u03bd\u03b7\u03c4\u03ce\u03bd \u03ba\u03cc\u03bc\u03b2\u03c9\u03bd \u03c0\u03bf\u03c5 \u03bb\u03b5\u03b9\u03c4\u03bf\u03c5\u03c1\u03b3\u03bf\u03cd\u03bd \u03c3\u03b5 \u03ad\u03bd\u03b1 \u03b4\u03c5\u03bd\u03b1\u03bc\u03b9\u03ba\u03cc \u03c0\u03b5\u03c1\u03b9\u03b2\u03ac\u03bb\u03bb\u03bf\u03bd \u03ba\u03b1\u03b9 \u03c4\u03bf \u03bf\u03c0\u03bf\u03af\u03bf \u03b4\u03b9\u03b1\u03c3\u03c6\u03b1\u03bb\u03af\u03b6\u03b5\u03b9 \u03c4\u03cc\u03c3\u03bf \u03c4\u03b7\u03bd \u03b1\u03c3\u03c6\u03ac\u03bb\u03b5\u03b9\u03b1 \u03c4\u03c9\u03bd \u03b4\u03bf\u03c3\u03bf\u03bb\u03b7\u03c8\u03b9\u03ce\u03bd, \u03cc\u03c3\u03bf \u03ba\u03b1\u03b9 \u03c4\u03b7 \u03b2\u03ad\u03bb\u03c4\u03b9\u03c3\u03c4\u03b7 \u03b5\u03ba\u03bc\u03b5\u03c4\u03ac\u03bb\u03bb\u03b5\u03c5\u03c3\u03b7 \u03c4\u03c9\u03bd \u03c0\u03cc\u03c1\u03c9\u03bd \u03c4\u03bf\u03c5 \u03b4\u03b9\u03ba\u03c4\u03cd\u03bf\u03c5. \u03a3\u03c5\u03bd\u03bf\u03c0\u03c4\u03b9\u03ba\u03ac, \u03c0\u03c1\u03bf\u03c4\u03b5\u03af\u03bd\u03b5\u03c4\u03b1\u03b9 \u03b7 \u03ba\u03b1\u03c4\u03ac\u03c4\u03bc\u03b7\u03c3\u03b7 \u03c4\u03bf\u03c5 \u03b1\u03b4\u03cc\u03bc\u03b7\u03c4\u03bf\u03c5 \u03ba\u03b9\u03bd\u03b7\u03c4\u03bf\u03cd \u03b4\u03b9\u03ba\u03c4\u03cd\u03bf\u03c5 \u03c3\u03b5 \u03c3\u03c5\u03c3\u03c4\u03ac\u03b4\u03b5\u03c2, \u03b7 \u03b1\u03bd\u03ac\u03b4\u03b5\u03b9\u03be\u03b7 \u03b5\u03bd\u03cc\u03c2 \u03ba\u03cc\u03bc\u03b2\u03bf\u03c5 \u03c0\u03bf\u03c5 \u03b8\u03b1 \u03b5\u03bd\u03b5\u03c1\u03b3\u03b5\u03af \u03c9\u03c2 \u03b5\u03c0\u03b9\u03ba\u03b5\u03c6\u03b1\u03bb\u03ae\u03c2 \u03c4\u03b7\u03c2 \u03c3\u03c5\u03c3\u03c4\u03ac\u03b4\u03b1\u03c2, \u03c0\u03b5\u03c1\u03b9\u03b3\u03c1\u03ac\u03c6\u03bf\u03bd\u03c4\u03b1\u03b9 \u03b1\u03bd\u03b1\u03bb\u03c5\u03c4\u03b9\u03ba\u03ac \u03c4\u03b1 \u03b2\u03ae\u03bc\u03b1\u03c4\u03b1 \u03c0\u03bf\u03c5 \u03c0\u03c1\u03ad\u03c0\u03b5\u03b9 \u03bd\u03b1 \u03b1\u03ba\u03bf\u03bb\u03bf\u03c5\u03b8\u03bf\u03cd\u03bd \u03bf\u03b9 \u03ba\u03cc\u03bc\u03b2\u03bf\u03b9 \u03ce\u03c3\u03c4\u03b5 \u03bd\u03b1 \u03b5\u03be\u03b1\u03c3\u03c6\u03b1\u03bb\u03af\u03b6\u03bf\u03bd\u03c4\u03b1\u03b9 \u03bf\u03b9 \u03b1\u03be\u03b9\u03cc\u03c0\u03b9\u03c3\u03c4\u03b5\u03c2 \u03c3\u03c5\u03bd\u03b1\u03bb\u03bb\u03b1\u03b3\u03ad\u03c2 \u03bc\u03b5\u03c4\u03b1\u03be\u03cd \u03c4\u03bf\u03c5\u03c2. \u039a\u03b5\u03bd\u03c4\u03c1\u03b9\u03ba\u03ae \u03b8\u03ad\u03c3\u03b7 \u03c3\u03c4\u03bf \u03c0\u03c1\u03c9\u03c4\u03cc\u03ba\u03bf\u03bb\u03bb\u03bf \u03ad\u03c7\u03b5\u03b9 \u03ad\u03bd\u03b1 \u03c3\u03c7\u03ae\u03bc\u03b1 \u03ad\u03b3\u03ba\u03b1\u03b9\u03c1\u03bf\u03c5 \u03b5\u03bd\u03c4\u03bf\u03c0\u03b9\u03c3\u03bc\u03bf\u03cd \u03ba\u03ac\u03c0\u03bf\u03b9\u03bf\u03c5 \u03ba\u03b1\u03ba\u03cc\u03b2\u03bf\u03c5\u03bb\u03bf\u03c5 \u03ba\u03cc\u03bc\u03b2\u03bf\u03c5 \u03ba\u03b1\u03b9 \u03c4\u03b7\u03c2 \u03b1\u03c0\u03bf\u03ba\u03b1\u03c4\u03ac\u03c3\u03c4\u03b1\u03c3\u03b7\u03c2 \u03c4\u03b7\u03c2 \u03b5\u03bc\u03c0\u03b9\u03c3\u03c4\u03bf\u03c3\u03cd\u03bd\u03b7\u03c2 \u03b5\u03bd\u03cc\u03c2 \u03ba\u03cc\u03bc\u03b2\u03bf\u03c5 \u03bf \u03bf\u03c0\u03bf\u03af\u03bf\u03c2, \u03b3\u03b9\u03b1 \u03b4\u03b9\u03ac\u03c6\u03bf\u03c1\u03bf\u03c5\u03c2 \u03bb\u03cc\u03b3\u03bf\u03c5\u03c2, \u03ad\u03c7\u03b5\u03b9 \u03bb\u03b1\u03bd\u03b8\u03b1\u03c3\u03bc\u03ad\u03bd\u03b1 \u03c7\u03b1\u03c1\u03b1\u03ba\u03c4\u03b7\u03c1\u03b9\u03c3\u03c4\u03b5\u03af \u03ba\u03b1\u03ba\u03cc\u03b2\u03bf\u03c5\u03bb\u03bf\u03c2 \u03ae \u03bc\u03b5\u03c4\u03ad\u03b2\u03b1\u03bb\u03b5 \u03c4\u03b7\u03bd \u03c3\u03c5\u03bc\u03c0\u03b5\u03c1\u03b9\u03c6\u03bf\u03c1\u03ac \u03c4\u03bf\u03c5. \u0397 \u03bc\u03b5\u03c4\u03b1\u03b2\u03bf\u03bb\u03ae \u03b1\u03c5\u03c4\u03ae \u03bc\u03c0\u03bf\u03c1\u03b5\u03af \u03bd\u03b1 \u03bf\u03c6\u03b5\u03af\u03bb\u03b5\u03c4\u03b1\u03b9 \u03c3\u03b5 \u03b4\u03b9\u03ac\u03c6\u03bf\u03c1\u03bf\u03c5\u03c2 \u03bb\u03cc\u03b3\u03bf\u03c5\u03c2 \u03c7\u03c9\u03c1\u03af\u03c2 \u03bd\u03b1 \u03b1\u03c0\u03bf\u03ba\u03bb\u03b5\u03af\u03b5\u03c4\u03b1\u03b9 \u03b7 \u03b5\u03ba\u03bf\u03cd\u03c3\u03b9\u03b1/\u03b1\u03c5\u03c4\u03cc\u03bc\u03b1\u03c4\u03b7 \u03bc\u03b5\u03c4\u03b1\u03b2\u03bf\u03bb\u03ae \u03c3\u03c5\u03bc\u03c0\u03b5\u03c1\u03b9\u03c6\u03bf\u03c1\u03ac\u03c2 \u03bb\u03cc\u03b3\u03c9 \u03bc\u03b5\u03b3\u03b1\u03bb\u03cd\u03c4\u03b5\u03c1\u03bf\u03c5 \u03ba\u03ad\u03c1\u03b4\u03bf\u03c5\u03c2 \u03c0\u03bf\u03c5 \u03bf \u03ba\u03b1\u03ba\u03cc\u03b2\u03bf\u03c5\u03bb\u03bf\u03c2 \u03ba\u03cc\u03bc\u03b2\u03bf\u03c2 \u03b1\u03c0\u03bf\u03c3\u03ba\u03bf\u03c0\u03b5\u03af \u03bd\u03b1 \u03b1\u03c0\u03bf\u03ba\u03bf\u03bc\u03af\u03c3\u03b5\u03b9 \u03b1\u03bd \u03c3\u03c5\u03bc\u03c0\u03b5\u03c1\u03b9\u03c6\u03b5\u03c1\u03b8\u03b5\u03af \u03c5\u03b3\u03b9\u03ce\u03c2. \u03a3\u03c4\u03b7\u03bd \u03c0\u03b5\u03c1\u03af\u03c0\u03c4\u03c9\u03c3\u03b7 \u03b1\u03c5\u03c4\u03ae \u03b7 \u03c3\u03c5\u03bc\u03c0\u03b5\u03c1\u03b9\u03c6\u03bf\u03c1\u03ac \u03c4\u03bf\u03c5 \u03ba\u03cc\u03bc\u03b2\u03bf\u03c5 \u03b4\u03b9\u03ad\u03c0\u03b5\u03c4\u03b1\u03b9 \u03b1\u03c0\u03cc \u03c4\u03b7\u03bd \u03b8\u03b5\u03c9\u03c1\u03af\u03b1 \u03c0\u03b1\u03b9\u03b3\u03bd\u03af\u03c9\u03bd \u03ba\u03b1\u03b9 \u03ad\u03c4\u03c3\u03b9 \u03b1\u03bd\u03c4\u03b9\u03bc\u03b5\u03c4\u03c9\u03c0\u03af\u03b6\u03b5\u03c4\u03b1\u03b9."} | 104 | +{"work_id": 2762829140, "title": "Deep Learning based Intrusion Detection System for Internet of Things", "abstract": "With the increase in number of Internet connected devices, security and privacy concerns are the major obstacles impeding the widespread adoption of Internet of Things (IoT). Securing IoT has become a huge area of concern for all, including the consumers, organizations as well as the government. While attacks on any system cannot be fully prevented forever, real-time detection of the attacks are critical to defend the systems in an effective manner. Limited research exists on efficient intrusion detection systems suitable for IoT environment. In this thesis, we propose a novel intrusion detection system that uses machine learning algorithms to detect security anomalies in IoT networks. This detection platform provides security as a service and facilitates interoperability between various network communication protocols used in IoT. We provide a framework of the proposed system and discuss the intrusion detection process in detail. The proposed intrusion detection system is evaluated using both, real network traces for providing a proof-of-concept, and on simulation for providing evidence of its scalability. Our results confirm that the proposed intrusion detection system is capable of detecting real-world intrusions effectively."} | ||
| 116 | −{"work_id": 7125196921, "title": "Energy, Scalability, Data, and Security in Massive IoT: Current Landscape and Future Directions", "abstract": "The Massive Internet of Things (MIoT) envisions an interconnected ecosystem of billions of devices, fundamentally transforming diverse sectors such as healthcare, smart cities, transportation, agriculture, and energy management. However, the vast scale of MIoT introduces significant challenges, including network scalability, efficient data management, energy conservation, and robust security mechanisms. This paper presents a thorough review of existing and emerging MIoT technologies designed to address these challenges, including Low-Power Wide-Area Networks (LPWAN), 5G/6G capabilities, edge and fog computing architectures, and hybrid access methodologies. We further investigate advanced strategies such as AI-driven resource allocation, federated learning for privacy-preserving analytics, and decentralized security frameworks using blockchain. Additionally, we analyze sustainable practices, emphasizing energy harvesting and integrating green technologies to reduce environmental impact. Through extensive comparative analysis, this study identifies critical innovations and architectural adaptations required to support efficient, resilient, and scalable MIoT deployments. Key insights include the role of network slicing and intelligent resource management for scalability, adaptive protocols for real-time data handling, and lightweight AI models suited to the constraints of MIoT devices. This research ultimately contributes to a deeper understanding of how MIoT systems can evolve to meet the growing demand for seamless, reliable connectivity while prioritizing sustainability, security, and performance across diverse applications. Our findings serve as a roadmap for future advancements, underscoring the potential of MIoT to support a globally interconnected, intelligent infrastructure."} | 105 | +{"work_id": 2973502831, "title": "Performance Analysis of Proof-of-Elapsed-Time (PoET) Consensus in the Sawtooth Blockchain Framework", "abstract": "Blockchains are distributed ledgers that use a tamper-sensitive, append-only data structure in conjunction with a consensus protocol to enable mutually distrusting parties to maintain a global set of states. A primary barrier to adoption of blockchain technology by industry is the current performance and scalability limitations of these systems, which lag far behind incumbent database systems. Of particular interest are \u201clottery-style\u201d consensus algorithms, which are relatively scalable to many participants but suffer from low throughput (performance). Proof-of-Elapsed-Time (PoET) is one such algorithm with great promise for use in industry, though the parameters that govern its performance have not been well studied. This thesis explores, through simulation, key performance outcomes in PoET blockchain networks implemented with the Hyperledger Sawtooth framework. A better quantitative understanding of the interactions among these system parameters will be crucial for efficiently optimizing real world blockchain networks and facilitating adoption by industry."} | ||
| 117 | −{"work_id": 2772457693, "title": "Deep Learning for IoT Big Data and Streaming Analytics: A Survey", "abstract": "In the era of the Internet of Things (IoT), an enormous amount of sensing devices collect and/or generate various sensory data over time for a wide range of fields and applications. Based on the nature of the application, these devices will result in big or fast/real-time data streams. Applying analytics over such data streams to discover new information, predict future insights, and make control decisions is a crucial process that makes IoT a worthy paradigm for businesses and a quality-of-life improving technology. In this paper, we provide a thorough overview on using a class of advanced machine learning techniques, namely deep learning (DL), to facilitate the analytics and learning in the IoT domain. We start by articulating IoT data characteristics and identifying two major treatments for IoT data from a machine learning perspective, namely IoT big data analytics and IoT streaming data analytics. We also discuss why DL is a promising approach to achieve the desired analytics in these types of data and applications. The potential of using emerging DL techniques for IoT data analytics are then discussed, and its promises and challenges are introduced. We present a comprehensive background on different DL architectures and algorithms. We also analyze and summarize major reported research attempts that leveraged DL in the IoT domain. The smart IoT devices that have incorporated DL in their intelligence background are also discussed. DL implementation approaches on the fog and cloud centers in support of IoT applications are also surveyed. Finally, we shed light on some challenges and potential directions for future research. At the end of each section, we highlight the lessons learned based on our experiments and review of the recent literature."} | 106 | +{"work_id": 4400494356, "title": "Digital health research governance: from FAIR to RE-AIM", "abstract": "This doctoral research aims to develop a governance model for digital health research data to enhance the quality of collected data and translate research outcomes into an integrated framework for planning, implementing, and evaluating public health initiatives. Employing a mixed-methods approach, the study combines qualitative and quantitative methods, qualifying as an exploratory and explanatory study. The specific objectives include proposing the adoption of frameworks and tools to promote a data quality model for scientific research in digital health, developing a tool with data collection, management, and evaluation, and proposing an implementation research model based on digital health principles and guidelines. The work is grounded in FAIR principles and the RE-AIM framework, addressing data quality and governance in health research, focusing on tuberculosis (TB) and rare diseases (RD) in the Brazilian context. The research significantly contributes to the understanding of digital data governance in health, highlighting the importance of standardized practices and collaborative efforts to improve the quality of health research data in Brazil. Challenges addressed include integrating diverse data sources, ensuring security and confidentiality of data, while enhancing public health outcomes through digital innovations. The presented model emphasizes data quality optimization, being fundamental for planning, executing, and evaluating health interventions. The research operates under robust computational research structures and health information systems, ensuring transparent data management. The interdisciplinary nature of the research highlights its significant strength, integrating insights from data science, public health, and health policy, offering a holistic view of the challenges and opportunities in digital health. By creating a unified implementation quality manual, the study provides mechanisms for network collaboration, strengthening robust data management, and promoting a culture of shared practices essential for elevating the overall quality of data in health research."} | ||
| 118 | −{"work_id": 7127083419, "title": "From Large AI Models to Agentic AI: A Tutorial on Future Intelligent Communications", "abstract": "With the advent of 6G communications, intelligent communication systems face multiple challenges, including constrained perception and response capabilities, limited scalability, and low adaptability in dynamic environments. To address these challenges, this tutorial provides a systematic and comprehensive introduction to the principles, design, and applications of Large Artificial Intelligence Models (LAMs) and Agentic AI technologies in intelligent communication systems, aiming to offer researchers an integrated overview of cutting-edge methodologies and practical insights. First, the tutorial outlines the background of 6G communications and reviews the technological evolution from LAMs to Agentic AI. It then systematically examines the key components required for constructing LAMs, classifies various types of LAMs, and analyzes their applicability in communication. A LAM-centric design paradigm tailored for communication systems is subsequently proposed, encompassing dataset construction, internal learning, and external learning approaches. Building upon this foundation, the tutorial develops an LAM-based Agentic AI system for intelligent communications, elaborating on its core components\u2014including agents, world models, planners, knowledge bases, tools, and memory modules\u2014 as well as their interaction mechanisms. Finally, it provides an in-depth review of representative applications of LAMs and Agentic AI in communication scenarios, and summarizes the current research challenges and future directions, with the goal of fostering the development of efficient, secure, and sustainable next-generation intelligent communication systems."} | 107 | +{"work_id": 2103863878, "title": "Majority is not enough", "abstract": "The Bitcoin cryptocurrency records its transactions in a public log called the blockchain. Its security rests critically on the distributed protocol that maintains the blockchain, run by participants called miners. Conventional wisdom asserts that the mining protocol is incentive-compatible and secure against colluding minority groups, that is, it incentivizes miners to follow the protocol as prescribed. We show that the Bitcoin mining protocol is not incentive-compatible. We present an attack with which colluding miners' revenue is larger than their fair share. The attack can have significant consequences for Bitcoin: Rational miners will prefer to join the attackers, and the colluding group will increase in size until it becomes a majority. At this point, the Bitcoin system ceases to be a decentralized currency. Unless certain assumptions are made, selfish mining may be feasible for any coalition size of colluding miners. We propose a practical modification to the Bitcoin protocol that protects Bitcoin in the general case. It prohibits selfish mining by a coalition that command less than 1/4 of the resources. This threshold is lower than the wrongly assumed 1/2 bound, but better than the current reality where a coalition of any size can compromise the system."} | ||
| 119 | −{"work_id": 4386961654, "title": "Exploring the Full Potentials of IoT for Better Financial Growth and Stability: A Comprehensive Survey", "abstract": "Cutting-edge technologies, with a special emphasis on the Internet of Things (IoT), tend to operate as game changers, generating enormous alterations in both traditional and modern enterprises. Understanding multiple uses of IoT has become vital for effective financial management, given the ever-changing nature of organizations and the technological disruptions that come with this paradigm change. IoT has proven to be a powerful tool for improving operational efficiency, decision-making processes, overall productivity, and data management. As a result of the continuously expanding data volume, there is an increasing demand for a robust IT system capable of adeptly handling all enterprise processes. Consequently, businesses must develop suitable IoT architectures that can efficiently address these continually evolving requirements. This research adopts an incremental explanatory approach, guided by the principles of the Preferred Reporting Items for Systematic Reviews and Meta-Analysis (PRISMA). A rigorous examination of 84 research papers has allowed us to delve deeply into the current landscape of IoT research. This research aims to provide a complete and cohesive overview of the existing body of knowledge on IoT. This is accomplished by combining a rigorous empirical approach to categorization with ideas from specialized literature in the IoT sector. This study actively contributes to the ongoing conversation around IoT by recognizing and critically examining current difficulties. This, consequently, opens new research possibilities and promotes future developments in this ever-changing sector."} | 108 | +{"work_id": 2912978522, "title": "Integrated Blockchain and Edge Computing Systems: A Survey, Some Research Issues and Challenges", "abstract": "Blockchain, as the underlying technology of crypto-currencies, has attracted significant attention. It has been adopted in numerous applications, such as smart grid and Internet-of-Things. However, there is a significant scalability barrier for blockchain, which limits its ability to support services with frequent transactions. On the other side, edge computing is introduced to extend the cloud resources and services to be distributed at the edge of the network, but currently faces challenges in its decentralized management and security. The integration of blockchain and edge computing into one system can enable reliable access and control of the network, storage, and computation distributed at the edges, hence providing a large scale of network servers, data storage, and validity computation near the end in a secure manner. Despite the prospect of integrated blockchain and edge computing systems, its scalability enhancement, self organization, functions integration, resource management, and new security issues remain to be addressed before widespread deployment. In this survey, we investigate some of the work that has been done to enable the integrated blockchain and edge computing system and discuss the research challenges. We identify several vital aspects of the integration of blockchain and edge computing: motivations, frameworks, enabling functionalities, and challenges. Finally, some broader perspectives are explored."} | ||
| 120 | −{"work_id": 4416378800, "title": "Pinching-Antenna Systems (PASS): A Tutorial", "abstract": "Pinching-antenna systems (PASS) present a break-through among the flexible-antenna technologies, and distinguish themselves by facilitating large-scale antenna reconfiguration, line-of-sight creation, scalable implementation, and near-field benefits, thus bringing wireless communications from the \u201clast mile\u201d to the \u201clast meter\u201d. To illustrate the benefits of PASS in next-generation wireless networks, a comprehensive tutorial is presented in this paper. First, the fundamentals of PASS are discussed, including PASS signal models, hardware models, power radiation models, and pinching antenna (PA) activation methods. Building upon this, the information-theoretic capacity limits achieved by PASS are characterized, and several typical performance metrics of PASS-based communications are analyzed to demonstrate its superiority over conventional antenna technologies. Next, the pinching beamforming design is investigated. The corresponding power scaling law is first characterized for the single-waveguide single-user case. For the joint transmit and pinching design in the general multiple-waveguide case, 1) a pair of transmission strategies is proposed for PASS-based single-user communications to validate the superiority of PASS, namely sub-connected and fully connected structures in terms of the connections between the baseband radio frequency chains and waveguides; and 2) three practical protocols are proposed for facilitating PASS-based multi-user communications, namely waveguide switching, waveguide division, and waveguide multiplexing. A possible implementation of PASS in wideband communications is further highlighted. Moreover, the channel state information (CSI) acquisition in PASS is elaborated with a pair of promising solutions, based on pilot-based channel estimation and beam training, respectively. To overcome the high complexity and suboptimality inherent in conventional convex-optimization-based approaches, machine-learning-based methods for operating PASS are also explored, focusing on selected deep neural network architectures and training algorithms. Finally, several promising applications of PASS in next-generation wire-less networks are highlighted to motivate future works."} | 109 | +{"work_id": 3036601975, "title": "In-Kernel Aggregation and Broadcast Acceleration for Distributed Communication", "abstract": "Broadcasting and aggregation dominate the communication overhead in distributed systems, from machine learning training to data analytics. Current acceleration approaches require specialized hardware (RDMA) or dedicated resources (DPDK), limiting their deployment in commodity clouds. However, we present a counter-intuitive alternative: rather than bypassing the kernel, we move operations into it using eBPF. While this imposes severe constraints including no floating-point, limited memory, and stateless execution, we show these restrictions paradoxically drive innovative protocol designs that yield unexpected benefits. We introduce AggBox, which implements broadcast and aggregation operations entirely within eBPF\u2019s constrained environment. Our key innovations include stateless group acknowledgments for reliability, edge quantization for floating-point aggregation using only integer arithmetic, and tail-call chains that create virtual memory beyond eBPF\u2019s 512-byte stack limit. These designs emerge from and exploit the constraints rather than fighting them. AggBox achieves remarkable performance on commodity hardware: 84.5% reduction in broadcast latency, 43\u00d7 speedup for MapReduce workloads, and 56.1% faster ML gradient aggregation, all without specialized NICs or dedicated cores. Beyond performance, our work demonstrates that constrained environments can drive fundamental innovation in protocol design, offering insights for future resource-limited and verified systems."} | ||
| 110 | +{"work_id": 1150714886, "title": "OPNET simulation of voice over MPLS: With Considering Traffic Engineering", "abstract": "Multiprotocol Label Switching (MPLS) is an emerging technology which ensures the reliable delivery of the Internet services with high transmission speed and lower delays. The key feature of MPLS is its Traffic Engineering (TE), which is used for effectively managing the networks for efficient utilization of network resources. Due to lower network delay, efficient forwarding mechanism, scalability and predictable performance of the services provided by MPLS technology makes it more suitable for implementing real-time applications such as voice and video. In this thesis performance of Voice over Internet Protocol (VoIP) application is compared between MPLS network and conventional Internet Protocol (IP) network. OPNET modeler 14.5 is used to simulate the both networks and the comparison is made based on some performance metrics such as voice jitter, voice packet end-to-end delay, voice delay variation, voice packet sent and received. The simulation results are analyzed and it shows that MPLS based solution provides better performance in implementing the VoIP application. In this thesis, by using voice packet end-to-end delay performance metric an approach is made to estimate the minimum number of VoIP calls that can be maintained, in MPLS and conventional IP networks with acceptable quality. This approach can help the network operators or designers to determine the number of VoIP calls that can be maintained for a given network by imitating the real network on the OPNET simulator."} | ||||
| 111 | +{"work_id": 2602956630, "title": "Internet of Things Strategic Research Roadmap", "abstract": "Internet of Things (IoT) is an integrated part of Future Internet including existing and evolving Internet and network developments and could be conceptually defined as a dynamic global network infrastructure with self configuring capabilities based on standard and interoperable communication protocols where physical and virtual \u201cthings\u201d have identities, physical attributes, and virtual personalities, use intelligent interfaces, and are seamlessly integrated into the information network."} | ||||
| 112 | +{"work_id": 2950865323, "title": "Edge Intelligence: Paving the Last Mile of Artificial Intelligence With Edge Computing", "abstract": "With the breakthroughs in deep learning, the recent years have witnessed a booming of artificial intelligence (AI) applications and services, spanning from personal assistant to recommendation systems to video/audio surveillance. More recently, with the proliferation of mobile computing and Internet of Things (IoT), billions of mobile and IoT devices are connected to the Internet, generating zillions bytes of data at the network edge. Driving by this trend, there is an urgent need to push the AI frontiers to the network edge so as to fully unleash the potential of the edge big data. To meet this demand, edge computing, an emerging paradigm that pushes computing tasks and services from the network core to the network edge, has been widely recognized as a promising solution. The resulted new interdiscipline, edge AI or edge intelligence (EI), is beginning to receive a tremendous amount of interest. However, research on EI is still in its infancy stage, and a dedicated venue for exchanging the recent advances of EI is highly desired by both the computer system and AI communities. To this end, we conduct a comprehensive survey of the recent research efforts on EI. Specifically, we first review the background and motivation for AI running at the network edge. We then provide an overview of the overarching architectures, frameworks, and emerging key technologies for deep learning model toward training/inference at the network edge. Finally, we discuss future research opportunities on EI. We believe that this survey will elicit escalating attentions, stimulate fruitful discussions, and inspire further research ideas on EI."} | ||||
| 113 | +{"work_id": 4300092207, "title": "OrbitalBrain: A Distributed Framework for Training ML Models in Space", "abstract": "Earth observation nanosatellites capture high-resolution photos of the Earth in near real-time. These images increasingly support ML applications that are critical for safety and response, such as forest fire and flood detection. However, the downlink bandwidth is limited, resulting in days or weeks of delay from image capture to training. In this work, we propose OrbitalBrain, an efficient in-space distributed ML training framework that leverages limited and predictable satellite compute, bandwidth, and power to intelligently balance data transfer, model aggregation, and local training. Our evaluations demonstrate that OrbitalBrain achieves 1.52\u00d7-12.4\u00d7 speedup in time-to-accuracy while always reaching a higher final model accuracy compared to state-of-the-art ground-based or federated learning baselines. Furthermore, our approach is complementary to satellite imagery capturing and downloading, enhancing the overall efficiency of satellite-based applications."} | ||||
| 114 | +{"work_id": 4400118952, "title": "When large language models meet personalization: perspectives of challenges and opportunities", "abstract": "Abstract The advent of large language models marks a revolutionary breakthrough in artificial intelligence. With the unprecedented scale of training and model parameters, the capability of large language models has been dramatically improved, leading to human-like performances in understanding, language synthesizing, common-sense reasoning, etc. Such a major leap forward in general AI capacity will fundamentally change the pattern of how personalization is conducted. For one thing, it will reform the way of interaction between humans and personalization systems. Instead of being a passive medium of information filtering, like conventional recommender systems and search engines, large language models present the foundation for active user engagement. On top of such a new foundation, users\u2019 requests can be proactively explored, and users\u2019 required information can be delivered in a natural, interactable, and explainable way. For another thing, it will also considerably expand the scope of personalization, making it grow from the sole function of collecting personalized information to the compound function of providing personalized services. By leveraging large language models as a general-purpose interface, the personalization systems may compile user\u2019s requests into plans, calls the functions of external tools (e.g., search engines, calculators, service APIs, etc.) to execute the plans, and integrate the tools\u2019 outputs to complete the end-to-end personalization tasks. Today, large language models are still being rapidly developed, whereas the application in personalization is largely unexplored. Therefore, we consider it to be right the time to review the challenges in personalization and the opportunities to address them with large language models. In particular, we dedicate this perspective paper to the discussion of the following aspects: the development and challenges for the existing personalization system, the newly emerged capabilities of large language models, and the potential ways of making use of large language models for personalization."} | ||||
| 115 | +{"work_id": 2593864460, "title": "Billion-Scale Similarity Search with GPUs", "abstract": "Similarity search finds application in database systems handling complex data such as images or videos, which are typically represented by high-dimensional features and require specific indexing structures. This paper tackles the problem of better utilizing GPUs for this task. While GPUs excel at data parallel tasks such as distance computation, prior approaches in this domain are bottlenecked by algorithms that expose less parallelism, such ask-min selection, or make poor use of the memory hierarchy. We propose a novel design fork-selection. We apply it in different similarity search scenarios, by optimizing brute-force, approximate and compressed-domain search based on product quantization. In all these setups, we outperform the state of the art by large margins. Our implementation operates at up to 55 percent of theoretical peak performance, enabling a nearest neighbor implementation that is 8.5 \u00d7 faster than prior GPU state of the art. It enables the construction of a high accuracyk-NN graph on 95 million images from the Yfcc100M dataset in 35 minutes, and of a graph connecting 1 billion vectors in less than 12 hours on 4 Maxwell Titan X GPUs. We have open-sourced our approach for the sake of comparison and reproducibility."} | ||||
| 116 | +{"work_id": 4401806686, "title": "AI revolutionizing industries worldwide: A comprehensive overview of its diverse applications", "abstract": "Artificial Intelligence (AI) technology's rapid advancement has significantly changed various industries' operations. This comprehensive review paper aims to provide readers with a deep understanding of AI's applications & implementations, workings, and potential impacts across different sectors. It also discusses its future, threats, and integration into new policy. Through extensive research on more than 200 research and many other sources, the authors have made every effort to present an accurate overview of the numerous applications of AI nowadays in industries such as agriculture, education, autonomous systems, healthcare, finance, entertainment, transportation, military, manufacturing, and more. The paper explores various AI technologies, including machine learning, deep learning, robotics, big data, the Internet of Things, natural language processing, image processing, object detection, virtual reality, augmented reality, speech recognition, and computer vision. It provides real-world examples of their applications and implementations. Moreover, it highlights and evaluates the future potential, challenges, and limitations associated with the widespread use of AI. Our study incorporates the latest research to offer a comprehensive and nuanced understanding of AI's potential benefits and challenges. This data-driven review case study highlights the immense potential of AI technology and addresses the ethical, societal, and economic considerations related to its implementation."} | ||||
| 121 | {"work_id": 3182706339, "title": "The coefficient of determination R-squared is more informative than SMAPE, MAE, MAPE, MSE and RMSE in regression analysis evaluation", "abstract": "Regression analysis makes up a large part of supervised machine learning, and consists of the prediction of a continuous independent target from a set of other predictor variables. The difference between binary classification and regression is in the target range: in binary classification, the target can have only two values (usually encoded as 0 and 1), while in regression the target can have multiple values. Even if regression analysis has been employed in a huge number of machine learning studies, no consensus has been reached on a single, unified, standard metric to assess the results of the regression itself. Many studies employ the mean square error (MSE) and its rooted variant (RMSE), or the mean absolute error (MAE) and its percentage variant (MAPE). Although useful, these rates share a common drawback: since their values can range between zero and +infinity, a single value of them does not say much about the performance of the regression with respect to the distribution of the ground truth elements. In this study, we focus on two rates that actually generate a high score only if the majority of the elements of a ground truth group has been correctly predicted: the coefficient of determination (also known as R -squared or R 2 ) and the symmetric mean absolute percentage error (SMAPE). After showing their mathematical properties, we report a comparison between R 2 and SMAPE in several use cases and in two real medical scenarios. Our results demonstrate that the coefficient of determination ( R -squared) is more informative and truthful than SMAPE, and does not have the interpretability limitations of MSE, RMSE, MAE and MAPE. We therefore suggest the usage of R -squared as standard metric to evaluate regression analyses in any scientific domain."} | 117 | {"work_id": 3182706339, "title": "The coefficient of determination R-squared is more informative than SMAPE, MAE, MAPE, MSE and RMSE in regression analysis evaluation", "abstract": "Regression analysis makes up a large part of supervised machine learning, and consists of the prediction of a continuous independent target from a set of other predictor variables. The difference between binary classification and regression is in the target range: in binary classification, the target can have only two values (usually encoded as 0 and 1), while in regression the target can have multiple values. Even if regression analysis has been employed in a huge number of machine learning studies, no consensus has been reached on a single, unified, standard metric to assess the results of the regression itself. Many studies employ the mean square error (MSE) and its rooted variant (RMSE), or the mean absolute error (MAE) and its percentage variant (MAPE). Although useful, these rates share a common drawback: since their values can range between zero and +infinity, a single value of them does not say much about the performance of the regression with respect to the distribution of the ground truth elements. In this study, we focus on two rates that actually generate a high score only if the majority of the elements of a ground truth group has been correctly predicted: the coefficient of determination (also known as R -squared or R 2 ) and the symmetric mean absolute percentage error (SMAPE). After showing their mathematical properties, we report a comparison between R 2 and SMAPE in several use cases and in two real medical scenarios. Our results demonstrate that the coefficient of determination ( R -squared) is more informative and truthful than SMAPE, and does not have the interpretability limitations of MSE, RMSE, MAE and MAPE. We therefore suggest the usage of R -squared as standard metric to evaluate regression analyses in any scientific domain."} | ||
| 122 | −{"work_id": 7123349468, "title": "SMNet: A Novel Compositional Generalization Model for Industrial Robot Multijoint Fault Diagnosis", "abstract": "Compound fault diagnosis in multi-joint industrial robots is a critical yet underexplored problem in industrial internet of things, where the simultaneous degradation of multiple joints poses a severe challenge for reliable operation. Unlike conventional methods limited to single-fault scenarios, this paper addresses the compositional generalization challenge\u2014requiring models trained only on simple faults to accurately recognize unseen higher-order fault compositions. To this end, we propose StateMix Network (SMNet), a multi-stage architecture that preserves atomic joint-level representations before compositional diagnosis. Specifically, a Single-Joint Feature Extraction (SJFE) backbone extracts clean joint-private features, which are then fused by an Attention-Guided Dilated Fusion (AGDF) neck employing parallel Cascaded Dilated Convolution Blocks (CDCBs) bracketed by a dual-path attention mechanism for scale- and context-aware integration. Finally, a Mamba-based sequence mixer models long-range cross-joint dependencies to capture global fault dynamics. Extensive experiments on in-situ vibration data from a single six-joint industrial robot platform, under a strict train-on-simple/evaluate-on-complex protocol, demonstrate that SMNet consistently outperforms representative baselines in macro-Precision, Recall, and F1-score, particularly on unseen triple- and quadruple-joint compositions. Ablation and sensitivity analyses further validate the effectiveness of each module. This work presents a diagnostic approach that effectively generalizes from simple to complex fault scenarios in industrial robots."} | ||||
| 123 | −{"work_id": 7129024920, "title": "TinyLSN: A Lightweight Network for Real-Time Marine Pipeline Leakage Detection in IoT Systems", "abstract": "Intelligent acoustic emission-based pipeline leak detection technology plays a critical role in Internet of Things structural health monitoring for offshore platforms. However, traditional deep networks possess large parameter counts and high computational complexity, making them infeasible for deployment on resource-constrained edge nodes, while lightweight methods universally adopt single-scale feature extraction and cannot simultaneously capture short-duration burst and long-range attenuation characteristics of acoustic emission signals, resulting in insufficient discriminative capability for adjacent valves. To address this, this paper proposes Tiny Leak Sense Net (TinyLSN), a novel lightweight leak localization framework specifically designed for Internet of Things edge nodes. TinyLSN achieves optimal balance between computational efficiency and detection performance through three innovative components we designed including the Inverted Residual Block (IRB), Multi-Scale Dilated Perception Module (MSDPM), and Large Kernel Feed-Forward Network (LK-FFN), which respectively enhance cross-channel interactions, capture multi-scale temporal features, and extract global attenuation patterns. On our self-constructed experimental dataset simulating real offshore platform operational pipeline leakage, TinyLSN achieved detection accuracy of 97.11% to 97.45% and an extremely low false positive rate of 0.27% to 0.32%, significantly outperforming lightweight baseline methods. Validation on publicly available benchmark datasets further confirmed its generalization capability. When deployed on the STM32H7B3I-DK microcontroller, TinyLSN requires only 267.16 KiB Flash memory and achieves 3.417 ms inference latency. Furthermore, TinyLSN maintains over 90% accuracy under strong noise and achieves 94.83% accuracy with only 10% training samples, fully validating its reliability in harsh industrial environments and providing an efficient and feasible solution for offshore platform Internet of Things edge intelligence."} | ||||
| 124 | {"work_id": 3129486236, "title": "Intelligent Reflecting Surface-Aided Wireless Communications: A Tutorial", "abstract": "Intelligent reflecting surface (IRS) is an enabling technology to engineer the radio signal propagation in wireless networks. By smartly tuning the signal reflection via a large number of low-cost passive reflecting elements, IRS is capable of dynamically altering wireless channels to enhance the communication performance. It is thus expected that the new IRS-aided hybrid wireless network comprising both active and passive components will be highly promising to achieve a sustainable capacity growth cost-effectively in the future. Despite its great potential, IRS faces new challenges to be efficiently integrated into wireless networks, such as reflection optimization, channel estimation, and deployment from communication design perspectives. In this paper, we provide a tutorial overview of IRS-aided wireless communications to address the above issues, and elaborate its reflection and channel models, hardware architecture and practical constraints, as well as various appealing applications in wireless networks. Moreover, we highlight important directions worthy of further investigation in future work."} | 118 | {"work_id": 3129486236, "title": "Intelligent Reflecting Surface-Aided Wireless Communications: A Tutorial", "abstract": "Intelligent reflecting surface (IRS) is an enabling technology to engineer the radio signal propagation in wireless networks. By smartly tuning the signal reflection via a large number of low-cost passive reflecting elements, IRS is capable of dynamically altering wireless channels to enhance the communication performance. It is thus expected that the new IRS-aided hybrid wireless network comprising both active and passive components will be highly promising to achieve a sustainable capacity growth cost-effectively in the future. Despite its great potential, IRS faces new challenges to be efficiently integrated into wireless networks, such as reflection optimization, channel estimation, and deployment from communication design perspectives. In this paper, we provide a tutorial overview of IRS-aided wireless communications to address the above issues, and elaborate its reflection and channel models, hardware architecture and practical constraints, as well as various appealing applications in wireless networks. Moreover, we highlight important directions worthy of further investigation in future work."} | ||
| 125 | {"work_id": 4292259483, "title": "The IEEE International Conference on Communications 2022 (ICC'22)", "abstract": "The IEEE International Conference on Communications 2022 (ICC 2022) was held in Seoul, Korea, from 16\u201320 May 2022. Headquartered at Seoul COEX, the largest exhibition and convention venue in the Republic of Korea, ICC 2022 was in hybrid format with virtual (on-line) sessions as well as on-site sessions for in-person participants. ICC 2022 put together cutting-edge research results and technical contributions from academics, industry practitioners, experts and leaders in the area of communications and networking from all over the world. The technical program included physical sessions with on-site presentations and virtual (on-line) sessions for remote participants."} | 119 | {"work_id": 4292259483, "title": "The IEEE International Conference on Communications 2022 (ICC'22)", "abstract": "The IEEE International Conference on Communications 2022 (ICC 2022) was held in Seoul, Korea, from 16\u201320 May 2022. Headquartered at Seoul COEX, the largest exhibition and convention venue in the Republic of Korea, ICC 2022 was in hybrid format with virtual (on-line) sessions as well as on-site sessions for in-person participants. ICC 2022 put together cutting-edge research results and technical contributions from academics, industry practitioners, experts and leaders in the area of communications and networking from all over the world. The technical program included physical sessions with on-site presentations and virtual (on-line) sessions for remote participants."} | ||
| 126 | {"work_id": 3194620979, "title": "Integrated Sensing and Communications: Toward Dual-Functional Wireless Networks for 6G and Beyond", "abstract": "As the standardization of 5G solidifies, researchers are speculating what 6G will be. The integration of sensing functionality is emerging as a key feature of the 6G Radio Access Network (RAN), allowing for the exploitation of dense cell infrastructures to construct a perceptive network. In this IEEE Journal on Selected Areas in Communications (JSAC) Special Issue overview, we provide a comprehensive review on the background, range of key applications and state-of-the-art approaches of Integrated Sensing and Communications (ISAC). We commence by discussing the interplay between sensing and communications (S&C) from a historical point of view, and then consider the multiple facets of ISAC and the resulting performance gains. By introducing both ongoing and potential use cases, we shed light on the industrial progress and standardization activities related to ISAC. We analyze a number of performance tradeoffs between S&C, spanning from information theoretical limits to physical layer performance tradeoffs, and the cross-layer design tradeoffs. Next, we discuss the signal processing aspects of ISAC, namely ISAC waveform design and receive signal processing. As a step further, we provide our vision on the deeper integration between S&C within the framework of perceptive networks, where the two functionalities are expected to mutually assist each other, i.e., via communication-assisted sensing and sensing-assisted communications. Finally, we identify the potential integration of ISAC with other emerging communication technologies, and their positive impacts on the future of wireless networks."} | 120 | {"work_id": 3194620979, "title": "Integrated Sensing and Communications: Toward Dual-Functional Wireless Networks for 6G and Beyond", "abstract": "As the standardization of 5G solidifies, researchers are speculating what 6G will be. The integration of sensing functionality is emerging as a key feature of the 6G Radio Access Network (RAN), allowing for the exploitation of dense cell infrastructures to construct a perceptive network. In this IEEE Journal on Selected Areas in Communications (JSAC) Special Issue overview, we provide a comprehensive review on the background, range of key applications and state-of-the-art approaches of Integrated Sensing and Communications (ISAC). We commence by discussing the interplay between sensing and communications (S&C) from a historical point of view, and then consider the multiple facets of ISAC and the resulting performance gains. By introducing both ongoing and potential use cases, we shed light on the industrial progress and standardization activities related to ISAC. We analyze a number of performance tradeoffs between S&C, spanning from information theoretical limits to physical layer performance tradeoffs, and the cross-layer design tradeoffs. Next, we discuss the signal processing aspects of ISAC, namely ISAC waveform design and receive signal processing. As a step further, we provide our vision on the deeper integration between S&C within the framework of perceptive networks, where the two functionalities are expected to mutually assist each other, i.e., via communication-assisted sensing and sensing-assisted communications. Finally, we identify the potential integration of ISAC with other emerging communication technologies, and their positive impacts on the future of wireless networks."} | ||
| 121 | +{"work_id": 2918245750, "title": "Privacy preservation in blockchain based IoT systems: Integration issues, prospects, challenges, and future research directions", "abstract": null} | ||||
| 122 | +{"work_id": 2126034719, "title": "Classification and Regression Trees", "abstract": null} | ||||
| 123 | +{"work_id": 2995202934, "title": "Enhancing VAEs for Collaborative Filtering: Flexible Priors & Gating Mechanisms", "abstract": null} | ||||
| 124 | +{"work_id": 4391188276, "title": "Opportunities and challenges of artificial intelligence and distributed systems to improve the quality of healthcare service", "abstract": null} | ||||
| 127 | {"work_id": 2974110037, "title": "Transformative effects of IoT, Blockchain and Artificial Intelligence on cloud computing: Evolution, vision, trends and open challenges", "abstract": null} | 125 | {"work_id": 2974110037, "title": "Transformative effects of IoT, Blockchain and Artificial Intelligence on cloud computing: Evolution, vision, trends and open challenges", "abstract": null} | ||
| 126 | +{"work_id": 4319779432, "title": "NoSQL: Future of BigData Analytics Characteristics and Comparison with RDBMS", "abstract": null} | ||||
| 128 | {"work_id": 7123363719, "title": "ADP-based dynamic event-triggered fault-tolerant control for nonlinear systems with actuator failures and full-state time-varying constraints", "abstract": null} | 127 | {"work_id": 7123363719, "title": "ADP-based dynamic event-triggered fault-tolerant control for nonlinear systems with actuator failures and full-state time-varying constraints", "abstract": null} | ||
| 128 | +{"work_id": 4220966162, "title": "AI for next generation computing: Emerging trends and future directions", "abstract": null} | ||||
| 129 | {"work_id": 3011330593, "title": "A novel hybrid antlion optimization algorithm for multi-objective task scheduling problems in cloud computing environments", "abstract": null} | 129 | {"work_id": 3011330593, "title": "A novel hybrid antlion optimization algorithm for multi-objective task scheduling problems in cloud computing environments", "abstract": null} | ||
| 130 | {"work_id": 4206510620, "title": "The Role of Machine Learning Techniques in Internet of Things-Based Cloud Applications", "abstract": null} | 130 | {"work_id": 4206510620, "title": "The Role of Machine Learning Techniques in Internet of Things-Based Cloud Applications", "abstract": null} | ||
| 131 | {"work_id": 4386450904, "title": "Linked Data - The Story So Far", "abstract": null} | 131 | {"work_id": 4386450904, "title": "Linked Data - The Story So Far", "abstract": null} | ||
| 132 | {"work_id": 3202749896, "title": "Data quality of platforms and panels for online behavioral research", "abstract": null} | 132 | {"work_id": 3202749896, "title": "Data quality of platforms and panels for online behavioral research", "abstract": null} | ||
| 133 | {"work_id": 4401834466, "title": "A survey on large language models for recommendation", "abstract": null} | 133 | {"work_id": 4401834466, "title": "A survey on large language models for recommendation", "abstract": null} | ||
| 134 | {"work_id": 7118998287, "title": "Fixed-time optimal bipartite containment fault-tolerant control for multi-agent systems under multiple faults and saturated actuation", "abstract": null} | 134 | {"work_id": 7118998287, "title": "Fixed-time optimal bipartite containment fault-tolerant control for multi-agent systems under multiple faults and saturated actuation", "abstract": null} | ||
| 135 | +{"work_id": 3123888896, "title": "Task Scheduling in Cloud Computing based on Meta-heuristics: Review, Taxonomy, Open Challenges, and Future Trends", "abstract": null} | ||||
| 136 | +{"work_id": 3008629209, "title": "A survey on security challenges in cloud computing: issues, threats, and solutions", "abstract": null} | ||||
| 135 | {"work_id": 2793823461, "title": "Endurable Transient Inconsistency in Byte-Addressable Persistent B+-Tree", "abstract": null} | 137 | {"work_id": 2793823461, "title": "Endurable Transient Inconsistency in Byte-Addressable Persistent B+-Tree", "abstract": null} | ||
| 136 | {"work_id": 3204616723, "title": "Data Mining Concepts and Techniques Third Edition", "abstract": null} | 138 | {"work_id": 3204616723, "title": "Data Mining Concepts and Techniques Third Edition", "abstract": null} | ||
| 137 | {"work_id": 4381304672, "title": "Suspending OpenMP Tasks on Asynchronous Events: Extending the Taskwait Construct", "abstract": null} | 139 | {"work_id": 4381304672, "title": "Suspending OpenMP Tasks on Asynchronous Events: Extending the Taskwait Construct", "abstract": null} | ||
| 138 | {"work_id": 3017623177, "title": "Industry 4.0 technologies and their applications in fighting COVID-19 pandemic", "abstract": null} | 140 | {"work_id": 3017623177, "title": "Industry 4.0 technologies and their applications in fighting COVID-19 pandemic", "abstract": null} | ||
| 139 | {"work_id": 7134136722, "title": "Hybrid Al-Biruni and Puma Optimization (BERPO) for boosting the classification of Quality-of-Service (QoS) in 5G networks", "abstract": null} | 141 | {"work_id": 7134136722, "title": "Hybrid Al-Biruni and Puma Optimization (BERPO) for boosting the classification of Quality-of-Service (QoS) in 5G networks", "abstract": null} | ||
| 140 | −{"work_id": 7125115033, "title": "Integrated Sensing and Communications Over the Years: An Evolution Perspective", "abstract": null} | ||||
| 141 | {"work_id": 2789491284, "title": "A hybrid model of Internet of Things and cloud computing to manage big data in health services applications", "abstract": null} | 142 | {"work_id": 2789491284, "title": "A hybrid model of Internet of Things and cloud computing to manage big data in health services applications", "abstract": null} | ||
| 142 | −{"work_id": 7164884893, "title": "Research on Informer Long Sequence Dependency Modeling Method for Short-Term Prediction of Request Volume of Cloud-Native Backend Services", "abstract": null} | ||||
| 143 | {"work_id": 2983008824, "title": "A Comprehensive Survey on Attacks, Security Issues and Blockchain Solutions for IoT and IIoT", "abstract": null} | 143 | {"work_id": 2983008824, "title": "A Comprehensive Survey on Attacks, Security Issues and Blockchain Solutions for IoT and IIoT", "abstract": null} | ||
| 144 | −{"work_id": 7118165812, "title": "Leveraging hierarchy-aware diffusion model and knowledge-enhanced contrastive learning for recommendation", "abstract": null} | ||||
| 145 | {"work_id": 1502629466, "title": "Principles of Distributed Database Systems", "abstract": null} | 144 | {"work_id": 1502629466, "title": "Principles of Distributed Database Systems", "abstract": null} | ||
| 146 | {"work_id": 3023398824, "title": "Internet of things (IoT) applications to fight against COVID-19 pandemic", "abstract": null} | 145 | {"work_id": 3023398824, "title": "Internet of things (IoT) applications to fight against COVID-19 pandemic", "abstract": null} | ||
| 147 | −{"work_id": 172918197, "title": "Computational Collective Intelligence", "abstract": null} | 146 | +{"work_id": 3102359135, "title": "NetFlow Datasets for Machine Learning-Based Network Intrusion Detection Systems", "abstract": null} | ||
| 148 | −{"work_id": 4386975643, "title": "Cloud-based non-destructive characterization", "abstract": null} | ||||
| 149 | {"work_id": 2946627595, "title": "A QoS-aware virtual machine scheduling method for energy conservation in cloud-based cyber-physical systems", "abstract": null} | 147 | {"work_id": 2946627595, "title": "A QoS-aware virtual machine scheduling method for energy conservation in cloud-based cyber-physical systems", "abstract": null} | ||
| 150 | {"work_id": 7124594522, "title": "Energy-efficient 5G-enabled sensor networks for smart environmental monitoring in sustainable cities", "abstract": null} | 148 | {"work_id": 7124594522, "title": "Energy-efficient 5G-enabled sensor networks for smart environmental monitoring in sustainable cities", "abstract": null} | ||
| 149 | +{"work_id": 4306827119, "title": "Internet of Things intrusion detection systems: a comprehensive review and future directions", "abstract": null} | ||||
| 151 | {"work_id": 3006456063, "title": "Industry 4.0 and Health: Internet of Things, Big Data, and Cloud Computing for Healthcare 4.0", "abstract": null} | 150 | {"work_id": 3006456063, "title": "Industry 4.0 and Health: Internet of Things, Big Data, and Cloud Computing for Healthcare 4.0", "abstract": null} | ||
| 152 | {"work_id": 2274895364, "title": "The Semantic Web: A New Form of Web Content that is Meaningful to Computers will Unleash a Revolution of New Possibilities", "abstract": null} | 151 | {"work_id": 2274895364, "title": "The Semantic Web: A New Form of Web Content that is Meaningful to Computers will Unleash a Revolution of New Possibilities", "abstract": null} | ||
modified
literature_synthesis/landmarks/data_distributed_landmarks.csv
+152 −153
@@ -1,153 +1,152 @@ | |||||
| 1 | −work_id,doi,arxiv_id,title,source_name,year,type,primary_category,n_categories,c12,c36,ncs36,cited_by_count,fwci,has_abstract,is_oa,period,score,set,pi_review | 1 | +work_id,doi,arxiv_id,title,source_name,year,type,primary_category,n_categories,c12,c36,ncs36,cited_by_count,fwci,has_abstract,is_oa,period,ntitle,score,set,pi_review | ||
| 2 | −2793823461,,,Endurable Transient Inconsistency in Byte-Addressable Persistent B+-Tree,Scholarworks@UNIST (Ulsan National Institute of Science and Technology),2018,dissertation,database_systems,3,17.0,42.0,377.7581573896353,89,,False,False,baseline,377.7581573896353,landmark,True | 2 | +2793823461,,,Endurable Transient Inconsistency in Byte-Addressable Persistent B+-Tree,Scholarworks@UNIST (Ulsan National Institute of Science and Technology),2018,dissertation,database_systems,3,17.0,42.0,377.7581573896353,89,,False,False,baseline,endurabletransientinconsistencyinbyteaddressablepersistentbtree,377.7581573896353,landmark,True | ||
| 3 | −3080729669,,,Pengembangan Sistem Pemetaan Otomatis EntityRelationship Diagram Ke Dalam Database,,2019,dissertation,database_systems,2,2.0,15.0,320.60747663551405,62,,True,False,baseline,320.60747663551405,landmark,True | 3 | +3080729669,,,Pengembangan Sistem Pemetaan Otomatis EntityRelationship Diagram Ke Dalam Database,,2019,dissertation,database_systems,2,2.0,15.0,320.60747663551405,62,,True,False,baseline,pengembangansistempemetaanotomatisentityrelationshipdiagramkedalamdatabase,320.60747663551405,landmark,True | ||
| 4 | −3204616723,,,Data Mining Concepts and Techniques Third Edition,Thammasat University Digital Collections,2021,article,database_systems,1,886.0,928.0,245.73952451819886,1176,66.8714,False,False,baseline,245.73952451819886,landmark,True | 4 | +3204616723,,,Data Mining Concepts and Techniques Third Edition,Thammasat University Digital Collections,2021,article,database_systems,1,886.0,928.0,245.73952451819886,1176,66.8714,False,False,baseline,dataminingconceptsandtechniquesthirdedition,245.73952451819886,landmark,True | ||
| 5 | −4415124086,10.1109/tbdata.2025.3618474,,The Faiss Library,IEEE Transactions on Big Data,2025,article,database_systems,4,454.0,454.0,148.4520005233547,454,166.1231,True,True,post,229.8415201133268,landmark,True | 5 | +3014294420,10.1017/9781108635592.003,,Introduction to Data Mining,Cambridge University Press eBooks,2019,book-chapter,database_systems,2,163.0,235.0,228.82157331393535,439,233.5555,True,False,baseline,introductiontodatamining,228.82157331393535,landmark,True | ||
| 6 | −3014294420,10.1017/9781108635592.003,,Introduction to Data Mining,Cambridge University Press eBooks,2019,book-chapter,database_systems,2,163.0,235.0,228.82157331393535,439,233.5555,True,False,baseline,228.82157331393535,landmark,True | 6 | +4324129606,10.1371/journal.pone.0279720,,"Data quality in online human-subjects research: Comparisons between MTurk, Prolific, CloudResearch, Qualtrics, and SONA",PLoS ONE,2023,article,database_systems,1,403.0,973.0,228.63551401869157,1500,345.1684,True,True,post,dataqualityinonlinehumansubjectsresearchcomparisonsbetweenmturkprolificcloudresearchqualtricsandsona,228.63551401869157,landmark,True | ||
| 7 | −4324129606,10.1371/journal.pone.0279720,,"Data quality in online human-subjects research: Comparisons between MTurk, Prolific, CloudResearch, Qualtrics, and SONA",PLoS ONE,2023,article,database_systems,1,403.0,973.0,228.63551401869157,1500,345.1684,True,True,post,228.63551401869157,landmark,True | 7 | +2963507231,10.1109/tkde.2017.2781227,,Untangling Blockchain: A Data Processing View of Blockchain Systems,IEEE Transactions on Knowledge and Data Engineering,2018,article,database_systems,5,201.0,405.0,214.72982183235243,1186,244.2498,True,True,baseline,untanglingblockchainadataprocessingviewofblockchainsystems,214.72982183235243,landmark,True | ||
| 8 | −7161586974,10.5070/p9.62178,,Paleobiology Database User Guide Version 2.0,PaleoBios,2026,article,database_systems,1,61.0,61.0,433.3770927968851,61,109.834,True,True,post,216.86845533876678,landmark,True | 8 | +3032576892,,,Comparative study on Python web frameworks: Flask and Django,Theseus (Ammattikorkeakoulujen),2020,dissertation,database_systems,4,7.0,22.0,206.90719257540604,43,,True,True,baseline,comparativestudyonpythonwebframeworksflaskanddjango,206.90719257540604,landmark,True | ||
| 9 | −2963507231,10.1109/tkde.2017.2781227,,Untangling Blockchain: A Data Processing View of Blockchain Systems,IEEE Transactions on Knowledge and Data Engineering,2018,article,database_systems,5,201.0,405.0,214.72982183235243,1186,244.2498,True,True,baseline,214.72982183235243,landmark,True | 9 | +3148181069,10.38094/jastt20165,,Classification Based on Decision Tree Algorithm for Machine Learning,Journal of Applied Science and Technology Trends,2021,article,database_systems,4,257.0,704.0,186.42308756553018,1871,279.1938,True,True,baseline,classificationbasedondecisiontreealgorithmformachinelearning,186.42308756553018,landmark,True | ||
| 10 | −2795038878,10.1145/3458723,1803.09010,Datasheets for datasets,Communications of the ACM,2021,article,database_systems,1,481.0,794.0,210.25558455544171,2104,205.3426,True,True,baseline,210.25558455544171,landmark,True | 10 | +3037795158,10.1016/s2589-7500(20)30142-4,,Applications of digital technology in COVID-19 pandemic planning and response,The Lancet Digital Health,2020,article,database_systems,1,350.0,591.0,172.09443665792568,987,179.9177,True,True,baseline,applicationsofdigitaltechnologyincovid19pandemicplanningandresponse,172.09443665792568,landmark,True | ||
| 11 | −3032576892,,,Comparative study on Python web frameworks: Flask and Django,Theseus (Ammattikorkeakoulujen),2020,dissertation,database_systems,4,7.0,22.0,206.90719257540604,43,,True,True,baseline,206.90719257540604,landmark,True | 11 | +4386450904,10.1145/3591366.3591378,,Linked Data - The Story So Far,ACM eBooks,2023,book-chapter,database_systems,2,285.0,301.0,166.41438539989264,319,42.7861,False,False,post,linkeddatathestorysofar,166.41438539989264,landmark,True | ||
| 12 | −3148181069,10.38094/jastt20165,,Classification Based on Decision Tree Algorithm for Machine Learning,Journal of Applied Science and Technology Trends,2021,article,database_systems,4,257.0,704.0,186.42308756553018,1871,279.1938,True,True,baseline,186.42308756553018,landmark,True | 12 | +7161586974,10.5070/p9.62178,,Paleobiology Database User Guide Version 2.0,PaleoBios,2026,article,database_systems,1,61.0,61.0,433.3770927968851,61,109.834,True,True,post,paleobiologydatabaseuserguideversion20,154.66369514364453,landmark,True | ||
| 13 | −3037795158,10.1016/s2589-7500(20)30142-4,,Applications of digital technology in COVID-19 pandemic planning and response,The Lancet Digital Health,2020,article,database_systems,1,350.0,591.0,172.09443665792568,987,179.9177,True,True,baseline,172.09443665792568,landmark,True | 13 | +4406085118,10.1145/3711118,2303.10158,Data-centric Artificial Intelligence: A Survey,ACM Computing Surveys,2025,article,database_systems,3,334.0,334.0,113.77687020232747,334,110.6889,True,True,post,datacentricartificialintelligenceasurvey,145.94850359802805,landmark,True | ||
| 14 | −4406085118,10.1145/3711118,2303.10158,Data-centric Artificial Intelligence: A Survey,ACM Computing Surveys,2025,article,database_systems,3,334.0,334.0,113.77687020232747,334,110.6889,True,True,post,169.09045752830647,landmark,True | 14 | +4408444355,10.1016/j.is.2025.102549,2207.14529,The effects of data quality on machine learning performance on tabular data,Information Systems,2025,article,database_systems,3,322.0,322.0,80.50468595378078,322,192.6654,True,True,post,theeffectsofdataqualityonmachinelearningperformanceontabulardata,140.70484478612286,landmark,True | ||
| 15 | −4386450904,10.1145/3591366.3591378,,Linked Data - The Story So Far,ACM eBooks,2023,book-chapter,database_systems,2,285.0,301.0,166.41438539989264,319,42.7861,False,False,post,166.41438539989264,landmark,True | 15 | +3202749896,10.3758/s13428-021-01694-3,,Data quality of platforms and panels for online behavioral research,Behavior Research Methods,2021,article,database_systems,1,164.0,469.0,121.87616674723884,1687,188.3384,False,True,baseline,dataqualityofplatformsandpanelsforonlinebehavioralresearch,121.87616674723884,landmark,True | ||
| 16 | −4408444355,10.1016/j.is.2025.102549,2207.14529,The effects of data quality on machine learning performance on tabular data,Information Systems,2025,article,database_systems,3,322.0,322.0,80.50468595378078,322,192.6654,True,True,post,163.01535126980446,landmark,True | 16 | +4400494356,10.11606/t.82.2024.tde-05072024-092611,,Digital health research governance: from FAIR to RE-AIM,,2024,dissertation,database_systems,1,1.0,3.0,116.82222222222222,3,,True,True,post,digitalhealthresearchgovernancefromfairtoreaim,116.82222222222222,landmark,True | ||
| 17 | −4361200200,10.1201/9780429459016,,Spatial Data Science,Chapman & Hall/CRC eBooks,2023,book,database_systems,2,278.0,753.0,129.30007763975155,1250,222.9593,True,False,post,129.30007763975155,landmark,True | 17 | +2593864460,10.1109/tbdata.2019.2921572,1702.08734,Billion-Scale Similarity Search with GPUs,IEEE Transactions on Big Data,2019,article,database_systems,6,384.0,765.0,115.95149891238218,3832,118.3163,True,True,pre,billionscalesimilaritysearchwithgpus,115.95149891238218,landmark,True | ||
| 18 | −3202749896,10.3758/s13428-021-01694-3,,Data quality of platforms and panels for online behavioral research,Behavior Research Methods,2021,article,database_systems,1,164.0,469.0,121.87616674723884,1687,188.3384,False,True,baseline,121.87616674723884,landmark,True | 18 | +4362632858,10.21941/kcss/2023/2,,Scalability Benchmarking of Cloud-Native Applications Applied to Event-Driven Microservices,,2023,dissertation,database_systems,4,2.0,4.0,115.45945945945945,4,,True,True,post,scalabilitybenchmarkingofcloudnativeapplicationsappliedtoeventdrivenmicroservices,115.45945945945945,landmark,True | ||
| 19 | −4400494356,10.11606/t.82.2024.tde-05072024-092611,,Digital health research governance: from FAIR to RE-AIM,,2024,dissertation,database_systems,1,1.0,3.0,116.82222222222222,3,,True,True,post,116.82222222222222,landmark,True | 19 | +3005599391,,,"Entangled Devices : An ethnographic study of students, mobile phones and capitalism",Työväentutkimus Vuosikirja,2020,dissertation,database_systems,1,11.0,12.0,112.8584686774942,15,,True,True,baseline,entangleddevicesanethnographicstudyofstudentsmobilephonesandcapitalism,112.8584686774942,landmark,True | ||
| 20 | −2593864460,10.1109/tbdata.2019.2921572,1702.08734,Billion-Scale Similarity Search with GPUs,IEEE Transactions on Big Data,2019,article,database_systems,6,384.0,765.0,115.95149891238218,3832,118.3163,True,True,pre,115.95149891238218,landmark,True | 20 | +4402762189,10.3390/electronics13183762,,Leveraging AI in E-Learning: Personalized Learning and Adaptive Assessment through Cognitive Neuropsychology—A Systematic Analysis,Electronics,2024,article,database_systems,2,199.0,317.0,95.44078925847174,317,121.3104,True,True,post,leveragingaiinelearningpersonalizedlearningandadaptiveassessmentthroughcognitiveneuropsychologyasystematicanalysis,95.44078925847174,landmark,True | ||
| 21 | −4362632858,10.21941/kcss/2023/2,,Scalability Benchmarking of Cloud-Native Applications Applied to Event-Driven Microservices,,2023,dissertation,database_systems,4,2.0,4.0,115.45945945945945,4,,True,True,post,115.45945945945945,landmark,True | 21 | +4380791906,10.31979/etd.qrrp-3equ,,NoSQL Databases in Kubernetes,,2023,dissertation,database_systems,4,3.0,3.0,86.5945945945946,3,,True,True,post,nosqldatabasesinkubernetes,86.5945945945946,landmark,True | ||
| 22 | −3005599391,,,"Entangled Devices : An ethnographic study of students, mobile phones and capitalism",Työväentutkimus Vuosikirja,2020,dissertation,database_systems,1,11.0,12.0,112.8584686774942,15,,True,True,baseline,112.8584686774942,landmark,True | 22 | +4401495975,10.1186/s40537-024-00973-y,,Enhancing K-nearest neighbor algorithm: a comprehensive review and performance analysis of modifications,Journal Of Big Data,2024,article,database_systems,6,279.0,520.0,83.4394876991742,520,96.1656,True,True,post,enhancingknearestneighboralgorithmacomprehensivereviewandperformanceanalysisofmodifications,83.4394876991742,landmark,True | ||
| 23 | −4396219753,10.4018/979-8-3693-2909-2.ch002,,Machine Learning Mastery,"Advances in systems analysis, software engineering, and high performance computing book series",2024,book-chapter,database_systems,2,195.0,195.0,108.23837846298326,195,27.8969,True,False,post,108.23837846298326,landmark,True | 23 | +4408925021,10.3390/higheredu4020017,,The Impact of Artificial Intelligence on Personalized Learning in Higher Education: A Systematic Review,Trends in Higher Education,2025,review,database_systems,2,189.0,189.0,29.153309284818068,189,31.7339,True,True,post,theimpactofartificialintelligenceonpersonalizedlearninginhighereducationasystematicreview,82.5876262875069,landmark,True | ||
| 24 | −4408925021,10.3390/higheredu4020017,,The Impact of Artificial Intelligence on Personalized Learning in Higher Education: A Systematic Review,Trends in Higher Education,2025,review,database_systems,2,189.0,189.0,29.153309284818068,189,31.7339,True,True,post,95.68292357140696,landmark,True | 24 | +2126034719,10.1142/9789811201967_0002,,Classification and Regression Trees,Series in machine perception and artificial intelligence,2019,book-chapter,database_systems,1,73.0,81.0,78.87041463161177,173,28.4262,False,False,baseline,classificationandregressiontrees,78.87041463161177,landmark,True | ||
| 25 | −4402762189,10.3390/electronics13183762,,Leveraging AI in E-Learning: Personalized Learning and Adaptive Assessment through Cognitive Neuropsychology—A Systematic Analysis,Electronics,2024,article,database_systems,2,199.0,317.0,95.44078925847174,317,121.3104,True,True,post,95.44078925847174,landmark,True | 25 | +4319779432,10.1007/978-3-031-12382-5_106,,NoSQL: Future of BigData Analytics Characteristics and Comparison with RDBMS,Studies in computational intelligence,2023,book-chapter,database_systems,2,62.0,86.0,78.4514106583072,87,75.6244,False,True,post,nosqlfutureofbigdataanalyticscharacteristicsandcomparisonwithrdbms,78.4514106583072,landmark,True | ||
| 26 | −4380791906,10.31979/etd.qrrp-3equ,,NoSQL Databases in Kubernetes,,2023,dissertation,database_systems,4,3.0,3.0,86.5945945945946,3,,True,True,post,86.5945945945946,landmark,True | 26 | +4229641819,10.1017/9781108684163,,Mining of Massive Datasets,Cambridge University Press eBooks,2020,book,database_systems,4,152.0,228.0,77.43724928366763,424,76.3217,True,False,baseline,miningofmassivedatasets,77.43724928366763,landmark,True | ||
| 27 | −7118085507,10.1007/s41019-025-00335-5,2402.19473,Retrieval-Augmented Generation for AI-Generated Content: A Survey,Data Science and Engineering,2026,article,information_retrieval,7,208.0,208.0,231.4627186325106,208,390.1628,True,True,post,739.4858804994016,landmark,True | 27 | +7118085507,10.1007/s41019-025-00335-5,2402.19473,Retrieval-Augmented Generation for AI-Generated Content: A Survey,Data Science and Engineering,2026,article,information_retrieval,7,208.0,208.0,231.4627186325106,208,390.1628,True,True,post,retrievalaugmentedgenerationforaigeneratedcontentasurvey,527.3778457357059,landmark,True | ||
| 28 | −2274895364,10.1145/3591366.3591376,,The Semantic Web: A New Form of Web Content that is Meaningful to Computers will Unleash a Revolution of New Possibilities,ACM eBooks,2023,book-chapter,information_retrieval,2,578.0,606.0,335.0402576489533,1324,58.9755,False,False,post,335.0402576489533,landmark,True | 28 | +2274895364,10.1145/3591366.3591376,,The Semantic Web: A New Form of Web Content that is Meaningful to Computers will Unleash a Revolution of New Possibilities,ACM eBooks,2023,book-chapter,information_retrieval,2,578.0,606.0,335.0402576489533,1324,58.9755,False,False,post,thesemanticwebanewformofwebcontentthatismeaningfultocomputerswillunleasharevolutionofnewpossibilities,335.0402576489533,landmark,True | ||
| 29 | −4394947112,10.1145/3805774,2404.10981,A Survey on Retrieval-Augmented Text Generation for Large Language Models,ACM Computing Surveys,2026,article,information_retrieval,5,70.0,70.0,77.8961072320949,70,184.2436,True,True,post,248.8654405526832,landmark,True | 29 | +4401857375,10.1145/3637528.3671470,2405.06211,A Survey on RAG Meeting LLMs: Towards Retrieval-Augmented Large Language Models,ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD),2024,conference-paper,information_retrieval,8,401.0,795.0,220.97973411345592,795,241.8493,True,True,post,asurveyonragmeetingllmstowardsretrievalaugmentedlargelanguagemodels,220.97973411345592,landmark,True | ||
| 30 | −3045200674,10.1145/3397271.3401063,,LightGCN,International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR),2020,conference-paper,information_retrieval,2,321.0,803.0,226.7421667675404,4430,311.5512,True,False,baseline,226.7421667675404,landmark,True | 30 | +2967467,10.26190/unsworks/23395,,Social networks and collaborative filtering for large-scale requirements elicitation,"UNSWorks (University of New South Wales, Sydney, Australia)",2022,dissertation,information_retrieval,2,22.0,23.0,199.5062656641604,34,,True,True,baseline,socialnetworksandcollaborativefilteringforlargescalerequirementselicitation,199.5062656641604,landmark,True | ||
| 31 | −4401857375,10.1145/3637528.3671470,2405.06211,A Survey on RAG Meeting LLMs: Towards Retrieval-Augmented Large Language Models,ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD),2024,conference-paper,information_retrieval,8,401.0,795.0,220.97973411345592,795,241.8493,True,True,post,220.97973411345592,landmark,True | 31 | +4394947112,10.1145/3805774,2404.10981,A Survey on Retrieval-Augmented Text Generation for Large Language Models,ACM Computing Surveys,2026,article,information_retrieval,5,70.0,70.0,77.8961072320949,70,184.2436,True,True,post,asurveyonretrievalaugmentedtextgenerationforlargelanguagemodels,177.48292885336258,landmark,True | ||
| 32 | −2967467,10.26190/unsworks/23395,,Social networks and collaborative filtering for large-scale requirements elicitation,"UNSWorks (University of New South Wales, Sydney, Australia)",2022,dissertation,information_retrieval,2,22.0,23.0,199.5062656641604,34,,True,True,baseline,199.5062656641604,landmark,True | 32 | +3097300053,10.1145/3535101,2011.02260,Graph Neural Networks in Recommender Systems: A Survey,ACM Computing Surveys,2022,article,information_retrieval,4,336.0,711.0,174.743146538718,1326,268.2685,True,True,baseline,graphneuralnetworksinrecommendersystemsasurvey,174.743146538718,landmark,True | ||
| 33 | −3097300053,10.1145/3535101,2011.02260,Graph Neural Networks in Recommender Systems: A Survey,ACM Computing Surveys,2022,article,information_retrieval,4,336.0,711.0,174.743146538718,1326,268.2685,True,True,baseline,174.743146538718,landmark,True | 33 | +4288083766,10.1145/3285029,1707.07435,Deep Learning Based Recommender System,ACM Computing Surveys,2019,article,information_retrieval,3,224.0,396.0,161.64067295931318,1511,176.8236,True,False,baseline,deeplearningbasedrecommendersystem,161.64067295931318,landmark,True | ||
| 34 | −4288083766,10.1145/3285029,1707.07435,Deep Learning Based Recommender System,ACM Computing Surveys,2019,article,information_retrieval,3,224.0,396.0,161.64067295931318,1511,176.8236,True,False,baseline,161.64067295931318,landmark,True | 34 | +4395483946,10.1186/s41239-024-00453-6,,Generative AI and the future of higher education: a threat to academic integrity or reformation? Evidence from multicultural perspectives,International Journal of Educational Technology in Higher Education,2024,article,information_retrieval,2,263.0,529.0,159.26869879410583,529,202.4391,True,True,post,generativeaiandthefutureofhighereducationathreattoacademicintegrityorreformationevidencefrommulticulturalperspectives,159.26869879410583,landmark,True | ||
| 35 | −4395483946,10.1186/s41239-024-00453-6,,Generative AI and the future of higher education: a threat to academic integrity or reformation? Evidence from multicultural perspectives,International Journal of Educational Technology in Higher Education,2024,article,information_retrieval,2,263.0,529.0,159.26869879410583,529,202.4391,True,True,post,159.26869879410583,landmark,True | 35 | +4394867512,10.57784/1992/7835,,Privacy-enabled scalable recommender systems,HAL (Le Centre pour la Communication Scientifique Directe),2024,dissertation,information_retrieval,3,4.0,4.0,155.76296296296297,4,,True,True,post,privacyenabledscalablerecommendersystems,155.76296296296297,landmark,True | ||
| 36 | −4394867512,10.57784/1992/7835,,Privacy-enabled scalable recommender systems,HAL (Le Centre pour la Communication Scientifique Directe),2024,dissertation,information_retrieval,3,4.0,4.0,155.76296296296297,4,,True,True,post,155.76296296296297,landmark,True | 36 | +2408538552,10.1609/aaai.v26i1.8100,,Fused Matrix Factorization with Geographical and Social Influence in Location-Based Social Networks,Proceedings of the AAAI Conference on Artificial Intelligence,2021,conference-paper,information_retrieval,1,519.0,541.0,151.80700662176693,572,22.962,True,True,baseline,fusedmatrixfactorizationwithgeographicalandsocialinfluenceinlocationbasedsocialnetworks,151.80700662176693,landmark,True | ||
| 37 | −2408538552,10.1609/aaai.v26i1.8100,,Fused Matrix Factorization with Geographical and Social Influence in Location-Based Social Networks,Proceedings of the AAAI Conference on Artificial Intelligence,2021,conference-paper,information_retrieval,1,519.0,541.0,151.80700662176693,572,22.962,True,True,baseline,151.80700662176693,landmark,True | 37 | +4401834466,10.1007/s11280-024-01291-2,2305.19860,A survey on large language models for recommendation,World Wide Web,2024,article,information_retrieval,3,272.0,487.0,146.62354690497077,487,184.0703,False,True,post,asurveyonlargelanguagemodelsforrecommendation,146.62354690497077,landmark,True | ||
| 38 | −4401834466,10.1007/s11280-024-01291-2,2305.19860,A survey on large language models for recommendation,World Wide Web,2024,article,information_retrieval,3,272.0,487.0,146.62354690497077,487,184.0703,False,True,post,146.62354690497077,landmark,True | 38 | +4315977496,10.1145/3568022,2109.12843,"A Survey of Graph Neural Networks for Recommender Systems: Challenges, Methods, and Directions",ACM Transactions on Recommender Systems,2023,article,information_retrieval,3,326.0,612.0,143.4379748166452,756,176.9462,True,True,baseline,asurveyofgraphneuralnetworksforrecommendersystemschallengesmethodsanddirections,143.4379748166452,landmark,True | ||
| 39 | −4315977496,10.1145/3568022,2109.12843,"A Survey of Graph Neural Networks for Recommender Systems: Challenges, Methods, and Directions",ACM Transactions on Recommender Systems,2023,article,information_retrieval,3,326.0,612.0,143.4379748166452,756,176.9462,True,True,baseline,143.4379748166452,landmark,True | 39 | +4394994587,10.1109/tkde.2024.3392335,2307.02046,Recommender Systems in the Era of Large Language Models (LLMs),IEEE Transactions on Knowledge and Data Engineering,2024,article,information_retrieval,5,277.0,469.0,141.20419609534147,469,176.4167,True,True,post,recommendersystemsintheeraoflargelanguagemodelsllms,141.20419609534147,landmark,True | ||
| 40 | −4394994587,10.1109/tkde.2024.3392335,2307.02046,Recommender Systems in the Era of Large Language Models (LLMs),IEEE Transactions on Knowledge and Data Engineering,2024,article,information_retrieval,5,277.0,469.0,141.20419609534147,469,176.4167,True,True,post,141.20419609534147,landmark,True | 40 | +4400531953,10.1145/3626772.3657878,2309.07597,C-Pack: Packed Resources For General Chinese Embeddings,International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR),2024,conference-paper,information_retrieval,6,256.0,485.0,134.81153590569323,485,146.3264,True,True,post,cpackpackedresourcesforgeneralchineseembeddings,134.81153590569323,landmark,True | ||
| 41 | −4400531953,10.1145/3626772.3657878,2309.07597,C-Pack: Packed Resources For General Chinese Embeddings,International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR),2024,conference-paper,information_retrieval,6,256.0,485.0,134.81153590569323,485,146.3264,True,True,post,134.81153590569323,landmark,True | 41 | +2945827670,10.1145/3331184.3331267,1905.08108,Neural Graph Collaborative Filtering,International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR),2019,conference-paper,information_retrieval,3,149.0,465.0,133.92825599565188,3237,200.9814,True,True,baseline,neuralgraphcollaborativefiltering,133.92825599565188,landmark,True | ||
| 42 | −2945827670,10.1145/3331184.3331267,1905.08108,Neural Graph Collaborative Filtering,International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR),2019,conference-paper,information_retrieval,3,149.0,465.0,133.92825599565188,3237,200.9814,True,True,baseline,133.92825599565188,landmark,True | 42 | +4387316367,10.1134/s1995080223060471,,Ontological Approach to a Knowledge Graph Construction in a Semantic Library,Lobachevskii Journal of Mathematics,2023,dissertation,information_retrieval,4,10.0,16.0,133.0924024640657,18,,True,False,post,ontologicalapproachtoaknowledgegraphconstructioninasemanticlibrary,133.0924024640657,landmark,True | ||
| 43 | −2945623882,10.1145/3292500.3330989,1905.07854,KGAT,ACM SIGKDD International Conference on Knowledge Discovery & Data Mining (KDD),2019,conference-paper,information_retrieval,5,157.0,465.0,133.92825599565188,2147,160.7851,True,True,baseline,133.92825599565188,landmark,True | 43 | +2914721378,10.1145/3308558.3313488,1902.07243,Graph Neural Networks for Social Recommendation,,2019,conference-paper,information_retrieval,2,141.0,441.0,127.01582987974727,1984,153.1188,True,True,baseline,graphneuralnetworksforsocialrecommendation,127.01582987974727,landmark,True | ||
| 44 | −4387316367,10.1134/s1995080223060471,,Ontological Approach to a Knowledge Graph Construction in a Semantic Library,Lobachevskii Journal of Mathematics,2023,dissertation,information_retrieval,4,10.0,16.0,133.0924024640657,18,,True,False,post,133.0924024640657,landmark,True | 44 | +2963707260,10.1109/tkde.2018.2833443,,Heterogeneous Information Network Embedding for Recommendation,IEEE Transactions on Knowledge and Data Engineering,2018,article,information_retrieval,5,72.0,234.0,124.06611928091473,1204,188.0081,True,True,baseline,heterogeneousinformationnetworkembeddingforrecommendation,124.06611928091473,landmark,True | ||
| 45 | −7118165812,10.1007/s10115-025-02639-4,,Leveraging hierarchy-aware diffusion model and knowledge-enhanced contrastive learning for recommendation,Knowledge and Information Systems,2026,article,information_retrieval,2,36.0,36.0,255.7635301752109,36,329.5019,False,False,post,127.98794085566564,landmark,True | 45 | +3094605801,10.1145/3404835.3462862,2010.10783,Self-supervised Graph Learning for Recommendation,International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR),2021,conference-paper,information_retrieval,3,141.0,434.0,121.78233063557643,1488,179.1038,True,True,baseline,selfsupervisedgraphlearningforrecommendation,121.78233063557643,landmark,True | ||
| 46 | −2914721378,10.1145/3308558.3313488,1902.07243,Graph Neural Networks for Social Recommendation,,2019,conference-paper,information_retrieval,2,141.0,441.0,127.01582987974727,1984,153.1188,True,True,baseline,127.01582987974727,landmark,True | 46 | +3092103025,10.1145/3564284,2010.03240,Bias and Debias in Recommender System: A Survey and Future Directions,ACM Transactions on Information Systems,2022,article,information_retrieval,3,255.0,475.0,116.74120197734325,733,146.66,True,True,baseline,biasanddebiasinrecommendersystemasurveyandfuturedirections,116.74120197734325,landmark,True | ||
| 47 | −2963707260,10.1109/tkde.2018.2833443,,Heterogeneous Information Network Embedding for Recommendation,IEEE Transactions on Knowledge and Data Engineering,2018,article,information_retrieval,5,72.0,234.0,124.06611928091473,1204,188.0081,True,True,baseline,124.06611928091473,landmark,True | 47 | +4323539384,10.5463/thesis.16,,Scientific dataset recommendation with semantic techniques,,2023,dissertation,information_retrieval,3,4.0,4.0,115.45945945945945,4,,True,True,post,scientificdatasetrecommendationwithsemantictechniques,115.45945945945945,landmark,True | ||
| 48 | −3094605801,10.1145/3404835.3462862,2010.10783,Self-supervised Graph Learning for Recommendation,International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR),2021,conference-paper,information_retrieval,3,141.0,434.0,121.78233063557643,1488,179.1038,True,True,baseline,121.78233063557643,landmark,True | 48 | +2604314403,10.1007/978-3-319-93417-4_38,,Modeling Relational Data with Graph Convolutional Networks,Lecture notes in computer science,2018,conference-paper,information_retrieval,4,278.0,743.0,115.04989507468214,5096,152.5097,True,True,baseline,modelingrelationaldatawithgraphconvolutionalnetworks,115.04989507468214,landmark,True | ||
| 49 | −172918197,10.1007/978-3-030-63007-2,,Computational Collective Intelligence,Lecture notes in computer science,2020,conference-paper,information_retrieval,1,425.0,427.0,120.57148843056008,592,3.7704,False,False,baseline,120.57148843056008,landmark,True | 49 | +3133849783,10.1109/icde53745.2022.00099,2010.14395,Contrastive Learning for Sequential Recommendation,Proceedings - International Conference on Data Engineering,2022,conference-paper,information_retrieval,4,188.0,375.0,112.68765439918921,663,121.9524,True,True,baseline,contrastivelearningforsequentialrecommendation,112.68765439918921,landmark,True | ||
| 50 | −3092103025,10.1145/3564284,2010.03240,Bias and Debias in Recommender System: A Survey and Future Directions,ACM Transactions on Information Systems,2022,article,information_retrieval,3,255.0,475.0,116.74120197734325,733,146.66,True,True,baseline,116.74120197734325,landmark,True | 50 | +2995202934,,,Enhancing VAEs for Collaborative Filtering: Flexible Priors & Gating Mechanisms,,2019,dissertation,information_retrieval,3,2.0,11.0,110.24841915085818,1,,False,False,baseline,enhancingvaesforcollaborativefilteringflexiblepriorsgatingmechanisms,110.24841915085818,landmark,True | ||
| 51 | −4323539384,10.5463/thesis.16,,Scientific dataset recommendation with semantic techniques,,2023,dissertation,information_retrieval,3,4.0,4.0,115.45945945945945,4,,True,True,post,115.45945945945945,landmark,True | 51 | +4400118952,10.1007/s11280-024-01276-1,2307.16376,When large language models meet personalization: perspectives of challenges and opportunities,World Wide Web,2024,article,information_retrieval,4,240.0,358.0,107.78486610262739,358,135.4696,True,True,post,whenlargelanguagemodelsmeetpersonalizationperspectivesofchallengesandopportunities,107.78486610262739,landmark,True | ||
| 52 | −4381304672,10.1007/978-3-031-40744-4_5,,Suspending OpenMP Tasks on Asynchronous Events: Extending the Taskwait Construct,Lecture notes in computer science,2023,conference-paper,distributed_computing,3,12262.0,12891.0,2048.4305614736636,12935,942.1133,False,True,post,2048.4305614736636,landmark,True | 52 | +4381304672,10.1007/978-3-031-40744-4_5,,Suspending OpenMP Tasks on Asynchronous Events: Extending the Taskwait Construct,Lecture notes in computer science,2023,conference-paper,distributed_computing,3,12262.0,12891.0,2048.4305614736636,12935,942.1133,False,True,post,suspendingopenmptasksonasynchronouseventsextendingthetaskwaitconstruct,2048.4305614736636,landmark,True | ||
| 53 | −2122465391,10.21276/ijre.2018.5.5.4,,MapReduce: Simplified Data Processing on Large Cluster,INTERNATIONAL JOURNAL OF RESEARCH AND ENGINEERING,2018,article,distributed_computing,4,2098.0,2186.0,1159.010840803759,2948,215.3255,True,False,baseline,1159.010840803759,landmark,True | 53 | +2122465391,10.21276/ijre.2018.5.5.4,,MapReduce: Simplified Data Processing on Large Cluster,INTERNATIONAL JOURNAL OF RESEARCH AND ENGINEERING,2018,article,distributed_computing,4,2098.0,2186.0,1159.010840803759,2948,215.3255,True,False,baseline,mapreducesimplifieddataprocessingonlargecluster,1159.010840803759,landmark,True | ||
| 54 | −4255535209,10.1504/ijwgs.2018.10016848,,Blockchain challenges and opportunities: a survey,International Journal of Web and Grid Services,2018,article,distributed_computing,4,357.0,804.0,426.27846111904034,1582,497.7393,True,False,baseline,426.27846111904034,landmark,True | 54 | +4255535209,10.1504/ijwgs.2018.10016848,,Blockchain challenges and opportunities: a survey,International Journal of Web and Grid Services,2018,article,distributed_computing,4,357.0,804.0,426.27846111904034,1582,497.7393,True,False,baseline,blockchainchallengesandopportunitiesasurvey,426.27846111904034,landmark,True | ||
| 55 | −1973501242,10.1145/3335772.3335934,,"Time, clocks, and the ordering of events in a distributed system",ACM eBooks,2019,book-chapter,distributed_computing,2,386.0,424.0,331.9512682244857,1979,73.0762,True,False,baseline,331.9512682244857,landmark,True | 55 | +1973501242,10.1145/3335772.3335934,,"Time, clocks, and the ordering of events in a distributed system",ACM eBooks,2019,book-chapter,distributed_computing,2,386.0,424.0,331.9512682244857,1979,73.0762,True,False,baseline,timeclocksandtheorderingofeventsinadistributedsystem,331.9512682244857,landmark,True | ||
| 56 | −2897450989,10.1504/ijwgs.2018.095647,,Blockchain challenges and opportunities: a survey,International Journal of Web and Grid Services,2018,article,distributed_computing,4,251.0,625.0,331.37318184005005,3328,432.6596,True,False,baseline,331.37318184005005,landmark,True | 56 | +2120510885,10.1145/3335772.3335936,,The Byzantine generals problem,ACM eBooks,2019,book-chapter,distributed_computing,3,230.0,335.0,262.2728180547234,1033,180.7332,True,False,baseline,thebyzantinegeneralsproblem,262.2728180547234,landmark,True | ||
| 57 | −2120510885,10.1145/3335772.3335936,,The Byzantine generals problem,ACM eBooks,2019,book-chapter,distributed_computing,3,230.0,335.0,262.2728180547234,1033,180.7332,True,False,baseline,262.2728180547234,landmark,True | 57 | +2902511784,10.5555/3291656.3291738,,Dynamic data race detection for OpenMP programs,Rice Research Repository (Rice University),2018,dissertation,distributed_computing,5,1.0,12.0,219.90243902439025,20,,True,False,baseline,dynamicdataracedetectionforopenmpprograms,219.90243902439025,landmark,True | ||
| 58 | −2902511784,10.5555/3291656.3291738,,Dynamic data race detection for OpenMP programs,Rice Research Repository (Rice University),2018,dissertation,distributed_computing,5,1.0,12.0,219.90243902439025,20,,True,False,baseline,219.90243902439025,landmark,True | 58 | +3182706339,10.7717/peerj-cs.623,,"The coefficient of determination R-squared is more informative than SMAPE, MAE, MAPE, MSE and RMSE in regression analysis evaluation",PeerJ Computer Science,2021,article,distributed_computing,1,409.0,1160.0,189.8515007898894,5310,437.5495,True,True,baseline,thecoefficientofdeterminationrsquaredismoreinformativethansmapemaemapemseandrmseinregressionanalysisevaluation,189.8515007898894,landmark,True | ||
| 59 | −4300092207,10.4230/oasics.nines.2026.5,,OrbitalBrain: A Distributed Framework for Training ML Models in Space,DROPS (Schloss Dagstuhl – Leibniz Center for Informatics),2026,article,distributed_computing,4,54.0,54.0,70.47771428571428,54,0.0,True,True,post,191.98191128349848,landmark,True | 59 | +4387321091,10.1145/3600006.3613165,2309.06180,Efficient Memory Management for Large Language Model Serving with PagedAttention,Symposium on Operating Systems Principles,2023,conference-paper,distributed_computing,9,173.0,787.0,181.49662514489972,1716,324.3817,True,True,post,efficientmemorymanagementforlargelanguagemodelservingwithpagedattention,181.49662514489972,landmark,True | ||
| 60 | −3182706339,10.7717/peerj-cs.623,,"The coefficient of determination R-squared is more informative than SMAPE, MAE, MAPE, MSE and RMSE in regression analysis evaluation",PeerJ Computer Science,2021,article,distributed_computing,1,409.0,1160.0,189.8515007898894,5310,437.5495,True,True,baseline,189.8515007898894,landmark,True | 60 | +2103863878,10.1145/3212998,,Majority is not enough,Communications of the ACM,2018,article,distributed_computing,4,170.0,327.0,173.37444873871416,742,161.0924,True,False,baseline,majorityisnotenough,173.37444873871416,landmark,True | ||
| 61 | −4387321091,10.1145/3600006.3613165,2309.06180,Efficient Memory Management for Large Language Model Serving with PagedAttention,Symposium on Operating Systems Principles,2023,conference-paper,distributed_computing,9,173.0,787.0,181.49662514489972,1716,324.3817,True,True,post,181.49662514489972,landmark,True | 61 | +1502629466,10.1007/978-3-030-26253-2,,Principles of Distributed Database Systems,Springer eBooks,2019,book,distributed_computing,3,789.0,848.0,166.39169139465875,2345,55.809,False,False,baseline,principlesofdistributeddatabasesystems,166.39169139465875,landmark,True | ||
| 62 | −2103863878,10.1145/3212998,,Majority is not enough,Communications of the ACM,2018,article,distributed_computing,4,170.0,327.0,173.37444873871416,742,161.0924,True,False,baseline,173.37444873871416,landmark,True | 62 | +3036601975,10.4230/oasics.nines.2026.13,2006.11477,In-Kernel Aggregation and Broadcast Acceleration for Distributed Communication,arXiv (Cornell University),2020,preprint,distributed_computing,10,200.0,699.0,157.87121576165305,2368,,True,True,baseline,inkernelaggregationandbroadcastaccelerationfordistributedcommunication,157.87121576165305,landmark,True | ||
| 63 | −7130586201,10.1109/tsmc.2026.3661716,,Dynamic Event-Triggered Control for Human–Machine Cooperative Systems Based on Dynamic Authority Allocation,IEEE Transactions on Systems Man and Cybernetics Systems,2026,article,distributed_computing,1,47.0,47.0,132.70961019857808,47,167.5021,True,False,post,167.09536722823015,landmark,True | 63 | +4393370257,10.57784/1992/7669,,Distributed methods for resource allocation - a passivity-based approach,HAL (Le Centre pour la Communication Scientifique Directe),2024,dissertation,distributed_computing,2,6.0,6.0,151.2173913043478,6,,True,True,post,distributedmethodsforresourceallocationapassivitybasedapproach,151.2173913043478,landmark,True | ||
| 64 | −1502629466,10.1007/978-3-030-26253-2,,Principles of Distributed Database Systems,Springer eBooks,2019,book,distributed_computing,3,789.0,848.0,166.39169139465875,2345,55.809,False,False,baseline,166.39169139465875,landmark,True | 64 | +2973502831,,,Performance Analysis of Proof-of-Elapsed-Time (PoET) Consensus in the Sawtooth Blockchain Framework,Scholars' Bank (University of Oregon),2019,dissertation,distributed_computing,5,3.0,14.0,140.31616982836496,28,,True,False,baseline,performanceanalysisofproofofelapsedtimepoetconsensusinthesawtoothblockchainframework,140.31616982836496,landmark,True | ||
| 65 | −3036601975,10.4230/oasics.nines.2026.13,2006.11477,In-Kernel Aggregation and Broadcast Acceleration for Distributed Communication,arXiv (Cornell University),2020,preprint,distributed_computing,10,200.0,699.0,157.87121576165305,2368,,True,True,baseline,157.87121576165305,landmark,True | 65 | +4300092207,10.4230/oasics.nines.2026.5,,OrbitalBrain: A Distributed Framework for Training ML Models in Space,DROPS (Schloss Dagstuhl – Leibniz Center for Informatics),2026,article,distributed_computing,4,54.0,54.0,70.47771428571428,54,0.0,True,True,post,orbitalbrainadistributedframeworkfortrainingmlmodelsinspace,136.9154022583083,landmark,True | ||
| 66 | −2251066406,10.7916/tv64-xc19,,Bypassing Races in Live Applications with Execution Filters,Operating Systems Design and Implementation,2026,article,distributed_computing,4,44.0,44.0,638.0,53,0.0,True,True,post,156.42970549025802,landmark,True | 66 | +2962850638,,,Logiikka ja vaativuus hajautetussa laskennassa,Aaltodoc (Aalto University),2019,dissertation,distributed_computing,4,14.0,22.0,123.65517241379311,38,,True,True,baseline,logiikkajavaativuushajautetussalaskennassa,123.65517241379311,landmark,True | ||
| 67 | −3098508067,10.82308/18894,,Personal volunteer computing,,2020,dissertation,distributed_computing,4,17.0,18.0,154.15037593984962,25,,True,True,baseline,154.15037593984962,landmark,True | 67 | +7130586201,10.1109/tsmc.2026.3661716,,Dynamic Event-Triggered Control for Human–Machine Cooperative Systems Based on Dynamic Authority Allocation,IEEE Transactions on Systems Man and Cybernetics Systems,2026,article,distributed_computing,1,47.0,47.0,132.70961019857808,47,167.5021,True,False,post,dynamiceventtriggeredcontrolforhumanmachinecooperativesystemsbasedondynamicauthorityallocation,119.16710937297202,landmark,True | ||
| 68 | −4393370257,10.57784/1992/7669,,Distributed methods for resource allocation - a passivity-based approach,HAL (Le Centre pour la Communication Scientifique Directe),2024,dissertation,distributed_computing,2,6.0,6.0,151.2173913043478,6,,True,True,post,151.2173913043478,landmark,True | 68 | +3012404397,10.5626/ktcp.2020.26.3.135,1801.10228,Santa Claus Algorithm: Agent-Based Consensus Preprocessing Method for Scalability Improvement in Private Blockchain Environment,정보과학회 컴퓨팅의 실제 논문지,2020,article,distributed_computing,3,328.0,400.0,116.47677607981433,1,0.2325,True,True,baseline,santaclausalgorithmagentbasedconsensuspreprocessingmethodforscalabilityimprovementinprivateblockchainenvironment,116.47677607981433,landmark,True | ||
| 69 | −2973502831,,,Performance Analysis of Proof-of-Elapsed-Time (PoET) Consensus in the Sawtooth Blockchain Framework,Scholars' Bank (University of Oregon),2019,dissertation,distributed_computing,5,3.0,14.0,140.31616982836496,28,,True,False,baseline,140.31616982836496,landmark,True | 69 | +2251066406,10.7916/tv64-xc19,,Bypassing Races in Live Applications with Execution Filters,Operating Systems Design and Implementation,2026,article,distributed_computing,4,44.0,44.0,638.0,53,0.0,True,True,post,bypassingracesinliveapplicationswithexecutionfilters,111.56069813639934,landmark,True | ||
| 70 | −1572499759,10.56726/irjmets66464,,Microservices Architecture,International Research Journal of Modernization in Engineering Technology and Science,2025,article,distributed_computing,4,245.0,245.0,93.19077007930923,245,0.8816,True,True,post,124.03341944441644,landmark,True | 70 | +2970155754,,,Learning Generalizable Device Placement Algorithms for Distributed Machine Learning,DSpace@MIT (Massachusetts Institute of Technology),2019,dissertation,distributed_computing,5,5.0,11.0,110.24841915085818,22,,True,False,baseline,learninggeneralizabledeviceplacementalgorithmsfordistributedmachinelearning,110.24841915085818,landmark,True | ||
| 71 | −2962850638,,,Logiikka ja vaativuus hajautetussa laskennassa,Aaltodoc (Aalto University),2019,dissertation,distributed_computing,4,14.0,22.0,123.65517241379311,38,,True,True,baseline,123.65517241379311,landmark,True | 71 | +4220966162,10.1016/j.iot.2022.100514,2203.04159,AI for next generation computing: Emerging trends and future directions,Internet of Things,2022,article,distributed_computing,5,237.0,423.0,103.9611124977183,686,150.3082,False,True,baseline,aifornextgenerationcomputingemergingtrendsandfuturedirections,103.9611124977183,landmark,True | ||
| 72 | −7123363719,10.1016/j.cnsns.2026.109676,,ADP-based dynamic event-triggered fault-tolerant control for nonlinear systems with actuator failures and full-state time-varying constraints,Communications in Nonlinear Science and Numerical Simulation,2026,article,distributed_computing,1,33.0,33.0,93.17908801176759,33,117.6079,False,False,post,117.32227911769351,landmark,True | 72 | +2926987861,10.1109/comst.2020.2969706,1904.04098,A Survey of Distributed Consensus Protocols for Blockchain Networks,IEEE Communications Surveys & Tutorials,2020,article,distributed_computing,6,177.0,302.0,87.93996594025982,841,109.9497,True,True,baseline,asurveyofdistributedconsensusprotocolsforblockchainnetworks,87.93996594025982,landmark,True | ||
| 73 | −3012404397,10.5626/ktcp.2020.26.3.135,1801.10228,Santa Claus Algorithm: Agent-Based Consensus Preprocessing Method for Scalability Improvement in Private Blockchain Environment,정보과학회 컴퓨팅의 실제 논문지,2020,article,distributed_computing,3,328.0,400.0,116.47677607981433,1,0.2325,True,True,baseline,116.47677607981433,landmark,True | 73 | +2794533297,10.1109/sp.2018.000-5,,"OmniLedger: A Secure, Scale-Out, Decentralized Ledger via Sharding",Proceedings - IEEE Symposium on Security and Privacy/Proceedings of the ... IEEE Symposium on Security and Privacy,2018,conference-paper,distributed_computing,5,135.0,287.0,85.09604562737643,1253,92.4823,True,True,baseline,omniledgerasecurescaleoutdecentralizedledgerviasharding,85.09604562737643,landmark,True | ||
| 74 | −7118998287,10.1016/j.matcom.2026.01.001,,Fixed-time optimal bipartite containment fault-tolerant control for multi-agent systems under multiple faults and saturated actuation,Mathematics and Computers in Simulation,2026,article,distributed_computing,2,32.0,32.0,112.34215540969723,32,134.0959,False,False,post,113.76705853836947,landmark,True | 74 | +7123363719,10.1016/j.cnsns.2026.109676,,ADP-based dynamic event-triggered fault-tolerant control for nonlinear systems with actuator failures and full-state time-varying constraints,Communications in Nonlinear Science and Numerical Simulation,2026,article,distributed_computing,1,33.0,33.0,93.17908801176759,33,117.6079,False,False,post,adpbaseddynamiceventtriggeredfaulttolerantcontrolfornonlinearsystemswithactuatorfailuresandfullstatetimevaryingconstraints,83.6705236022995,landmark,True | ||
| 75 | −4386585104,10.1145/3569951.3597559,,ACCESS: Advancing Innovation,Practice and Experience in Advanced Research Computing,2023,conference-paper,distributed_computing,2,121.0,297.0,111.86639277215944,435,137.5418,True,True,post,111.86639277215944,landmark,True | 75 | +7118998287,10.1016/j.matcom.2026.01.001,,Fixed-time optimal bipartite containment fault-tolerant control for multi-agent systems under multiple faults and saturated actuation,Mathematics and Computers in Simulation,2026,article,distributed_computing,2,32.0,32.0,112.34215540969723,32,134.0959,False,False,post,fixedtimeoptimalbipartitecontainmentfaulttolerantcontrolformultiagentsystemsundermultiplefaultsandsaturatedactuation,81.13505319010861,landmark,True | ||
| 76 | −2970155754,,,Learning Generalizable Device Placement Algorithms for Distributed Machine Learning,DSpace@MIT (Massachusetts Institute of Technology),2019,dissertation,distributed_computing,5,5.0,11.0,110.24841915085818,22,,True,False,baseline,110.24841915085818,landmark,True | 76 | +4391188276,10.1016/j.artmed.2024.102779,,Opportunities and challenges of artificial intelligence and distributed systems to improve the quality of healthcare service,Artificial Intelligence in Medicine,2024,article,distributed_computing,1,196.0,252.0,75.87091133481034,252,96.436,False,False,post,opportunitiesandchallengesofartificialintelligenceanddistributedsystemstoimprovethequalityofhealthcareservice,75.87091133481034,landmark,True | ||
| 77 | −110250037,10.7275/3278307,,The Use of Multimedia Material in Teaching Chinese as a Second Language and Pedagogical Implications,ScholarWorks@UMassAmherst (University of Massachusetts Amherst),2023,dissertation,cloud_computing,1,7.0,7.0,202.05405405405403,7,,True,True,post,202.05405405405403,landmark,True | 77 | +110250037,10.7275/3278307,,The Use of Multimedia Material in Teaching Chinese as a Second Language and Pedagogical Implications,ScholarWorks@UMassAmherst (University of Massachusetts Amherst),2023,dissertation,cloud_computing,1,7.0,7.0,202.05405405405403,7,,True,True,post,theuseofmultimediamaterialinteachingchineseasasecondlanguageandpedagogicalimplications,202.05405405405403,landmark,True | ||
| 78 | −4392909747,10.59646/ccp/156,,Cloud Computing: Principles And Paradigms,,2024,book,cloud_computing,2,504.0,504.0,155.20504731861197,517,14.8571,True,False,post,155.20504731861197,landmark,True | 78 | +4392909747,10.59646/ccp/156,,Cloud Computing: Principles And Paradigms,,2024,book,cloud_computing,2,504.0,504.0,155.20504731861197,517,14.8571,True,False,post,cloudcomputingprinciplesandparadigms,155.20504731861197,landmark,True | ||
| 79 | −4386975643,10.1016/b978-0-323-91150-4.00006-9,,Cloud-based non-destructive characterization,Elsevier eBooks,2023,book-chapter,cloud_computing,2,19.0,35.0,141.43274853801168,37,154.3068,False,False,post,141.43274853801168,landmark,True | 79 | +2784822088,10.2312/2632114,,A microservice architecture for the processing of large geospatial data in the Cloud,Publikationsdatenbank der Fraunhofer-Gesellschaft (Fraunhofer-Gesellschaft),2018,dissertation,cloud_computing,3,3.0,8.0,81.83864915572232,15,,True,False,baseline,amicroservicearchitecturefortheprocessingoflargegeospatialdatainthecloud,81.83864915572232,landmark,True | ||
| 80 | −4229658977,10.1007/978-1-4842-4470-8_7,,Google Colaboratory,Apress eBooks,2019,book-chapter,cloud_computing,2,24.0,126.0,122.68731164917385,709,185.9225,True,False,baseline,122.68731164917385,landmark,True | 80 | +4394946189,10.1145/3627703.3629553,2305.15778,Automatic Root Cause Analysis via Large Language Models for Cloud Incidents,,2024,conference-paper,cloud_computing,5,101.0,187.0,81.27074434424932,187,84.6778,True,True,post,automaticrootcauseanalysisvialargelanguagemodelsforcloudincidents,81.27074434424932,landmark,True | ||
| 81 | −7160954670,10.1109/icsft66733.2026.11506646,,Multi-Cloud Program Management For Large Scale Deployment,,2026,conference-paper,cloud_computing,4,26.0,26.0,245.48521739130436,26,297.1442,True,False,post,92.4357350624252,landmark,True | 81 | +4385584867,10.4018/978-1-6684-8634-4.ch009,,A Study on Smart Energy Management Framework Using Cloud Computing,"Practice, progress, and proficiency in sustainability",2023,book-chapter,cloud_computing,2,94.0,104.0,71.58999271314065,104,70.9894,True,False,post,astudyonsmartenergymanagementframeworkusingcloudcomputing,71.58999271314065,landmark,True | ||
| 82 | −2784822088,10.2312/2632114,,A microservice architecture for the processing of large geospatial data in the Cloud,Publikationsdatenbank der Fraunhofer-Gesellschaft (Fraunhofer-Gesellschaft),2018,dissertation,cloud_computing,3,3.0,8.0,81.83864915572232,15,,True,False,baseline,81.83864915572232,landmark,True | 82 | +4395047770,10.1007/s10462-024-10756-9,2105.04086,Deep reinforcement learning-based methods for resource scheduling in cloud computing: a review and future directions,Artificial Intelligence Review,2024,article,cloud_computing,6,149.0,232.0,69.84941043522221,232,83.4248,True,True,post,deepreinforcementlearningbasedmethodsforresourceschedulingincloudcomputingareviewandfuturedirections,69.84941043522221,landmark,True | ||
| 83 | −7118010419,10.37547/tajet/volume08issue01-02,,"Optimizing Retail Application Performance: A Systematic Review of Monitoring Tools, Metrics, And Best Practices",The American Journal of Engineering And Technology,2026,review,cloud_computing,4,23.0,23.0,30.77027027027027,23,33.0364,True,True,post,81.77007332445305,landmark,True | 83 | +2789491284,10.1016/j.future.2018.03.005,,A hybrid model of Internet of Things and cloud computing to manage big data in health services applications,Future Generation Computer Systems,2018,article,cloud_computing,4,84.0,130.0,68.9256218227304,341,79.9436,False,False,baseline,ahybridmodelofinternetofthingsandcloudcomputingtomanagebigdatainhealthservicesapplications,68.9256218227304,landmark,True | ||
| 84 | −4394946189,10.1145/3627703.3629553,2305.15778,Automatic Root Cause Analysis via Large Language Models for Cloud Incidents,,2024,conference-paper,cloud_computing,5,101.0,187.0,81.27074434424932,187,84.6778,True,True,post,81.27074434424932,landmark,True | 84 | +7160954670,10.1109/icsft66733.2026.11506646,,Multi-Cloud Program Management For Large Scale Deployment,,2026,conference-paper,cloud_computing,4,26.0,26.0,245.48521739130436,26,297.1442,True,False,post,multicloudprogrammanagementforlargescaledeployment,65.92223071696324,landmark,True | ||
| 85 | −4408156900,10.3390/electronics14051019,,Federated Learning for Cloud and Edge Security: A Systematic Review of Challenges and AI Opportunities,Electronics,2025,review,cloud_computing,8,147.0,147.0,18.250462107208875,147,20.0516,True,True,post,74.42005166664985,landmark,True | 85 | +4408156900,10.3390/electronics14051019,,Federated Learning for Cloud and Edge Security: A Systematic Review of Challenges and AI Opportunities,Electronics,2025,review,cloud_computing,8,147.0,147.0,18.250462107208875,147,20.0516,True,True,post,federatedlearningforcloudandedgesecurityasystematicreviewofchallengesandaiopportunities,64.2348204458387,landmark,True | ||
| 86 | −4252792641,10.31979/etd.shqa-fdp6,,PRIORITIZED TASK SCHEDULING IN FOG COMPUTING,,2018,dissertation,cloud_computing,4,5.0,8.0,71.95393474088291,24,,True,False,baseline,71.95393474088291,landmark,True | 86 | +2946627595,10.1007/s11280-019-00684-y,,A QoS-aware virtual machine scheduling method for energy conservation in cloud-based cyber-physical systems,World Wide Web,2019,article,cloud_computing,5,136.0,154.0,62.86026170639958,192,52.7972,False,False,baseline,aqosawarevirtualmachineschedulingmethodforenergyconservationincloudbasedcyberphysicalsystems,62.86026170639958,landmark,True | ||
| 87 | −4385584867,10.4018/978-1-6684-8634-4.ch009,,A Study on Smart Energy Management Framework Using Cloud Computing,"Practice, progress, and proficiency in sustainability",2023,book-chapter,cloud_computing,2,94.0,104.0,71.58999271314065,104,70.9894,True,False,post,71.58999271314065,landmark,True | 87 | +2784168960,,,Energy efficient dynamic virtual machine allocation with cpu usage prediction in cloud datacenters,Bilkent University Institutional Repository (Bilkent University),2018,dissertation,cloud_computing,4,3.0,6.0,61.37898686679174,8,,True,True,baseline,energyefficientdynamicvirtualmachineallocationwithcpuusagepredictioninclouddatacenters,61.37898686679174,landmark,True | ||
| 88 | −4395047770,10.1007/s10462-024-10756-9,2105.04086,Deep reinforcement learning-based methods for resource scheduling in cloud computing: a review and future directions,Artificial Intelligence Review,2024,article,cloud_computing,6,149.0,232.0,69.84941043522221,232,83.4248,True,True,post,69.84941043522221,landmark,True | 88 | +4364375730,10.4018/978-1-7998-8394-4.ch009,,Social Health Protection During the COVID-Pandemic Using IoT,"Advances in electronic government, digital divide, and regional development book series",2023,book-chapter,cloud_computing,1,82.0,87.0,59.88778236580034,87,59.3854,True,False,post,socialhealthprotectionduringthecovidpandemicusingiot,59.88778236580034,landmark,True | ||
| 89 | −2789491284,10.1016/j.future.2018.03.005,,A hybrid model of Internet of Things and cloud computing to manage big data in health services applications,Future Generation Computer Systems,2018,article,cloud_computing,4,84.0,130.0,68.9256218227304,341,79.9436,False,False,baseline,68.9256218227304,landmark,True | 89 | +7118010419,10.37547/tajet/volume08issue01-02,,"Optimizing Retail Application Performance: A Systematic Review of Monitoring Tools, Metrics, And Best Practices",The American Journal of Engineering And Technology,2026,review,cloud_computing,4,23.0,23.0,30.77027027027027,23,33.0364,True,True,post,optimizingretailapplicationperformanceasystematicreviewofmonitoringtoolsmetricsandbestpractices,58.315819480390566,landmark,True | ||
| 90 | −7160823269,10.1109/cisce69494.2026.11504752,,TokenPool-Scheduler: Token-Level GPU Pooling and Resource Slicing for Multi-Model Co-Location,,2026,conference-paper,cloud_computing,6,19.0,19.0,179.3930434782609,19,217.1439,True,False,post,67.54919100715686,landmark,True | 90 | +4293770403,10.1007/s10586-022-03713-0,,Energy efficiency in cloud computing data centers: a survey on software technologies,Cluster Computing,2022,article,cloud_computing,5,63.0,235.0,57.7561736098435,507,98.7462,True,True,baseline,energyefficiencyincloudcomputingdatacentersasurveyonsoftwaretechnologies,57.7561736098435,landmark,True | ||
| 91 | −7161556515,10.1109/gaiis69281.2026.11519206,,DeepServeCB: SLO-Aware and Cost-Aware Elastic Scheduling for Serverless Multi-Tenant LLM Inference,International Conference on Generative Artificial Intelligence and Information Security (GAIIS),2026,conference-paper,cloud_computing,7,19.0,19.0,179.3930434782609,19,217.1439,True,False,post,67.54919100715686,landmark,True | 91 | +2974110037,10.1016/j.iot.2019.100118,1911.01941,"Transformative effects of IoT, Blockchain and Artificial Intelligence on cloud computing: Evolution, vision, trends and open challenges",Internet of Things,2019,article,cloud_computing,4,60.0,141.0,57.553875977937274,496,68.1052,False,True,baseline,transformativeeffectsofiotblockchainandartificialintelligenceoncloudcomputingevolutionvisiontrendsandopenchallenges,57.553875977937274,landmark,True | ||
| 92 | −2946627595,10.1007/s11280-019-00684-y,,A QoS-aware virtual machine scheduling method for energy conservation in cloud-based cyber-physical systems,World Wide Web,2019,article,cloud_computing,5,136.0,154.0,62.86026170639958,192,52.7972,False,False,baseline,62.86026170639958,landmark,True | 92 | +4386827074,10.4018/979-8-3693-1186-8.ch026,,"Synergizing Artificial Intelligence, 5G, and Cloud Computing for Efficient Energy Conversion Using Agricultural Waste","Practice, progress, and proficiency in sustainability",2023,book-chapter,cloud_computing,1,70.0,81.0,55.757590478503765,82,55.9724,True,False,post,synergizingartificialintelligence5gandcloudcomputingforefficientenergyconversionusingagriculturalwaste,55.757590478503765,landmark,True | ||
| 93 | −2784168960,,,Energy efficient dynamic virtual machine allocation with cpu usage prediction in cloud datacenters,Bilkent University Institutional Repository (Bilkent University),2018,dissertation,cloud_computing,4,3.0,6.0,61.37898686679174,8,,True,True,baseline,61.37898686679174,landmark,True | 93 | +3011330593,10.1007/s10586-020-03075-5,,A novel hybrid antlion optimization algorithm for multi-objective task scheduling problems in cloud computing environments,Cluster Computing,2020,article,cloud_computing,3,109.0,189.0,55.03527669771227,355,59.7401,False,False,baseline,anovelhybridantlionoptimizationalgorithmformultiobjectivetaskschedulingproblemsincloudcomputingenvironments,55.03527669771227,landmark,True | ||
| 94 | −4378832451,10.1007/978-1-4842-9303-4_1,,Overview of Amazon Web Services,Apress eBooks,2023,book-chapter,cloud_computing,1,87.0,89.0,61.2645129948992,89,19.7951,True,False,post,61.2645129948992,landmark,True | 94 | +4390660438,10.1016/j.teler.2024.100116,2401.02469,Modern computing: Vision and challenges,Telematics and Informatics Reports,2024,article,cloud_computing,5,146.0,179.0,53.03994732221246,179,68.9762,True,True,post,moderncomputingvisionandchallenges,53.03994732221246,landmark,True | ||
| 95 | −4364375730,10.4018/978-1-7998-8394-4.ch009,,Social Health Protection During the COVID-Pandemic Using IoT,"Advances in electronic government, digital divide, and regional development book series",2023,book-chapter,cloud_computing,1,82.0,87.0,59.88778236580034,87,59.3854,True,False,post,59.88778236580034,landmark,True | 95 | +3042799967,10.1109/ipdps47924.2020.00084,,Smartly Handling Renewable Energy Instability in Supporting A Cloud Datacenter,Proceedings - IEEE International Parallel and Distributed Processing Symposium,2020,conference-paper,cloud_computing,6,98.0,183.0,51.67349504166861,272,42.4662,True,False,baseline,smartlyhandlingrenewableenergyinstabilityinsupportingaclouddatacenter,51.67349504166861,landmark,True | ||
| 96 | −4293770403,10.1007/s10586-022-03713-0,,Energy efficiency in cloud computing data centers: a survey on software technologies,Cluster Computing,2022,article,cloud_computing,5,63.0,235.0,57.7561736098435,507,98.7462,True,True,baseline,57.7561736098435,landmark,True | 96 | +3123888896,10.1016/j.swevo.2021.100841,,"Task Scheduling in Cloud Computing based on Meta-heuristics: Review, Taxonomy, Open Challenges, and Future Trends",Swarm and Evolutionary Computation,2021,article,cloud_computing,3,96.0,191.0,50.57785472303446,355,60.7922,False,False,baseline,taskschedulingincloudcomputingbasedonmetaheuristicsreviewtaxonomyopenchallengesandfuturetrends,50.57785472303446,landmark,True | ||
| 97 | −2974110037,10.1016/j.iot.2019.100118,1911.01941,"Transformative effects of IoT, Blockchain and Artificial Intelligence on cloud computing: Evolution, vision, trends and open challenges",Internet of Things,2019,article,cloud_computing,4,60.0,141.0,57.553875977937274,496,68.1052,False,True,baseline,57.553875977937274,landmark,True | 97 | +3008629209,10.1007/s11227-020-03213-1,,"A survey on security challenges in cloud computing: issues, threats, and solutions",The Journal of Supercomputing,2020,article,cloud_computing,3,67.0,168.0,48.92024595352202,538,68.1084,False,False,baseline,asurveyonsecuritychallengesincloudcomputingissuesthreatsandsolutions,48.92024595352202,landmark,True | ||
| 98 | −7164884893,10.1109/ispp69262.2026.11543010,,Research on Informer Long Sequence Dependency Modeling Method for Short-Term Prediction of Request Volume of Cloud-Native Backend Services,"International Conference on Image, Signal Processing and Pattern Recognition (ISPP)",2026,conference-paper,cloud_computing,1,16.0,16.0,151.06782608695653,16,182.858,False,False,post,56.883529269184734,landmark,True | 98 | +2980789769,10.1145/3362031,,A Survey on End-Edge-Cloud Orchestrated Network Computing Paradigms,ACM Computing Surveys,2019,article,cloud_computing,4,81.0,270.0,48.23825220633149,615,48.6065,True,False,baseline,asurveyonendedgecloudorchestratednetworkcomputingparadigms,48.23825220633149,landmark,True | ||
| 99 | −4386827074,10.4018/979-8-3693-1186-8.ch026,,"Synergizing Artificial Intelligence, 5G, and Cloud Computing for Efficient Energy Conversion Using Agricultural Waste","Practice, progress, and proficiency in sustainability",2023,book-chapter,cloud_computing,1,70.0,81.0,55.757590478503765,82,55.9724,True,False,post,55.757590478503765,landmark,True | 99 | +7161556515,10.1109/gaiis69281.2026.11519206,,DeepServeCB: SLO-Aware and Cost-Aware Elastic Scheduling for Serverless Multi-Tenant LLM Inference,International Conference on Generative Artificial Intelligence and Information Security (GAIIS),2026,conference-paper,cloud_computing,7,19.0,19.0,179.3930434782609,19,217.1439,True,False,post,deepservecbsloawareandcostawareelasticschedulingforserverlessmultitenantllminference,48.173937831626986,landmark,True | ||
| 100 | −3011330593,10.1007/s10586-020-03075-5,,A novel hybrid antlion optimization algorithm for multi-objective task scheduling problems in cloud computing environments,Cluster Computing,2020,article,cloud_computing,3,109.0,189.0,55.03527669771227,355,59.7401,False,False,baseline,55.03527669771227,landmark,True | 100 | +7160823269,10.1109/cisce69494.2026.11504752,,TokenPool-Scheduler: Token-Level GPU Pooling and Resource Slicing for Multi-Model Co-Location,,2026,conference-paper,cloud_computing,6,19.0,19.0,179.3930434782609,19,217.1439,True,False,post,tokenpoolschedulertokenlevelgpupoolingandresourceslicingformultimodelcolocation,48.173937831626986,landmark,True | ||
| 101 | −7160863705,10.1109/cisce69494.2026.11504731,,Multi-Objective Scheduling for Large Language Model Inference with Prompt-Level Cost Prediction and SLO Awareness,,2026,conference-paper,cloud_computing,4,15.0,15.0,141.62608695652176,15,171.4294,True,True,post,53.328308689860684,landmark,True | 101 | +3010543330,10.48550/arxiv.2003.03423,2003.03423,Serverless in the Wild: Characterizing and Optimizing the Serverless Workload at a Large Cloud Provider,arXiv (Cornell University),2020,preprint,cloud_computing,5,84.0,126.0,46.24970414201183,237,,True,True,baseline,serverlessinthewildcharacterizingandoptimizingtheserverlessworkloadatalargecloudprovider,46.24970414201183,landmark,True | ||
| 102 | −4293584584,10.4230/oasics.ng-res.2024.2,,A Multi-Modal Distributed Real-Time IoT System for Urban Traffic Control (Invited Paper),DROPS (Schloss Dagstuhl – Leibniz Center for Informatics),2024,article,edge_computing,3,13850.0,14039.0,991.9504732778122,14040,523.7037,True,True,post,991.9504732778122,landmark,True | 102 | +4293584584,10.4230/oasics.ng-res.2024.2,,A Multi-Modal Distributed Real-Time IoT System for Urban Traffic Control (Invited Paper),DROPS (Schloss Dagstuhl – Leibniz Center for Informatics),2024,article,edge_computing,3,13850.0,14039.0,991.9504732778122,14040,523.7037,True,True,post,amultimodaldistributedrealtimeiotsystemforurbantrafficcontrolinvitedpaper,991.9504732778122,landmark,True | ||
| 103 | −4398201281,10.3390/blockchains2020009,,Situ-Oracle: A Learning-Based Situation Analysis Framework for Blockchain-Based IoT Systems,Blockchains,2024,dissertation,edge_computing,7,7.0,9.0,350.4666666666667,9,,True,True,post,350.4666666666667,landmark,True | 103 | +4398201281,10.3390/blockchains2020009,,Situ-Oracle: A Learning-Based Situation Analysis Framework for Blockchain-Based IoT Systems,Blockchains,2024,dissertation,edge_computing,7,7.0,9.0,350.4666666666667,9,,True,True,post,situoraclealearningbasedsituationanalysisframeworkforblockchainbasediotsystems,350.4666666666667,landmark,True | ||
| 104 | −2803371618,10.1016/j.future.2018.05.046,,On blockchain and its integration with IoT. Challenges and opportunities,Future Generation Computer Systems,2018,article,edge_computing,5,203.0,490.0,259.79657456259923,1909,332.6297,True,True,baseline,259.79657456259923,landmark,True | 104 | +2803371618,10.1016/j.future.2018.05.046,,On blockchain and its integration with IoT. Challenges and opportunities,Future Generation Computer Systems,2018,article,edge_computing,5,203.0,490.0,259.79657456259923,1909,332.6297,True,True,baseline,onblockchainanditsintegrationwithiotchallengesandopportunities,259.79657456259923,landmark,True | ||
| 105 | −2793346081,10.1109/jiot.2018.2812239,,Blockchain Meets IoT: An Architecture for Scalable Access Management in IoT,IEEE Internet of Things Journal,2018,article,edge_computing,4,214.0,449.0,238.05849383389193,1314,280.4052,True,False,baseline,238.05849383389193,landmark,True | 105 | +2793346081,10.1109/jiot.2018.2812239,,Blockchain Meets IoT: An Architecture for Scalable Access Management in IoT,IEEE Internet of Things Journal,2018,article,edge_computing,4,214.0,449.0,238.05849383389193,1314,280.4052,True,False,baseline,blockchainmeetsiotanarchitectureforscalableaccessmanagementiniot,238.05849383389193,landmark,True | ||
| 106 | −3023617420,10.1109/access.2020.2992341,,"A Comprehensive Review of the COVID-19 Pandemic and the Role of IoT, Drones, AI, Blockchain, and 5G in Managing its Impact",IEEE Access,2020,article,edge_computing,3,466.0,725.0,211.1141566446635,1096,210.1365,True,True,baseline,211.1141566446635,landmark,True | 106 | +3023617420,10.1109/access.2020.2992341,,"A Comprehensive Review of the COVID-19 Pandemic and the Role of IoT, Drones, AI, Blockchain, and 5G in Managing its Impact",IEEE Access,2020,article,edge_computing,3,466.0,725.0,211.1141566446635,1096,210.1365,True,True,baseline,acomprehensivereviewofthecovid19pandemicandtheroleofiotdronesaiblockchainand5ginmanagingitsimpact,211.1141566446635,landmark,True | ||
| 107 | −2562507292,10.1201/9781003338628-7,,Internet of Things Applications - From Research and Innovation to Market Deployment,River Publishers eBooks,2022,book-chapter,edge_computing,2,216.0,221.0,171.71408036142103,233,36.0148,True,True,baseline,171.71408036142103,landmark,True | 107 | +2562507292,10.1201/9781003338628-7,,Internet of Things Applications - From Research and Innovation to Market Deployment,River Publishers eBooks,2022,book-chapter,edge_computing,2,216.0,221.0,171.71408036142103,233,36.0148,True,True,baseline,internetofthingsapplicationsfromresearchandinnovationtomarketdeployment,171.71408036142103,landmark,True | ||
| 108 | −3017623177,10.1016/j.dsx.2020.04.032,,Industry 4.0 technologies and their applications in fighting COVID-19 pandemic,Diabetes & Metabolic Syndrome Clinical Research & Reviews,2020,article,edge_computing,1,337.0,508.0,147.9255056213642,757,146.6771,False,True,baseline,147.9255056213642,landmark,True | 108 | +3017623177,10.1016/j.dsx.2020.04.032,,Industry 4.0 technologies and their applications in fighting COVID-19 pandemic,Diabetes & Metabolic Syndrome Clinical Research & Reviews,2020,article,edge_computing,1,337.0,508.0,147.9255056213642,757,146.6771,False,True,baseline,industry40technologiesandtheirapplicationsinfightingcovid19pandemic,147.9255056213642,landmark,True | ||
| 109 | −2908737503,10.3390/s19020326,,A Decentralized Privacy-Preserving Healthcare Blockchain for IoT,Sensors,2019,article,edge_computing,6,167.0,347.0,141.63968059818606,880,158.7039,True,True,baseline,141.63968059818606,landmark,True | 109 | +2908737503,10.3390/s19020326,,A Decentralized Privacy-Preserving Healthcare Blockchain for IoT,Sensors,2019,article,edge_computing,6,167.0,347.0,141.63968059818606,880,158.7039,True,True,baseline,adecentralizedprivacypreservinghealthcareblockchainforiot,141.63968059818606,landmark,True | ||
| 110 | −3023398824,10.1016/j.dsx.2020.04.041,,Internet of things (IoT) applications to fight against COVID-19 pandemic,Diabetes & Metabolic Syndrome Clinical Research & Reviews,2020,article,edge_computing,2,289.0,455.0,132.4923327907888,664,133.1949,False,True,baseline,132.4923327907888,landmark,True | 110 | +3023398824,10.1016/j.dsx.2020.04.041,,Internet of things (IoT) applications to fight against COVID-19 pandemic,Diabetes & Metabolic Syndrome Clinical Research & Reviews,2020,article,edge_computing,2,289.0,455.0,132.4923327907888,664,133.1949,False,True,baseline,internetofthingsiotapplicationstofightagainstcovid19pandemic,132.4923327907888,landmark,True | ||
| 111 | −2947690458,10.1109/jiot.2019.2920987,1906.00245,Blockchain for Internet of Things: A Survey,IEEE Internet of Things Journal,2019,article,edge_computing,7,142.0,323.0,131.8432761764095,1087,171.5127,True,True,baseline,131.8432761764095,landmark,True | 111 | +2947690458,10.1109/jiot.2019.2920987,1906.00245,Blockchain for Internet of Things: A Survey,IEEE Internet of Things Journal,2019,article,edge_computing,7,142.0,323.0,131.8432761764095,1087,171.5127,True,True,baseline,blockchainforinternetofthingsasurvey,131.8432761764095,landmark,True | ||
| 112 | −2885100636,10.3390/s18082575,,Blockchain and IoT Integration: A Systematic Survey,Sensors,2018,article,edge_computing,6,100.0,219.0,116.11316291675352,748,144.2199,True,True,baseline,116.11316291675352,landmark,True | 112 | +2885100636,10.3390/s18082575,,Blockchain and IoT Integration: A Systematic Survey,Sensors,2018,article,edge_computing,6,100.0,219.0,116.11316291675352,748,144.2199,True,True,baseline,blockchainandiotintegrationasystematicsurvey,116.11316291675352,landmark,True | ||
| 113 | −3006456063,10.1016/j.jii.2020.100129,,"Industry 4.0 and Health: Internet of Things, Big Data, and Cloud Computing for Healthcare 4.0",Journal of Industrial Information Integration,2020,article,edge_computing,3,233.0,388.0,112.9824727974199,876,123.8968,False,False,baseline,112.9824727974199,landmark,True | 113 | +3006456063,10.1016/j.jii.2020.100129,,"Industry 4.0 and Health: Internet of Things, Big Data, and Cloud Computing for Healthcare 4.0",Journal of Industrial Information Integration,2020,article,edge_computing,3,233.0,388.0,112.9824727974199,876,123.8968,False,False,baseline,industry40andhealthinternetofthingsbigdataandcloudcomputingforhealthcare40,112.9824727974199,landmark,True | ||
| 114 | −2974429275,10.1109/tii.2019.2942190,,Blockchain and Federated Learning for Privacy-Preserved Data Sharing in Industrial IoT,IEEE Transactions on Industrial Informatics,2019,article,edge_computing,5,79.0,275.0,112.25046733285639,1237,155.2674,True,False,baseline,112.25046733285639,landmark,True | 114 | +2974429275,10.1109/tii.2019.2942190,,Blockchain and Federated Learning for Privacy-Preserved Data Sharing in Industrial IoT,IEEE Transactions on Industrial Informatics,2019,article,edge_computing,5,79.0,275.0,112.25046733285639,1237,155.2674,True,False,baseline,blockchainandfederatedlearningforprivacypreserveddatasharinginindustrialiot,112.25046733285639,landmark,True | ||
| 115 | −4386961654,10.3390/s23198015,,Exploring the Full Potentials of IoT for Better Financial Growth and Stability: A Comprehensive Survey,Sensors,2023,article,edge_computing,4,268.0,473.0,110.8597419743026,563,131.8285,True,True,post,110.8597419743026,landmark,True | 115 | +4386961654,10.3390/s23198015,,Exploring the Full Potentials of IoT for Better Financial Growth and Stability: A Comprehensive Survey,Sensors,2023,article,edge_computing,4,268.0,473.0,110.8597419743026,563,131.8285,True,True,post,exploringthefullpotentialsofiotforbetterfinancialgrowthandstabilityacomprehensivesurvey,110.8597419743026,landmark,True | ||
| 116 | −4362498422,10.12681/eadd/53552,,Security and privacy in the internet of things,,2023,dissertation,edge_computing,3,6.0,6.0,110.13333333333334,6,,True,False,post,110.13333333333334,landmark,True | 116 | +2912978522,10.1109/comst.2019.2894727,,"Integrated Blockchain and Edge Computing Systems: A Survey, Some Research Issues and Challenges",IEEE Communications Surveys & Tutorials,2019,article,edge_computing,5,123.0,257.0,104.90316401652396,688,125.5885,True,False,baseline,integratedblockchainandedgecomputingsystemsasurveysomeresearchissuesandchallenges,104.90316401652396,landmark,True | ||
| 117 | −2912978522,10.1109/comst.2019.2894727,,"Integrated Blockchain and Edge Computing Systems: A Survey, Some Research Issues and Challenges",IEEE Communications Surveys & Tutorials,2019,article,edge_computing,5,123.0,257.0,104.90316401652396,688,125.5885,True,False,baseline,104.90316401652396,landmark,True | 117 | +2950865323,10.1109/jproc.2019.2918951,1905.10083,Edge Intelligence: Paving the Last Mile of Artificial Intelligence With Edge Computing,Proceedings of the IEEE,2019,article,edge_computing,7,242.0,584.0,104.33755292036145,2403,130.9484,True,True,baseline,edgeintelligencepavingthelastmileofartificialintelligencewithedgecomputing,104.33755292036145,landmark,True | ||
| 118 | −2950865323,10.1109/jproc.2019.2918951,1905.10083,Edge Intelligence: Paving the Last Mile of Artificial Intelligence With Edge Computing,Proceedings of the IEEE,2019,article,edge_computing,7,242.0,584.0,104.33755292036145,2403,130.9484,True,True,baseline,104.33755292036145,landmark,True | 118 | +4313646859,10.1002/widm.1485,2301.10009,"Remote patient monitoring using artificial intelligence: Current state, applications, and challenges",Wiley Interdisciplinary Reviews Data Mining and Knowledge Discovery,2023,article,edge_computing,5,192.0,411.0,96.32844387196272,515,121.019,True,True,post,remotepatientmonitoringusingartificialintelligencecurrentstateapplicationsandchallenges,96.32844387196272,landmark,True | ||
| 119 | −7129024920,10.1109/jiot.2026.3665050,,TinyLSN: A Lightweight Network for Real-Time Marine Pipeline Leakage Detection in IoT Systems,IEEE Internet of Things Journal,2026,article,edge_computing,6,29.0,29.0,33.756,29,56.592,True,False,post,103.10139680039732,landmark,True | 119 | +4401806686,10.1016/j.hybadv.2024.100277,,AI revolutionizing industries worldwide: A comprehensive overview of its diverse applications,Hybrid Advances,2024,article,edge_computing,6,415.0,749.0,93.03175978035208,749,111.3178,True,True,post,airevolutionizingindustriesworldwideacomprehensiveoverviewofitsdiverseapplications,93.03175978035208,landmark,True | ||
| 120 | −4408363154,10.3390/s25061763,,"From Sensors to Data Intelligence: Leveraging IoT, Cloud, and Edge Computing with AI",Sensors,2025,article,edge_computing,3,201.0,201.0,76.45446851404553,201,88.6024,True,True,post,101.75802982990899,landmark,True | 120 | +4320712473,10.1016/j.iot.2023.100721,,The Internet of Things (IoT) in healthcare: Taking stock and moving forward,Internet of Things,2023,article,edge_computing,4,233.0,379.0,88.82841904494859,448,105.2748,True,True,post,theinternetofthingsiotinhealthcaretakingstockandmovingforward,88.82841904494859,landmark,True | ||
| 121 | −4407389811,10.3390/electronics14040696,,Integrating Artificial Intelligence Agents with the Internet of Things for Enhanced Environmental Monitoring: Applications in Water Quality and Climate Data,Electronics,2025,article,edge_computing,4,199.0,199.0,172.77199169706373,199,217.4065,True,True,post,100.74551212015865,landmark,True | 121 | +2983008824,10.1016/j.jnca.2019.102481,,"A Comprehensive Survey on Attacks, Security Issues and Blockchain Solutions for IoT and IIoT",Journal of Network and Computer Applications,2019,article,edge_computing,3,69.0,217.0,88.57582331356303,840,122.4644,False,False,baseline,acomprehensivesurveyonattackssecurityissuesandblockchainsolutionsforiotandiiot,88.57582331356303,landmark,True | ||
| 122 | −4313646859,10.1002/widm.1485,2301.10009,"Remote patient monitoring using artificial intelligence: Current state, applications, and challenges",Wiley Interdisciplinary Reviews Data Mining and Knowledge Discovery,2023,article,edge_computing,5,192.0,411.0,96.32844387196272,515,121.019,True,True,post,96.32844387196272,landmark,True | 122 | +4408363154,10.3390/s25061763,,"From Sensors to Data Intelligence: Leveraging IoT, Cloud, and Edge Computing with AI",Sensors,2025,article,edge_computing,3,201.0,201.0,76.45446851404553,201,88.6024,True,True,post,fromsensorstodataintelligenceleveragingiotcloudandedgecomputingwithai,87.8312850994121,landmark,True | ||
| 123 | −4401806686,10.1016/j.hybadv.2024.100277,,AI revolutionizing industries worldwide: A comprehensive overview of its diverse applications,Hybrid Advances,2024,article,edge_computing,6,415.0,749.0,93.03175978035208,749,111.3178,True,True,post,93.03175978035208,landmark,True | 123 | +2918245750,10.1016/j.future.2019.02.060,,"Privacy preservation in blockchain based IoT systems: Integration issues, prospects, challenges, and future research directions",Future Generation Computer Systems,2019,article,edge_computing,4,84.0,215.0,87.75945627841499,520,104.0323,False,True,baseline,privacypreservationinblockchainbasediotsystemsintegrationissuesprospectschallengesandfutureresearchdirections,87.75945627841499,landmark,True | ||
| 124 | −7125650829,10.1007/s44336-025-00031-y,2506.12479,"AI Flow: perspectives, scenarios, and approaches",Vicinagearth.,2026,article,edge_computing,6,25.0,25.0,87.76730891382596,25,96.3814,True,True,post,88.88051448310114,landmark,True | 124 | +4407389811,10.3390/electronics14040696,,Integrating Artificial Intelligence Agents with the Internet of Things for Enhanced Environmental Monitoring: Applications in Water Quality and Climate Data,Electronics,2025,article,edge_computing,4,199.0,199.0,172.77199169706373,199,217.4065,True,True,post,integratingartificialintelligenceagentswiththeinternetofthingsforenhancedenvironmentalmonitoringapplicationsinwaterqualityandclimatedata,86.95734196409457,landmark,True | ||
| 125 | −4320712473,10.1016/j.iot.2023.100721,,The Internet of Things (IoT) in healthcare: Taking stock and moving forward,Internet of Things,2023,article,edge_computing,4,233.0,379.0,88.82841904494859,448,105.2748,True,True,post,88.82841904494859,landmark,True | 125 | +2921608598,10.1109/tii.2019.2903342,,Towards Secure Industrial IoT: Blockchain System With Credit-Based Consensus Mechanism,IEEE Transactions on Industrial Informatics,2019,article,edge_computing,4,97.0,211.0,86.12672220811889,562,98.0965,True,True,baseline,towardssecureindustrialiotblockchainsystemwithcreditbasedconsensusmechanism,86.12672220811889,landmark,True | ||
| 126 | −2983008824,10.1016/j.jnca.2019.102481,,"A Comprehensive Survey on Attacks, Security Issues and Blockchain Solutions for IoT and IIoT",Journal of Network and Computer Applications,2019,article,edge_computing,3,69.0,217.0,88.57582331356303,840,122.4644,False,False,baseline,88.57582331356303,landmark,True | 126 | +2951308194,,,Blockchain and smart contracts for the internet of things,"Portuguese National Funding Agency for Science, Research and Technology (RCAAP Project by FCT)",2018,dissertation,edge_computing,3,7.0,8.0,81.83864915572232,11,,True,True,baseline,blockchainandsmartcontractsfortheinternetofthings,81.83864915572232,landmark,True | ||
| 127 | −2602956630,10.1201/9781003338604-2,,Internet of Things Strategic Research Roadmap,River Publishers eBooks,2022,book-chapter,computer_networks,2,917.0,944.0,727.1609786504597,1002,103.9744,True,True,baseline,727.1609786504597,landmark,True | 127 | +2602956630,10.1201/9781003338604-2,,Internet of Things Strategic Research Roadmap,River Publishers eBooks,2022,book-chapter,computer_networks,2,917.0,944.0,727.1609786504597,1002,103.9744,True,True,baseline,internetofthingsstrategicresearchroadmap,727.1609786504597,landmark,True | ||
| 128 | −1500148551,10.48550/arxiv.2603.08623,2603.08623,Time-based Fairness Improves Performance in Multi-rate WLANs,arXiv (Cornell University),2026,preprint,computer_networks,3,100.0,100.0,2873.046875,231,,True,True,post,355.52205793240455,landmark,True | 128 | +2762829140,10.6069/5wt6-j462,,Deep Learning based Intrusion Detection System for Internet of Things,ResearchWorks at the University of Washington (University of Washington),2024,dissertation,computer_networks,4,12.0,12.0,302.4347826086956,12,,True,True,post,deeplearningbasedintrusiondetectionsystemforinternetofthings,302.4347826086956,landmark,True | ||
| 129 | −2762829140,10.6069/5wt6-j462,,Deep Learning based Intrusion Detection System for Internet of Things,ResearchWorks at the University of Washington (University of Washington),2024,dissertation,computer_networks,4,12.0,12.0,302.4347826086956,12,,True,True,post,302.4347826086956,landmark,True | 129 | +2940715617,,,Offloading Real-time DDoS Attack Detection to Programmable Data Planes,Americanae (AECID Library),2019,dissertation,computer_networks,3,15.0,36.0,281.8709677419355,56,,True,True,baseline,offloadingrealtimeddosattackdetectiontoprogrammabledataplanes,281.8709677419355,landmark,True | ||
| 130 | −2940715617,,,Offloading Real-time DDoS Attack Detection to Programmable Data Planes,Americanae (AECID Library),2019,dissertation,computer_networks,3,15.0,36.0,281.8709677419355,56,,True,True,baseline,281.8709677419355,landmark,True | 130 | +1500148551,10.48550/arxiv.2603.08623,2603.08623,Time-based Fairness Improves Performance in Multi-rate WLANs,arXiv (Cornell University),2026,preprint,computer_networks,3,100.0,100.0,2873.046875,231,,True,True,post,timebasedfairnessimprovesperformanceinmultiratewlans,253.5470412190894,landmark,True | ||
| 131 | −7123361055,10.1109/comst.2026.3651702,,"Toward Edge General Intelligence With Agentic AI and Agentification: Concepts, Technologies, and Future Directions",IEEE Communications Surveys & Tutorials,2026,article,computer_networks,4,73.0,73.0,256.28054202837177,73,305.9063,True,False,post,259.5311022906553,landmark,True | 131 | +2772457693,10.1109/comst.2018.2844341,1712.04301,Deep Learning for IoT Big Data and Streaming Analytics: A Survey,IEEE Communications Surveys & Tutorials,2018,article,computer_networks,5,173.0,419.0,222.15258110556954,1462,281.2086,True,True,baseline,deeplearningforiotbigdataandstreaminganalyticsasurvey,222.15258110556954,landmark,True | ||
| 132 | −7124594522,10.1007/s41870-025-03116-5,,Energy-efficient 5G-enabled sensor networks for smart environmental monitoring in sustainable cities,International Journal of Information Technology,2026,article,computer_networks,2,63.0,63.0,221.1736184628414,63,264.0013,False,False,post,223.97889649741487,landmark,True | 132 | +1823805418,10.17487/rfc8684,,TCP Extensions for Multipath Operation with Multiple Addresses,,2020,report,computer_networks,3,796.0,831.0,214.13475177304963,1008,,True,True,baseline,tcpextensionsformultipathoperationwithmultipleaddresses,214.13475177304963,landmark,True | ||
| 133 | −2772457693,10.1109/comst.2018.2844341,1712.04301,Deep Learning for IoT Big Data and Streaming Analytics: A Survey,IEEE Communications Surveys & Tutorials,2018,article,computer_networks,5,173.0,419.0,222.15258110556954,1462,281.2086,True,True,baseline,222.15258110556954,landmark,True | 133 | +4292259483,10.1109/mcom.2022.9860244,,The IEEE International Conference on Communications 2022 (ICC'22),IEEE Communications Magazine,2022,article,computer_networks,1,38.0,59.0,197.26717557251908,78,,True,True,baseline,theieeeinternationalconferenceoncommunications2022icc22,197.26717557251908,landmark,True | ||
| 134 | −7134136722,10.1016/j.jnca.2026.104462,,Hybrid Al-Biruni and Puma Optimization (BERPO) for boosting the classification of Quality-of-Service (QoS) in 5G networks,Journal of Network and Computer Applications,2026,article,computer_networks,1,61.0,61.0,67.88089344511127,61,220.3697,False,False,post,216.86845533876678,landmark,True | 134 | +7123361055,10.1109/comst.2026.3651702,,"Toward Edge General Intelligence With Agentic AI and Agentification: Concepts, Technologies, and Future Directions",IEEE Communications Surveys & Tutorials,2026,article,computer_networks,4,73.0,73.0,256.28054202837177,73,305.9063,True,False,post,towardedgegeneralintelligencewithagenticaiandagentificationconceptstechnologiesandfuturedirections,185.08934008993526,landmark,True | ||
| 135 | −1823805418,10.17487/rfc8684,,TCP Extensions for Multipath Operation with Multiple Addresses,,2020,report,computer_networks,3,796.0,831.0,214.13475177304963,1008,,True,True,baseline,214.13475177304963,landmark,True | 135 | +7124594522,10.1007/s41870-025-03116-5,,Energy-efficient 5G-enabled sensor networks for smart environmental monitoring in sustainable cities,International Journal of Information Technology,2026,article,computer_networks,2,63.0,63.0,221.1736184628414,63,264.0013,False,False,post,energyefficient5genabledsensornetworksforsmartenvironmentalmonitoringinsustainablecities,159.7346359680263,landmark,True | ||
| 136 | −4415028496,10.1109/comst.2026.3669216,2505.01821,Edge-Cloud Collaborative Computing on Distributed Intelligence and Model Optimization: A Survey,IEEE Communications Surveys & Tutorials,2026,article,computer_networks,9,60.0,60.0,210.64154139318228,60,243.0488,True,True,post,213.31323475944274,landmark,True | 136 | +7134136722,10.1016/j.jnca.2026.104462,,Hybrid Al-Biruni and Puma Optimization (BERPO) for boosting the classification of Quality-of-Service (QoS) in 5G networks,Journal of Network and Computer Applications,2026,article,computer_networks,1,61.0,61.0,67.88089344511127,61,220.3697,False,False,post,hybridalbiruniandpumaoptimizationberpoforboostingtheclassificationofqualityofserviceqosin5gnetworks,154.66369514364453,landmark,True | ||
| 137 | −4285039189,10.12681/eadd/51938,,Mobile ad-hoc networks (MANET),,2022,dissertation,computer_networks,1,28.0,28.0,211.50980392156862,58,,True,False,baseline,211.50980392156862,landmark,True | 137 | +4415028496,10.1109/comst.2026.3669216,2505.01821,Edge-Cloud Collaborative Computing on Distributed Intelligence and Model Optimization: A Survey,IEEE Communications Surveys & Tutorials,2026,article,computer_networks,9,60.0,60.0,210.64154139318228,60,243.0488,True,True,post,edgecloudcollaborativecomputingondistributedintelligenceandmodeloptimizationasurvey,152.12822473145363,landmark,True | ||
| 138 | −4292259483,10.1109/mcom.2022.9860244,,The IEEE International Conference on Communications 2022 (ICC'22),IEEE Communications Magazine,2022,article,computer_networks,1,38.0,59.0,197.26717557251908,78,,True,True,baseline,197.26717557251908,landmark,True | 138 | +2962883549,10.1109/comst.2019.2904897,,Deep Learning in Mobile and Wireless Networking: A Survey,IEEE Communications Surveys & Tutorials,2019,article,computer_networks,2,473.0,812.0,145.07207700570802,1768,138.2463,True,False,baseline,deeplearninginmobileandwirelessnetworkingasurvey,145.07207700570802,landmark,True | ||
| 139 | −7127083419,10.1109/jsac.2026.3660010,2505.22311,From Large AI Models to Agentic AI: A Tutorial on Future Intelligent Communications,IEEE Journal on Selected Areas in Communications,2026,article,computer_networks,2,50.0,50.0,74.70889613414066,50,77.1613,True,True,post,177.76102896620228,landmark,True | 139 | +153405511,10.57709/1059389,,"An Analysis of the MOS under Conditions of Delay, Jitter and Packet Loss and an Analysis of the Impact of Introducing Piggybacking and Reed Solomon FEC for VOIP",Digital Archive @ GSU,2022,dissertation,computer_networks,4,19.0,19.0,143.52450980392155,19,,True,True,baseline,ananalysisofthemosunderconditionsofdelayjitterandpacketlossandananalysisoftheimpactofintroducingpiggybackingandreedsolomonfecforvoip,143.52450980392155,landmark,True | ||
| 140 | −2962883549,10.1109/comst.2019.2904897,,Deep Learning in Mobile and Wireless Networking: A Survey,IEEE Communications Surveys & Tutorials,2019,article,computer_networks,2,473.0,812.0,145.07207700570802,1768,138.2463,True,False,baseline,145.07207700570802,landmark,True | 140 | +4206510620,10.1007/978-3-030-87059-1_4,,The Role of Machine Learning Techniques in Internet of Things-Based Cloud Applications,Internet of things,2022,book-chapter,computer_networks,3,98.0,176.0,136.74967485796427,223,144.059,False,False,baseline,theroleofmachinelearningtechniquesininternetofthingsbasedcloudapplications,136.74967485796427,landmark,True | ||
| 141 | −4395064458,10.1017/9781009489843,,Wireless Communications,Cambridge University Press eBooks,2024,book,computer_networks,1,347.0,458.0,144.12803234501348,541,214.916,True,False,post,144.12803234501348,landmark,True | 141 | +4322576964,10.1109/comst.2023.3249835,,"On the Road to 6G: Visions, Requirements, Key Technologies, and Testbeds",IEEE Communications Surveys & Tutorials,2023,article,computer_networks,1,832.0,1763.0,133.06276599375022,2336,171.2254,True,True,post,ontheroadto6gvisionsrequirementskeytechnologiesandtestbeds,133.06276599375022,landmark,True | ||
| 142 | −153405511,10.57709/1059389,,"An Analysis of the MOS under Conditions of Delay, Jitter and Packet Loss and an Analysis of the Impact of Introducing Piggybacking and Reed Solomon FEC for VOIP",Digital Archive @ GSU,2022,dissertation,computer_networks,4,19.0,19.0,143.52450980392155,19,,True,True,baseline,143.52450980392155,landmark,True | 142 | +7127083419,10.1109/jsac.2026.3660010,2505.22311,From Large AI Models to Agentic AI: A Tutorial on Future Intelligent Communications,IEEE Journal on Selected Areas in Communications,2026,article,computer_networks,2,50.0,50.0,74.70889613414066,50,77.1613,True,True,post,fromlargeaimodelstoagenticaiatutorialonfutureintelligentcommunications,126.7735206095447,landmark,True | ||
| 143 | −4416378800,10.1109/tcomm.2026.3658289,,Pinching-Antenna Systems (PASS): A Tutorial,IEEE Transactions on Communications,2026,article,computer_networks,2,40.0,40.0,52.205714285714286,40,111.2683,True,True,post,142.20882317296181,landmark,True | 143 | +3104550706,10.1184/r1/6468842.v1,,Gossip Algorithms for Distributed Signal Processing,,2018,article,computer_networks,1,553.0,607.0,121.54403377438375,692,30.8092,True,True,baseline,gossipalgorithmsfordistributedsignalprocessing,121.54403377438375,landmark,True | ||
| 144 | −4206510620,10.1007/978-3-030-87059-1_4,,The Role of Machine Learning Techniques in Internet of Things-Based Cloud Applications,Internet of things,2022,book-chapter,computer_networks,3,98.0,176.0,136.74967485796427,223,144.059,False,False,baseline,136.74967485796427,landmark,True | 144 | +1710433637,10.17487/rfc9260,,Stream Control Transmission Protocol,,2022,report,computer_networks,1,645.0,659.0,119.70282413350449,1922,,True,False,baseline,streamcontroltransmissionprotocol,119.70282413350449,landmark,True | ||
| 145 | −4322576964,10.1109/comst.2023.3249835,,"On the Road to 6G: Visions, Requirements, Key Technologies, and Testbeds",IEEE Communications Surveys & Tutorials,2023,article,computer_networks,1,832.0,1763.0,133.06276599375022,2336,171.2254,True,True,post,133.06276599375022,landmark,True | 145 | +3194620979,10.1109/jsac.2022.3156632,,Integrated Sensing and Communications: Toward Dual-Functional Wireless Networks for 6G and Beyond,IEEE Journal on Selected Areas in Communications,2022,article,computer_networks,2,639.0,1558.0,118.9064113669858,3786,312.6996,True,True,baseline,integratedsensingandcommunicationstowarddualfunctionalwirelessnetworksfor6gandbeyond,118.9064113669858,landmark,True | ||
| 146 | −7123349468,10.1109/jiot.2026.3652582,,SMNet: A Novel Compositional Generalization Model for Industrial Robot Multijoint Fault Diagnosis,IEEE Internet of Things Journal,2026,article,computer_networks,4,37.0,37.0,40.9855601659751,37,100.0756,True,False,post,131.54316143498968,landmark,True | 146 | +2545990795,10.17487/rfc9000,,QUIC: A UDP-Based Multiplexed and Secure Transport,,2021,report,computer_networks,3,316.0,458.0,115.2256020278834,828,,True,False,baseline,quicaudpbasedmultiplexedandsecuretransport,115.2256020278834,landmark,True | ||
| 147 | −7125196921,10.1109/jiot.2026.3655796,2505.03036,"Energy, Scalability, Data, and Security in Massive IoT: Current Landscape and Future Directions",IEEE Internet of Things Journal,2026,article,computer_networks,8,35.0,35.0,122.87423247935634,35,146.6674,True,True,post,124.4327202763416,landmark,True | 147 | +3015636663,10.1109/comst.2020.2986024,1909.11875,Federated Learning in Mobile Edge Networks: A Comprehensive Survey,IEEE Communications Surveys & Tutorials,2020,article,computer_networks,6,471.0,885.0,110.69210549120425,2537,130.0371,True,True,baseline,federatedlearninginmobileedgenetworksacomprehensivesurvey,110.69210549120425,landmark,True | ||
| 148 | −3104550706,10.1184/r1/6468842.v1,,Gossip Algorithms for Distributed Signal Processing,,2018,article,computer_networks,1,553.0,607.0,121.54403377438375,692,30.8092,True,True,baseline,121.54403377438375,landmark,True | 148 | +4396669794,10.4018/979-8-3693-1335-0.ch018,,Optimized Throughput-Based Broadcasting for Next Generation Wireless Networks,Advances in civil and industrial engineering book series,2024,book-chapter,computer_networks,1,114.0,114.0,109.86076986076985,114,123.4038,True,False,post,optimizedthroughputbasedbroadcastingfornextgenerationwirelessnetworks,109.86076986076985,landmark,True | ||
| 149 | −7125115033,10.1109/comst.2026.3655674,,Integrated Sensing and Communications Over the Years: An Evolution Perspective,IEEE Communications Surveys & Tutorials,2026,article,computer_networks,1,34.0,34.0,44.374857142857145,32,85.591,False,True,post,120.87749969701756,landmark,True | 149 | +1150714886,,,OPNET simulation of voice over MPLS: With Considering Traffic Engineering,,2019,dissertation,computer_networks,1,13.0,14.0,109.61648745519715,14,,True,False,baseline,opnetsimulationofvoiceovermplswithconsideringtrafficengineering,109.61648745519715,landmark,True | ||
| 150 | −1710433637,10.17487/rfc9260,,Stream Control Transmission Protocol,,2022,report,computer_networks,1,645.0,659.0,119.70282413350449,1922,,True,False,baseline,119.70282413350449,landmark,True | 150 | +4306827119,10.1007/s10586-022-03776-z,,Internet of Things intrusion detection systems: a comprehensive review and future directions,Cluster Computing,2022,book-chapter,computer_networks,4,33.0,141.0,108.61196820944366,340,212.7111,False,False,baseline,internetofthingsintrusiondetectionsystemsacomprehensivereviewandfuturedirections,108.61196820944366,landmark,True | ||
| 151 | −4406207083,10.1109/comst.2025.3527641,,Mobile Edge Intelligence for Large Language Models: A Contemporary Survey,IEEE Communications Surveys & Tutorials,2025,article,computer_networks,6,236.0,236.0,89.76743566823257,235,102.2674,True,True,post,119.47708975053992,landmark,True | 151 | +3102359135,10.1007/978-3-030-72802-1_9,2011.09144,NetFlow Datasets for Machine Learning-Based Network Intrusion Detection Systems,"Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering",2021,book-chapter,computer_networks,2,55.0,126.0,108.5769660827432,403,150.6621,False,True,baseline,netflowdatasetsformachinelearningbasednetworkintrusiondetectionsystems,108.5769660827432,landmark,True | ||
| 152 | −3194620979,10.1109/jsac.2022.3156632,,Integrated Sensing and Communications: Toward Dual-Functional Wireless Networks for 6G and Beyond,IEEE Journal on Selected Areas in Communications,2022,article,computer_networks,2,639.0,1558.0,118.9064113669858,3786,312.6996,True,True,baseline,118.9064113669858,landmark,True | 152 | +3129486236,10.1109/tcomm.2021.3051897,2007.02759,Intelligent Reflecting Surface-Aided Wireless Communications: A Tutorial,IEEE Transactions on Communications,2021,article,computer_networks,2,774.0,1396.0,108.19285671504721,3002,145.9637,True,True,baseline,intelligentreflectingsurfaceaidedwirelesscommunicationsatutorial,108.19285671504721,landmark,True | ||
| 153 | −3129486236,10.1109/tcomm.2021.3051897,2007.02759,Intelligent Reflecting Surface-Aided Wireless Communications: A Tutorial,IEEE Transactions on Communications,2021,article,computer_networks,2,774.0,1396.0,108.19285671504721,3002,145.9637,True,True,baseline,108.19285671504721,landmark,True | ||||
modified
literature_synthesis/landmarks/hardware_emerging_abstracts.jsonl
+63 −63
@@ -1,49 +1,75 @@ | |||||
| 1 | {"work_id": 3134501457, "title": "KLASIFIKASI INDEKS PEMBANGUNAN MANUSIA KABUPATEN/KOTA DI INDONESIA MENGGUNAKANMETODE RANDOM FOREST", "abstract": "Keberhasilan suatu negara dapat dilihat dari kondisi masyarakatnya. Suatu negara\r\nperlu mengembangkan masyarakat, yaitu dengan cara pembangunan manusia.\r\nPembangunan manusia terdiri dari tiga komponen dasar yaitu umur panjang dan\r\nsehat; pengetahuan dan kehidupan yang layak. Beberapa indikator yang mewakili\r\nketiga komponen tersebut diringkas menjadi satu nilai tunggal yaitu Indeks\r\nPembangunan Manusia. Oleh karena itu, untuk Random Forest merupakan\r\npengembangan dari metode Classification And Regression Trees (CART) dengan\r\nmenambahkan proses bagging, yang digunakan adalah resampling bootstrap.\r\nMetode ini mampu meningkatkan kestabilan pohon klasifikasi yang terbentuk dan\r\nakurasi prediksi yang dihasilkan. Penelitian ini akan mengklasifikasikan IPM\r\nkabupaten/kota di Indonesia dengan jumlah 514 kabupaten/kota. Variabel respon\r\ndalam penelitian ini adalah indeks pembangunan manusia dan variabel\r\nprediktornya adalah angka harapan hidup, rata-rata lama sekolah, harapan lama\r\nsekolah, dan pengeluaran perkapita yang disesuaikan. Berdasarkan analisis\r\nmenggunakan Random Forest didapatkan hasil bahwa banyaknya pohon yang\r\nterpilih adalah 100 dengan m yang dicobakan adalah 2 dan variabel yang paling\r\nberpengaruh dalam kenaikan Indeks Pembangunan Manusia adalah Pendapatan\r\nPer Kapita dengan nilai kepentingan sebesar 29.48. Ketepatan hasil klasifikasi\r\nyang diukur menggunakan Total Accuracy Rate (1-APER) menghasilkan nilai\r\nakurasi sebesar 93.69%. \r\nKata Kunci: Indeks Pembangunan Manusia, Random Forest, Total Accuracy Rate\r\n(1-APER)."} | 1 | {"work_id": 3134501457, "title": "KLASIFIKASI INDEKS PEMBANGUNAN MANUSIA KABUPATEN/KOTA DI INDONESIA MENGGUNAKANMETODE RANDOM FOREST", "abstract": "Keberhasilan suatu negara dapat dilihat dari kondisi masyarakatnya. Suatu negara\r\nperlu mengembangkan masyarakat, yaitu dengan cara pembangunan manusia.\r\nPembangunan manusia terdiri dari tiga komponen dasar yaitu umur panjang dan\r\nsehat; pengetahuan dan kehidupan yang layak. Beberapa indikator yang mewakili\r\nketiga komponen tersebut diringkas menjadi satu nilai tunggal yaitu Indeks\r\nPembangunan Manusia. Oleh karena itu, untuk Random Forest merupakan\r\npengembangan dari metode Classification And Regression Trees (CART) dengan\r\nmenambahkan proses bagging, yang digunakan adalah resampling bootstrap.\r\nMetode ini mampu meningkatkan kestabilan pohon klasifikasi yang terbentuk dan\r\nakurasi prediksi yang dihasilkan. Penelitian ini akan mengklasifikasikan IPM\r\nkabupaten/kota di Indonesia dengan jumlah 514 kabupaten/kota. Variabel respon\r\ndalam penelitian ini adalah indeks pembangunan manusia dan variabel\r\nprediktornya adalah angka harapan hidup, rata-rata lama sekolah, harapan lama\r\nsekolah, dan pengeluaran perkapita yang disesuaikan. Berdasarkan analisis\r\nmenggunakan Random Forest didapatkan hasil bahwa banyaknya pohon yang\r\nterpilih adalah 100 dengan m yang dicobakan adalah 2 dan variabel yang paling\r\nberpengaruh dalam kenaikan Indeks Pembangunan Manusia adalah Pendapatan\r\nPer Kapita dengan nilai kepentingan sebesar 29.48. Ketepatan hasil klasifikasi\r\nyang diukur menggunakan Total Accuracy Rate (1-APER) menghasilkan nilai\r\nakurasi sebesar 93.69%. \r\nKata Kunci: Indeks Pembangunan Manusia, Random Forest, Total Accuracy Rate\r\n(1-APER)."} | ||
| 2 | {"work_id": 5673758, "title": "A Novel Reconfiguration Scheme in Quantum-Dot Cellular Automata for Energy Efficient Nanocomputing", "abstract": "Quantum-Dot Cellular Automata (QCA) is currently being investigated as an alternative to CMOS technology. There has been extensive study on a wide range of circuits from simple logical circuits such as adders to complex circuits such as 4-bit processors. At the same time, little if any work has been done in considering the possibility of reconfiguration to reduce power in QCA devices. This work presents one of the first such efforts when considering reconfigurable QCA architectures which are expected to be both robust and power efficient. We present a new reconfiguration scheme which is highly robust and is expected to dissipate less power with respect to conventional designs. An adder design based on the reconfiguration scheme will be presented in this thesis, with a detailed power analysis and comparison with existing designs. In order to overcome the problems of routing which comes with reconfigurability, a new wire crossing mechanism is also presented as part of this thesis."} | 2 | {"work_id": 5673758, "title": "A Novel Reconfiguration Scheme in Quantum-Dot Cellular Automata for Energy Efficient Nanocomputing", "abstract": "Quantum-Dot Cellular Automata (QCA) is currently being investigated as an alternative to CMOS technology. There has been extensive study on a wide range of circuits from simple logical circuits such as adders to complex circuits such as 4-bit processors. At the same time, little if any work has been done in considering the possibility of reconfiguration to reduce power in QCA devices. This work presents one of the first such efforts when considering reconfigurable QCA architectures which are expected to be both robust and power efficient. We present a new reconfiguration scheme which is highly robust and is expected to dissipate less power with respect to conventional designs. An adder design based on the reconfiguration scheme will be presented in this thesis, with a detailed power analysis and comparison with existing designs. In order to overcome the problems of routing which comes with reconfigurability, a new wire crossing mechanism is also presented as part of this thesis."} | ||
| 3 | +{"work_id": 75685577, "title": "Electromagnetic Side-Channel Analysis for Hardware and Software Watermarking", "abstract": "With more and more ICs being used in sectors requiring confidentiality and integrity like payment systems, military, finance and health, there is a lot of concern in the security and privacy of ICs. The widespread adoption of Intellectual Property (IP) based designs for modern systems like system on chips has reduced the time to market and saved a lot of money for many companies. But this has also opened the gates for problems like product piracy, IP theft and fraud. It is estimated that billions of dollars are lost annually to illegal manufacturing of Integrated Circuits. A possible solution to this problem of IP theft is to insert small circuits which are like unique IDs that only the owner or the registered verifier will know and detect in case of any conflict. The circuits that are inserted are called watermarks and are in some cases kept very small so as to be hidden. In such cases, we would need detection schemes that work well even with very small watermarks. In this work, we use Electro-Magnetic (EM) based side-channels for the detection of watermarks. Since the 90s, Side-channel Analyses have attracted significant attention within the cryptographic community as they are able to obtain secret information from smart cards and ICs. The power side-channel analysis is a very powerful method but EM side-channels are very useful as they will not need a resistor in series to the power supply and just needs passive observation of the EM radiations emanated by the IC. This passive monitoring will be a big advantage in the case of automated watermark detection used by a verifier.\\nIn this work, we start with EM side-channel analysis on FPGA for smaller designs. We insert watermarks on a Micro-controller, Smartcard and an FPGA and detect these watermarks using EM side-channel information emanated from the Design under Test. We used environments with different levels of noise interference. We compare the watermarking application using EM side-channels and Power side-channels in these different setups. These watermarks are very small and are hard to attack or remove by an attacker through reverse engineering or side-channel information. Due to the robustness against such attacks and the easy access of EM side-channels when compared to power side-channels, the EM side-channel based watermarks will be a very good solution for the IP theft problem. EM side-channel based watermark detection supports automation which companies of IP cores can make use of. We also extended this work to EM Side-channel Trojans as the concepts are similar"} | ||||
| 3 | {"work_id": 3156168805, "title": "Ultra-low vibration closed-cycle cryogenic surface-electrode ion trap apparatus", "abstract": "Trapped ions are one of the leading platforms for building scalable quantum information processors. Current ion traps run on less than 100 qubits. A useful quantum computer needs to operate thousands or even millions of qubits. If systems reach gate fidelities that allow for quantum error correction, gate errors below the physical fidelity can be reached, which is important for scaling. The most promising platform for scaling up ion-based quantum computers are surface electrode traps in connection with the so-called QCCD (Quantum Charge Coupled Device) architecture. In an evolution of the standard (laser-based) approach to quantum logic gates, gates can be performed by applying an oscillating magnetic near-field gradient to the ions. Current fidelities are about one order of magnitude away from reaching the fault tolerant threshold with no fundamental limitations in sight. Scaling QCCDs is impeded by heating rates of the ions as well as vacuum quality. Ions have to be stored for at least as long as it takes for an algorithm to run and subsequent readout. Collisions with background gas and heating can expel ions from the trap. The microwave near-field approach of driving gates benefits from ions that are trapped close to the trap surface. Unfortunately, heating becomes more prominent near the surface. A cryogenic environment reduces the background pressure by several orders of magnitude and the kinetic energy of gas molecules by two orders of magnitude. Heating rates in a cryogenic trap are about two orders of magnitude lower than in a room temperature trap with otherwise equal physical properties. To operate a QCCD processor, it is required to employ phase-stable Raman laser beams. The cryogenic design of the apparatus needs to take into account the resulting requirements for ultra-low vibration amplitudes. This is particularly relevant for closed-cycle cooling systems, which are desirable from an economic point of view compared to liquid cryostats that boil off helium, but which also feature moving mechanical parts that can introduce a serious amount of vibrations. Here, we present a vibration isolated closed cycle Gifford-McMahon cryocooler with record low vibration amplitudes of 29 nm (RMS=7.8 nm) in the vertical and 51 nm (RMS=13.5 nm) in the horizontal direction. It contains a self-sustained inner vacuum chamber that houses the trap. It features 100 DC connections, 10 of which are able to carry up to 1 A of current and 8 high frequency lines. At 5 K, we can apply continuous 3.4 W of microwave power continuously at 1 GHz to the trap electrodes without heating the system. This is about 5.8 times more than state of the art near-field gates require. We also present the laser systems required to for single-shot ablation loading and Doppler cooling of Be ions: a 70 mW 313 nm Dopper cooling laser, a 1064 nm ns-pulse laser for ablation of neutral beryllium atoms and a 235 nm laser for ionizing them. The detection system features an in vacuum imaging system on a cryogenic 3D translation stage that is able to scan and image the complete surface of an ion trap. The light can be detected on a photomultiplier tube or spatially resolved on an EMCCD camera. Our trap features a meander structure for driving gates and can trap up to 5 ions of which we, so far, did not lose any due to background gas collisions. This hints at a vacuum pressure of 1e-12 mbar or lower. The demonstrated system could hold a cryogenic QCCD chip with a few 10 qubits"} | 4 | {"work_id": 3156168805, "title": "Ultra-low vibration closed-cycle cryogenic surface-electrode ion trap apparatus", "abstract": "Trapped ions are one of the leading platforms for building scalable quantum information processors. Current ion traps run on less than 100 qubits. A useful quantum computer needs to operate thousands or even millions of qubits. If systems reach gate fidelities that allow for quantum error correction, gate errors below the physical fidelity can be reached, which is important for scaling. The most promising platform for scaling up ion-based quantum computers are surface electrode traps in connection with the so-called QCCD (Quantum Charge Coupled Device) architecture. In an evolution of the standard (laser-based) approach to quantum logic gates, gates can be performed by applying an oscillating magnetic near-field gradient to the ions. Current fidelities are about one order of magnitude away from reaching the fault tolerant threshold with no fundamental limitations in sight. Scaling QCCDs is impeded by heating rates of the ions as well as vacuum quality. Ions have to be stored for at least as long as it takes for an algorithm to run and subsequent readout. Collisions with background gas and heating can expel ions from the trap. The microwave near-field approach of driving gates benefits from ions that are trapped close to the trap surface. Unfortunately, heating becomes more prominent near the surface. A cryogenic environment reduces the background pressure by several orders of magnitude and the kinetic energy of gas molecules by two orders of magnitude. Heating rates in a cryogenic trap are about two orders of magnitude lower than in a room temperature trap with otherwise equal physical properties. To operate a QCCD processor, it is required to employ phase-stable Raman laser beams. The cryogenic design of the apparatus needs to take into account the resulting requirements for ultra-low vibration amplitudes. This is particularly relevant for closed-cycle cooling systems, which are desirable from an economic point of view compared to liquid cryostats that boil off helium, but which also feature moving mechanical parts that can introduce a serious amount of vibrations. Here, we present a vibration isolated closed cycle Gifford-McMahon cryocooler with record low vibration amplitudes of 29 nm (RMS=7.8 nm) in the vertical and 51 nm (RMS=13.5 nm) in the horizontal direction. It contains a self-sustained inner vacuum chamber that houses the trap. It features 100 DC connections, 10 of which are able to carry up to 1 A of current and 8 high frequency lines. At 5 K, we can apply continuous 3.4 W of microwave power continuously at 1 GHz to the trap electrodes without heating the system. This is about 5.8 times more than state of the art near-field gates require. We also present the laser systems required to for single-shot ablation loading and Doppler cooling of Be ions: a 70 mW 313 nm Dopper cooling laser, a 1064 nm ns-pulse laser for ablation of neutral beryllium atoms and a 235 nm laser for ionizing them. The detection system features an in vacuum imaging system on a cryogenic 3D translation stage that is able to scan and image the complete surface of an ion trap. The light can be detected on a photomultiplier tube or spatially resolved on an EMCCD camera. Our trap features a meander structure for driving gates and can trap up to 5 ions of which we, so far, did not lose any due to background gas collisions. This hints at a vacuum pressure of 1e-12 mbar or lower. The demonstrated system could hold a cryogenic QCCD chip with a few 10 qubits"} | ||
| 4 | {"work_id": 4404401018, "title": "PowerInfer: Fast Large Language Model Serving with a Consumer-grade GPU", "abstract": "This paper introduces PowerInfer, a high-speed Large Language Model (LLM) inference engine on a personal computer (PC) equipped with a single consumer-grade GPU. The key principle underlying the design of PowerInfer is exploiting the high locality inherent in LLM inference, characterized by a power-law distribution in neuron activation. This distribution indicates that a small subset of neurons, termed hot neurons, are consistently activated across inputs, while the majority, cold neurons, vary based on specific inputs. PowerInfer exploits such an insight to design a GPU-CPU hybrid inference engine: hot-activated neurons are preloaded onto the GPU for fast access, while cold-activated neurons are computed on the CPU, thus significantly reducing GPU memory demands and CPU-GPU data transfers. PowerInfer further integrates adaptive predictors and neuron-aware sparse operators, optimizing the efficiency of neuron activation and computational sparsity. The evaluation shows that PowerInfer significantly outperforms llama.cpp by up to 11.69\u00d7 while retaining model accuracy across various LLMs (including OPT-175B) on a single NVIDIA RTX 4090 GPU. For the OPT-30B model, PowerInfer achieves performance comparable to that of a high-end server-grade A100 GPU, reaching 82% of its token generation rate on a single consumer-grade RTX 4090 GPU."} | 5 | {"work_id": 4404401018, "title": "PowerInfer: Fast Large Language Model Serving with a Consumer-grade GPU", "abstract": "This paper introduces PowerInfer, a high-speed Large Language Model (LLM) inference engine on a personal computer (PC) equipped with a single consumer-grade GPU. The key principle underlying the design of PowerInfer is exploiting the high locality inherent in LLM inference, characterized by a power-law distribution in neuron activation. This distribution indicates that a small subset of neurons, termed hot neurons, are consistently activated across inputs, while the majority, cold neurons, vary based on specific inputs. PowerInfer exploits such an insight to design a GPU-CPU hybrid inference engine: hot-activated neurons are preloaded onto the GPU for fast access, while cold-activated neurons are computed on the CPU, thus significantly reducing GPU memory demands and CPU-GPU data transfers. PowerInfer further integrates adaptive predictors and neuron-aware sparse operators, optimizing the efficiency of neuron activation and computational sparsity. The evaluation shows that PowerInfer significantly outperforms llama.cpp by up to 11.69\u00d7 while retaining model accuracy across various LLMs (including OPT-175B) on a single NVIDIA RTX 4090 GPU. For the OPT-30B model, PowerInfer achieves performance comparable to that of a high-end server-grade A100 GPU, reaching 82% of its token generation rate on a single consumer-grade RTX 4090 GPU."} | ||
| 5 | {"work_id": 7128511066, "title": "The impacts of globalization, institutional quality, and digital technology innovation on OECD countries sustainable digital economic growth", "abstract": "This study examines the effects of the digital economy components (digital technology innovation), institutional quality, and globalization on achieving sustainable digital economic growth within the Organization for Economic Cooperation and Development. Using panel data from 2002 to 2020 and applying the Generalized Method of Moments, the cointegration results confirm the presence of cointegration among all variables. The empirical findings reveal that digital technology innovation and institutional quality significantly enhance economic growth, with positive contributions of 0.014% and 0.011%, respectively. Meanwhile, globalization contributes by 0.533%. The study concludes that technological innovation, institutional quality, and globalization played a significant role in the country's economic expansion. The green total factor productivity shows a positive contribution. The Dumitrescu-Hurlin panel causality test results indicate two-way relationships among economic growth (GDP), labor, capital, institutional quality, and globalization. According to this analysis, selected nations can achieve the Sustainable Development Goals by implementing the necessary measures to achieve a balanced approach to sustainability across economics, society, and the environment. This can be accomplished through digital technology innovations, green technologies, and robust institutions. Integrating globalization and digitalization through increased investment in digital infrastructure would enhance access to innovative technologies and connectivity, while additionally improving efficiency."} | 6 | {"work_id": 7128511066, "title": "The impacts of globalization, institutional quality, and digital technology innovation on OECD countries sustainable digital economic growth", "abstract": "This study examines the effects of the digital economy components (digital technology innovation), institutional quality, and globalization on achieving sustainable digital economic growth within the Organization for Economic Cooperation and Development. Using panel data from 2002 to 2020 and applying the Generalized Method of Moments, the cointegration results confirm the presence of cointegration among all variables. The empirical findings reveal that digital technology innovation and institutional quality significantly enhance economic growth, with positive contributions of 0.014% and 0.011%, respectively. Meanwhile, globalization contributes by 0.533%. The study concludes that technological innovation, institutional quality, and globalization played a significant role in the country's economic expansion. The green total factor productivity shows a positive contribution. The Dumitrescu-Hurlin panel causality test results indicate two-way relationships among economic growth (GDP), labor, capital, institutional quality, and globalization. According to this analysis, selected nations can achieve the Sustainable Development Goals by implementing the necessary measures to achieve a balanced approach to sustainability across economics, society, and the environment. This can be accomplished through digital technology innovations, green technologies, and robust institutions. Integrating globalization and digitalization through increased investment in digital infrastructure would enhance access to innovative technologies and connectivity, while additionally improving efficiency."} | ||
| 6 | {"work_id": 4411368489, "title": "Making AI Less 'Thirsty'", "abstract": "Uncovering and addressing the secret water footprint of AI models"} | 7 | {"work_id": 4411368489, "title": "Making AI Less 'Thirsty'", "abstract": "Uncovering and addressing the secret water footprint of AI models"} | ||
| 7 | {"work_id": 2982169647, "title": "Quantum supremacy using a programmable superconducting processor", "abstract": "The promise of quantum computers is that certain computational tasks might be executed exponentially faster on a quantum processor than on a classical processor1. A fundamental challenge is to build a high-fidelity processor capable of running quantum algorithms in an exponentially large computational space. Here we report the use of a processor with programmable superconducting qubits2\u20137 to create quantum states on 53 qubits, corresponding to a computational state-space of dimension 253 (about 1016). Measurements from repeated experiments sample the resulting probability distribution, which we verify using classical simulations. Our Sycamore processor takes about 200 seconds to sample one instance of a quantum circuit a million times\u2014our benchmarks currently indicate that the equivalent task for a state-of-the-art classical supercomputer would take approximately 10,000 years. This dramatic increase in speed compared to all known classical algorithms is an experimental realization of quantum supremacy8\u201314 for this specific computational task, heralding a much-anticipated computing paradigm. Quantum supremacy is demonstrated using a programmable superconducting processor known as Sycamore, taking approximately 200 seconds to sample one instance of a quantum circuit a million times, which would take a state-of-the-art supercomputer around ten thousand years to compute."} | 8 | {"work_id": 2982169647, "title": "Quantum supremacy using a programmable superconducting processor", "abstract": "The promise of quantum computers is that certain computational tasks might be executed exponentially faster on a quantum processor than on a classical processor1. A fundamental challenge is to build a high-fidelity processor capable of running quantum algorithms in an exponentially large computational space. Here we report the use of a processor with programmable superconducting qubits2\u20137 to create quantum states on 53 qubits, corresponding to a computational state-space of dimension 253 (about 1016). Measurements from repeated experiments sample the resulting probability distribution, which we verify using classical simulations. Our Sycamore processor takes about 200 seconds to sample one instance of a quantum circuit a million times\u2014our benchmarks currently indicate that the equivalent task for a state-of-the-art classical supercomputer would take approximately 10,000 years. This dramatic increase in speed compared to all known classical algorithms is an experimental realization of quantum supremacy8\u201314 for this specific computational task, heralding a much-anticipated computing paradigm. Quantum supremacy is demonstrated using a programmable superconducting processor known as Sycamore, taking approximately 200 seconds to sample one instance of a quantum circuit a million times, which would take a state-of-the-art supercomputer around ten thousand years to compute."} | ||
| 8 | {"work_id": 2916516729, "title": "SLM-DB: Single-Level Key-Value Store with Persistent Memory", "abstract": "This paper investigates how to leverage emerging byteaddressable persistent memory (PM) to enhance the performance of key-value (KV) stores. We present a novel KV store, the Single-Level Merge DB (SLM-DB), which takes advantage of both the B+-tree index and the Log-Structured Merge Trees (LSM-tree) approach by making the best use of fast persistent memory. Our proposed SLM-DB achieves high read performance as well as high write performance with low write amplification and near-optimal read amplification. In SLM-DB, we exploit persistent memory to maintain a B+-tree index and adopt an LSM-tree approach to stage inserted KV pairs in a PM resident memory buffer. SLM-DB has a single-level organization of KV pairs on\\ndisks and performs selective compaction for the KV pairs, collecting garbage and keeping the KV pairs sorted sufficiently for range query operations. Our extensive experimental study demonstrates that, in our default setup, compared to LevelDB, SLM-DB provides 1.07 - 1.96 and 1.56 - 2.22 times higher read and write throughput, respectively, as well as comparable range query performance."} | 9 | {"work_id": 2916516729, "title": "SLM-DB: Single-Level Key-Value Store with Persistent Memory", "abstract": "This paper investigates how to leverage emerging byteaddressable persistent memory (PM) to enhance the performance of key-value (KV) stores. We present a novel KV store, the Single-Level Merge DB (SLM-DB), which takes advantage of both the B+-tree index and the Log-Structured Merge Trees (LSM-tree) approach by making the best use of fast persistent memory. Our proposed SLM-DB achieves high read performance as well as high write performance with low write amplification and near-optimal read amplification. In SLM-DB, we exploit persistent memory to maintain a B+-tree index and adopt an LSM-tree approach to stage inserted KV pairs in a PM resident memory buffer. SLM-DB has a single-level organization of KV pairs on\\ndisks and performs selective compaction for the KV pairs, collecting garbage and keeping the KV pairs sorted sufficiently for range query operations. Our extensive experimental study demonstrates that, in our default setup, compared to LevelDB, SLM-DB provides 1.07 - 1.96 and 1.56 - 2.22 times higher read and write throughput, respectively, as well as comparable range query performance."} | ||
| 9 | −{"work_id": 4295093682, "title": "fast16 as a Second-Order Subversion Attack", "abstract": "SentinelOne's April 2026 disclosure of fast16, a precision sabotage framework compiled in August 2005, predates Stuxnet by five years and corrupts floating-point calculations in engineering simulation software via kernel-mode filesystem filtering. The infosec community described the mechanism accurately but did not classify the attack class. This paper applies the nth-order attackframework from Bilar (NATO CCDCOE, 2009) and argues fast16 is a second-order subversion attack: the high-precision research end system is reached through two successive ancillary systems, the OS kernel filesystem stack and the engineering simulation software above it. The wormlet is a delivery mechanism, not a distinct ancillary hop. fast16 is structurally comparable to Thompson's compiler trojan but one order lower and more covert: it operates at runtime below the application layer with no source-level or on-disk trace, defeating the reproducible-build defense that catches Thompson. Stuxnet, dr0wned, and FLAW3D are mapped at the same second order in different substrates, showing the taxonomy holds across software and physical manufacturing pipelines. The classification yields concrete defenses (hardware-rooted driver attestation, diverse independent toolchains across validation hosts, air-gapped reference baselines) that follow from the framework rather than the incident report.Companion to Bilar (2026), \"Volt Typhoon as Operational Realization of the nth-Order Bleeding Thesis\" (Zenodo 19739954)."} | ||||
| 10 | −{"work_id": 4410153295, "title": "Bursting Firings in Memristive Hopfield Neural Network With Image Encryption and Hardware Implementation", "abstract": "By integrating memristors into a Hopfield neural network (HNN), a diverse range of dynamical behavior can be generated, which has significant implications for modeling and biomimetic applications of artificial neurons. However, research on the firing dynamics of HNNs remains relatively limited. In response, a memristive tri-neurons Hopfield neural network (MTN-HNN) was constructed, with the synapse of the second neuron replaced by the proposed memristor. A theoretical and experimental investigation of the dynamics of this neural network was conducted using general analytical tools, such as phase diagrams, Lyapunov exponents, bifurcation diagrams, and others. Experimental results indicate that the dynamics of the MTN-HNN is influenced by the internal parameters of the memristor, enabling the network to extend attractors in up to two directions and thereby form grid multi-scrolls. Notably, the MTN-HNN exhibits various firing modes, including periodic and chaotic bursting. Finally, an encryption scheme was proposed to demonstrate the potential of the MTN-HNN, and both the custom digital circuits and the encryption scheme were successfully implemented on a Field-Programmable Gate Array (FPGA)."} | ||||
| 11 | −{"work_id": 6922095860, "title": "Practical Mechanisms for Reducing Processor\u2013Memory Data Movement in Modern Workloads", "abstract": "Data movement between the memory system and computation units is one of the most critical challenges in designing high performance and energy-efficient computing systems. The high cost of data movement is forcing architects to rethink the fundamental design of computer systems. Recent advances in memory design enable the opportunity for architects to avoid unnecessary datamovement by performing processing-in-memory (PIM), also known as near-data processing (NDP). While PIM can allow many data-intensive applications to avoid moving data from memory to the CPU, it introduces new challenges for system architects and programmers. Our goal in this thesisis to make PIM effective and practical in conventional computing systems. Toward this end, this thesis presents three major directions: (1) examining the suitability of PIM across key workloads, (2) addressing major system challenges for adopting PIM in computing systems, and (3) redesigning applications aware of PIM capability. In line with these three major directions, we propose a seriesof practical mechanisms to reduce processor\u2013memory data movement in modern workloads: First, we comprehensively analyze the energy and performance impact of data movement for several widely-used Google consumer workloads. We find that PIM can significantly reduce datamovement for all of these workloads, by performing part of the computation close to memory. Each workload contains simple primitives and functions that contribute to a significant amount of the overall data movement. We investigate whether these primitives and functions are feasible to implement using PIM, given the limited area and power constraints of consumer devices. Our analysis shows that offloading these primitives to PIM logic, consisting of either simple cores or specialized accelerators, eliminates a large amount of data movement, and significantly reducestotal system energy execution time. Second, we address one of the key system challenges for communication with PIM logic by proposing an efficient cache coherence support for near-data accelerators (NDAs). We find that enforcing coherence with the rest of the system, which is already a major challenge for on-chip accelerators, becomes more difficult for NDAs. This is because (1) the cost of communication between NDAs and CPUs is high, and (2) NDA applications generate a large amount of off-chip datamovement. As a result, as we show in this work, existing coherence mechanisms eliminate most of the benefits of NDAs. Based on our observations, we propose CoNDA, a coherence mechanism that lets an NDA optimistically execute an NDA kernel, under the assumption that the NDA has all necessary coherence permissions. This optimistic execution allows CoNDA to gather information on the memory accesses performed by the NDA and by the rest of the system. CoNDA exploits this information to avoid performing unnecessary coherence requests, and thus, significantly reducesdata movement for coherence. We show that CoNDA significantly improves performance andreduces energy consumption compared to prior coherence mechanisms. Third, we propose a hardware\u2013software co-design approach aware of PIM for edge machinelearning (ML) accelerators to enable energy-efficient and high-performance inference execution. We analyze a commercial Edge TPU (tensor processing unit) using 24 Google edge neural network (NN) models (including CNNs, LSTMs, transducers, and RCNNs), and find that the accelerator suffers from three shortcomings, in terms of computational throughput, energy efficiency, andmemory access handling. We comprehensively study the characteristics of each NN layer in all of the Google edge models, and find that these shortcomings arise from the one-size-fits-all approach of the accelerator, as there is a high amount of heterogeneity in key layer characteristics both across different models and across different layers in the same model. To combat this inefficiency, we propose a new acceleration framework called Mensa. Mensa incorporates multiple heterogeneous ML edge accelerators (including both on-chip and near-data accelerators), each of which caters to the characteristics of a particular subset of models. At runtime, Mensa schedules each layer torun on the best-suited accelerator, accounting for both efficiency and inter-layer dependencies. We show that Mensa significantly improves inference energy and throughput, while reducing hardware cost and improving area efficiency over the Edge TPU and Eyeriss v2, two state-of-the-art edge ML accelerators. Lastly, we propose to redesign emerging modern hybrid databases to be aware of PIM capability, to enable real-time analysis. Hybrid transactional and analytical processing (HTAP) databasesystems can support real-time data analysis without the high costs of synchronizing across separate single-purpose databases. Unfortunately, for many applications that perform a high rate of data updates, state-of-the-art HTAP systems incur significant drops in transactional and/or analyticalthroughput compared to performing only transactions or only analytics in isolation, due to (1) data movement between the CPU and memory, (2) data update propagation, and (3) consistency costs. We propose Polynesia, a hardware\u2013software co-designed system for in-memory HTAP databases. Polynesia (1) divides the HTAP system into transactional and analytical processing islands, (2) implements custom algorithms and hardware to reduce the costs of update propagation and consistency, and (3) exploits processing-in-memory for the analytical islands to alleviate data movement. We show that Polynesia significantly outperforms three state-of-the-art HTAP systems and reduces energy consumption."} | ||||
| 12 | −{"work_id": 4415057924, "title": "Electricity demand and grid impacts of AI data centers: Challenges and prospects", "abstract": "The rapid growth of artificial intelligence (AI) is driving an unprecedented increase in the electricity demand of AI data centers, raising emerging challenges for electric power grids. Understanding the characteristics of AI data center loads and their interactions with the grid is therefore critical for ensuring both reliable power system operation and sustainable AI development. This paper provides a comprehensive review and vision of this evolving landscape. Specifically, this paper (i) presents an overview of AI data center infrastructure and its key components, (ii) examines the key characteristics and patterns of electricity demand across the stages of model preparation, training, fine-tuning, and inference, (iii) analyzes the critical challenges that AI data center loads pose to power systems across three interrelated timescales, including long-term planning and interconnection, short-term operation and electricity markets, and real-time dynamics and stability, and (iv) discusses potential solutions from the perspectives of the grid, AI data centers, and AI end-users to address these challenges. By synthesizing current knowledge and outlining future directions, this review aims to guide research and development in support of the joint advancement of AI data centers and power systems toward reliable, efficient, and sustainable operation."} | ||||
| 13 | −{"work_id": 7131231908, "title": "Reconfigurable Multiscroll Memristive Neural Network With Application to Telemedicine Privacy Protection", "abstract": "Constructing memristive neural networks (MNNs) with multiscroll chaotic attractors helps advance both theoretical and applied research on neural networks. However, the existing models mainly utilize complex memristor models with polynomial functions, nested composite functions, and so on, to generate multiscroll chaotic attractors, which leads to increased model complexity and difficulties in on-demand adjustment. Hence, this article proposes a reconfigurable multiscroll MNN (RMMNN) that can yield different types of multiscroll chaotic attractors merely by altering the memristive parameters without modifying its model. Through numerical methods, the complex dynamics of the RMMNN in different cases are analyzed, such as parameter-controlled multiscroll chaotic attractors, adjustable multistability, and parameter-induced transitions of multistability. In addition, the reliability of the numerical analysis is verified via the hardware circuits. Moreover, to address the issues of image security and low quality in telemedicine, a bidirectional rotation medical image encryption scheme (BRMIES) is developed based on the good pseudorandom chaotic sequences generated by RMMNN. Performance analysis demonstrates that BRMIES can effectively protect medical image and robustly handle various potential adverse interferences within telemedicine process."} | ||||
| 14 | −{"work_id": 4407217670, "title": "vAttention: Dynamic Memory Management for Serving LLMs without PagedAttention", "abstract": "PagedAttention is a popular approach for dynamic memory allocation in LLM serving systems. It enables on-demand allocation of GPU memory to mitigate KV cache fragmentation - a phenomenon that crippled the batch size (and consequently throughput) in prior systems. However, in trying to allocate physical memory at runtime, PagedAttention ends up changing the virtual memory layout of the KV cache from contiguous to non-contiguous. Such a design leads to non-trivial programming and performance overheads."} | ||||
| 15 | −{"work_id": 4407091026, "title": "Screening performance and characteristics of breast cancer detected in the Mammography Screening with Artificial Intelligence trial (MASAI): a randomised, controlled, parallel-group, non-inferiority, single-blinded, screening accuracy study", "abstract": "BACKGROUND: Emerging evidence suggests that artificial intelligence (AI) can increase cancer detection in mammography screening while reducing screen-reading workload, but further understanding of the clinical impact is needed. METHODS: In this randomised, controlled, parallel-group, non-inferiority, single-blinded, screening-accuracy study, done within the Swedish national screening programme, women recruited at four screening sites in southwest Sweden (Malm\u00f6, Lund, Landskrona, and Trelleborg) who were eligible for mammography screening were randomly allocated (1:1) to AI-supported screening or standard double reading. The AI system (Transpara version 1.7.0 ScreenPoint Medical, Nijmegen, Netherlands) was used to triage screening examinations to single or double reading and as detection support highlighting suspicious findings. This is a protocol-defined analysis of the secondary outcome measures of recall, cancer detection, false-positive rates, positive predictive value of recall, type and stage of cancer detected, and screen-reading workload. This trial is registered at ClinicalTrials.gov, NCT04838756 and is closed to accrual. FINDINGS: Between April 12, 2021, and Dec 7, 2022, 105 934 women were randomly assigned to the intervention or control group. 19 women were excluded from the analysis. The median age was 53\u00b77 years (IQR 46\u00b75-63\u00b72). AI-supported screening among 53 043 participants resulted in 338 detected cancers and 1110 recalls. Standard screening among 52 872 participants resulted in 262 detected cancers and 1027 recalls. Cancer-detection rates were 6\u00b74 per 1000 (95% CI 5\u00b77-7\u00b71) screened participants in the intervention group and 5\u00b70 per 1000 (4\u00b74-5\u00b76) in the control group, a ratio of 1\u00b729 (95% CI 1\u00b709-1\u00b751; p=0\u00b70021). AI-supported screening resulted in an increased detection of invasive cancers (270 vs 217, a proportion ratio of 1\u00b724 [95% CI 1\u00b704-1\u00b748]), wich were mainly small lymph-node negative cancers (58 more T1, 46 more lymph-node negative, and 21 more non-luminal A). AI-supported screening also resulted in an increased detection of in situ cancers (68 vs 45, a proportion ratio of 1\u00b751 [1\u00b703-2\u00b719]), with about half of the increased detection being high-grade in situ cancer (12 more nuclear grade III, and no increase in nuclear grade I). The recall and false-positive rate were not significantly higher in the intervention group (a ratio of 1\u00b708 [95% CI 0\u00b799-1\u00b717; p=0\u00b7084] and 1\u00b701 [0\u00b791-1\u00b711; p=0\u00b792], respectively). The positive predictive value of recall was significantly higher in the intervention group compared with the control group, with a ratio of 1\u00b719 (95% CI 1\u00b704-1\u00b737; p=0\u00b7012). There were 61 248 screen readings in the intervention group and 109 692 in the control group, resulting in a 44\u00b72% reduction in the screen-reading workload. INTERPRETATION: The findings suggest that AI contributes to the early detection of clinically relevant breast cancer and reduces screen-reading workload without increasing false positives. FUNDING: Swedish Cancer Society, Confederation of Regional Cancer Centres, and Swedish governmental funding for clinical research."} | ||||
| 16 | −{"work_id": 3107463944, "title": "Quantum computational advantage using photons", "abstract": "A light approach to quantum advantage Quantum computational advantage or supremacy is a long-anticipated milestone toward practical quantum computers. Recent work claimed to have reached this point, but subsequent work managed to speed up the classical simulation and pointed toward a sample size\u2013dependent loophole. Quantum computational advantage, rather than being a one-shot experimental proof, will be the result of a long-term competition between quantum devices and classical simulation. Zhong et al. sent 50 indistinguishable single-mode squeezed states into a 100-mode ultralow-loss interferometer and sampled the output using 100 high-efficiency single-photon detectors. By obtaining up to 76-photon coincidence, yielding a state space dimension of about 10 30 , they measured a sampling rate that is about 10 14 -fold faster than using state-of-the-art classical simulation strategies and supercomputers. Science , this issue p. 1460"} | ||||
| 17 | −{"work_id": 7131624127, "title": "Zentropy-Enhanced Multigranularity Knowledge Modeling for Robust Feature Selection", "abstract": "Multigranularity knowledge modeling is an influential study for information processing and knowledge discovery in artificial intelligence (AI). A central research focus is the multigranularity representation and learning of knowledge structures. Among them, fuzzy rough sets (FRSs) have emerged as a representative method for characterizing uncertain knowledge. However, the existing FRS studies still exhibit two limitations: low robustness in knowledge acquisition and incomplete characterization of uncertainty. Hence, this article proposes a zentropy-enhanced multigranularity knowledge modeling framework for robust feature selection (ZeMG-FS). Specifically, we design a fast and adaptive multigranularity information granulation mechanism based on generalized granular-ball generation to effectively capture data distributions embedded in complex data. Then, the fuzzy rough approximation method is incorporated into the representation of multigranularity knowledge. Furthermore, we analyze the fundamental relationships and structures of the multigranularity knowledge model to introduce a novel multilevel zentropy. Unlike existing entropy measures, the primary consideration of the proposed zentropy is to match and enhance the performance of the proposed model. Finally, we design two feature evaluation criteria grounded in the model and apply them to feature selection. Extensive experiments demonstrate that our proposed methods achieve superior robustness and effectiveness compared with state-of-the-art approaches."} | ||||
| 18 | {"work_id": 4401211704, "title": "Splitwise: Efficient Generative LLM Inference Using Phase Splitting", "abstract": "Generative large language model (LLM) applications are growing rapidly, leading to large-scale deployments of expensive and power-hungry GPUs. Our characterization of LLM inference shows that each inference request undergoes two phases: a compute-intensive prompt computation phase and a memory intensive token generation phase, each with distinct latency, throughput, memory, and power characteristics. Despite state-of-the-art batching and scheduling, the token generation phase underutilizes compute resources. Unlike prompt computation, token generation does not need the compute capability of the latest GPUs and can be run with lower power and cost. Based on these insights, we propose Splitwise, a model deployment and scheduling technique that splits the two phases of LLM inference requests on to separate machines. Splitwise enables phase-specific resource management using hardware that is well suited for each phase. Request state is transferred efficiently between machines using optimized network libraries on the fast back-plane interconnects available in today\u2019s GPU clusters. Using Splitwise, we design homogeneous and heterogeneous LLM inference clusters optimized for throughput, cost, and power Compared to current designs, Splitwise clusters achieve up to $1.4 \\times$ higher throughput at $\\mathbf{2 0 \\%}$ lower cost. Alternatively, they can deliver $2.35 \\times$ more throughput under the same power and cost budgets."} | 10 | {"work_id": 4401211704, "title": "Splitwise: Efficient Generative LLM Inference Using Phase Splitting", "abstract": "Generative large language model (LLM) applications are growing rapidly, leading to large-scale deployments of expensive and power-hungry GPUs. Our characterization of LLM inference shows that each inference request undergoes two phases: a compute-intensive prompt computation phase and a memory intensive token generation phase, each with distinct latency, throughput, memory, and power characteristics. Despite state-of-the-art batching and scheduling, the token generation phase underutilizes compute resources. Unlike prompt computation, token generation does not need the compute capability of the latest GPUs and can be run with lower power and cost. Based on these insights, we propose Splitwise, a model deployment and scheduling technique that splits the two phases of LLM inference requests on to separate machines. Splitwise enables phase-specific resource management using hardware that is well suited for each phase. Request state is transferred efficiently between machines using optimized network libraries on the fast back-plane interconnects available in today\u2019s GPU clusters. Using Splitwise, we design homogeneous and heterogeneous LLM inference clusters optimized for throughput, cost, and power Compared to current designs, Splitwise clusters achieve up to $1.4 \\times$ higher throughput at $\\mathbf{2 0 \\%}$ lower cost. Alternatively, they can deliver $2.35 \\times$ more throughput under the same power and cost budgets."} | ||
| 19 | {"work_id": 3010663313, "title": "FlatStore: An Efficient Log-Structured Key-Value Storage Engine for Persistent Memory", "abstract": "Emerging hardware like persistent memory (PM) and high-speed NICs are promising to build efficient key-value stores. However, we observe that the small-sized access pattern in key-value stores doesn't match with the persistence granularity in PMs, leaving the PM bandwidth underutilized. This paper proposes an efficient PM-based key-value storage engine named FlatStore. Specifically, it decouples the role of a KV store into a persistent log structure for efficient storage and a volatile index for fast indexing. Upon it, FlatStore further incorporates two techniques: 1) compacted log format to maximize the batching opportunity in the log; 2) pipelined horizontal batching to steal log entries from other cores when creating a batch, thus delivering low-latency and high-throughput performance. We implement FlatStore with the volatile index of both a hash table and Masstree. We deploy FlatStore on Optane DC Persistent Memory, and our experiments show that FlatStore achieves up to 35 Mops/s with a single server node, 2.5 - 6.3 times faster than existing systems."} | 11 | {"work_id": 3010663313, "title": "FlatStore: An Efficient Log-Structured Key-Value Storage Engine for Persistent Memory", "abstract": "Emerging hardware like persistent memory (PM) and high-speed NICs are promising to build efficient key-value stores. However, we observe that the small-sized access pattern in key-value stores doesn't match with the persistence granularity in PMs, leaving the PM bandwidth underutilized. This paper proposes an efficient PM-based key-value storage engine named FlatStore. Specifically, it decouples the role of a KV store into a persistent log structure for efficient storage and a volatile index for fast indexing. Upon it, FlatStore further incorporates two techniques: 1) compacted log format to maximize the batching opportunity in the log; 2) pipelined horizontal batching to steal log entries from other cores when creating a batch, thus delivering low-latency and high-throughput performance. We implement FlatStore with the volatile index of both a hash table and Masstree. We deploy FlatStore on Optane DC Persistent Memory, and our experiments show that FlatStore achieves up to 35 Mops/s with a single server node, 2.5 - 6.3 times faster than existing systems."} | ||
| 12 | +{"work_id": 4380874786, "title": "TPU v4: An Optically Reconfigurable Supercomputer for Machine Learning with Hardware Support for Embeddings", "abstract": "In response to innovations in machine learning (ML) models, production workloads changed radically and rapidly. TPU v4 is the fifth Google domain specific architecture (DSA) and its third supercomputer for such ML models. Optical circuit switches (OCSes) dynamically reconfigure its interconnect topology to improve scale, availability, utilization, modularity, deployment, security, power, and performance; users can pick a twisted 3D torus topology if desired. Much cheaper, lower power, and faster than Infiniband, OCSes and underlying optical components are <5% of system cost and <3% of system power. Each TPU v4 includes SparseCores, dataflow processors that accelerate models that rely on embeddings by 5x--7x yet use only 5% of die area and power. Deployed since 2020, TPU v4 outperforms TPU v3 by 2.1x and improves performance/Watt by 2.7x. The TPU v4 supercomputer is 4x larger at 4096 chips and thus nearly 10x faster overall, which along with OCS flexibility and availability allows a large language model to train at an average of ~60% of peak FLOPS/second. For similar sized systems, it is ~4.3x--4.5x faster than the Graphcore IPU Bow and is 1.2x--1.7x faster and uses 1.3x--1.9x less power than the Nvidia A100. TPU v4s inside the energy-optimized warehouse scale computers of Google Cloud use ~2--6x less energy and produce ~20x less CO2e than contemporary DSAs in typical on-premise data centers."} | ||||
| 20 | {"work_id": 3138262672, "title": "SimuBoost: Scalable Parallelization of Functional System Simulation", "abstract": "F\u00fcr das Sammeln detaillierter Laufzeitinformationen, wie Speicherzugriffsmustern, wird in der Betriebssystem- und Sicherheitsforschung h\u00e4ufig auf die funktionale Systemsimulation zur\u00fcckgegriffen. Der Simulator f\u00fchrt dabei die zu untersuchende Arbeitslast in einer virtuellen Maschine (VM) aus, indem er schrittweise Instruktionen interpretiert oder derart \u00fcbersetzt, sodass diese auf dem Zustand der VM arbeiten. Dieser Prozess erm\u00f6glicht es, eine umfangreiche Instrumentierung durchzuf\u00fchren und so an Informationen zum Laufzeitverhalten zu gelangen, die auf einer physischen Maschine nicht zug\u00e4nglich sind. Obwohl die funktionale Systemsimulation als m\u00e4chtiges Werkzeug gilt, stellt die durch die Interpretation oder \u00dcbersetzung resultierende immense Ausf\u00fchrungsverlangsamung eine substanzielle Einschr\u00e4nkung des Verfahrens dar. Im Vergleich zu einer nativen Ausf\u00fchrung messen wir f\u00fcr QEMU eine 30-fache Verlangsamung, wobei die Aufzeichnung von Speicherzugriffen diesen Faktor verdoppelt. Mit Simulatoren, die umfangreichere Instrumentierungsm\u00f6glichkeiten mitbringen als QEMU, kann die Verlangsamung um eine Gr\u00f6\u00dfenordnung h\u00f6her ausfallen. Dies macht die funktionale Simulation f\u00fcr lang laufende, vernetzte oder interaktive Arbeitslasten uninteressant. Dar\u00fcber hinaus erzeugt die Verlangsamung ein unrealistisches Zeitverhalten, sobald Aktivit\u00e4ten au\u00dferhalb der VM (z. B. Ein-/Ausgabe) involviert sind. In dieser Arbeit stellen wir SimuBoost vor, eine Methode zur drastischen Beschleunigung funktionaler Systemsimulation. SimuBoost f\u00fchrt die zu untersuchende Arbeitslast zun\u00e4chst in einer schnellen hardwaregest\u00fctzten virtuellen Maschine aus. Dies erm\u00f6glicht volle Interaktivit\u00e4t mit Benutzern und Netzwerkger\u00e4ten. W\u00e4hrend der Ausf\u00fchrung erstellt SimuBoost periodisch Abbilder der VM (engl. Checkpoints). Diese dienen als Ausgangspunkt f\u00fcr eine parallele Simulation, bei der jedes Intervall unabh\u00e4ngig simuliert und analysiert wird. Eine heterogene deterministische Wiederholung (engl. heterogeneous deterministic Replay) garantiert, dass in dieser Phase die vorherige hardwaregest\u00fctzte Ausf\u00fchrung jedes Intervalls exakt reproduziert wird, einschlie\u00dflich Interaktionen und realistischem Zeitverhalten. Unser Prototyp ist in der Lage, die Laufzeit einer funktionalen Systemsimulation deutlich zu reduzieren. W\u00e4hrend mit herk\u00f6mmlichen Verfahren f\u00fcr die Simulation des Bauprozesses eines modernen Linux \u00fcber 5 Stunden ben\u00f6tigt werden, schlie\u00dft SimuBoost die Simulation in nur 15 Minuten ab. Dies sind lediglich 16% mehr Zeit, als der Bau in einer schnellen hardwaregest\u00fctzten VM in Anspruch nimmt. SimuBoost ist imstande, diese Geschwindigkeit auch bei voller Instrumentierung zur Aufzeichnung von Speicherzugriffen beizubehalten. Die vorliegende Arbeit ist das erste Projekt, welches das Konzept der Partitionierung und Parallelisierung der Ausf\u00fchrungszeit auf die interaktive Systemvirtualisierung in einer Weise anwendet, die eine sofortige parallele funktionale Simulation gestattet. Wir erg\u00e4nzen die praktische Umsetzung mit einem mathematischen Modell zur formalen Beschreibung der Beschleunigungseigenschaften. Dies erlaubt es, f\u00fcr ein gegebenes Szenario die voraussichtliche parallele Simulationszeit zu prognostizieren und gibt eine Orientierung zur Wahl der optimalen Intervalll\u00e4nge. Im Gegensatz zu bisherigen Arbeiten legt SimuBoost einen starken Fokus auf die Skalierbarkeit \u00fcber die Grenzen eines einzelnen physischen Systems hinaus. Ein zentraler Schl\u00fcssel hierzu ist der Einsatz moderner Checkpointing-Technologien. Im Rahmen dieser Arbeit pr\u00e4sentieren wir zwei neuartige Methoden zur effizienten und effektiven Kompression von periodischen Systemabbildern."} | 13 | {"work_id": 3138262672, "title": "SimuBoost: Scalable Parallelization of Functional System Simulation", "abstract": "F\u00fcr das Sammeln detaillierter Laufzeitinformationen, wie Speicherzugriffsmustern, wird in der Betriebssystem- und Sicherheitsforschung h\u00e4ufig auf die funktionale Systemsimulation zur\u00fcckgegriffen. Der Simulator f\u00fchrt dabei die zu untersuchende Arbeitslast in einer virtuellen Maschine (VM) aus, indem er schrittweise Instruktionen interpretiert oder derart \u00fcbersetzt, sodass diese auf dem Zustand der VM arbeiten. Dieser Prozess erm\u00f6glicht es, eine umfangreiche Instrumentierung durchzuf\u00fchren und so an Informationen zum Laufzeitverhalten zu gelangen, die auf einer physischen Maschine nicht zug\u00e4nglich sind. Obwohl die funktionale Systemsimulation als m\u00e4chtiges Werkzeug gilt, stellt die durch die Interpretation oder \u00dcbersetzung resultierende immense Ausf\u00fchrungsverlangsamung eine substanzielle Einschr\u00e4nkung des Verfahrens dar. Im Vergleich zu einer nativen Ausf\u00fchrung messen wir f\u00fcr QEMU eine 30-fache Verlangsamung, wobei die Aufzeichnung von Speicherzugriffen diesen Faktor verdoppelt. Mit Simulatoren, die umfangreichere Instrumentierungsm\u00f6glichkeiten mitbringen als QEMU, kann die Verlangsamung um eine Gr\u00f6\u00dfenordnung h\u00f6her ausfallen. Dies macht die funktionale Simulation f\u00fcr lang laufende, vernetzte oder interaktive Arbeitslasten uninteressant. Dar\u00fcber hinaus erzeugt die Verlangsamung ein unrealistisches Zeitverhalten, sobald Aktivit\u00e4ten au\u00dferhalb der VM (z. B. Ein-/Ausgabe) involviert sind. In dieser Arbeit stellen wir SimuBoost vor, eine Methode zur drastischen Beschleunigung funktionaler Systemsimulation. SimuBoost f\u00fchrt die zu untersuchende Arbeitslast zun\u00e4chst in einer schnellen hardwaregest\u00fctzten virtuellen Maschine aus. Dies erm\u00f6glicht volle Interaktivit\u00e4t mit Benutzern und Netzwerkger\u00e4ten. W\u00e4hrend der Ausf\u00fchrung erstellt SimuBoost periodisch Abbilder der VM (engl. Checkpoints). Diese dienen als Ausgangspunkt f\u00fcr eine parallele Simulation, bei der jedes Intervall unabh\u00e4ngig simuliert und analysiert wird. Eine heterogene deterministische Wiederholung (engl. heterogeneous deterministic Replay) garantiert, dass in dieser Phase die vorherige hardwaregest\u00fctzte Ausf\u00fchrung jedes Intervalls exakt reproduziert wird, einschlie\u00dflich Interaktionen und realistischem Zeitverhalten. Unser Prototyp ist in der Lage, die Laufzeit einer funktionalen Systemsimulation deutlich zu reduzieren. W\u00e4hrend mit herk\u00f6mmlichen Verfahren f\u00fcr die Simulation des Bauprozesses eines modernen Linux \u00fcber 5 Stunden ben\u00f6tigt werden, schlie\u00dft SimuBoost die Simulation in nur 15 Minuten ab. Dies sind lediglich 16% mehr Zeit, als der Bau in einer schnellen hardwaregest\u00fctzten VM in Anspruch nimmt. SimuBoost ist imstande, diese Geschwindigkeit auch bei voller Instrumentierung zur Aufzeichnung von Speicherzugriffen beizubehalten. Die vorliegende Arbeit ist das erste Projekt, welches das Konzept der Partitionierung und Parallelisierung der Ausf\u00fchrungszeit auf die interaktive Systemvirtualisierung in einer Weise anwendet, die eine sofortige parallele funktionale Simulation gestattet. Wir erg\u00e4nzen die praktische Umsetzung mit einem mathematischen Modell zur formalen Beschreibung der Beschleunigungseigenschaften. Dies erlaubt es, f\u00fcr ein gegebenes Szenario die voraussichtliche parallele Simulationszeit zu prognostizieren und gibt eine Orientierung zur Wahl der optimalen Intervalll\u00e4nge. Im Gegensatz zu bisherigen Arbeiten legt SimuBoost einen starken Fokus auf die Skalierbarkeit \u00fcber die Grenzen eines einzelnen physischen Systems hinaus. Ein zentraler Schl\u00fcssel hierzu ist der Einsatz moderner Checkpointing-Technologien. Im Rahmen dieser Arbeit pr\u00e4sentieren wir zwei neuartige Methoden zur effizienten und effektiven Kompression von periodischen Systemabbildern."} | ||
| 21 | {"work_id": 7129692983, "title": "Spatio-Temporal Coordinated Operation Strategy of Data Centers Considering Virtual Storage System via Two-Stage Distributionally Robust Optimization", "abstract": "Energy consumption in data centers is growing rapidly in recent years. To realize the economic and flexible operation of data centers, this paper proposes a spatio-temporal coordinated operation strategy of data centers considering virtual storage system (VSS) via two-stage distributionally robust optimization. First, based on the dynamic thermal network of buildings and differentiated demands of cloud users in data centers, a comprehensive operation model with VSS is proposed. Then, considering uncertainties of general load demands from data centers and outdoor temperatures, a fuzzy set is deduced, using an imprecise Dirichlet model derived from historical data. This ensures confidence level satisfaction for uncertain sets of general load and outdoor temperatures. In addition, the spatio-temporal coordinated operation strategy of data centers considering virtual storage system via two-stage distributionally robust optimization that flexibly adjusts conservativeness through uncertainty regulation parameters. Finally, a Dynamic Accuracy Column and Constraint Generation (DA-C&CG) algorithm is developed for solving the proposed strategy. The results indicate that the proposed strategy can effectively enhance operational economics, computing efficiency and resilience by leveraging flexibility in cooling and cloud user loads within suitable server temperatures. Meanwhile, the DA-C&CG algorithm exhibits excellent solution performance."} | 14 | {"work_id": 7129692983, "title": "Spatio-Temporal Coordinated Operation Strategy of Data Centers Considering Virtual Storage System via Two-Stage Distributionally Robust Optimization", "abstract": "Energy consumption in data centers is growing rapidly in recent years. To realize the economic and flexible operation of data centers, this paper proposes a spatio-temporal coordinated operation strategy of data centers considering virtual storage system (VSS) via two-stage distributionally robust optimization. First, based on the dynamic thermal network of buildings and differentiated demands of cloud users in data centers, a comprehensive operation model with VSS is proposed. Then, considering uncertainties of general load demands from data centers and outdoor temperatures, a fuzzy set is deduced, using an imprecise Dirichlet model derived from historical data. This ensures confidence level satisfaction for uncertain sets of general load and outdoor temperatures. In addition, the spatio-temporal coordinated operation strategy of data centers considering virtual storage system via two-stage distributionally robust optimization that flexibly adjusts conservativeness through uncertainty regulation parameters. Finally, a Dynamic Accuracy Column and Constraint Generation (DA-C&CG) algorithm is developed for solving the proposed strategy. The results indicate that the proposed strategy can effectively enhance operational economics, computing efficiency and resilience by leveraging flexibility in cooling and cloud user loads within suitable server temperatures. Meanwhile, the DA-C&CG algorithm exhibits excellent solution performance."} | ||
| 22 | {"work_id": 4294786246, "title": "Time-optimal holonomic quantum computation", "abstract": "A three-level system can be used in a \u039b-type configuration in order to construct auniversal set of non-adiabatic quantum gates through the use of non-Abelian non-adiabatic geometrical phases. Such construction allows for high-speed operation times which diminish the effects of decoherence. This might be, however, accompanied by a breakdown of the validity of the rotating wave approximation (RWA) due to the comparable timescale between the counter-rotating terms and the pulse length, which greatly affects the dynamics. Here we investigate the trade-off between dissipative effects and the RWA validity, obtaining the optimal regime for the operation of the holonomic quantum gates."} | 15 | {"work_id": 4294786246, "title": "Time-optimal holonomic quantum computation", "abstract": "A three-level system can be used in a \u039b-type configuration in order to construct auniversal set of non-adiabatic quantum gates through the use of non-Abelian non-adiabatic geometrical phases. Such construction allows for high-speed operation times which diminish the effects of decoherence. This might be, however, accompanied by a breakdown of the validity of the rotating wave approximation (RWA) due to the comparable timescale between the counter-rotating terms and the pulse length, which greatly affects the dynamics. Here we investigate the trade-off between dissipative effects and the RWA validity, obtaining the optimal regime for the operation of the holonomic quantum gates."} | ||
| 23 | {"work_id": 4394944658, "title": "Orion: Interference-aware, Fine-grained GPU Sharing for ML Applications", "abstract": "GPUs are critical for maximizing the throughput-per-Watt of deep neural network (DNN) applications. However, DNN applications often underutilize GPUs, even when using large batch sizes and eliminating input data processing or communication stalls. DNN workloads consist of data-dependent operators, with different compute and memory requirements. While an operator may saturate GPU compute units or memory bandwidth, it often leaves other GPU resources idle. Despite the prevalence of GPU sharing techniques, current approaches are not sufficiently fine-grained or interference-aware to maximize GPU utilization while minimizing interference at the granularity of 10s of \u03bcs. We propose Orion, a system that transparently intercepts GPU kernel launches from multiple clients sharing a GPU. Orion schedules work on the GPU at the granularity of individual operators and minimizes interference by taking into account each operator's compute and memory requirements. We integrate Orion in PyTorch and demonstrate its benefits in various DNN workload collocation use cases. Orion significantly improves tail latency compared to state-of-the-art baselines for a high-priority inference job while collocating best-effort inference jobs to increase per-GPU request throughput by up to 7.3\u00d7, or while collocating DNN training, saving up to 1.49\u00d7 in training costs compared to dedicated GPU allocation."} | 16 | {"work_id": 4394944658, "title": "Orion: Interference-aware, Fine-grained GPU Sharing for ML Applications", "abstract": "GPUs are critical for maximizing the throughput-per-Watt of deep neural network (DNN) applications. However, DNN applications often underutilize GPUs, even when using large batch sizes and eliminating input data processing or communication stalls. DNN workloads consist of data-dependent operators, with different compute and memory requirements. While an operator may saturate GPU compute units or memory bandwidth, it often leaves other GPU resources idle. Despite the prevalence of GPU sharing techniques, current approaches are not sufficiently fine-grained or interference-aware to maximize GPU utilization while minimizing interference at the granularity of 10s of \u03bcs. We propose Orion, a system that transparently intercepts GPU kernel launches from multiple clients sharing a GPU. Orion schedules work on the GPU at the granularity of individual operators and minimizes interference by taking into account each operator's compute and memory requirements. We integrate Orion in PyTorch and demonstrate its benefits in various DNN workload collocation use cases. Orion significantly improves tail latency compared to state-of-the-art baselines for a high-priority inference job while collocating best-effort inference jobs to increase per-GPU request throughput by up to 7.3\u00d7, or while collocating DNN training, saving up to 1.49\u00d7 in training costs compared to dedicated GPU allocation."} | ||
| 24 | −{"work_id": 3021475380, "title": "Keystone", "abstract": "Trusted execution environments (TEEs) see rising use in devices from embedded sensors to cloud servers and encompass a range of cost, power constraints, and security threat model choices. On the other hand, each of the current vendor-specific TEEs makes a fixed set of trade-offs with little room for customization. We present Keystone---the first open-source framework for building customized TEEs. Keystone uses simple abstractions provided by the hardware such as memory isolation and a programmable layer underneath untrusted components (e.g., OS). We build reusable TEE core primitives from these abstractions while allowing platform-specific modifications and flexible feature choices. We showcase how Keystone-based TEEs run on unmodified RISC-V hardware and demonstrate the strengths of our design in terms of security, TCB size, execution of a range of benchmarks, applications, kernels, and deployment models."} | ||||
| 25 | −{"work_id": 3014555390, "title": "CacheFlow: Using Maximum Flow to Bound Cache-Based Preemption Delays", "abstract": "Cache-related preemption delay (CRPD) analysis bounds the additional execution time caused by cache evictions during preemptions. Tightly bounding CRPDs is challenging as there are many possible preemption patterns that can occur at runtime, and thus there has been continuous work over three decades to refine these bounds. This paper presents CacheFlow, a framework that formulates total CRPD as a maximum-flow problem. In the flow network, nodes and edge capacities can be constructed to model certain eviction patterns that can occur. Therefore, by (safely) removing nodes or edges, or reducing edge capacities, tighter CRPD bounds can be derived. This is demonstrated with different CacheFlow refinements, some of which include insights from prior analyses, as well as a refinement for simply periodic systems. An iterative max-flow formulation is also described to more efficiently integrate the max-flow solving in the context of standard fixed-priority response-time analysis. Experiments on synthetic task systems demonstrate significant schedulability improvements across a range of system configurations, while also having reasonable solving times."} | ||||
| 26 | −{"work_id": 3012028616, "title": "Catalyzer", "abstract": "Serverless computing promises cost-efficiency and elasticity for high-productive software development. To achieve this, the serverless sandbox system must address two challenges: strong isolation between function instances, and low startup latency to ensure user experience. While strong isolation can be provided by virtualization-based sandboxes, the initialization of sandbox and application causes non-negligible startup overhead. Conventional sandbox systems fall short in low-latency startup due to their application-agnostic nature: they can only reduce the latency of sandbox initialization through hypervisor and guest kernel customization, which is inadequate and does not mitigate the majority of startup overhead."} | ||||
| 27 | {"work_id": 4295682935, "title": "CodaLab Competitions An Open Source Platform to Organize Scientific Challenges", "abstract": "CodaLab Competitions is an open source web platform designed to help data scientists and research teams to crowd-source the resolution of machine learning problems through the organization of competitions, also called challenges or contests. CodaLab Competitions provides useful features such as multiple phases, results and code submissions, multi-score leaderboards, and jobs running inside Docker containers. The platform is very flexible and can handle large scale experiments, by allowing organizers to upload large datasets and provide their own CPU or GPU compute workers."} | 17 | {"work_id": 4295682935, "title": "CodaLab Competitions An Open Source Platform to Organize Scientific Challenges", "abstract": "CodaLab Competitions is an open source web platform designed to help data scientists and research teams to crowd-source the resolution of machine learning problems through the organization of competitions, also called challenges or contests. CodaLab Competitions provides useful features such as multiple phases, results and code submissions, multi-score leaderboards, and jobs running inside Docker containers. The platform is very flexible and can handle large scale experiments, by allowing organizers to upload large datasets and provide their own CPU or GPU compute workers."} | ||
| 18 | +{"work_id": 4407091026, "title": "Screening performance and characteristics of breast cancer detected in the Mammography Screening with Artificial Intelligence trial (MASAI): a randomised, controlled, parallel-group, non-inferiority, single-blinded, screening accuracy study", "abstract": "BACKGROUND: Emerging evidence suggests that artificial intelligence (AI) can increase cancer detection in mammography screening while reducing screen-reading workload, but further understanding of the clinical impact is needed. METHODS: In this randomised, controlled, parallel-group, non-inferiority, single-blinded, screening-accuracy study, done within the Swedish national screening programme, women recruited at four screening sites in southwest Sweden (Malm\u00f6, Lund, Landskrona, and Trelleborg) who were eligible for mammography screening were randomly allocated (1:1) to AI-supported screening or standard double reading. The AI system (Transpara version 1.7.0 ScreenPoint Medical, Nijmegen, Netherlands) was used to triage screening examinations to single or double reading and as detection support highlighting suspicious findings. This is a protocol-defined analysis of the secondary outcome measures of recall, cancer detection, false-positive rates, positive predictive value of recall, type and stage of cancer detected, and screen-reading workload. This trial is registered at ClinicalTrials.gov, NCT04838756 and is closed to accrual. FINDINGS: Between April 12, 2021, and Dec 7, 2022, 105 934 women were randomly assigned to the intervention or control group. 19 women were excluded from the analysis. The median age was 53\u00b77 years (IQR 46\u00b75-63\u00b72). AI-supported screening among 53 043 participants resulted in 338 detected cancers and 1110 recalls. Standard screening among 52 872 participants resulted in 262 detected cancers and 1027 recalls. Cancer-detection rates were 6\u00b74 per 1000 (95% CI 5\u00b77-7\u00b71) screened participants in the intervention group and 5\u00b70 per 1000 (4\u00b74-5\u00b76) in the control group, a ratio of 1\u00b729 (95% CI 1\u00b709-1\u00b751; p=0\u00b70021). AI-supported screening resulted in an increased detection of invasive cancers (270 vs 217, a proportion ratio of 1\u00b724 [95% CI 1\u00b704-1\u00b748]), wich were mainly small lymph-node negative cancers (58 more T1, 46 more lymph-node negative, and 21 more non-luminal A). AI-supported screening also resulted in an increased detection of in situ cancers (68 vs 45, a proportion ratio of 1\u00b751 [1\u00b703-2\u00b719]), with about half of the increased detection being high-grade in situ cancer (12 more nuclear grade III, and no increase in nuclear grade I). The recall and false-positive rate were not significantly higher in the intervention group (a ratio of 1\u00b708 [95% CI 0\u00b799-1\u00b717; p=0\u00b7084] and 1\u00b701 [0\u00b791-1\u00b711; p=0\u00b792], respectively). The positive predictive value of recall was significantly higher in the intervention group compared with the control group, with a ratio of 1\u00b719 (95% CI 1\u00b704-1\u00b737; p=0\u00b7012). There were 61 248 screen readings in the intervention group and 109 692 in the control group, resulting in a 44\u00b72% reduction in the screen-reading workload. INTERPRETATION: The findings suggest that AI contributes to the early detection of clinically relevant breast cancer and reduces screen-reading workload without increasing false positives. FUNDING: Swedish Cancer Society, Confederation of Regional Cancer Centres, and Swedish governmental funding for clinical research."} | ||||
| 19 | +{"work_id": 3037032032, "title": "Energy and Policy Considerations for Modern Deep Learning Research", "abstract": "The field of artificial intelligence has experienced a dramatic methodological shift towards large neural networks trained on plentiful data. This shift has been fueled by recent advances in hardware and techniques enabling remarkable levels of computation, resulting in impressive advances in AI across many applications. However, the massive computation required to obtain these exciting results is costly both financially, due to the price of specialized hardware and electricity or cloud compute time, and to the environment, as a result of non-renewable energy used to fuel modern tensor processing hardware. In a paper published this year at ACL, we brought this issue to the attention of NLP researchers by quantifying the approximate financial and environmental costs of training and tuning neural network models for NLP (Strubell, Ganesh, and McCallum 2019). In this extended abstract, we briefly summarize our findings in NLP, incorporating updated estimates and broader information from recent related publications, and provide actionable recommendations to reduce costs and improve equity in the machine learning and artificial intelligence community."} | ||||
| 20 | +{"work_id": 3107463944, "title": "Quantum computational advantage using photons", "abstract": "A light approach to quantum advantage Quantum computational advantage or supremacy is a long-anticipated milestone toward practical quantum computers. Recent work claimed to have reached this point, but subsequent work managed to speed up the classical simulation and pointed toward a sample size\u2013dependent loophole. Quantum computational advantage, rather than being a one-shot experimental proof, will be the result of a long-term competition between quantum devices and classical simulation. Zhong et al. sent 50 indistinguishable single-mode squeezed states into a 100-mode ultralow-loss interferometer and sampled the output using 100 high-efficiency single-photon detectors. By obtaining up to 76-photon coincidence, yielding a state space dimension of about 10 30 , they measured a sampling rate that is about 10 14 -fold faster than using state-of-the-art classical simulation strategies and supercomputers. Science , this issue p. 1460"} | ||||
| 28 | {"work_id": 1868882999, "title": "Formal verification techniques using quantum process calculus", "abstract": "Quantum communication is a rapidly growing area of research and development. While the successful construction of a large-scale quantum computer may be some years away, there are already commercial implementations of secure communication using quantum cryptography. The application of formal methods to classical communication and cryptographic systems has been very successful, and is now widely used in industry by organisations such as Intel, Microsoft and NASA. There is reason to believe that similar benefits can be expected for the verification of quantum systems. In this thesis, we focus on the use of process calculus, specifically Communicating Quantum Processes (CQP), for the analysis of quantum protocols. Congruence relations are an important aspect of process calculus, since they provide the foundation for equational reasoning. Previous work on congruence relations for quantum processes excluded the classical information arising from measurements, and was therefore unable to analyse many of the interesting known quantum communication protocols. Developing a congruence relation for general quantum processes is difficult because of the interaction between measurement, entanglement and parallel composition. We define a labelled transition relation for CQP in order to describe external interactions. Based on this semantics, we define a notion of observational equivalence for CQP processes, namely probabilistic branching bisimilarity. We find that this relation is not preserved by parallel composition, however we are able to gain a deeper understanding of the link between probabilistic branching and measurement. Based on this newfound understanding, we present a novel semantics for quantum processes, combining mixed quantum states with probabilistic branching. With respect to this new semantic model, we define full probabilistic branching bisimilarity and prove that it is a congruence. We use this congruence relation to discuss an axiomatic approach to the verification of quantum processes. The quantum teleportation protocol is used as a primary example throughout, and we prove that it is congruent to a quantum channel. We define a translation from CQP to the Quantum Model Checker (QMC) in order to provide automated verification techniques using CQP specifications. We prove that this translation preserves the semantics of CQP processes, thereby enabling a multifaceted approach to formal verification by enhancing the manual techniques of process calculus with the benefits of model checking."} | 21 | {"work_id": 1868882999, "title": "Formal verification techniques using quantum process calculus", "abstract": "Quantum communication is a rapidly growing area of research and development. While the successful construction of a large-scale quantum computer may be some years away, there are already commercial implementations of secure communication using quantum cryptography. The application of formal methods to classical communication and cryptographic systems has been very successful, and is now widely used in industry by organisations such as Intel, Microsoft and NASA. There is reason to believe that similar benefits can be expected for the verification of quantum systems. In this thesis, we focus on the use of process calculus, specifically Communicating Quantum Processes (CQP), for the analysis of quantum protocols. Congruence relations are an important aspect of process calculus, since they provide the foundation for equational reasoning. Previous work on congruence relations for quantum processes excluded the classical information arising from measurements, and was therefore unable to analyse many of the interesting known quantum communication protocols. Developing a congruence relation for general quantum processes is difficult because of the interaction between measurement, entanglement and parallel composition. We define a labelled transition relation for CQP in order to describe external interactions. Based on this semantics, we define a notion of observational equivalence for CQP processes, namely probabilistic branching bisimilarity. We find that this relation is not preserved by parallel composition, however we are able to gain a deeper understanding of the link between probabilistic branching and measurement. Based on this newfound understanding, we present a novel semantics for quantum processes, combining mixed quantum states with probabilistic branching. With respect to this new semantic model, we define full probabilistic branching bisimilarity and prove that it is a congruence. We use this congruence relation to discuss an axiomatic approach to the verification of quantum processes. The quantum teleportation protocol is used as a primary example throughout, and we prove that it is congruent to a quantum channel. We define a translation from CQP to the Quantum Model Checker (QMC) in order to provide automated verification techniques using CQP specifications. We prove that this translation preserves the semantics of CQP processes, thereby enabling a multifaceted approach to formal verification by enhancing the manual techniques of process calculus with the benefits of model checking."} | ||
| 22 | +{"work_id": 2931743911, "title": "Machine Learning at Facebook: Understanding Inference at the Edge", "abstract": "At Facebook, machine learning provides a wide range of capabilities that drive many aspects of user experience including ranking posts, content understanding, object detection and tracking for augmented and virtual reality, speech and text translations. While machine learning models are currently trained on customized data-center infrastructure, Facebook is working to bring machine learning inference to the edge. By doing so, user experience is improved with reduced latency (inference time) and becomes less dependent on network connectivity. Furthermore, this also enables many more applications of deep learning with important features only made available at the edge. This paper takes a data-driven approach to present the opportunities and design challenges faced by Facebook in order to enable machine learning inference locally on smart phones and other edge platforms."} | ||||
| 23 | +{"work_id": 4210305137, "title": "Photonic matrix multiplication lights up photonic accelerator and beyond", "abstract": "Matrix computation, as a fundamental building block of information processing in science and technology, contributes most of the computational overheads in modern signal processing and artificial intelligence algorithms. Photonic accelerators are designed to accelerate specific categories of computing in the optical domain, especially matrix multiplication, to address the growing demand for computing resources and capacity. Photonic matrix multiplication has much potential to expand the domain of telecommunication, and artificial intelligence benefiting from its superior performance. Recent research in photonic matrix multiplication has flourished and may provide opportunities to develop applications that are unachievable at present by conventional electronic processors. In this review, we first introduce the methods of photonic matrix multiplication, mainly including the plane light conversion method, Mach-Zehnder interferometer method and wavelength division multiplexing method. We also summarize the developmental milestones of photonic matrix multiplication and the related applications. Then, we review their detailed advances in applications to optical signal processing and artificial neural networks in recent years. Finally, we comment on the challenges and perspectives of photonic matrix multiplication and photonic acceleration."} | ||||
| 29 | {"work_id": 4393145114, "title": "AI and Memory Wall", "abstract": "The availability of unprecedented unsupervised training data, along with neural scaling laws, has resulted in an unprecedented surge in model size and compute requirements for serving/training LLMs. However, the main performance bottleneck is increasingly shifting to memory bandwidth. Over the past 20 years, peak server hardware FLOPS has been scaling at 3.0\u00d7/2yrs, outpacing the growth of DRAM and interconnect bandwidth, which have only scaled at 1.6 and 1.4 times every 2 years, respectively. This disparity has made memory, rather than compute, the primary bottleneck in AI applications, particularly in serving. Here, we analyze encoder and decoder Transformer models and show how memory bandwidth can become the dominant bottleneck for decoder models. We argue for a redesign in model architecture, training, and deployment strategies to overcome this memory limitation."} | 24 | {"work_id": 4393145114, "title": "AI and Memory Wall", "abstract": "The availability of unprecedented unsupervised training data, along with neural scaling laws, has resulted in an unprecedented surge in model size and compute requirements for serving/training LLMs. However, the main performance bottleneck is increasingly shifting to memory bandwidth. Over the past 20 years, peak server hardware FLOPS has been scaling at 3.0\u00d7/2yrs, outpacing the growth of DRAM and interconnect bandwidth, which have only scaled at 1.6 and 1.4 times every 2 years, respectively. This disparity has made memory, rather than compute, the primary bottleneck in AI applications, particularly in serving. Here, we analyze encoder and decoder Transformer models and show how memory bandwidth can become the dominant bottleneck for decoder models. We argue for a redesign in model architecture, training, and deployment strategies to overcome this memory limitation."} | ||
| 30 | −{"work_id": 3023238978, "title": "Autopilot", "abstract": "In many public and private Cloud systems, users need to specify a limit for the amount of resources (CPU cores and RAM) to provision for their workloads. A job that exceeds its limits might be throttled or killed, resulting in delaying or dropping end-user requests, so human operators naturally err on the side of caution and request a larger limit than the job needs. At scale, this results in massive aggregate resource wastage."} | 25 | +{"work_id": 3173899054, "title": "Strong Quantum Computational Advantage Using a Superconducting Quantum Processor", "abstract": "Scaling up to a large number of qubits with high-precision control is essential in the demonstrations of quantum computational advantage to exponentially outpace the classical hardware and algorithmic improvements. Here, we develop a two-dimensional programmable superconducting quantum processor, Zuchongzhi, which is composed of 66 functional qubits in a tunable coupling architecture. To characterize the performance of the whole system, we perform random quantum circuits sampling for benchmarking, up to a system size of 56 qubits and 20 cycles. The computational cost of the classical simulation of this task is estimated to be 2-3 orders of magnitude higher than the previous work on 53-qubit Sycamore processor [Nature 574, 505 (2019)NATUAS0028-083610.1038/s41586-019-1666-5. We estimate that the sampling task finished by Zuchongzhi in about 1.2 h will take the most powerful supercomputer at least 8 yr. Our work establishes an unambiguous quantum computational advantage that is infeasible for classical computation in a reasonable amount of time. The high-precision and programmable quantum computing platform opens a new door to explore novel many-body phenomena and implement complex quantum algorithms."} | ||
| 31 | −{"work_id": 7160873310, "title": "Enhancing the Performance Prediction of Quantum Computing Algorithms using Gradient Boosting and Ada Boost Regression", "abstract": "Quantum computing is considered to have tremendous potential to help take the emerging field of \"Computational Law\" to the next level of growth in terms of the expression and implementation of legal principles. With the promise of quantum technology's increasing influence on the legal industry in mind, this essay utilizes the emerging field of Computational Complexity Theory to explore the types of problems that quantum computing is capable of solving more efficiently than classical computing, which is referred to as Quantum Supremacy. From this foundation, three emerging areas within the legal sector have been identified where quantum computing is likely to show transformative superiority. While it is unknown how quantum technology will ultimately integrate into the legal world, this essay argues that its use in the future is contingent upon the establishment of a creative vision of possibilities Key words: Quantum Computing, Quantum Mechanics, Qubits, Data Analytics, Computational Intelligence, Superposition, Entanglement, Quantum Algorithms, Quantum Supremacy, Quantum Cryptography."} | 26 | +{"work_id": 3092732687, "title": "PENGEMBANGAN SISTEM INFORMASI PENERIMAANMAHASISWA BARU DENGAN METODE BUSINESSPROCESS AUTOMATION (STUDI KASUS: INSTITUTTEKNOLOGI KALIMANTAN)", "abstract": "Institut Teknologi Kalimantan (ITK) merupakan salah satu perguruan tinggi negeri baru di Indonesia. Salah satu proses bisnis yang ada di ITK yaitu proses\r\npenerimaan mahasiswa baru, ITK sudah melakukan proses penerimaan mahasiswa baru sejak tahun 2012 sebanyak 100 mahasiswa, dan pada tahun 2018 ITK menerima kurang lebih 1000 mahasiswa. Hal ini menunjukkan adanya peningkatan penerimaan mahasiswa baru yang cukup signifikan. Pada proses penerimaan mahasiswa baru di ITK belum ada sistem informasi yangdapat memanajemen data\r\nmahasiswa baru tersebut dan saat ini terdapat proses pengumpulan dan verifikasi\r\nberkas yang masih dilakukan menggunakan email dimana terdapat beberapa kendala dalam penggunaan email tersebut. Oleh karena itu, dalam penelitian ini\r\ndilakukan pengembangkan sistem informasi penerimaan mahasiswa baru berbasis web, yang dapat diakses oleh mahasiswa baru, verifikatur, dan admin selama proses\r\npendaftaran ulang mahasiswa baru. Metode yang digunakan dalam penelitian ini adalah Business Proses Automation menggunakan tools ProcessMaker. ProcessMaker merupakan sebuah aplikasi open source yang berguna untuk memanajemen alur kerja Business Process Management (BPM) dan solusi perangkat lunak berbasis web. Penelitian ini menghasilkan sistem informasi penerimaan mahasiswa baru berbasis web, yang dapat memanajemen datamahasiswa baru. Terdapat 14 proses pendaftaran ulang mahasiswa baru dan rekapdata yang dibedakan untuk masing-masing program studi di ITK, kemudian ada 1 proses untuk menjalankan fungsi impor data users menggunakan file .csv. Sistem\r\ninformasi ini sudah mulai digunakan ITK dalam proses penerimaan mahasiswa baru\r\njalur Seleksi Nasional Masuk Perguruan Tinggi Negeri (SNMPTN) Tahun 2019."} | ||
| 27 | +{"work_id": 25727798, "title": "The Lustre Storage Architecture", "abstract": "This lengthy document often referred to as the \"Lustre Book\", contains a detailed outline of Lustre file system architecture, as it was created between 2001 and 2005, in accordance with the requirements from various users. Now, in 2019, most features have been implemented, but some only recently, and some along different lines of thought."} | ||||
| 28 | +{"work_id": 2972087877, "title": "Demystifying Parallel and Distributed Deep Learning", "abstract": "Deep Neural Networks (DNNs) are becoming an important tool in modern computing applications. Accelerating their training is a major challenge and techniques range from distributed algorithms to low-level circuit design. In this survey, we describe the problem from a theoretical perspective, followed by approaches for its parallelization. We present trends in DNN architectures and the resulting implications on parallelization strategies. We then review and model the different types of concurrency in DNNs: from the single operator, through parallelism in network inference and training, to distributed deep learning. We discuss asynchronous stochastic optimization, distributed system architectures, communication schemes, and neural architecture search. Based on those approaches, we extrapolate potential directions for parallelism in deep learning."} | ||||
| 29 | +{"work_id": 4407158326, "title": "Distributed quantum computing across an optical network link", "abstract": "Abstract Distributed quantum computing (DQC) combines the computing power of multiple networked quantum processing modules, ideally enabling the execution of large quantum circuits without compromising performance or qubit connectivity 1,2 . Photonic networks are well suited as a versatile and reconfigurable interconnect layer for DQC; remote entanglement shared between matter qubits across the network enables all-to-all logical connectivity through quantum gate teleportation (QGT) 3,4 . For a scalable DQC architecture, the QGT implementation must be deterministic and repeatable; until now, no demonstration has satisfied these requirements. Here we experimentally demonstrate the distribution of quantum computations between two photonically interconnected trapped-ion modules. The modules, separated by about two metres, each contain dedicated network and circuit qubits. By using heralded remote entanglement between the network qubits, we deterministically teleport a controlled-Z (CZ) gate between two circuit qubits in separate modules, achieving 86% fidelity. We then execute Grover\u2019s search algorithm 5 \u2014to our knowledge, the first implementation of a distributed quantum algorithm comprising several non-local two-qubit gates\u2014and measure a 71% success rate. Furthermore, we implement distributed iSWAP and SWAP circuits, compiled with two and three instances of QGT, respectively, demonstrating the ability to distribute arbitrary two-qubit operations 6 . As photons can be interfaced with a variety of systems, the versatile DQC architecture demonstrated here provides a viable pathway towards large-scale quantum computing for a range of physical platforms."} | ||||
| 30 | +{"work_id": 3152809665, "title": "Nightcore: efficient and scalable serverless computing for latency-sensitive, interactive microservices", "abstract": "The microservice architecture is a popular software engineering approach for building flexible, large-scale online services. Serverless functions, or function as a service (FaaS), provide a simple programming model of stateless functions which are a natural substrate for implementing the stateless RPC handlers of microservices, as an alternative to containerized RPC servers. However, current serverless platforms have millisecond-scale runtime overheads, making them unable to meet the strict sub-millisecond latency targets required by existing interactive microservices."} | ||||
| 31 | +{"work_id": 4399913870, "title": "A review of green artificial intelligence: Towards a more sustainable future", "abstract": "Green artificial intelligence (AI) is more environmentally friendly and inclusive than conventional AI, as it not only produces accurate results without increasing the computational cost but also ensures that any researcher with a laptop can perform high-quality research without the need for costly cloud servers. This paper discusses green AI as a pivotal approach to enhancing the environmental sustainability of AI systems. Described are AI solutions for eco-friendly practices in other fields (green-by AI), strategies for designing energy-efficient machine learning (ML) algorithms and models (green-in AI), and tools for accurately measuring and optimizing energy consumption. Also examined are the role of regulations in promoting green AI and future directions for sustainable ML. Underscored is the importance of aligning AI practices with environmental considerations, fostering a more eco-conscious and energy-efficient future for AI systems."} | ||||
| 32 | +{"work_id": 4409363528, "title": "Intelligent nanophotonics: when machine learning sheds light", "abstract": "Abstract The synergistic development of nanophotonics and machine learning has inspired tremendous innovations in both fields in the past decade. In diverse photonics research, deep-learning methods using artificial neural networks become the key game changer that greatly facilitates rapid nanophotonics design and the versatile processing of optical information. Moreover, optical computing platforms that perform calculations through light propagation are receiving tremendous interest as next-generation machine-learning hardware with advantages in computing speed, energy efficiency, and parallelism. This review summarizes the current state-of-the-art nanophotonic devices enabled by machine learning and analyzes the longstanding challenges that must be overcome to make an impact on technology. We also discuss the opportunities of intelligent photonics in applications such as computational imaging/sensing and machine vision. The intersection of nanophotonics with deep learning holds tremendous implications for transformative technologies ranging from internet of things to smart health. Lastly, we provide our perspective on the pressing challenges in intelligent photonics that must be tackled to advance this field to the next level and the vast opportunities for multidisciplinary collaboration."} | ||||
| 33 | +{"work_id": 4386978266, "title": "Accelerated Systems for Portable DNA Sequencing", "abstract": "The MinION is a revolutionary handheld DNA sequencer that is inexpensive, portable, and can perform real-time sequencing. MinION is increasingly used in Precision Medicine applications. However, the MinION lacks portable compute power. This thesis introduces two clinical applications of the MinION and identifies and solves performance bottlenecks through hardware and software solutions to enable portable microbial diagnostics. Finally, we discuss how our accelerated solutions will fit on a laptop with a GPU. More than 99% of DNA fragments in a typical human sample are non-target (human), which may be skipped in real-time using the MinION\u2019s Read Until feature. We analyze the performance of the Read Until pipeline in detecting target microbial species for targeted viral pathogen detection and microbiome abundance estimation. We find new sources of performance bottlenecks (basecaller in the classification of a fragment) that are not addressed by past genomics accelerators. While SquiggleFilter and DTWax are our solutions for targeted viral pathogen detection, RawMap is for untargeted microbiome analysis. We also discuss accelerating the bottleneck step in the DNA mapping software (Minimap2) used in all of MinION\u2019s sequencing workflows. For targeted virus detection, we discuss SquiggleFilter which is a portable and programmable hardware-software solution that directly analyzes MinION\u2019s raw squiggles and filters everything except target viral DNA fragments. SquiggleFilter avoids the expensive basecalling step and uses hardware-accelerated subsequence Dynamic Time Warping (sDTW). We show that our 14.3W 13.25mm2 accelerator has 274\u00d7 greater throughput and 3481\u00d7 lower latency than existing GPU-based solutions while consuming half the power. DTWax overcomes the on-chip memory limitations of SquiggleFilter by optimizing its high-accuracy sDTW algorithm for GPUs resulting in a \u223c1.92X sequencing speedup and \u223c3.64X compute speedup: costup. For the untargeted classification and analysis of microbiome, we discuss RawMap which is a machine-learning-based smart and efficient solution that reduces sequencing time and cost by \u223c24% and computing cost by \u223c22%. We also discuss how RawMap may be used as an alternative to the RT-PCR test for viral load quantification of SARS-CoV-2. Minimap2 is a software used in all MinION workflows. minimap2-accelerated (mm2-ax) is a heterogeneous design for sequence mapping where minimap2\u2019s bottleneck step is sped up on the GPU with bit-exact output. mm2-ax on an NVIDIA A100 GPU improves the bottleneck step (chaining) with 4.07 - 1.93X speedup: costup over a SIMD baseline. Finally, we envision a portable solution to microbial diagnostics with a laptop connected to the MinION. DTWax can perform targeted virus detection on the GPU and RawMap does untargeted microbiome classification on the CPU. Post-sequencing tasks like basecalling, alignment (using mm2-ax) and variant calling use the GPU."} | ||||
| 34 | +{"work_id": 2950805899, "title": "A quantum engineer's guide to superconducting qubits", "abstract": "The aim of this review is to provide quantum engineers with an introductory guide to the central concepts and challenges in the rapidly accelerating field of superconducting quantum circuits. Over the past twenty years, the field has matured from a predominantly basic research endeavor to a one that increasingly explores the engineering of larger-scale superconducting quantum systems. Here, we review several foundational elements\u2014qubit design, noise properties, qubit control, and readout techniques\u2014developed during this period, bridging fundamental concepts in circuit quantum electrodynamics and contemporary, state-of-the-art applications in gate-model quantum computation."} | ||||
| 35 | +{"work_id": 2273211146, "title": "The multiprocessor real-time scheduling of general task systems", "abstract": "The recent emergence of multicore and related technologies in many commercial systems has increased the prevalence of multiprocessor architectures. Contemporaneously, real-time applications have become more complex and sophisticated in their behavior and interaction. Inevitably, these complex real-time applications will be deployed upon these multiprocessor platforms and require temporal analysis techniques to verify their correctness. However, most prior research in multiprocessor real-time scheduling has addressed the temporal analysis only of Liu and Layland task systems. The goal of this dissertation is to extend real-time scheduling theory for multiprocessor systems by developing temporal analysis techniques for more general task models such as the sporadic task model, the generalized multiframe task model, and the recurring real-time task model. The thesis of this dissertation is: Optimal online multiprocessor real-time scheduling algorithms for sporadic and more general task systems are impossible; however, efficient, online scheduling algorithms and associated feasibility and schedulability tests, with provably bounded deviation from any optimal test, exist. To support our thesis, this dissertation develops feasibility and schedulability tests for various multiprocessor scheduling paradigms. We consider three classes of multiprocessor scheduling based on whether a real-time job may migrate between processors: full-migration, restricted-migration, and partitioned. For all general task systems, we obtain feasibility tests for arbitrary real-time instances under the full-and restricted-migration paradigms. Despite the existence of tests for feasibility, we show that optimal online scheduling of sporadic and more general systems is impossible. Therefore, we focus on scheduling algorithms that have constant-factor approximation ratios in terms of an analysis technique known as resource augmentation. We develop schedulability tests for scheduling algorithms, earliest-deadline-first (edf) and deadline-monotonic (dm), under full-migration and partitioned scheduling paradigms. Feasibility and schedulability tests presented in this dissertation use the workload metrics of demand-based load and maximum job density and have provably bounded deviation from optimal in terms of resource augmentation. We show the demand-based load and maximum job density metrics may be exactly computed in pseudo-polynomial time for general task systems and approximated in polynomial time for sporadic task systems."} | ||||
| 36 | +{"work_id": 4385215131, "title": "QLC Programmable 3D Ferroelectric NAND Flash Memory by Memory Window Expansion using Cell Stack Engineering", "abstract": "3D ferroelectric NAND (Fe-NAND) Quad-level cell (QLC) operation has been demonstrated for the first time to our knowledge, using the 3D CTN NAND test vehicle for mass production. The 3D Fe-NAND is optimized by engineering the cell stack layers, enlarging a program/erase (PE) window up to 10.5 V. QLC operation is successfully verified with the minimum gap margin of 0.24 V. Endurance and data retention characteristics are also reported."} | ||||
| 37 | +{"work_id": 3174122836, "title": "Quantum Computing 40 Years Later", "abstract": "This chapter sketches the foundations of the subject, discussing salient features of quantum information, formulates a mathematical model of quantum computation and highlights some implications of the model. It reviews two particularly promising applications of quantum computing foreseen by Feynman, simulating the dynamics of complex quantum systems, and computing their static properties. The chapter explains the concept of quantum error correction, the basis of belief that quantum computers can be scaled up to large systems that solve very hard problems. Shor&s;s discovery, and its obvious implications for cryptanalysis, caused interest in quantum computing to skyrocket. Because of Shor&s;s algorithm, the public key cryptographic protocols the people use to protect privacy when they communicate over the Internet will become vulnerable to attacks by quantum computers in the future. Classical computers are especially bad at simulating quantum dynamics \u2013 that is, predicting how a highly entangled quantum state will change with time."} | ||||
| 38 | +{"work_id": 4407592994, "title": "Green Federated Learning: A New Era of Green Aware AI", "abstract": "The development of AI applications, especially in large-scale wireless networks, is growing exponentially, alongside the size and complexity of the architectures used. Particularly, machine learning is acknowledged as one of today\u2019s most energy-intensive computational applications, posing a significant challenge to the environmental sustainability of next-generation intelligent systems. Achieving environmental sustainability entails ensuring that every AI algorithm is designed with sustainability in mind, integrating green considerations from the architectural phase onwards. Recently, Federated Learning (FL), with its distributed nature, presents new opportunities to address this need. Hence, it is imperative to elucidate the potential and challenges stemming from recent FL advancements and their implications for sustainability. Moreover, it is crucial to furnish researchers, stakeholders, and interested parties with a roadmap to navigate and understand existing efforts and gaps in green-aware AI algorithms. This survey primarily aims to achieve this objective by identifying and analyzing over a hundred FL works and assessing their contributions to green-aware artificial intelligence for sustainable environments, with a specific focus on IoT research. It delves into current issues in green federated learning from an energy-efficient standpoint, discussing potential challenges and future prospects for green IoT application research."} | ||||
| 39 | +{"work_id": 4406650295, "title": "AWQ: Activation-aware Weight Quantization for On-Device LLM Compression and Acceleration", "abstract": "Large language models (LLMs) have transformed numerous AI applications. On-device LLM is becoming increasingly important: running LLMs locally on edge devices can reduce cloud computing costs and protect users' privacy. However, the astronomical model size and the limited hardware resources pose significant deployment challenges. To solve these issues, we propose Activation-aware Weight Quantization (AWQ) and TinyChat, an algorithm-system full-stack solution for efficient on-device LLM deployment. AWQ is a novel quantization method that identifies and protects salient weights based on activation distribution, significantly reducing model size while preserving performance. TinyChat, an optimized inference framework, translates AWQ's theoretical memory savings into practical speedups through techniques such as on-the-fly dequantization, SIMD-aware weight packing, and kernel fusion. Together, they enable 4x model size reduction and 3-4x acceleration across various edge platforms, from high-end desktop GPUs to resource-constrained IoT devices. This solution democratizes on-device LLM deployment, offering privacy-preserving, low-latency AI capabilities across a wide range of applications."} | ||||
| 40 | +{"work_id": 4213212652, "title": "Noisy intermediate-scale quantum algorithms", "abstract": "Noisy quantum computers can in principle perform reliable quantum computations, but truly scalable systems require noise levels lower than are presently achieved. Still, moderate-complexity computations can be performed. This review discusses what is possible in this ``noisy intermediate scale'' quantum (NISQ) era. Topic areas include the simulation of many-body physics and chemistry, combinatorial optimization, and machine learning. It is evident that the NISQ era has produced new paradigms for programming that will be built upon as quantum computers are further perfected."} | ||||
| 41 | +{"work_id": 2975712713, "title": "A generic communication scheduler for distributed DNN training acceleration", "abstract": "We present ByteScheduler, a generic communication scheduler for distributed DNN training acceleration. ByteScheduler is based on our principled analysis that partitioning and rearranging the tensor transmissions can result in optimal results in theory and good performance in real-world even with scheduling overhead. To make ByteScheduler work generally for various DNN training frameworks, we introduce a unified abstraction and a Dependency Proxy mechanism to enable communication scheduling without breaking the original dependencies in framework engines. We further introduce a Bayesian Optimization approach to auto-tune tensor partition size and other parameters for different training models under various networking conditions. ByteScheduler now supports TensorFlow, PyTorch, and MXNet without modifying their source code, and works well with both Parameter Server (PS) and all-reduce architectures for gradient synchronization, using either TCP or RDMA. Our experiments show that ByteScheduler accelerates training with all experimented system configurations and DNN models, by up to 196% (or 2.96X of original speed)."} | ||||
| 42 | +{"work_id": 2930508541, "title": "Cloud Programming Simplified: A Berkeley View on Serverless Computing", "abstract": "Serverless cloud computing handles virtually all the system administration operations needed to make it easier for programmers to use the cloud. It provides an interface that greatly simplifies cloud programming, and represents an evolution that parallels the transition from assembly language to high-level programming languages. This paper gives a quick history of cloud computing, including an accounting of the predictions of the 2009 Berkeley View of Cloud Computing paper, explains the motivation for serverless computing, describes applications that stretch the current limits of serverless, and then lists obstacles and research opportunities required for serverless computing to fulfill its full potential. Just as the 2009 paper identified challenges for the cloud and predicted they would be addressed and that cloud use would accelerate, we predict these issues are solvable and that serverless computing will grow to dominate the future of cloud computing."} | ||||
| 43 | +{"work_id": 3016932526, "title": "Q uantum ESPRESSO toward the exascale", "abstract": "Quantum ESPRESSO is an open-source distribution of computer codes for quantum-mechanical materials modeling, based on density-functional theory, pseudopotentials, and plane waves, and renowned for its performance on a wide range of hardware architectures, from laptops to massively parallel computers, as well as for the breadth of its applications. In this paper, we present a motivation and brief review of the ongoing effort to port Quantum ESPRESSO onto heterogeneous architectures based on hardware accelerators, which will overcome the energy constraints that are currently hindering the way toward exascale computing."} | ||||
| 44 | +{"work_id": 4402694963, "title": "Optical neural networks: progress and challenges", "abstract": "Artificial intelligence has prevailed in all trades and professions due to the assistance of big data resources, advanced algorithms, and high-performance electronic hardware. However, conventional computing hardware is inefficient at implementing complex tasks, in large part because the memory and processor in its computing architecture are separated, performing insufficiently in computing speed and energy consumption. In recent years, optical neural networks (ONNs) have made a range of research progress in optical computing due to advantages such as sub-nanosecond latency, low heat dissipation, and high parallelism. ONNs are in prospect to provide support regarding computing speed and energy consumption for the further development of artificial intelligence with a novel computing paradigm. Herein, we first introduce the design method and principle of ONNs based on various optical elements. Then, we successively review the non-integrated ONNs consisting of volume optical components and the integrated ONNs composed of on-chip components. Finally, we summarize and discuss the computational density, nonlinearity, scalability, and practical applications of ONNs, and comment on the challenges and perspectives of the ONNs in the future development trends."} | ||||
| 32 | {"work_id": 4287393709, "title": "Uncertainty-Aware Resource Allocation for Multi-Path Programs with In-Kernel Predictions", "abstract": "Predictable timing on multicore systems requires careful management of shared resources such as the last-level cache and memory bandwidth. This paper presents MPORA, an uncertainty-aware dynamic resource allocation framework for multi-path, input-dependent real-time tasks on multicore platforms. MPORA models each job as a discrete-time dynamical system that captures execution dynamics and resource-dependent performance indicators. At runtime, MPORA monitors job execution states and predicts short-term instruction rates and remaining execution times under candidate allocations using predictive models trained offline. It then solves a receding-horizon optimization problem to compute resource allocations that maximize system-wide progress while meeting job deadlines. To address prediction uncertainty, MPORA integrates weighted conformal prediction into the optimization formulation, enabling uncertainty-aware deadline constraints. We implement MPORA as a Linux kernel module with microsecond-scale inference overhead. Experimental results on SPEC CPU benchmarks show that MPORA delivers accurate predictions under unseen inputs and distribution shifts with low overhead, while improving schedulability and response times over existing methods."} | 45 | {"work_id": 4287393709, "title": "Uncertainty-Aware Resource Allocation for Multi-Path Programs with In-Kernel Predictions", "abstract": "Predictable timing on multicore systems requires careful management of shared resources such as the last-level cache and memory bandwidth. This paper presents MPORA, an uncertainty-aware dynamic resource allocation framework for multi-path, input-dependent real-time tasks on multicore platforms. MPORA models each job as a discrete-time dynamical system that captures execution dynamics and resource-dependent performance indicators. At runtime, MPORA monitors job execution states and predicts short-term instruction rates and remaining execution times under candidate allocations using predictive models trained offline. It then solves a receding-horizon optimization problem to compute resource allocations that maximize system-wide progress while meeting job deadlines. To address prediction uncertainty, MPORA integrates weighted conformal prediction into the optimization formulation, enabling uncertainty-aware deadline constraints. We implement MPORA as a Linux kernel module with microsecond-scale inference overhead. Experimental results on SPEC CPU benchmarks show that MPORA delivers accurate predictions under unseen inputs and distribution shifts with low overhead, while improving schedulability and response times over existing methods."} | ||
| 33 | −{"work_id": 4417057079, "title": "Single-shot matrix-matrix photonic processor based on spatial-spectral hypermultiplexed parallel diffraction", "abstract": "Abstract The ever-increasing data demand craves advancements in high-speed and energy-efficient computing hardware. Analog optical neural network (ONN) processors have emerged as a promising solution, offering benefits in bandwidth and energy consumption. However, existing ONN processors exhibit limited computational parallelism, and while certain architectures achieve high parallelism, they encounter serious scaling roadblocks for large-scale implementation. This restricts the throughput, latency, and energy efficiency advantages of ONN processors. Here, we introduce a spatial-wavelength-temporal hyper-multiplexed ONN processor that supports high data dimensionality, high computing parallelism and is feasible for large-scale implementation, and in a single time step, a three-dimensional matrix-matrix multiplication (MMM) optical tensor processor is demonstrated. Our hardware accelerates convolutional neural networks (CNNs) and deep neural networks (DNNs) through parallel matrix multiplication. We demonstrate benchmark image recognition using a CNN and a subsequently fully connected DNN in the optical domain. The network works with 292,616 weight parameters under ultra-low optical energy of \u2248 20 attojoules (aJ) per multiply and accumulate (MAC) at 96.4% classification accuracy. The system supports broad spectral and spatial bandwidths and is capable for large-scale demonstration, paving the way for highly efficient large-scale optical computing for next-generation deep learning."} | ||||
| 34 | {"work_id": 4321610982, "title": "Suppressing quantum errors by scaling a surface code logical qubit", "abstract": "Abstract Practical quantum computing will require error rates well below those achievable with physical qubits. Quantum error correction 1,2 offers a path to algorithmically relevant error rates by encoding logical qubits within many physical qubits, for which increasing the number of physical qubits enhances protection against physical errors. However, introducing more qubits also increases the number of error sources, so the density of errors must be sufficiently low for logical performance to improve with increasing code size. Here we report the measurement of logical qubit performance scaling across several code sizes, and demonstrate that our system of superconducting qubits has sufficient performance to overcome the additional errors from increasing qubit number. We find that our distance-5 surface code logical qubit modestly outperforms an ensemble of distance-3 logical qubits on average, in terms of both logical error probability over 25 cycles and logical error per cycle ((2.914 \u00b1 0.016)% compared to (3.028 \u00b1 0.023)%). To investigate damaging, low-probability error sources, we run a distance-25 repetition code and observe a 1.7 \u00d7 10 \u22126 logical error per cycle floor set by a single high-energy event (1.6 \u00d7 10 \u22127 excluding this event). We accurately model our experiment, extracting error budgets that highlight the biggest challenges for future systems. These results mark an experimental demonstration in which quantum error correction begins to improve performance with increasing qubit number, illuminating the path to reaching the logical error rates required for computation."} | 46 | {"work_id": 4321610982, "title": "Suppressing quantum errors by scaling a surface code logical qubit", "abstract": "Abstract Practical quantum computing will require error rates well below those achievable with physical qubits. Quantum error correction 1,2 offers a path to algorithmically relevant error rates by encoding logical qubits within many physical qubits, for which increasing the number of physical qubits enhances protection against physical errors. However, introducing more qubits also increases the number of error sources, so the density of errors must be sufficiently low for logical performance to improve with increasing code size. Here we report the measurement of logical qubit performance scaling across several code sizes, and demonstrate that our system of superconducting qubits has sufficient performance to overcome the additional errors from increasing qubit number. We find that our distance-5 surface code logical qubit modestly outperforms an ensemble of distance-3 logical qubits on average, in terms of both logical error probability over 25 cycles and logical error per cycle ((2.914 \u00b1 0.016)% compared to (3.028 \u00b1 0.023)%). To investigate damaging, low-probability error sources, we run a distance-25 repetition code and observe a 1.7 \u00d7 10 \u22126 logical error per cycle floor set by a single high-energy event (1.6 \u00d7 10 \u22127 excluding this event). We accurately model our experiment, extracting error budgets that highlight the biggest challenges for future systems. These results mark an experimental demonstration in which quantum error correction begins to improve performance with increasing qubit number, illuminating the path to reaching the logical error rates required for computation."} | ||
| 35 | {"work_id": 3156891177, "title": "Carbon Emissions and Large Neural Network Training", "abstract": "The computation demand for machine learning (ML) has grown rapidly recently, which comes with a number of costs. Estimating the energy cost helps measure its environmental impact and finding greener strategies, yet it is challenging without detailed information. We calculate the energy use and carbon footprint of several recent large models-T5, Meena, GShard, Switch Transformer, and GPT-3-and refine earlier estimates for the neural architecture search that found Evolved Transformer. We highlight the following opportunities to improve energy efficiency and CO2 equivalent emissions (CO2e): Large but sparsely activated DNNs can consume <1/10th the energy of large, dense DNNs without sacrificing accuracy despite using as many or even more parameters. Geographic location matters for ML workload scheduling since the fraction of carbon-free energy and resulting CO2e vary ~5X-10X, even within the same country and the same organization. We are now optimizing where and when large models are trained. Specific datacenter infrastructure matters, as Cloud datacenters can be ~1.4-2X more energy efficient than typical datacenters, and the ML-oriented accelerators inside them can be ~2-5X more effective than off-the-shelf systems. Remarkably, the choice of DNN, datacenter, and processor can reduce the carbon footprint up to ~100-1000X. These large factors also make retroactive estimates of energy cost difficult. To avoid miscalculations, we believe ML papers requiring large computational resources should make energy consumption and CO2e explicit when practical. We are working to be more transparent about energy use and CO2e in our future research. To help reduce the carbon footprint of ML, we believe energy usage and CO2e should be a key metric in evaluating models, and we are collaborating with MLPerf developers to include energy usage during training and inference in this industry standard benchmark."} | 47 | {"work_id": 3156891177, "title": "Carbon Emissions and Large Neural Network Training", "abstract": "The computation demand for machine learning (ML) has grown rapidly recently, which comes with a number of costs. Estimating the energy cost helps measure its environmental impact and finding greener strategies, yet it is challenging without detailed information. We calculate the energy use and carbon footprint of several recent large models-T5, Meena, GShard, Switch Transformer, and GPT-3-and refine earlier estimates for the neural architecture search that found Evolved Transformer. We highlight the following opportunities to improve energy efficiency and CO2 equivalent emissions (CO2e): Large but sparsely activated DNNs can consume <1/10th the energy of large, dense DNNs without sacrificing accuracy despite using as many or even more parameters. Geographic location matters for ML workload scheduling since the fraction of carbon-free energy and resulting CO2e vary ~5X-10X, even within the same country and the same organization. We are now optimizing where and when large models are trained. Specific datacenter infrastructure matters, as Cloud datacenters can be ~1.4-2X more energy efficient than typical datacenters, and the ML-oriented accelerators inside them can be ~2-5X more effective than off-the-shelf systems. Remarkably, the choice of DNN, datacenter, and processor can reduce the carbon footprint up to ~100-1000X. These large factors also make retroactive estimates of energy cost difficult. To avoid miscalculations, we believe ML papers requiring large computational resources should make energy consumption and CO2e explicit when practical. We are working to be more transparent about energy use and CO2e in our future research. To help reduce the carbon footprint of ML, we believe energy usage and CO2e should be a key metric in evaluating models, and we are collaborating with MLPerf developers to include energy usage during training and inference in this industry standard benchmark."} | ||
| 36 | {"work_id": 4384697207, "title": "Methods and Techniques for Inter-cloud Data Transfers", "abstract": "This thesis focuses on methods and techniques for transferring data from a compute cloud to a storage cloud by using a buffer at the compute cloud.A space driven, a time driven, and a hybrid buffering technique are discussed.It was found that using buffering at the compute cloud is only beneficial when the load on the system is high.To improve performance a threshold-based and a machine learning based adaptive method are introduced at the buffer to dynamically change between buffering techniques at runtime based on the load on the system state.Using the adaptive methods leads to a significant improvement in performance.A proof-of-concept prototype was built for the different data transfer methods and techniques researched.Experiments performed on the prototype provide insights into system behaviour and performance."} | 48 | {"work_id": 4384697207, "title": "Methods and Techniques for Inter-cloud Data Transfers", "abstract": "This thesis focuses on methods and techniques for transferring data from a compute cloud to a storage cloud by using a buffer at the compute cloud.A space driven, a time driven, and a hybrid buffering technique are discussed.It was found that using buffering at the compute cloud is only beneficial when the load on the system is high.To improve performance a threshold-based and a machine learning based adaptive method are introduced at the buffer to dynamically change between buffering techniques at runtime based on the load on the system state.Using the adaptive methods leads to a significant improvement in performance.A proof-of-concept prototype was built for the different data transfer methods and techniques researched.Experiments performed on the prototype provide insights into system behaviour and performance."} | ||
| 37 | {"work_id": 2783525259, "title": "Loihi: A Neuromorphic Manycore Processor with On-Chip Learning", "abstract": "Loihi is a 60-mm2 chip fabricated in Intels 14-nm process that advances the state-of-the-art modeling of spiking neural networks in silicon. It integrates a wide range of novel features for the field, such as hierarchical connectivity, dendritic compartments, synaptic delays, and, most importantly, programmable synaptic learning rules. Running a spiking convolutional form of the Locally Competitive Algorithm, Loihi can solve LASSO optimization problems with over three orders of magnitude superior energy-delay-product compared to conventional solvers running on a CPU iso-process/voltage/area. This provides an unambiguous example of spike-based computation, outperforming all known conventional solutions."} | 49 | {"work_id": 2783525259, "title": "Loihi: A Neuromorphic Manycore Processor with On-Chip Learning", "abstract": "Loihi is a 60-mm2 chip fabricated in Intels 14-nm process that advances the state-of-the-art modeling of spiking neural networks in silicon. It integrates a wide range of novel features for the field, such as hierarchical connectivity, dendritic compartments, synaptic delays, and, most importantly, programmable synaptic learning rules. Running a spiking convolutional form of the Locally Competitive Algorithm, Loihi can solve LASSO optimization problems with over three orders of magnitude superior energy-delay-product compared to conventional solvers running on a CPU iso-process/voltage/area. This provides an unambiguous example of spike-based computation, outperforming all known conventional solutions."} | ||
| 38 | −{"work_id": 2187800381, "title": "Practical lock-freedom", "abstract": "Mutual-exclusion locks are currently the most popular mechanism for interprocess synchronisation, largely due to their apparent simplicity and ease of implementation. In the parallel-computing environments that are increasingly commonplace in high-performance applications, this simplicity is deceptive: mutual exclusion does not scale well with large numbers of locks and many concurrent threads of execution. Highly-concurrent access to shared data demands a sophisticated \u2018fine-grained\u2019 locking strategy to avoid serialising non-conflicting operations. Such strategies are hard to design correctly and with good performance because they can harbour problems such as deadlock, priority inversion and convoying. Lock manipulations may also degrade the performance of cache-coherent multiprocessor systems by causing coherency conflicts and increased interconnect traffic, even when the lock protects read-only data. In looking for solutions to these problems, interest has developed in lock-free data structures. By eschewing mutual exclusion it is hoped that more efficient and robust systems can be built. Unfortunately the current reality is that most lock-free algorithms are complex, slow and impractical. In this dissertation I address these concerns by introducing and evaluating practical abstractions and data structures that facilitate the development of large-scale lock-free systems. Firstly, I present an implementation of two useful abstractions that make it easier to develop arbitrary lock-free data structures. Although these abstractions have been described in previous work, my designs are the first that can be practically implemented on current multiprocessor systems. Secondly, I present a suite of novel lock-free search structures. This is interesting not only because of the fundamental importance of searching in computer science and its wide use in real systems, but also because it demonstrates the implementation issues that arise when using the practical abstractions I have developed. Finally, I evaluate each of my designs and compare them with existing lock-based and lock-free alternatives. To ensure the strongest possible competition, several of the lock-based alternatives are significant improvements on the best-known solutions in the literature. These results demonstrate that it is possible to build useful data structures with all the perceived benefits of lock-freedom and with performance better than sophisticated lock-based designs. Furthermore, and contrary to popular belief, this work shows that existing hardware primitives are sufficient to build practical lock-free implementations of complex data structures."} | ||||
| 39 | −{"work_id": 7127097285, "title": "Nonlinear photonic neuromorphic chips for spiking reinforcement learning", "abstract": "Photonic computing chips have made significant progress in accelerating linear computations, but nonlinear computations are usually implemented in the digital domain, which introduces additional system latency and power consumption, and hinders the implementation of fully functional photonic neural network chips. Here, we propose and fabricate a 16-channel programmable incoherent photonic neuromorphic computing chip by co-designing a simplified Mach\u2013Zehnder interferometer (MZI) mesh and distributed feedback lasers with saturable absorber (DFBs-SA) array using different materials, enabling implementation of both linear and nonlinear spike computations in the optical domain through two separate chips. Furthermore, previous studies mainly focused on supervised learning and simple image classification tasks. Here, we propose a photonic spiking reinforcement learning (RL) architecture for the first, to our knowledge, time, and develop a software\u2013hardware collaborative training-inference framework ( in situ photonic training and hardware-aware fine-tuning) to address the challenge of training spiking RL models. We achieve large-scale, energy-efficient (photonic linear computation: 1.39 TOPS/W, photonic nonlinear computation: 987.65 GOPS/W), and low-latency (on-chip 320 ps) deployment of an entire layer of photonic spiking RL. Two RL benchmarks including the discrete CartPole task and the continuous Pendulum task are demonstrated experimentally based on the spiking proximal policy optimization (PPO) algorithm. The hardware\u2013software collaborative computing reward value converges to 200 (\u2212250) for the CartPole (Pendulum) tasks, respectively, comparable to that of a traditional PPO algorithm. This experimental demonstration addresses the challenge of the absence of large-scale on-chip photonic nonlinear spike computation and spiking RL training difficulty, and presents a high-speed and low-latency photonic spiking RL solution with promising application prospects in fields such as robot control, autonomous driving, and embodied intelligence."} | ||||
| 40 | {"work_id": 7115707641, "title": "The carbon and water footprints of data centers and what this could mean for artificial intelligence", "abstract": "Although there are ways to estimate the global power demand of artificial intelligence (AI) systems, it remains challenging to quantify the associated carbon and water footprints. The lack of distinction between AI and non-AI workloads in the environmental reports of data center operators makes it possible to assess the environmental impact of AI workloads only by approximating them through data centers' general performance metrics. The environmental disclosure of tech companies is, however, often insufficient to determine even the total data center performance of these companies. The shortcomings in the environmental disclosure of data center operators could be remedied with new policies mandating the disclosure of additional metrics. Because the environmental impact of data centers is growing rapidly, the urgency of transparency in the tech sector is also increasing. The carbon footprint of AI systems alone could be between 32.6 and 79.7 million tons of CO 2 emissions in 2025, while the water footprint could reach 312.5\u2013764.6 billion L."} | 50 | {"work_id": 7115707641, "title": "The carbon and water footprints of data centers and what this could mean for artificial intelligence", "abstract": "Although there are ways to estimate the global power demand of artificial intelligence (AI) systems, it remains challenging to quantify the associated carbon and water footprints. The lack of distinction between AI and non-AI workloads in the environmental reports of data center operators makes it possible to assess the environmental impact of AI workloads only by approximating them through data centers' general performance metrics. The environmental disclosure of tech companies is, however, often insufficient to determine even the total data center performance of these companies. The shortcomings in the environmental disclosure of data center operators could be remedied with new policies mandating the disclosure of additional metrics. Because the environmental impact of data centers is growing rapidly, the urgency of transparency in the tech sector is also increasing. The carbon footprint of AI systems alone could be between 32.6 and 79.7 million tons of CO 2 emissions in 2025, while the water footprint could reach 312.5\u2013764.6 billion L."} | ||
| 41 | −{"work_id": 2963194964, "title": "L\u00e4mm\u00f6ns\u00e4\u00e4tely suprajohtavissa mikroaaltopiireiss\u00e4", "abstract": "Circuit quantum electrodynamics offers versatile opportunities for various discoveries infundamental physics, as well as for different applications such as sensitive detectors and,ultimately, even a large-scale quantum computer. Since these devices work at cryogenictemperatures and excess heat is a substantial source of errors, it is of great importance to controlthe heat. In this thesis, several techniques for heat control are experimentally investigated. We study heattransfer carried by photons between two heat baths, as well as heat flow between superconductingresonators and their environment. In particular, the focus is on using normal-metal componentsto enhance the operation of superconducting microwave circuits operating at the level of singleenergy quanta. First, we investigate long-distance single-channel heat conduction near the quantum limit, i.e.,the quantum of thermal conductance. As compared to earlier experiments, the distance is increasedby a factor of 10,000. In addition, we demonstrate emission and absorption of photons in amicrowave resonator by photon-assisted tunneling in normal-metal\u2013insulator\u2013superconductorjunctions. Another approach for absorbing photons is to use a normal-metal resistor in asuperconducting resonator with a tunable resonance frequency. Finally, we realize a circuitconsisting of two resonators with a singularity in the parameter space, known as an exceptionalpoint. In our circuit, the exceptional point enables the fastest possible heat transfer between thetwo resonators without back and forth oscillation. In the future, these methods may find applications in different cryogenic devices, including a fastinitialization of qubits. Furthermore, the methods may be utilized in the experimental studies offundamental physics, including further investigations of exceptional points in differentconfigurations."} | 51 | +{"work_id": 7130516837, "title": "Gaussian-Function-Driven Chaotic Memristive Dynamics with Application to Image Encryption", "abstract": "This paper develops a Gaussian-function-driven chaotic memristive system in which the magnetic flux is characterized by a Gaussian function, distinguishing it from prevailing formulations that employ piecewise, polynomial, or weakly smooth nonlinearities. The proposed system exhibits the key fingerprints of memristive behavior, including pinched hysteresis loops, local activity and nonvolatility. Integrating the Gaussian function into Chua\u2019s circuit produces a multiscroll chaotic Gaussian memristive system, where the attractors emerge in an organized and predictable pattern, with their numbers and spatial distribution determined by the Gaussian kernel parameters. To demonstrate the applicability of the proposed chaotic system, an image encryption scheme exploits the chaotic sequences generated by this system and integrates adaptive Zigzag scrambling, DNA encoding and bit-plane cross-diffusion. Experimental results show that the scheme achieves uniform histograms, negligible pixel correlation, strong key sensitivity and high resistance to noise and differential attacks. The incorporation of Gaussian function enriches the framework of chaotic memristive systems and establishes a flexible and robust foundation for secure image encryption."} | ||
| 42 | −{"work_id": 4416596047, "title": "Toward Sustainable AI: A Scoping Review of Carbon Footprint and Environmental Impacts Across Training and Inference Stages", "abstract": "AI is spreading rapidly, creating significant social and economic value while also raising concerns about its high energy use and environmental sustainability. While prior studies have predominantly focused on the energy-intensive nature of the training phase, the cumulative environmental footprint generated during large-scale service operations, particularly in the inference phase, has received comparatively less attention and remains difficult to compare across studies due to inconsistent boundaries and disclosure practices. To bridge this gap, this study conducts a scoping review of methodologies and evidence on AI carbon footprint assessment. We analyze the classification and standardization status of existing AI carbon measurement tools and methodologies, and comparatively examine the environmental impacts arising from both training and inference stages, and synthesize inference evaluation into a benchmark-oriented framework. In addition, we identify how multidimensional factors such as model size, prompt complexity, serving environments, and system boundary definitions shape the resulting carbon footprint. Our review reveals critical limitations in current AI carbon accounting practices, including methodological inconsistencies, technology-specific biases, and insufficient attention to end-to-end system perspectives. Building on these insights, we propose future research and governance directions: (1) establishing standardized and transparent universal measurement protocols with clear boundary, functional-unit, and disclosure requirements, (2) designing dynamic evaluation frameworks that incorporate user behavior and service-level operating conditions, (3) developing life-cycle monitoring systems that encompass embodied emissions, and (4) advancing multidimensional sustainability assessment framework that balance model performance with environmental efficiency. This paper provides a foundation for interdisciplinary dialogue aimed at building a sustainable AI ecosystem and offers a baseline guideline for researchers and policymakers seeking to evaluate AI environmental impacts across technical, social, and operational dimensions."} | 52 | +{"work_id": 3046751266, "title": "Scalable molecular dynamics on CPU and GPU architectures with NAMD", "abstract": "NAMDis a molecular dynamics program designed for high-performance simulations of very large biological objects on CPU- and GPU-based architectures. NAMD offers scalable performance on petascale parallel supercomputers consisting of hundreds of thousands of cores, as well as on inexpensive commodity clusters commonly found in academic environments. It is written in C++ and leans on Charm++ parallel objects for optimal performance on low-latency architectures. NAMD is a versatile, multipurpose code that gathers state-of-the-art algorithms to carry out simulations in apt thermodynamic ensembles, using the widely popular CHARMM, AMBER, OPLS, and GROMOS biomolecular force fields. Here, we review the main features of NAMD that allow both equilibrium and enhanced-sampling molecular dynamics simulations with numerical efficiency. We describe the underlying concepts utilized by NAMD and their implementation, most notably for handling long-range electrostatics; controlling the temperature, pressure, and pH; applying external potentials on tailored grids; leveraging massively parallel resources in multiple-copy simulations; and hybrid quantum-mechanical/molecular-mechanical descriptions. We detail the variety of options offered by NAMD for enhanced-sampling simulations aimed at determining free-energy differences of either alchemical or geometrical transformations and outline their applicability to specific problems. Last, we discuss the roadmap for the development of NAMD and our current efforts toward achieving optimal performance on GPU-based architectures, for pushing back the limitations that have prevented biologically realistic billion-atom objects to be fruitfully simulated, and for making large-scale simulations less expensive and easier to set up, run, and analyze. NAMD is distributed free of charge with its source code at www.ks.uiuc.edu."} | ||
| 53 | +{"work_id": 4403458785, "title": "Artificial intelligence in higher education: exploring faculty use, self-efficacy, distinct profiles, and professional development needs", "abstract": "Abstract Faculty perspectives on the use of artificial intelligence (AI) in higher education are crucial for AI\u2019s meaningful integration into teaching and learning, yet research is scarce. This paper presents a study designed to gain insight into faculty members\u2019 ( N = 122) AI self-efficacy and distinct latent profiles, perceived benefits, challenges, use, and professional development needs related to AI. The respondents saw greater equity in education as AI\u2019s greatest benefit, while students and faculty members\u2019 lack of AI literacy was among the greatest challenges, with the majority interested in professional development. Latent class analysis revealed four distinct faculty member profiles: optimistic, critical, critically reflected, and neutral. The optimistic profile moderates the relationship between self-efficacy and usage. The development of adequate support services is suggested for successful and sustainable digital transformation."} | ||||
| 54 | +{"work_id": 4308245305, "title": "Estimating the Carbon Footprint of BLOOM, a 176B Parameter Language Model", "abstract": "Progress in machine learning (ML) comes with a cost to the environment, given that training ML models requires significant computational resources, energy and materials. In the present article, we aim to quantify the carbon footprint of BLOOM, a 176-billion parameter language model, across its life cycle. We estimate that BLOOM's final training emitted approximately 24.7 tonnes of~\\carboneq~if we consider only the dynamic power consumption, and 50.5 tonnes if we account for all processes ranging from equipment manufacturing to energy-based operational consumption. We also study the energy requirements and carbon emissions of its deployment for inference via an API endpoint receiving user queries in real-time. We conclude with a discussion regarding the difficulty of precisely estimating the carbon footprint of ML models and future research directions that can contribute towards improving carbon emissions reporting."} | ||||
| 55 | +{"work_id": 1224547023, "title": "Model-Based Framework for Schedulability Analysis Using Uppaal 4.1", "abstract": "Embedded systems involve the monitoring and control of complex physical processes using applications running on dedicated execution platforms in a resource-constrained manner in terms of, for example, memory, processing power, bandwidth, energy consumption, and timing behavior."} | ||||
| 56 | +{"work_id": 4401304802, "title": "Best Practices Guide for Energy-Efficient Data Center Design", "abstract": "This guide provides an overview of best practices for energy-efficient data center design which spans the categories of information technology (IT) systems and their environmental conditions, data center air management, cooling and electrical systems, and heat recovery. IT system energy efficiency and environmental conditions are presented first because measures taken in these areas have a cascading effect of secondary energy savings for the mechanical and electrical systems. This guide concludes with a section on metrics and benchmarking values by which a data center and its systems energy efficiency can be evaluated. No design guide can offer \u201cthe most energy-efficient\u201d data center design but the guidelines that follow offer suggestions that provide efficiency benefits for a wide variety of data center scenarios."} | ||||
| 57 | +{"work_id": 4286840061, "title": "Algorithm-Architecture Co-Design for Domain-Specific Accelerators in Communication and Artificial Intelligence", "abstract": "The past decade has witnessed an explosive growth of data and the needs for high-speed data communications and processing. The needs continue to drive the development of new hardware for transmitting more data reliably and processing more data to obtain a higher level of intelligence. This thesis work explores algorithm-architecture co-design approach to derive efficient solutions for domain-specific communication and machine learning accelerators. It focuses on advanced and most compute-intensive accelerator designs for: 1) channel coding for data transmission, including polar codes and low-density parity-check (LDPC) codes, and 2) neural networks for machine learning, including differentiable neural computer (DNC) and neural ordinary differential equations (NODE). It also covers an interdisciplinary area of AI-aided communication, exploring DNC-aided flip decoding for polar codes. This work introduces a split-tree successive-cancellation list (SCL) decoder that works by dividing a polar code's decoding tree to sub-trees following a split-tree algorithm. Through algorithm-architecture co-optimizations, a 0.64mm2 40nm test chip implements a split-4, list-2, 8-frame-interleaved decoder that supports configurable code lengths up to 1024 bit and variable code rates. This work advances LDPC codes in two aspects: 1) we take the inspiration from simulated annealing to generalize the post-processor design using three methods: quenching, extended heating, and focused heating, each of which targets a different decoding error structure. The resulting post-processor is demonstrated to lower the error rate by two orders of magnitudes. 2) We also present a fully parallel decoder for a (160, 80) regular-(2, 4) NB-LDPC code over Galois field GF(64) in 65nm CMOS. The decoder employs fine-grained dynamic clock gating and decoder early termination to achieve a throughput of 1.22Gb/s and an energy efficiency of 3.03nJ/b. This work contributes to the hardware acceleration of DNC. We present HiMA, a tiled, history-based memory access engine with distributed memories in tiles. HiMA incorporates a traffic-aware multi-mode network-on-chip (NoC), an optimal submatrix-based memory partition and a two-stage usage sort method leveraging distributed tiles. We create a distributed DNC (DNC-D) to allow almost all memory operations to be applied to local memories. In a 40nm design, HiMA running DNC and DNC-D demonstrates 39.1x higher speed, 164.3x better area efficiency, and 61.2x better power efficiency over the state-of-the-art accelerators. This work contributes to the hardware acceleration of NODE for improved modeling capability of continuous-time events. We carry out algorithm-architecture co-design: 1) we propose adaptive neural activation sparsity for up to 80% complexity reduction while maintaining excellent training accuracy. 2) we develop a multi-mode PE design for NODE compute kernels with configurable interconnects between PEs to handle a variety of numerical ODE solvers. The hardware efficiency is further enhanced by exploring hardware reuse and hierarchical memory. Lastly, this work investigates an interdisciplinary area of AI-aided communication, applying DNC for flip decoding of polar codes. We develop new state and action encoding with a two-phase decoding flow. Simulation results show that proposed DNC-aided SCL-Flip (DNC-SCLF) decoding demonstrates up to 0.34dB coding gain improvement or 54.2% reduction in average number of decoding attempts compared to prior works. The five pieces of work presented in this thesis tackle hardware acceleration challenges in domain-specific computing using algorithm-architecture co-design techniques. The results of this work contribute to the developments of hardware accelerators in channel coding and deep learning, enabling next-generation communication and artificial intelligence from theory to efficient hardware."} | ||||
| 58 | +{"work_id": 7130433466, "title": "A Second-Order Memristor Method to Construct Memristive Neural Networks With Multi-Butterfly and Multi-Scroll Dynamics", "abstract": "Memristor-based Hopfield neural networks (MHNNs) exhibit rich chaotic dynamics and bear closer hardware resemblance to the biological brain, making them well suited for emulating neural dynamical behaviors. However, most existing MHNNs are constructed with first-order memristors. This paper proposes a novel second-order memristor (SOM) approach for constructing MHNNs with enriched chaotic dynamics. Specifically, a second-order memristor is incorporated into a three-neuron Hopfield neural network to emulate the magnetic coupling mechanism between neurons, thereby forming a second-order memristor-based neural network (SOM-HNN). Comprehensive dynamical analyses, including bifurcation diagrams, Lyapunov exponent spectra, and numerical simulations, confirm that the proposed SOM-HNN exhibits richer and more intricate chaos behaviors than its first-order counterparts. Remarkably, the proposed SOM-HNN can simultaneously generate butterfly and scroll attractors, multi-butterfly and multi-scroll attractors, as well as initial-boosed coexisting multi-butterfly and multi-scroll attractors, thereby substantially enhancing its dynamical diversity. To the best of our knowledge, this is the first report of both multi-butterfly and multi-scroll dynamics in a neural network. Furthermore, the SOM-HNN is implemented in hardware using analog circuits and a digital field-programmable gate array (FPGA) platform. Experimental results demonstrate the network\u2019s abundant dynamical features and its feasibility for efficient hardware realization in neuromorphic engineering applications."} | ||||
| 59 | +{"work_id": 7135102590, "title": "Biologically Plausible Memristive Decision-Making Circuit for Adaptive Control in Industrial Autonomous Navigation", "abstract": "In biological decision-making, adaptive behavior arises from the interaction between structured task context, expectation, action selection, and feedback-based learning. While most existing studies reproduce reward-driven responses under clear sensory stimuli, decision formation under weak or absent sensory evidence, such as low or 0% contrast conditions, remains insufficiently explored. To address this issue, this work proposes a biologically plausible memristive decision-making framework based on a block-structured task paradigm. The proposed system adopts a closed-loop architecture composed of four functional modules: stimulus, expectation, action, and reward/punishment. Sensory information is encoded when available, while the expectation pathway provides prior-guided modulation when sensory evidence becomes weak or unreliable. Action selection is generated through competitive integration, and reward\u2013punishment feedback dynamically corrects decision bias and reinforces appropriate responses. Through this hierarchical interaction, stable decision behavior can be achieved even in the absence of explicit sensory inputs. PSPICE simulations are conducted to analyze system dynamics and validate the corrective role of the reward\u2013punishment mechanism under weak and ambiguous conditions. In addition, the proposed framework is demonstrated in an industrial autonomous navigation scenario, illustrating its scalability and applicability for adaptive decision-making under uncertainty."} | ||||
| 60 | +{"work_id": 4394727812, "title": "Large-scale photonic chiplet Taichi empowers 160-TOPS/W artificial general intelligence", "abstract": "The pursuit of artificial general intelligence (AGI) continuously demands higher computing performance. Despite the superior processing speed and efficiency of integrated photonic circuits, their capacity and scalability are restricted by unavoidable errors, such that only simple tasks and shallow models are realized. To support modern AGIs, we designed Taichi-large-scale photonic chiplets based on an integrated diffractive-interference hybrid design and a general distributed computing architecture that has millions-of-neurons capability with 160-tera-operations per second per watt (TOPS/W) energy efficiency. Taichi experimentally achieved on-chip 1000-category-level classification (testing at 91.89% accuracy in the 1623-category Omniglot dataset) and high-fidelity artificial intelligence-generated content with up to two orders of magnitude of improvement in efficiency. Taichi paves the way for large-scale photonic computing and advanced tasks, further exploiting the flexibility and potential of photonics for modern AGI."} | ||||
| 61 | +{"work_id": 4385481791, "title": "Reducing the Carbon Impact of Generative AI Inference (today and in 2035)", "abstract": "Generative AI, exemplified in ChatGPT, Dall-E 2, and Stable Diffusion, are exciting new applications consuming growing quantities of computing. We study the compute, energy, and carbon impacts of generative AI inference. Using ChatGPT as an exemplar, we create a workload model and compare request direction approaches (Local, Balance, CarbonMin), assessing their power use and carbon impacts."} | ||||
| 43 | {"work_id": 2921153466, "title": "Basic Performance Measurements of the Intel Optane DC Persistent Memory Module", "abstract": "Scalable nonvolatile memory DIMMs will finally be commercially available with the release of the Intel Optane DC Persistent Memory Module (or just \"Optane DC PMM\"). This new nonvolatile DIMM supports byte-granularity accesses with access times on the order of DRAM, while also providing data storage that survives power outages. This work comprises the first in-depth, scholarly, performance review of Intel's Optane DC PMM, exploring its capabilities as a main memory device, and as persistent, byte-addressable memory exposed to user-space applications. This report details the technologies performance under a number of modes and scenarios, and across a wide variety of macro-scale benchmarks. Optane DC PMMs can be used as large memory devices with a DRAM cache to hide their lower bandwidth and higher latency. When used in this Memory (or cached) mode, Optane DC memory has little impact on applications with small memory footprints. Applications with larger memory footprints may experience some slow-down relative to DRAM, but are now able to keep much more data in memory. When used under a file system, Optane DC PMMs can result in significant performance gains, especially when the file system is optimized to use the load/store interface of the Optane DC PMM and the application uses many small, persistent writes. For instance, using the NOVA-relaxed NVMM file system, we can improve the performance of Kyoto Cabinet by almost 2x. Optane DC PMMs can also enable user-space persistence where the application explicitly controls its writes into persistent Optane DC media. In our experiments, modified applications that used user-space Optane DC persistence generally outperformed their file system counterparts. For instance, the persistent version of RocksDB performed almost 2x faster than the equivalent program utilizing an NVMM-aware file system."} | 62 | {"work_id": 2921153466, "title": "Basic Performance Measurements of the Intel Optane DC Persistent Memory Module", "abstract": "Scalable nonvolatile memory DIMMs will finally be commercially available with the release of the Intel Optane DC Persistent Memory Module (or just \"Optane DC PMM\"). This new nonvolatile DIMM supports byte-granularity accesses with access times on the order of DRAM, while also providing data storage that survives power outages. This work comprises the first in-depth, scholarly, performance review of Intel's Optane DC PMM, exploring its capabilities as a main memory device, and as persistent, byte-addressable memory exposed to user-space applications. This report details the technologies performance under a number of modes and scenarios, and across a wide variety of macro-scale benchmarks. Optane DC PMMs can be used as large memory devices with a DRAM cache to hide their lower bandwidth and higher latency. When used in this Memory (or cached) mode, Optane DC memory has little impact on applications with small memory footprints. Applications with larger memory footprints may experience some slow-down relative to DRAM, but are now able to keep much more data in memory. When used under a file system, Optane DC PMMs can result in significant performance gains, especially when the file system is optimized to use the load/store interface of the Optane DC PMM and the application uses many small, persistent writes. For instance, using the NOVA-relaxed NVMM file system, we can improve the performance of Kyoto Cabinet by almost 2x. Optane DC PMMs can also enable user-space persistence where the application explicitly controls its writes into persistent Optane DC media. In our experiments, modified applications that used user-space Optane DC persistence generally outperformed their file system counterparts. For instance, the persistent version of RocksDB performed almost 2x faster than the equivalent program utilizing an NVMM-aware file system."} | ||
| 44 | {"work_id": 4283157527, "title": "Measuring the Carbon Intensity of AI in Cloud Instances", "abstract": "The advent of cloud computing has provided people around the world with unprecedented access to computational power and enabled rapid growth in technologies such as machine learning, the computational demands of which incur a high energy cost and a commensurate carbon footprint. As a result, recent scholarship has called for better estimates of the greenhouse gas impact of AI: data scientists today do not have easy or reliable access to measurements of this information, which precludes development of actionable tactics. We argue that cloud providers presenting information about software carbon intensity to users is a fundamental stepping stone towards minimizing emissions."} | 63 | {"work_id": 4283157527, "title": "Measuring the Carbon Intensity of AI in Cloud Instances", "abstract": "The advent of cloud computing has provided people around the world with unprecedented access to computational power and enabled rapid growth in technologies such as machine learning, the computational demands of which incur a high energy cost and a commensurate carbon footprint. As a result, recent scholarship has called for better estimates of the greenhouse gas impact of AI: data scientists today do not have easy or reliable access to measurements of this information, which precludes development of actionable tactics. We argue that cloud providers presenting information about software carbon intensity to users is a fundamental stepping stone towards minimizing emissions."} | ||
| 64 | +{"work_id": 4396654316, "title": "Digital financial inclusion, financial stability, and sustainable development: Evidence from a quantile\u2010on\u2010quantile regression and wavelet coherence", "abstract": "Abstract The current research examines the influence of digital financial inclusion (DFI) and financial stability (FS) on sustainable development in Vietnam through a dataset spanning during 2004\u20132022. Non\u2010parametric methods, such as quantile regression, Granger tests in different quantiles, and wavelet analysis were employed to elucidate the effect of different quantiles of FS and DFI on various quantiles of sustainable development. Our primary contribution lies in integrating three research domains to examine the relationships among all three factors simultaneously, all within the framework of one of the biggest developing economies. Our findings exhibit the strongly positive influence of FS and DFI on sustainable development in Vietnam across various quantiles and frequencies. This suggests that FS and DFI support the transition of country toward sustainable development."} | ||||
| 45 | {"work_id": 2781738013, "title": "Quantum Computing in the NISQ era and beyond", "abstract": "Noisy Intermediate-Scale Quantum (NISQ) technology will be available in the near future. Quantum computers with 50-100 qubits may be able to perform tasks which surpass the capabilities of today's classical digital computers, but noise in quantum gates will limit the size of quantum circuits that can be executed reliably. NISQ devices will be useful tools for exploring many-body quantum physics, and may have other useful applications, but the 100-qubit quantum computer will not change the world right away - we should regard it as a significant step toward the more powerful quantum technologies of the future. Quantum technologists should continue to strive for more accurate quantum gates and, eventually, fully fault-tolerant quantum computing."} | 65 | {"work_id": 2781738013, "title": "Quantum Computing in the NISQ era and beyond", "abstract": "Noisy Intermediate-Scale Quantum (NISQ) technology will be available in the near future. Quantum computers with 50-100 qubits may be able to perform tasks which surpass the capabilities of today's classical digital computers, but noise in quantum gates will limit the size of quantum circuits that can be executed reliably. NISQ devices will be useful tools for exploring many-body quantum physics, and may have other useful applications, but the 100-qubit quantum computer will not change the world right away - we should regard it as a significant step toward the more powerful quantum technologies of the future. Quantum technologists should continue to strive for more accurate quantum gates and, eventually, fully fault-tolerant quantum computing."} | ||
| 46 | −{"work_id": 2792476970, "title": "Assessing Bootstrap", "abstract": "Bootstrap:Algebra is a curricular module designed to integrate introductory computing into an algebra class; the module aims to help students improve on various essential learning outcomes from state and national algebra standards. In prior work, we published initial findings about student performance gains on algebra problems after taking Bootstrap. While the results were promising, the dataset was not large, and had students working on algebra problems that had been scaffolded with Bootstrap's pedagogy. This paper reports on a more detailed study with (a) data from more than three times as many students, (b) analysis of performance changes in incorrect answers, (c) some problems in which the Bootstrap scaffolds have been removed, and (d) an IRT analysis across the elements of Bootstrap's program-design pedagogy. Our results confirm that students improve on algebraic word problems after completing the module, even on unscaffolded problems. The nature of incorrect answers to symbolic-form questions also appears to improve after Bootstrap."} | 66 | +{"work_id": 3137672894, "title": "SSUR: An Approach to Optimizing Virtual Machine Allocation Strategy Based on User Requirements for Cloud Data Center", "abstract": "Cloud data centers provide services for an increasing number of applications. The virtual machines (VMs) that perform the corresponding application tasks need to be allocated to physical machines (PMs). For VM allocation, cloud service centers consider both energy consumption and quality of service (QoS), while cloud users are primarily concerned with their own needs, such as throughput and reliability. This paper proposes an allocation scheme for optimization based on user requirements in a cloud data center. First, various application requests from mobile phones and devices, which are regarded as a group of VM lists in the data center, are submitted to the cloud platform. Our method first allocates these arriving VMs to appropriate PMs based on their usage of hardware resources and the current throughput of the PMs in the data center. Second, due to dynamic workloads, the loads of the PMs that host these VMs may become very high. CPU utilization thresholds are set to determine whether migration is required, and the energy consumption before and after allocation is used to choose which VMs are reallocated. A suitable strategy for VM migration and PM shutdown can improve reliability and reduce energy consumption. Finally, it is shown through experimental simulations that compared with two existing algorithms, on the premise that the user requirements are met, the proposed method offers good performance in terms of total energy consumption, CPU utilization, number of PMs used and number of service-level agreement (SLA) violation."} | ||
| 67 | +{"work_id": 2963840171, "title": "Information and Communications Technologies for Sustainable Development Goals: State-of-the-Art, Needs and Perspectives", "abstract": "In September 2015, the United Nations General Assembly accepted the 2030 Development Agenda, which has included 92 paragraphs, and the Paragraph 91 defined 17 sustainable development goals (SDGs) and 169 associated targets. The goal of this paper is to discover the correlations among SDGs and information and communications technologies (ICTs). This paper discusses the roles and opportunities that ICTs play in pursuing the SDGs. We identify a number of research gaps to those three pillars, social, economic, and environmental perspectives, of sustainable development. After extensive literature reviews on the SDG-related research initiatives and activities, we find that the majority of contributions to SDGs recognized by the IEEE and ACM research communities have mainly focused on the technical aspects while there are lack of the holistic social good perspectives. Therefore, there are essential and urgent needs to raise the awareness and call for attentions on how to innovate and energize ICTs in order to best assist all nations to achieve the SDGs by 2030."} | ||||
| 68 | +{"work_id": 4389373471, "title": "Logical quantum processor based on reconfigurable atom arrays", "abstract": "Abstract Suppressing errors is the central challenge for useful quantum computing 1 , requiring quantum error correction (QEC) 2\u20136 for large-scale processing. However, the overhead in the realization of error-corrected \u2018logical\u2019 qubits, in which information is encoded across many physical qubits for redundancy 2\u20134 , poses substantial challenges to large-scale logical quantum computing. Here we report the realization of a programmable quantum processor based on encoded logical qubits operating with up to 280 physical qubits. Using logical-level control and a zoned architecture in reconfigurable neutral-atom arrays 7 , our system combines high two-qubit gate fidelities 8 , arbitrary connectivity 7,9 , as well as fully programmable single-qubit rotations and mid-circuit readout 10\u201315 . Operating this logical processor with various types of encoding, we demonstrate improvement of a two-qubit logic gate by scaling surface-code 6 distance from d = 3 to d = 7, preparation of colour-code qubits with break-even fidelities 5 , fault-tolerant creation of logical Greenberger\u2013Horne\u2013Zeilinger (GHZ) states and feedforward entanglement teleportation, as well as operation of 40 colour-code qubits. Finally, using 3D [[8,3,2]] code blocks 16,17 , we realize computationally complex sampling circuits 18 with up to 48 logical qubits entangled with hypercube connectivity 19 with 228 logical two-qubit gates and 48 logical CCZ gates 20 . We find that this logical encoding substantially improves algorithmic performance with error detection, outperforming physical-qubit fidelities at both cross-entropy benchmarking and quantum simulations of fast scrambling 21,22 . These results herald the advent of early error-corrected quantum computation and chart a path towards large-scale logical processors."} | ||||
| 69 | +{"work_id": 2788945937, "title": "Classification with Quantum Neural Networks on Near Term Processors", "abstract": "We introduce a quantum neural network, QNN, that can represent labeled data, classical or quantum, and be trained by supervised learning. The quantum circuit consists of a sequence of parameter dependent unitary transformations which acts on an input quantum state. For binary classification a single Pauli operator is measured on a designated readout qubit. The measured output is the quantum neural network\u2019s predictor of the binary label of the input state. We show through classical simulation that parameters can be found that allow the QNN to learn to correctly distinguish the two data sets. We then discuss presenting the data as quantum superpositions of computational basis states corresponding to different label values. Here we show through simulation that learning is possible. We consider using our QNN to learn the label of a general quantum state. By example we show that this can be done. Our work is exploratory and relies on the classical simulation of small quantum systems. The QNN proposed here was designed with near-term quantum processors in mind. Therefore it will be possible to run this QNN on a near term gate model quantum computer where its power can be explored beyond what can be explored with simulation."} | ||||
| 70 | +{"work_id": 4386285839, "title": "Managing the Strategic Transformation of Higher Education through Artificial Intelligence", "abstract": "Considering the rapid advancements in artificial intelligence (AI) and their potential implications for the higher education sector, this article seeks to critically evaluate the strategic adoption of AI in the framework of \u201csmart universities\u201d. We envisage these innovative institutions as the imminent evolution in higher education, harnessing AI and quantum technologies to reshape academic and administrative processes. The core presumption is that through such integration, universities can achieve personalized learning trajectories, enhanced accessibility, economic efficiency, and a boost in overall operational performance. However, venturing into this new educational paradigm necessitates a thorough exploration of potential pitfalls, including questions surrounding educational quality, potential job losses, risks of bias, privacy breaches, and safety concerns. Our primary objective is to offer a balanced assessment to aid stakeholders in making informed strategic decisions about endorsing and advancing the smart university model. A pivotal factor in this discourse is the acceptance of qualifications from AI-enriched institutions by employers, a variable that may drastically redefine the education sector\u2019s trajectory. Within the context of a comprehensive analysis of its broader societal impact, this article also delves into the ramifications of AI-driven innovations for historically Black colleges and universities (HBCUs)."} | ||||
| 71 | +{"work_id": 3099878876, "title": "Array programming with NumPy", "abstract": "Abstract Array programming provides a powerful, compact and expressive syntax for accessing, manipulating and operating on data in vectors, matrices and higher-dimensional arrays. NumPy is the primary array programming library for the Python language. It has an essential role in research analysis pipelines in fields as diverse as physics, chemistry, astronomy, geoscience, biology, psychology, materials science, engineering, finance and economics. For example, in astronomy, NumPy was an important part of the software stack used in the discovery of gravitational waves1 and in the first imaging of a black hole2. Here we review how a few fundamental array concepts lead to a simple and powerful programming paradigm for organizing, exploring and analysing scientific data. NumPy is the foundation upon which the scientific Python ecosystem is constructed. It is so pervasive that several projects, targeting audiences with specialized needs, have developed their own NumPy-like interfaces and array objects. Owing to its central position in the ecosystem, NumPy increasingly acts as an interoperability layer between such array computation libraries and, together with its application programming interface (API), provides a flexible framework to support the next decade of scientific and industrial analysis."} | ||||
| 72 | +{"work_id": 4366587887, "title": "Promising Emerging Technologies for Teaching and Learning: Recent Developments and Future Challenges", "abstract": "As time goes on and the number of people who use information and communication technology (ICT) grows, emerging technologies are receiving a lot of attention from academics, researchers, and users. Emerging technologies are changing more quickly than ever, and it is important to start building skills early in education by using the right examples to teach and learn about digital citizenship. New pedagogies support individual teaching and learning methodologies for knowledge acquisition and self-directed learning. Hundreds of digital education tools have been developed to increase student autonomy, enhance academic process management, promote collaboration, and improve communication between teachers and students. This article examines the current state of emerging technologies from a variety of educational viewpoints, highlights a few of them, and discusses both their established and potential educational benefits. Additionally, it offers in-depth debates on recent developments and future challenges from a wide range of perspectives. The analysis focuses on peer-reviewed research articles published in well-renowned publications databases over the last 8 years, drawing upon a bibliometric analysis using VOSviewer. The results of this study are also anticipated to serve as a substantial impetus for other universities and colleges worldwide to utilize innovatively and revolutionized technology for better academic performance."} | ||||
| 47 | {"work_id": 4409126690, "title": "IBM quantum computers: evolution, performance, and future directions", "abstract": "Abstract Quantum computers represent a transformative frontier in computational technology, promising exponential speedups beyond classical computing limits. IBM Quantum has led significant advancements in both hardware and software, providing access to quantum hardware via IBM Cloud\u00ae since 2016 and achieving a milestone with the world\u2019s first accessible quantum computer. This paper explores IBM\u2019s journey in quantum computing, focusing on its contributions to both hardware and software, as well as the development of practical quantum computers. We trace the evolution of IBM Quantum\u2019s processors, from the early canary processors to the milestone of surpassing the 1000-qubit barrier. In addition to these technological strides, we delve into the practical applications of quantum computing, particularly within nine key industries: airlines, banking, healthcare, electronics, life sciences, and more. We also explore IBM Quantum\u2019s case studies and strategic partnerships with organizations such as Boeing, CERN, ExxonMobil, and Cleveland Clinic, which are helping to bridge the gap between theoretical research and real-world applications. Further, we examine the key challenges and solutions in scaling quantum systems and achieving fault tolerance, highlighting IBM\u2019s efforts toward building practical, fault-tolerant quantum systems capable of addressing real-world problems."} | 73 | {"work_id": 4409126690, "title": "IBM quantum computers: evolution, performance, and future directions", "abstract": "Abstract Quantum computers represent a transformative frontier in computational technology, promising exponential speedups beyond classical computing limits. IBM Quantum has led significant advancements in both hardware and software, providing access to quantum hardware via IBM Cloud\u00ae since 2016 and achieving a milestone with the world\u2019s first accessible quantum computer. This paper explores IBM\u2019s journey in quantum computing, focusing on its contributions to both hardware and software, as well as the development of practical quantum computers. We trace the evolution of IBM Quantum\u2019s processors, from the early canary processors to the milestone of surpassing the 1000-qubit barrier. In addition to these technological strides, we delve into the practical applications of quantum computing, particularly within nine key industries: airlines, banking, healthcare, electronics, life sciences, and more. We also explore IBM Quantum\u2019s case studies and strategic partnerships with organizations such as Boeing, CERN, ExxonMobil, and Cleveland Clinic, which are helping to bridge the gap between theoretical research and real-world applications. Further, we examine the key challenges and solutions in scaling quantum systems and achieving fault tolerance, highlighting IBM\u2019s efforts toward building practical, fault-tolerant quantum systems capable of addressing real-world problems."} | ||
| 48 | {"work_id": 4406693713, "title": "Scaling and networking a modular photonic quantum computer", "abstract": "Photonics offers a promising platform for quantum computing1\u20134, owing to the availability of chip integration for mass-manufacturable modules, fibre optics for networking and room-temperature operation of most components. However, experimental demonstrations are needed of complete integrated systems comprising all basic functionalities for universal and fault-tolerant operation5. Here we construct a (sub-performant) scale model of a quantum computer using 35 photonic chips to demonstrate its functionality and feasibility. This combines all the primitive components as discrete, scalable rack-deployed modules networked over fibre-optic interconnects, including 84 squeezers6 and 36 photon-number-resolving detectors furnishing 12 physical qubit modes at each clock cycle. We use this machine, which we name Aurora, to synthesize a cluster state7 entangled across separate chips with 86.4 billion modes, and demonstrate its capability of implementing the foliated distance-2 repetition code with real-time decoding. The key building blocks needed for universality and fault tolerance are demonstrated: heralded synthesis of single-temporal-mode non-Gaussian resource states, real-time multiplexing actuated on photon-number-resolving detection, spatiotemporal cluster-state formation with fibre buffers, and adaptive measurements implemented using chip-integrated homodyne detectors with real-time single-clock-cycle feedforward. We also present a detailed analysis of our architecture\u2019s tolerances for optical loss, which is the dominant and most challenging hurdle to crossing the fault-tolerant threshold. This work lays out the path to cross the fault-tolerant threshold and scale photonic quantum computers to the point of addressing useful applications. A proof-of-principle study reports a complete photonic quantum computer architecture that can, once appropriate component performance is achieved, deliver a universal and fault-tolerant quantum computer."} | 74 | {"work_id": 4406693713, "title": "Scaling and networking a modular photonic quantum computer", "abstract": "Photonics offers a promising platform for quantum computing1\u20134, owing to the availability of chip integration for mass-manufacturable modules, fibre optics for networking and room-temperature operation of most components. However, experimental demonstrations are needed of complete integrated systems comprising all basic functionalities for universal and fault-tolerant operation5. Here we construct a (sub-performant) scale model of a quantum computer using 35 photonic chips to demonstrate its functionality and feasibility. This combines all the primitive components as discrete, scalable rack-deployed modules networked over fibre-optic interconnects, including 84 squeezers6 and 36 photon-number-resolving detectors furnishing 12 physical qubit modes at each clock cycle. We use this machine, which we name Aurora, to synthesize a cluster state7 entangled across separate chips with 86.4 billion modes, and demonstrate its capability of implementing the foliated distance-2 repetition code with real-time decoding. The key building blocks needed for universality and fault tolerance are demonstrated: heralded synthesis of single-temporal-mode non-Gaussian resource states, real-time multiplexing actuated on photon-number-resolving detection, spatiotemporal cluster-state formation with fibre buffers, and adaptive measurements implemented using chip-integrated homodyne detectors with real-time single-clock-cycle feedforward. We also present a detailed analysis of our architecture\u2019s tolerances for optical loss, which is the dominant and most challenging hurdle to crossing the fault-tolerant threshold. This work lays out the path to cross the fault-tolerant threshold and scale photonic quantum computers to the point of addressing useful applications. A proof-of-principle study reports a complete photonic quantum computer architecture that can, once appropriate component performance is achieved, deliver a universal and fault-tolerant quantum computer."} | ||
| 49 | {"work_id": 4380627387, "title": "Evidence for the utility of quantum computing before fault tolerance", "abstract": "Abstract Quantum computing promises to offer substantial speed-ups over its classical counterpart for certain problems. However, the greatest impediment to realizing its full potential is noise that is inherent to these systems. The widely accepted solution to this challenge is the implementation of fault-tolerant quantum circuits, which is out of reach for current processors. Here we report experiments on a noisy 127-qubit processor and demonstrate the measurement of accurate expectation values for circuit volumes at a scale beyond brute-force classical computation. We argue that this represents evidence for the utility of quantum computing in a pre-fault-tolerant era. These experimental results are enabled by advances in the coherence and calibration of a superconducting processor at this scale and the ability to characterize 1 and controllably manipulate noise across such a large device. We establish the accuracy of the measured expectation values by comparing them with the output of exactly verifiable circuits. In the regime of strong entanglement, the quantum computer provides correct results for which leading classical approximations such as pure-state-based 1D (matrix product states, MPS) and 2D (isometric tensor network states, isoTNS) tensor network methods 2,3 break down. These experiments demonstrate a foundational tool for the realization of near-term quantum applications 4,5 ."} | 75 | {"work_id": 4380627387, "title": "Evidence for the utility of quantum computing before fault tolerance", "abstract": "Abstract Quantum computing promises to offer substantial speed-ups over its classical counterpart for certain problems. However, the greatest impediment to realizing its full potential is noise that is inherent to these systems. The widely accepted solution to this challenge is the implementation of fault-tolerant quantum circuits, which is out of reach for current processors. Here we report experiments on a noisy 127-qubit processor and demonstrate the measurement of accurate expectation values for circuit volumes at a scale beyond brute-force classical computation. We argue that this represents evidence for the utility of quantum computing in a pre-fault-tolerant era. These experimental results are enabled by advances in the coherence and calibration of a superconducting processor at this scale and the ability to characterize 1 and controllably manipulate noise across such a large device. We establish the accuracy of the measured expectation values by comparing them with the output of exactly verifiable circuits. In the regime of strong entanglement, the quantum computer provides correct results for which leading classical approximations such as pure-state-based 1D (matrix product states, MPS) and 2D (isometric tensor network states, isoTNS) tensor network methods 2,3 break down. These experiments demonstrate a foundational tool for the realization of near-term quantum applications 4,5 ."} | ||
@@ -51,66 +77,40 @@ | |||||
| 51 | {"work_id": 7130515337, "title": "Artificial intelligence literacy and academic resilience in undergraduate nursing students: the mediating role of self-efficacy and artificial intelligence anxiety", "abstract": "BACKGROUND: Artificial intelligence is increasingly integrated into nursing education, making AI literacy a key competency for students. Academic resilience is also essential for coping with learning challenges. However, the mechanisms linking AI literacy to academic resilience remain unclear, particularly the roles of self-efficacy and AI anxiety. This study examines these associations and tests the mediating effects of self-efficacy and AI anxiety. METHODS: A cross-sectional study was conducted among 415 undergraduate nursing students from a university in northern China. AI literacy, academic resilience, self-efficacy and AI anxiety were assessed using validated scales. Statistical analyses included descriptive analysis, Pearson correlation and serial mediation testing using the PROCESS macro in SPSS with bootstrap sampling. RESULTS: (1) Academic resilience was significantly and positively correlated with AI literacy (r = 0.229, p < 0.01) and self-efficacy (r = 0.340, p < 0.01), and negatively correlated with AI anxiety (r = -0.426, p < 0.01). AI literacy was positively correlated with self-efficacy (r = 0.118, p < 0.05) and negatively correlated with AI anxiety (r = -0.143, p < 0.01). (2) AI literacy was positively associated with self-efficacy (\u03b2 = 0.118, p = 0.017) and was negatively associated with AI anxiety (\u03b2 = -0.143, p = 0.006). Self-efficacy positively was positively associated with academic resilience (\u03b2 = 0.340, p < 0.001), while AI anxiety was negatively associated with academic resilience (\u03b2 = -0.426, p < 0.001). (3) In the model of AI literacy \u2192 self-efficacy \u2192 AI anxiety \u2192 academic resilience, the total indirect effect was 0.055. The mediating effect of self-efficacy accounted for 36.4% of the total indirect effect (0.020), while AI anxiety accounted for 58.2% (0.032). The serial mediation effect of self-efficacy and AI anxiety contributed 5.4% (0.003) to the total indirect effect, which was statistically significant but small in magnitude. Overall, the mediation pattern supported partial (rather than full) mediation. CONCLUSION: AI literacy is is an important correlate of nursing students\u2019 academic resilience. Strengthening AI literacy, improving self-efficacy and reducing AI anxiety may be linked to better adaptation to AI-supported learning environments. CLINICAL TRIAL NUMBER: Not applicable."} | 77 | {"work_id": 7130515337, "title": "Artificial intelligence literacy and academic resilience in undergraduate nursing students: the mediating role of self-efficacy and artificial intelligence anxiety", "abstract": "BACKGROUND: Artificial intelligence is increasingly integrated into nursing education, making AI literacy a key competency for students. Academic resilience is also essential for coping with learning challenges. However, the mechanisms linking AI literacy to academic resilience remain unclear, particularly the roles of self-efficacy and AI anxiety. This study examines these associations and tests the mediating effects of self-efficacy and AI anxiety. METHODS: A cross-sectional study was conducted among 415 undergraduate nursing students from a university in northern China. AI literacy, academic resilience, self-efficacy and AI anxiety were assessed using validated scales. Statistical analyses included descriptive analysis, Pearson correlation and serial mediation testing using the PROCESS macro in SPSS with bootstrap sampling. RESULTS: (1) Academic resilience was significantly and positively correlated with AI literacy (r = 0.229, p < 0.01) and self-efficacy (r = 0.340, p < 0.01), and negatively correlated with AI anxiety (r = -0.426, p < 0.01). AI literacy was positively correlated with self-efficacy (r = 0.118, p < 0.05) and negatively correlated with AI anxiety (r = -0.143, p < 0.01). (2) AI literacy was positively associated with self-efficacy (\u03b2 = 0.118, p = 0.017) and was negatively associated with AI anxiety (\u03b2 = -0.143, p = 0.006). Self-efficacy positively was positively associated with academic resilience (\u03b2 = 0.340, p < 0.001), while AI anxiety was negatively associated with academic resilience (\u03b2 = -0.426, p < 0.001). (3) In the model of AI literacy \u2192 self-efficacy \u2192 AI anxiety \u2192 academic resilience, the total indirect effect was 0.055. The mediating effect of self-efficacy accounted for 36.4% of the total indirect effect (0.020), while AI anxiety accounted for 58.2% (0.032). The serial mediation effect of self-efficacy and AI anxiety contributed 5.4% (0.003) to the total indirect effect, which was statistically significant but small in magnitude. Overall, the mediation pattern supported partial (rather than full) mediation. CONCLUSION: AI literacy is is an important correlate of nursing students\u2019 academic resilience. Strengthening AI literacy, improving self-efficacy and reducing AI anxiety may be linked to better adaptation to AI-supported learning environments. CLINICAL TRIAL NUMBER: Not applicable."} | ||
| 52 | {"work_id": 4407614581, "title": "Examining Teaching Competencies and Challenges While Integrating Artificial Intelligence in Higher Education", "abstract": "Abstract The rapid development of artificial intelligence (AI) technologies has demonstrated their affordances and limitations in revolutionizing pedagogical strategies in higher education. Given the lack of guidelines, policies, and resources to assist instructors in efficiently and ethically integrating AI into teaching and learning practices, this systematic review aimed to investigate AI integration competencies and challenges in higher education from the intelligent Technological Pedagogical Content Knowledge (TPACK) perspective. We first applied the Preferred Reporting Items for Systematic Reviews and Meta-Analyses (PRISMA) to identify 23 studies published between 2019 and 2023 that met the inclusion and exclusion criteria. After conducting open coding and thematic analysis, the research findings showed four AI integration competencies and strategies, including 1) AI literacy and readiness as intelligent technological knowledge, 2) AI-supported innovative pedagogy to supplement instructor social presence and transform the instructor-student relationship, 3) AI as intelligent learning partners to increase student engagement in self-regulated learning and higher-order thinking skills, and 4) AI-driven learning experience design and delivery. AI integration limitations and challenges contained: 1) the short-term novelty effect, 2) digital divides, 3) technical deficiencies, and 4) ethical concerns. Based on the implications for future practices, a diagram was developed to illustrate the systematic considerations to support the sustainability of AI-assisted teaching and learning in higher education."} | 78 | {"work_id": 4407614581, "title": "Examining Teaching Competencies and Challenges While Integrating Artificial Intelligence in Higher Education", "abstract": "Abstract The rapid development of artificial intelligence (AI) technologies has demonstrated their affordances and limitations in revolutionizing pedagogical strategies in higher education. Given the lack of guidelines, policies, and resources to assist instructors in efficiently and ethically integrating AI into teaching and learning practices, this systematic review aimed to investigate AI integration competencies and challenges in higher education from the intelligent Technological Pedagogical Content Knowledge (TPACK) perspective. We first applied the Preferred Reporting Items for Systematic Reviews and Meta-Analyses (PRISMA) to identify 23 studies published between 2019 and 2023 that met the inclusion and exclusion criteria. After conducting open coding and thematic analysis, the research findings showed four AI integration competencies and strategies, including 1) AI literacy and readiness as intelligent technological knowledge, 2) AI-supported innovative pedagogy to supplement instructor social presence and transform the instructor-student relationship, 3) AI as intelligent learning partners to increase student engagement in self-regulated learning and higher-order thinking skills, and 4) AI-driven learning experience design and delivery. AI integration limitations and challenges contained: 1) the short-term novelty effect, 2) digital divides, 3) technical deficiencies, and 4) ethical concerns. Based on the implications for future practices, a diagram was developed to illustrate the systematic considerations to support the sustainability of AI-assisted teaching and learning in higher education."} | ||
| 53 | {"work_id": 4394998532, "title": "PyTorch 2: Faster Machine Learning Through Dynamic Python Bytecode Transformation and Graph Compilation", "abstract": "This paper introduces two extensions to the popular PyTorch machine learning framework, TorchDynamo and TorchInductor, which implement the torch.compile feature released in PyTorch 2. TorchDynamo is a Python-level just-in-time (JIT) compiler that enables graph compilation in PyTorch programs without sacrificing the flexibility of Python. It achieves this by dynamically modifying Python bytecode before execution and extracting sequences of PyTorch operations into an FX graph, which is then JIT compiled using one of many extensible backends. TorchInductor is the default compiler backend for TorchDynamo, which translates PyTorch programs into OpenAI's Triton for GPUs and C++ for CPUs. Results show that TorchDynamo is able to capture graphs more robustly than prior approaches while adding minimal overhead, and TorchInductor is able to provide a 2.27\u00d7 inference and 1.41\u00d7 training geometric mean speedup on an NVIDIA A100 GPU across 180+ real-world models, which outperforms six other compilers. These extensions provide a new way to apply optimizations through compilers in eager mode frameworks like PyTorch."} | 79 | {"work_id": 4394998532, "title": "PyTorch 2: Faster Machine Learning Through Dynamic Python Bytecode Transformation and Graph Compilation", "abstract": "This paper introduces two extensions to the popular PyTorch machine learning framework, TorchDynamo and TorchInductor, which implement the torch.compile feature released in PyTorch 2. TorchDynamo is a Python-level just-in-time (JIT) compiler that enables graph compilation in PyTorch programs without sacrificing the flexibility of Python. It achieves this by dynamically modifying Python bytecode before execution and extracting sequences of PyTorch operations into an FX graph, which is then JIT compiled using one of many extensible backends. TorchInductor is the default compiler backend for TorchDynamo, which translates PyTorch programs into OpenAI's Triton for GPUs and C++ for CPUs. Results show that TorchDynamo is able to capture graphs more robustly than prior approaches while adding minimal overhead, and TorchInductor is able to provide a 2.27\u00d7 inference and 1.41\u00d7 training geometric mean speedup on an NVIDIA A100 GPU across 180+ real-world models, which outperforms six other compilers. These extensions provide a new way to apply optimizations through compilers in eager mode frameworks like PyTorch."} | ||
| 54 | −{"work_id": 7129076810, "title": "Dual Memristor-Coupled Unidirectional Ring Neural Network: Abundant Hidden Firings and Application in Hardware Image Encryption", "abstract": "Due to the fixed weights and simple topology of traditional unidirectional ring neural networks, it is challenging to generate complex firing dynamics. This paper introduces two threshold memristor models to mimic neuronal autapses, constructing a novel dual memristor-coupled unidirectional ring neural network (DMCURNN). Benefiting from the dual memristor-based autapse emulation, the DMCURNN enriches diverse hidden firing dynamics that are absent in conventional unidirectional ring neural networks, and the richness and complexity of these hidden firing dynamics are highly sensitive to the memristive coupling strengths. Numerical simulations indicate that the DMCURNN is able to generate various hidden firing activities, pattern transitions, homogeneous firing multistability of infinite coexisting homogeneous firing patterns and heterogeneous firing multistability of seven heterogeneous firing patterns. Furthermore, through adjusting the coupling parameters along with the external current intensity, the regulatory mechanisms of hidden firing patterns and their amplitude and frequency regulation are revealed. Subsequently, the hidden firing dynamics of this network are verified on an FPGA hardware platform. Finally, Using the hidden firing multistability characteristic of the DMCURNN, a novel bitstream-based hardware image encryption scheme with a dynamic key update mechanism is designed. Performance evaluations demonstrate that the proposed scheme exhibits exceptional robustness and high efficiency for IoT security applications."} | 80 | +{"work_id": 2807211499, "title": "Towards Efficient and Flexible Object Storage Using Resource and Functional Partitioning", "abstract": "Modern storage systems are designed to manage data without considering the dynamicity of user or resource requirements. This design approach does not consider the complexities of the dynamically changing runtime application behaviors as well as the unique features of underlying resources. To this end, this dissertation studies how resource and functional partitioning strategies can improve efficiency and flexibility of object stores. This dissertation presents a series of practical and efficient techniques, algorithms, and optimizations to realize efficient and flexible object stores. The experimental evaluation demonstrates the effectiveness of our design choices and strategies to make object stores flexible and resource-aware."} | ||
| 55 | {"work_id": 2952332632, "title": "Towards a Reliable and Context-Based System Architecture for Autonomous Vehicles", "abstract": "Full vehicle autonomy excludes a takeover by passengers in case a safety-critical application fails. Therefore, the system responsible for operating the autonomous vehicle has to detect and handle failures autonomously. Moreover, this system has to ensure the safety of the passengers, as well as the safety of other road users at any given time. Especially in the initial phase of autonomous vehicles, building up consumer confidence is essential. Therefore, in this regard, handling all failures by simply performing an emergency stop is not desirable. In this paper, we introduce an approach enabling a dynamic and safe reconfiguration of the autonomous driving system to handle occurring hardware and software failures. Since the requirements concerning safe reconfiguration actions are significantly affected by the current context the car is experiencing, the developed reconfiguration approach is sensitive to context changes. Our approach defines three interconnected layers, which are distinguished by their level of awareness. The top layer, referred to as the context layer, is responsible for observing the context. These context observations, in turn, imply a set of requirements, which constitute the input for the reconfiguration layer. The latter layer is required to determine reconfiguration actions, which are then executed by the architecture layer."} | 81 | {"work_id": 2952332632, "title": "Towards a Reliable and Context-Based System Architecture for Autonomous Vehicles", "abstract": "Full vehicle autonomy excludes a takeover by passengers in case a safety-critical application fails. Therefore, the system responsible for operating the autonomous vehicle has to detect and handle failures autonomously. Moreover, this system has to ensure the safety of the passengers, as well as the safety of other road users at any given time. Especially in the initial phase of autonomous vehicles, building up consumer confidence is essential. Therefore, in this regard, handling all failures by simply performing an emergency stop is not desirable. In this paper, we introduce an approach enabling a dynamic and safe reconfiguration of the autonomous driving system to handle occurring hardware and software failures. Since the requirements concerning safe reconfiguration actions are significantly affected by the current context the car is experiencing, the developed reconfiguration approach is sensitive to context changes. Our approach defines three interconnected layers, which are distinguished by their level of awareness. The top layer, referred to as the context layer, is responsible for observing the context. These context observations, in turn, imply a set of requirements, which constitute the input for the reconfiguration layer. The latter layer is required to determine reconfiguration actions, which are then executed by the architecture layer."} | ||
| 82 | +{"work_id": 2798337732, "title": "Reducing DRAM footprint with NVM in Facebook", "abstract": "Popular SSD-based key-value stores consume a large amount of DRAM in order to provide high-performance database operations. However, DRAM can be expensive for data center providers, especially given recent global supply shortages that have resulted in increasing DRAM costs. In this work, we design a key-value store, MyNVM, which leverages an NVM block device to reduce DRAM usage, and to reduce the total cost of ownership, while providing comparable latency and queries-per-second (QPS) as MyRocks on a server with a much larger amount of DRAM. Replacing DRAM with NVM introduces several challenges. In particular, NVM has limited read bandwidth, and it wears out quickly under a high write bandwidth."} | ||||
| 83 | +{"work_id": 3121141908, "title": "An optical neural chip for implementing complex-valued neural network", "abstract": "Complex-valued neural networks have many advantages over their real-valued counterparts. Conventional digital electronic computing platforms are incapable of executing truly complex-valued representations and operations. In contrast, optical computing platforms that encode information in both phase and magnitude can execute complex arithmetic by optical interference, offering significantly enhanced computational speed and energy efficiency. However, to date, most demonstrations of optical neural networks still only utilize conventional real-valued frameworks that are designed for digital computers, forfeiting many of the advantages of optical computing such as efficient complex-valued operations. In this article, we highlight an optical neural chip (ONC) that implements truly complex-valued neural networks. We benchmark the performance of our complex-valued ONC in four settings: simple Boolean tasks, species classification of an Iris dataset, classifying nonlinear datasets (Circle and Spiral), and handwriting recognition. Strong learning capabilities (i.e., high accuracy, fast convergence and the capability to construct nonlinear decision boundaries) are achieved by our complex-valued ONC compared to its real-valued counterpart."} | ||||
| 56 | {"work_id": 4405183524, "title": "Quantum error correction below the surface code threshold", "abstract": "Quantum error correction [1, 2, 3, 4] provides a path to reach practical quantum computing by combining multiple physical qubits into a logical qubit, where the logical error rate is suppressed exponentially as more qubits are added. However, this exponential suppression only occurs if the physical error rate is below a critical threshold. Here, we present two below-threshold surface code memories on our newest generation of superconducting processors, Willow: a distance-7 code, and a distance-5 code integrated with a real-time decoder. The logical error rate of our larger quantum memory is suppressed by a factor of $$\\varLambda \\mathrm{=2.14}\\pm 0.02$$ when increasing the code distance by two, culminating in a 101-qubit distance-7 code with 0.143% \u00b1 0.003% error per cycle of error correction. This logical memory is also beyond break-even, exceeding its best physical qubit\u2019s lifetime by a factor of $$2.4\\pm 0.3$$ . Our system maintains below-threshold performance when decoding in real time, achieving an average decoder latency of 63 \u03bcs at distance-5 up to a million cycles, with a cycle time of 1.1 \u03bcs. We also run repetition codes up to distance-29 and find that logical performance is limited by rare correlated error events occurring approximately once every hour, or $$3$$ $$\\times $$ $${10}^{9}$$ cycles. Our results present device performance that, if scaled, could realize the operational requirements of large scale fault-tolerant quantum algorithms."} | 84 | {"work_id": 4405183524, "title": "Quantum error correction below the surface code threshold", "abstract": "Quantum error correction [1, 2, 3, 4] provides a path to reach practical quantum computing by combining multiple physical qubits into a logical qubit, where the logical error rate is suppressed exponentially as more qubits are added. However, this exponential suppression only occurs if the physical error rate is below a critical threshold. Here, we present two below-threshold surface code memories on our newest generation of superconducting processors, Willow: a distance-7 code, and a distance-5 code integrated with a real-time decoder. The logical error rate of our larger quantum memory is suppressed by a factor of $$\\varLambda \\mathrm{=2.14}\\pm 0.02$$ when increasing the code distance by two, culminating in a 101-qubit distance-7 code with 0.143% \u00b1 0.003% error per cycle of error correction. This logical memory is also beyond break-even, exceeding its best physical qubit\u2019s lifetime by a factor of $$2.4\\pm 0.3$$ . Our system maintains below-threshold performance when decoding in real time, achieving an average decoder latency of 63 \u03bcs at distance-5 up to a million cycles, with a cycle time of 1.1 \u03bcs. We also run repetition codes up to distance-29 and find that logical performance is limited by rare correlated error events occurring approximately once every hour, or $$3$$ $$\\times $$ $${10}^{9}$$ cycles. Our results present device performance that, if scaled, could realize the operational requirements of large scale fault-tolerant quantum algorithms."} | ||
| 57 | {"work_id": 3182301081, "title": "Zico: Efficient {GPU} Memory Sharing for Concurrent {DNN} Training", "abstract": "GPUs are the workhorse in modern server infrastructure fueling advances in a number of compute-intensive workloads such as deep neural network (DNN) training. Several recent works propose solutions on sharing GPU resources across multiple concurrent DNN training jobs, but none of them address rapidly increasing memory footprint introduced by such job co-locations, which greatly limit the effectiveness of sharing GPU resources. In this paper, we present Zico, the first DNN system that aims at reducing the system-wide memory consumption for concurrent training. Zico keeps track of the memory usage pattern of individual training job by monitoring its progress on GPU computations and makes memory reclaimed from the job globally sharable. Based on this memory management scheme, Zico automatically decides a strategy to share memory among concurrent jobs with minimum delay on training while not exceeding a given memory budget such as GPU memory capacity. Our evaluation shows that Zico outperforms existing GPU sharing approaches and delivers benefits over a variety of job co-location scenarios."} | 85 | {"work_id": 3182301081, "title": "Zico: Efficient {GPU} Memory Sharing for Concurrent {DNN} Training", "abstract": "GPUs are the workhorse in modern server infrastructure fueling advances in a number of compute-intensive workloads such as deep neural network (DNN) training. Several recent works propose solutions on sharing GPU resources across multiple concurrent DNN training jobs, but none of them address rapidly increasing memory footprint introduced by such job co-locations, which greatly limit the effectiveness of sharing GPU resources. In this paper, we present Zico, the first DNN system that aims at reducing the system-wide memory consumption for concurrent training. Zico keeps track of the memory usage pattern of individual training job by monitoring its progress on GPU computations and makes memory reclaimed from the job globally sharable. Based on this memory management scheme, Zico automatically decides a strategy to share memory among concurrent jobs with minimum delay on training while not exceeding a given memory budget such as GPU memory capacity. Our evaluation shows that Zico outperforms existing GPU sharing approaches and delivers benefits over a variety of job co-location scenarios."} | ||
| 58 | {"work_id": 7128511721, "title": "A Memristor-Based Neural Network Circuit With Classical Conditioning and Fear Generalization", "abstract": "The new generation of artificial intelligence (AI) is evolving from perception-oriented processing toward cognition-oriented intelligence, emphasizing learning, memory, decision-making, and adaptive behavior inspired by the human brain. In this paper, a memristor-based perceptual decision-making neural network circuit (PDNNC) is proposed to integrate multiple classical conditioning mechanisms and fear generalization within a unified hardware framework. Unlike existing studies that focus on isolated learning behaviors, the proposed circuit architecture simultaneously realizes associative learning, forgetting, latent inhibition, blocking effects, secondary conditioning, and emotion-modulated decision-making at the circuit level. A voltage-controlled threshold-type memristor model is employed to emulate synaptic plasticity, while modular perceptual and decision-making subcircuits are designed to ensure scalability and functional consistency. The complete circuit implementation is verified using PSPICE circuit simulations. Simulation results demonstrate the correct realization of diverse classical conditioning behaviors, controllable fear generalization, and adaptive decision responses under different perceptual stimuli. The proposed bio-inspired circuit has vast potential applications in realizing cognitive intelligence and robotics."} | 86 | {"work_id": 7128511721, "title": "A Memristor-Based Neural Network Circuit With Classical Conditioning and Fear Generalization", "abstract": "The new generation of artificial intelligence (AI) is evolving from perception-oriented processing toward cognition-oriented intelligence, emphasizing learning, memory, decision-making, and adaptive behavior inspired by the human brain. In this paper, a memristor-based perceptual decision-making neural network circuit (PDNNC) is proposed to integrate multiple classical conditioning mechanisms and fear generalization within a unified hardware framework. Unlike existing studies that focus on isolated learning behaviors, the proposed circuit architecture simultaneously realizes associative learning, forgetting, latent inhibition, blocking effects, secondary conditioning, and emotion-modulated decision-making at the circuit level. A voltage-controlled threshold-type memristor model is employed to emulate synaptic plasticity, while modular perceptual and decision-making subcircuits are designed to ensure scalability and functional consistency. The complete circuit implementation is verified using PSPICE circuit simulations. Simulation results demonstrate the correct realization of diverse classical conditioning behaviors, controllable fear generalization, and adaptive decision responses under different perceptual stimuli. The proposed bio-inspired circuit has vast potential applications in realizing cognitive intelligence and robotics."} | ||
| 59 | {"work_id": 4297813615, "title": "DeepTrust^RT: Confidential Deep Neural Inference Meets Real-Time!", "abstract": "Deep Neural Networks (DNNs) are becoming common in \"learning-enabled\" time-critical applications such as autonomous driving and robotics. One approach to protect DNN inference from adversarial actions and preserve model privacy/confidentiality is to execute them within trusted enclaves available in modern processors. However, running DNN inference inside limited-capacity enclaves while ensuring timing guarantees is challenging due to (a) large size of DNN workloads and (b) extra switching between \"normal\" and \"trusted\" execution modes. This paper introduces new time-aware scheduling schemes - DeepTrust^RT - to securely execute deep neural inferences for learning-enabled real-time systems. We first propose a variant of EDF (called DeepTrust^RT-LW) that slices each DNN layer and runs them sequentially in the enclave. However, due to extra context switch overheads of individual layer slices, we further introduce a novel layer fusion technique (named DeepTrust^RT-FUSION). Our proposed scheme provides hard real-time guarantees by fusing multiple layers of DNN workload from multiple tasks; thus allowing them to fit and run concurrently within the enclaves while maintaining real-time guarantees. We implemented and tested DeepTrust^RT ideas on the Raspberry Pi platform running OP-TEE+DarkNet-TZ DNN APIs and three DNN workloads (AlexNet-squeezed, Tiny Darknet, YOLOv3-tiny). Compared to the layer-wise partitioning approach (DeepTrust^RT-LW), DeepTrust^RT-FUSION can schedule up to 3x more tasksets and reduce context switches by up to 11.12x. We further demonstrate the efficacy of DeepTrust^RT using a flight controller (ArduPilot) case study and find that DeepTrust^RT-FUSION retains real-time guarantees where DeepTrust^RT-LW becomes unschedulable."} | 87 | {"work_id": 4297813615, "title": "DeepTrust^RT: Confidential Deep Neural Inference Meets Real-Time!", "abstract": "Deep Neural Networks (DNNs) are becoming common in \"learning-enabled\" time-critical applications such as autonomous driving and robotics. One approach to protect DNN inference from adversarial actions and preserve model privacy/confidentiality is to execute them within trusted enclaves available in modern processors. However, running DNN inference inside limited-capacity enclaves while ensuring timing guarantees is challenging due to (a) large size of DNN workloads and (b) extra switching between \"normal\" and \"trusted\" execution modes. This paper introduces new time-aware scheduling schemes - DeepTrust^RT - to securely execute deep neural inferences for learning-enabled real-time systems. We first propose a variant of EDF (called DeepTrust^RT-LW) that slices each DNN layer and runs them sequentially in the enclave. However, due to extra context switch overheads of individual layer slices, we further introduce a novel layer fusion technique (named DeepTrust^RT-FUSION). Our proposed scheme provides hard real-time guarantees by fusing multiple layers of DNN workload from multiple tasks; thus allowing them to fit and run concurrently within the enclaves while maintaining real-time guarantees. We implemented and tested DeepTrust^RT ideas on the Raspberry Pi platform running OP-TEE+DarkNet-TZ DNN APIs and three DNN workloads (AlexNet-squeezed, Tiny Darknet, YOLOv3-tiny). Compared to the layer-wise partitioning approach (DeepTrust^RT-LW), DeepTrust^RT-FUSION can schedule up to 3x more tasksets and reduce context switches by up to 11.12x. We further demonstrate the efficacy of DeepTrust^RT using a flight controller (ArduPilot) case study and find that DeepTrust^RT-FUSION retains real-time guarantees where DeepTrust^RT-LW becomes unschedulable."} | ||
| 60 | {"work_id": 4396986598, "title": "Quantum computing with Qiskit", "abstract": "We describe Qiskit, a software development kit for quantum information science. We discuss the key design decisions that have shaped its development, and examine the software architecture and its core components. We demonstrate an end-to-end workflow for solving a problem in condensed matter physics on a quantum computer that serves to highlight some of Qiskit's capabilities, for example the representation and optimization of circuits at various abstraction levels, its scalability and retargetability to new gates, and the use of quantum-classical computations via dynamic circuits. Lastly, we discuss some of the ecosystem of tools and plugins that extend Qiskit for various tasks, and the future ahead."} | 88 | {"work_id": 4396986598, "title": "Quantum computing with Qiskit", "abstract": "We describe Qiskit, a software development kit for quantum information science. We discuss the key design decisions that have shaped its development, and examine the software architecture and its core components. We demonstrate an end-to-end workflow for solving a problem in condensed matter physics on a quantum computer that serves to highlight some of Qiskit's capabilities, for example the representation and optimization of circuits at various abstraction levels, its scalability and retargetability to new gates, and the use of quantum-classical computations via dynamic circuits. Lastly, we discuss some of the ecosystem of tools and plugins that extend Qiskit for various tasks, and the future ahead."} | ||
| 61 | −{"work_id": 4409568286, "title": "A Survey on Deep Learning Hardware Accelerators for Heterogeneous HPC Platforms", "abstract": "Recent trends in deep learning (DL) have made hardware accelerators essential for various high-performance computing (HPC) applications, including image classification, computer vision, and speech recognition. This survey summarizes and classifies the most recent developments in DL accelerators, focusing on their role in meeting the performance demands of HPC applications. We explore cutting-edge approaches to DL acceleration, covering not only GPU- and TPU-based platforms but also specialized hardware such as FPGA- and ASIC-based accelerators, Neural Processing Units, open hardware RISC-V-based accelerators, and co-processors. This survey also describes accelerators leveraging emerging memory technologies and computing paradigms, including 3D-stacked Processor-In-Memory, non-volatile memories like Resistive RAM and Phase Change Memories used for in-memory computing, as well as Neuromorphic Processing Units, and Multi-Chip Module-based accelerators. Furthermore, we provide insights into emerging quantum-based accelerators and photonics. Finally, this survey categorizes the most influential architectures and technologies from recent years, offering readers a comprehensive perspective on the rapidly evolving field of deep learning acceleration."} | ||||
| 62 | {"work_id": 2156094048, "title": "Reverend Bayes on Inference Engines: A Distributed Hierarchical Approach", "abstract": "This paper presents generalizations of Bayes likelihood-ratio updating rule which facilitate an asynchronous propagation of the impacts of new beliefs and/or new evidence in hierarchically organized inference structures with multi-hypotheses variables. The computational scheme proposed specifies a set of belief parameters, communication messages and updating rules which guarantee that the diffusion of updated beliefs is accomplished in a single pass and complies with the tenets of Bayes calculus."} | 89 | {"work_id": 2156094048, "title": "Reverend Bayes on Inference Engines: A Distributed Hierarchical Approach", "abstract": "This paper presents generalizations of Bayes likelihood-ratio updating rule which facilitate an asynchronous propagation of the impacts of new beliefs and/or new evidence in hierarchically organized inference structures with multi-hypotheses variables. The computational scheme proposed specifies a set of belief parameters, communication messages and updating rules which guarantee that the diffusion of updated beliefs is accomplished in a single pass and complies with the tenets of Bayes calculus."} | ||
| 63 | −{"work_id": 1521266393, "title": "Circuit quantum electrodynamics", "abstract": "This review surveys the development over the last 15 years of circuit quantum electrodynamics, the nonlinear quantum optics of microwave electrical circuits. In analogy to cavity quantum electrodynamics, lasers are replaced by rf signal generators, optical cavities by superconducting resonators, and atoms by superconducting qubits. Circuit QED offers enhanced light-matter coupling in which strong quantum optical nonlinearities are observable at the level of individual photons. This new parameter regime leads to unique capabilities for fundamental studies in quantum optics, nearly ideal quantum-limited measurements, and quantum computation."} | 90 | +{"work_id": 4295093682, "title": "fast16 as a Second-Order Subversion Attack", "abstract": "SentinelOne's April 2026 disclosure of fast16, a precision sabotage framework compiled in August 2005, predates Stuxnet by five years and corrupts floating-point calculations in engineering simulation software via kernel-mode filesystem filtering. The infosec community described the mechanism accurately but did not classify the attack class. This paper applies the nth-order attackframework from Bilar (NATO CCDCOE, 2009) and argues fast16 is a second-order subversion attack: the high-precision research end system is reached through two successive ancillary systems, the OS kernel filesystem stack and the engineering simulation software above it. The wormlet is a delivery mechanism, not a distinct ancillary hop. fast16 is structurally comparable to Thompson's compiler trojan but one order lower and more covert: it operates at runtime below the application layer with no source-level or on-disk trace, defeating the reproducible-build defense that catches Thompson. Stuxnet, dr0wned, and FLAW3D are mapped at the same second order in different substrates, showing the taxonomy holds across software and physical manufacturing pipelines. The classification yields concrete defenses (hardware-rooted driver attestation, diverse independent toolchains across validation hosts, air-gapped reference baselines) that follow from the framework rather than the incident report.Companion to Bilar (2026), \"Volt Typhoon as Operational Realization of the nth-Order Bleeding Thesis\" (Zenodo 19739954)."} | ||
| 64 | −{"work_id": 7138433923, "title": "TokenPowerBench: Benchmarking the Power Consumption of LLM Inference", "abstract": "Large language model (LLM) services now answer billions of queries per day, and industry reports show that inference, not training, accounts for more than 90% of total power consumption. However, existing benchmarks focus on either training/fine-tuning or performance of inference and provide little support for power consumption measurement and analysis of inference. We introduce TokenPowerBench, the first lightweight and extensible benchmark designed for LLM-inference power consumption studies. The benchmark combines a declarative configuration interface covering model choice, prompt set, and inference engine, a measurement layer that captures GPU-, node-, and system-level power without specialized power meters, and a phase-aligned metrics pipeline that attributes energy to the prefill and decode stages of every request. These elements make it straightforward to explore the power consumed by an LLM inference run; furthermore, by varying batch size, context length, parallelism strategy and quantization, users can quickly assess how each setting affects joules per token and other energy-efficiency metrics. We evaluate TokenPowerBench on four of the most widely used model series (Llama, Falcon, Qwen, and Mistral). Our experiments cover from 1 billion parameters up to the frontier-scale Llama3-405B model. Furthermore, we release TokenPowerBench as open source to help users to measure power consumption, forecast operating expenses, and meet sustainability targets when deploying LLM services."} | 91 | +{"work_id": 4410153295, "title": "Bursting Firings in Memristive Hopfield Neural Network With Image Encryption and Hardware Implementation", "abstract": "By integrating memristors into a Hopfield neural network (HNN), a diverse range of dynamical behavior can be generated, which has significant implications for modeling and biomimetic applications of artificial neurons. However, research on the firing dynamics of HNNs remains relatively limited. In response, a memristive tri-neurons Hopfield neural network (MTN-HNN) was constructed, with the synapse of the second neuron replaced by the proposed memristor. A theoretical and experimental investigation of the dynamics of this neural network was conducted using general analytical tools, such as phase diagrams, Lyapunov exponents, bifurcation diagrams, and others. Experimental results indicate that the dynamics of the MTN-HNN is influenced by the internal parameters of the memristor, enabling the network to extend attractors in up to two directions and thereby form grid multi-scrolls. Notably, the MTN-HNN exhibits various firing modes, including periodic and chaotic bursting. Finally, an encryption scheme was proposed to demonstrate the potential of the MTN-HNN, and both the custom digital circuits and the encryption scheme were successfully implemented on a Field-Programmable Gate Array (FPGA)."} | ||
| 65 | −{"work_id": 2975712713, "title": "A generic communication scheduler for distributed DNN training acceleration", "abstract": "We present ByteScheduler, a generic communication scheduler for distributed DNN training acceleration. ByteScheduler is based on our principled analysis that partitioning and rearranging the tensor transmissions can result in optimal results in theory and good performance in real-world even with scheduling overhead. To make ByteScheduler work generally for various DNN training frameworks, we introduce a unified abstraction and a Dependency Proxy mechanism to enable communication scheduling without breaking the original dependencies in framework engines. We further introduce a Bayesian Optimization approach to auto-tune tensor partition size and other parameters for different training models under various networking conditions. ByteScheduler now supports TensorFlow, PyTorch, and MXNet without modifying their source code, and works well with both Parameter Server (PS) and all-reduce architectures for gradient synchronization, using either TCP or RDMA. Our experiments show that ByteScheduler accelerates training with all experimented system configurations and DNN models, by up to 196% (or 2.96X of original speed)."} | 92 | +{"work_id": 6922095860, "title": "Practical Mechanisms for Reducing Processor\u2013Memory Data Movement in Modern Workloads", "abstract": "Data movement between the memory system and computation units is one of the most critical challenges in designing high performance and energy-efficient computing systems. The high cost of data movement is forcing architects to rethink the fundamental design of computer systems. Recent advances in memory design enable the opportunity for architects to avoid unnecessary datamovement by performing processing-in-memory (PIM), also known as near-data processing (NDP). While PIM can allow many data-intensive applications to avoid moving data from memory to the CPU, it introduces new challenges for system architects and programmers. Our goal in this thesisis to make PIM effective and practical in conventional computing systems. Toward this end, this thesis presents three major directions: (1) examining the suitability of PIM across key workloads, (2) addressing major system challenges for adopting PIM in computing systems, and (3) redesigning applications aware of PIM capability. In line with these three major directions, we propose a seriesof practical mechanisms to reduce processor\u2013memory data movement in modern workloads: First, we comprehensively analyze the energy and performance impact of data movement for several widely-used Google consumer workloads. We find that PIM can significantly reduce datamovement for all of these workloads, by performing part of the computation close to memory. Each workload contains simple primitives and functions that contribute to a significant amount of the overall data movement. We investigate whether these primitives and functions are feasible to implement using PIM, given the limited area and power constraints of consumer devices. Our analysis shows that offloading these primitives to PIM logic, consisting of either simple cores or specialized accelerators, eliminates a large amount of data movement, and significantly reducestotal system energy execution time. Second, we address one of the key system challenges for communication with PIM logic by proposing an efficient cache coherence support for near-data accelerators (NDAs). We find that enforcing coherence with the rest of the system, which is already a major challenge for on-chip accelerators, becomes more difficult for NDAs. This is because (1) the cost of communication between NDAs and CPUs is high, and (2) NDA applications generate a large amount of off-chip datamovement. As a result, as we show in this work, existing coherence mechanisms eliminate most of the benefits of NDAs. Based on our observations, we propose CoNDA, a coherence mechanism that lets an NDA optimistically execute an NDA kernel, under the assumption that the NDA has all necessary coherence permissions. This optimistic execution allows CoNDA to gather information on the memory accesses performed by the NDA and by the rest of the system. CoNDA exploits this information to avoid performing unnecessary coherence requests, and thus, significantly reducesdata movement for coherence. We show that CoNDA significantly improves performance andreduces energy consumption compared to prior coherence mechanisms. Third, we propose a hardware\u2013software co-design approach aware of PIM for edge machinelearning (ML) accelerators to enable energy-efficient and high-performance inference execution. We analyze a commercial Edge TPU (tensor processing unit) using 24 Google edge neural network (NN) models (including CNNs, LSTMs, transducers, and RCNNs), and find that the accelerator suffers from three shortcomings, in terms of computational throughput, energy efficiency, andmemory access handling. We comprehensively study the characteristics of each NN layer in all of the Google edge models, and find that these shortcomings arise from the one-size-fits-all approach of the accelerator, as there is a high amount of heterogeneity in key layer characteristics both across different models and across different layers in the same model. To combat this inefficiency, we propose a new acceleration framework called Mensa. Mensa incorporates multiple heterogeneous ML edge accelerators (including both on-chip and near-data accelerators), each of which caters to the characteristics of a particular subset of models. At runtime, Mensa schedules each layer torun on the best-suited accelerator, accounting for both efficiency and inter-layer dependencies. We show that Mensa significantly improves inference energy and throughput, while reducing hardware cost and improving area efficiency over the Edge TPU and Eyeriss v2, two state-of-the-art edge ML accelerators. Lastly, we propose to redesign emerging modern hybrid databases to be aware of PIM capability, to enable real-time analysis. Hybrid transactional and analytical processing (HTAP) databasesystems can support real-time data analysis without the high costs of synchronizing across separate single-purpose databases. Unfortunately, for many applications that perform a high rate of data updates, state-of-the-art HTAP systems incur significant drops in transactional and/or analyticalthroughput compared to performing only transactions or only analytics in isolation, due to (1) data movement between the CPU and memory, (2) data update propagation, and (3) consistency costs. We propose Polynesia, a hardware\u2013software co-designed system for in-memory HTAP databases. Polynesia (1) divides the HTAP system into transactional and analytical processing islands, (2) implements custom algorithms and hardware to reduce the costs of update propagation and consistency, and (3) exploits processing-in-memory for the analytical islands to alleviate data movement. We show that Polynesia significantly outperforms three state-of-the-art HTAP systems and reduces energy consumption."} | ||
| 66 | −{"work_id": 7128293306, "title": "Neuromorphic photonic computing with an electro-optic analog memory", "abstract": "In neuromorphic photonic systems, device operations are typically governed by analog signals, necessitating digital-to-analog converters (DAC) and analog-to-digital converters (ADC). However, data movement between memory and these converters in conventional von Neumann architectures incur significant energy costs. We propose an analog electronic memory co-located with photonic computing units to eliminate repeated long-distance data movement. Here, we demonstrate a monolithically integrated neuromorphic photonic circuit with on-chip capacitive analog memory and evaluate its performance in machine learning for in situ training and inference using the MNIST dataset. Our analysis shows that integrating analog memory into a neuromorphic photonic architecture can achieve over 26 \u00d7 power savings compared to conventional SRAM-DAC architectures. Furthermore, maintaining a minimum analog memory retention-to-network-latency ratio of 100 maintains >90% inference accuracy, enabling leaky analog memories without substantial performance degradation. This approach reduces reliance on DACs, minimizes data movement, and offers a scalable pathway toward energy-efficient, high-speed neuromorphic photonic computing."} | 93 | +{"work_id": 4415057924, "title": "Electricity demand and grid impacts of AI data centers: Challenges and prospects", "abstract": "The rapid growth of artificial intelligence (AI) is driving an unprecedented increase in the electricity demand of AI data centers, raising emerging challenges for electric power grids. Understanding the characteristics of AI data center loads and their interactions with the grid is therefore critical for ensuring both reliable power system operation and sustainable AI development. This paper provides a comprehensive review and vision of this evolving landscape. Specifically, this paper (i) presents an overview of AI data center infrastructure and its key components, (ii) examines the key characteristics and patterns of electricity demand across the stages of model preparation, training, fine-tuning, and inference, (iii) analyzes the critical challenges that AI data center loads pose to power systems across three interrelated timescales, including long-term planning and interconnection, short-term operation and electricity markets, and real-time dynamics and stability, and (iv) discusses potential solutions from the perspectives of the grid, AI data centers, and AI end-users to address these challenges. By synthesizing current knowledge and outlining future directions, this review aims to guide research and development in support of the joint advancement of AI data centers and power systems toward reliable, efficient, and sustainable operation."} | ||
| 67 | −{"work_id": 2930508541, "title": "Cloud Programming Simplified: A Berkeley View on Serverless Computing", "abstract": "Serverless cloud computing handles virtually all the system administration operations needed to make it easier for programmers to use the cloud. It provides an interface that greatly simplifies cloud programming, and represents an evolution that parallels the transition from assembly language to high-level programming languages. This paper gives a quick history of cloud computing, including an accounting of the predictions of the 2009 Berkeley View of Cloud Computing paper, explains the motivation for serverless computing, describes applications that stretch the current limits of serverless, and then lists obstacles and research opportunities required for serverless computing to fulfill its full potential. Just as the 2009 paper identified challenges for the cloud and predicted they would be addressed and that cloud use would accelerate, we predict these issues are solvable and that serverless computing will grow to dominate the future of cloud computing."} | 94 | +{"work_id": 7131231908, "title": "Reconfigurable Multiscroll Memristive Neural Network With Application to Telemedicine Privacy Protection", "abstract": "Constructing memristive neural networks (MNNs) with multiscroll chaotic attractors helps advance both theoretical and applied research on neural networks. However, the existing models mainly utilize complex memristor models with polynomial functions, nested composite functions, and so on, to generate multiscroll chaotic attractors, which leads to increased model complexity and difficulties in on-demand adjustment. Hence, this article proposes a reconfigurable multiscroll MNN (RMMNN) that can yield different types of multiscroll chaotic attractors merely by altering the memristive parameters without modifying its model. Through numerical methods, the complex dynamics of the RMMNN in different cases are analyzed, such as parameter-controlled multiscroll chaotic attractors, adjustable multistability, and parameter-induced transitions of multistability. In addition, the reliability of the numerical analysis is verified via the hardware circuits. Moreover, to address the issues of image security and low quality in telemedicine, a bidirectional rotation medical image encryption scheme (BRMIES) is developed based on the good pseudorandom chaotic sequences generated by RMMNN. Performance analysis demonstrates that BRMIES can effectively protect medical image and robustly handle various potential adverse interferences within telemedicine process."} | ||
| 68 | −{"work_id": 3016932526, "title": "Q uantum ESPRESSO toward the exascale", "abstract": "Quantum ESPRESSO is an open-source distribution of computer codes for quantum-mechanical materials modeling, based on density-functional theory, pseudopotentials, and plane waves, and renowned for its performance on a wide range of hardware architectures, from laptops to massively parallel computers, as well as for the breadth of its applications. In this paper, we present a motivation and brief review of the ongoing effort to port Quantum ESPRESSO onto heterogeneous architectures based on hardware accelerators, which will overcome the energy constraints that are currently hindering the way toward exascale computing."} | 95 | +{"work_id": 4407217670, "title": "vAttention: Dynamic Memory Management for Serving LLMs without PagedAttention", "abstract": "PagedAttention is a popular approach for dynamic memory allocation in LLM serving systems. It enables on-demand allocation of GPU memory to mitigate KV cache fragmentation - a phenomenon that crippled the batch size (and consequently throughput) in prior systems. However, in trying to allocate physical memory at runtime, PagedAttention ends up changing the virtual memory layout of the KV cache from contiguous to non-contiguous. Such a design leads to non-trivial programming and performance overheads."} | ||
| 69 | −{"work_id": 4402694963, "title": "Optical neural networks: progress and challenges", "abstract": "Artificial intelligence has prevailed in all trades and professions due to the assistance of big data resources, advanced algorithms, and high-performance electronic hardware. However, conventional computing hardware is inefficient at implementing complex tasks, in large part because the memory and processor in its computing architecture are separated, performing insufficiently in computing speed and energy consumption. In recent years, optical neural networks (ONNs) have made a range of research progress in optical computing due to advantages such as sub-nanosecond latency, low heat dissipation, and high parallelism. ONNs are in prospect to provide support regarding computing speed and energy consumption for the further development of artificial intelligence with a novel computing paradigm. Herein, we first introduce the design method and principle of ONNs based on various optical elements. Then, we successively review the non-integrated ONNs consisting of volume optical components and the integrated ONNs composed of on-chip components. Finally, we summarize and discuss the computational density, nonlinearity, scalability, and practical applications of ONNs, and comment on the challenges and perspectives of the ONNs in the future development trends."} | ||||
| 70 | −{"work_id": 4321649614, "title": "Quantum-selected configuration interaction: Classical diagonalization of Hamiltonians in subspaces selected by quantum computers", "abstract": "We propose quantum-selected configuration interaction, a class of hybrid quantum-classical algorithms for calculating the ground- and excited-state energies of many-electron Hamiltonians on noisy quantum devices. Suppose that an approximate ground state can be prepared on a quantum computer either by variational quantum eigensolver or by some other method. Then, by sampling the state in the computational basis, which is hard for classical computation in general, one can identify the electron configurations that are important for reproducing the ground state. The Hamiltonian in the subspace spanned by those important configurations is diagonalized on classical computers to output the ground-state energy and the corresponding eigenvector. The excited-state energies can be obtained similarly. The result is robust against statistical and physical errors because the noisy quantum devices are used only to define the subspace, and the resulting ground-state energy strictly satisfies the variational principle even in the presence of such errors. The expectation values of various other operators can also be estimated for obtained eigenstates with no additional quantum cost, since the explicit eigenvectors in the subspaces are known. We verified our proposal by numerical simulations and demonstrated it on a quantum device for an eight-qubit molecular Hamiltonian. The proposed algorithms are potentially feasible to tackle some challenging molecules by exploiting quantum devices with several tens of qubits, assisted by high-performance classical computing resources for diagonalization."} | ||||
| 71 | −{"work_id": 4386978266, "title": "Accelerated Systems for Portable DNA Sequencing", "abstract": "The MinION is a revolutionary handheld DNA sequencer that is inexpensive, portable, and can perform real-time sequencing. MinION is increasingly used in Precision Medicine applications. However, the MinION lacks portable compute power. This thesis introduces two clinical applications of the MinION and identifies and solves performance bottlenecks through hardware and software solutions to enable portable microbial diagnostics. Finally, we discuss how our accelerated solutions will fit on a laptop with a GPU. More than 99% of DNA fragments in a typical human sample are non-target (human), which may be skipped in real-time using the MinION\u2019s Read Until feature. We analyze the performance of the Read Until pipeline in detecting target microbial species for targeted viral pathogen detection and microbiome abundance estimation. We find new sources of performance bottlenecks (basecaller in the classification of a fragment) that are not addressed by past genomics accelerators. While SquiggleFilter and DTWax are our solutions for targeted viral pathogen detection, RawMap is for untargeted microbiome analysis. We also discuss accelerating the bottleneck step in the DNA mapping software (Minimap2) used in all of MinION\u2019s sequencing workflows. For targeted virus detection, we discuss SquiggleFilter which is a portable and programmable hardware-software solution that directly analyzes MinION\u2019s raw squiggles and filters everything except target viral DNA fragments. SquiggleFilter avoids the expensive basecalling step and uses hardware-accelerated subsequence Dynamic Time Warping (sDTW). We show that our 14.3W 13.25mm2 accelerator has 274\u00d7 greater throughput and 3481\u00d7 lower latency than existing GPU-based solutions while consuming half the power. DTWax overcomes the on-chip memory limitations of SquiggleFilter by optimizing its high-accuracy sDTW algorithm for GPUs resulting in a \u223c1.92X sequencing speedup and \u223c3.64X compute speedup: costup. For the untargeted classification and analysis of microbiome, we discuss RawMap which is a machine-learning-based smart and efficient solution that reduces sequencing time and cost by \u223c24% and computing cost by \u223c22%. We also discuss how RawMap may be used as an alternative to the RT-PCR test for viral load quantification of SARS-CoV-2. Minimap2 is a software used in all MinION workflows. minimap2-accelerated (mm2-ax) is a heterogeneous design for sequence mapping where minimap2\u2019s bottleneck step is sped up on the GPU with bit-exact output. mm2-ax on an NVIDIA A100 GPU improves the bottleneck step (chaining) with 4.07 - 1.93X speedup: costup over a SIMD baseline. Finally, we envision a portable solution to microbial diagnostics with a laptop connected to the MinION. DTWax can perform targeted virus detection on the GPU and RawMap does untargeted microbiome classification on the CPU. Post-sequencing tasks like basecalling, alignment (using mm2-ax) and variant calling use the GPU."} | ||||
| 72 | −{"work_id": 2273211146, "title": "The multiprocessor real-time scheduling of general task systems", "abstract": "The recent emergence of multicore and related technologies in many commercial systems has increased the prevalence of multiprocessor architectures. Contemporaneously, real-time applications have become more complex and sophisticated in their behavior and interaction. Inevitably, these complex real-time applications will be deployed upon these multiprocessor platforms and require temporal analysis techniques to verify their correctness. However, most prior research in multiprocessor real-time scheduling has addressed the temporal analysis only of Liu and Layland task systems. The goal of this dissertation is to extend real-time scheduling theory for multiprocessor systems by developing temporal analysis techniques for more general task models such as the sporadic task model, the generalized multiframe task model, and the recurring real-time task model. The thesis of this dissertation is: Optimal online multiprocessor real-time scheduling algorithms for sporadic and more general task systems are impossible; however, efficient, online scheduling algorithms and associated feasibility and schedulability tests, with provably bounded deviation from any optimal test, exist. To support our thesis, this dissertation develops feasibility and schedulability tests for various multiprocessor scheduling paradigms. We consider three classes of multiprocessor scheduling based on whether a real-time job may migrate between processors: full-migration, restricted-migration, and partitioned. For all general task systems, we obtain feasibility tests for arbitrary real-time instances under the full-and restricted-migration paradigms. Despite the existence of tests for feasibility, we show that optimal online scheduling of sporadic and more general systems is impossible. Therefore, we focus on scheduling algorithms that have constant-factor approximation ratios in terms of an analysis technique known as resource augmentation. We develop schedulability tests for scheduling algorithms, earliest-deadline-first (edf) and deadline-monotonic (dm), under full-migration and partitioned scheduling paradigms. Feasibility and schedulability tests presented in this dissertation use the workload metrics of demand-based load and maximum job density and have provably bounded deviation from optimal in terms of resource augmentation. We show the demand-based load and maximum job density metrics may be exactly computed in pseudo-polynomial time for general task systems and approximated in polynomial time for sporadic task systems."} | ||||
| 73 | −{"work_id": 3174122836, "title": "Quantum Computing 40 Years Later", "abstract": "This chapter sketches the foundations of the subject, discussing salient features of quantum information, formulates a mathematical model of quantum computation and highlights some implications of the model. It reviews two particularly promising applications of quantum computing foreseen by Feynman, simulating the dynamics of complex quantum systems, and computing their static properties. The chapter explains the concept of quantum error correction, the basis of belief that quantum computers can be scaled up to large systems that solve very hard problems. Shor&s;s discovery, and its obvious implications for cryptanalysis, caused interest in quantum computing to skyrocket. Because of Shor&s;s algorithm, the public key cryptographic protocols the people use to protect privacy when they communicate over the Internet will become vulnerable to attacks by quantum computers in the future. Classical computers are especially bad at simulating quantum dynamics \u2013 that is, predicting how a highly entangled quantum state will change with time."} | ||||
| 74 | −{"work_id": 4407592994, "title": "Green Federated Learning: A New Era of Green Aware AI", "abstract": "The development of AI applications, especially in large-scale wireless networks, is growing exponentially, alongside the size and complexity of the architectures used. Particularly, machine learning is acknowledged as one of today\u2019s most energy-intensive computational applications, posing a significant challenge to the environmental sustainability of next-generation intelligent systems. Achieving environmental sustainability entails ensuring that every AI algorithm is designed with sustainability in mind, integrating green considerations from the architectural phase onwards. Recently, Federated Learning (FL), with its distributed nature, presents new opportunities to address this need. Hence, it is imperative to elucidate the potential and challenges stemming from recent FL advancements and their implications for sustainability. Moreover, it is crucial to furnish researchers, stakeholders, and interested parties with a roadmap to navigate and understand existing efforts and gaps in green-aware AI algorithms. This survey primarily aims to achieve this objective by identifying and analyzing over a hundred FL works and assessing their contributions to green-aware artificial intelligence for sustainable environments, with a specific focus on IoT research. It delves into current issues in green federated learning from an energy-efficient standpoint, discussing potential challenges and future prospects for green IoT application research."} | ||||
| 75 | −{"work_id": 4406650295, "title": "AWQ: Activation-aware Weight Quantization for On-Device LLM Compression and Acceleration", "abstract": "Large language models (LLMs) have transformed numerous AI applications. On-device LLM is becoming increasingly important: running LLMs locally on edge devices can reduce cloud computing costs and protect users' privacy. However, the astronomical model size and the limited hardware resources pose significant deployment challenges. To solve these issues, we propose Activation-aware Weight Quantization (AWQ) and TinyChat, an algorithm-system full-stack solution for efficient on-device LLM deployment. AWQ is a novel quantization method that identifies and protects salient weights based on activation distribution, significantly reducing model size while preserving performance. TinyChat, an optimized inference framework, translates AWQ's theoretical memory savings into practical speedups through techniques such as on-the-fly dequantization, SIMD-aware weight packing, and kernel fusion. Together, they enable 4x model size reduction and 3-4x acceleration across various edge platforms, from high-end desktop GPUs to resource-constrained IoT devices. This solution democratizes on-device LLM deployment, offering privacy-preserving, low-latency AI capabilities across a wide range of applications."} | ||||
| 76 | −{"work_id": 4213212652, "title": "Noisy intermediate-scale quantum algorithms", "abstract": "Noisy quantum computers can in principle perform reliable quantum computations, but truly scalable systems require noise levels lower than are presently achieved. Still, moderate-complexity computations can be performed. This review discusses what is possible in this ``noisy intermediate scale'' quantum (NISQ) era. Topic areas include the simulation of many-body physics and chemistry, combinatorial optimization, and machine learning. It is evident that the NISQ era has produced new paradigms for programming that will be built upon as quantum computers are further perfected."} | ||||
| 77 | −{"work_id": 7130516837, "title": "Gaussian-Function-Driven Chaotic Memristive Dynamics with Application to Image Encryption", "abstract": "This paper develops a Gaussian-function-driven chaotic memristive system in which the magnetic flux is characterized by a Gaussian function, distinguishing it from prevailing formulations that employ piecewise, polynomial, or weakly smooth nonlinearities. The proposed system exhibits the key fingerprints of memristive behavior, including pinched hysteresis loops, local activity and nonvolatility. Integrating the Gaussian function into Chua\u2019s circuit produces a multiscroll chaotic Gaussian memristive system, where the attractors emerge in an organized and predictable pattern, with their numbers and spatial distribution determined by the Gaussian kernel parameters. To demonstrate the applicability of the proposed chaotic system, an image encryption scheme exploits the chaotic sequences generated by this system and integrates adaptive Zigzag scrambling, DNA encoding and bit-plane cross-diffusion. Experimental results show that the scheme achieves uniform histograms, negligible pixel correlation, strong key sensitivity and high resistance to noise and differential attacks. The incorporation of Gaussian function enriches the framework of chaotic memristive systems and establishes a flexible and robust foundation for secure image encryption."} | ||||
| 78 | −{"work_id": 3046751266, "title": "Scalable molecular dynamics on CPU and GPU architectures with NAMD", "abstract": "NAMDis a molecular dynamics program designed for high-performance simulations of very large biological objects on CPU- and GPU-based architectures. NAMD offers scalable performance on petascale parallel supercomputers consisting of hundreds of thousands of cores, as well as on inexpensive commodity clusters commonly found in academic environments. It is written in C++ and leans on Charm++ parallel objects for optimal performance on low-latency architectures. NAMD is a versatile, multipurpose code that gathers state-of-the-art algorithms to carry out simulations in apt thermodynamic ensembles, using the widely popular CHARMM, AMBER, OPLS, and GROMOS biomolecular force fields. Here, we review the main features of NAMD that allow both equilibrium and enhanced-sampling molecular dynamics simulations with numerical efficiency. We describe the underlying concepts utilized by NAMD and their implementation, most notably for handling long-range electrostatics; controlling the temperature, pressure, and pH; applying external potentials on tailored grids; leveraging massively parallel resources in multiple-copy simulations; and hybrid quantum-mechanical/molecular-mechanical descriptions. We detail the variety of options offered by NAMD for enhanced-sampling simulations aimed at determining free-energy differences of either alchemical or geometrical transformations and outline their applicability to specific problems. Last, we discuss the roadmap for the development of NAMD and our current efforts toward achieving optimal performance on GPU-based architectures, for pushing back the limitations that have prevented biologically realistic billion-atom objects to be fruitfully simulated, and for making large-scale simulations less expensive and easier to set up, run, and analyze. NAMD is distributed free of charge with its source code at www.ks.uiuc.edu."} | ||||
| 79 | −{"work_id": 4403458785, "title": "Artificial intelligence in higher education: exploring faculty use, self-efficacy, distinct profiles, and professional development needs", "abstract": "Abstract Faculty perspectives on the use of artificial intelligence (AI) in higher education are crucial for AI\u2019s meaningful integration into teaching and learning, yet research is scarce. This paper presents a study designed to gain insight into faculty members\u2019 ( N = 122) AI self-efficacy and distinct latent profiles, perceived benefits, challenges, use, and professional development needs related to AI. The respondents saw greater equity in education as AI\u2019s greatest benefit, while students and faculty members\u2019 lack of AI literacy was among the greatest challenges, with the majority interested in professional development. Latent class analysis revealed four distinct faculty member profiles: optimistic, critical, critically reflected, and neutral. The optimistic profile moderates the relationship between self-efficacy and usage. The development of adequate support services is suggested for successful and sustainable digital transformation."} | ||||
| 80 | −{"work_id": 4308245305, "title": "Estimating the Carbon Footprint of BLOOM, a 176B Parameter Language Model", "abstract": "Progress in machine learning (ML) comes with a cost to the environment, given that training ML models requires significant computational resources, energy and materials. In the present article, we aim to quantify the carbon footprint of BLOOM, a 176-billion parameter language model, across its life cycle. We estimate that BLOOM's final training emitted approximately 24.7 tonnes of~\\carboneq~if we consider only the dynamic power consumption, and 50.5 tonnes if we account for all processes ranging from equipment manufacturing to energy-based operational consumption. We also study the energy requirements and carbon emissions of its deployment for inference via an API endpoint receiving user queries in real-time. We conclude with a discussion regarding the difficulty of precisely estimating the carbon footprint of ML models and future research directions that can contribute towards improving carbon emissions reporting."} | ||||
| 81 | −{"work_id": 1224547023, "title": "Model-Based Framework for Schedulability Analysis Using Uppaal 4.1", "abstract": "Embedded systems involve the monitoring and control of complex physical processes using applications running on dedicated execution platforms in a resource-constrained manner in terms of, for example, memory, processing power, bandwidth, energy consumption, and timing behavior."} | ||||
| 82 | −{"work_id": 4286840061, "title": "Algorithm-Architecture Co-Design for Domain-Specific Accelerators in Communication and Artificial Intelligence", "abstract": "The past decade has witnessed an explosive growth of data and the needs for high-speed data communications and processing. The needs continue to drive the development of new hardware for transmitting more data reliably and processing more data to obtain a higher level of intelligence. This thesis work explores algorithm-architecture co-design approach to derive efficient solutions for domain-specific communication and machine learning accelerators. It focuses on advanced and most compute-intensive accelerator designs for: 1) channel coding for data transmission, including polar codes and low-density parity-check (LDPC) codes, and 2) neural networks for machine learning, including differentiable neural computer (DNC) and neural ordinary differential equations (NODE). It also covers an interdisciplinary area of AI-aided communication, exploring DNC-aided flip decoding for polar codes. This work introduces a split-tree successive-cancellation list (SCL) decoder that works by dividing a polar code's decoding tree to sub-trees following a split-tree algorithm. Through algorithm-architecture co-optimizations, a 0.64mm2 40nm test chip implements a split-4, list-2, 8-frame-interleaved decoder that supports configurable code lengths up to 1024 bit and variable code rates. This work advances LDPC codes in two aspects: 1) we take the inspiration from simulated annealing to generalize the post-processor design using three methods: quenching, extended heating, and focused heating, each of which targets a different decoding error structure. The resulting post-processor is demonstrated to lower the error rate by two orders of magnitudes. 2) We also present a fully parallel decoder for a (160, 80) regular-(2, 4) NB-LDPC code over Galois field GF(64) in 65nm CMOS. The decoder employs fine-grained dynamic clock gating and decoder early termination to achieve a throughput of 1.22Gb/s and an energy efficiency of 3.03nJ/b. This work contributes to the hardware acceleration of DNC. We present HiMA, a tiled, history-based memory access engine with distributed memories in tiles. HiMA incorporates a traffic-aware multi-mode network-on-chip (NoC), an optimal submatrix-based memory partition and a two-stage usage sort method leveraging distributed tiles. We create a distributed DNC (DNC-D) to allow almost all memory operations to be applied to local memories. In a 40nm design, HiMA running DNC and DNC-D demonstrates 39.1x higher speed, 164.3x better area efficiency, and 61.2x better power efficiency over the state-of-the-art accelerators. This work contributes to the hardware acceleration of NODE for improved modeling capability of continuous-time events. We carry out algorithm-architecture co-design: 1) we propose adaptive neural activation sparsity for up to 80% complexity reduction while maintaining excellent training accuracy. 2) we develop a multi-mode PE design for NODE compute kernels with configurable interconnects between PEs to handle a variety of numerical ODE solvers. The hardware efficiency is further enhanced by exploring hardware reuse and hierarchical memory. Lastly, this work investigates an interdisciplinary area of AI-aided communication, applying DNC for flip decoding of polar codes. We develop new state and action encoding with a two-phase decoding flow. Simulation results show that proposed DNC-aided SCL-Flip (DNC-SCLF) decoding demonstrates up to 0.34dB coding gain improvement or 54.2% reduction in average number of decoding attempts compared to prior works. The five pieces of work presented in this thesis tackle hardware acceleration challenges in domain-specific computing using algorithm-architecture co-design techniques. The results of this work contribute to the developments of hardware accelerators in channel coding and deep learning, enabling next-generation communication and artificial intelligence from theory to efficient hardware."} | ||||
| 83 | −{"work_id": 7130433466, "title": "A Second-Order Memristor Method to Construct Memristive Neural Networks With Multi-Butterfly and Multi-Scroll Dynamics", "abstract": "Memristor-based Hopfield neural networks (MHNNs) exhibit rich chaotic dynamics and bear closer hardware resemblance to the biological brain, making them well suited for emulating neural dynamical behaviors. However, most existing MHNNs are constructed with first-order memristors. This paper proposes a novel second-order memristor (SOM) approach for constructing MHNNs with enriched chaotic dynamics. Specifically, a second-order memristor is incorporated into a three-neuron Hopfield neural network to emulate the magnetic coupling mechanism between neurons, thereby forming a second-order memristor-based neural network (SOM-HNN). Comprehensive dynamical analyses, including bifurcation diagrams, Lyapunov exponent spectra, and numerical simulations, confirm that the proposed SOM-HNN exhibits richer and more intricate chaos behaviors than its first-order counterparts. Remarkably, the proposed SOM-HNN can simultaneously generate butterfly and scroll attractors, multi-butterfly and multi-scroll attractors, as well as initial-boosed coexisting multi-butterfly and multi-scroll attractors, thereby substantially enhancing its dynamical diversity. To the best of our knowledge, this is the first report of both multi-butterfly and multi-scroll dynamics in a neural network. Furthermore, the SOM-HNN is implemented in hardware using analog circuits and a digital field-programmable gate array (FPGA) platform. Experimental results demonstrate the network\u2019s abundant dynamical features and its feasibility for efficient hardware realization in neuromorphic engineering applications."} | ||||
| 84 | −{"work_id": 7135102590, "title": "Biologically Plausible Memristive Decision-Making Circuit for Adaptive Control in Industrial Autonomous Navigation", "abstract": "In biological decision-making, adaptive behavior arises from the interaction between structured task context, expectation, action selection, and feedback-based learning. While most existing studies reproduce reward-driven responses under clear sensory stimuli, decision formation under weak or absent sensory evidence, such as low or 0% contrast conditions, remains insufficiently explored. To address this issue, this work proposes a biologically plausible memristive decision-making framework based on a block-structured task paradigm. The proposed system adopts a closed-loop architecture composed of four functional modules: stimulus, expectation, action, and reward/punishment. Sensory information is encoded when available, while the expectation pathway provides prior-guided modulation when sensory evidence becomes weak or unreliable. Action selection is generated through competitive integration, and reward\u2013punishment feedback dynamically corrects decision bias and reinforces appropriate responses. Through this hierarchical interaction, stable decision behavior can be achieved even in the absence of explicit sensory inputs. PSPICE simulations are conducted to analyze system dynamics and validate the corrective role of the reward\u2013punishment mechanism under weak and ambiguous conditions. In addition, the proposed framework is demonstrated in an industrial autonomous navigation scenario, illustrating its scalability and applicability for adaptive decision-making under uncertainty."} | ||||
| 85 | −{"work_id": 4394727812, "title": "Large-scale photonic chiplet Taichi empowers 160-TOPS/W artificial general intelligence", "abstract": "The pursuit of artificial general intelligence (AGI) continuously demands higher computing performance. Despite the superior processing speed and efficiency of integrated photonic circuits, their capacity and scalability are restricted by unavoidable errors, such that only simple tasks and shallow models are realized. To support modern AGIs, we designed Taichi-large-scale photonic chiplets based on an integrated diffractive-interference hybrid design and a general distributed computing architecture that has millions-of-neurons capability with 160-tera-operations per second per watt (TOPS/W) energy efficiency. Taichi experimentally achieved on-chip 1000-category-level classification (testing at 91.89% accuracy in the 1623-category Omniglot dataset) and high-fidelity artificial intelligence-generated content with up to two orders of magnitude of improvement in efficiency. Taichi paves the way for large-scale photonic computing and advanced tasks, further exploiting the flexibility and potential of photonics for modern AGI."} | ||||
| 86 | −{"work_id": 4385481791, "title": "Reducing the Carbon Impact of Generative AI Inference (today and in 2035)", "abstract": "Generative AI, exemplified in ChatGPT, Dall-E 2, and Stable Diffusion, are exciting new applications consuming growing quantities of computing. We study the compute, energy, and carbon impacts of generative AI inference. Using ChatGPT as an exemplar, we create a workload model and compare request direction approaches (Local, Balance, CarbonMin), assessing their power use and carbon impacts."} | ||||
| 87 | −{"work_id": 7135078329, "title": "Highly Reliable RRAM-Based Physical Unclonable Function With Auto-Write Technique", "abstract": "Physical unclonable functions (PUFs) have attracted significant attention for high-security applications, particularly in the Internet of Things (IoT). While resistive random access memory (RRAM)-based PUF technology offers excellent energy efficiency and integration density, its reliability remains a major challenge. This work proposes a highly reliable RRAM-based PUF that utilizes the 4T2R cross-coupled PUF cell to extract the response. Additionally, an automatic write-back technique is introduced to enhance the initial resistance mismatch in RRAM, thereby improving the PUF reliability. Experimental results demonstrate that the proposed PUF achieves outstanding performance, with near-ideal uniqueness (50.02%), uniformity (50.11%), and robust randomness (passing NIST 800-22 tests). The design exhibits robust reliability across a wide operating range (from$- 40~^{\\circ }$C to$120~^{\\circ }$C and 0.7 to 1.4 V), achieving a bit error rate (BER) of$\\lt 4.89\\times 10^{-7}$. Furthermore, the energy consumption per bit is optimized to 4.8 fJ at 1.1 V,$25~^{\\circ }$C, showing its suitability for energy-constrained applications."} | ||||
| 88 | −{"work_id": 2963840171, "title": "Information and Communications Technologies for Sustainable Development Goals: State-of-the-Art, Needs and Perspectives", "abstract": "In September 2015, the United Nations General Assembly accepted the 2030 Development Agenda, which has included 92 paragraphs, and the Paragraph 91 defined 17 sustainable development goals (SDGs) and 169 associated targets. The goal of this paper is to discover the correlations among SDGs and information and communications technologies (ICTs). This paper discusses the roles and opportunities that ICTs play in pursuing the SDGs. We identify a number of research gaps to those three pillars, social, economic, and environmental perspectives, of sustainable development. After extensive literature reviews on the SDG-related research initiatives and activities, we find that the majority of contributions to SDGs recognized by the IEEE and ACM research communities have mainly focused on the technical aspects while there are lack of the holistic social good perspectives. Therefore, there are essential and urgent needs to raise the awareness and call for attentions on how to innovate and energize ICTs in order to best assist all nations to achieve the SDGs by 2030."} | ||||
| 89 | −{"work_id": 4389373471, "title": "Logical quantum processor based on reconfigurable atom arrays", "abstract": "Abstract Suppressing errors is the central challenge for useful quantum computing 1 , requiring quantum error correction (QEC) 2\u20136 for large-scale processing. However, the overhead in the realization of error-corrected \u2018logical\u2019 qubits, in which information is encoded across many physical qubits for redundancy 2\u20134 , poses substantial challenges to large-scale logical quantum computing. Here we report the realization of a programmable quantum processor based on encoded logical qubits operating with up to 280 physical qubits. Using logical-level control and a zoned architecture in reconfigurable neutral-atom arrays 7 , our system combines high two-qubit gate fidelities 8 , arbitrary connectivity 7,9 , as well as fully programmable single-qubit rotations and mid-circuit readout 10\u201315 . Operating this logical processor with various types of encoding, we demonstrate improvement of a two-qubit logic gate by scaling surface-code 6 distance from d = 3 to d = 7, preparation of colour-code qubits with break-even fidelities 5 , fault-tolerant creation of logical Greenberger\u2013Horne\u2013Zeilinger (GHZ) states and feedforward entanglement teleportation, as well as operation of 40 colour-code qubits. Finally, using 3D [[8,3,2]] code blocks 16,17 , we realize computationally complex sampling circuits 18 with up to 48 logical qubits entangled with hypercube connectivity 19 with 228 logical two-qubit gates and 48 logical CCZ gates 20 . We find that this logical encoding substantially improves algorithmic performance with error detection, outperforming physical-qubit fidelities at both cross-entropy benchmarking and quantum simulations of fast scrambling 21,22 . These results herald the advent of early error-corrected quantum computation and chart a path towards large-scale logical processors."} | ||||
| 90 | −{"work_id": 2788945937, "title": "Classification with Quantum Neural Networks on Near Term Processors", "abstract": "We introduce a quantum neural network, QNN, that can represent labeled data, classical or quantum, and be trained by supervised learning. The quantum circuit consists of a sequence of parameter dependent unitary transformations which acts on an input quantum state. For binary classification a single Pauli operator is measured on a designated readout qubit. The measured output is the quantum neural network\u2019s predictor of the binary label of the input state. We show through classical simulation that parameters can be found that allow the QNN to learn to correctly distinguish the two data sets. We then discuss presenting the data as quantum superpositions of computational basis states corresponding to different label values. Here we show through simulation that learning is possible. We consider using our QNN to learn the label of a general quantum state. By example we show that this can be done. Our work is exploratory and relies on the classical simulation of small quantum systems. The QNN proposed here was designed with near-term quantum processors in mind. Therefore it will be possible to run this QNN on a near term gate model quantum computer where its power can be explored beyond what can be explored with simulation."} | ||||
| 91 | −{"work_id": 4386285839, "title": "Managing the Strategic Transformation of Higher Education through Artificial Intelligence", "abstract": "Considering the rapid advancements in artificial intelligence (AI) and their potential implications for the higher education sector, this article seeks to critically evaluate the strategic adoption of AI in the framework of \u201csmart universities\u201d. We envisage these innovative institutions as the imminent evolution in higher education, harnessing AI and quantum technologies to reshape academic and administrative processes. The core presumption is that through such integration, universities can achieve personalized learning trajectories, enhanced accessibility, economic efficiency, and a boost in overall operational performance. However, venturing into this new educational paradigm necessitates a thorough exploration of potential pitfalls, including questions surrounding educational quality, potential job losses, risks of bias, privacy breaches, and safety concerns. Our primary objective is to offer a balanced assessment to aid stakeholders in making informed strategic decisions about endorsing and advancing the smart university model. A pivotal factor in this discourse is the acceptance of qualifications from AI-enriched institutions by employers, a variable that may drastically redefine the education sector\u2019s trajectory. Within the context of a comprehensive analysis of its broader societal impact, this article also delves into the ramifications of AI-driven innovations for historically Black colleges and universities (HBCUs)."} | ||||
| 92 | −{"work_id": 3099878876, "title": "Array programming with NumPy", "abstract": "Abstract Array programming provides a powerful, compact and expressive syntax for accessing, manipulating and operating on data in vectors, matrices and higher-dimensional arrays. NumPy is the primary array programming library for the Python language. It has an essential role in research analysis pipelines in fields as diverse as physics, chemistry, astronomy, geoscience, biology, psychology, materials science, engineering, finance and economics. For example, in astronomy, NumPy was an important part of the software stack used in the discovery of gravitational waves1 and in the first imaging of a black hole2. Here we review how a few fundamental array concepts lead to a simple and powerful programming paradigm for organizing, exploring and analysing scientific data. NumPy is the foundation upon which the scientific Python ecosystem is constructed. It is so pervasive that several projects, targeting audiences with specialized needs, have developed their own NumPy-like interfaces and array objects. Owing to its central position in the ecosystem, NumPy increasingly acts as an interoperability layer between such array computation libraries and, together with its application programming interface (API), provides a flexible framework to support the next decade of scientific and industrial analysis."} | ||||
| 93 | −{"work_id": 4366587887, "title": "Promising Emerging Technologies for Teaching and Learning: Recent Developments and Future Challenges", "abstract": "As time goes on and the number of people who use information and communication technology (ICT) grows, emerging technologies are receiving a lot of attention from academics, researchers, and users. Emerging technologies are changing more quickly than ever, and it is important to start building skills early in education by using the right examples to teach and learn about digital citizenship. New pedagogies support individual teaching and learning methodologies for knowledge acquisition and self-directed learning. Hundreds of digital education tools have been developed to increase student autonomy, enhance academic process management, promote collaboration, and improve communication between teachers and students. This article examines the current state of emerging technologies from a variety of educational viewpoints, highlights a few of them, and discusses both their established and potential educational benefits. Additionally, it offers in-depth debates on recent developments and future challenges from a wide range of perspectives. The analysis focuses on peer-reviewed research articles published in well-renowned publications databases over the last 8 years, drawing upon a bibliometric analysis using VOSviewer. The results of this study are also anticipated to serve as a substantial impetus for other universities and colleges worldwide to utilize innovatively and revolutionized technology for better academic performance."} | ||||
| 94 | −{"work_id": 3092732687, "title": "PENGEMBANGAN SISTEM INFORMASI PENERIMAANMAHASISWA BARU DENGAN METODE BUSINESSPROCESS AUTOMATION (STUDI KASUS: INSTITUTTEKNOLOGI KALIMANTAN)", "abstract": "Institut Teknologi Kalimantan (ITK) merupakan salah satu perguruan tinggi negeri baru di Indonesia. Salah satu proses bisnis yang ada di ITK yaitu proses\r\npenerimaan mahasiswa baru, ITK sudah melakukan proses penerimaan mahasiswa baru sejak tahun 2012 sebanyak 100 mahasiswa, dan pada tahun 2018 ITK menerima kurang lebih 1000 mahasiswa. Hal ini menunjukkan adanya peningkatan penerimaan mahasiswa baru yang cukup signifikan. Pada proses penerimaan mahasiswa baru di ITK belum ada sistem informasi yangdapat memanajemen data\r\nmahasiswa baru tersebut dan saat ini terdapat proses pengumpulan dan verifikasi\r\nberkas yang masih dilakukan menggunakan email dimana terdapat beberapa kendala dalam penggunaan email tersebut. Oleh karena itu, dalam penelitian ini\r\ndilakukan pengembangkan sistem informasi penerimaan mahasiswa baru berbasis web, yang dapat diakses oleh mahasiswa baru, verifikatur, dan admin selama proses\r\npendaftaran ulang mahasiswa baru. Metode yang digunakan dalam penelitian ini adalah Business Proses Automation menggunakan tools ProcessMaker. ProcessMaker merupakan sebuah aplikasi open source yang berguna untuk memanajemen alur kerja Business Process Management (BPM) dan solusi perangkat lunak berbasis web. Penelitian ini menghasilkan sistem informasi penerimaan mahasiswa baru berbasis web, yang dapat memanajemen datamahasiswa baru. Terdapat 14 proses pendaftaran ulang mahasiswa baru dan rekapdata yang dibedakan untuk masing-masing program studi di ITK, kemudian ada 1 proses untuk menjalankan fungsi impor data users menggunakan file .csv. Sistem\r\ninformasi ini sudah mulai digunakan ITK dalam proses penerimaan mahasiswa baru\r\njalur Seleksi Nasional Masuk Perguruan Tinggi Negeri (SNMPTN) Tahun 2019."} | ||||
| 95 | −{"work_id": 25727798, "title": "The Lustre Storage Architecture", "abstract": "This lengthy document often referred to as the \"Lustre Book\", contains a detailed outline of Lustre file system architecture, as it was created between 2001 and 2005, in accordance with the requirements from various users. Now, in 2019, most features have been implemented, but some only recently, and some along different lines of thought."} | ||||
| 96 | −{"work_id": 2972087877, "title": "Demystifying Parallel and Distributed Deep Learning", "abstract": "Deep Neural Networks (DNNs) are becoming an important tool in modern computing applications. Accelerating their training is a major challenge and techniques range from distributed algorithms to low-level circuit design. In this survey, we describe the problem from a theoretical perspective, followed by approaches for its parallelization. We present trends in DNN architectures and the resulting implications on parallelization strategies. We then review and model the different types of concurrency in DNNs: from the single operator, through parallelism in network inference and training, to distributed deep learning. We discuss asynchronous stochastic optimization, distributed system architectures, communication schemes, and neural architecture search. Based on those approaches, we extrapolate potential directions for parallelism in deep learning."} | ||||
| 97 | −{"work_id": 4407158326, "title": "Distributed quantum computing across an optical network link", "abstract": "Abstract Distributed quantum computing (DQC) combines the computing power of multiple networked quantum processing modules, ideally enabling the execution of large quantum circuits without compromising performance or qubit connectivity 1,2 . Photonic networks are well suited as a versatile and reconfigurable interconnect layer for DQC; remote entanglement shared between matter qubits across the network enables all-to-all logical connectivity through quantum gate teleportation (QGT) 3,4 . For a scalable DQC architecture, the QGT implementation must be deterministic and repeatable; until now, no demonstration has satisfied these requirements. Here we experimentally demonstrate the distribution of quantum computations between two photonically interconnected trapped-ion modules. The modules, separated by about two metres, each contain dedicated network and circuit qubits. By using heralded remote entanglement between the network qubits, we deterministically teleport a controlled-Z (CZ) gate between two circuit qubits in separate modules, achieving 86% fidelity. We then execute Grover\u2019s search algorithm 5 \u2014to our knowledge, the first implementation of a distributed quantum algorithm comprising several non-local two-qubit gates\u2014and measure a 71% success rate. Furthermore, we implement distributed iSWAP and SWAP circuits, compiled with two and three instances of QGT, respectively, demonstrating the ability to distribute arbitrary two-qubit operations 6 . As photons can be interfaced with a variety of systems, the versatile DQC architecture demonstrated here provides a viable pathway towards large-scale quantum computing for a range of physical platforms."} | ||||
| 98 | −{"work_id": 3152809665, "title": "Nightcore: efficient and scalable serverless computing for latency-sensitive, interactive microservices", "abstract": "The microservice architecture is a popular software engineering approach for building flexible, large-scale online services. Serverless functions, or function as a service (FaaS), provide a simple programming model of stateless functions which are a natural substrate for implementing the stateless RPC handlers of microservices, as an alternative to containerized RPC servers. However, current serverless platforms have millisecond-scale runtime overheads, making them unable to meet the strict sub-millisecond latency targets required by existing interactive microservices."} | ||||
| 99 | −{"work_id": 4399913870, "title": "A review of green artificial intelligence: Towards a more sustainable future", "abstract": "Green artificial intelligence (AI) is more environmentally friendly and inclusive than conventional AI, as it not only produces accurate results without increasing the computational cost but also ensures that any researcher with a laptop can perform high-quality research without the need for costly cloud servers. This paper discusses green AI as a pivotal approach to enhancing the environmental sustainability of AI systems. Described are AI solutions for eco-friendly practices in other fields (green-by AI), strategies for designing energy-efficient machine learning (ML) algorithms and models (green-in AI), and tools for accurately measuring and optimizing energy consumption. Also examined are the role of regulations in promoting green AI and future directions for sustainable ML. Underscored is the importance of aligning AI practices with environmental considerations, fostering a more eco-conscious and energy-efficient future for AI systems."} | ||||
| 100 | −{"work_id": 4409363528, "title": "Intelligent nanophotonics: when machine learning sheds light", "abstract": "Abstract The synergistic development of nanophotonics and machine learning has inspired tremendous innovations in both fields in the past decade. In diverse photonics research, deep-learning methods using artificial neural networks become the key game changer that greatly facilitates rapid nanophotonics design and the versatile processing of optical information. Moreover, optical computing platforms that perform calculations through light propagation are receiving tremendous interest as next-generation machine-learning hardware with advantages in computing speed, energy efficiency, and parallelism. This review summarizes the current state-of-the-art nanophotonic devices enabled by machine learning and analyzes the longstanding challenges that must be overcome to make an impact on technology. We also discuss the opportunities of intelligent photonics in applications such as computational imaging/sensing and machine vision. The intersection of nanophotonics with deep learning holds tremendous implications for transformative technologies ranging from internet of things to smart health. Lastly, we provide our perspective on the pressing challenges in intelligent photonics that must be tackled to advance this field to the next level and the vast opportunities for multidisciplinary collaboration."} | ||||
| 101 | {"work_id": 4390660405, "title": "The Optimization of Carbon Emission Prediction in Low Carbon Energy Economy Under Big Data", "abstract": "With the intensification of global climate change, low-carbon energy has become a hot topic, and governments around the world are implementing corresponding policies to promote its use. This research first establishes a Multi-universe Quantum Harmony Search-Algorithm Dynamic Fuzzy System Ensemble (MUQHS-DMFSE) composite model for carbon emission prediction. This model combines the MUQHS algorithm with the DMFSE method by designing the workflow of the MUQHS algorithm, creating a DMFSE composite prediction model, introducing a sliding factor matrix, and using the MUQHS algorithm to search for the optimal sliding factors, thus obtaining optimized prediction values. In the research on low-carbon economic development, the research applies the Data Envelopment Analysis (DEA) method and establishes Charnes-Cooper-Rhodes (CCR) and Banker-Charnes-Cooper (BCC) models to assess the technical efficiency, pure technical efficiency, and scale efficiency of decision-making units. This research also uses the BCC model to project the production frontier and calculate input redundancy and output gap rates, and evaluate low-carbon economic development. Through the establishment and application of these two models, the research achieves carbon emission prediction and low-carbon economic analysis, validating the feasibility of the research methodology. The results show that the composite model can effectively predict carbon emissions, with a Mean Absolute Percentage Error (MAPE) below 3.5% and Mean Absolute Error (MAE) and Root Mean Square Error (RMSE) below 200 tons, demonstrating the feasibility and accuracy of the model. The research on low-carbon economic development in S Province based on the DEA method reveals the need for energy structure adjustment, clean and renewable energy promotion, control of carbon emissions, and optimization of industrial structure with a focus on developing the tertiary industry. Therefore, the use of artificial intelligence and big data analysis can provide more precise insights into the trends and patterns of low-carbon economic development, as well as more effective predictions of future energy demand and resource supply, offering high practical value and scientific significance."} | 96 | {"work_id": 4390660405, "title": "The Optimization of Carbon Emission Prediction in Low Carbon Energy Economy Under Big Data", "abstract": "With the intensification of global climate change, low-carbon energy has become a hot topic, and governments around the world are implementing corresponding policies to promote its use. This research first establishes a Multi-universe Quantum Harmony Search-Algorithm Dynamic Fuzzy System Ensemble (MUQHS-DMFSE) composite model for carbon emission prediction. This model combines the MUQHS algorithm with the DMFSE method by designing the workflow of the MUQHS algorithm, creating a DMFSE composite prediction model, introducing a sliding factor matrix, and using the MUQHS algorithm to search for the optimal sliding factors, thus obtaining optimized prediction values. In the research on low-carbon economic development, the research applies the Data Envelopment Analysis (DEA) method and establishes Charnes-Cooper-Rhodes (CCR) and Banker-Charnes-Cooper (BCC) models to assess the technical efficiency, pure technical efficiency, and scale efficiency of decision-making units. This research also uses the BCC model to project the production frontier and calculate input redundancy and output gap rates, and evaluate low-carbon economic development. Through the establishment and application of these two models, the research achieves carbon emission prediction and low-carbon economic analysis, validating the feasibility of the research methodology. The results show that the composite model can effectively predict carbon emissions, with a Mean Absolute Percentage Error (MAPE) below 3.5% and Mean Absolute Error (MAE) and Root Mean Square Error (RMSE) below 200 tons, demonstrating the feasibility and accuracy of the model. The research on low-carbon economic development in S Province based on the DEA method reveals the need for energy structure adjustment, clean and renewable energy promotion, control of carbon emissions, and optimization of industrial structure with a focus on developing the tertiary industry. Therefore, the use of artificial intelligence and big data analysis can provide more precise insights into the trends and patterns of low-carbon economic development, as well as more effective predictions of future energy demand and resource supply, offering high practical value and scientific significance."} | ||
| 102 | −{"work_id": 7131638452, "title": "Digital product passports", "abstract": "Abstract Digital product passports (DPPs) will become mandatory in the European Union (EU) for a wide range of product categories under the Ecodesign for Sustainable Products Regulation (ESPR). DPPs are digital artifacts that capture and share essential product data across organizational boundaries. They have the potential to enhance transparency across value chains and ecosystems, thereby supporting data-driven decision-making throughout the entire product lifecycle and unlocking new opportunities for sustainable value creation. Despite growing momentum, the design, implementation, and management of DPPs are still evolving, resulting in a vast space of design options and ambiguity. This fundamentals paper reports on a multivocal literature review to advance our understanding of this emerging phenomenon from an information systems perspective. We position the DPP against adjacent concepts, define it, develop a conceptual framework, and present a demonstrative scenario that instantiates the conceptual framework\u2019s elements. The findings have implications for DPP research and practice and lay the groundwork for achieving both regulatory compliance and enabling additional sustainable pathways."} | ||||
| 103 | {"work_id": 4411541921, "title": "From Efficiency Gains to Rebound Effects: The Problem of Jevons' Paradox in AI's Polarized Environmental Debate", "abstract": "As the climate crisis deepens, artificial intelligence (AI) has emerged as a contested force: some champion its potential to advance renewable energy, materials discovery, and large-scale emissions monitoring, while others underscore its growing carbon footprint, water consumption, and material resource demands. Much of this debate has concentrated on direct impacts -- energy and water usage in data centers, e-waste from frequent hardware upgrades -- without addressing the significant indirect effects. This paper examines how the problem of Jevons' Paradox applies to AI, whereby efficiency gains may paradoxically spur increased consumption. We argue that understanding these second-order impacts requires an interdisciplinary approach, combining lifecycle assessments with socio-economic analyses. Rebound effects undermine the assumption that improved technical efficiency alone will ensure net reductions in environmental harm. Instead, the trajectory of AI's impact also hinges on business incentives and market logics, governance and policymaking, and broader social and cultural norms. We contend that a narrow focus on direct emissions misrepresents AI's true climate footprint, limiting the scope for meaningful interventions. We conclude with recommendations that address rebound effects and challenge the market-driven imperatives fueling uncontrolled AI growth. By broadening the analysis to include both direct and indirect consequences, we aim to inform a more comprehensive, evidence-based dialogue on AI's role in the climate crisis."} | 97 | {"work_id": 4411541921, "title": "From Efficiency Gains to Rebound Effects: The Problem of Jevons' Paradox in AI's Polarized Environmental Debate", "abstract": "As the climate crisis deepens, artificial intelligence (AI) has emerged as a contested force: some champion its potential to advance renewable energy, materials discovery, and large-scale emissions monitoring, while others underscore its growing carbon footprint, water consumption, and material resource demands. Much of this debate has concentrated on direct impacts -- energy and water usage in data centers, e-waste from frequent hardware upgrades -- without addressing the significant indirect effects. This paper examines how the problem of Jevons' Paradox applies to AI, whereby efficiency gains may paradoxically spur increased consumption. We argue that understanding these second-order impacts requires an interdisciplinary approach, combining lifecycle assessments with socio-economic analyses. Rebound effects undermine the assumption that improved technical efficiency alone will ensure net reductions in environmental harm. Instead, the trajectory of AI's impact also hinges on business incentives and market logics, governance and policymaking, and broader social and cultural norms. We contend that a narrow focus on direct emissions misrepresents AI's true climate footprint, limiting the scope for meaningful interventions. We conclude with recommendations that address rebound effects and challenge the market-driven imperatives fueling uncontrolled AI growth. By broadening the analysis to include both direct and indirect consequences, we aim to inform a more comprehensive, evidence-based dialogue on AI's role in the climate crisis."} | ||
| 104 | {"work_id": 4362707075, "title": "Making AI Less \"Thirsty\": Uncovering and Addressing the Secret Water Footprint of AI Models", "abstract": "The growing carbon footprint of artificial intelligence (AI) has been undergoing public scrutiny. Nonetheless, the equally important water (withdrawal and consumption) footprint of AI has largely remained under the radar. For example, training the GPT-3 language model in Microsoft's state-of-the-art U.S. data centers can directly evaporate 700,000 liters of clean freshwater, but such information has been kept a secret. More critically, the global AI demand is projected to account for 4.2-6.6 billion cubic meters of water withdrawal in 2027, which is more than the total annual water withdrawal of 4-6 Denmark or half of the United Kingdom. This is concerning, as freshwater scarcity has become one of the most pressing challenges. To respond to the global water challenges, AI can, and also must, take social responsibility and lead by example by addressing its own water footprint. In this paper, we provide a principled methodology to estimate the water footprint of AI, and also discuss the unique spatial-temporal diversities of AI's runtime water efficiency. Finally, we highlight the necessity of holistically addressing water footprint along with carbon footprint to enable truly sustainable AI."} | 98 | {"work_id": 4362707075, "title": "Making AI Less \"Thirsty\": Uncovering and Addressing the Secret Water Footprint of AI Models", "abstract": "The growing carbon footprint of artificial intelligence (AI) has been undergoing public scrutiny. Nonetheless, the equally important water (withdrawal and consumption) footprint of AI has largely remained under the radar. For example, training the GPT-3 language model in Microsoft's state-of-the-art U.S. data centers can directly evaporate 700,000 liters of clean freshwater, but such information has been kept a secret. More critically, the global AI demand is projected to account for 4.2-6.6 billion cubic meters of water withdrawal in 2027, which is more than the total annual water withdrawal of 4-6 Denmark or half of the United Kingdom. This is concerning, as freshwater scarcity has become one of the most pressing challenges. To respond to the global water challenges, AI can, and also must, take social responsibility and lead by example by addressing its own water footprint. In this paper, we provide a principled methodology to estimate the water footprint of AI, and also discuss the unique spatial-temporal diversities of AI's runtime water efficiency. Finally, we highlight the necessity of holistically addressing water footprint along with carbon footprint to enable truly sustainable AI."} | ||
| 105 | −{"work_id": 7122842330, "title": "Bridging technology and sustainability: examining the role of green AI adoption in Indian banking sector", "abstract": "The rapid integration of Artificial Intelligence (AI) in India\u2019s banking sector offers operational benefits but also raises sustainability challenges. This study focuses on \u201cGreen AI,\u201d defined as AI technologies optimized for energy efficiency and carbon conscious practices, by extending the Technology\u2013Organization\u2013Environment (TOE) and Technology Acceptance Model (TAM) frameworks with sustainability-linked factors. Data were collected from 412 mid- to senior-level professionals across six leading public and private banks, and Structural Equation Modeling (SEM) was employed to test the proposed hypotheses. Findings reveal that Banking Infrastructure ( \u03b2 = 0.419), Financial Investment ( \u03b2 = 0.401), and Competitive Pressure ( \u03b2 = 0.329) are the strongest predictors of Green AI adoption, while Regulatory Influence ( \u03b2 = 0.147), Perceived Usefulness ( \u03b2 = 0.129), and Perceived Ease of Use ( \u03b2 = 0.098) exert weaker but significant effects. Adoption of Green AI demonstrates a positive link to sustainability outcomes ( \u03b2 = 0.446), indicating its potential to convert structural readiness into measurable environmental gains. Although direct energy-consumption data were unavailable, perceptual measures provided valid proxies aligned with emerging-market studies. The results suggest that resource and market drivers outweigh attitudinal factors, offering actionable insights for infrastructure investment, regulatory refinement, and ESG integration, with implications for other emerging economies."} | 99 | +{"work_id": 4360605906, "title": "33.1 A 16nm 32Mb Embedded STT-MRAM with a 6ns Read-Access Time, a 1M-Cycle Write Endurance, 20-Year Retention at 150\u00b0C and MTJ-OTP Solutions for Magnetic Immunity", "abstract": "Embedded non-volatile memory (eNVM) is an essential element for microcontrollers (MCUs) used in automotive applications. As the automotive market transitions to greater electrification and autonomy, we are seeing MCU growth in the car: including integration to simplify system design, an electrical and electronic (E/E) architectural evolution to domain/zone control, and over-the-air (OTA) updates beyond 128Mb eNVM densities. To support this transition technology nodes are migrating from 55/40nm to 28/16nm. In addition, traditional charge-based embedded Flash will be replaced by Back-end-of-line (BEOL) memories: such as STT-MRAM [1]\u2013[3], PCRAM [4], and RRAM. Of these candidates, STT-MRAM is the most promising solution for automotive applications due to its high-temperature data retention, high write endurance, and fast write speed. However, STT-MRAM still faces several challenges from the inherent properties of magnetic tunnel junctions (MTJs) and the side effects of process integration: such as array-level variability and magnetic-field interference (MFI). In this work, several design solutions are proposed to overcome these challenges: (1) a novel merged-local-reference scheme is used to overcome the array-edge effect on the MTJs; (2) write bias segment trimming is used to mitigate the near-far effect for better write endurance; (3) an MTJ-based one-time programmable (OTP) is used to preserve critical data during the wafer-level chip-scale packaging (WLCSP) process (360\u00b0C, 3hr), and; (4) a novel sensing-reference scheme is used so that this MTJ-OTP is immune to external-magnetic-field interference. A 32-Mb STT-MRAM test chip based on these proposed solutions is successfully fabricated in a 16nm FinFET CMOS process, Measured results confirm its excellent performance and manufacturability for next generation automotive MCU application."} | ||
| 106 | −{"work_id": 7127083763, "title": "Digital medicine\u2019s international race for regulatory sandboxes and voluntary alternative pathways picks up tempo", "abstract": "The last months of 2025 have brought major new policy initiatives and pilots for digital medicine and AI regulatory sandboxes from the EU, UK, and US regulators. The EU has seen a regulatory simplification package with the promotion of sandboxes for innovative technologies. The UK sees the start of an important second phase of the world-leading \u2018AI Airlock\u2019 regulatory sandbox program. TEMPO, a major voluntary alternative pathway regulatory innovation pilot for digital health in chronic disease has been announced by the US FDA. These frameworks bring flexible approaches to explore digital health technology innovation together with regulatory innovation. They will all substantially advance digital medicine, with the US TEMPO project being the most innovative, bringing sandboxing principles to the on-market phase."} | 100 | +{"work_id": 2799210008, "title": "Memristor Crossbars with 4.5 Terabits-per-Inch-Square Density and Two Nanometer Dimension", "abstract": "Memristor is a promising building block for the next generation nonvolatile random access memory and bio-inspired computing systems. Organizing memristors into high density crossbar arrays, although challenging, is critical to meet the ever-growing high capacity and low energy demands of these applications especially in the big data era. Here, we construct memristor crossbars with a single-layer density up to 4.5 terabits per inch square, an order of magnitude denser than the state- of-the-art 64-layer triple level cell NAND flash technology. The memristors in the crossbars are 2 $\\times$ 2 nm$^2$ in size, capable of switching with tens of nano ampere electric current. The densely packed memristor crossbars of extremely small working devices provides a power-efficient solution for high density information storage and processing."} | ||
| 107 | {"work_id": 4210357113, "title": "Opportunities for neuromorphic computing algorithms and applications", "abstract": null} | 101 | {"work_id": 4210357113, "title": "Opportunities for neuromorphic computing algorithms and applications", "abstract": null} | ||
| 108 | {"work_id": 4408612646, "title": "Microsatellite-based real-time quantum key distribution", "abstract": null} | 102 | {"work_id": 4408612646, "title": "Microsatellite-based real-time quantum key distribution", "abstract": null} | ||
| 109 | {"work_id": 7149961640, "title": "A discrete memristive cyclic Hopfield neural network with multi-cavity-like attractors and application in secure communication", "abstract": null} | 103 | {"work_id": 7149961640, "title": "A discrete memristive cyclic Hopfield neural network with multi-cavity-like attractors and application in secure communication", "abstract": null} | ||
| 104 | +{"work_id": 3181035463, "title": "{ZNS}: Avoiding the Block Interface Tax for Flash-based SSDs", "abstract": null} | ||||
| 110 | {"work_id": 7117963061, "title": "Toward sustainable data center operation: A review on existing infrastructures, integrated smart energy management frameworks, and future perspectives", "abstract": null} | 105 | {"work_id": 7117963061, "title": "Toward sustainable data center operation: A review on existing infrastructures, integrated smart energy management frameworks, and future perspectives", "abstract": null} | ||
| 106 | +{"work_id": 1983572666, "title": "The Art of Multiprocessor Programming", "abstract": null} | ||||
| 111 | {"work_id": 4414574650, "title": "Field and delay effects on synchronization in a multilayer memristive neuronal network with a hub", "abstract": null} | 107 | {"work_id": 4414574650, "title": "Field and delay effects on synchronization in a multilayer memristive neuronal network with a hub", "abstract": null} | ||
| 112 | {"work_id": 4413052649, "title": "An attractor-controllable memristive Hopfield neural network and its application on voice encryption", "abstract": null} | 108 | {"work_id": 4413052649, "title": "An attractor-controllable memristive Hopfield neural network and its application on voice encryption", "abstract": null} | ||
| 109 | +{"work_id": 2482126025, "title": "Characterizing quantum supremacy in near-term devices", "abstract": null} | ||||
| 113 | {"work_id": 7141052859, "title": "A dual-neuron second-order memristor-based Hopfield neural network with controllable extreme multistability and its application in image encryption", "abstract": null} | 110 | {"work_id": 7141052859, "title": "A dual-neuron second-order memristor-based Hopfield neural network with controllable extreme multistability and its application in image encryption", "abstract": null} | ||
| 111 | +{"work_id": 2798434869, "title": "Supervised learning with quantum-enhanced feature spaces", "abstract": null} | ||||
| 112 | +{"work_id": 2803823791, "title": "A review of thermal management and innovative cooling strategies for data center", "abstract": null} | ||||
| 113 | +{"work_id": 1653864426, "title": "Inside Solid State Drives (SSDs)", "abstract": null} | ||||
| 114 | {"work_id": 4409283612, "title": "Universal photonic artificial intelligence acceleration", "abstract": null} | 114 | {"work_id": 4409283612, "title": "Universal photonic artificial intelligence acceleration", "abstract": null} | ||
| 115 | {"work_id": 2944119451, "title": "All-optical spiking neurosynaptic networks with self-learning capabilities", "abstract": null} | 115 | {"work_id": 2944119451, "title": "All-optical spiking neurosynaptic networks with self-learning capabilities", "abstract": null} | ||
| 116 | {"work_id": 2892611063, "title": "Improving Big Data Centers Energy Efficiency: Traffic Based Model and Method", "abstract": null} | 116 | {"work_id": 2892611063, "title": "Improving Big Data Centers Energy Efficiency: Traffic Based Model and Method", "abstract": null} | ||
modified
literature_synthesis/landmarks/hardware_emerging_landmarks.csv
+126 −126
@@ -1,126 +1,126 @@ | |||||
| 1 | −work_id,doi,arxiv_id,title,source_name,year,type,primary_category,n_categories,c12,c36,ncs36,cited_by_count,fwci,has_abstract,is_oa,period,score,set,pi_review | 1 | +work_id,doi,arxiv_id,title,source_name,year,type,primary_category,n_categories,c12,c36,ncs36,cited_by_count,fwci,has_abstract,is_oa,period,ntitle,score,set,pi_review | ||
| 2 | −2187800381,10.48456/tr-579,,Practical lock-freedom,OpenGrey (Institut de l'Information Scientifique et Technique),2021,dissertation,computer_architecture,5,281.0,286.0,994.2153284671533,458,,True,True,baseline,994.2153284671533,landmark,True | 2 | +3099878876,,,Array programming with NumPy,RePEc: Research Papers in Economics,2020,article,computer_architecture,4,2343.0,5512.0,689.4179496808111,17096,889.1394,True,True,baseline,arrayprogrammingwithnumpy,689.4179496808111,landmark,True | ||
| 3 | −3099878876,,,Array programming with NumPy,RePEc: Research Papers in Economics,2020,article,computer_architecture,4,2343.0,5512.0,689.4179496808111,17096,889.1394,True,True,baseline,689.4179496808111,landmark,True | 3 | +3046751266,10.1063/5.0014475,,Scalable molecular dynamics on CPU and GPU architectures with NAMD,The Journal of Chemical Physics,2020,article,computer_architecture,7,356.0,869.0,214.60681995758455,3144,304.3728,True,True,baseline,scalablemoleculardynamicsoncpuandgpuarchitectureswithnamd,214.60681995758455,landmark,True | ||
| 4 | −4287393709,10.4230/lipics.ecrts.2026.17,,Uncertainty-Aware Resource Allocation for Multi-Path Programs with In-Kernel Predictions,DROPS (Schloss Dagstuhl – Leibniz Center for Informatics),2026,article,computer_architecture,3,71.0,71.0,330.9365269461078,71,0.0,True,True,post,252.42066113200724,landmark,True | 4 | +4394998532,10.1145/3620665.3640366,,PyTorch 2: Faster Machine Learning Through Dynamic Python Bytecode Transformation and Graph Compilation,ACM International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS),2024,conference-paper,computer_architecture,6,434.0,690.0,204.38576349024112,690,218.9123,True,False,post,pytorch2fastermachinelearningthroughdynamicpythonbytecodetransformationandgraphcompilation,204.38576349024112,landmark,True | ||
| 5 | −3046751266,10.1063/5.0014475,,Scalable molecular dynamics on CPU and GPU architectures with NAMD,The Journal of Chemical Physics,2020,article,computer_architecture,7,356.0,869.0,214.60681995758455,3144,304.3728,True,True,baseline,214.60681995758455,landmark,True | 5 | +4287393709,10.4230/lipics.ecrts.2026.17,,Uncertainty-Aware Resource Allocation for Multi-Path Programs with In-Kernel Predictions,DROPS (Schloss Dagstuhl – Leibniz Center for Informatics),2026,article,computer_architecture,3,71.0,71.0,330.9365269461078,71,0.0,True,True,post,uncertaintyawareresourceallocationformultipathprogramswithinkernelpredictions,180.01839926555348,landmark,True | ||
| 6 | −4394998532,10.1145/3620665.3640366,,PyTorch 2: Faster Machine Learning Through Dynamic Python Bytecode Transformation and Graph Compilation,ACM International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS),2024,conference-paper,computer_architecture,6,434.0,690.0,204.38576349024112,690,218.9123,True,False,post,204.38576349024112,landmark,True | 6 | +4297813615,10.4230/lipics.ecrts.2024.13,,DeepTrust^RT: Confidential Deep Neural Inference Meets Real-Time!,DROPS (Schloss Dagstuhl – Leibniz Center for Informatics),2024,article,computer_architecture,5,674.0,707.0,157.60297582979868,708,51.0217,True,True,post,deeptrustrtconfidentialdeepneuralinferencemeetsrealtime,157.60297582979868,landmark,True | ||
| 7 | −4297813615,10.4230/lipics.ecrts.2024.13,,DeepTrust^RT: Confidential Deep Neural Inference Meets Real-Time!,DROPS (Schloss Dagstuhl – Leibniz Center for Informatics),2024,article,computer_architecture,5,674.0,707.0,157.60297582979868,708,51.0217,True,True,post,157.60297582979868,landmark,True | 7 | +3111721177,10.1007/978-981-16-7487-7_7,,A Modern Primer on Processing in Memory,Computer architecture and design methodologies,2022,book-chapter,computer_architecture,2,90.0,125.0,139.4308943089431,168,112.4027,False,False,baseline,amodernprimeronprocessinginmemory,139.4308943089431,landmark,True | ||
| 8 | −3111721177,10.1007/978-981-16-7487-7_7,,A Modern Primer on Processing in Memory,Computer architecture and design methodologies,2022,book-chapter,computer_architecture,2,90.0,125.0,139.4308943089431,168,112.4027,False,False,baseline,139.4308943089431,landmark,True | 8 | +2273211146,10.17615/nyex-d314,,The multiprocessor real-time scheduling of general task systems,Carolina Digital Repository (University of North Carolina at Chapel Hill),2019,dissertation,computer_architecture,4,19.0,20.0,137.14285714285714,37,,True,True,baseline,themultiprocessorrealtimeschedulingofgeneraltasksystems,137.14285714285714,landmark,True | ||
| 9 | −2273211146,10.17615/nyex-d314,,The multiprocessor real-time scheduling of general task systems,Carolina Digital Repository (University of North Carolina at Chapel Hill),2019,dissertation,computer_architecture,4,19.0,20.0,137.14285714285714,37,,True,True,baseline,137.14285714285714,landmark,True | 9 | +4286840061,10.7302/4622,,Algorithm-Architecture Co-Design for Domain-Specific Accelerators in Communication and Artificial Intelligence,Deep Blue (University of Michigan),2022,dissertation,computer_architecture,5,3.0,14.0,105.75490196078431,14,,True,True,baseline,algorithmarchitecturecodesignfordomainspecificacceleratorsincommunicationandartificialintelligence,105.75490196078431,landmark,True | ||
| 10 | −4406650295,10.1145/3714983.3714987,,AWQ: Activation-aware Weight Quantization for On-Device LLM Compression and Acceleration,GetMobile Mobile Computing and Communications,2025,article,computer_architecture,9,234.0,234.0,76.51490775873349,234,83.4275,True,False,post,118.46457204078958,landmark,True | 10 | +3016932526,10.1063/5.0005082,,Q uantum ESPRESSO toward the exascale,The Journal of Chemical Physics,2020,article,computer_architecture,4,175.0,425.0,104.9573055028463,2032,159.393,True,True,baseline,quantumespressotowardtheexascale,104.9573055028463,landmark,True | ||
| 11 | −4286840061,10.7302/4622,,Algorithm-Architecture Co-Design for Domain-Specific Accelerators in Communication and Artificial Intelligence,Deep Blue (University of Michigan),2022,dissertation,computer_architecture,5,3.0,14.0,105.75490196078431,14,,True,True,baseline,105.75490196078431,landmark,True | 11 | +4406650295,10.1145/3714983.3714987,,AWQ: Activation-aware Weight Quantization for On-Device LLM Compression and Acceleration,GetMobile Mobile Computing and Communications,2025,article,computer_architecture,9,234.0,234.0,76.51490775873349,234,83.4275,True,False,post,awqactivationawareweightquantizationforondevicellmcompressionandacceleration,102.2513468321514,landmark,True | ||
| 12 | −3016932526,10.1063/5.0005082,,Q uantum ESPRESSO toward the exascale,The Journal of Chemical Physics,2020,article,computer_architecture,4,175.0,425.0,104.9573055028463,2032,159.393,True,True,baseline,104.9573055028463,landmark,True | 12 | +4401211704,10.1109/isca59077.2024.00019,,Splitwise: Efficient Generative LLM Inference Using Phase Splitting,ACM/IEEE International Symposium on Computer Architecture (ISCA),2024,conference-paper,computer_architecture,6,125.0,292.0,86.49368541905856,286,90.7376,True,False,post,splitwiseefficientgenerativellminferenceusingphasesplitting,86.49368541905856,landmark,True | ||
| 13 | −4401211704,10.1109/isca59077.2024.00019,,Splitwise: Efficient Generative LLM Inference Using Phase Splitting,ACM/IEEE International Symposium on Computer Architecture (ISCA),2024,conference-paper,computer_architecture,6,125.0,292.0,86.49368541905856,286,90.7376,True,False,post,86.49368541905856,landmark,True | 13 | +5673758,10.7275/4018988,,A Novel Reconfiguration Scheme in Quantum-Dot Cellular Automata for Energy Efficient Nanocomputing,ScholarWorks@UMassAmherst (University of Massachusetts Amherst),2023,dissertation,computer_architecture,4,4.0,4.0,86.3030303030303,4,,True,True,post,anovelreconfigurationschemeinquantumdotcellularautomataforenergyefficientnanocomputing,86.3030303030303,landmark,True | ||
| 14 | −5673758,10.7275/4018988,,A Novel Reconfiguration Scheme in Quantum-Dot Cellular Automata for Energy Efficient Nanocomputing,ScholarWorks@UMassAmherst (University of Massachusetts Amherst),2023,dissertation,computer_architecture,4,4.0,4.0,86.3030303030303,4,,True,True,post,86.3030303030303,landmark,True | 14 | +6922095860,10.1184/r1/14642340,,Practical Mechanisms for Reducing Processor–Memory Data Movement in Modern Workloads,Figshare,2021,dissertation,computer_architecture,9,9.0,11.0,81.43283582089553,11,,True,True,baseline,practicalmechanismsforreducingprocessormemorydatamovementinmodernworkloads,81.43283582089553,landmark,True | ||
| 15 | −6922095860,10.1184/r1/14642340,,Practical Mechanisms for Reducing Processor–Memory Data Movement in Modern Workloads,Figshare,2021,dissertation,computer_architecture,9,9.0,11.0,81.43283582089553,11,,True,True,baseline,81.43283582089553,landmark,True | 15 | +4386978266,10.7302/8543,,Accelerated Systems for Portable DNA Sequencing,Deep Blue (University of Michigan),2023,dissertation,computer_architecture,5,11.0,11.0,75.89999999999999,11,,True,True,post,acceleratedsystemsforportablednasequencing,75.89999999999999,landmark,True | ||
| 16 | −7135078329,10.1109/tvlsi.2026.3670888,,Highly Reliable RRAM-Based Physical Unclonable Function With Auto-Write Technique,IEEE Transactions on Very Large Scale Integration (VLSI) Systems,2026,article,computer_architecture,5,22.0,22.0,102.5437125748503,22,154.5718,True,False,post,78.21485274512901,landmark,True | 16 | +4393145114,10.1109/mm.2024.3373763,2403.14123,AI and Memory Wall,IEEE Micro,2024,article,computer_architecture,8,201.0,336.0,74.90042415673601,336,105.8227,True,True,post,aiandmemorywall,74.90042415673601,landmark,True | ||
| 17 | −4386978266,10.7302/8543,,Accelerated Systems for Portable DNA Sequencing,Deep Blue (University of Michigan),2023,dissertation,computer_architecture,5,11.0,11.0,75.89999999999999,11,,True,True,post,75.89999999999999,landmark,True | 17 | +1224547023,10.1201/9781315218823-12,,Model-Based Framework for Schedulability Analysis Using Uppaal 4.1,CRC Press eBooks,2018,book-chapter,computer_architecture,3,51.0,52.0,74.46337817638266,70,17.8443,True,True,baseline,modelbasedframeworkforschedulabilityanalysisusinguppaal41,74.46337817638266,landmark,True | ||
| 18 | −4393145114,10.1109/mm.2024.3373763,2403.14123,AI and Memory Wall,IEEE Micro,2024,article,computer_architecture,8,201.0,336.0,74.90042415673601,336,105.8227,True,True,post,74.90042415673601,landmark,True | 18 | +2972087877,10.1145/3320060,,Demystifying Parallel and Distributed Deep Learning,ACM Computing Surveys,2019,article,computer_architecture,6,159.0,263.0,74.14530533429881,577,81.2716,True,False,baseline,demystifyingparallelanddistributeddeeplearning,74.14530533429881,landmark,True | ||
| 19 | −1224547023,10.1201/9781315218823-12,,Model-Based Framework for Schedulability Analysis Using Uppaal 4.1,CRC Press eBooks,2018,book-chapter,computer_architecture,3,51.0,52.0,74.46337817638266,70,17.8443,True,True,baseline,74.46337817638266,landmark,True | 19 | +2952332632,10.4230/oasics.asd.2020.1,,Towards a Reliable and Context-Based System Architecture for Autonomous Vehicles,OASIcs : OpenAccess Series in Informatics,2020,conference-paper,computer_architecture,3,395.0,516.0,73.13244814646819,797,52.3105,True,True,baseline,towardsareliableandcontextbasedsystemarchitectureforautonomousvehicles,73.13244814646819,landmark,True | ||
| 20 | −2972087877,10.1145/3320060,,Demystifying Parallel and Distributed Deep Learning,ACM Computing Surveys,2019,article,computer_architecture,6,159.0,263.0,74.14530533429881,577,81.2716,True,False,baseline,74.14530533429881,landmark,True | 20 | +2921153466,10.48550/arxiv.1903.05714,1903.05714,Basic Performance Measurements of the Intel Optane DC Persistent Memory Module,arXiv (Cornell University),2019,preprint,computer_architecture,6,108.0,175.0,71.88172043010752,191,,True,True,baseline,basicperformancemeasurementsoftheinteloptanedcpersistentmemorymodule,71.88172043010752,landmark,True | ||
| 21 | −2952332632,10.4230/oasics.asd.2020.1,,Towards a Reliable and Context-Based System Architecture for Autonomous Vehicles,OASIcs : OpenAccess Series in Informatics,2020,conference-paper,computer_architecture,3,395.0,516.0,73.13244814646819,797,52.3105,True,True,baseline,73.13244814646819,landmark,True | 21 | +4403931219,10.17487/rfc9669,,BPF Instruction Set Architecture (ISA),,2024,report,computer_architecture,4,4.0,9.0,66.0,9,,False,False,post,bpfinstructionsetarchitectureisa,66.0,landmark,True | ||
| 22 | −4410153295,10.1109/tcad.2025.3567878,,Bursting Firings in Memristive Hopfield Neural Network With Image Encryption and Hardware Implementation,IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems,2025,article,computer_architecture,4,142.0,142.0,32.564312668463614,142,32.3565,True,False,post,71.88875739227402,landmark,True | 22 | +2931743911,10.1109/hpca.2019.00048,,Machine Learning at Facebook: Understanding Inference at the Edge,Proceedings - International Symposium on High-Performance Computer Architecture/Proceedings,2019,conference-paper,computer_architecture,7,108.0,212.0,64.45974888151248,439,66.0809,True,False,baseline,machinelearningatfacebookunderstandinginferenceattheedge,64.45974888151248,landmark,True | ||
| 23 | −2921153466,10.48550/arxiv.1903.05714,1903.05714,Basic Performance Measurements of the Intel Optane DC Persistent Memory Module,arXiv (Cornell University),2019,preprint,computer_architecture,6,108.0,175.0,71.88172043010752,191,,True,True,baseline,71.88172043010752,landmark,True | 23 | +1983572666,10.1016/c2011-0-06993-4,,The Art of Multiprocessor Programming,Elsevier eBooks,2020,book,computer_architecture,2,852.0,864.0,63.65562913907285,1093,24.414,False,False,baseline,theartofmultiprocessorprogramming,63.65562913907285,landmark,True | ||
| 24 | −3014555390,10.4230/lipics.ecrts.2026.13,,CacheFlow: Using Maximum Flow to Bound Cache-Based Preemption Delays,Leibniz international proceedings in informatics,2026,conference-paper,computer_architecture,2,19.0,19.0,147.2590476190476,19,17.7143,True,True,post,67.54919100715686,landmark,True | 24 | +75685577,10.7275/2207079,,Electromagnetic Side-Channel Analysis for Hardware and Software Watermarking,Scholarworks (University of Massachusetts Amherst),2023,dissertation,computer_architecture,3,9.0,9.0,62.099999999999994,9,,True,True,post,electromagneticsidechannelanalysisforhardwareandsoftwarewatermarking,62.099999999999994,landmark,True | ||
| 25 | −4409568286,10.1145/3729215,2306.15552,A Survey on Deep Learning Hardware Accelerators for Heterogeneous HPC Platforms,ACM Computing Surveys,2025,article,computer_architecture,7,133.0,133.0,76.14302694136292,133,81.5626,True,True,post,67.3324276983975,landmark,True | 25 | +4410153295,10.1109/tcad.2025.3567878,,Bursting Firings in Memristive Hopfield Neural Network With Image Encryption and Hardware Implementation,IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems,2025,article,computer_architecture,4,142.0,142.0,32.564312668463614,142,32.3565,True,False,post,burstingfiringsinmemristivehopfieldneuralnetworkwithimageencryptionandhardwareimplementation,62.04996260754486,landmark,True | ||
| 26 | −4403931219,10.17487/rfc9669,,BPF Instruction Set Architecture (ISA),,2024,report,computer_architecture,4,4.0,9.0,66.0,9,,False,False,post,66.0,landmark,True | 26 | +4380874786,10.1145/3579371.3589350,2304.01433,TPU v4: An Optically Reconfigurable Supercomputer for Machine Learning with Hardware Support for Embeddings,Proceedings - International Symposium on Computer Architecture/Proceedings,2023,conference-paper,computer_architecture,10,167.0,388.0,61.6547248352945,508,94.1928,True,True,post,tpuv4anopticallyreconfigurablesupercomputerformachinelearningwithhardwaresupportforembeddings,61.6547248352945,landmark,True | ||
| 27 | −2156094048,10.1145/3501714.3501727,,Reverend Bayes on Inference Engines: A Distributed Hierarchical Approach,ACM eBooks,2022,book-chapter,ai_accelerators,2,495.0,513.0,274.919235405545,727,46.4544,True,False,baseline,274.919235405545,landmark,True | 27 | +2156094048,10.1145/3501714.3501727,,Reverend Bayes on Inference Engines: A Distributed Hierarchical Approach,ACM eBooks,2022,book-chapter,ai_accelerators,2,495.0,513.0,274.919235405545,727,46.4544,True,False,baseline,reverendbayesoninferenceenginesadistributedhierarchicalapproach,274.919235405545,landmark,True | ||
| 28 | −7130682590,10.1016/j.vlsi.2026.102688,,Extreme multistability in discrete memristive neuron maps and implications for dual-field applications,Integration,2026,article,ai_accelerators,2,37.0,37.0,38.12608695652174,37,127.1161,False,False,post,131.54316143498968,landmark,True | 28 | +3003967059,10.1038/s41586-020-03070-1,2002.00281,Parallel convolutional processing using an integrated photonic tensor core,Nature,2021,article,ai_accelerators,2,503.0,830.0,96.73020860110631,1874,105.2419,False,True,baseline,parallelconvolutionalprocessingusinganintegratedphotonictensorcore,96.73020860110631,landmark,True | ||
| 29 | −3003967059,10.1038/s41586-020-03070-1,2002.00281,Parallel convolutional processing using an integrated photonic tensor core,Nature,2021,article,ai_accelerators,2,503.0,830.0,96.73020860110631,1874,105.2419,False,True,baseline,96.73020860110631,landmark,True | 29 | +7130682590,10.1016/j.vlsi.2026.102688,,Extreme multistability in discrete memristive neuron maps and implications for dual-field applications,Integration,2026,article,ai_accelerators,2,37.0,37.0,38.12608695652174,37,127.1161,False,False,post,extrememultistabilityindiscretememristiveneuronmapsandimplicationsfordualfieldapplications,93.81240525106308,landmark,True | ||
| 30 | −7131231908,10.1109/tcyb.2026.3664460,,Reconfigurable Multiscroll Memristive Neural Network With Application to Telemedicine Privacy Protection,IEEE Transactions on Cybernetics,2026,article,ai_accelerators,5,25.0,25.0,67.00916730328495,25,77.9076,True,False,post,88.88051448310114,landmark,True | 30 | +4409283612,10.1038/s41586-025-08854-x,,Universal photonic artificial intelligence acceleration,Nature,2025,article,ai_accelerators,1,165.0,165.0,56.20713647719771,165,68.6604,False,False,post,universalphotonicartificialintelligenceacceleration,72.1003086636965,landmark,True | ||
| 31 | −7134974875,10.1109/icears67481.2026.11416637,,Neuromorphic Photonic Computing using Microring Resonator Arrays for Real-Time Edge AI Processing,International Conference on Electronics and Renewable Systems (ICEARS),2026,conference-paper,ai_accelerators,3,24.0,24.0,184.20139553974553,24,221.8777,False,False,post,85.3252939037771,landmark,True | 31 | +2783525259,10.1109/mm.2018.112130359,,Loihi: A Neuromorphic Manycore Processor with On-Chip Learning,IEEE Micro,2018,article,ai_accelerators,4,327.0,745.0,64.97395387432005,3897,115.1562,True,False,baseline,loihianeuromorphicmanycoreprocessorwithonchiplearning,64.97395387432005,landmark,True | ||
| 32 | −7135102590,10.1109/tii.2026.3668794,,Biologically Plausible Memristive Decision-Making Circuit for Adaptive Control in Industrial Autonomous Navigation,IEEE Transactions on Industrial Informatics,2026,article,ai_accelerators,2,24.0,24.0,35.86027014438752,24,41.1527,True,False,post,85.3252939037771,landmark,True | 32 | +7131231908,10.1109/tcyb.2026.3664460,,Reconfigurable Multiscroll Memristive Neural Network With Application to Telemedicine Privacy Protection,IEEE Transactions on Cybernetics,2026,article,ai_accelerators,5,25.0,25.0,67.00916730328495,25,77.9076,True,False,post,reconfigurablemultiscrollmemristiveneuralnetworkwithapplicationtotelemedicineprivacyprotection,63.38676030477235,landmark,True | ||
| 33 | −4409283612,10.1038/s41586-025-08854-x,,Universal photonic artificial intelligence acceleration,Nature,2025,article,ai_accelerators,1,165.0,165.0,56.20713647719771,165,68.6604,False,False,post,83.53271105440291,landmark,True | 33 | +7135102590,10.1109/tii.2026.3668794,,Biologically Plausible Memristive Decision-Making Circuit for Adaptive Control in Industrial Autonomous Navigation,IEEE Transactions on Industrial Informatics,2026,article,ai_accelerators,2,24.0,24.0,35.86027014438752,24,41.1527,True,False,post,biologicallyplausiblememristivedecisionmakingcircuitforadaptivecontrolinindustrialautonomousnavigation,60.851289892581455,landmark,True | ||
| 34 | −7128511721,10.1109/tce.2026.3663359,,A Memristor-Based Neural Network Circuit With Classical Conditioning and Fear Generalization,IEEE Transactions on Consumer Electronics,2026,article,ai_accelerators,3,23.0,23.0,34.366092221704704,23,39.438,True,False,post,81.77007332445305,landmark,True | 34 | +7134974875,10.1109/icears67481.2026.11416637,,Neuromorphic Photonic Computing using Microring Resonator Arrays for Real-Time Edge AI Processing,International Conference on Electronics and Renewable Systems (ICEARS),2026,conference-paper,ai_accelerators,3,24.0,24.0,184.20139553974553,24,221.8777,False,False,post,neuromorphicphotoniccomputingusingmicroringresonatorarraysforrealtimeedgeaiprocessing,60.851289892581455,landmark,True | ||
| 35 | −2783525259,10.1109/mm.2018.112130359,,Loihi: A Neuromorphic Manycore Processor with On-Chip Learning,IEEE Micro,2018,article,ai_accelerators,4,327.0,745.0,64.97395387432005,3897,115.1562,True,False,baseline,64.97395387432005,landmark,True | 35 | +2944119451,10.1038/s41586-019-1157-8,2102.09360,All-optical spiking neurosynaptic networks with self-learning capabilities,Nature,2019,article,ai_accelerators,3,162.0,384.0,58.38929375910958,1529,75.8628,False,True,baseline,allopticalspikingneurosynapticnetworkswithselflearningcapabilities,58.38929375910958,landmark,True | ||
| 36 | −2944119451,10.1038/s41586-019-1157-8,2102.09360,All-optical spiking neurosynaptic networks with self-learning capabilities,Nature,2019,article,ai_accelerators,3,162.0,384.0,58.38929375910958,1529,75.8628,False,True,baseline,58.38929375910958,landmark,True | 36 | +7128511721,10.1109/tce.2026.3663359,,A Memristor-Based Neural Network Circuit With Classical Conditioning and Fear Generalization,IEEE Transactions on Consumer Electronics,2026,article,ai_accelerators,3,23.0,23.0,34.366092221704704,23,39.438,True,False,post,amemristorbasedneuralnetworkcircuitwithclassicalconditioningandfeargeneralization,58.315819480390566,landmark,True | ||
| 37 | −7141052859,10.1016/j.vlsi.2026.102731,,A dual-neuron second-order memristor-based Hopfield neural network with controllable extreme multistability and its application in image encryption,Integration,2026,article,ai_accelerators,4,15.0,15.0,40.20550038197097,15,46.7446,False,False,post,53.328308689860684,landmark,True | 37 | +4210357113,10.1038/s43588-021-00184-y,,Opportunities for neuromorphic computing algorithms and applications,Nature Computational Science,2022,article,ai_accelerators,2,224.0,537.0,42.17948197363679,1107,60.0929,False,True,baseline,opportunitiesforneuromorphiccomputingalgorithmsandapplications,42.17948197363679,landmark,True | ||
| 38 | −7149961640,10.1016/j.neunet.2026.108953,,A discrete memristive cyclic Hopfield neural network with multi-cavity-like attractors and application in secure communication,Neural Networks,2026,article,ai_accelerators,3,14.0,14.0,14.426086956521738,14,48.098,False,False,post,49.77308811053664,landmark,True | 38 | +4394727812,10.1126/science.adl1203,,Large-scale photonic chiplet Taichi empowers 160-TOPS/W artificial general intelligence,Science,2024,article,ai_accelerators,4,198.0,308.0,38.256050750798984,308,45.8367,True,False,post,largescalephotonicchiplettaichiempowers160topswartificialgeneralintelligence,38.256050750798984,landmark,True | ||
| 39 | −7140216027,10.1016/j.neunet.2026.108887,,Discrete bidirectional memristive neural network-based hyperchaotic system and its FPGA implementation,Neural Networks,2026,article,ai_accelerators,3,13.0,13.0,13.395652173913042,13,44.6624,False,False,post,46.2178675312126,landmark,True | 39 | +7141052859,10.1016/j.vlsi.2026.102731,,A dual-neuron second-order memristor-based Hopfield neural network with controllable extreme multistability and its application in image encryption,Integration,2026,article,ai_accelerators,4,15.0,15.0,40.20550038197097,15,46.7446,False,False,post,adualneuronsecondordermemristorbasedhopfieldneuralnetworkwithcontrollableextrememultistabilityanditsapplicationinimageencryption,38.03205618286341,landmark,True | ||
| 40 | −7130433466,10.1109/tcsi.2026.3663432,,A Second-Order Memristor Method to Construct Memristive Neural Networks With Multi-Butterfly and Multi-Scroll Dynamics,IEEE Transactions on Circuits and Systems I Regular Papers,2026,article,ai_accelerators,4,12.0,12.0,17.93013507219376,12,20.5764,True,False,post,42.66264695188855,landmark,True | 40 | +7149961640,10.1016/j.neunet.2026.108953,,A discrete memristive cyclic Hopfield neural network with multi-cavity-like attractors and application in secure communication,Neural Networks,2026,article,ai_accelerators,3,14.0,14.0,14.426086956521738,14,48.098,False,False,post,adiscretememristivecyclichopfieldneuralnetworkwithmulticavitylikeattractorsandapplicationinsecurecommunication,35.49658577067252,landmark,True | ||
| 41 | −7130516837,10.1142/s0218127426500914,,Gaussian-Function-Driven Chaotic Memristive Dynamics with Application to Image Encryption,International Journal of Bifurcation and Chaos,2026,article,ai_accelerators,3,12.0,12.0,32.16440030557678,12,37.3956,True,False,post,42.66264695188855,landmark,True | 41 | +4409363528,10.1186/s43593-025-00085-x,,Intelligent nanophotonics: when machine learning sheds light,eLight,2025,article,ai_accelerators,5,77.0,77.0,26.229997022692263,77,32.0415,True,True,post,intelligentnanophotonicswhenmachinelearningshedslight,33.64681070972503,landmark,True | ||
| 42 | −4210357113,10.1038/s43588-021-00184-y,,Opportunities for neuromorphic computing algorithms and applications,Nature Computational Science,2022,article,ai_accelerators,2,224.0,537.0,42.17948197363679,1107,60.0929,False,True,baseline,42.17948197363679,landmark,True | 42 | +7140216027,10.1016/j.neunet.2026.108887,,Discrete bidirectional memristive neural network-based hyperchaotic system and its FPGA implementation,Neural Networks,2026,article,ai_accelerators,3,13.0,13.0,13.395652173913042,13,44.6624,False,False,post,discretebidirectionalmemristiveneuralnetworkbasedhyperchaoticsystemanditsfpgaimplementation,32.96111535848162,landmark,True | ||
| 43 | −4417057079,10.1038/s41467-026-68452-x,,Single-shot matrix-matrix photonic processor based on spatial-spectral hypermultiplexed parallel diffraction,Nature Communications,2026,article,ai_accelerators,8,11.0,11.0,12.24081685075777,11,39.7388,True,True,post,39.107426372564504,landmark,True | 43 | +4402694963,10.1038/s41377-024-01590-3,,Optical neural networks: progress and challenges,Light Science & Applications,2024,article,ai_accelerators,4,135.0,263.0,32.666692686558875,263,39.1398,True,True,post,opticalneuralnetworksprogressandchallenges,32.666692686558875,landmark,True | ||
| 44 | −4409363528,10.1186/s43593-025-00085-x,,Intelligent nanophotonics: when machine learning sheds light,eLight,2025,article,ai_accelerators,5,77.0,77.0,26.229997022692263,77,32.0415,True,True,post,38.981931825388024,landmark,True | 44 | +4210305137,10.1038/s41377-022-00717-8,,Photonic matrix multiplication lights up photonic accelerator and beyond,Light Science & Applications,2022,article,ai_accelerators,3,161.0,306.0,31.53012133083438,563,38.2097,True,True,baseline,photonicmatrixmultiplicationlightsupphotonicacceleratorandbeyond,31.53012133083438,landmark,True | ||
| 45 | −4394727812,10.1126/science.adl1203,,Large-scale photonic chiplet Taichi empowers 160-TOPS/W artificial general intelligence,Science,2024,article,ai_accelerators,4,198.0,308.0,38.256050750798984,308,45.8367,True,False,post,38.256050750798984,landmark,True | 45 | +4414574650,10.1016/j.chaos.2025.117292,,Field and delay effects on synchronization in a multilayer memristive neuronal network with a hub,Chaos Solitons & Fractals,2025,article,ai_accelerators,1,71.0,71.0,27.006304798493694,71,31.2974,False,False,post,fieldanddelayeffectsonsynchronizationinamultilayermemristiveneuronalnetworkwithahub,31.02498130377243,landmark,True | ||
| 46 | −4414574650,10.1016/j.chaos.2025.117292,,Field and delay effects on synchronization in a multilayer memristive neuronal network with a hub,Chaos Solitons & Fractals,2025,article,ai_accelerators,1,71.0,71.0,27.006304798493694,71,31.2974,False,False,post,35.94437869613701,landmark,True | 46 | +2799210008,10.48550/arxiv.1804.09848,1804.09848,Memristor Crossbars with 4.5 Terabits-per-Inch-Square Density and Two Nanometer Dimension,arXiv (Cornell University),2018,preprint,ai_accelerators,2,38.0,109.0,30.82828282828283,154,,True,True,baseline,memristorcrossbarswith45terabitsperinchsquaredensityandtwonanometerdimension,30.82828282828283,landmark,True | ||
| 47 | −7129076810,10.1109/jiot.2026.3665333,,Dual Memristor-Coupled Unidirectional Ring Neural Network: Abundant Hidden Firings and Application in Hardware Image Encryption,IEEE Internet of Things Journal,2026,article,ai_accelerators,7,10.0,10.0,14.941779226828132,10,17.147,True,False,post,35.552205793240454,landmark,True | 47 | +7130433466,10.1109/tcsi.2026.3663432,,A Second-Order Memristor Method to Construct Memristive Neural Networks With Multi-Butterfly and Multi-Scroll Dynamics,IEEE Transactions on Circuits and Systems I Regular Papers,2026,article,ai_accelerators,4,12.0,12.0,17.93013507219376,12,20.5764,True,False,post,asecondordermemristormethodtoconstructmemristiveneuralnetworkswithmultibutterflyandmultiscrolldynamics,30.425644946290728,landmark,True | ||
| 48 | −7128293306,10.1038/s41467-026-69084-x,,Neuromorphic photonic computing with an electro-optic analog memory,Nature Communications,2026,article,ai_accelerators,3,10.0,10.0,11.1280153188707,9,32.5136,True,True,post,35.552205793240454,landmark,True | 48 | +7130516837,10.1142/s0218127426500914,,Gaussian-Function-Driven Chaotic Memristive Dynamics with Application to Image Encryption,International Journal of Bifurcation and Chaos,2026,article,ai_accelerators,3,12.0,12.0,32.16440030557678,12,37.3956,True,False,post,gaussianfunctiondrivenchaoticmemristivedynamicswithapplicationtoimageencryption,30.425644946290728,landmark,True | ||
| 49 | −4413052649,10.1016/j.vlsi.2025.102500,,An attractor-controllable memristive Hopfield neural network and its application on voice encryption,Integration,2025,article,ai_accelerators,4,66.0,66.0,14.175875486381322,66,28.5628,False,False,post,33.41308442176116,landmark,True | 49 | +3121141908,10.1038/s41467-020-20719-7,,An optical neural chip for implementing complex-valued neural network,Nature Communications,2021,article,ai_accelerators,4,124.0,260.0,30.301029200346555,666,36.6979,True,True,baseline,anopticalneuralchipforimplementingcomplexvaluedneuralnetwork,30.301029200346555,landmark,True | ||
| 50 | −4402694963,10.1038/s41377-024-01590-3,,Optical neural networks: progress and challenges,Light Science & Applications,2024,article,ai_accelerators,4,135.0,263.0,32.666692686558875,263,39.1398,True,True,post,32.666692686558875,landmark,True | 50 | +4360605906,10.1109/isscc42615.2023.10067837,,"33.1 A 16nm 32Mb Embedded STT-MRAM with a 6ns Read-Access Time, a 1M-Cycle Write Endurance, 20-Year Retention at 150°C and MTJ-OTP Solutions for Magnetic Immunity",Digest of technical papers/Digest of technical papers - IEEE International Solid-State Circuits Conference,2023,conference-paper,ai_accelerators,2,27.0,53.0,29.22718446601942,69,119.8281,True,False,post,331a16nm32mbembeddedsttmramwitha6nsreadaccesstimea1mcyclewriteendurance20yearretentionat150candmtjotpsolutionsformagneticimmunity,29.22718446601942,landmark,True | ||
| 51 | −7127097285,10.1364/optica.578687,,Nonlinear photonic neuromorphic chips for spiking reinforcement learning,Optica,2026,article,ai_accelerators,7,9.0,9.0,10.015213786983631,9,32.5136,True,True,post,31.99698521391641,landmark,True | 51 | +4413052649,10.1016/j.vlsi.2025.102500,,An attractor-controllable memristive Hopfield neural network and its application on voice encryption,Integration,2025,article,ai_accelerators,4,66.0,66.0,14.175875486381322,66,28.5628,False,False,post,anattractorcontrollablememristivehopfieldneuralnetworkanditsapplicationonvoiceencryption,28.840123465478598,landmark,True | ||
| 52 | −2916516729,10.5555/3323298.3323317,,SLM-DB: Single-Level Key-Value Store with Persistent Memory,Scholarworks@UNIST (Ulsan National Institute of Science and Technology),2019,dissertation,operating_systems,7,19.0,42.0,328.8494623655914,75,,True,True,baseline,328.8494623655914,landmark,True | 52 | +2916516729,10.5555/3323298.3323317,,SLM-DB: Single-Level Key-Value Store with Persistent Memory,Scholarworks@UNIST (Ulsan National Institute of Science and Technology),2019,dissertation,operating_systems,7,19.0,42.0,328.8494623655914,75,,True,True,baseline,slmdbsinglelevelkeyvaluestorewithpersistentmemory,328.8494623655914,landmark,True | ||
| 53 | −4295093682,10.5281/zenodo.19901496,,fast16 as a Second-Order Subversion Attack,,2026,preprint,operating_systems,4,28.0,28.0,1089.5438596491229,28,,True,True,post,99.54617622107328,landmark,True | 53 | +4295093682,10.5281/zenodo.19901496,,fast16 as a Second-Order Subversion Attack,,2026,preprint,operating_systems,4,28.0,28.0,1089.5438596491229,28,,True,True,post,fast16asasecondordersubversionattack,70.99317154134503,landmark,True | ||
| 54 | −7130515337,10.1186/s12912-026-04420-6,,Artificial intelligence literacy and academic resilience in undergraduate nursing students: the mediating role of self-efficacy and artificial intelligence anxiety,BMC Nursing,2026,article,operating_systems,1,13.0,13.0,92.3590525632706,13,118.9868,True,True,post,46.2178675312126,landmark,True | 54 | +25727798,10.48550/arxiv.1903.01955,1903.01955,The Lustre Storage Architecture,arXiv (Cornell University),2019,preprint,operating_systems,3,96.0,112.0,46.00430107526881,206,,True,True,baseline,thelustrestoragearchitecture,46.00430107526881,landmark,True | ||
| 55 | −25727798,10.48550/arxiv.1903.01955,1903.01955,The Lustre Storage Architecture,arXiv (Cornell University),2019,preprint,operating_systems,3,96.0,112.0,46.00430107526881,206,,True,True,baseline,46.00430107526881,landmark,True | 55 | +2930508541,10.4230/oasics.microservices.2020-2022.5,1902.03383,Cloud Programming Simplified: A Berkeley View on Serverless Computing,arXiv (Cornell University),2019,preprint,operating_systems,6,103.0,195.0,43.97867397390838,409,,True,True,baseline,cloudprogrammingsimplifiedaberkeleyviewonserverlesscomputing,43.97867397390838,landmark,True | ||
| 56 | −2930508541,10.4230/oasics.microservices.2020-2022.5,1902.03383,Cloud Programming Simplified: A Berkeley View on Serverless Computing,arXiv (Cornell University),2019,preprint,operating_systems,6,103.0,195.0,43.97867397390838,409,,True,True,baseline,43.97867397390838,landmark,True | 56 | +4404401018,10.1145/3694715.3695964,2312.12456,PowerInfer: Fast Large Language Model Serving with a Consumer-grade GPU,ACM SIGOPS Symposium on Operating Systems Principles (SOSP),2024,conference-paper,operating_systems,10,64.0,133.0,39.39609644087256,133,42.1961,True,True,post,powerinferfastlargelanguagemodelservingwithaconsumergradegpu,39.39609644087256,landmark,True | ||
| 57 | −4404401018,10.1145/3694715.3695964,2312.12456,PowerInfer: Fast Large Language Model Serving with a Consumer-grade GPU,ACM SIGOPS Symposium on Operating Systems Principles (SOSP),2024,conference-paper,operating_systems,10,64.0,133.0,39.39609644087256,133,42.1961,True,True,post,39.39609644087256,landmark,True | 57 | +3182301081,,,Zico: Efficient {GPU} Memory Sharing for Concurrent {DNN} Training,Scholarworks@UNIST (Ulsan National Institute of Science and Technology),2021,dissertation,operating_systems,5,0.0,5.0,37.01492537313433,8,,True,False,baseline,zicoefficientgpumemorysharingforconcurrentdnntraining,37.01492537313433,landmark,True | ||
| 58 | −3182301081,,,Zico: Efficient {GPU} Memory Sharing for Concurrent {DNN} Training,Scholarworks@UNIST (Ulsan National Institute of Science and Technology),2021,dissertation,operating_systems,5,0.0,5.0,37.01492537313433,8,,True,False,baseline,37.01492537313433,landmark,True | 58 | +7130515337,10.1186/s12912-026-04420-6,,Artificial intelligence literacy and academic resilience in undergraduate nursing students: the mediating role of self-efficacy and artificial intelligence anxiety,BMC Nursing,2026,article,operating_systems,1,13.0,13.0,92.3590525632706,13,118.9868,True,True,post,artificialintelligenceliteracyandacademicresilienceinundergraduatenursingstudentsthemediatingroleofselfefficacyandartificialintelligenceanxiety,32.96111535848162,landmark,True | ||
| 59 | −7162190207,10.1016/j.dss.2026.114696,,"AI-driven mental health therapy: A comparative study of emotional clarity and stigma reduction across journaling, human-guided therapy, and AI-guided therapy",Decision Support Systems,2026,article,operating_systems,1,10.0,10.0,5.225225225225225,10,63.1822,False,False,post,35.552205793240454,landmark,True | 59 | +2975712713,10.1145/3341301.3359642,,A generic communication scheduler for distributed DNN training acceleration,,2019,conference-paper,operating_systems,8,53.0,119.0,31.997431506849313,321,32.6252,True,False,baseline,agenericcommunicationschedulerfordistributeddnntrainingacceleration,31.997431506849313,landmark,True | ||
| 60 | −2975712713,10.1145/3341301.3359642,,A generic communication scheduler for distributed DNN training acceleration,,2019,conference-paper,operating_systems,8,53.0,119.0,31.997431506849313,321,32.6252,True,False,baseline,31.997431506849313,landmark,True | 60 | +4384697207,10.22215/etd/2023-15552,,Methods and Techniques for Inter-cloud Data Transfers,,2023,dissertation,operating_systems,4,1.0,1.0,28.864864864864863,1,,True,True,post,methodsandtechniquesforinterclouddatatransfers,28.864864864864863,landmark,True | ||
| 61 | −4384697207,10.22215/etd/2023-15552,,Methods and Techniques for Inter-cloud Data Transfers,,2023,dissertation,operating_systems,4,1.0,1.0,28.864864864864863,1,,True,True,post,28.864864864864863,landmark,True | 61 | +4394944658,10.1145/3627703.3629578,,"Orion: Interference-aware, Fine-grained GPU Sharing for ML Applications",,2024,conference-paper,operating_systems,7,56.0,97.0,28.73249138920781,97,30.7746,True,False,post,orioninterferenceawarefinegrainedgpusharingformlapplications,28.73249138920781,landmark,True | ||
| 62 | −4394944658,10.1145/3627703.3629578,,"Orion: Interference-aware, Fine-grained GPU Sharing for ML Applications",,2024,conference-paper,operating_systems,7,56.0,97.0,28.73249138920781,97,30.7746,True,False,post,28.73249138920781,landmark,True | 62 | +7162190207,10.1016/j.dss.2026.114696,,"AI-driven mental health therapy: A comparative study of emotional clarity and stigma reduction across journaling, human-guided therapy, and AI-guided therapy",Decision Support Systems,2026,article,operating_systems,1,10.0,10.0,5.225225225225225,10,63.1822,False,False,post,aidrivenmentalhealththerapyacomparativestudyofemotionalclarityandstigmareductionacrossjournalinghumanguidedtherapyandaiguidedtherapy,25.35470412190894,landmark,True | ||
| 63 | −3012028616,10.1145/3373376.3378512,,Catalyzer,International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS),2020,conference-paper,operating_systems,6,56.0,88.0,24.84845663205922,281,26.591,True,False,baseline,24.84845663205922,landmark,True | 63 | +4295682935,,,CodaLab Competitions An Open Source Platform to Organize Scientific Challenges,HAL (Le Centre pour la Communication Scientifique Directe),2022,report,operating_systems,4,28.0,68.0,22.289935364727608,75,,True,True,baseline,codalabcompetitionsanopensourceplatformtoorganizescientificchallenges,22.289935364727608,landmark,True | ||
| 64 | −4295682935,,,CodaLab Competitions An Open Source Platform to Organize Scientific Challenges,HAL (Le Centre pour la Communication Scientifique Directe),2022,report,operating_systems,4,28.0,68.0,22.289935364727608,75,,True,True,baseline,22.289935364727608,landmark,True | 64 | +3152809665,10.1145/3445814.3446701,,"Nightcore: efficient and scalable serverless computing for latency-sensitive, interactive microservices",,2021,conference-paper,operating_systems,5,33.0,78.0,21.88714698058747,215,30.1787,True,True,baseline,nightcoreefficientandscalableserverlesscomputingforlatencysensitiveinteractivemicroservices,21.88714698058747,landmark,True | ||
| 65 | −3152809665,10.1145/3445814.3446701,,"Nightcore: efficient and scalable serverless computing for latency-sensitive, interactive microservices",,2021,conference-paper,operating_systems,5,33.0,78.0,21.88714698058747,215,30.1787,True,True,baseline,21.88714698058747,landmark,True | 65 | +3010663313,10.1145/3373376.3378515,,FlatStore: An Efficient Log-Structured Key-Value Storage Engine for Persistent Memory,International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS),2020,conference-paper,operating_systems,5,38.0,70.0,21.67711021009952,165,23.8709,True,False,baseline,flatstoreanefficientlogstructuredkeyvaluestorageengineforpersistentmemory,21.67711021009952,landmark,True | ||
| 66 | −3010663313,10.1145/3373376.3378515,,FlatStore: An Efficient Log-Structured Key-Value Storage Engine for Persistent Memory,International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS),2020,conference-paper,operating_systems,5,38.0,70.0,21.67711021009952,165,23.8709,True,False,baseline,21.67711021009952,landmark,True | 66 | +3092732687,,,PENGEMBANGAN SISTEM INFORMASI PENERIMAANMAHASISWA BARU DENGAN METODE BUSINESSPROCESS AUTOMATION (STUDI KASUS: INSTITUTTEKNOLOGI KALIMANTAN),,2019,dissertation,operating_systems,1,0.0,1.0,21.373831775700936,1,,True,False,baseline,pengembangansisteminformasipenerimaanmahasiswabarudenganmetodebusinessprocessautomationstudikasusinstitutteknologikalimantan,21.373831775700936,landmark,True | ||
| 67 | −3023238978,10.1145/3342195.3387524,,Autopilot,,2020,conference-paper,operating_systems,5,53.0,76.0,21.46003072768751,303,26.591,True,True,baseline,21.46003072768751,landmark,True | 67 | +3138262672,10.5445/ir/1000097700,,SimuBoost: Scalable Parallelization of Functional System Simulation,Repository KITopen (Karlsruhe Institute of Technology),2019,dissertation,operating_systems,5,3.0,3.0,20.57142857142857,3,,True,True,baseline,simuboostscalableparallelizationoffunctionalsystemsimulation,20.57142857142857,landmark,True | ||
| 68 | −3092732687,,,PENGEMBANGAN SISTEM INFORMASI PENERIMAANMAHASISWA BARU DENGAN METODE BUSINESSPROCESS AUTOMATION (STUDI KASUS: INSTITUTTEKNOLOGI KALIMANTAN),,2019,dissertation,operating_systems,1,0.0,1.0,21.373831775700936,1,,True,False,baseline,21.373831775700936,landmark,True | 68 | +4366587887,10.3390/su15086917,,Promising Emerging Technologies for Teaching and Learning: Recent Developments and Future Challenges,Sustainability,2023,article,operating_systems,1,44.0,83.0,19.453189395067895,108,24.9088,True,True,post,promisingemergingtechnologiesforteachingandlearningrecentdevelopmentsandfuturechallenges,19.453189395067895,landmark,True | ||
| 69 | −7131624127,10.1109/tcyb.2026.3665802,,Zentropy-Enhanced Multigranularity Knowledge Modeling for Robust Feature Selection,IEEE Transactions on Cybernetics,2026,article,operating_systems,1,6.0,6.0,16.941652365775926,6,21.3832,True,False,post,21.331323475944274,landmark,True | 69 | +3134501457,,,KLASIFIKASI INDEKS PEMBANGUNAN MANUSIA KABUPATEN/KOTA DI INDONESIA MENGGUNAKANMETODE RANDOM FOREST,,2020,dissertation,operating_systems,1,1.0,2.0,18.809744779582367,5,,True,False,baseline,klasifikasiindekspembangunanmanusiakabupatenkotadiindonesiamenggunakanmetoderandomforest,18.809744779582367,landmark,True | ||
| 70 | −7127083763,10.1038/s41746-026-02414-x,,Digital medicine’s international race for regulatory sandboxes and voluntary alternative pathways picks up tempo,npj Digital Medicine,2026,article,operating_systems,1,6.0,6.0,7.93984962406015,6,44.8817,True,True,post,21.331323475944274,landmark,True | 70 | +4385215131,10.23919/vlsitechnologyandcir57934.2023.10185294,,QLC Programmable 3D Ferroelectric NAND Flash Memory by Memory Window Expansion using Cell Stack Engineering,IEEE Symposium on VLSI Technology and Circuits (VLSI Technology and Circuits),2023,conference-paper,operating_systems,1,28.0,55.0,18.331575035365766,70,35.7909,True,False,post,qlcprogrammable3dferroelectricnandflashmemorybymemorywindowexpansionusingcellstackengineering,18.331575035365766,landmark,True | ||
| 71 | −2792476970,10.1145/3159450.3159498,,Assessing Bootstrap,ACM Technical Symposium on Computer Science Education (SIGCSE),2018,conference-paper,operating_systems,1,43.0,51.0,20.74425370963049,68,15.3851,True,False,baseline,20.74425370963049,landmark,True | 71 | +2807211499,,,Towards Efficient and Flexible Object Storage Using Resource and Functional Partitioning,VTechWorks (Virginia Tech),2018,dissertation,operating_systems,4,2.0,2.0,17.98848368522073,3,,True,False,baseline,towardsefficientandflexibleobjectstorageusingresourceandfunctionalpartitioning,17.98848368522073,landmark,True | ||
| 72 | −3138262672,10.5445/ir/1000097700,,SimuBoost: Scalable Parallelization of Functional System Simulation,Repository KITopen (Karlsruhe Institute of Technology),2019,dissertation,operating_systems,5,3.0,3.0,20.57142857142857,3,,True,True,baseline,20.57142857142857,landmark,True | 72 | +4407217670,10.1145/3669940.3707256,2405.04437,vAttention: Dynamic Memory Management for Serving LLMs without PagedAttention,ACM International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS),2025,conference-paper,operating_systems,7,40.0,40.0,34.965113033770585,40,35.3801,True,True,post,vattentiondynamicmemorymanagementforservingllmswithoutpagedattention,17.478862706350665,landmark,True | ||
| 73 | −3021475380,10.1145/3342195.3387532,,Keystone,,2020,conference-paper,operating_systems,5,90.0,144.0,20.409055296688795,379,20.3598,True,True,baseline,20.409055296688795,landmark,True | 73 | +1653864426,10.1007/978-981-13-0599-3,,Inside Solid State Drives (SSDs),Springer series in advanced microelectronics,2018,book,operating_systems,2,51.0,57.0,16.97693817468106,82,6.0183,False,False,baseline,insidesolidstatedrivesssds,16.97693817468106,landmark,True | ||
| 74 | −4407217670,10.1145/3669940.3707256,2405.04437,vAttention: Dynamic Memory Management for Serving LLMs without PagedAttention,ACM International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS),2025,conference-paper,operating_systems,7,40.0,40.0,34.965113033770585,40,35.3801,True,True,post,20.250354195006764,landmark,True | 74 | +2798337732,10.1145/3190508.3190524,,Reducing DRAM footprint with NVM in Facebook,,2018,conference-paper,operating_systems,5,27.0,55.0,16.76435545739858,124,15.8731,True,True,baseline,reducingdramfootprintwithnvminfacebook,16.76435545739858,landmark,True | ||
| 75 | −4366587887,10.3390/su15086917,,Promising Emerging Technologies for Teaching and Learning: Recent Developments and Future Challenges,Sustainability,2023,article,operating_systems,1,44.0,83.0,19.453189395067895,108,24.9088,True,True,post,19.453189395067895,landmark,True | 75 | +4396654316,10.1002/sd.3021,,"Digital financial inclusion, financial stability, and sustainable development: Evidence from a quantile‐on‐quantile regression and wavelet coherence",Sustainable Development,2024,article,operating_systems,1,38.0,53.0,15.956977383908523,53,20.2822,True,True,post,digitalfinancialinclusionfinancialstabilityandsustainabledevelopmentevidencefromaquantileonquantileregressionandwaveletcoherence,15.956977383908523,landmark,True | ||
| 76 | −3134501457,,,KLASIFIKASI INDEKS PEMBANGUNAN MANUSIA KABUPATEN/KOTA DI INDONESIA MENGGUNAKANMETODE RANDOM FOREST,,2020,dissertation,operating_systems,1,1.0,2.0,18.809744779582367,5,,True,False,baseline,18.809744779582367,landmark,True | 76 | +3181035463,,,{ZNS}: Avoiding the Block Interface Tax for Flash-based SSDs,USENIX Annual Technical Conference,2021,conference-paper,operating_systems,4,26.0,46.0,15.661939184411095,82,17.1134,False,False,baseline,znsavoidingtheblockinterfacetaxforflashbasedssds,15.661939184411095,landmark,True | ||
| 77 | −2982169647,10.1038/s41586-019-1666-5,,Quantum supremacy using a programmable superconducting processor,Nature,2019,article,quantum_computing,4,941.0,2260.0,343.6453226447595,7695,402.3374,True,True,baseline,343.6453226447595,landmark,True | 77 | +2982169647,10.1038/s41586-019-1666-5,,Quantum supremacy using a programmable superconducting processor,Nature,2019,article,quantum_computing,4,941.0,2260.0,343.6453226447595,7695,402.3374,True,True,baseline,quantumsupremacyusingaprogrammablesuperconductingprocessor,343.6453226447595,landmark,True | ||
| 78 | −2781738013,10.22331/q-2018-08-06-79,,Quantum Computing in the NISQ era and beyond,Quantum,2018,article,quantum_computing,2,386.0,1026.0,193.65188671645743,8559,285.8725,True,True,baseline,193.65188671645743,landmark,True | 78 | +2781738013,10.22331/q-2018-08-06-79,,Quantum Computing in the NISQ era and beyond,Quantum,2018,article,quantum_computing,2,386.0,1026.0,193.65188671645743,8559,285.8725,True,True,baseline,quantumcomputinginthenisqeraandbeyond,193.65188671645743,landmark,True | ||
| 79 | −4396986598,10.48550/arxiv.2405.08810,2405.08810,Quantum computing with Qiskit,arXiv (Cornell University),2024,preprint,quantum_computing,2,148.0,208.0,181.45149859248218,208,,True,True,post,181.45149859248218,landmark,True | 79 | +4396986598,10.48550/arxiv.2405.08810,2405.08810,Quantum computing with Qiskit,arXiv (Cornell University),2024,preprint,quantum_computing,2,148.0,208.0,181.45149859248218,208,,True,True,post,quantumcomputingwithqiskit,181.45149859248218,landmark,True | ||
| 80 | −4408847956,10.1038/s42254-025-00813-9,2405.00781,Barren plateaus in variational quantum computing,Nature Reviews Physics,2025,review,quantum_computing,2,257.0,257.0,31.907270486752928,257,34.4334,False,True,post,130.10852570291846,landmark,True | 80 | +4408847956,10.1038/s42254-025-00813-9,2405.00781,Barren plateaus in variational quantum computing,Nature Reviews Physics,2025,review,quantum_computing,2,257.0,257.0,31.907270486752928,257,34.4334,False,True,post,barrenplateausinvariationalquantumcomputing,112.30169288830302,landmark,True | ||
| 81 | −4407158326,10.1038/s41586-024-08404-x,,Distributed quantum computing across an optical network link,Nature,2025,article,quantum_computing,5,192.0,192.0,65.40466790073914,192,79.0635,True,True,post,97.20170013603247,landmark,True | 81 | +3107463944,10.1126/science.abe8770,,Quantum computational advantage using photons,Science,2020,article,quantum_computing,3,294.0,769.0,96.1833097432046,2267,120.9449,True,True,baseline,quantumcomputationaladvantageusingphotons,96.1833097432046,landmark,True | ||
| 82 | −3107463944,10.1126/science.abe8770,,Quantum computational advantage using photons,Science,2020,article,quantum_computing,3,294.0,769.0,96.1833097432046,2267,120.9449,True,True,baseline,96.1833097432046,landmark,True | 82 | +4213212652,10.1103/revmodphys.94.015004,,Noisy intermediate-scale quantum algorithms,Reviews of Modern Physics,2022,article,quantum_computing,2,509.0,908.0,93.55996787058045,1718,108.1665,True,True,baseline,noisyintermediatescalequantumalgorithms,93.55996787058045,landmark,True | ||
| 83 | −4213212652,10.1103/revmodphys.94.015004,,Noisy intermediate-scale quantum algorithms,Reviews of Modern Physics,2022,article,quantum_computing,2,509.0,908.0,93.55996787058045,1718,108.1665,True,True,baseline,93.55996787058045,landmark,True | 83 | +4405183524,10.1038/s41586-024-08449-y,,Quantum error correction below the surface code threshold,Nature,2024,article,quantum_computing,3,394.0,751.0,93.2801756943183,751,111.7642,True,True,post,quantumerrorcorrectionbelowthesurfacecodethreshold,93.2801756943183,landmark,True | ||
| 84 | −4405183524,10.1038/s41586-024-08449-y,,Quantum error correction below the surface code threshold,Nature,2024,article,quantum_computing,3,394.0,751.0,93.2801756943183,751,111.7642,True,True,post,93.2801756943183,landmark,True | 84 | +4386285839,10.3390/admsci13090196,,Managing the Strategic Transformation of Higher Education through Artificial Intelligence,Administrative Sciences,2023,article,quantum_computing,2,165.0,380.0,89.06279482079277,543,127.3637,True,True,post,managingthestrategictransformationofhighereducationthroughartificialintelligence,89.06279482079277,landmark,True | ||
| 85 | −1868882999,10.82444/warw.33678349,,Formal verification techniques using quantum process calculus,Warwick Research Archive Portal (University of Warwick),2026,dissertation,quantum_computing,5,26.0,26.0,795.7491039426524,27,,True,True,post,92.4357350624252,landmark,True | 85 | +4407158326,10.1038/s41586-024-08404-x,,Distributed quantum computing across an optical network link,Nature,2025,article,quantum_computing,5,192.0,192.0,65.40466790073914,192,79.0635,True,True,post,distributedquantumcomputingacrossanopticalnetworklink,83.8985409904832,landmark,True | ||
| 86 | −4406693713,10.1038/s41586-024-08406-9,,Scaling and networking a modular photonic quantum computer,Nature,2025,article,quantum_computing,4,178.0,178.0,60.63557753297692,178,73.6539,True,True,post,90.1140761677801,landmark,True | 86 | +3156168805,10.15488/11476,,Ultra-low vibration closed-cycle cryogenic surface-electrode ion trap apparatus,Institutional Repository of Leibniz Universität Hannover (Leibniz Universität Hannover),2021,dissertation,quantum_computing,2,10.0,18.0,81.87032967032967,25,,True,True,baseline,ultralowvibrationclosedcyclecryogenicsurfaceelectrodeiontrapapparatus,81.87032967032967,landmark,True | ||
| 87 | −4386285839,10.3390/admsci13090196,,Managing the Strategic Transformation of Higher Education through Artificial Intelligence,Administrative Sciences,2023,article,quantum_computing,2,165.0,380.0,89.06279482079277,543,127.3637,True,True,post,89.06279482079277,landmark,True | 87 | +4321610982,10.1038/s41586-022-05434-1,,Suppressing quantum errors by scaling a surface code logical qubit,Nature,2023,article,quantum_computing,1,462.0,879.0,80.69640995309555,1083,94.0878,True,True,post,suppressingquantumerrorsbyscalingasurfacecodelogicalqubit,80.69640995309555,landmark,True | ||
| 88 | −7160873310,10.55124/jqca.v1i1.101,,Enhancing the Performance Prediction of Quantum Computing Algorithms using Gradient Boosting and Ada Boost Regression,Journal of Quantum Computing and Advanced Algorithms,2026,article,quantum_computing,4,24.0,24.0,26.707236765289682,24,83.0902,True,True,post,85.3252939037771,landmark,True | 88 | +4406693713,10.1038/s41586-024-08406-9,,Scaling and networking a modular photonic quantum computer,Nature,2025,article,quantum_computing,4,178.0,178.0,60.63557753297692,178,73.6539,True,True,post,scalingandnetworkingamodularphotonicquantumcomputer,77.78093904326046,landmark,True | ||
| 89 | −4407091026,10.1016/s2589-7500(24)00267-x,,"Screening performance and characteristics of breast cancer detected in the Mammography Screening with Artificial Intelligence trial (MASAI): a randomised, controlled, parallel-group, non-inferiority, single-blinded, screening accuracy study",The Lancet Digital Health,2025,article,quantum_computing,1,164.0,164.0,55.86648716521469,164,67.8282,True,True,post,83.02645219952774,landmark,True | 89 | +2788945937,10.37686/qrl.v1i2.80,,Classification with Quantum Neural Networks on Near Term Processors,,2020,report,quantum_computing,1,188.0,222.0,77.25930521091811,332,,True,True,baseline,classificationwithquantumneuralnetworksonneartermprocessors,77.25930521091811,landmark,True | ||
| 90 | −3156168805,10.15488/11476,,Ultra-low vibration closed-cycle cryogenic surface-electrode ion trap apparatus,Institutional Repository of Leibniz Universität Hannover (Leibniz Universität Hannover),2021,dissertation,quantum_computing,2,10.0,18.0,81.87032967032967,25,,True,True,baseline,81.87032967032967,landmark,True | 90 | +3174122836,10.1201/9781003358817-7,,Quantum Computing 40 Years Later,CRC Press eBooks,2023,book-chapter,quantum_computing,3,84.0,139.0,76.8491680085883,123,68.2265,True,True,baseline,quantumcomputing40yearslater,76.8491680085883,landmark,True | ||
| 91 | −4321610982,10.1038/s41586-022-05434-1,,Suppressing quantum errors by scaling a surface code logical qubit,Nature,2023,article,quantum_computing,1,462.0,879.0,80.69640995309555,1083,94.0878,True,True,post,80.69640995309555,landmark,True | 91 | +4389373471,10.1038/s41586-023-06927-3,,Logical quantum processor based on reconfigurable atom arrays,Nature,2023,article,quantum_computing,3,242.0,826.0,75.83075611064497,1099,96.5476,True,True,post,logicalquantumprocessorbasedonreconfigurableatomarrays,75.83075611064497,landmark,True | ||
| 92 | −2963194964,,,Lämmönsäätely suprajohtavissa mikroaaltopiireissä,Aaltodoc (Aalto University),2019,dissertation,quantum_computing,1,15.0,22.0,80.11469534050178,32,,True,False,baseline,80.11469534050178,landmark,True | 92 | +4380627387,10.1038/s41586-023-06096-3,,Evidence for the utility of quantum computing before fault tolerance,Nature,2023,article,quantum_computing,3,422.0,821.0,75.37173216324398,1033,90.7495,True,True,post,evidencefortheutilityofquantumcomputingbeforefaulttolerance,75.37173216324398,landmark,True | ||
| 93 | −1521266393,10.1103/revmodphys.93.025005,,Circuit quantum electrodynamics,Reviews of Modern Physics,2021,article,quantum_computing,1,362.0,674.0,78.54959108089838,1931,89.363,True,True,baseline,78.54959108089838,landmark,True | 93 | +4294786246,,,Time-optimal holonomic quantum computation,KTH Publication Database DiVA (KTH Royal Institute of Technology),2022,dissertation,quantum_computing,1,7.0,10.0,74.89035087719299,13,,True,True,baseline,timeoptimalholonomicquantumcomputation,74.89035087719299,landmark,True | ||
| 94 | −4321649614,10.1103/dmn4-snfx,,Quantum-selected configuration interaction: Classical diagonalization of Hamiltonians in subspaces selected by quantum computers,Physical Review Research,2026,article,quantum_computing,2,22.0,22.0,24.48163370151554,22,43.3514,True,True,post,78.21485274512901,landmark,True | 94 | +4407091026,10.1016/s2589-7500(24)00267-x,,"Screening performance and characteristics of breast cancer detected in the Mammography Screening with Artificial Intelligence trial (MASAI): a randomised, controlled, parallel-group, non-inferiority, single-blinded, screening accuracy study",The Lancet Digital Health,2025,article,quantum_computing,1,164.0,164.0,55.86648716521469,164,67.8282,True,True,post,screeningperformanceandcharacteristicsofbreastcancerdetectedinthemammographyscreeningwithartificialintelligencetrialmasaiarandomisedcontrolledparallelgroupnoninferioritysingleblindedscreeningaccuracystudy,71.66333709603774,landmark,True | ||
| 95 | −2788945937,10.37686/qrl.v1i2.80,,Classification with Quantum Neural Networks on Near Term Processors,,2020,report,quantum_computing,1,188.0,222.0,77.25930521091811,332,,True,True,baseline,77.25930521091811,landmark,True | 95 | +2798434869,10.1038/s41586-019-0980-2,,Supervised learning with quantum-enhanced feature spaces,Nature,2019,article,quantum_computing,1,182.0,449.0,68.27289817145886,2519,80.6977,False,True,baseline,supervisedlearningwithquantumenhancedfeaturespaces,68.27289817145886,landmark,True | ||
| 96 | −3174122836,10.1201/9781003358817-7,,Quantum Computing 40 Years Later,CRC Press eBooks,2023,book-chapter,quantum_computing,3,84.0,139.0,76.8491680085883,123,68.2265,True,True,baseline,76.8491680085883,landmark,True | 96 | +4409126690,10.1007/s11227-025-07047-7,2410.00916,"IBM quantum computers: evolution, performance, and future directions",The Journal of Supercomputing,2025,article,quantum_computing,4,151.0,151.0,51.438046109435476,151,61.5863,True,True,post,ibmquantumcomputersevolutionperformanceandfuturedirections,65.98270671647376,landmark,True | ||
| 97 | −4408612646,10.1038/s41586-025-08739-z,,Microsatellite-based real-time quantum key distribution,Nature,2025,article,quantum_computing,3,151.0,151.0,51.438046109435476,151,62.4186,False,True,post,76.44508708615054,landmark,True | 97 | +4408612646,10.1038/s41586-025-08739-z,,Microsatellite-based real-time quantum key distribution,Nature,2025,article,quantum_computing,3,151.0,151.0,51.438046109435476,151,62.4186,False,True,post,microsatellitebasedrealtimequantumkeydistribution,65.98270671647376,landmark,True | ||
| 98 | −4409126690,10.1007/s11227-025-07047-7,2410.00916,"IBM quantum computers: evolution, performance, and future directions",The Journal of Supercomputing,2025,article,quantum_computing,4,151.0,151.0,51.438046109435476,151,61.5863,True,True,post,76.44508708615054,landmark,True | 98 | +1868882999,10.82444/warw.33678349,,Formal verification techniques using quantum process calculus,Warwick Research Archive Portal (University of Warwick),2026,dissertation,quantum_computing,5,26.0,26.0,795.7491039426524,27,,True,True,post,formalverificationtechniquesusingquantumprocesscalculus,65.92223071696324,landmark,True | ||
| 99 | −4389373471,10.1038/s41586-023-06927-3,,Logical quantum processor based on reconfigurable atom arrays,Nature,2023,article,quantum_computing,3,242.0,826.0,75.83075611064497,1099,96.5476,True,True,post,75.83075611064497,landmark,True | 99 | +2482126025,10.1038/s41567-018-0124-x,,Characterizing quantum supremacy in near-term devices,Nature Physics,2018,article,quantum_computing,1,219.0,345.0,65.11686249237604,1156,65.4918,False,True,baseline,characterizingquantumsupremacyinneartermdevices,65.11686249237604,landmark,True | ||
| 100 | −4380627387,10.1038/s41586-023-06096-3,,Evidence for the utility of quantum computing before fault tolerance,Nature,2023,article,quantum_computing,3,422.0,821.0,75.37173216324398,1033,90.7495,True,True,post,75.37173216324398,landmark,True | 100 | +2950805899,10.1063/1.5089550,,A quantum engineer's guide to superconducting qubits,Applied Physics Reviews,2019,article,quantum_computing,1,162.0,416.0,63.255068239035374,2004,77.9349,True,True,baseline,aquantumengineersguidetosuperconductingqubits,63.255068239035374,landmark,True | ||
| 101 | −4294786246,,,Time-optimal holonomic quantum computation,KTH Publication Database DiVA (KTH Royal Institute of Technology),2022,dissertation,quantum_computing,1,7.0,10.0,74.89035087719299,13,,True,True,baseline,74.89035087719299,landmark,True | 101 | +3173899054,10.1103/physrevlett.127.180501,,Strong Quantum Computational Advantage Using a Superconducting Quantum Processor,Physical Review Letters,2021,article,quantum_computing,4,274.0,540.0,62.93290680071977,1060,68.1911,True,True,baseline,strongquantumcomputationaladvantageusingasuperconductingquantumprocessor,62.93290680071977,landmark,True | ||
| 102 | −7117963061,10.1016/j.rser.2025.116664,,"Toward sustainable data center operation: A review on existing infrastructures, integrated smart energy management frameworks, and future perspectives",Renewable and Sustainable Energy Reviews,2026,article,sustainable_computing,3,30.0,30.0,213.13627514600907,30,274.5849,False,False,post,106.65661737972137,landmark,True | 102 | +4362707075,10.48550/arxiv.2304.03271,2304.03271,"Making AI Less ""Thirsty"": Uncovering and Addressing the Secret Water Footprint of AI Models",arXiv (Cornell University),2023,preprint,sustainable_computing,2,66.0,133.0,93.25822253324003,162,,True,True,post,makingailessthirstyuncoveringandaddressingthesecretwaterfootprintofaimodels,93.25822253324003,landmark,True | ||
| 103 | −4362707075,10.48550/arxiv.2304.03271,2304.03271,"Making AI Less ""Thirsty"": Uncovering and Addressing the Secret Water Footprint of AI Models",arXiv (Cornell University),2023,preprint,sustainable_computing,2,66.0,133.0,93.25822253324003,162,,True,True,post,93.25822253324003,landmark,True | 103 | +2963840171,10.1109/comst.2018.2812301,1802.09345,"Information and Communications Technologies for Sustainable Development Goals: State-of-the-Art, Needs and Perspectives",IEEE Communications Surveys & Tutorials,2018,article,sustainable_computing,2,95.0,155.0,82.1805490963324,613,105.2524,True,True,baseline,informationandcommunicationstechnologiesforsustainabledevelopmentgoalsstateoftheartneedsandperspectives,82.1805490963324,landmark,True | ||
| 104 | −4411368489,10.1145/3724499,,Making AI Less 'Thirsty',Communications of the ACM,2025,article,sustainable_computing,2,163.0,163.0,37.38016172506738,163,37.1417,True,True,post,82.52019334465257,landmark,True | 104 | +7117963061,10.1016/j.rser.2025.116664,,"Toward sustainable data center operation: A review on existing infrastructures, integrated smart energy management frameworks, and future perspectives",Renewable and Sustainable Energy Reviews,2026,article,sustainable_computing,3,30.0,30.0,213.13627514600907,30,274.5849,False,False,post,towardsustainabledatacenteroperationareviewonexistinginfrastructuresintegratedsmartenergymanagementframeworksandfutureperspectives,76.06411236572681,landmark,True | ||
| 105 | −2963840171,10.1109/comst.2018.2812301,1802.09345,"Information and Communications Technologies for Sustainable Development Goals: State-of-the-Art, Needs and Perspectives",IEEE Communications Surveys & Tutorials,2018,article,sustainable_computing,2,95.0,155.0,82.1805490963324,613,105.2524,True,True,baseline,82.1805490963324,landmark,True | 105 | +4411368489,10.1145/3724499,,Making AI Less 'Thirsty',Communications of the ACM,2025,article,sustainable_computing,2,163.0,163.0,37.38016172506738,163,37.1417,True,True,post,makingailessthirsty,71.22636552837896,landmark,True | ||
| 106 | −7140797778,10.1109/tetci.2026.3671111,,Carbon Footprint Efficiency Ratio: A Unified Indicator for Green Evaluation of Evolutionary Algorithms,IEEE Transactions on Emerging Topics in Computational Intelligence,2026,article,sustainable_computing,5,20.0,20.0,29.883558453656264,20,34.2939,True,False,post,71.10441158648091,landmark,True | 106 | +4403458785,10.1186/s41239-024-00490-1,,"Artificial intelligence in higher education: exploring faculty use, self-efficacy, distinct profiles, and professional development needs",International Journal of Educational Technology in Higher Education,2024,article,sustainable_computing,1,72.0,206.0,62.021459265757656,206,78.8326,True,True,post,artificialintelligenceinhighereducationexploringfacultyuseselfefficacydistinctprofilesandprofessionaldevelopmentneeds,62.021459265757656,landmark,True | ||
| 107 | −4415057924,10.1016/j.ynexs.2026.100162,2509.07218,Electricity demand and grid impacts of AI data centers: Challenges and prospects,Nexus,2026,article,sustainable_computing,3,18.0,18.0,26.89520260829064,18,29.1498,True,True,post,63.99397042783282,landmark,True | 107 | +2892611063,10.1007/978-3-030-00253-4_8,,Improving Big Data Centers Energy Efficiency: Traffic Based Model and Method,"Studies in systems, decision and control",2018,book-chapter,sustainable_computing,3,28.0,50.0,58.75865606565786,88,58.8035,False,False,baseline,improvingbigdatacentersenergyefficiencytrafficbasedmodelandmethod,58.75865606565786,landmark,True | ||
| 108 | −4403458785,10.1186/s41239-024-00490-1,,"Artificial intelligence in higher education: exploring faculty use, self-efficacy, distinct profiles, and professional development needs",International Journal of Educational Technology in Higher Education,2024,article,sustainable_computing,1,72.0,206.0,62.021459265757656,206,78.8326,True,True,post,62.021459265757656,landmark,True | 108 | +7140797778,10.1109/tetci.2026.3671111,,Carbon Footprint Efficiency Ratio: A Unified Indicator for Green Evaluation of Evolutionary Algorithms,IEEE Transactions on Emerging Topics in Computational Intelligence,2026,article,sustainable_computing,5,20.0,20.0,29.883558453656264,20,34.2939,True,False,post,carbonfootprintefficiencyratioaunifiedindicatorforgreenevaluationofevolutionaryalgorithms,50.70940824381788,landmark,True | ||
| 109 | −2892611063,10.1007/978-3-030-00253-4_8,,Improving Big Data Centers Energy Efficiency: Traffic Based Model and Method,"Studies in systems, decision and control",2018,book-chapter,sustainable_computing,3,28.0,50.0,58.75865606565786,88,58.8035,False,False,baseline,58.75865606565786,landmark,True | 109 | +4308245305,10.48550/arxiv.2211.02001,2211.02001,"Estimating the Carbon Footprint of BLOOM, a 176B Parameter Language Model",arXiv (Cornell University),2022,preprint,sustainable_computing,2,24.0,94.0,49.0919881305638,178,,True,True,baseline,estimatingthecarbonfootprintofblooma176bparameterlanguagemodel,49.0919881305638,landmark,True | ||
| 110 | −7131638452,10.1007/s12525-026-00877-0,,Digital product passports,Electronic Markets,2026,article,sustainable_computing,1,14.0,14.0,13.680608365019012,14,89.8458,True,True,post,49.77308811053664,landmark,True | 110 | +4415057924,10.1016/j.ynexs.2026.100162,2509.07218,Electricity demand and grid impacts of AI data centers: Challenges and prospects,Nexus,2026,article,sustainable_computing,3,18.0,18.0,26.89520260829064,18,29.1498,True,True,post,electricitydemandandgridimpactsofaidatacenterschallengesandprospects,45.63846741943609,landmark,True | ||
| 111 | −4308245305,10.48550/arxiv.2211.02001,2211.02001,"Estimating the Carbon Footprint of BLOOM, a 176B Parameter Language Model",arXiv (Cornell University),2022,preprint,sustainable_computing,2,24.0,94.0,49.0919881305638,178,,True,True,baseline,49.0919881305638,landmark,True | 111 | +4399913870,10.1016/j.neucom.2024.128096,,A review of green artificial intelligence: Towards a more sustainable future,Neurocomputing,2024,article,sustainable_computing,3,244.0,466.0,42.08809549196657,466,47.9661,True,True,post,areviewofgreenartificialintelligencetowardsamoresustainablefuture,42.08809549196657,landmark,True | ||
| 112 | −7129692983,10.1109/tnse.2026.3665604,,Spatio-Temporal Coordinated Operation Strategy of Data Centers Considering Virtual Storage System via Two-Stage Distributionally Robust Optimization,IEEE Transactions on Network Science and Engineering,2026,article,sustainable_computing,4,13.0,13.0,92.3590525632706,13,118.9868,True,True,post,46.2178675312126,landmark,True | 112 | +4391530352,10.1016/j.ijrefrig.2024.02.007,,"Data centers cooling: A critical review of techniques, challenges, and energy saving solutions",International Journal of Refrigeration,2024,article,sustainable_computing,3,82.0,173.0,38.56480172355753,173,54.4861,False,False,post,datacenterscoolingacriticalreviewoftechniqueschallengesandenergysavingsolutions,38.56480172355753,landmark,True | ||
| 113 | −7128511066,10.1016/j.ssaho.2026.102560,,"The impacts of globalization, institutional quality, and digital technology innovation on OECD countries sustainable digital economic growth",Social Sciences & Humanities Open,2026,article,sustainable_computing,1,13.0,13.0,92.3590525632706,13,118.9868,True,True,post,46.2178675312126,landmark,True | 113 | +4385481791,10.1145/3604930.3605705,,Reducing the Carbon Impact of Generative AI Inference (today and in 2035),,2023,conference-paper,sustainable_computing,5,44.0,110.0,36.66315007073153,127,64.935,True,True,post,reducingthecarbonimpactofgenerativeaiinferencetodayandin2035,36.66315007073153,landmark,True | ||
| 114 | −4399913870,10.1016/j.neucom.2024.128096,,A review of green artificial intelligence: Towards a more sustainable future,Neurocomputing,2024,article,sustainable_computing,3,244.0,466.0,42.08809549196657,466,47.9661,True,True,post,42.08809549196657,landmark,True | 114 | +7129692983,10.1109/tnse.2026.3665604,,Spatio-Temporal Coordinated Operation Strategy of Data Centers Considering Virtual Storage System via Two-Stage Distributionally Robust Optimization,IEEE Transactions on Network Science and Engineering,2026,article,sustainable_computing,4,13.0,13.0,92.3590525632706,13,118.9868,True,True,post,spatiotemporalcoordinatedoperationstrategyofdatacentersconsideringvirtualstoragesystemviatwostagedistributionallyrobustoptimization,32.96111535848162,landmark,True | ||
| 115 | −4391530352,10.1016/j.ijrefrig.2024.02.007,,"Data centers cooling: A critical review of techniques, challenges, and energy saving solutions",International Journal of Refrigeration,2024,article,sustainable_computing,3,82.0,173.0,38.56480172355753,173,54.4861,False,False,post,38.56480172355753,landmark,True | 115 | +7128511066,10.1016/j.ssaho.2026.102560,,"The impacts of globalization, institutional quality, and digital technology innovation on OECD countries sustainable digital economic growth",Social Sciences & Humanities Open,2026,article,sustainable_computing,1,13.0,13.0,92.3590525632706,13,118.9868,True,True,post,theimpactsofglobalizationinstitutionalqualityanddigitaltechnologyinnovationonoecdcountriessustainabledigitaleconomicgrowth,32.96111535848162,landmark,True | ||
| 116 | −4385481791,10.1145/3604930.3605705,,Reducing the Carbon Impact of Generative AI Inference (today and in 2035),,2023,conference-paper,sustainable_computing,5,44.0,110.0,36.66315007073153,127,64.935,True,True,post,36.66315007073153,landmark,True | 116 | +4390660405,10.1109/access.2024.3351468,,The Optimization of Carbon Emission Prediction in Low Carbon Energy Economy Under Big Data,IEEE Access,2024,article,sustainable_computing,1,167.0,193.0,32.37439457539554,193,69.0898,True,True,post,theoptimizationofcarbonemissionpredictioninlowcarbonenergyeconomyunderbigdata,32.37439457539554,landmark,True | ||
| 117 | −7115707641,10.1016/j.patter.2025.101430,,The carbon and water footprints of data centers and what this could mean for artificial intelligence,Patterns,2025,article,sustainable_computing,3,71.0,71.0,16.282156334231807,71,15.9504,True,True,post,35.94437869613701,landmark,True | 117 | +4283157527,10.1145/3531146.3533234,2206.05229,Measuring the Carbon Intensity of AI in Cloud Instances,"ACM Conference on Fairness, Accountability, and Transparency (FAccT)",2022,conference-paper,sustainable_computing,4,47.0,104.0,31.08684263550272,234,73.2411,True,True,baseline,measuringthecarbonintensityofaiincloudinstances,31.08684263550272,landmark,True | ||
| 118 | −4407614581,10.1007/s11528-025-01055-3,,Examining Teaching Competencies and Challenges While Integrating Artificial Intelligence in Higher Education,TechTrends,2025,article,sustainable_computing,1,71.0,71.0,61.64226839442977,71,77.5671,True,True,post,35.94437869613701,landmark,True | 118 | +4407614581,10.1007/s11528-025-01055-3,,Examining Teaching Competencies and Challenges While Integrating Artificial Intelligence in Higher Education,TechTrends,2025,article,sustainable_computing,1,71.0,71.0,61.64226839442977,71,77.5671,True,True,post,examiningteachingcompetenciesandchallengeswhileintegratingartificialintelligenceinhighereducation,31.02498130377243,landmark,True | ||
| 119 | −7122842330,10.3389/frai.2025.1692763,,Bridging technology and sustainability: examining the role of green AI adoption in Indian banking sector,Frontiers in Artificial Intelligence,2026,article,sustainable_computing,1,10.0,10.0,9.609756097560977,10,77.2657,True,True,post,35.552205793240454,landmark,True | 119 | +7115707641,10.1016/j.patter.2025.101430,,The carbon and water footprints of data centers and what this could mean for artificial intelligence,Patterns,2025,article,sustainable_computing,3,71.0,71.0,16.282156334231807,71,15.9504,True,True,post,thecarbonandwaterfootprintsofdatacentersandwhatthiscouldmeanforartificialintelligence,31.02498130377243,landmark,True | ||
| 120 | −4407592994,10.1145/3718363,2409.12626,Green Federated Learning: A New Era of Green Aware AI,ACM Computing Surveys,2025,article,sustainable_computing,9,65.0,65.0,14.906199460916442,65,14.5832,True,True,post,32.90682556688599,landmark,True | 120 | +3156891177,10.48550/arxiv.2104.10350,2104.10350,Carbon Emissions and Large Neural Network Training,arXiv (Cornell University),2021,preprint,sustainable_computing,6,47.0,77.0,29.52943615257048,122,,True,True,baseline,carbonemissionsandlargeneuralnetworktraining,29.52943615257048,landmark,True | ||
| 121 | −4390660405,10.1109/access.2024.3351468,,The Optimization of Carbon Emission Prediction in Low Carbon Energy Economy Under Big Data,IEEE Access,2024,article,sustainable_computing,1,167.0,193.0,32.37439457539554,193,69.0898,True,True,post,32.37439457539554,landmark,True | 121 | +4407592994,10.1145/3718363,2409.12626,Green Federated Learning: A New Era of Green Aware AI,ACM Computing Surveys,2025,article,sustainable_computing,9,65.0,65.0,14.906199460916442,65,14.5832,True,True,post,greenfederatedlearninganeweraofgreenawareai,28.403151897819832,landmark,True | ||
| 122 | −4416596047,10.1109/access.2026.3659894,2511.17179,Toward Sustainable AI: A Scoping Review of Carbon Footprint and Environmental Impacts Across Training and Inference Stages,IEEE Access,2026,article,sustainable_computing,2,9.0,9.0,13.44760130414532,9,15.4323,True,True,post,31.99698521391641,landmark,True | 122 | +4401304802,10.2172/2417618,,Best Practices Guide for Energy-Efficient Data Center Design,,2024,report,sustainable_computing,3,19.0,25.0,28.26470588235294,25,,True,True,post,bestpracticesguideforenergyefficientdatacenterdesign,28.26470588235294,landmark,True | ||
| 123 | −7138433923,10.1609/aaai.v40i38.40535,,TokenPowerBench: Benchmarking the Power Consumption of LLM Inference,Proceedings of the AAAI Conference on Artificial Intelligence,2026,conference-paper,sustainable_computing,6,9.0,9.0,77.99494097807758,8,183.5393,True,True,post,31.99698521391641,landmark,True | 123 | +3137672894,10.1109/tgcn.2021.3067374,,SSUR: An Approach to Optimizing Virtual Machine Allocation Strategy Based on User Requirements for Cloud Data Center,IEEE Transactions on Green Communications and Networking,2021,article,sustainable_computing,5,89.0,105.0,27.80457982156345,160,29.0452,True,False,baseline,ssuranapproachtooptimizingvirtualmachineallocationstrategybasedonuserrequirementsforclouddatacenter,27.80457982156345,landmark,True | ||
| 124 | −4411541921,10.1145/3715275.3732007,2501.16548,From Efficiency Gains to Rebound Effects: The Problem of Jevons' Paradox in AI's Polarized Environmental Debate,"ACM Conference on Fairness, Accountability, and Transparency (FAccT)",2025,conference-paper,sustainable_computing,2,62.0,62.0,60.833434492326376,62,144.145,True,True,post,31.388049002260484,landmark,True | 124 | +4411541921,10.1145/3715275.3732007,2501.16548,From Efficiency Gains to Rebound Effects: The Problem of Jevons' Paradox in AI's Polarized Environmental Debate,"ACM Conference on Fairness, Accountability, and Transparency (FAccT)",2025,conference-paper,sustainable_computing,2,62.0,62.0,60.833434492326376,62,144.145,True,True,post,fromefficiencygainstoreboundeffectstheproblemofjevonsparadoxinaispolarizedenvironmentaldebate,27.09223719484353,landmark,True | ||
| 125 | −4283157527,10.1145/3531146.3533234,2206.05229,Measuring the Carbon Intensity of AI in Cloud Instances,"ACM Conference on Fairness, Accountability, and Transparency (FAccT)",2022,conference-paper,sustainable_computing,4,47.0,104.0,31.08684263550272,234,73.2411,True,True,baseline,31.08684263550272,landmark,True | 125 | +2803823791,10.1016/j.suscom.2018.05.002,,A review of thermal management and innovative cooling strategies for data center,Sustainable Computing Informatics and Systems,2018,article,sustainable_computing,3,24.0,50.0,26.509854547204004,324,37.3606,False,False,baseline,areviewofthermalmanagementandinnovativecoolingstrategiesfordatacenter,26.509854547204004,landmark,True | ||
| 126 | −3156891177,10.48550/arxiv.2104.10350,2104.10350,Carbon Emissions and Large Neural Network Training,arXiv (Cornell University),2021,preprint,sustainable_computing,6,47.0,77.0,29.52943615257048,122,,True,True,baseline,29.52943615257048,landmark,True | 126 | +3037032032,10.1609/aaai.v34i09.7123,,Energy and Policy Considerations for Modern Deep Learning Research,Proceedings of the AAAI Conference on Artificial Intelligence,2020,conference-paper,sustainable_computing,4,31.0,98.0,25.856691345196346,755,70.4108,True,True,baseline,energyandpolicyconsiderationsformoderndeeplearningresearch,25.856691345196346,landmark,True | ||
modified
literature_synthesis/landmarks/landmarks.csv
+1090 −1094
@@ -1,1094 +1,1090 @@ | |||||
| 1 | −work_id,doi,arxiv_id,title,source_name,year,type,primary_category,n_categories,c12,c36,ncs36,cited_by_count,fwci,has_abstract,is_oa,period,score,set,pi_review | 1 | +work_id,doi,arxiv_id,title,source_name,year,type,primary_category,n_categories,c12,c36,ncs36,cited_by_count,fwci,has_abstract,is_oa,period,ntitle,score,set,pi_review | ||
| 2 | −7172491899,10.26555/ijain.v12i2.2360,2005.11401,Toward effective Text-to-MongoDB query translation,International Journal of Advances in Intelligent Informatics,2026,article,llm,6,3026.0,3026.0,3367.337435490274,0,0.0,True,True,baseline,10758.097473034562,landmark,True | 2 | +7172491899,10.26555/ijain.v12i2.2360,2005.11401,Toward effective Text-to-MongoDB query translation,International Journal of Advances in Intelligent Informatics,2026,article,llm,6,3026.0,3026.0,3367.337435490274,0,0.0,True,True,baseline,towardeffectivetexttomongodbquerytranslation,7672.333467289645,landmark,True | ||
| 3 | −7154011589,10.55905/rdelosv19.n79-020,2005.14165,Modelos pré-treinados de LLM e questões éticas face aos direitos autorais,DELOS Desarrollo Local Sostenible,2026,article,llm,3,2847.0,2847.0,3168.1459612824883,0,0.0,True,True,baseline,10121.712989335558,landmark,True | 3 | +7154011589,10.55905/rdelosv19.n79-020,2005.14165,Modelos pré-treinados de LLM e questões éticas face aos direitos autorais,DELOS Desarrollo Local Sostenible,2026,article,llm,3,2847.0,2847.0,3168.1459612824883,0,0.0,True,True,baseline,modelosprtreinadosdellmequestesticasfaceaosdireitosautorais,7218.484263507476,landmark,True | ||
| 4 | −4362515116,10.1007/s11704-026-60308-3,2303.18223,A Survey of Large Language Models,Frontiers of Computer Science,2026,article,llm,6,1549.0,1549.0,1723.7295728930715,1549,964.5692,True,True,post,5507.0366773729465,landmark,True | 4 | +4362515116,10.1007/s11704-026-60308-3,2303.18223,A Survey of Large Language Models,Frontiers of Computer Science,2026,article,llm,6,1549.0,1549.0,1723.7295728930715,1549,964.5692,True,True,post,asurveyoflargelanguagemodels,3927.4436684836946,landmark,True | ||
| 5 | −4288253152,10.5281/zenodo.12935200,,Multilingual Classifier for Automatic Dewey Decimal Classification trained on Open Access Linguistics Abstracts,Repositorio Institucional UPTC,2024,dissertation,llm,3,286.0,364.0,3102.1223140495867,364,,True,True,post,3102.1223140495867,landmark,True | 5 | +4288253152,10.5281/zenodo.12935200,,Multilingual Classifier for Automatic Dewey Decimal Classification trained on Open Access Linguistics Abstracts,Repositorio Institucional UPTC,2024,dissertation,llm,3,286.0,364.0,3102.1223140495867,364,,True,True,post,multilingualclassifierforautomaticdeweydecimalclassificationtrainedonopenaccesslinguisticsabstracts,3102.1223140495867,landmark,True | ||
| 6 | −4322718191,10.48550/arxiv.2302.13971,2302.13971,LLaMA: Open and Efficient Foundation Language Models,arXiv (Cornell University),2023,preprint,llm,4,2565.0,3629.0,1206.5430511141133,3837,,True,True,post,1206.5430511141133,landmark,True | 6 | +4322718191,10.48550/arxiv.2302.13971,2302.13971,LLaMA: Open and Efficient Foundation Language Models,arXiv (Cornell University),2023,preprint,llm,4,2565.0,3629.0,1206.5430511141133,3837,,True,True,post,llamaopenandefficientfoundationlanguagemodels,1206.5430511141133,landmark,True | ||
| 7 | −4323655724,10.1016/j.lindif.2023.102274,,ChatGPT for good? On opportunities and challenges of large language models for education,Learning and Individual Differences,2023,article,llm,1,2213.0,4227.0,990.7064044933976,7222,1695.9108,True,True,post,990.7064044933976,landmark,True | 7 | +4323655724,10.1016/j.lindif.2023.102274,,ChatGPT for good? On opportunities and challenges of large language models for education,Learning and Individual Differences,2023,article,llm,1,2213.0,4227.0,990.7064044933976,7222,1695.9108,True,True,post,chatgptforgoodonopportunitiesandchallengesoflargelanguagemodelsforeducation,990.7064044933976,landmark,True | ||
| 8 | −4367369313,10.18260/jet.43.1.5,,"Prompt Engineering for ChatGPT: A Quick Guide to Techniques, Tips, and Best Practices",ASEE Journal of Engineering Technology,2026,article,llm,2,261.0,261.0,290.4411998225253,261,187.8562,True,True,post,927.9125712035759,landmark,True | 8 | +4226278401,10.48550/arxiv.2203.02155,2203.02155,Discernment and Social Learning as a Companion Training Layer,arXiv (Cornell University),2022,preprint,llm,5,1547.0,3077.0,894.2065022118338,4202,,True,True,baseline,discernmentandsociallearningasacompaniontraininglayer,894.2065022118338,landmark,True | ||
| 9 | −4226278401,10.48550/arxiv.2203.02155,2203.02155,Discernment and Social Learning as a Companion Training Layer,arXiv (Cornell University),2022,preprint,llm,5,1547.0,3077.0,894.2065022118338,4202,,True,True,baseline,894.2065022118338,landmark,True | 9 | +4396531244,10.22215/etd/2024-15938,,The Fusion of Multilingual Semantic Search and Large Language Models: A New Paradigm for Enhanced Topic Exploration and Contextual Search,,2024,dissertation,llm,6,20.0,20.0,778.8148148148148,20,,True,True,post,thefusionofmultilingualsemanticsearchandlargelanguagemodelsanewparadigmforenhancedtopicexplorationandcontextualsearch,778.8148148148148,landmark,True | ||
| 10 | −4396531244,10.22215/etd/2024-15938,,The Fusion of Multilingual Semantic Search and Large Language Models: A New Paradigm for Enhanced Topic Exploration and Contextual Search,,2024,dissertation,llm,6,20.0,20.0,778.8148148148148,20,,True,True,post,778.8148148148148,landmark,True | 10 | +4221143046,10.48550/arxiv.2201.11903,2201.11903,"BNAI, NO-TOKEN, and MIND-UNITY: Pillars of a Systemic Revolution in Artificial Intelligence",arXiv (Cornell University),2022,preprint,llm,3,962.0,2465.0,716.353275252574,4203,,True,True,baseline,bnainotokenandmindunitypillarsofasystemicrevolutioninartificialintelligence,716.353275252574,landmark,True | ||
| 11 | −4221143046,10.48550/arxiv.2201.11903,2201.11903,"BNAI, NO-TOKEN, and MIND-UNITY: Pillars of a Systemic Revolution in Artificial Intelligence",arXiv (Cornell University),2022,preprint,llm,3,962.0,2465.0,716.353275252574,4203,,True,True,baseline,716.353275252574,landmark,True | 11 | +4367369313,10.18260/jet.43.1.5,,"Prompt Engineering for ChatGPT: A Quick Guide to Techniques, Tips, and Best Practices",ASEE Journal of Engineering Technology,2026,article,llm,2,261.0,261.0,290.4411998225253,261,187.8562,True,True,post,promptengineeringforchatgptaquickguidetotechniquestipsandbestpractices,661.7577775818233,landmark,True | ||
| 12 | −4327810158,10.4230/lipics.cosit.2024.11,2303.08774,GPT-4 Technical Report,arXiv (Cornell University),2023,preprint,llm,3,1261.0,1968.0,654.30606905279,2391,,True,True,post,654.30606905279,landmark,True | 12 | +4389437528,10.61969/jai.1337500,,Education in the Era of Generative Artificial Intelligence (AI): Understanding the Potential Benefits of ChatGPT in Promoting Teaching and Learning,Journal of AI,2023,article,llm,2,1417.0,2361.0,553.3612067681362,2953,693.6856,True,True,post,educationintheeraofgenerativeartificialintelligenceaiunderstandingthepotentialbenefitsofchatgptinpromotingteachingandlearning,553.3612067681362,landmark,True | ||
| 13 | −7135096569,10.1287/orsc.2025.21838,,Navigating the Jagged Technological Frontier: Field Experimental Evidence of the Effects of Artificial Intelligence on Knowledge Worker Productivity and Quality,Organization Science,2026,article,llm,1,183.0,183.0,203.64268033533384,183,650.2714,True,False,post,650.6053660163003,landmark,True | 13 | +4292779060,10.4230/lipics.giscience.2023.43,,"Aion Framework: Dimensional Emergence of AI Consciousness, Observer-Induced Collapse, and Cosmological Portal Dynamics",DROPS (Schloss Dagstuhl – Leibniz Center for Informatics),2023,article,llm,4,11174.0,13333.0,534.676590443066,13690,2570.1233,True,True,post,aionframeworkdimensionalemergenceofaiconsciousnessobserverinducedcollapseandcosmologicalportaldynamics,534.676590443066,landmark,True | ||
| 14 | −4414281281,10.1038/s41586-025-09422-z,,DeepSeek-R1 incentivizes reasoning in LLMs through reinforcement learning,Nature,2025,article,llm,3,1099.0,1099.0,374.373593869335,1099,456.904,True,True,post,556.3784815078109,landmark,True | 14 | +4414281281,10.1038/s41586-025-09422-z,,DeepSeek-R1 incentivizes reasoning in LLMs through reinforcement learning,Nature,2025,article,llm,3,1099.0,1099.0,374.373593869335,1099,456.904,True,True,post,deepseekr1incentivizesreasoninginllmsthroughreinforcementlearning,480.23175285698454,landmark,True | ||
| 15 | −4389437528,10.61969/jai.1337500,,Education in the Era of Generative Artificial Intelligence (AI): Understanding the Potential Benefits of ChatGPT in Promoting Teaching and Learning,Journal of AI,2023,article,llm,2,1417.0,2361.0,553.3612067681362,2953,693.6856,True,True,post,553.3612067681362,landmark,True | 15 | +4360836968,10.48550/arxiv.2303.12712,2303.12712,Sparks of Artificial General Intelligence: Early experiments with GPT-4,arXiv (Cornell University),2023,preprint,llm,2,1098.0,1420.0,472.11108641004154,1523,,True,True,post,sparksofartificialgeneralintelligenceearlyexperimentswithgpt4,472.11108641004154,landmark,True | ||
| 16 | −4292779060,10.4230/lipics.giscience.2023.43,,"Aion Framework: Dimensional Emergence of AI Consciousness, Observer-Induced Collapse, and Cosmological Portal Dynamics",DROPS (Schloss Dagstuhl – Leibniz Center for Informatics),2023,article,llm,4,11174.0,13333.0,534.676590443066,13690,2570.1233,True,True,post,534.676590443066,landmark,True | 16 | +7135096569,10.1287/orsc.2025.21838,,Navigating the Jagged Technological Frontier: Field Experimental Evidence of the Effects of Artificial Intelligence on Knowledge Worker Productivity and Quality,Organization Science,2026,article,llm,1,183.0,183.0,203.64268033533384,183,650.2714,True,False,post,navigatingthejaggedtechnologicalfrontierfieldexperimentalevidenceoftheeffectsofartificialintelligenceonknowledgeworkerproductivityandquality,463.9910854309336,landmark,True | ||
| 17 | −4360836968,10.48550/arxiv.2303.12712,2303.12712,Sparks of Artificial General Intelligence: Early experiments with GPT-4,arXiv (Cornell University),2023,preprint,llm,2,1098.0,1420.0,472.11108641004154,1523,,True,True,post,472.11108641004154,landmark,True | 17 | +4385223296,10.1007/978-3-031-37776-1_17,,"Open AI in Education, the Responsible and Ethical Use of ChatGPT Towards Lifelong Learning",Sustainable development goals series,2023,book-chapter,llm,2,432.0,612.0,421.27957250425067,696,475.0832,False,True,post,openaiineducationtheresponsibleandethicaluseofchatgpttowardslifelonglearning,421.27957250425067,landmark,True | ||
| 18 | −4406800520,10.1007/s11432-024-4222-0,2309.07864,The rise and potential of large language model based agents: a survey,Science China Information Sciences,2025,article,llm,3,914.0,914.0,311.35347115247697,914,317.0864,False,True,post,462.72059335590455,landmark,True | 18 | +4406800520,10.1007/s11432-024-4222-0,2309.07864,The rise and potential of large language model based agents: a survey,Science China Information Sciences,2025,article,llm,3,914.0,914.0,311.35347115247697,914,317.0864,False,True,post,theriseandpotentialoflargelanguagemodelbasedagentsasurvey,399.3920128401127,landmark,True | ||
| 19 | −4385223296,10.1007/978-3-031-37776-1_17,,"Open AI in Education, the Responsible and Ethical Use of ChatGPT Towards Lifelong Learning",Sustainable development goals series,2023,book-chapter,llm,2,432.0,612.0,421.27957250425067,696,475.0832,False,True,post,421.27957250425067,landmark,True | 19 | +4366420437,10.3390/educsci13040410,,What Is the Impact of ChatGPT on Education? A Rapid Review of the Literature,Education Sciences,2023,article,llm,1,955.0,1541.0,361.17307057589915,1967,462.692,True,True,post,whatistheimpactofchatgptoneducationarapidreviewoftheliterature,361.17307057589915,landmark,True | ||
| 20 | −4287689466,10.4230/oasics.slate.2025.1,,From Prediction to Precision: Leveraging LLMs for Equitable and Data-Driven Writing Placement in Developmental Education,OASIcs : OpenAccess Series in Informatics,2025,conference-paper,llm,3,722.0,722.0,548.6111682082906,722,151.0788,True,True,post,365.5188932198721,landmark,True | 20 | +4317910584,10.37074/jalt.2023.6.1.9,,ChatGPT: Bullshit spewer or the end of traditional assessments in higher education?,Journal of Applied Learning & Teaching,2023,article,llm,3,1057.0,1530.0,358.59493704161304,1771,416.3993,True,True,post,chatgptbullshitspewerortheendoftraditionalassessmentsinhighereducation,358.59493704161304,landmark,True | ||
| 21 | −4366420437,10.3390/educsci13040410,,What Is the Impact of ChatGPT on Education? A Rapid Review of the Literature,Education Sciences,2023,article,llm,1,955.0,1541.0,361.17307057589915,1967,462.692,True,True,post,361.17307057589915,landmark,True | 21 | +4313564799,10.2139/ssrn.4312418,,ChatGPT User Experience: Implications for Education,SSRN Electronic Journal,2023,preprint,llm,2,595.0,811.0,335.9058974941328,912,,False,True,post,chatgptuserexperienceimplicationsforeducation,335.9058974941328,landmark,True | ||
| 22 | −4317910584,10.37074/jalt.2023.6.1.9,,ChatGPT: Bullshit spewer or the end of traditional assessments in higher education?,Journal of Applied Learning & Teaching,2023,article,llm,3,1057.0,1530.0,358.59493704161304,1771,416.3993,True,True,post,358.59493704161304,landmark,True | 22 | +4384464487,10.1186/s41239-023-00411-8,2305.00290,"Students’ voices on generative AI: perceptions, benefits, and challenges in higher education",International Journal of Educational Technology in Higher Education,2023,article,llm,2,504.0,1398.0,327.6573346301797,2405,564.912,True,True,post,studentsvoicesongenerativeaiperceptionsbenefitsandchallengesinhighereducation,327.6573346301797,landmark,True | ||
| 23 | −4313564799,10.2139/ssrn.4312418,,ChatGPT User Experience: Implications for Education,SSRN Electronic Journal,2023,preprint,llm,2,595.0,811.0,335.9058974941328,912,,False,True,post,335.9058974941328,landmark,True | 23 | +4392773210,10.1186/s41239-024-00448-3,,"Embracing the future of Artificial Intelligence in the classroom: the relevance of AI literacy, prompt engineering, and critical thinking in modern education",International Journal of Educational Technology in Higher Education,2024,article,llm,1,576.0,1085.0,326.66642380265563,1085,415.2106,True,True,post,embracingthefutureofartificialintelligenceintheclassroomtherelevanceofailiteracypromptengineeringandcriticalthinkinginmoderneducation,326.66642380265563,landmark,True | ||
| 24 | −4382618722,10.1016/j.fmre.2026.03.026,2306.16092,Chatlaw: A Multi-Agent Legal Assistant based on a Role-Aligned Mixture-of-Experts Architecture,Fundamental Research,2026,article,llm,6,94.0,94.0,98.93209876543209,94,193.5725,True,True,post,334.1907344564603,landmark,True | 24 | +4321499901,10.1186/s40561-023-00237-x,,What if the devil is my guardian angel: ChatGPT as a case study of using chatbots in education,Smart Learning Environments,2023,article,llm,3,941.0,1389.0,325.547952647582,1931,453.5275,True,True,post,whatifthedevilismyguardianangelchatgptasacasestudyofusingchatbotsineducation,325.547952647582,landmark,True | ||
| 25 | −4384464487,10.1186/s41239-023-00411-8,2305.00290,"Students’ voices on generative AI: perceptions, benefits, and challenges in higher education",International Journal of Educational Technology in Higher Education,2023,article,llm,2,504.0,1398.0,327.6573346301797,2405,564.912,True,True,post,327.6573346301797,landmark,True | 25 | +4287689466,10.4230/oasics.slate.2025.1,,From Prediction to Precision: Leveraging LLMs for Equitable and Data-Driven Writing Placement in Developmental Education,OASIcs : OpenAccess Series in Informatics,2025,conference-paper,llm,3,722.0,722.0,548.6111682082906,722,151.0788,True,True,post,frompredictiontoprecisionleveragingllmsforequitableanddatadrivenwritingplacementindevelopmentaleducation,315.49347184962954,landmark,True | ||
| 26 | −4392773210,10.1186/s41239-024-00448-3,,"Embracing the future of Artificial Intelligence in the classroom: the relevance of AI literacy, prompt engineering, and critical thinking in modern education",International Journal of Educational Technology in Higher Education,2024,article,llm,1,576.0,1085.0,326.66642380265563,1085,415.2106,True,True,post,326.66642380265563,landmark,True | 26 | +4320495408,10.1108/lhtn-01-2023-0009,,Chatting about ChatGPT: how may AI and GPT impact academia and libraries?,Library Hi Tech News,2023,article,llm,3,895.0,1210.0,283.59468877147174,1346,315.8243,True,True,post,chattingaboutchatgpthowmayaiandgptimpactacademiaandlibraries,283.59468877147174,landmark,True | ||
| 27 | −4387355843,10.1201/9781003616719-7,2310.01728,TimeLLM: Time Series Forecasting by Reprogramming Large Language Models,CRC Press eBooks,2026,book-chapter,foundation_models,4,197.0,197.0,188.61702127659572,197,110.0789,True,True,post,700.378454126837,landmark,True | 27 | +4387355843,10.1201/9781003616719-7,2310.01728,TimeLLM: Time Series Forecasting by Reprogramming Large Language Models,CRC Press eBooks,2026,book-chapter,foundation_models,4,197.0,197.0,188.61702127659572,197,110.0789,True,True,post,timellmtimeseriesforecastingbyreprogramminglargelanguagemodels,499.48767120160613,landmark,True | ||
| 28 | −4392947521,10.1038/s41591-024-02857-3,,Towards a general-purpose foundation model for computational pathology,Nature Medicine,2024,article,foundation_models,2,770.0,1505.0,186.93297525958593,1505,223.3796,False,True,post,186.93297525958593,landmark,True | 28 | +4392947521,10.1038/s41591-024-02857-3,,Towards a general-purpose foundation model for computational pathology,Nature Medicine,2024,article,foundation_models,2,770.0,1505.0,186.93297525958593,1505,223.3796,False,True,post,towardsageneralpurposefoundationmodelforcomputationalpathology,186.93297525958593,landmark,True | ||
| 29 | −7124890304,10.1016/j.jii.2026.101076,,Semi-supervised cross-domain fault diagnosis via contrastive pre-training and annotation-efficient alignment strategy,Journal of Industrial Information Integration,2026,article,foundation_models,1,42.0,42.0,46.52414937759336,42,116.7549,False,False,post,149.31926433160993,landmark,True | 29 | +7133233472,10.52202/075280-0441,2305.14314,QLoRA: Efficient Finetuning of Quantized LLMs,neural information processing systems,2023,conference-paper,foundation_models,7,287.0,532.0,122.68895117800083,1428,269.751,True,True,post,qloraefficientfinetuningofquantizedllms,122.68895117800083,landmark,True | ||
| 30 | −4410551352,10.1038/s41586-025-09005-y,2405.13063,A foundation model for the Earth system,Nature,2025,article,foundation_models,3,249.0,249.0,69.74305555555556,249,109.0217,True,True,post,126.0584548639171,landmark,True | 30 | +4410551352,10.1038/s41586-025-09005-y,2405.13063,A foundation model for the Earth system,Nature,2025,article,foundation_models,3,249.0,249.0,69.74305555555556,249,109.0217,True,True,post,afoundationmodelfortheearthsystem,108.8059203470329,landmark,True | ||
| 31 | −4322832366,10.1145/3773966.3778007,2303.00320,TimeMAE: Self-Supervised Representations of Time Series with Decoupled Masked Autoencoders,,2026,conference-paper,foundation_models,6,35.0,35.0,126.32971014492755,35,165.8809,True,True,post,124.4327202763416,landmark,True | 31 | +7124890304,10.1016/j.jii.2026.101076,,Semi-supervised cross-domain fault diagnosis via contrastive pre-training and annotation-efficient alignment strategy,Journal of Industrial Information Integration,2026,article,foundation_models,1,42.0,42.0,46.52414937759336,42,116.7549,False,False,post,semisupervisedcrossdomainfaultdiagnosisviacontrastivepretrainingandannotationefficientalignmentstrategy,106.48975731201755,landmark,True | ||
| 32 | −7133233472,10.52202/075280-0441,2305.14314,QLoRA: Efficient Finetuning of Quantized LLMs,neural information processing systems,2023,conference-paper,foundation_models,7,287.0,532.0,122.68895117800083,1428,269.751,True,True,post,122.68895117800083,landmark,True | 32 | +2990704537,,,SuperGLUE: A Stickier Benchmark for General-Purpose Language Understanding Systems,neural information processing systems,2019,article,foundation_models,5,262.0,668.0,101.57304226845103,462,52.8392,True,False,baseline,superglueastickierbenchmarkforgeneralpurposelanguageunderstandingsystems,101.57304226845103,landmark,True | ||
| 33 | −2990704537,,,SuperGLUE: A Stickier Benchmark for General-Purpose Language Understanding Systems,neural information processing systems,2019,article,foundation_models,5,262.0,668.0,101.57304226845103,462,52.8392,True,False,baseline,101.57304226845103,landmark,True | 33 | +4322832366,10.1145/3773966.3778007,2303.00320,TimeMAE: Self-Supervised Representations of Time Series with Decoupled Masked Autoencoders,,2026,conference-paper,foundation_models,6,35.0,35.0,126.32971014492755,35,165.8809,True,True,post,timemaeselfsupervisedrepresentationsoftimeserieswithdecoupledmaskedautoencoders,88.74146442668129,landmark,True | ||
| 34 | −7125271461,10.1039/d5dd00348b,,ChemBERTa-3: an open source training framework for chemical foundation models,Digital Discovery,2026,article,foundation_models,2,25.0,25.0,70.59021819073303,25,85.533,True,True,post,88.88051448310114,landmark,True | 34 | +4393138529,10.48550/arxiv.2403.14608,2403.14608,Parameter-Efficient Fine-Tuning for Large Models: A Comprehensive Survey,arXiv (Cornell University),2024,preprint,foundation_models,6,83.0,95.0,82.87448253022023,95,,True,True,post,parameterefficientfinetuningforlargemodelsacomprehensivesurvey,82.87448253022023,landmark,True | ||
| 35 | −7119541039,10.1038/s43247-025-03127-x,,On the foundations of Earth foundation models,Communications Earth & Environment,2026,article,foundation_models,3,24.0,24.0,26.707236765289682,24,83.0902,True,True,post,85.3252939037771,landmark,True | 35 | +4402220065,10.1038/s41586-024-07894-z,,A pathology foundation model for cancer diagnosis and prognosis prediction,Nature,2024,article,foundation_models,2,275.0,562.0,69.80487182450983,562,83.6371,False,True,post,apathologyfoundationmodelforcancerdiagnosisandprognosisprediction,69.80487182450983,landmark,True | ||
| 36 | −4393138529,10.48550/arxiv.2403.14608,2403.14608,Parameter-Efficient Fine-Tuning for Large Models: A Comprehensive Survey,arXiv (Cornell University),2024,preprint,foundation_models,6,83.0,95.0,82.87448253022023,95,,True,True,post,82.87448253022023,landmark,True | 36 | +7125271461,10.1039/d5dd00348b,,ChemBERTa-3: an open source training framework for chemical foundation models,Digital Discovery,2026,article,foundation_models,2,25.0,25.0,70.59021819073303,25,85.533,True,True,post,chemberta3anopensourcetrainingframeworkforchemicalfoundationmodels,63.38676030477235,landmark,True | ||
| 37 | −4390690043,10.1145/3800677,2401.02458,Data-Centric Foundation Models in Computational Healthcare: A Survey,ACM Computing Surveys,2026,article,foundation_models,4,22.0,22.0,10.015503875968992,22,13.1625,True,True,post,78.21485274512901,landmark,True | 37 | +7119541039,10.1038/s43247-025-03127-x,,On the foundations of Earth foundation models,Communications Earth & Environment,2026,article,foundation_models,3,24.0,24.0,26.707236765289682,24,83.0902,True,True,post,onthefoundationsofearthfoundationmodels,60.851289892581455,landmark,True | ||
| 38 | −7128029160,10.1038/s41593-026-02202-6,,A generalizable foundation model for analysis of human brain MRI,Nature Neuroscience,2026,article,foundation_models,2,20.0,20.0,22.2560306377414,20,72.2524,True,True,post,71.10441158648091,landmark,True | 38 | +4390690043,10.1145/3800677,2401.02458,Data-Centric Foundation Models in Computational Healthcare: A Survey,ACM Computing Surveys,2026,article,foundation_models,4,22.0,22.0,10.015503875968992,22,13.1625,True,True,post,datacentricfoundationmodelsincomputationalhealthcareasurvey,55.78034906819967,landmark,True | ||
| 39 | −4402220065,10.1038/s41586-024-07894-z,,A pathology foundation model for cancer diagnosis and prognosis prediction,Nature,2024,article,foundation_models,2,275.0,562.0,69.80487182450983,562,83.6371,False,True,post,69.80487182450983,landmark,True | 39 | +4361229539,10.48550/arxiv.2303.16199,2303.16199,LLaMA-Adapter: Efficient Fine-tuning of Language Models with Zero-init Attention,arXiv (Cornell University),2023,preprint,foundation_models,9,135.0,161.0,53.528087966208936,166,,True,True,post,llamaadapterefficientfinetuningoflanguagemodelswithzeroinitattention,53.528087966208936,landmark,True | ||
| 40 | −7118170538,10.3390/bdcc10010019,,Applications of Artificial Intelligence in Fisheries: From Data to Decisions,Big Data and Cognitive Computing,2026,article,foundation_models,8,17.0,17.0,17.85,17,28.0244,True,True,post,60.43874984850878,landmark,True | 40 | +7128029160,10.1038/s41593-026-02202-6,,A generalizable foundation model for analysis of human brain MRI,Nature Neuroscience,2026,article,foundation_models,2,20.0,20.0,22.2560306377414,20,72.2524,True,True,post,ageneralizablefoundationmodelforanalysisofhumanbrainmri,50.70940824381788,landmark,True | ||
| 41 | −4411932262,10.1038/s41586-025-09215-4,,A foundation model to predict and capture human cognition,Nature,2025,article,foundation_models,1,110.0,110.0,26.933816382433506,110,60.8153,True,True,post,55.6884740362686,landmark,True | 41 | +4385948838,10.1038/s41591-023-02504-3,,A visual–language foundation model for pathology image analysis using medical Twitter,Nature Medicine,2023,article,foundation_models,3,179.0,471.0,49.064992972535784,680,61.8263,False,False,post,avisuallanguagefoundationmodelforpathologyimageanalysisusingmedicaltwitter,49.064992972535784,landmark,True | ||
| 42 | −4411099958,10.1038/s41591-025-03747-y,2410.15038,A multimodal vision foundation model for clinical dermatology,Nature Medicine,2025,article,foundation_models,4,108.0,108.0,18.44502277163305,108,39.3828,True,True,post,54.67595632651827,landmark,True | 42 | +4411932262,10.1038/s41586-025-09215-4,,A foundation model to predict and capture human cognition,Nature,2025,article,foundation_models,1,110.0,110.0,26.933816382433506,110,60.8153,True,True,post,afoundationmodeltopredictandcapturehumancognition,48.06687244246433,landmark,True | ||
| 43 | −4361229539,10.48550/arxiv.2303.16199,2303.16199,LLaMA-Adapter: Efficient Fine-tuning of Language Models with Zero-init Attention,arXiv (Cornell University),2023,preprint,foundation_models,9,135.0,161.0,53.528087966208936,166,,True,True,post,53.528087966208936,landmark,True | 43 | +4411099958,10.1038/s41591-025-03747-y,2410.15038,A multimodal vision foundation model for clinical dermatology,Nature Medicine,2025,article,foundation_models,4,108.0,108.0,18.44502277163305,108,39.3828,True,True,post,amultimodalvisionfoundationmodelforclinicaldermatology,47.1929293071468,landmark,True | ||
| 44 | −4407135816,10.1148/radiol.240597,2411.18730,"Foundation Models in Radiology: What, How, Why, and Why Not",Radiology,2025,article,foundation_models,4,103.0,103.0,6.850784973366975,103,21.0891,True,True,post,52.14466205214242,landmark,True | 44 | +4407135816,10.1148/radiol.240597,2411.18730,"Foundation Models in Radiology: What, How, Why, and Why Not",Radiology,2025,article,foundation_models,4,103.0,103.0,6.850784973366975,103,21.0891,True,True,post,foundationmodelsinradiologywhathowwhyandwhynot,45.00807146885297,landmark,True | ||
| 45 | −4385948838,10.1038/s41591-023-02504-3,,A visual–language foundation model for pathology image analysis using medical Twitter,Nature Medicine,2023,article,foundation_models,3,179.0,471.0,49.064992972535784,680,61.8263,False,False,post,49.064992972535784,landmark,True | 45 | +7118170538,10.3390/bdcc10010019,,Applications of Artificial Intelligence in Fisheries: From Data to Decisions,Big Data and Cognitive Computing,2026,article,foundation_models,8,17.0,17.0,17.85,17,28.0244,True,True,post,applicationsofartificialintelligenceinfisheriesfromdatatodecisions,43.1029970072452,landmark,True | ||
| 46 | −4406643700,10.1016/j.jag.2025.104368,,Towards the next generation of Geospatial Artificial Intelligence,International Journal of Applied Earth Observation and Geoinformation,2025,article,foundation_models,2,91.0,91.0,19.115723270440252,91,404.3482,True,True,post,46.06955579364039,landmark,True | 46 | +4393153153,10.1609/aaai.v38i12.29299,2312.15709,TimesURL: Self-Supervised Contrastive Learning for Universal Time Series Representation Learning,Proceedings of the AAAI Conference on Artificial Intelligence,2024,conference-paper,foundation_models,5,68.0,113.0,41.75133936818769,113,44.645,True,True,post,timesurlselfsupervisedcontrastivelearningforuniversaltimeseriesrepresentationlearning,41.75133936818769,landmark,True | ||
| 47 | −4406472599,10.1038/s42256-024-00961-0,2310.08184,Learning from models beyond fine-tuning,Nature Machine Intelligence,2025,article,foundation_models,4,86.0,86.0,29.29584083053941,86,31.2093,False,True,post,43.538261519264545,landmark,True | 47 | +4406643700,10.1016/j.jag.2025.104368,,Towards the next generation of Geospatial Artificial Intelligence,International Journal of Applied Earth Observation and Geoinformation,2025,article,foundation_models,2,91.0,91.0,19.115723270440252,91,404.3482,True,True,post,towardsthenextgenerationofgeospatialartificialintelligence,39.76441265694776,landmark,True | ||
| 48 | −4393153153,10.1609/aaai.v38i12.29299,2312.15709,TimesURL: Self-Supervised Contrastive Learning for Universal Time Series Representation Learning,Proceedings of the AAAI Conference on Artificial Intelligence,2024,conference-paper,foundation_models,5,68.0,113.0,41.75133936818769,113,44.645,True,True,post,41.75133936818769,landmark,True | 48 | +4402727669,10.1109/cvpr52733.2024.01239,,mPLUG-OwI2: Revolutionizing Multi-modal Large Language Model with Modality Collaboration,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2024,conference-paper,foundation_models,5,136.0,184.0,38.61721404801364,184,40.1743,True,False,post,mplugowi2revolutionizingmultimodallargelanguagemodelwithmodalitycollaboration,38.61721404801364,landmark,True | ||
| 49 | −4402727669,10.1109/cvpr52733.2024.01239,,mPLUG-OwI2: Revolutionizing Multi-modal Large Language Model with Modality Collaboration,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2024,conference-paper,foundation_models,5,136.0,184.0,38.61721404801364,184,40.1743,True,False,post,38.61721404801364,landmark,True | 49 | +4401397240,10.1038/s41591-024-03185-2,2305.17100,A generalist vision–language foundation model for diverse biomedical tasks,Nature Medicine,2024,article,foundation_models,5,202.0,325.0,38.50242478427548,325,43.9301,False,True,post,ageneralistvisionlanguagefoundationmodelfordiversebiomedicaltasks,38.50242478427548,landmark,True | ||
| 50 | −4401397240,10.1038/s41591-024-03185-2,2305.17100,A generalist vision–language foundation model for diverse biomedical tasks,Nature Medicine,2024,article,foundation_models,5,202.0,325.0,38.50242478427548,325,43.9301,False,True,post,38.50242478427548,landmark,True | 50 | +4406472599,10.1038/s42256-024-00961-0,2310.08184,Learning from models beyond fine-tuning,Nature Machine Intelligence,2025,article,foundation_models,4,86.0,86.0,29.29584083053941,86,31.2093,False,True,post,learningfrommodelsbeyondfinetuning,37.57955481865393,landmark,True | ||
| 51 | −4385285835,10.1101/2023.07.21.23292757,,Scaling Self-Supervised Learning for Histopathology with Masked Image Modeling,medRxiv,2023,preprint,foundation_models,7,42.0,107.0,35.57456777878482,142,,True,True,post,35.57456777878482,landmark,True | 51 | +4385285835,10.1101/2023.07.21.23292757,,Scaling Self-Supervised Learning for Histopathology with Masked Image Modeling,medRxiv,2023,preprint,foundation_models,7,42.0,107.0,35.57456777878482,142,,True,True,post,scalingselfsupervisedlearningforhistopathologywithmaskedimagemodeling,35.57456777878482,landmark,True | ||
| 52 | −4318718936,10.48550/arxiv.2301.12597,2301.12597,BLIP-2: Bootstrapping Language-Image Pre-training with Frozen Image Encoders and Large Language Models,arXiv (Cornell University),2023,preprint,multimodal_ai,7,654.0,875.0,273.1441896618733,908,,True,True,post,273.1441896618733,landmark,True | 52 | +4318718936,10.48550/arxiv.2301.12597,2301.12597,BLIP-2: Bootstrapping Language-Image Pre-training with Frozen Image Encoders and Large Language Models,arXiv (Cornell University),2023,preprint,multimodal_ai,7,654.0,875.0,273.1441896618733,908,,True,True,post,blip2bootstrappinglanguageimagepretrainingwithfrozenimageencodersandlargelanguagemodels,273.1441896618733,landmark,True | ||
| 53 | −4393148714,10.1609/aaai.v38i5.28226,2302.08453,T2I-Adapter: Learning Adapters to Dig Out More Controllable Ability for Text-to-Image Diffusion Models,Proceedings of the AAAI Conference on Artificial Intelligence,2024,conference-paper,multimodal_ai,7,683.0,923.0,193.71569872998148,923,194.9761,True,True,post,193.71569872998148,landmark,True | 53 | +4393148714,10.1609/aaai.v38i5.28226,2302.08453,T2I-Adapter: Learning Adapters to Dig Out More Controllable Ability for Text-to-Image Diffusion Models,Proceedings of the AAAI Conference on Artificial Intelligence,2024,conference-paper,multimodal_ai,7,683.0,923.0,193.71569872998148,923,194.9761,True,True,post,t2iadapterlearningadapterstodigoutmorecontrollableabilityfortexttoimagediffusionmodels,193.71569872998148,landmark,True | ||
| 54 | −4396599905,10.1016/j.inffus.2026.104437,2404.18947,Multimodal fusion on low-quality data: A comprehensive survey,Information Fusion,2026,article,multimodal_ai,3,48.0,48.0,128.6576012223071,48,99.7217,True,True,post,170.6505878075542,landmark,True | 54 | +4396599905,10.1016/j.inffus.2026.104437,2404.18947,Multimodal fusion on low-quality data: A comprehensive survey,Information Fusion,2026,article,multimodal_ai,3,48.0,48.0,128.6576012223071,48,99.7217,True,True,post,multimodalfusiononlowqualitydataacomprehensivesurvey,121.70257978516291,landmark,True | ||
| 55 | −4396952261,10.1007/978-3-031-53092-0_10,,Multimodal Deep Learning,Springer optimization and its applications,2024,book-chapter,multimodal_ai,3,188.0,189.0,147.22445489525438,189,23.3148,False,False,post,147.22445489525438,landmark,True | 55 | +7133250524,10.52202/068431-1833,,LAION-5B: An Open Large-Scale Dataset for Training Next Generation Image-Text Models,neural information processing systems,2022,conference-paper,multimodal_ai,4,217.0,828.0,111.87473883318704,309,6.4706,False,False,baseline,laion5banopenlargescaledatasetfortrainingnextgenerationimagetextmodels,111.87473883318704,landmark,True | ||
| 56 | −7133250524,10.52202/068431-1833,,LAION-5B: An Open Large-Scale Dataset for Training Next Generation Image-Text Models,neural information processing systems,2022,conference-paper,multimodal_ai,4,217.0,828.0,111.87473883318704,309,6.4706,False,False,baseline,111.87473883318704,landmark,True | 56 | +4392947532,10.1038/s41591-024-02856-4,,A visual-language foundation model for computational pathology,Nature Medicine,2024,article,multimodal_ai,4,475.0,938.0,111.12392137738586,938,132.4965,False,True,post,avisuallanguagefoundationmodelforcomputationalpathology,111.12392137738586,landmark,True | ||
| 57 | −4392947532,10.1038/s41591-024-02856-4,,A visual-language foundation model for computational pathology,Nature Medicine,2024,article,multimodal_ai,4,475.0,938.0,111.12392137738586,938,132.4965,False,True,post,111.12392137738586,landmark,True | 57 | +2619383789,10.1109/tpami.2018.2798607,,Multimodal Machine Learning: A Survey and Taxonomy,IEEE Transactions on Pattern Analysis and Machine Intelligence,2018,article,multimodal_ai,3,263.0,587.0,103.0608512817748,4909,120.007,True,True,baseline,multimodalmachinelearningasurveyandtaxonomy,103.0608512817748,landmark,True | ||
| 58 | −7138474371,10.1609/aaai.v40i16.38386,,OpenDriveVLA: Towards End-to-end Autonomous Driving with Large Vision Language Action Model,Proceedings of the AAAI Conference on Artificial Intelligence,2026,conference-paper,multimodal_ai,4,31.0,31.0,159.42857142857142,30,608.3281,True,True,post,110.21183795904541,landmark,True | 58 | +2995460200,,,VL-BERT: Pre-training of Generic Visual-Linguistic Representations,International Conference on Learning Representations,2020,conference-paper,multimodal_ai,6,491.0,670.0,81.11570775331289,252,20.1142,True,False,baseline,vlbertpretrainingofgenericvisuallinguisticrepresentations,81.11570775331289,landmark,True | ||
| 59 | −7127319731,10.1109/tmi.2026.3661001,,Med-R1: Reinforcement Learning for Generalizable Medical Reasoning in Vision-Language Models,IEEE Transactions on Medical Imaging,2026,article,multimodal_ai,6,29.0,29.0,77.73063407181054,28,87.2565,True,False,post,103.10139680039732,landmark,True | 59 | +4289785095,10.48550/arxiv.2208.01618,2208.01618,An Image is Worth One Word: Personalizing Text-to-Image Generation using Textual Inversion,arXiv (Cornell University),2022,preprint,multimodal_ai,9,98.0,366.0,79.44757164293819,468,,True,True,baseline,animageisworthonewordpersonalizingtexttoimagegenerationusingtextualinversion,79.44757164293819,landmark,True | ||
| 60 | −2619383789,10.1109/tpami.2018.2798607,,Multimodal Machine Learning: A Survey and Taxonomy,IEEE Transactions on Pattern Analysis and Machine Intelligence,2018,article,multimodal_ai,3,263.0,587.0,103.0608512817748,4909,120.007,True,True,baseline,103.0608512817748,landmark,True | 60 | +7138474371,10.1609/aaai.v40i16.38386,,OpenDriveVLA: Towards End-to-end Autonomous Driving with Large Vision Language Action Model,Proceedings of the AAAI Conference on Artificial Intelligence,2026,conference-paper,multimodal_ai,4,31.0,31.0,159.42857142857142,30,608.3281,True,True,post,opendrivevlatowardsendtoendautonomousdrivingwithlargevisionlanguageactionmodel,78.59958277791772,landmark,True | ||
| 61 | −7148475777,10.1117/12.3086794,2508.08224,Capabilities of GPT‑5 on multimodal medical reasoning,,2026,conference-paper,multimodal_ai,7,26.0,26.0,73.1907514450867,26,238.4333,True,True,post,92.4357350624252,landmark,True | 61 | +7127319731,10.1109/tmi.2026.3661001,,Med-R1: Reinforcement Learning for Generalizable Medical Reasoning in Vision-Language Models,IEEE Transactions on Medical Imaging,2026,article,multimodal_ai,6,29.0,29.0,77.73063407181054,28,87.2565,True,False,post,medr1reinforcementlearningforgeneralizablemedicalreasoninginvisionlanguagemodels,73.52864195353592,landmark,True | ||
| 62 | −7160627408,10.1109/csnt69054.2026.11502110,,Generative Artificial Intelligence for Cross-Domain Knowledge Synthesis and Intelligent Automation,IEEE International Conference on Communication Systems and Network Technologies (CSNT),2026,conference-paper,multimodal_ai,6,23.0,23.0,193.44642857142856,23,207.3469,True,False,post,81.77007332445305,landmark,True | 62 | +4415913530,10.1038/s41591-025-03982-3,,A multimodal whole-slide foundation model for pathology,Nature Medicine,2025,article,multimodal_ai,8,157.0,157.0,53.48194198133358,157,65.3314,True,True,post,amultimodalwholeslidefoundationmodelforpathology,68.60453612242637,landmark,True | ||
| 63 | −2995460200,,,VL-BERT: Pre-training of Generic Visual-Linguistic Representations,International Conference on Learning Representations,2020,conference-paper,multimodal_ai,6,491.0,670.0,81.11570775331289,252,20.1142,True,False,baseline,81.11570775331289,landmark,True | 63 | +7148475777,10.1117/12.3086794,2508.08224,Capabilities of GPT‑5 on multimodal medical reasoning,,2026,conference-paper,multimodal_ai,7,26.0,26.0,73.1907514450867,26,238.4333,True,True,post,capabilitiesofgpt5onmultimodalmedicalreasoning,65.92223071696324,landmark,True | ||
| 64 | −4415913530,10.1038/s41591-025-03982-3,,A multimodal whole-slide foundation model for pathology,Nature Medicine,2025,article,multimodal_ai,8,157.0,157.0,53.48194198133358,157,65.3314,True,True,post,79.48264021540155,landmark,True | 64 | +7133220561,10.52202/075280-2142,,InstructBLIP: Towards General-purpose Vision-Language Models with Instruction Tuning,neural information processing systems,2023,conference-paper,multimodal_ai,5,290.0,454.0,63.3563629226367,398,45.2545,False,False,post,instructbliptowardsgeneralpurposevisionlanguagemodelswithinstructiontuning,63.3563629226367,landmark,True | ||
| 65 | −4289785095,10.48550/arxiv.2208.01618,2208.01618,An Image is Worth One Word: Personalizing Text-to-Image Generation using Textual Inversion,arXiv (Cornell University),2022,preprint,multimodal_ai,9,98.0,366.0,79.44757164293819,468,,True,True,baseline,79.44757164293819,landmark,True | 65 | +4413447271,10.1038/s41467-025-62385-7,2308.02463,Towards generalist foundation model for radiology by leveraging web-scale 2D&3D medical data,Nature Communications,2025,article,multimodal_ai,4,142.0,142.0,46.43212351171006,142,51.2274,True,True,post,towardsgeneralistfoundationmodelforradiologybyleveragingwebscale2d3dmedicaldata,62.04996260754486,landmark,True | ||
| 66 | −7125233009,10.1007/s44443-026-00472-5,,SemCap: Sentiment-aware semantic captioning for multimodal aspect-based sentiment analysis,Journal of King Saud University - Computer and Information Sciences,2026,article,multimodal_ai,4,22.0,22.0,24.48163370151554,22,79.4776,True,True,post,78.21485274512901,landmark,True | 66 | +4389519587,10.18653/v1/2023.emnlp-demo.49,,Video-LLaMA: An Instruction-tuned Audio-Visual Language Model for Video Understanding,Conference on Empirical Methods in Natural Language Processing: System Demonstrations (EMNLP),2023,conference-paper,multimodal_ai,6,171.0,421.0,58.751164736630066,586,66.631,True,True,post,videollamaaninstructiontunedaudiovisuallanguagemodelforvideounderstanding,58.751164736630066,landmark,True | ||
| 67 | −7143512276,10.1007/s11831-026-10560-4,,Multimodal Machine Learning Approaches in Predictive Healthcare Analytics: A Comprehensive Survey,Archives of Computational Methods in Engineering,2026,article,multimodal_ai,5,21.0,21.0,23.368832169628472,21,75.865,True,True,post,74.65963216580496,landmark,True | 67 | +7160627408,10.1109/csnt69054.2026.11502110,,Generative Artificial Intelligence for Cross-Domain Knowledge Synthesis and Intelligent Automation,IEEE International Conference on Communication Systems and Network Technologies (CSNT),2026,conference-paper,multimodal_ai,6,23.0,23.0,193.44642857142856,23,207.3469,True,False,post,generativeartificialintelligenceforcrossdomainknowledgesynthesisandintelligentautomation,58.315819480390566,landmark,True | ||
| 68 | −4413447271,10.1038/s41467-025-62385-7,2308.02463,Towards generalist foundation model for radiology by leveraging web-scale 2D&3D medical data,Nature Communications,2025,article,multimodal_ai,4,142.0,142.0,46.43212351171006,142,51.2274,True,True,post,71.88875739227402,landmark,True | 68 | +7125233009,10.1007/s44443-026-00472-5,,SemCap: Sentiment-aware semantic captioning for multimodal aspect-based sentiment analysis,Journal of King Saud University - Computer and Information Sciences,2026,article,multimodal_ai,4,22.0,22.0,24.48163370151554,22,79.4776,True,True,post,semcapsentimentawaresemanticcaptioningformultimodalaspectbasedsentimentanalysis,55.78034906819967,landmark,True | ||
| 69 | −7131830459,10.1109/tmm.2026.3668620,2502.15711,A Survey on Multimodal Recommender Systems: Recent Advances and Future Directions,IEEE Transactions on Multimedia,2026,article,multimodal_ai,3,20.0,20.0,142.0908500973394,20,173.9038,True,True,post,71.10441158648091,landmark,True | 69 | +4399567248,10.1038/s41586-024-07618-3,,A multimodal generative AI copilot for human pathology,Nature,2024,article,multimodal_ai,8,268.0,452.0,53.54798769997698,452,63.8469,True,True,post,amultimodalgenerativeaicopilotforhumanpathology,53.54798769997698,landmark,True | ||
| 70 | −7206206818,10.1109/tpami.2026.3730310,,Lingshu: Generalist Foundation Model for Unified Multimodal Medical Understanding and Reasoning,IEEE Transactions on Pattern Analysis and Machine Intelligence,2026,article,multimodal_ai,6,18.0,18.0,48.246600458365165,18,56.0935,True,False,post,63.99397042783282,landmark,True | 70 | +7143512276,10.1007/s11831-026-10560-4,,Multimodal Machine Learning Approaches in Predictive Healthcare Analytics: A Comprehensive Survey,Archives of Computational Methods in Engineering,2026,article,multimodal_ai,5,21.0,21.0,23.368832169628472,21,75.865,True,True,post,multimodalmachinelearningapproachesinpredictivehealthcareanalyticsacomprehensivesurvey,53.24487865600877,landmark,True | ||
| 71 | −7133220561,10.52202/075280-2142,,InstructBLIP: Towards General-purpose Vision-Language Models with Instruction Tuning,neural information processing systems,2023,conference-paper,multimodal_ai,5,290.0,454.0,63.3563629226367,398,45.2545,False,False,post,63.3563629226367,landmark,True | 71 | +4410882873,10.1016/j.media.2025.103621,2411.03782,Navigating the landscape of multimodal AI in medicine: A scoping review on technical challenges and clinical applications,Medical Image Analysis,2025,article,multimodal_ai,6,119.0,119.0,7.914984580880291,119,24.365,True,True,post,navigatingthelandscapeofmultimodalaiinmedicineascopingreviewontechnicalchallengesandclinicalapplications,51.99961655139323,landmark,True | ||
| 72 | −7164501397,10.1038/s41467-026-74207-5,2311.05591,Multimodal foundation models exploit text to make medical image predictions,Nature Communications,2026,article,multimodal_ai,6,17.0,17.0,45.56623376623377,17,6.2326,True,True,post,60.43874984850878,landmark,True | 72 | +7131830459,10.1109/tmm.2026.3668620,2502.15711,A Survey on Multimodal Recommender Systems: Recent Advances and Future Directions,IEEE Transactions on Multimedia,2026,article,multimodal_ai,3,20.0,20.0,142.0908500973394,20,173.9038,True,True,post,asurveyonmultimodalrecommendersystemsrecentadvancesandfuturedirections,50.70940824381788,landmark,True | ||
| 73 | −7165561001,10.1007/978-3-032-29501-9_39,,"M3-HGMA: A Multi-modal, Multi-agent Hierarchical Graph-Mamba Architecture for Explainable and Adaptive Clinical Intelligence",Learning and analytics in intelligent systems,2026,conference-paper,multimodal_ai,2,17.0,17.0,142.98214285714286,17,160.2226,False,False,post,60.43874984850878,landmark,True | 73 | +4412438081,10.1016/j.array.2025.100445,,RAFT: Robust Adversarial Fusion Transformer for multimodal sentiment analysis,Array,2025,article,multimodal_ai,5,111.0,111.0,37.81207363011482,111,46.1897,True,True,post,raftrobustadversarialfusiontransformerformultimodalsentimentanalysis,48.503844010123096,landmark,True | ||
| 74 | −7138470740,10.1609/aaai.v40i18.38608,,Cross-modal Proxy Evolving for OOD Detection with Vision-Language Models,Proceedings of the AAAI Conference on Artificial Intelligence,2026,conference-paper,multimodal_ai,7,17.0,17.0,130.47598850731976,17,157.1634,True,True,post,60.43874984850878,landmark,True | 74 | +2968124245,10.48550/arxiv.1908.03557,1908.03557,VisualBERT: A Simple and Performant Baseline for Vision and Language,arXiv (Cornell University),2019,preprint,multimodal_ai,7,120.0,374.0,48.02738920120277,1140,,True,True,baseline,visualbertasimpleandperformantbaselineforvisionandlanguage,48.02738920120277,landmark,True | ||
| 75 | −7138363754,10.1609/aaai.v40i6.42404,,AdaptCLIP: Adapting CLIP for Universal Visual Anomaly Detection,Proceedings of the AAAI Conference on Artificial Intelligence,2026,conference-paper,multimodal_ai,6,17.0,17.0,130.47598850731976,17,157.1634,True,True,post,60.43874984850878,landmark,True | 75 | +7206206818,10.1109/tpami.2026.3730310,,Lingshu: Generalist Foundation Model for Unified Multimodal Medical Understanding and Reasoning,IEEE Transactions on Pattern Analysis and Machine Intelligence,2026,article,multimodal_ai,6,18.0,18.0,48.246600458365165,18,56.0935,True,False,post,lingshugeneralistfoundationmodelforunifiedmultimodalmedicalunderstandingandreasoning,45.63846741943609,landmark,True | ||
| 76 | −4410882873,10.1016/j.media.2025.103621,2411.03782,Navigating the landscape of multimodal AI in medicine: A scoping review on technical challenges and clinical applications,Medical Image Analysis,2025,article,multimodal_ai,6,119.0,119.0,7.914984580880291,119,24.365,True,True,post,60.24480373014512,landmark,True | 76 | +4389523832,10.18653/v1/2023.emnlp-main.20,2305.10355,Evaluating Object Hallucination in Large Vision-Language Models,Conference on Empirical Methods in Natural Language Processing (EMNLP),2023,conference-paper,multimodal_ai,6,124.0,326.0,45.49377601933825,559,63.561,True,True,post,evaluatingobjecthallucinationinlargevisionlanguagemodels,45.49377601933825,landmark,True | ||
| 77 | −4400228804,10.46569/df65vg26z,,The Conglomeration of Everything: Shifting Animation Production Practices due to Artificial Intelligence,,2024,dissertation,generative_ai,4,2.0,2.0,540.0,2,,True,True,post,540.0,landmark,True | 77 | +4400228804,10.46569/df65vg26z,,The Conglomeration of Everything: Shifting Animation Production Practices due to Artificial Intelligence,,2024,dissertation,generative_ai,4,2.0,2.0,540.0,2,,True,True,post,theconglomerationofeverythingshiftinganimationproductionpracticesduetoartificialintelligence,540.0,landmark,True | ||
| 78 | −7124262017,10.1787/062a7394-en,,OECD Digital Education Outlook 2026,Digital education outlook,2026,book,generative_ai,1,87.0,87.0,783.6796875,87,992.8809,True,False,post,309.304190401192,landmark,True | 78 | +4383312437,10.1186/s41239-023-00408-3,2305.00280,A comprehensive AI policy education framework for university teaching and learning,International Journal of Educational Technology in Higher Education,2023,article,generative_ai,1,451.0,988.0,231.56326653406123,1524,357.6522,True,True,post,acomprehensiveaipolicyeducationframeworkforuniversityteachingandlearning,231.56326653406123,landmark,True | ||
| 79 | −4406472463,10.1038/s41586-025-08628-5,,A generative model for inorganic materials design,Nature,2025,article,generative_ai,2,498.0,498.0,77.09849967384214,498,102.9572,True,True,post,252.1169097278342,landmark,True | 79 | +7133185348,10.52202/068431-2643,,Photorealistic Text-To-Image Diffusion Models with Deep Language Understanding,neural information processing systems,2022,conference-paper,generative_ai,5,651.0,1706.0,230.5051986104071,530,10.1405,False,False,baseline,photorealistictexttoimagediffusionmodelswithdeeplanguageunderstanding,230.5051986104071,landmark,True | ||
| 80 | −7123342962,10.1109/tmm.2026.3651132,,Structure-Preserving Frequency-Regularized Text-Guided Optimal Transport for Unpaired Rain Streaks and Raindrops Removal,IEEE Transactions on Multimedia,2026,article,generative_ai,3,66.0,66.0,176.9042016806723,66,205.676,True,False,post,234.64455823538702,landmark,True | 80 | +3195296536,,,Generative Adversarial Trainer Defense to Adversarial Perturbations with GAN,Seoul National University Open Repository (Seoul National University),2020,dissertation,generative_ai,4,37.0,48.0,221.6522377109318,65,,False,True,baseline,generativeadversarialtrainerdefensetoadversarialperturbationswithgan,221.6522377109318,landmark,True | ||
| 81 | −4383312437,10.1186/s41239-023-00408-3,2305.00280,A comprehensive AI policy education framework for university teaching and learning,International Journal of Educational Technology in Higher Education,2023,article,generative_ai,1,451.0,988.0,231.56326653406123,1524,357.6522,True,True,post,231.56326653406123,landmark,True | 81 | +7124262017,10.1787/062a7394-en,,OECD Digital Education Outlook 2026,Digital education outlook,2026,book,generative_ai,1,87.0,87.0,783.6796875,87,992.8809,True,False,post,oecddigitaleducationoutlook2026,220.58592586060777,landmark,True | ||
| 82 | −7133185348,10.52202/068431-2643,,Photorealistic Text-To-Image Diffusion Models with Deep Language Understanding,neural information processing systems,2022,conference-paper,generative_ai,5,651.0,1706.0,230.5051986104071,530,10.1405,False,False,baseline,230.5051986104071,landmark,True | 82 | +4406472463,10.1038/s41586-025-08628-5,,A generative model for inorganic materials design,Nature,2025,article,generative_ai,2,498.0,498.0,77.09849967384214,498,102.9572,True,True,post,agenerativemodelforinorganicmaterialsdesign,217.6118406940658,landmark,True | ||
| 83 | −3195296536,,,Generative Adversarial Trainer Defense to Adversarial Perturbations with GAN,Seoul National University Open Repository (Seoul National University),2020,dissertation,generative_ai,4,37.0,48.0,221.6522377109318,65,,False,True,baseline,221.6522377109318,landmark,True | 83 | +4322617812,10.1016/j.ijme.2023.100790,,Generative AI and the future of education: Ragnarök or reformation? A paradoxical perspective from management educators,The International Journal of Management Education,2023,article,generative_ai,1,491.0,873.0,204.6100523119792,1151,270.2366,True,True,post,generativeaiandthefutureofeducationragnarkorreformationaparadoxicalperspectivefrommanagementeducators,204.6100523119792,landmark,True | ||
| 84 | −4322617812,10.1016/j.ijme.2023.100790,,Generative AI and the future of education: Ragnarök or reformation? A paradoxical perspective from management educators,The International Journal of Management Education,2023,article,generative_ai,1,491.0,873.0,204.6100523119792,1151,270.2366,True,True,post,204.6100523119792,landmark,True | 84 | +4400770292,10.2139/ssrn.4895486,,Generative AI Can Harm Learning,SSRN Electronic Journal,2024,preprint,generative_ai,1,123.0,198.0,174.24635549016986,198,,False,True,post,generativeaicanharmlearning,174.24635549016986,landmark,True | ||
| 85 | −3096831136,10.1145/3422622,,Generative adversarial networks,Communications of the ACM,2020,article,generative_ai,3,565.0,1473.0,198.6115392180884,14434,457.4443,True,False,baseline,198.6115392180884,landmark,True | 85 | +7123342962,10.1109/tmm.2026.3651132,,Structure-Preserving Frequency-Regularized Text-Guided Optimal Transport for Unpaired Rain Streaks and Raindrops Removal,IEEE Transactions on Multimedia,2026,article,generative_ai,3,66.0,66.0,176.9042016806723,66,205.676,True,False,post,structurepreservingfrequencyregularizedtextguidedoptimaltransportforunpairedrainstreaksandraindropsremoval,167.341047204599,landmark,True | ||
| 86 | −4400770292,10.2139/ssrn.4895486,,Generative AI Can Harm Learning,SSRN Electronic Journal,2024,preprint,generative_ai,1,123.0,198.0,174.24635549016986,198,,False,True,post,174.24635549016986,landmark,True | 86 | +4398243313,10.1186/s41239-024-00468-z,,A scoping review on how generative artificial intelligence transforms assessment in higher education,International Journal of Educational Technology in Higher Education,2024,article,generative_ai,1,181.0,463.0,139.39774582546502,463,177.182,True,True,post,ascopingreviewonhowgenerativeartificialintelligencetransformsassessmentinhighereducation,139.39774582546502,landmark,True | ||
| 87 | −7127274868,10.1002/jcal.70198,,Parental AI Investment Behaviours and AI ‐Mediated Informal Digital Learning of English: The Chain Mediating Role of Children's Perceived AI Value and Effort Expectancy for AI,Journal of Computer Assisted Learning,2026,article,generative_ai,1,48.0,48.0,341.0180402336145,48,439.3359,True,False,post,170.6505878075542,landmark,True | 87 | +7127274868,10.1002/jcal.70198,,Parental AI Investment Behaviours and AI ‐Mediated Informal Digital Learning of English: The Chain Mediating Role of Children's Perceived AI Value and Effort Expectancy for AI,Journal of Computer Assisted Learning,2026,article,generative_ai,1,48.0,48.0,341.0180402336145,48,439.3359,True,False,post,parentalaiinvestmentbehavioursandaimediatedinformaldigitallearningofenglishthechainmediatingroleofchildrensperceivedaivalueandeffortexpectancyforai,121.70257978516291,landmark,True | ||
| 88 | −7124974472,10.1287/mnsc.2025.02523,,The Rapid Adoption of Generative AI,Management Science,2026,article,generative_ai,1,42.0,42.0,46.737664339256945,42,151.73,True,False,post,149.31926433160993,landmark,True | 88 | +4406199489,10.3389/bjbs.2024.14048,,Generative AI in Higher Education: Balancing Innovation and Integrity,British Journal of Biomedical Science,2025,article,generative_ai,2,278.0,278.0,241.35986779790812,278,301.5286,True,True,post,generativeaiinhighereducationbalancinginnovationandintegrity,121.47809580913713,landmark,True | ||
| 89 | −7118187240,10.3390/en19010284,,Patch Time Series Transformer−Based Short−Term Photovoltaic Power Prediction Enhanced by Artificial Fish,Energies,2026,article,generative_ai,1,40.0,40.0,44.5120612754828,40,144.5047,True,True,post,142.20882317296181,landmark,True | 89 | +4394934695,10.1016/j.caeai.2024.100221,,The impact of generative AI on higher education learning and teaching: A study of educators’ perspectives,Computers and Education Artificial Intelligence,2024,article,generative_ai,1,207.0,394.0,118.623567721886,394,150.7769,True,True,post,theimpactofgenerativeaionhighereducationlearningandteachingastudyofeducatorsperspectives,118.623567721886,landmark,True | ||
| 90 | −4406199489,10.3389/bjbs.2024.14048,,Generative AI in Higher Education: Balancing Innovation and Integrity,British Journal of Biomedical Science,2025,article,generative_ai,2,278.0,278.0,241.35986779790812,278,301.5286,True,True,post,140.739961655297,landmark,True | 90 | +4409269614,10.3390/info16040296,,Generative AI and Academic Integrity in Higher Education: A Systematic Review and Research Agenda,Information,2025,review,generative_ai,1,271.0,271.0,14.199554069119287,271,53.4431,True,True,post,generativeaiandacademicintegrityinhighereducationasystematicreviewandresearchagenda,118.41929483552576,landmark,True | ||
| 91 | −4398243313,10.1186/s41239-024-00468-z,,A scoping review on how generative artificial intelligence transforms assessment in higher education,International Journal of Educational Technology in Higher Education,2024,article,generative_ai,1,181.0,463.0,139.39774582546502,463,177.182,True,True,post,139.39774582546502,landmark,True | 91 | +4395957952,10.54675/ewzm9535,,Guidance for generative AI in education and research,UNESCO eBooks,2023,book,generative_ai,2,164.0,400.0,116.73200564528776,726,252.3485,False,False,post,guidanceforgenerativeaiineducationandresearch,116.73200564528776,landmark,True | ||
| 92 | −4409269614,10.3390/info16040296,,Generative AI and Academic Integrity in Higher Education: A Systematic Review and Research Agenda,Information,2025,review,generative_ai,1,271.0,271.0,14.199554069119287,271,53.4431,True,True,post,137.19614967117084,landmark,True | 92 | +4394863715,10.2139/ssrn.4759930,,How Generative AI Can Augment Human Creativity,SSRN Electronic Journal,2024,preprint,generative_ai,1,111.0,131.0,114.27954959430369,131,,False,True,post,howgenerativeaicanaugmenthumancreativity,114.27954959430369,landmark,True | ||
| 93 | −3193917007,10.1007/978-1-4842-7341-8_10,,Generative Adversarial Networks,Apress eBooks,2021,book-chapter,generative_ai,3,61.0,195.0,127.1017316017316,255,116.749,True,False,baseline,127.1017316017316,landmark,True | 93 | +4401077562,10.1080/10447318.2024.2383033,,Factors Influencing University Students’ Behavioral Intention to Use Generative Artificial Intelligence: Integrating the Theory of Planned Behavior and AI Literacy,International Journal of Human-Computer Interaction,2024,article,generative_ai,3,172.0,353.0,106.27949087773035,353,135.087,True,False,post,factorsinfluencinguniversitystudentsbehavioralintentiontousegenerativeartificialintelligenceintegratingthetheoryofplannedbehaviorandailiteracy,106.27949087773035,landmark,True | ||
| 94 | −4288099666,10.48550/arxiv.2207.12598,2207.12598,Classifier-Free Diffusion Guidance,arXiv (Cornell University),2022,preprint,generative_ai,3,211.0,575.0,124.81517402920616,731,,True,True,baseline,124.81517402920616,landmark,True | 94 | +7118187240,10.3390/en19010284,,Patch Time Series Transformer−Based Short−Term Photovoltaic Power Prediction Enhanced by Artificial Fish,Energies,2026,article,generative_ai,1,40.0,40.0,44.5120612754828,40,144.5047,True,True,post,patchtimeseriestransformerbasedshorttermphotovoltaicpowerpredictionenhancedbyartificialfish,101.41881648763577,landmark,True | ||
| 95 | −4394934695,10.1016/j.caeai.2024.100221,,The impact of generative AI on higher education learning and teaching: A study of educators’ perspectives,Computers and Education Artificial Intelligence,2024,article,generative_ai,1,207.0,394.0,118.623567721886,394,150.7769,True,True,post,118.623567721886,landmark,True | 95 | +4407778399,10.1186/s41239-025-00507-3,,"Investigating the higher education institutions’ guidelines and policies regarding the use of generative AI in teaching, learning, research, and administration",International Journal of Educational Technology in Higher Education,2025,article,generative_ai,3,213.0,213.0,184.92680518328933,213,232.7014,True,True,post,investigatingthehighereducationinstitutionsguidelinesandpoliciesregardingtheuseofgenerativeaiinteachinglearningresearchandadministration,93.07494391131729,landmark,True | ||
| 96 | −4321648656,10.1163/22134913-bja10078,2302.10913,From Paintbrush to Pixel: A Review of Deep Neural Networks in AI-Generated Art,Art & Perception,2026,article,generative_ai,4,33.0,33.0,88.45210084033614,33,9.3489,True,True,post,117.32227911769351,landmark,True | 96 | +4401917994,10.38124/ijisrt/ijisrt24aug265,,Building Face Ageing Model Using Face Synthesis,International Journal of Innovative Science and Research Technology (IJISRT),2024,article,generative_ai,3,737.0,737.0,87.31165251080317,737,103.9631,True,True,post,buildingfaceageingmodelusingfacesynthesis,87.31165251080317,landmark,True | ||
| 97 | −4395957952,10.54675/ewzm9535,,Guidance for generative AI in education and research,UNESCO eBooks,2023,book,generative_ai,2,164.0,400.0,116.73200564528776,726,252.3485,False,False,post,116.73200564528776,landmark,True | 97 | +4411505840,10.1038/s41598-025-97652-6,,AI tutoring outperforms in-class active learning: an RCT introducing a novel research-based design in an authentic educational setting,Scientific Reports,2025,article,generative_ai,1,196.0,196.0,66.76726514867121,196,81.1441,True,True,post,aitutoringoutperformsinclassactivelearninganrctintroducinganovelresearchbaseddesigninanauthenticeducationalsetting,85.64642726111826,landmark,True | ||
| 98 | −4394863715,10.2139/ssrn.4759930,,How Generative AI Can Augment Human Creativity,SSRN Electronic Journal,2024,preprint,generative_ai,1,111.0,131.0,114.27954959430369,131,,False,True,post,114.27954959430369,landmark,True | 98 | +2804078698,10.48550/arxiv.1805.08318,1805.08318,Self-Attention Generative Adversarial Networks,arXiv (Cornell University),2018,preprint,generative_ai,4,365.0,936.0,85.0107976109918,2327,,True,True,baseline,selfattentiongenerativeadversarialnetworks,85.0107976109918,landmark,True | ||
| 99 | −4407778399,10.1186/s41239-025-00507-3,,"Investigating the higher education institutions’ guidelines and policies regarding the use of generative AI in teaching, learning, research, and administration",International Journal of Educational Technology in Higher Education,2025,article,generative_ai,3,213.0,213.0,184.92680518328933,213,232.7014,True,True,post,107.83313608841102,landmark,True | 99 | +4321648656,10.1163/22134913-bja10078,2302.10913,From Paintbrush to Pixel: A Review of Deep Neural Networks in AI-Generated Art,Art & Perception,2026,article,generative_ai,4,33.0,33.0,88.45210084033614,33,9.3489,True,True,post,frompaintbrushtopixelareviewofdeepneuralnetworksinaigeneratedart,83.6705236022995,landmark,True | ||
| 100 | −7124432017,10.1080/10494820.2026.2615818,,Human-Centric Artificial Intelligence Pedagogy (HCAP) framework developed from TPACK through integration of artificial intelligence literacy and competency,Interactive Learning Environments,2026,article,generative_ai,2,30.0,30.0,213.13627514600907,30,265.4321,True,True,post,106.65661737972137,landmark,True | 100 | +2806351858,10.48550/arxiv.1805.11973,1805.11973,MolGAN: An implicit generative model for small molecular graphs,arXiv (Cornell University),2018,preprint,generative_ai,7,61.0,157.0,83.37167538076835,441,,True,True,baseline,molgananimplicitgenerativemodelforsmallmoleculargraphs,83.37167538076835,landmark,True | ||
| 101 | −7140170686,10.1186/s41239-026-00585-x,,Pedagogical partnerships with generative AI in higher education: how dual cognitive pathways paradoxically enable transformative learning,International Journal of Educational Technology in Higher Education,2026,article,generative_ai,2,30.0,30.0,213.13627514600907,30,274.5849,True,True,post,106.65661737972137,landmark,True | 101 | +4379057711,10.3390/app13116716,,"Exploring the Potential Impact of Artificial Intelligence (AI) on International Students in Higher Education: Generative AI, Chatbots, Analytics, and International Student Success",Applied Sciences,2023,article,generative_ai,2,158.0,352.0,82.50027309715541,461,108.0946,True,True,post,exploringthepotentialimpactofartificialintelligenceaioninternationalstudentsinhighereducationgenerativeaichatbotsanalyticsandinternationalstudentsuccess,82.50027309715541,landmark,True | ||
| 102 | −4406728221,10.1109/access.2025.3532853,,Agentic AI: Autonomous Intelligence for Complex Goals—A Comprehensive Survey,IEEE Access,2025,article,ai_agents,1,694.0,694.0,236.41062251621338,694,288.7899,True,True,post,351.3436452833674,landmark,True | 102 | +4406728221,10.1109/access.2025.3532853,,Agentic AI: Autonomous Intelligence for Complex Goals—A Comprehensive Survey,IEEE Access,2025,article,ai_agents,1,694.0,694.0,236.41062251621338,694,288.7899,True,True,post,agenticaiautonomousintelligenceforcomplexgoalsacomprehensivesurvey,303.25826795518407,landmark,True | ||
| 103 | −7161734976,10.1038/s41586-026-10652-y,,A multi-agent system for automating scientific discovery,Nature,2026,article,ai_agents,3,62.0,62.0,175.0637411130179,62,220.9602,True,True,post,220.42367591809082,landmark,True | 103 | +7161734976,10.1038/s41586-026-10652-y,,A multi-agent system for automating scientific discovery,Nature,2026,article,ai_agents,3,62.0,62.0,175.0637411130179,62,220.9602,True,True,post,amultiagentsystemforautomatingscientificdiscovery,157.19916555583544,landmark,True | ||
| 104 | −7135409568,10.1038/s41746-026-02517-5,,The role of agentic artificial intelligence in healthcare: a scoping review,npj Digital Medicine,2026,article,ai_agents,1,52.0,52.0,23.673009161381255,52,97.7788,True,True,post,184.8714701248504,landmark,True | 104 | +4225355126,10.1007/978-981-19-0493-6_1,,Introduction to Multi-agent Systems,Springer tracts in human-centered computing,2022,book-chapter,ai_agents,1,266.0,268.0,143.62252453934906,287,6.1939,False,False,baseline,introductiontomultiagentsystems,143.62252453934906,landmark,True | ||
| 105 | −7134187809,10.1016/j.isatra.2026.03.010,,Dynamic event-triggered approximate optimal consensus control for unknown nonlinear multi-agent systems via adaptive dynamic programming,ISA Transactions,2026,article,ai_agents,3,46.0,46.0,129.88600147094877,46,163.9382,False,False,post,163.5401466489061,landmark,True | 105 | +7135409568,10.1038/s41746-026-02517-5,,The role of agentic artificial intelligence in healthcare: a scoping review,npj Digital Medicine,2026,article,ai_agents,1,52.0,52.0,23.673009161381255,52,97.7788,True,True,post,theroleofagenticartificialintelligenceinhealthcareascopingreview,131.84446143392648,landmark,True | ||
| 106 | −4390730779,10.1002/widm.70111,2401.03428,"Exploring Large Language Model‐Based Intelligent Agents: Definitions, Methods, and Prospects",Wiley Interdisciplinary Reviews Data Mining and Knowledge Discovery,2026,article,ai_agents,3,44.0,44.0,48.96326740303108,44,32.5136,True,True,post,156.42970549025802,landmark,True | 106 | +4410197190,10.1016/j.array.2025.100399,,The role of agentic AI in shaping a smart future: A systematic review,Array,2025,review,ai_agents,4,267.0,267.0,33.148798521256936,267,36.646,True,True,post,theroleofagenticaiinshapingasmartfutureasystematicreview,116.6714085648907,landmark,True | ||
| 107 | −4225355126,10.1007/978-981-19-0493-6_1,,Introduction to Multi-agent Systems,Springer tracts in human-centered computing,2022,book-chapter,ai_agents,1,266.0,268.0,143.62252453934906,287,6.1939,False,False,baseline,143.62252453934906,landmark,True | 107 | +7134187809,10.1016/j.isatra.2026.03.010,,Dynamic event-triggered approximate optimal consensus control for unknown nonlinear multi-agent systems via adaptive dynamic programming,ISA Transactions,2026,article,ai_agents,3,46.0,46.0,129.88600147094877,46,163.9382,False,False,post,dynamiceventtriggeredapproximateoptimalconsensuscontrolforunknownnonlinearmultiagentsystemsviaadaptivedynamicprogramming,116.63163896078113,landmark,True | ||
| 108 | −4407570917,10.26599/if.2026.9710004,2502.08691,AgentSociety: Large-scale simulation of LLM-driven generative agents advances understanding of human behaviors and society,iFuture,2026,article,ai_agents,2,40.0,40.0,44.5120612754828,40,126.4417,True,True,post,142.20882317296181,landmark,True | 108 | +4413427262,10.1016/j.inffus.2025.103599,2505.10468,"AI Agents vs. Agentic AI: A Conceptual taxonomy, applications and challenges",Information Fusion,2025,article,ai_agents,8,258.0,258.0,87.88752249161823,258,107.36,True,True,post,aiagentsvsagenticaiaconceptualtaxonomyapplicationsandchallenges,112.7386644559618,landmark,True | ||
| 109 | −4410197190,10.1016/j.array.2025.100399,,The role of agentic AI in shaping a smart future: A systematic review,Array,2025,review,ai_agents,4,267.0,267.0,33.148798521256936,267,36.646,True,True,post,135.17111425167016,landmark,True | 109 | +4390730779,10.1002/widm.70111,2401.03428,"Exploring Large Language Model‐Based Intelligent Agents: Definitions, Methods, and Prospects",Wiley Interdisciplinary Reviews Data Mining and Knowledge Discovery,2026,article,ai_agents,3,44.0,44.0,48.96326740303108,44,32.5136,True,True,post,exploringlargelanguagemodelbasedintelligentagentsdefinitionsmethodsandprospects,111.56069813639934,landmark,True | ||
| 110 | −4413427262,10.1016/j.inffus.2025.103599,2505.10468,"AI Agents vs. Agentic AI: A Conceptual taxonomy, applications and challenges",Information Fusion,2025,article,ai_agents,8,258.0,258.0,87.88752249161823,258,107.36,True,True,post,130.61478455779363,landmark,True | 110 | +4401023556,10.24963/ijcai.2024/890,,Large Language Model Based Multi-agents: A Survey of Progress and Challenges,,2024,conference-paper,ai_agents,4,231.0,371.0,103.12387591961277,302,91.8723,True,True,post,largelanguagemodelbasedmultiagentsasurveyofprogressandchallenges,103.12387591961277,landmark,True | ||
| 111 | −4414991289,10.1039/d5sc09921h,2508.13251,“DIVE” into hydrogen storage materials discovery with AI agents,Chemical Science,2026,article,ai_agents,3,31.0,31.0,23.90492957746479,31,43.4978,True,True,post,110.21183795904541,landmark,True | 111 | +4407570917,10.26599/if.2026.9710004,2502.08691,AgentSociety: Large-scale simulation of LLM-driven generative agents advances understanding of human behaviors and society,iFuture,2026,article,ai_agents,2,40.0,40.0,44.5120612754828,40,126.4417,True,True,post,agentsocietylargescalesimulationofllmdrivengenerativeagentsadvancesunderstandingofhumanbehaviorsandsociety,101.41881648763577,landmark,True | ||
| 112 | −7122857583,10.1007/s10462-025-11458-6,,"Agentic AI systems in the age of generative models: architectures, cloud scalability, and real-world applications",Artificial Intelligence Review,2026,article,ai_agents,7,30.0,30.0,33.384045956612105,30,108.3786,True,True,post,106.65661737972137,landmark,True | 112 | +4414023998,10.3390/fi17090404,,"The Rise of Agentic AI: A Review of Definitions, Frameworks, Architectures, Applications, Evaluation Metrics, and Challenges",Future Internet,2025,article,ai_agents,3,189.0,189.0,64.3827199647901,189,78.6474,True,True,post,theriseofagenticaiareviewofdefinitionsframeworksarchitecturesapplicationsevaluationmetricsandchallenges,82.5876262875069,landmark,True | ||
| 113 | −4401023556,10.24963/ijcai.2024/890,,Large Language Model Based Multi-agents: A Survey of Progress and Challenges,,2024,conference-paper,ai_agents,4,231.0,371.0,103.12387591961277,302,91.8723,True,True,post,103.12387591961277,landmark,True | 113 | +4414991289,10.1039/d5sc09921h,2508.13251,“DIVE” into hydrogen storage materials discovery with AI agents,Chemical Science,2026,article,ai_agents,3,31.0,31.0,23.90492957746479,31,43.4978,True,True,post,diveintohydrogenstoragematerialsdiscoverywithaiagents,78.59958277791772,landmark,True | ||
| 114 | −4414023998,10.3390/fi17090404,,"The Rise of Agentic AI: A Review of Definitions, Frameworks, Architectures, Applications, Evaluation Metrics, and Challenges",Future Internet,2025,article,ai_agents,3,189.0,189.0,64.3827199647901,189,78.6474,True,True,post,95.68292357140696,landmark,True | 114 | +7122857583,10.1007/s10462-025-11458-6,,"Agentic AI systems in the age of generative models: architectures, cloud scalability, and real-world applications",Artificial Intelligence Review,2026,article,ai_agents,7,30.0,30.0,33.384045956612105,30,108.3786,True,True,post,agenticaisystemsintheageofgenerativemodelsarchitecturescloudscalabilityandrealworldapplications,76.06411236572681,landmark,True | ||
| 115 | −7118083939,10.1007/s12525-025-00861-0,,Agentic information systems,Electronic Markets,2026,article,ai_agents,1,26.0,26.0,32.66095238095238,26,314.5617,True,True,post,92.4357350624252,landmark,True | 115 | +4390638955,10.1007/s40692-023-00304-9,,Artificial intelligence (AI) learning tools in K-12 education: A scoping review,Journal of Computers in Education,2024,article,ai_agents,1,146.0,240.0,72.25801079505747,240,91.8438,True,True,post,artificialintelligenceailearningtoolsink12educationascopingreview,72.25801079505747,landmark,True | ||
| 116 | −4412505619,10.70777/si.v2i3.15161,,"AI Agents vs. Agentic AI: A Conceptual Taxonomy, Applications and Challenges",SuperIntelligence - Robotics - Safety & Alignment,2025,article,ai_agents,6,181.0,181.0,61.65752546892597,181,75.3184,True,True,post,91.63285273240561,landmark,True | 116 | +4416209823,10.1007/s10462-025-11422-4,2510.25445,"Agentic AI: a comprehensive survey of architectures, applications, and future directions",Artificial Intelligence Review,2025,article,ai_agents,4,165.0,165.0,56.20713647719771,165,68.6604,True,True,post,agenticaiacomprehensivesurveyofarchitecturesapplicationsandfuturedirections,72.1003086636965,landmark,True | ||
| 117 | −4416209823,10.1007/s10462-025-11422-4,2510.25445,"Agentic AI: a comprehensive survey of architectures, applications, and future directions",Artificial Intelligence Review,2025,article,ai_agents,4,165.0,165.0,56.20713647719771,165,68.6604,True,True,post,83.53271105440291,landmark,True | 117 | +4399982941,10.5821/dissertation-2117-410409,,Value engineering for autonomous agents,,2024,dissertation,ai_agents,2,7.0,8.0,68.17851239669422,1,,True,True,post,valueengineeringforautonomousagents,68.17851239669422,landmark,True | ||
| 118 | −7155930820,10.1109/tase.2026.3686874,,Adaptive Prescribed Performance Secure Consensus Control for High-Order Constrained Multi-Agent Systems With Time-Varying Powers and Arbitrary Initial States,IEEE Transactions on Automation Science and Engineering,2026,article,ai_agents,2,23.0,23.0,80.74592420071988,23,96.3814,False,False,post,81.77007332445305,landmark,True | 118 | +4412709685,10.1038/s41586-025-09442-9,,The Virtual Lab of AI agents designs new SARS-CoV-2 nanobodies,Nature,2025,article,ai_agents,2,150.0,150.0,33.53365384615385,150,107.0846,False,False,post,thevirtuallabofaiagentsdesignsnewsarscov2nanobodies,65.545735148815,landmark,True | ||
| 119 | −7162257503,10.1016/j.ejcon.2026.101534,,Predefined-time sliding-mode formation control for second-order nonlinear multi-agent systems under deception attacks,European Journal of Control,2026,article,ai_agents,1,22.0,22.0,77.23523184416683,22,92.1909,False,False,post,78.21485274512901,landmark,True | 119 | +4412203333,10.1145/3748302,2404.13501,A Survey on the Memory Mechanism of Large Language Model-based Agents,ACM Transactions on Information Systems,2025,article,ai_agents,4,139.0,139.0,47.35025436563928,139,56.1767,True,True,post,asurveyonthememorymechanismoflargelanguagemodelbasedagents,60.739047904568565,landmark,True | ||
| 120 | −4412709685,10.1038/s41586-025-09442-9,,The Virtual Lab of AI agents designs new SARS-CoV-2 nanobodies,Nature,2025,article,ai_agents,2,150.0,150.0,33.53365384615385,150,107.0846,False,False,post,75.93882823127537,landmark,True | 120 | +2144462863,10.5555/2343576.2343653,2410.10004,Crowd IQ -- Aggregating Opinions to Boost Performance,arXiv (Cornell University),2024,preprint,ai_agents,2,52.0,52.0,60.60850111856823,52,,True,True,post,crowdiqaggregatingopinionstoboostperformance,60.60850111856823,landmark,True | ||
| 121 | −7128165235,10.1007/s12525-025-00862-z,,Multi-agent AI,Electronic Markets,2026,article,ai_agents,2,21.0,21.0,23.368832169628472,21,75.865,True,True,post,74.65963216580496,landmark,True | 121 | +7155930820,10.1109/tase.2026.3686874,,Adaptive Prescribed Performance Secure Consensus Control for High-Order Constrained Multi-Agent Systems With Time-Varying Powers and Arbitrary Initial States,IEEE Transactions on Automation Science and Engineering,2026,article,ai_agents,2,23.0,23.0,80.74592420071988,23,96.3814,False,False,post,adaptiveprescribedperformancesecureconsensuscontrolforhighorderconstrainedmultiagentsystemswithtimevaryingpowersandarbitraryinitialstates,58.315819480390566,landmark,True | ||
| 122 | −7118190454,10.1109/ojcs.2026.3650842,2507.14912,Redefining Elderly Care With Agentic AI: Challenges and Opportunities,IEEE Open Journal of the Computer Society,2026,article,ai_agents,4,21.0,21.0,22.217391304347824,21,315.9642,True,True,post,74.65963216580496,landmark,True | 122 | +4378505261,10.48550/arxiv.2305.16291,2305.16291,Voyager: An Open-Ended Embodied Agent with Large Language Models,arXiv (Cornell University),2023,preprint,ai_agents,6,118.0,171.0,56.852813926843034,187,,True,True,post,voyageranopenendedembodiedagentwithlargelanguagemodels,56.852813926843034,landmark,True | ||
| 123 | −7130481397,10.1038/s41746-026-02443-6,,Benchmarking large language model-based agent systems for clinical decision tasks,npj Digital Medicine,2026,article,ai_agents,3,21.0,21.0,9.560253699788584,21,39.4876,True,True,post,74.65963216580496,landmark,True | 123 | +7162257503,10.1016/j.ejcon.2026.101534,,Predefined-time sliding-mode formation control for second-order nonlinear multi-agent systems under deception attacks,European Journal of Control,2026,article,ai_agents,1,22.0,22.0,77.23523184416683,22,92.1909,False,False,post,predefinedtimeslidingmodeformationcontrolforsecondordernonlinearmultiagentsystemsunderdeceptionattacks,55.78034906819967,landmark,True | ||
| 124 | −4390638955,10.1007/s40692-023-00304-9,,Artificial intelligence (AI) learning tools in K-12 education: A scoping review,Journal of Computers in Education,2024,article,ai_agents,1,146.0,240.0,72.25801079505747,240,91.8438,True,True,post,72.25801079505747,landmark,True | 124 | +7130481397,10.1038/s41746-026-02443-6,,Benchmarking large language model-based agent systems for clinical decision tasks,npj Digital Medicine,2026,article,ai_agents,3,21.0,21.0,9.560253699788584,21,39.4876,True,True,post,benchmarkinglargelanguagemodelbasedagentsystemsforclinicaldecisiontasks,53.24487865600877,landmark,True | ||
| 125 | −4412203333,10.1145/3748302,2404.13501,A Survey on the Memory Mechanism of Large Language Model-based Agents,ACM Transactions on Information Systems,2025,article,ai_agents,4,139.0,139.0,47.35025436563928,139,56.1767,True,True,post,70.3699808276485,landmark,True | 125 | +7118190454,10.1109/ojcs.2026.3650842,2507.14912,Redefining Elderly Care With Agentic AI: Challenges and Opportunities,IEEE Open Journal of the Computer Society,2026,article,ai_agents,4,21.0,21.0,22.217391304347824,21,315.9642,True,True,post,redefiningelderlycarewithagenticaichallengesandopportunities,53.24487865600877,landmark,True | ||
| 126 | −4399982941,10.5821/dissertation-2117-410409,,Value engineering for autonomous agents,,2024,dissertation,ai_agents,2,7.0,8.0,68.17851239669422,1,,True,True,post,68.17851239669422,landmark,True | 126 | +2306711933,10.26190/unsworks/21510,,Discovering hierarchy in reinforcement learning,"UNSWorks (University of New South Wales, Sydney, Australia)",2022,dissertation,ai_agents,4,7.0,7.0,52.423245614035096,14,,True,True,baseline,discoveringhierarchyinreinforcementlearning,52.423245614035096,landmark,True | ||
| 127 | −2911283634,10.1515/9783110595567-011,,10. Reinforcement learning,De Gruyter eBooks,2020,book-chapter,reinforcement_learning,2,524.0,532.0,276.02730780647073,1930,32.1901,False,False,baseline,276.02730780647073,landmark,True | 127 | +4389473504,10.23860/diss-li-hepfeng-2023,,TRUST-REGION BASED POLICY OPTIMIZATION FOR EFFICIENT REINFORCEMENT LEARNING,,2023,dissertation,reinforcement_learning,5,16.0,28.0,232.91170431211498,32,,True,True,post,trustregionbasedpolicyoptimizationforefficientreinforcementlearning,232.91170431211498,landmark,True | ||
| 128 | −4389473504,10.23860/diss-li-hepfeng-2023,,TRUST-REGION BASED POLICY OPTIMIZATION FOR EFFICIENT REINFORCEMENT LEARNING,,2023,dissertation,reinforcement_learning,5,16.0,28.0,232.91170431211498,32,,True,True,post,232.91170431211498,landmark,True | 128 | +2098774185,10.1184/r1/6555512,,Maximum Entropy Inverse Reinforcement Learning,,2018,article,reinforcement_learning,3,780.0,1077.0,203.27785769359127,1869,147.1091,True,True,baseline,maximumentropyinversereinforcementlearning,203.27785769359127,landmark,True | ||
| 129 | −2964083594,10.57702/mspz8fly,1808.04355,Large-Scale Study of Curiosity-Driven Learning,Edinburgh Research Explorer (University of Edinburgh),2025,conference-paper,reinforcement_learning,7,414.0,414.0,367.9480320163706,75,0.0,True,True,baseline,209.59116591832003,landmark,True | 129 | +2964083594,10.57702/mspz8fly,1808.04355,Large-Scale Study of Curiosity-Driven Learning,Edinburgh Research Explorer (University of Edinburgh),2025,conference-paper,reinforcement_learning,7,414.0,414.0,367.9480320163706,75,0.0,True,True,baseline,largescalestudyofcuriositydrivenlearning,180.9062290107294,landmark,True | ||
| 130 | −2098774185,10.1184/r1/6555512,,Maximum Entropy Inverse Reinforcement Learning,,2018,article,reinforcement_learning,3,780.0,1077.0,203.27785769359127,1869,147.1091,True,True,baseline,203.27785769359127,landmark,True | 130 | +2991046523,10.1007/978-3-030-60990-0_12,1911.10635,Multi-Agent Reinforcement Learning: A Selective Overview of Theories and Algorithms,"Studies in systems, decision and control",2021,book-chapter,reinforcement_learning,3,348.0,530.0,178.44967189838442,1264,321.3096,False,True,baseline,multiagentreinforcementlearningaselectiveoverviewoftheoriesandalgorithms,178.44967189838442,landmark,True | ||
| 131 | −1591675293,10.1017/9781009449441.027,,Bayesian Inverse Reinforcement Learning,Cambridge University Press eBooks,2025,book-chapter,reinforcement_learning,3,395.0,395.0,664.9588792863116,444,16.8612,True,False,post,199.9722476756918,landmark,True | 131 | +1591675293,10.1017/9781009449441.027,,Bayesian Inverse Reinforcement Learning,Cambridge University Press eBooks,2025,book-chapter,reinforcement_learning,3,395.0,395.0,664.9588792863116,444,16.8612,True,False,post,bayesianinversereinforcementlearning,172.60376922521283,landmark,True | ||
| 132 | −7123365826,10.1109/tce.2026.3652706,,Event-Triggered Zero-Sum Game for Input Saturated Nonlinear Systems With State Constraints,IEEE Transactions on Consumer Electronics,2026,article,reinforcement_learning,3,55.0,55.0,155.29848001961267,55,196.0131,True,False,post,195.53713186282252,landmark,True | 132 | +2973229164,10.32657/10356/90191,,Continuous control for robot based on deep reinforcement learning,,2019,dissertation,reinforcement_learning,2,5.0,47.0,171.15412186379928,951,,True,True,baseline,continuouscontrolforrobotbasedondeepreinforcementlearning,171.15412186379928,landmark,True | ||
| 133 | −2991046523,10.1007/978-3-030-60990-0_12,1911.10635,Multi-Agent Reinforcement Learning: A Selective Overview of Theories and Algorithms,"Studies in systems, decision and control",2021,book-chapter,reinforcement_learning,3,348.0,530.0,178.44967189838442,1264,321.3096,False,True,baseline,178.44967189838442,landmark,True | 133 | +2982316857,10.1038/s41586-019-1724-z,,Grandmaster level in StarCraft II using multi-agent reinforcement learning,Nature,2019,article,reinforcement_learning,2,403.0,1021.0,155.2486170001325,3422,181.8864,False,False,baseline,grandmasterlevelinstarcraftiiusingmultiagentreinforcementlearning,155.2486170001325,landmark,True | ||
| 134 | −2973229164,10.32657/10356/90191,,Continuous control for robot based on deep reinforcement learning,,2019,dissertation,reinforcement_learning,2,5.0,47.0,171.15412186379928,951,,True,True,baseline,171.15412186379928,landmark,True | 134 | +7123365826,10.1109/tce.2026.3652706,,Event-Triggered Zero-Sum Game for Input Saturated Nonlinear Systems With State Constraints,IEEE Transactions on Consumer Electronics,2026,article,reinforcement_learning,3,55.0,55.0,155.29848001961267,55,196.0131,True,False,post,eventtriggeredzerosumgameforinputsaturatednonlinearsystemswithstateconstraints,139.45087267049917,landmark,True | ||
| 135 | −2982316857,10.1038/s41586-019-1724-z,,Grandmaster level in StarCraft II using multi-agent reinforcement learning,Nature,2019,article,reinforcement_learning,2,403.0,1021.0,155.2486170001325,3422,181.8864,False,False,baseline,155.2486170001325,landmark,True | 135 | +2902907165,10.1126/science.aar6404,,"A general reinforcement learning algorithm that masters chess, shogi, and Go through self-play",Science,2018,article,reinforcement_learning,3,271.0,733.0,138.34973973017864,3551,180.9159,True,True,baseline,ageneralreinforcementlearningalgorithmthatmasterschessshogiandgothroughselfplay,138.34973973017864,landmark,True | ||
| 136 | −2902907165,10.1126/science.aar6404,,"A general reinforcement learning algorithm that masters chess, shogi, and Go through self-play",Science,2018,article,reinforcement_learning,3,271.0,733.0,138.34973973017864,3551,180.9159,True,True,baseline,138.34973973017864,landmark,True | 136 | +7133226216,10.52202/068431-1787,2103.01955,The Surprising Effectiveness of PPO in Cooperative Multi-Agent Games,neural information processing systems,2022,conference-paper,reinforcement_learning,5,259.0,482.0,95.76250774959783,1027,87.4682,True,True,baseline,thesurprisingeffectivenessofppoincooperativemultiagentgames,95.76250774959783,landmark,True | ||
| 137 | −7133481537,10.1016/j.neucom.2026.133224,,Filter-based predefined-time optimal fault-tolerant consensus control for nonlinear multi-agent systems via reinforcement learning,Neurocomputing,2026,article,reinforcement_learning,3,35.0,35.0,122.87423247935634,35,146.6674,False,False,post,124.4327202763416,landmark,True | 137 | +3041807988,10.1007/s42438-020-00164-x,,Post-Covid-19 Education and Education Technology ‘Solutionism’: a Seller’s Market,Postdigital Science and Education,2020,article,reinforcement_learning,1,148.0,322.0,93.76380474425054,594,104.1384,True,True,baseline,postcovid19educationandeducationtechnologysolutionismasellersmarket,93.76380474425054,landmark,True | ||
| 138 | −7133226216,10.52202/068431-1787,2103.01955,The Surprising Effectiveness of PPO in Cooperative Multi-Agent Games,neural information processing systems,2022,conference-paper,reinforcement_learning,5,259.0,482.0,95.76250774959783,1027,87.4682,True,True,baseline,95.76250774959783,landmark,True | 138 | +2781726626,10.48550/arxiv.1801.01290,1801.01290,Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actor,arXiv (Cornell University),2018,preprint,reinforcement_learning,4,254.0,775.0,90.80433444998975,3598,,True,True,baseline,softactorcriticoffpolicymaximumentropydeepreinforcementlearningwithastochasticactor,90.80433444998975,landmark,True | ||
| 139 | −3041807988,10.1007/s42438-020-00164-x,,Post-Covid-19 Education and Education Technology ‘Solutionism’: a Seller’s Market,Postdigital Science and Education,2020,article,reinforcement_learning,1,148.0,322.0,93.76380474425054,594,104.1384,True,True,baseline,93.76380474425054,landmark,True | 139 | +2963923407,,1802.09477,Addressing Function Approximation Error in Actor-Critic Methods,UvA-DARE (University of Amsterdam),2018,article,reinforcement_learning,4,131.0,472.0,89.08741767072895,362,45.5472,True,True,baseline,addressingfunctionapproximationerrorinactorcriticmethods,89.08741767072895,landmark,True | ||
| 140 | −2781726626,10.48550/arxiv.1801.01290,1801.01290,Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actor,arXiv (Cornell University),2018,preprint,reinforcement_learning,4,254.0,775.0,90.80433444998975,3598,,True,True,baseline,90.80433444998975,landmark,True | 140 | +7133481537,10.1016/j.neucom.2026.133224,,Filter-based predefined-time optimal fault-tolerant consensus control for nonlinear multi-agent systems via reinforcement learning,Neurocomputing,2026,article,reinforcement_learning,3,35.0,35.0,122.87423247935634,35,146.6674,False,False,post,filterbasedpredefinedtimeoptimalfaulttolerantconsensuscontrolfornonlinearmultiagentsystemsviareinforcementlearning,88.74146442668129,landmark,True | ||
| 141 | −2963923407,,1802.09477,Addressing Function Approximation Error in Actor-Critic Methods,UvA-DARE (University of Amsterdam),2018,article,reinforcement_learning,4,131.0,472.0,89.08741767072895,362,45.5472,True,True,baseline,89.08741767072895,landmark,True | 141 | +2899138465,,,Learning to Learn with Gradients,ProQuest Demo Repository,2018,dissertation,reinforcement_learning,3,8.0,20.0,88.61723446893788,51,,True,False,baseline,learningtolearnwithgradients,88.61723446893788,landmark,True | ||
| 142 | −7122543576,10.1002/rnc.70380,,SMS‐Based Event‐Triggered Fault Tolerant Control of Nonlinear Systems Using Adaptive Dynamic Programming,International Journal of Robust and Nonlinear Control,2026,article,reinforcement_learning,6,25.0,25.0,70.59021819073303,25,89.0969,True,False,post,88.88051448310114,landmark,True | 142 | +4391631327,10.48550/arxiv.2402.03300,2402.03300,Axiom-World: A Pre-Registered Study of Two-Stage Post-Training for Rule-Grounded Planning in a Verifiable Toy World,arXiv (Cornell University),2024,preprint,reinforcement_learning,9,52.0,99.0,86.3639344262295,99,,True,True,post,axiomworldapreregisteredstudyoftwostageposttrainingforrulegroundedplanninginaverifiabletoyworld,86.3639344262295,landmark,True | ||
| 143 | −2899138465,,,Learning to Learn with Gradients,ProQuest Demo Repository,2018,dissertation,reinforcement_learning,3,8.0,20.0,88.61723446893788,51,,True,False,baseline,88.61723446893788,landmark,True | 143 | +2895974005,,,Exploration and Exploitation in Reinforcement Learning,KTH Publication Database DiVA (KTH Royal Institute of Technology),2018,dissertation,reinforcement_learning,3,14.0,18.0,79.75551102204409,45,,True,True,baseline,explorationandexploitationinreinforcementlearning,79.75551102204409,landmark,True | ||
| 144 | −4391631327,10.48550/arxiv.2402.03300,2402.03300,Axiom-World: A Pre-Registered Study of Two-Stage Post-Training for Rule-Grounded Planning in a Verifiable Toy World,arXiv (Cornell University),2024,preprint,reinforcement_learning,9,52.0,99.0,86.3639344262295,99,,True,True,post,86.3639344262295,landmark,True | 144 | +4409147637,10.1038/s41586-025-08744-2,,Mastering diverse control tasks through world models,Nature,2025,article,reinforcement_learning,2,170.0,170.0,57.91038303711279,170,70.7411,True,True,post,masteringdiversecontroltasksthroughworldmodels,74.28516650199033,landmark,True | ||
| 145 | −4409147637,10.1038/s41586-025-08744-2,,Mastering diverse control tasks through world models,Nature,2025,article,reinforcement_learning,2,170.0,170.0,57.91038303711279,170,70.7411,True,True,post,86.06400532877875,landmark,True | 145 | +2754517384,10.1609/aaai.v32i1.11694,1709.06560,Deep Reinforcement Learning That Matters,Proceedings of the AAAI Conference on Artificial Intelligence,2018,conference-paper,reinforcement_learning,3,261.0,452.0,69.98997654610542,1579,68.6606,True,True,baseline,deepreinforcementlearningthatmatters,69.98997654610542,landmark,True | ||
| 146 | −2895974005,,,Exploration and Exploitation in Reinforcement Learning,KTH Publication Database DiVA (KTH Royal Institute of Technology),2018,dissertation,reinforcement_learning,3,14.0,18.0,79.75551102204409,45,,True,True,baseline,79.75551102204409,landmark,True | 146 | +2761873684,10.1609/aaai.v32i1.11796,,Rainbow: Combining Improvements in Deep Reinforcement Learning,Proceedings of the AAAI Conference on Artificial Intelligence,2018,conference-paper,reinforcement_learning,1,240.0,442.0,68.44152573756327,1772,72.3017,True,True,baseline,rainbowcombiningimprovementsindeepreinforcementlearning,68.44152573756327,landmark,True | ||
| 147 | −7134057781,10.1038/s41598-026-42615-8,,A fuzzy-TD3 hybrid reinforcement learning framework for robust trajectory tracking of the Mitsubishi RV-2AJ robotic arm,Scientific Reports,2026,article,reinforcement_learning,3,21.0,21.0,23.368832169628472,21,75.865,True,True,post,74.65963216580496,landmark,True | 147 | +7133208539,10.52202/075280-2338,,Direct Preference Optimization: Your Language Model is Secretly a Reward Model,neural information processing systems,2023,conference-paper,reinforcement_learning,3,111.0,293.0,67.57117047961324,474,89.6019,False,False,post,directpreferenceoptimizationyourlanguagemodelissecretlyarewardmodel,67.57117047961324,landmark,True | ||
| 148 | −2754517384,10.1609/aaai.v32i1.11694,1709.06560,Deep Reinforcement Learning That Matters,Proceedings of the AAAI Conference on Artificial Intelligence,2018,conference-paper,reinforcement_learning,3,261.0,452.0,69.98997654610542,1579,68.6606,True,True,baseline,69.98997654610542,landmark,True | 148 | +4327734444,10.5204/thesis.eprints.238632,,Leveraging control priors in deep reinforcement learning for robotics,Queensland University of Technology,2023,dissertation,reinforcement_learning,2,5.0,8.0,66.54620123203286,9,,True,True,post,leveragingcontrolpriorsindeepreinforcementlearningforrobotics,66.54620123203286,landmark,True | ||
| 149 | −2761873684,10.1609/aaai.v32i1.11796,,Rainbow: Combining Improvements in Deep Reinforcement Learning,Proceedings of the AAAI Conference on Artificial Intelligence,2018,conference-paper,reinforcement_learning,1,240.0,442.0,68.44152573756327,1772,72.3017,True,True,baseline,68.44152573756327,landmark,True | 149 | +4383112908,10.1109/tpami.2023.3292075,2009.07888,Transfer Learning in Deep Reinforcement Learning: A Survey,IEEE Transactions on Pattern Analysis and Machine Intelligence,2023,article,reinforcement_learning,6,398.0,716.0,65.732229267823,846,67.6448,True,True,post,transferlearningindeepreinforcementlearningasurvey,65.732229267823,landmark,True | ||
| 150 | −7133208539,10.52202/075280-2338,,Direct Preference Optimization: Your Language Model is Secretly a Reward Model,neural information processing systems,2023,conference-paper,reinforcement_learning,3,111.0,293.0,67.57117047961324,474,89.6019,False,False,post,67.57117047961324,landmark,True | 150 | +7122543576,10.1002/rnc.70380,,SMS‐Based Event‐Triggered Fault Tolerant Control of Nonlinear Systems Using Adaptive Dynamic Programming,International Journal of Robust and Nonlinear Control,2026,article,reinforcement_learning,6,25.0,25.0,70.59021819073303,25,89.0969,True,False,post,smsbasedeventtriggeredfaulttolerantcontrolofnonlinearsystemsusingadaptivedynamicprogramming,63.38676030477235,landmark,True | ||
| 151 | −7128436456,10.1016/j.arcontrol.2026.101045,2502.02133,Synthesis of model predictive control and reinforcement learning: Survey and classification,Annual Reviews in Control,2026,article,reinforcement_learning,3,19.0,19.0,21.046639004149377,19,47.2579,True,True,post,67.54919100715686,landmark,True | 151 | +2742132707,10.26153/tsw/13849,,Curriculum learning in reinforcement learning,Texas Digital Library (University of Texas),2021,dissertation,reinforcement_learning,4,13.0,13.0,59.128571428571426,13,,True,True,baseline,curriculumlearninginreinforcementlearning,59.128571428571426,landmark,True | ||
| 152 | −2962862931,10.4230/oasics.dx.2024.27,,On a Method to Measure Supervised Multiclass Model’s Interpretability: Application to Degradation Diagnosis (Short Paper),HAL (Le Centre pour la Communication Scientifique Directe),2024,conference-paper,ml_theory,1,11888.0,12586.0,3498.428847235165,12586,1941.7911,True,True,post,3498.428847235165,landmark,True | 152 | +2962862931,10.4230/oasics.dx.2024.27,,On a Method to Measure Supervised Multiclass Model’s Interpretability: Application to Degradation Diagnosis (Short Paper),HAL (Le Centre pour la Communication Scientifique Directe),2024,conference-paper,ml_theory,1,11888.0,12586.0,3498.428847235165,12586,1941.7911,True,True,post,onamethodtomeasuresupervisedmulticlassmodelsinterpretabilityapplicationtodegradationdiagnosisshortpaper,3498.428847235165,landmark,True | ||
| 153 | −1698155719,10.1017/9781108564175.026,,Support Vector Machines,Cambridge University Press eBooks,2020,book-chapter,ml_theory,2,1184.0,1212.0,971.6935447844538,1401,239.6315,True,False,baseline,971.6935447844538,landmark,True | 153 | +46659105,10.4230/lipics.esem.2026.21,2010.16061,"Evaluation: from precision, recall and F-measure to ROC, informedness, markedness and correlation",arXiv (Cornell University),2020,preprint,ml_theory,4,3748.0,3906.0,608.1723816912336,4311,,True,True,baseline,evaluationfromprecisionrecallandfmeasuretorocinformednessmarkednessandcorrelation,608.1723816912336,landmark,True | ||
| 154 | −4288283362,10.5281/zenodo.20632938,,Spiral Time: A Geometric Reframing of Temporal Structure and Its Applications in Machine Learning,,2026,article,ml_theory,3,174.0,174.0,576.9349593495934,174,17.3333,True,True,post,618.608380802384,landmark,True | 154 | +4288283362,10.5281/zenodo.20632938,,Spiral Time: A Geometric Reframing of Temporal Structure and Its Applications in Machine Learning,,2026,article,ml_theory,3,174.0,174.0,576.9349593495934,174,17.3333,True,True,post,spiraltimeageometricreframingoftemporalstructureanditsapplicationsinmachinelearning,441.17185172121555,landmark,True | ||
| 155 | −46659105,10.4230/lipics.esem.2026.21,2010.16061,"Evaluation: from precision, recall and F-measure to ROC, informedness, markedness and correlation",arXiv (Cornell University),2020,preprint,ml_theory,4,3748.0,3906.0,608.1723816912336,4311,,True,True,baseline,608.1723816912336,landmark,True | 155 | +1568555062,10.1145/3501714.3501732,,Equivalence and Synthesis of Causal Models,ACM eBooks,2022,book-chapter,ml_theory,1,557.0,576.0,308.68124677113826,964,48.0029,True,False,baseline,equivalenceandsynthesisofcausalmodels,308.68124677113826,landmark,True | ||
| 156 | −3145506661,10.1007/978-3-030-10546-4_1,,Introduction to Machine Learning,Springer briefs in electrical and computer engineering,2019,book-chapter,ml_theory,2,1164.0,1581.0,491.7969737509803,1594,403.288,False,False,baseline,491.7969737509803,landmark,True | 156 | +2100415632,10.48550/arxiv.2604.24555,2604.24555,Efficient learning by implicit exploration in bandit problems with side observations,arXiv (Cornell University),2026,preprint,ml_theory,3,116.0,116.0,667.5471698113207,116,,True,True,post,efficientlearningbyimplicitexplorationinbanditproblemswithsideobservations,294.1145678141437,landmark,True | ||
| 157 | −2291445757,10.1017/9781009006767.012,,Support Vector Regression,Cambridge University Press eBooks,2024,book-chapter,ml_theory,2,769.0,769.0,426.8477591694058,809,0.6804,True,False,post,426.8477591694058,landmark,True | 157 | +3208688400,10.1007/978-981-16-2102-4_36,,Anomaly Detection: A Survey,Lecture notes in networks and systems,2021,book-chapter,ml_theory,1,734.0,833.0,280.4690126251966,958,168.1579,False,False,baseline,anomalydetectionasurvey,280.4690126251966,landmark,True | ||
| 158 | −2100415632,10.48550/arxiv.2604.24555,2604.24555,Efficient learning by implicit exploration in bandit problems with side observations,arXiv (Cornell University),2026,preprint,ml_theory,3,116.0,116.0,667.5471698113207,116,,True,True,post,412.4055872015893,landmark,True | 158 | +3105488314,,,Risk bounds for statistical learning,FreiDok plus (Universitätsbibliothek Freiburg),2020,dissertation,ml_theory,1,50.0,59.0,272.44754218635364,96,,False,False,baseline,riskboundsforstatisticallearning,272.44754218635364,landmark,True | ||
| 159 | −1568555062,10.1145/3501714.3501732,,Equivalence and Synthesis of Causal Models,ACM eBooks,2022,book-chapter,ml_theory,1,557.0,576.0,308.68124677113826,964,48.0029,True,False,baseline,308.68124677113826,landmark,True | 159 | +2945976633,10.1038/s42256-019-0048-x,1811.10154,Stop explaining black box machine learning models for high stakes decisions and use interpretable models instead,Nature Machine Intelligence,2019,article,ml_theory,2,620.0,1556.0,236.59828408639194,10272,292.6299,False,True,baseline,stopexplainingblackboxmachinelearningmodelsforhighstakesdecisionsanduseinterpretablemodelsinstead,236.59828408639194,landmark,True | ||
| 160 | −2751318774,10.1142/9789811201967_0001,,Introduction to Machine Learning,Series in machine perception and artificial intelligence,2019,book-chapter,ml_theory,6,932.0,978.0,304.22355491996126,1639,51.9116,True,False,baseline,304.22355491996126,landmark,True | 160 | +4400823820,10.58496/bjml/2024/007,,Random Forest Algorithm Overview,Babylonian Journal of Machine Learning,2024,article,ml_theory,1,353.0,782.0,235.4406851738956,782,299.2578,True,True,post,randomforestalgorithmoverview,235.4406851738956,landmark,True | ||
| 161 | −3208688400,10.1007/978-981-16-2102-4_36,,Anomaly Detection: A Survey,Lecture notes in networks and systems,2021,book-chapter,ml_theory,1,734.0,833.0,280.4690126251966,958,168.1579,False,False,baseline,280.4690126251966,landmark,True | 161 | +2999309192,10.1186/s12864-019-6413-7,,The advantages of the Matthews correlation coefficient (MCC) over F1 score and accuracy in binary classification evaluation,BMC Genomics,2020,article,ml_theory,2,897.0,1781.0,222.7600450619602,6051,266.8933,True,True,baseline,theadvantagesofthematthewscorrelationcoefficientmccoverf1scoreandaccuracyinbinaryclassificationevaluation,222.7600450619602,landmark,True | ||
| 162 | −3105488314,,,Risk bounds for statistical learning,FreiDok plus (Universitätsbibliothek Freiburg),2020,dissertation,ml_theory,1,50.0,59.0,272.44754218635364,96,,False,False,baseline,272.44754218635364,landmark,True | 162 | +2999615587,10.1038/s42256-019-0138-9,,From local explanations to global understanding with explainable AI for trees,Nature Machine Intelligence,2020,article,ml_theory,1,808.0,1767.0,221.00898350616714,10196,280.6263,False,True,baseline,fromlocalexplanationstoglobalunderstandingwithexplainableaifortrees,221.00898350616714,landmark,True | ||
| 163 | −57706852,10.48550/arxiv.2604.24537,2604.24537,Stochastic simultaneous optimistic optimization,arXiv (Cornell University),2026,preprint,ml_theory,1,72.0,72.0,414.33962264150944,72,,True,True,post,255.97588171133128,landmark,True | 163 | +2439568532,10.1145/3233231,,The Mythos of Model Interpretability,Communications of the ACM,2018,article,ml_theory,2,592.0,1085.0,204.78781392529854,5034,234.6672,True,True,baseline,themythosofmodelinterpretability,204.78781392529854,landmark,True | ||
| 164 | −2946444988,10.48550/arxiv.2606.04665,2606.04665,Towards Accurate Model Selection in Deep Unsupervised Domain Adaptation,arXiv (Cornell University),2026,preprint,ml_theory,4,68.0,68.0,2646.035087719298,68,,True,True,post,241.7549993940351,landmark,True | 164 | +3194464139,,,Penerapan Algoritma K-Nearest Neighbor untuk Penentuan Resiko Kredit Kepemilikan Kendaraan Bermotor,,2020,dissertation,ml_theory,1,15.0,21.0,197.50232018561485,25,,True,False,baseline,penerapanalgoritmaknearestneighboruntukpenentuanresikokreditkepemilikankendaraanbermotor,197.50232018561485,landmark,True | ||
| 165 | −2945976633,10.1038/s42256-019-0048-x,1811.10154,Stop explaining black box machine learning models for high stakes decisions and use interpretable models instead,Nature Machine Intelligence,2019,article,ml_theory,2,620.0,1556.0,236.59828408639194,10272,292.6299,False,True,baseline,236.59828408639194,landmark,True | 165 | +3041133507,10.1109/jproc.2020.3004555,1911.02685,A Comprehensive Survey on Transfer Learning,Proceedings of the IEEE,2020,article,ml_theory,4,593.0,1538.0,192.3666194864092,6556,273.5231,True,True,baseline,acomprehensivesurveyontransferlearning,192.3666194864092,landmark,True | ||
| 166 | −4400823820,10.58496/bjml/2024/007,,Random Forest Algorithm Overview,Babylonian Journal of Machine Learning,2024,article,ml_theory,1,353.0,782.0,235.4406851738956,782,299.2578,True,True,post,235.4406851738956,landmark,True | 166 | +57706852,10.48550/arxiv.2604.24537,2604.24537,Stochastic simultaneous optimistic optimization,arXiv (Cornell University),2026,preprint,ml_theory,1,72.0,72.0,414.33962264150944,72,,True,True,post,stochasticsimultaneousoptimisticoptimization,182.55386967774436,landmark,True | ||
| 167 | −2999309192,10.1186/s12864-019-6413-7,,The advantages of the Matthews correlation coefficient (MCC) over F1 score and accuracy in binary classification evaluation,BMC Genomics,2020,article,ml_theory,2,897.0,1781.0,222.7600450619602,6051,266.8933,True,True,baseline,222.7600450619602,landmark,True | 167 | +2436219157,10.1137/16m1080173,1606.04838,Optimization Methods for Large-Scale Machine Learning,SIAM Review,2018,article,ml_theory,4,492.0,956.0,180.43976968901882,3128,199.3045,True,True,baseline,optimizationmethodsforlargescalemachinelearning,180.43976968901882,landmark,True | ||
| 168 | −2999615587,10.1038/s42256-019-0138-9,,From local explanations to global understanding with explainable AI for trees,Nature Machine Intelligence,2020,article,ml_theory,1,808.0,1767.0,221.00898350616714,10196,280.6263,False,True,baseline,221.00898350616714,landmark,True | 168 | +3135028703,10.1007/s42979-021-00592-x,,"Machine Learning: Algorithms, Real-World Applications and Research Directions",SN Computer Science,2021,article,ml_theory,1,512.0,1518.0,176.91139356202336,5534,266.7657,False,True,baseline,machinelearningalgorithmsrealworldapplicationsandresearchdirections,176.91139356202336,landmark,True | ||
| 169 | −2439568532,10.1145/3233231,,The Mythos of Model Interpretability,Communications of the ACM,2018,article,ml_theory,2,592.0,1085.0,204.78781392529854,5034,234.6672,True,True,baseline,204.78781392529854,landmark,True | 169 | +2946444988,10.48550/arxiv.2606.04665,2606.04665,Towards Accurate Model Selection in Deep Unsupervised Domain Adaptation,arXiv (Cornell University),2026,preprint,ml_theory,4,68.0,68.0,2646.035087719298,68,,True,True,post,towardsaccuratemodelselectionindeepunsuperviseddomainadaptation,172.4119880289808,landmark,True | ||
| 170 | −3194464139,,,Penerapan Algoritma K-Nearest Neighbor untuk Penentuan Resiko Kredit Kepemilikan Kendaraan Bermotor,,2020,dissertation,ml_theory,1,15.0,21.0,197.50232018561485,25,,True,False,baseline,197.50232018561485,landmark,True | 170 | +3141797743,10.1109/tkde.2021.3070203,1707.08114,A Survey on Multi-Task Learning,IEEE Transactions on Knowledge and Data Engineering,2021,article,ml_theory,6,882.0,1299.0,151.38860358173145,2878,131.001,True,True,baseline,asurveyonmultitasklearning,151.38860358173145,landmark,True | ||
| 171 | −3041133507,10.1109/jproc.2020.3004555,1911.02685,A Comprehensive Survey on Transfer Learning,Proceedings of the IEEE,2020,article,ml_theory,4,593.0,1538.0,192.3666194864092,6556,273.5231,True,True,baseline,192.3666194864092,landmark,True | 171 | +3123554940,10.1007/978-3-030-57077-4_11,,Pattern Recognition and Machine Learning,EAI/Springer Innovations in Communication and Computing,2021,book-chapter,ml_theory,1,147.0,182.0,140.86542176432712,255,92.5445,False,False,baseline,patternrecognitionandmachinelearning,140.86542176432712,landmark,True | ||
| 172 | −2436219157,10.1137/16m1080173,1606.04838,Optimization Methods for Large-Scale Machine Learning,SIAM Review,2018,article,ml_theory,4,492.0,956.0,180.43976968901882,3128,199.3045,True,True,baseline,180.43976968901882,landmark,True | 172 | +2889326414,10.21105/joss.00861,,UMAP: Uniform Manifold Approximation and Projection,The Journal of Open Source Software,2018,article,ml_theory,2,211.0,797.0,139.93100250694124,9681,230.917,True,True,baseline,umapuniformmanifoldapproximationandprojection,139.93100250694124,landmark,True | ||
| 173 | −3135028703,10.1007/s42979-021-00592-x,,"Machine Learning: Algorithms, Real-World Applications and Research Directions",SN Computer Science,2021,article,ml_theory,1,512.0,1518.0,176.91139356202336,5534,266.7657,False,True,baseline,176.91139356202336,landmark,True | 173 | +3021654819,10.1109/msp.2020.2975749,1908.07873,"Federated Learning: Challenges, Methods, and Future Directions",IEEE Signal Processing Magazine,2020,article,ml_theory,7,429.0,1091.0,136.45772552644502,5140,195.766,True,True,baseline,federatedlearningchallengesmethodsandfuturedirections,136.45772552644502,landmark,True | ||
| 174 | −7124426637,10.1186/s40537-025-01346-9,,A review of machine learning with small and limited data,Journal Of Big Data,2026,article,ml_theory,3,46.0,46.0,51.18887046680522,46,166.1805,True,True,post,163.5401466489061,landmark,True | 174 | +2995022099,10.1561/2200000083,1912.04977,Advances and Open Problems in Federated Learning,Foundations and Trends® in Machine Learning,2020,article,ml_theory,6,570.0,1087.0,135.95742222478987,6330,186.8632,True,True,baseline,advancesandopenproblemsinfederatedlearning,135.95742222478987,landmark,True | ||
| 175 | −2165856466,10.48550/arxiv.2604.18420,2604.18420,Spectral bandits for smooth graph functions,arXiv (Cornell University),2026,preprint,ml_theory,2,45.0,45.0,258.9622641509434,45,,True,True,post,159.98492606958206,landmark,True | 175 | +2608595939,10.1007/978-3-030-05318-5_4,,Auto-WEKA: Automatic Model Selection and Hyperparameter Optimization in WEKA,The Springer series on challenges in machine learning,2019,book-chapter,ml_theory,2,300.0,423.0,131.5813535083268,650,138.539,True,True,baseline,autowekaautomaticmodelselectionandhyperparameteroptimizationinweka,131.5813535083268,landmark,True | ||
| 176 | −4402843978,10.58248/pn633,,Interpretable machine learning,,2020,report,ml_theory,2,236.0,455.0,158.34677419354838,952,,True,True,baseline,158.34677419354838,landmark,True | 176 | +3157286395,10.4230/oasics.dx.2026.1,2104.13478,"A Realization-Theoretic Foundation for Fault Diagnosis, with Diagnosability Equivalence Predictions",arXiv (Cornell University),2021,preprint,ml_theory,2,169.0,307.0,128.25943970767358,519,,True,True,baseline,arealizationtheoreticfoundationforfaultdiagnosiswithdiagnosabilityequivalencepredictions,128.25943970767358,landmark,True | ||
| 177 | −2964121744,10.4230/oasics.dx.2026.15,2108.04578,AutoResearch Lite: a reproducible paper-inspired experiment runner (Adam mechanism reproduction and convergence-speed comparison),DROPS (Schloss Dagstuhl – Leibniz Center for Informatics),2026,article,deep_learning_architectures,3,45775.0,45775.0,50938.490122130635,45780,2749.203,True,True,baseline,162740.22201855818,landmark,True | 177 | +2964121744,10.4230/oasics.dx.2026.15,2108.04578,AutoResearch Lite: a reproducible paper-inspired experiment runner (Adam mechanism reproduction and convergence-speed comparison),DROPS (Schloss Dagstuhl – Leibniz Center for Informatics),2026,article,deep_learning_architectures,3,45775.0,45775.0,50938.490122130635,45780,2749.203,True,True,baseline,autoresearchliteareproduciblepaperinspiredexperimentrunneradammechanismreproductionandconvergencespeedcomparison,116061.15811803818,landmark,True | ||
| 178 | −1710476689,10.1017/9781108891530.013,,Generative Adversarial Networks,Cambridge University Press eBooks,2022,book-chapter,deep_learning_architectures,4,2376.0,2385.0,1018.1648538070052,2402,89.9299,True,False,baseline,1018.1648538070052,landmark,True | 178 | +2963399829,10.57702/dcy1c3gw,1710.09412,Mixup: Beyond empirical risk minimization,arXiv (Cornell University),2024,preprint,deep_learning_architectures,6,772.0,773.0,674.336578903792,773,,True,True,baseline,mixupbeyondempiricalriskminimization,674.336578903792,landmark,True | ||
| 179 | −4322614756,10.4230/lipics.giscience.2025.9,,Identifying Resilient Communities in Road Networks: A Path-Based Embedding Approach,Leibniz international proceedings in informatics,2025,conference-paper,deep_learning_architectures,2,1542.0,1542.0,1370.4731047566265,1543,164.3965,True,True,post,780.6511542175108,landmark,True | 179 | +4322614756,10.4230/lipics.giscience.2025.9,,Identifying Resilient Communities in Road Networks: A Path-Based Embedding Approach,Leibniz international proceedings in informatics,2025,conference-paper,deep_learning_architectures,2,1542.0,1542.0,1370.4731047566265,1543,164.3965,True,True,post,identifyingresilientcommunitiesinroadnetworksapathbasedembeddingapproach,673.8101573298181,landmark,True | ||
| 180 | −2963399829,10.57702/dcy1c3gw,1710.09412,Mixup: Beyond empirical risk minimization,arXiv (Cornell University),2024,preprint,deep_learning_architectures,6,772.0,773.0,674.336578903792,773,,True,True,baseline,674.336578903792,landmark,True | 180 | +4382203079,10.1609/aaai.v37i9.26317,2205.13504,Are Transformers Effective for Time Series Forecasting?,Proceedings of the AAAI Conference on Artificial Intelligence,2023,conference-paper,deep_learning_architectures,3,917.0,2278.0,621.0117979458593,3320,733.0685,True,True,baseline,aretransformerseffectivefortimeseriesforecasting,621.0117979458593,landmark,True | ||
| 181 | −4382203079,10.1609/aaai.v37i9.26317,2205.13504,Are Transformers Effective for Time Series Forecasting?,Proceedings of the AAAI Conference on Artificial Intelligence,2023,conference-paper,deep_learning_architectures,3,917.0,2278.0,621.0117979458593,3320,733.0685,True,True,baseline,621.0117979458593,landmark,True | 181 | +146900863,10.7551/mitpress/11474.003.0014,,Neural Information Processing Systems,The MIT Press eBooks,2018,book-chapter,deep_learning_architectures,1,835.0,999.0,463.99318537042825,3730,234.5719,False,False,baseline,neuralinformationprocessingsystems,463.99318537042825,landmark,True | ||
| 182 | −4406170795,10.1038/s41586-024-08328-6,,Accurate predictions on small data with a tabular foundation model,Nature,2025,article,deep_learning_architectures,4,974.0,974.0,331.79242987145795,974,405.3046,True,True,post,493.09612464841473,landmark,True | 182 | +4406170795,10.1038/s41586-024-08328-6,,Accurate predictions on small data with a tabular foundation model,Nature,2025,article,deep_learning_architectures,4,974.0,974.0,331.79242987145795,974,405.3046,True,True,post,accuratepredictionsonsmalldatawithatabularfoundationmodel,425.6103068996387,landmark,True | ||
| 183 | −146900863,10.7551/mitpress/11474.003.0014,,Neural Information Processing Systems,The MIT Press eBooks,2018,book-chapter,deep_learning_architectures,1,835.0,999.0,463.99318537042825,3730,234.5719,False,False,baseline,463.99318537042825,landmark,True | 183 | +3177318507,10.1609/aaai.v35i12.17325,2012.07436,Informer: Beyond Efficient Transformer for Long Sequence Time-Series Forecasting,Proceedings of the AAAI Conference on Artificial Intelligence,2021,conference-paper,deep_learning_architectures,5,412.0,1344.0,315.30176520033626,7301,468.762,True,True,baseline,informerbeyondefficienttransformerforlongsequencetimeseriesforecasting,315.30176520033626,landmark,True | ||
| 184 | −4396821501,10.48550/arxiv.2404.19756,2404.19756,KAN: Kolmogorov-Arnold Networks,arXiv (Cornell University),2024,preprint,deep_learning_architectures,4,448.0,531.0,463.22473919523094,531,,True,True,post,463.22473919523094,landmark,True | 184 | +4389326242,10.48550/arxiv.2312.00752,2312.00752,Mamba: Linear-Time Sequence Modeling with Selective State Spaces,arXiv (Cornell University),2023,preprint,deep_learning_architectures,8,228.0,912.0,303.2150076098295,1059,,True,True,post,mambalineartimesequencemodelingwithselectivestatespaces,303.2150076098295,landmark,True | ||
| 185 | −2950067852,10.5281/zenodo.19983308,,A Recurrent Latent Variable Model for Sequential Data,arXiv (Cornell University),2026,preprint,deep_learning_architectures,3,119.0,119.0,4630.561403508772,119,,True,True,post,423.0712489395614,landmark,True | 185 | +2950067852,10.5281/zenodo.19983308,,A Recurrent Latent Variable Model for Sequential Data,arXiv (Cornell University),2026,preprint,deep_learning_architectures,3,119.0,119.0,4630.561403508772,119,,True,True,post,arecurrentlatentvariablemodelforsequentialdata,301.7209790507164,landmark,True | ||
| 186 | −4221150249,10.1109/tkde.2026.3680353,2202.07082,Graph Neural Networks for Graphs With Heterophily: A Survey,IEEE Transactions on Knowledge and Data Engineering,2026,article,deep_learning_architectures,2,107.0,107.0,119.0697639119165,107,83.0902,True,True,post,380.4086019876729,landmark,True | 186 | +3137147200,10.1201/9781003162810-13,,A Survey of Quantization Methods for Efficient Neural Network Inference,Chapman & Hall/CRC eBooks,2022,book-chapter,deep_learning_architectures,3,421.0,698.0,297.97864484582374,1148,452.6307,True,True,baseline,asurveyofquantizationmethodsforefficientneuralnetworkinference,297.97864484582374,landmark,True | ||
| 187 | −7148890333,10.1016/j.engappai.2026.114691,,Spatial-channel collaborative multi-scale graph interaction deep transfer learning for unsupervised rotating machinery fault diagnosis,Engineering Applications of Artificial Intelligence,2026,article,deep_learning_architectures,1,102.0,102.0,112.98721991701245,102,283.5476,False,False,post,362.63249909105264,landmark,True | 187 | +3140854437,10.1186/s40537-021-00444-8,,"Review of deep learning: concepts, CNN architectures, challenges, applications, future directions",Journal Of Big Data,2021,article,deep_learning_architectures,7,871.0,2452.0,293.13246585010404,7842,405.9988,True,True,baseline,reviewofdeeplearningconceptscnnarchitectureschallengesapplicationsfuturedirections,293.13246585010404,landmark,True | ||
| 188 | −3177318507,10.1609/aaai.v35i12.17325,2012.07436,Informer: Beyond Efficient Transformer for Long Sequence Time-Series Forecasting,Proceedings of the AAAI Conference on Artificial Intelligence,2021,conference-paper,deep_learning_architectures,5,412.0,1344.0,315.30176520033626,7301,468.762,True,True,baseline,315.30176520033626,landmark,True | 188 | +4210257598,,,A Comprehensive Survey on Graph Neural Networks,UTS ePRESS (University of Technology Sydney),2020,article,deep_learning_architectures,6,1768.0,2239.0,280.04477310147604,2955,236.1125,True,True,baseline,acomprehensivesurveyongraphneuralnetworks,280.04477310147604,landmark,True | ||
| 189 | −4389326242,10.48550/arxiv.2312.00752,2312.00752,Mamba: Linear-Time Sequence Modeling with Selective State Spaces,arXiv (Cornell University),2023,preprint,deep_learning_architectures,8,228.0,912.0,303.2150076098295,1059,,True,True,post,303.2150076098295,landmark,True | 189 | +4221150249,10.1109/tkde.2026.3680353,2202.07082,Graph Neural Networks for Graphs With Heterophily: A Survey,IEEE Transactions on Knowledge and Data Engineering,2026,article,deep_learning_architectures,2,107.0,107.0,119.0697639119165,107,83.0902,True,True,post,graphneuralnetworksforgraphswithheterophilyasurvey,271.29533410442565,landmark,True | ||
| 190 | −7118302872,10.1007/s13278-025-01574-0,,A frame work to predict the influencing nodes in social networking platform using graph neural network model,Social Network Analysis and Mining,2026,article,deep_learning_architectures,3,85.0,85.0,87.58695652173913,85,292.0234,True,True,post,302.1937492425439,landmark,True | 190 | +7148890333,10.1016/j.engappai.2026.114691,,Spatial-channel collaborative multi-scale graph interaction deep transfer learning for unsupervised rotating machinery fault diagnosis,Engineering Applications of Artificial Intelligence,2026,article,deep_learning_architectures,1,102.0,102.0,112.98721991701245,102,283.5476,False,False,post,spatialchannelcollaborativemultiscalegraphinteractiondeeptransferlearningforunsupervisedrotatingmachineryfaultdiagnosis,258.6179820434712,landmark,True | ||
| 191 | −3137147200,10.1201/9781003162810-13,,A Survey of Quantization Methods for Efficient Neural Network Inference,Chapman & Hall/CRC eBooks,2022,book-chapter,deep_learning_architectures,3,421.0,698.0,297.97864484582374,1148,452.6307,True,True,baseline,297.97864484582374,landmark,True | 191 | +3152893301,10.1016/j.aiopen.2021.01.001,1812.08434,Graph neural networks: A review of methods and applications,AI Open,2020,article,deep_learning_architectures,5,1157.0,2023.0,253.0283948120974,6773,287.256,True,True,baseline,graphneuralnetworksareviewofmethodsandapplications,253.0283948120974,landmark,True | ||
| 192 | −3140854437,10.1186/s40537-021-00444-8,,"Review of deep learning: concepts, CNN architectures, challenges, applications, future directions",Journal Of Big Data,2021,article,deep_learning_architectures,7,871.0,2452.0,293.13246585010404,7842,405.9988,True,True,baseline,293.13246585010404,landmark,True | 192 | +4385763767,10.24963/ijcai.2023/759,2202.07125,Transformers in Time Series: A Survey,International Joint Conference on Artificial Intelligence,2023,conference-paper,deep_learning_architectures,4,511.0,921.0,251.0763239280669,1196,259.4717,True,True,post,transformersintimeseriesasurvey,251.0763239280669,landmark,True | ||
| 193 | −4210257598,,,A Comprehensive Survey on Graph Neural Networks,UTS ePRESS (University of Technology Sydney),2020,article,deep_learning_architectures,6,1768.0,2239.0,280.04477310147604,2955,236.1125,True,True,baseline,280.04477310147604,landmark,True | 193 | +7110333790,10.4230/lipics.giscience.2025.3,,Enriching Location Representation with Detailed Semantic Information,DROPS (Schloss Dagstuhl – Leibniz Center for Informatics),2025,article,deep_learning_architectures,2,496.0,496.0,168.96205874357614,0,0.0,True,True,post,enrichinglocationrepresentationwithdetailedsemanticinformation,216.73789755874824,landmark,True | ||
| 194 | −2907492528,10.1109/tnnls.2020.2978386,1901.00596,A Comprehensive Survey on Graph Neural Networks,IEEE Transactions on Neural Networks and Learning Systems,2020,article,deep_learning_architectures,7,934.0,2230.0,278.91909067275196,10106,369.8433,True,True,baseline,278.91909067275196,landmark,True | 194 | +7118302872,10.1007/s13278-025-01574-0,,A frame work to predict the influencing nodes in social networking platform using graph neural network model,Social Network Analysis and Mining,2026,article,deep_learning_architectures,3,85.0,85.0,87.58695652173913,85,292.0234,True,True,post,aframeworktopredicttheinfluencingnodesinsocialnetworkingplatformusinggraphneuralnetworkmodel,215.514985036226,landmark,True | ||
| 195 | −3152893301,10.1016/j.aiopen.2021.01.001,1812.08434,Graph neural networks: A review of methods and applications,AI Open,2020,article,deep_learning_architectures,5,1157.0,2023.0,253.0283948120974,6773,287.256,True,True,baseline,253.0283948120974,landmark,True | 195 | +2892035503,10.1007/s10618-019-00619-1,1809.04356,Deep learning for time series classification: a review,Data Mining and Knowledge Discovery,2019,article,deep_learning_architectures,3,416.0,908.0,192.68934023629362,3299,229.9061,False,True,baseline,deeplearningfortimeseriesclassificationareview,192.68934023629362,landmark,True | ||
| 196 | −7110333790,10.4230/lipics.giscience.2025.3,,Enriching Location Representation with Detailed Semantic Information,DROPS (Schloss Dagstuhl – Leibniz Center for Informatics),2025,article,deep_learning_architectures,2,496.0,496.0,168.96205874357614,0,0.0,True,True,post,251.10439201808387,landmark,True | 196 | +2962776659,10.57702/tcr06vve,,Fine-grained Analysis of Sentence Embeddings Using Auxiliary Prediction Tasks,arXiv (Cornell University),2024,preprint,deep_learning_architectures,4,212.0,212.0,184.94095048849147,212,,True,True,post,finegrainedanalysisofsentenceembeddingsusingauxiliarypredictiontasks,184.94095048849147,landmark,True | ||
| 197 | −4385763767,10.24963/ijcai.2023/759,2202.07125,Transformers in Time Series: A Survey,International Joint Conference on Artificial Intelligence,2023,conference-paper,deep_learning_architectures,4,511.0,921.0,251.0763239280669,1196,259.4717,True,True,post,251.0763239280669,landmark,True | 197 | +2963285578,10.4230/lipics.itcs.2018.22,,Convergence Results for Neural Networks via Electrodynamics,Leibniz international proceedings in informatics,2018,conference-paper,deep_learning_architectures,2,747.0,1153.0,178.53637822491052,2761,153.9662,True,True,baseline,convergenceresultsforneuralnetworksviaelectrodynamics,178.53637822491052,landmark,True | ||
| 198 | −3124006607,10.26190/unsworks/32608,,SIMPLE SPECTRAL GRAPH CONVOLUTION,"UNSWorks (University of New South Wales, Sydney, Australia)",2026,conference-paper,deep_learning_architectures,2,69.0,69.0,529.5790121767684,69,0.0,True,True,post,245.31021997335915,landmark,True | 198 | +3124006607,10.26190/unsworks/32608,,SIMPLE SPECTRAL GRAPH CONVOLUTION,"UNSWorks (University of New South Wales, Sydney, Australia)",2026,conference-paper,deep_learning_architectures,2,69.0,69.0,529.5790121767684,69,0.0,True,True,post,simplespectralgraphconvolution,174.94745844117168,landmark,True | ||
| 199 | −4285723986,10.1007/978-3-031-01587-8_7,,Graph Attention Networks,Synthesis lectures on artificial intelligence and machine learning,2020,book-chapter,deep_learning_architectures,3,247.0,471.0,244.37756010685663,806,284.0555,False,False,baseline,244.37756010685663,landmark,True | 199 | +4398159307,10.2139/ssrn.4835325,2405.12832,Wav-KAN: Wavelet Kolmogorov-Arnold Networks,SSRN Electronic Journal,2024,preprint,deep_learning_architectures,2,142.0,199.0,173.6002318264613,199,,False,True,post,wavkanwaveletkolmogorovarnoldnetworks,173.6002318264613,landmark,True | ||
| 200 | −2892035503,10.1007/s10618-019-00619-1,1809.04356,Deep learning for time series classification: a review,Data Mining and Knowledge Discovery,2019,article,deep_learning_architectures,3,416.0,908.0,192.68934023629362,3299,229.9061,False,True,baseline,192.68934023629362,landmark,True | 200 | +2593744649,10.1016/b978-0-12-815480-9.00015-3,,Evolving Deep Neural Networks,Elsevier eBooks,2018,book-chapter,deep_learning_architectures,2,197.0,361.0,167.66920912785244,760,185.4489,False,False,baseline,evolvingdeepneuralnetworks,167.66920912785244,landmark,True | ||
| 201 | −2962776659,10.57702/tcr06vve,,Fine-grained Analysis of Sentence Embeddings Using Auxiliary Prediction Tasks,arXiv (Cornell University),2024,preprint,deep_learning_architectures,4,212.0,212.0,184.94095048849147,212,,True,True,post,184.94095048849147,landmark,True | 201 | +2885195348,10.1016/j.physd.2019.132306,1808.03314,Fundamentals of Recurrent Neural Network (RNN) and Long Short-Term Memory (LSTM) network,Physica D Nonlinear Phenomena,2020,article,deep_learning_architectures,3,632.0,1318.0,164.84993789537538,5648,212.9085,False,True,baseline,fundamentalsofrecurrentneuralnetworkrnnandlongshorttermmemorylstmnetwork,164.84993789537538,landmark,True | ||
| 202 | −2949117887,10.57702/o9raffed,,Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shift,arXiv (Cornell University),2024,preprint,computer_vision,3,14211.0,14214.0,5890.544305226324,14214,,True,True,post,5890.544305226324,landmark,True | 202 | +2949117887,10.57702/o9raffed,,Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shift,arXiv (Cornell University),2024,preprint,computer_vision,3,14211.0,14214.0,5890.544305226324,14214,,True,True,post,batchnormalizationacceleratingdeepnetworktrainingbyreducinginternalcovariateshift,5890.544305226324,landmark,True | ||
| 203 | −3118608800,10.57702/zp44cu3g,,Learning Multiple Layers of Features from Tiny Images,,2024,article,computer_vision,3,23325.0,23341.0,2765.184913506997,23395,559.7906,True,True,post,2765.184913506997,landmark,True | 203 | +3118608800,10.57702/zp44cu3g,,Learning Multiple Layers of Features from Tiny Images,,2024,article,computer_vision,3,23325.0,23341.0,2765.184913506997,23395,559.7906,True,True,post,learningmultiplelayersoffeaturesfromtinyimages,2765.184913506997,landmark,True | ||
| 204 | −4320013936,10.1007/978-3-658-40442-0_9,,Generative Adversarial Nets,Springer eBooks,2023,book-chapter,computer_vision,3,17934.0,19230.0,2673.891459493373,19272,1769.2415,False,False,post,2673.891459493373,landmark,True | 204 | +4386076325,10.1109/cvpr52729.2023.00721,2207.02696,YOLOv7: Trainable Bag-of-Freebies Sets New State-of-the-Art for Real-Time Object Detectors,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2023,conference-paper,computer_vision,5,6781.0,10586.0,1477.2917574868547,12390,1387.4265,True,True,baseline,yolov7trainablebagoffreebiessetsnewstateoftheartforrealtimeobjectdetectors,1477.2917574868547,landmark,True | ||
| 205 | −4386076325,10.1109/cvpr52729.2023.00721,2207.02696,YOLOv7: Trainable Bag-of-Freebies Sets New State-of-the-Art for Real-Time Object Detectors,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2023,conference-paper,computer_vision,5,6781.0,10586.0,1477.2917574868547,12390,1387.4265,True,True,baseline,1477.2917574868547,landmark,True | 205 | +3119786062,,,An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale,International Conference on Learning Representations,2021,conference-paper,computer_vision,5,4071.0,9465.0,1181.820775699879,449,38.1179,True,False,baseline,animageisworth16x16wordstransformersforimagerecognitionatscale,1181.820775699879,landmark,True | ||
| 206 | −3119786062,,,An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale,International Conference on Learning Representations,2021,conference-paper,computer_vision,5,4071.0,9465.0,1181.820775699879,449,38.1179,True,False,baseline,1181.820775699879,landmark,True | 206 | +3138516171,10.1109/iccv48922.2021.00986,2103.14030,Swin Transformer: Hierarchical Vision Transformer using Shifted Windows,IEEE/CVF International Conference on Computer Vision (ICCV),2021,conference-paper,computer_vision,6,3057.0,9391.0,1172.5809724878566,33262,1556.4216,True,True,baseline,swintransformerhierarchicalvisiontransformerusingshiftedwindows,1172.5809724878566,landmark,True | ||
| 207 | −3138516171,10.1109/iccv48922.2021.00986,2103.14030,Swin Transformer: Hierarchical Vision Transformer using Shifted Windows,IEEE/CVF International Conference on Computer Vision (ICCV),2021,conference-paper,computer_vision,6,3057.0,9391.0,1172.5809724878566,33262,1556.4216,True,True,baseline,1172.5809724878566,landmark,True | 207 | +4402754006,10.1109/cvpr52733.2024.01605,,DETRs Beat YOLOs on Real-time Object Detection,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2024,conference-paper,computer_vision,4,2662.0,4773.0,1001.7389274520061,4548,991.256,True,False,post,detrsbeatyolosonrealtimeobjectdetection,1001.7389274520061,landmark,True | ||
| 208 | −4390874575,10.1109/iccv51070.2023.00371,,Segment Anything,IEEE/CVF International Conference on Computer Vision (ICCV),2023,conference-paper,computer_vision,5,3127.0,7864.0,1097.4326828713986,10910,1240.4061,True,False,post,1097.4326828713986,landmark,True | 208 | +4403770406,10.1007/978-3-031-72751-1_1,2402.13616,YOLOv9: Learning What You Want to Learn Using Programmable Gradient Information,Lecture notes in computer science,2024,conference-paper,computer_vision,3,3072.0,4486.0,941.504468583637,4486,979.4658,False,True,post,yolov9learningwhatyouwanttolearnusingprogrammablegradientinformation,941.504468583637,landmark,True | ||
| 209 | −4402754006,10.1109/cvpr52733.2024.01605,,DETRs Beat YOLOs on Real-time Object Detection,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2024,conference-paper,computer_vision,4,2662.0,4773.0,1001.7389274520061,4548,991.256,True,False,post,1001.7389274520061,landmark,True | 209 | +4312933868,10.1109/cvpr52688.2022.01042,,High-Resolution Image Synthesis with Latent Diffusion Models,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2022,conference-paper,computer_vision,3,1866.0,6719.0,907.833780459159,16051,1184.1165,True,False,baseline,highresolutionimagesynthesiswithlatentdiffusionmodels,907.833780459159,landmark,True | ||
| 210 | −4403770406,10.1007/978-3-031-72751-1_1,2402.13616,YOLOv9: Learning What You Want to Learn Using Programmable Gradient Information,Lecture notes in computer science,2024,conference-paper,computer_vision,3,3072.0,4486.0,941.504468583637,4486,979.4658,False,True,post,941.504468583637,landmark,True | 210 | +4226002507,10.1109/cvpr52688.2022.01553,,Masked Autoencoders Are Scalable Vision Learners,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2022,conference-paper,computer_vision,4,1906.0,4278.0,849.9419256281733,7977,974.4316,True,True,baseline,maskedautoencodersarescalablevisionlearners,849.9419256281733,landmark,True | ||
| 211 | −4312933868,10.1109/cvpr52688.2022.01042,,High-Resolution Image Synthesis with Latent Diffusion Models,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2022,conference-paper,computer_vision,3,1866.0,6719.0,907.833780459159,16051,1184.1165,True,False,baseline,907.833780459159,landmark,True | 211 | +4399300671,10.1002/mp.17191,1912.01703,The effects of back‐projection variants in BPF‐like TOF PET reconstruction using CNN filtration – Based on simulated and clinical brain data,Medical Physics,2024,article,computer_vision,5,14860.0,14915.0,822.2465127032651,0,0.0,True,True,baseline,theeffectsofbackprojectionvariantsinbpfliketofpetreconstructionusingcnnfiltrationbasedonsimulatedandclinicalbraindata,822.2465127032651,landmark,True | ||
| 212 | −2963420686,10.1109/tpami.2019.2913372,,Squeeze-and-Excitation Networks,IEEE Transactions on Pattern Analysis and Machine Intelligence,2019,article,computer_vision,3,2975.0,5976.0,905.785826797903,12104,843.0736,True,False,baseline,905.785826797903,landmark,True | 212 | +7106270182,10.82419/203,,Bridging the Gap between Object and Image-level Representations for Open-Vocabulary Detection,MBZUAI iRep,2022,dissertation,computer_vision,4,24.0,53.0,720.1328671328672,0,,True,True,baseline,bridgingthegapbetweenobjectandimagelevelrepresentationsforopenvocabularydetection,720.1328671328672,landmark,True | ||
| 213 | −4226002507,10.1109/cvpr52688.2022.01553,,Masked Autoencoders Are Scalable Vision Learners,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2022,conference-paper,computer_vision,4,1906.0,4278.0,849.9419256281733,7977,974.4316,True,True,baseline,849.9419256281733,landmark,True | 213 | +4415795831,10.52202/079017-3429,2405.14458,YOLOv10: Real-Time End-to-End Object Detection,neural information processing systems,2024,conference-paper,computer_vision,4,1157.0,2788.0,585.1347432927286,2788,608.7273,True,True,post,yolov10realtimeendtoendobjectdetection,585.1347432927286,landmark,True | ||
| 214 | −4399300671,10.1002/mp.17191,1912.01703,The effects of back‐projection variants in BPF‐like TOF PET reconstruction using CNN filtration – Based on simulated and clinical brain data,Medical Physics,2024,article,computer_vision,5,14860.0,14915.0,822.2465127032651,0,0.0,True,True,baseline,822.2465127032651,landmark,True | 214 | +3035524453,10.1109/cvpr42600.2020.00975,1911.05722,Momentum Contrast for Unsupervised Visual Representation Learning,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2020,conference-paper,computer_vision,4,1903.0,3802.0,538.8557516528527,12652,650.908,True,True,baseline,momentumcontrastforunsupervisedvisualrepresentationlearning,538.8557516528527,landmark,True | ||
| 215 | −7106270182,10.82419/203,,Bridging the Gap between Object and Image-level Representations for Open-Vocabulary Detection,MBZUAI iRep,2022,dissertation,computer_vision,4,24.0,53.0,720.1328671328672,0,,True,True,baseline,720.1328671328672,landmark,True | 215 | +4321232185,10.1007/978-3-031-25066-8_9,2105.05537,Swin-Unet: Unet-Like Pure Transformer for Medical Image Segmentation,Lecture notes in computer science,2023,conference-paper,computer_vision,3,2204.0,3841.0,536.0171585591356,4853,526.4534,False,True,baseline,swinunetunetlikepuretransformerformedicalimagesegmentation,536.0171585591356,landmark,True | ||
| 216 | −4415795831,10.52202/079017-3429,2405.14458,YOLOv10: Real-Time End-to-End Object Detection,neural information processing systems,2024,conference-paper,computer_vision,4,1157.0,2788.0,585.1347432927286,2788,608.7273,True,True,post,585.1347432927286,landmark,True | 216 | +3005680577,10.48550/arxiv.2002.05709,2002.05709,A Simple Framework for Contrastive Learning of Visual Representations,arXiv (Cornell University),2020,preprint,computer_vision,5,1836.0,3360.0,523.1590380139643,6894,,True,True,baseline,asimpleframeworkforcontrastivelearningofvisualrepresentations,523.1590380139643,landmark,True | ||
| 217 | −3035524453,10.1109/cvpr42600.2020.00975,1911.05722,Momentum Contrast for Unsupervised Visual Representation Learning,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2020,conference-paper,computer_vision,4,1903.0,3802.0,538.8557516528527,12652,650.908,True,True,baseline,538.8557516528527,landmark,True | 217 | +3182555022,,,Generative Adversarial Networks for Semantic Image Synthesis and Unconditional Synthesis with Limited Data,bonndoc (University of Bonn),2024,dissertation,computer_vision,3,45.0,47.0,515.6,47,,True,True,post,generativeadversarialnetworksforsemanticimagesynthesisandunconditionalsynthesiswithlimiteddata,515.6,landmark,True | ||
| 218 | −4321232185,10.1007/978-3-031-25066-8_9,2105.05537,Swin-Unet: Unet-Like Pure Transformer for Medical Image Segmentation,Lecture notes in computer science,2023,conference-paper,computer_vision,3,2204.0,3841.0,536.0171585591356,4853,526.4534,False,True,baseline,536.0171585591356,landmark,True | 218 | +3152382703,,,EVOLUTION OF YOLO ALGORITHM AND YOLOV5: THE STATE-OF-THE-ART OBJECT DETECTION ALGORITHM,,2021,dissertation,computer_vision,2,51.0,80.0,513.8375350140057,97,,False,False,baseline,evolutionofyoloalgorithmandyolov5thestateoftheartobjectdetectionalgorithm,513.8375350140057,landmark,True | ||
| 219 | −3005680577,10.48550/arxiv.2002.05709,2002.05709,A Simple Framework for Contrastive Learning of Visual Representations,arXiv (Cornell University),2020,preprint,computer_vision,5,1836.0,3360.0,523.1590380139643,6894,,True,True,baseline,523.1590380139643,landmark,True | 219 | +4312443924,10.1109/cvpr52688.2022.01167,,A ConvNet for the 2020s,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2022,conference-paper,computer_vision,3,1653.0,3671.0,496.0050317109053,8300,604.8545,True,False,baseline,aconvnetforthe2020s,496.0050317109053,landmark,True | ||
| 220 | −3182555022,,,Generative Adversarial Networks for Semantic Image Synthesis and Unconditional Synthesis with Limited Data,bonndoc (University of Bonn),2024,dissertation,computer_vision,3,45.0,47.0,515.6,47,,True,True,post,515.6,landmark,True | 220 | +2335728318,10.57702/e7wwo0zk,,Reading digits in natural images with unsupervised feature learning,,2024,article,computer_vision,1,4147.0,4149.0,491.5278782460276,4149,55.5129,True,True,post,readingdigitsinnaturalimageswithunsupervisedfeaturelearning,491.5278782460276,landmark,True | ||
| 221 | −3152382703,,,EVOLUTION OF YOLO ALGORITHM AND YOLOV5: THE STATE-OF-THE-ART OBJECT DETECTION ALGORITHM,,2021,dissertation,computer_vision,2,51.0,80.0,513.8375350140057,97,,False,False,baseline,513.8375350140057,landmark,True | 221 | +4390873054,10.1109/iccv51070.2023.00355,,Adding Conditional Control to Text-to-Image Diffusion Models,IEEE/CVF International Conference on Computer Vision (ICCV),2023,conference-paper,computer_vision,6,1511.0,3376.0,471.1257295744967,4408,501.2109,True,False,post,addingconditionalcontroltotexttoimagediffusionmodels,471.1257295744967,landmark,True | ||
| 222 | −4312443924,10.1109/cvpr52688.2022.01167,,A ConvNet for the 2020s,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2022,conference-paper,computer_vision,3,1653.0,3671.0,496.0050317109053,8300,604.8545,True,False,baseline,496.0050317109053,landmark,True | 222 | +2963163009,10.1109/cvpr.2018.00474,1801.04381,MobileNetV2: Inverted Residuals and Linear Bottlenecks,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2018,conference-paper,computer_vision,3,1242.0,3514.0,430.50535987748856,27247,513.8505,True,True,baseline,mobilenetv2invertedresidualsandlinearbottlenecks,430.50535987748856,landmark,True | ||
| 223 | −4300424419,10.4230/lipics.giscience.2025.18,,U-Prithvi: Integrating a Foundation Model and U-Net for Enhanced Flood Inundation Mapping,Leibniz international proceedings in informatics,2025,conference-paper,computer_vision,3,977.0,977.0,144.34954954954955,977,1317.4998,True,True,post,494.61490121304024,landmark,True | 223 | +4300424419,10.4230/lipics.giscience.2025.18,,U-Prithvi: Integrating a Foundation Model and U-Net for Enhanced Flood Inundation Mapping,Leibniz international proceedings in informatics,2025,conference-paper,computer_vision,3,977.0,977.0,144.34954954954955,977,1317.4998,True,True,post,uprithviintegratingafoundationmodelandunetforenhancedfloodinundationmapping,426.921221602615,landmark,True | ||
| 224 | −2335728318,10.57702/e7wwo0zk,,Reading digits in natural images with unsupervised feature learning,,2024,article,computer_vision,1,4147.0,4149.0,491.5278782460276,4149,55.5129,True,True,post,491.5278782460276,landmark,True | 224 | +4224035735,10.48550/arxiv.2204.06125,2204.06125,Hierarchical Text-Conditional Image Generation with CLIP Latents,arXiv (Cornell University),2022,preprint,computer_vision,5,904.0,1882.0,408.5254913442887,2203,,True,True,baseline,hierarchicaltextconditionalimagegenerationwithcliplatents,408.5254913442887,landmark,True | ||
| 225 | −4390873054,10.1109/iccv51070.2023.00355,,Adding Conditional Control to Text-to-Image Diffusion Models,IEEE/CVF International Conference on Computer Vision (ICCV),2023,conference-paper,computer_vision,6,1511.0,3376.0,471.1257295744967,4408,501.2109,True,False,post,471.1257295744967,landmark,True | 225 | +4200503948,10.7735/ksmte.2021.30.6.513,2004.10934,Comparative Analysis of Defect Detection Using YOLO of Deep Learning,Journal of the korean society of manufacturing technology engineers,2021,article,computer_vision,3,4221.0,6845.0,406.01302821116474,8,0.9035,True,True,baseline,comparativeanalysisofdefectdetectionusingyoloofdeeplearning,406.01302821116474,landmark,True | ||
| 226 | −3100507239,,,Illumination-Adaptive Person Re-identification,Institutional Repositories DataBase (IRDB),2020,dissertation,computer_vision,1,44.0,66.0,447.55516014234877,97,,True,True,baseline,447.55516014234877,landmark,True | 226 | +4398756379,10.1109/adics58448.2024.10533619,,YOLOv8: A Novel Object Detection Algorithm with Enhanced Performance and Robustness,,2024,conference-paper,computer_vision,2,1232.0,1876.0,393.72768235909564,1876,409.6027,True,False,post,yolov8anovelobjectdetectionalgorithmwithenhancedperformanceandrobustness,393.72768235909564,landmark,True | ||
| 227 | −2626778328,10.65215/2q58a426,1706.03762,Attention Is All You Need,,2025,preprint,nlp,5,24486.0,24486.0,29646.72006980803,24487,,True,True,post,12396.254320473392,landmark,True | 227 | +2626778328,10.65215/2q58a426,1706.03762,Attention Is All You Need,,2025,preprint,nlp,5,24486.0,24486.0,29646.72006980803,24487,,True,True,post,attentionisallyouneed,10699.68580569256,landmark,True | ||
| 228 | −2963341956,10.18653/v1/n19-1423,,BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding,Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (NAACL-HLT),2019,conference-paper,nlp,3,9645.0,19296.0,2566.536785186562,31944,2211.5894,True,True,baseline,2566.536785186562,landmark,True | 228 | +2963341956,10.18653/v1/n19-1423,,BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding,Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (NAACL-HLT),2019,conference-paper,nlp,3,9645.0,19296.0,2566.536785186562,31944,2211.5894,True,True,baseline,bertpretrainingofdeepbidirectionaltransformersforlanguageunderstanding,2566.536785186562,landmark,True | ||
| 229 | −3098044990,,,Traduction Non Supervisée de Langages de Programmation,theses.fr (ABES),2022,dissertation,nlp,4,121.0,143.0,1240.408521303258,162,,True,True,baseline,1240.408521303258,landmark,True | 229 | +3098044990,,,Traduction Non Supervisée de Langages de Programmation,theses.fr (ABES),2022,dissertation,nlp,4,121.0,143.0,1240.408521303258,162,,True,True,baseline,traductionnonsupervisedelangagesdeprogrammation,1240.408521303258,landmark,True | ||
| 230 | −2896457183,10.4230/lipics.cosit.2022.18,1810.04805,AI-Assisted Pipeline for Dynamic Generation of Trustworthy Health Supplement Content at Scale,arXiv (Cornell University),2018,preprint,nlp,2,1630.0,5855.0,902.4576906598114,44705,,True,True,baseline,902.4576906598114,landmark,True | 230 | +2896457183,10.4230/lipics.cosit.2022.18,1810.04805,AI-Assisted Pipeline for Dynamic Generation of Trustworthy Health Supplement Content at Scale,arXiv (Cornell University),2018,preprint,nlp,2,1630.0,5855.0,902.4576906598114,44705,,True,True,baseline,aiassistedpipelinefordynamicgenerationoftrustworthyhealthsupplementcontentatscale,902.4576906598114,landmark,True | ||
| 231 | −2787560479,10.18653/v1/n18-1202,1802.05365,Deep Contextualized Word Representations,Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (NAACL-HLT),2018,conference-paper,nlp,2,2252.0,4791.0,741.8627823725466,11541,762.8608,True,True,baseline,741.8627823725466,landmark,True | 231 | +2787560479,10.18653/v1/n18-1202,1802.05365,Deep Contextualized Word Representations,Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (NAACL-HLT),2018,conference-paper,nlp,2,2252.0,4791.0,741.8627823725466,11541,762.8608,True,True,baseline,deepcontextualizedwordrepresentations,741.8627823725466,landmark,True | ||
| 232 | −4411403346,10.1145/3744746,2307.06435,A Comprehensive Overview of Large Language Models,ACM Transactions on Intelligent Systems and Technology,2025,article,nlp,5,1097.0,1097.0,373.692295245369,1097,382.0017,True,True,post,555.3659637980605,landmark,True | 232 | +4224308101,10.48550/arxiv.2204.02311,2204.02311,PaLM: Scaling Language Modeling with Pathways,arXiv (Cornell University),2022,preprint,nlp,7,950.0,1657.0,481.54051809067556,2051,,True,True,baseline,palmscalinglanguagemodelingwithpathways,481.54051809067556,landmark,True | ||
| 233 | −4224308101,10.48550/arxiv.2204.02311,2204.02311,PaLM: Scaling Language Modeling with Pathways,arXiv (Cornell University),2022,preprint,nlp,7,950.0,1657.0,481.54051809067556,2051,,True,True,baseline,481.54051809067556,landmark,True | 233 | +4411403346,10.1145/3744746,2307.06435,A Comprehensive Overview of Large Language Models,ACM Transactions on Intelligent Systems and Technology,2025,article,nlp,5,1097.0,1097.0,373.692295245369,1097,382.0017,True,True,post,acomprehensiveoverviewoflargelanguagemodels,479.357809721667,landmark,True | ||
| 234 | −2979736514,10.13025/17598,,Neural transfer learning for natural language processing,Arrow@dit (Dublin Institute of Technology),2019,dissertation,nlp,5,62.0,116.0,422.42293906810033,177,,True,True,baseline,422.42293906810033,landmark,True | 234 | +2979736514,10.13025/17598,,Neural transfer learning for natural language processing,Arrow@dit (Dublin Institute of Technology),2019,dissertation,nlp,5,62.0,116.0,422.42293906810033,177,,True,True,baseline,neuraltransferlearningfornaturallanguageprocessing,422.42293906810033,landmark,True | ||
| 235 | −4386506836,10.1515/9781474471459-050,,5.7 The WORDNET lexical database of English,Edinburgh University Press eBooks,2019,book-chapter,nlp,1,1138.0,1337.0,415.89661853577525,1865,230.3576,False,False,baseline,415.89661853577525,landmark,True | 235 | +4386506836,10.1515/9781474471459-050,,5.7 The WORDNET lexical database of English,Edinburgh University Press eBooks,2019,book-chapter,nlp,1,1138.0,1337.0,415.89661853577525,1865,230.3576,False,False,baseline,57thewordnetlexicaldatabaseofenglish,415.89661853577525,landmark,True | ||
| 236 | −2982399380,10.18653/v1/2020.acl-main.703,1910.13461,"BART: Denoising Sequence-to-Sequence Pre-training for Natural Language Generation, Translation, and Comprehension",Annual Meeting of the Association for Computational Linguistics (ACL),2020,conference-paper,nlp,5,1454.0,2915.0,413.1416402072767,8244,528.5478,True,True,baseline,413.1416402072767,landmark,True | 236 | +2982399380,10.18653/v1/2020.acl-main.703,1910.13461,"BART: Denoising Sequence-to-Sequence Pre-training for Natural Language Generation, Translation, and Comprehension",Annual Meeting of the Association for Computational Linguistics (ACL),2020,conference-paper,nlp,5,1454.0,2915.0,413.1416402072767,8244,528.5478,True,True,baseline,bartdenoisingsequencetosequencepretrainingfornaturallanguagegenerationtranslationandcomprehension,413.1416402072767,landmark,True | ||
| 237 | −7125799258,10.1109/tpami.2026.3657354,2312.12148,Parameter-Efficient Fine-Tuning Methods for Pretrained Language Models: A Critical Review and Assessment,IEEE Transactions on Pattern Analysis and Machine Intelligence,2026,article,nlp,4,115.0,115.0,127.97217616701306,115,191.4688,True,True,post,408.85036662226526,landmark,True | 237 | +4391136507,10.1145/3641289,2307.03109,A Survey on Evaluation of Large Language Models,ACM Transactions on Intelligent Systems and Technology,2024,article,nlp,5,2160.0,3004.0,373.1207027772732,3004,440.36,True,True,post,asurveyonevaluationoflargelanguagemodels,373.1207027772732,landmark,True | ||
| 238 | −4391136507,10.1145/3641289,2307.03109,A Survey on Evaluation of Large Language Models,ACM Transactions on Intelligent Systems and Technology,2024,article,nlp,5,2160.0,3004.0,373.1207027772732,3004,440.36,True,True,post,373.1207027772732,landmark,True | 238 | +2979826702,10.18653/v1/2020.emnlp-demos.6,,Transformers: State-of-the-Art Natural Language Processing,Conference on Empirical Methods in Natural Language Processing: System Demonstrations (EMNLP),2020,conference-paper,nlp,3,965.0,2605.0,369.2054794991272,8292,488.3322,True,True,baseline,transformersstateoftheartnaturallanguageprocessing,369.2054794991272,landmark,True | ||
| 239 | −2979826702,10.18653/v1/2020.emnlp-demos.6,,Transformers: State-of-the-Art Natural Language Processing,Conference on Empirical Methods in Natural Language Processing: System Demonstrations (EMNLP),2020,conference-paper,nlp,3,965.0,2605.0,369.2054794991272,8292,488.3322,True,True,baseline,369.2054794991272,landmark,True | 239 | +4404534210,10.1145/3703155,2311.05232,"A Survey on Hallucination in Large Language Models: Principles, Taxonomy, Challenges, and Open Questions",ACM Transactions on Information Systems,2024,article,nlp,4,1138.0,2379.0,295.4907296628272,2379,354.0441,True,True,post,asurveyonhallucinationinlargelanguagemodelsprinciplestaxonomychallengesandopenquestions,295.4907296628272,landmark,True | ||
| 240 | −4404534210,10.1145/3703155,2311.05232,"A Survey on Hallucination in Large Language Models: Principles, Taxonomy, Challenges, and Open Questions",ACM Transactions on Information Systems,2024,article,nlp,4,1138.0,2379.0,295.4907296628272,2379,354.0441,True,True,post,295.4907296628272,landmark,True | 240 | +7125799258,10.1109/tpami.2026.3657354,2312.12148,Parameter-Efficient Fine-Tuning Methods for Pretrained Language Models: A Critical Review and Assessment,IEEE Transactions on Pattern Analysis and Machine Intelligence,2026,article,nlp,4,115.0,115.0,127.97217616701306,115,191.4688,True,True,post,parameterefficientfinetuningmethodsforpretrainedlanguagemodelsacriticalreviewandassessment,291.5790974019528,landmark,True | ||
| 241 | −2983040767,10.18653/v1/2020.acl-main.747,1911.02116,Unsupervised Cross-lingual Representation Learning at Scale,Annual Meeting of the Association for Computational Linguistics (ACL),2020,conference-paper,nlp,3,1179.0,2047.0,290.1203902244581,5335,332.4086,True,True,baseline,290.1203902244581,landmark,True | 241 | +2983040767,10.18653/v1/2020.acl-main.747,1911.02116,Unsupervised Cross-lingual Representation Learning at Scale,Annual Meeting of the Association for Computational Linguistics (ACL),2020,conference-paper,nlp,3,1179.0,2047.0,290.1203902244581,5335,332.4086,True,True,baseline,unsupervisedcrosslingualrepresentationlearningatscale,290.1203902244581,landmark,True | ||
| 242 | −2948223045,10.18653/v1/p19-1355,1906.02243,Energy and Policy Considerations for Deep Learning in NLP,Annual Meeting of the Association for Computational Linguistics (ACL),2019,conference-paper,nlp,4,368.0,863.0,257.5756075430014,3453,514.1231,True,True,baseline,257.5756075430014,landmark,True | 242 | +2948223045,10.18653/v1/p19-1355,1906.02243,Energy and Policy Considerations for Deep Learning in NLP,Annual Meeting of the Association for Computational Linguistics (ACL),2019,conference-paper,nlp,4,368.0,863.0,257.5756075430014,3453,514.1231,True,True,baseline,energyandpolicyconsiderationsfordeeplearninginnlp,257.5756075430014,landmark,True | ||
| 243 | −3044864684,,,Leveraging orthographic information to improve machine translation of under-resourced languages,,2020,dissertation,nlp,3,52.0,53.0,244.74101247248717,58,,False,False,baseline,244.74101247248717,landmark,True | 243 | +3044864684,,,Leveraging orthographic information to improve machine translation of under-resourced languages,,2020,dissertation,nlp,3,52.0,53.0,244.74101247248717,58,,False,False,baseline,leveragingorthographicinformationtoimprovemachinetranslationofunderresourcedlanguages,244.74101247248717,landmark,True | ||
| 244 | −4404782964,10.18653/v1/2024.emnlp-main.64,,A Survey on In-context Learning,Conference on Empirical Methods in Natural Language Processing (EMNLP),2024,conference-paper,nlp,3,646.0,879.0,244.3285362084626,632,188.3078,True,True,post,244.3285362084626,landmark,True | 244 | +4404782964,10.18653/v1/2024.emnlp-main.64,,A Survey on In-context Learning,Conference on Empirical Methods in Natural Language Processing (EMNLP),2024,conference-paper,nlp,3,646.0,879.0,244.3285362084626,632,188.3078,True,True,post,asurveyonincontextlearning,244.3285362084626,landmark,True | ||
| 245 | −4221142221,10.48550/arxiv.2203.05794,2203.05794,BERTopic: Neural topic modeling with a class-based TF-IDF procedure,arXiv (Cornell University),2022,preprint,nlp,3,416.0,812.0,235.9751965537891,1342,,True,True,baseline,235.9751965537891,landmark,True | 245 | +4221142221,10.48550/arxiv.2203.05794,2203.05794,BERTopic: Neural topic modeling with a class-based TF-IDF procedure,arXiv (Cornell University),2022,preprint,nlp,3,416.0,812.0,235.9751965537891,1342,,True,True,baseline,bertopicneuraltopicmodelingwithaclassbasedtfidfprocedure,235.9751965537891,landmark,True | ||
| 246 | −3169483174,10.18653/v1/2021.naacl-main.41,,mT5: A Massively Multilingual Pre-trained Text-to-Text Transformer,Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (NAACL-HLT),2021,conference-paper,nlp,4,642.0,1458.0,231.16193233956648,1621,144.7472,True,True,baseline,231.16193233956648,landmark,True | 246 | +3169483174,10.18653/v1/2021.naacl-main.41,,mT5: A Massively Multilingual Pre-trained Text-to-Text Transformer,Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (NAACL-HLT),2021,conference-paper,nlp,4,642.0,1458.0,231.16193233956648,1621,144.7472,True,True,baseline,mt5amassivelymultilingualpretrainedtexttotexttransformer,231.16193233956648,landmark,True | ||
| 247 | −3196350727,10.4230/oasics.ldk.2021.34,,"HISTORIAE, History of Socio-Cultural Transformation as Linguistic Data Science. A Humanities Use Case",DROPS (Schloss Dagstuhl – Leibniz Center for Informatics),2021,article,nlp,1,8042.0,12201.0,226.99110878661088,0,0.0,True,True,baseline,226.99110878661088,landmark,True | 247 | +3196350727,10.4230/oasics.ldk.2021.34,,"HISTORIAE, History of Socio-Cultural Transformation as Linguistic Data Science. A Humanities Use Case",DROPS (Schloss Dagstuhl – Leibniz Center for Informatics),2021,article,nlp,1,8042.0,12201.0,226.99110878661088,0,0.0,True,True,baseline,historiaehistoryofsocioculturaltransformationaslinguisticdatascienceahumanitiesusecase,226.99110878661088,landmark,True | ||
| 248 | −4229005866,10.4230/oasics.slate.2022.19,2205.01068,Analysing Off-The-Shelf Options for Question Answering with Portuguese FAQs,arXiv (Cornell University),2022,preprint,nlp,5,473.0,740.0,215.05128749975853,879,,True,True,baseline,215.05128749975853,landmark,True | 248 | +4229005866,10.4230/oasics.slate.2022.19,2205.01068,Analysing Off-The-Shelf Options for Question Answering with Portuguese FAQs,arXiv (Cornell University),2022,preprint,nlp,5,473.0,740.0,215.05128749975853,879,,True,True,baseline,analysingofftheshelfoptionsforquestionansweringwithportuguesefaqs,215.05128749975853,landmark,True | ||
| 249 | −7130436101,10.1038/s41586-025-10097-9,2506.20430,An agentic system for rare disease diagnosis with traceable reasoning,Nature,2026,article,nlp,7,59.0,59.0,26.859760394644116,59,109.0609,True,True,post,209.7580141801187,landmark,True | 249 | +2798812533,10.18653/v1/p18-1031,1801.06146,Universal Language Model Fine-tuning for Text Classification,Annual Meeting of the Association for Computational Linguistics (ACL),2018,conference-paper,nlp,6,617.0,1344.0,208.11178866806569,3882,191.3134,True,True,baseline,universallanguagemodelfinetuningfortextclassification,208.11178866806569,landmark,True | ||
| 250 | −2798812533,10.18653/v1/p18-1031,1801.06146,Universal Language Model Fine-tuning for Text Classification,Annual Meeting of the Association for Computational Linguistics (ACL),2018,conference-paper,nlp,6,617.0,1344.0,208.11178866806569,3882,191.3134,True,True,baseline,208.11178866806569,landmark,True | 250 | +3156636935,10.18653/v1/2021.emnlp-main.552,2104.08821,SimCSE: Simple Contrastive Learning of Sentence Embeddings,Conference on Empirical Methods in Natural Language Processing (EMNLP),2021,conference-paper,nlp,5,480.0,1288.0,204.20889496115336,2686,230.7564,True,True,baseline,simcsesimplecontrastivelearningofsentenceembeddings,204.20889496115336,landmark,True | ||
| 251 | −3156636935,10.18653/v1/2021.emnlp-main.552,2104.08821,SimCSE: Simple Contrastive Learning of Sentence Embeddings,Conference on Empirical Methods in Natural Language Processing (EMNLP),2021,conference-paper,nlp,5,480.0,1288.0,204.20889496115336,2686,230.7564,True,True,baseline,204.20889496115336,landmark,True | 251 | +4402670856,10.18653/v1/2024.findings-acl.137,2402.03216,"M3-Embedding: Multi-Linguality, Multi-Functionality, Multi-Granularity Text Embeddings Through Self-Knowledge Distillation",,2024,conference-paper,nlp,6,315.0,700.0,194.5733507917222,700,212.9491,True,True,post,m3embeddingmultilingualitymultifunctionalitymultigranularitytextembeddingsthroughselfknowledgedistillation,194.5733507917222,landmark,True | ||
| 252 | −2219249508,10.1007/978-3-032-27827-2_35,,Perceptual Signal Analysis and Eigenvalue-Weighted Metrics for Musical Audio Quality Assessment,Lecture notes in computer science,2026,conference-paper,speech_audio,2,844.0,844.0,3046.350724637681,845,0.0,False,True,post,3000.6061689494945,landmark,True | 252 | +2219249508,10.1007/978-3-032-27827-2_35,,Perceptual Signal Analysis and Eigenvalue-Weighted Metrics for Musical Audio Quality Assessment,Lecture notes in computer science,2026,conference-paper,speech_audio,2,844.0,844.0,3046.350724637681,845,0.0,False,True,post,perceptualsignalanalysisandeigenvalueweightedmetricsformusicalaudioqualityassessment,2139.9370278891147,landmark,True | ||
| 253 | −1524333225,10.57702/jb3fvbn9,,Kaldi Speech Recognition Toolkit,Infoscience (Ecole Polytechnique Fédérale de Lausanne),2024,article,speech_audio,1,4597.0,4599.0,571.2323941653393,4609,5.5064,True,True,post,571.2323941653393,landmark,True | 253 | +1524333225,10.57702/jb3fvbn9,,Kaldi Speech Recognition Toolkit,Infoscience (Ecole Polytechnique Fédérale de Lausanne),2024,article,speech_audio,1,4597.0,4599.0,571.2323941653393,4609,5.5064,True,True,post,kaldispeechrecognitiontoolkit,571.2323941653393,landmark,True | ||
| 254 | −4392233542,10.3390/s24051546,,A Review of Machine Learning Approaches for the Personalization of Amplification in Hearing Aids,Sensors,2024,dissertation,speech_audio,1,7.0,19.0,327.9259259259259,19,,True,True,post,327.9259259259259,landmark,True | 254 | +4392233542,10.3390/s24051546,,A Review of Machine Learning Approaches for the Personalization of Amplification in Hearing Aids,Sensors,2024,dissertation,speech_audio,1,7.0,19.0,327.9259259259259,19,,True,True,post,areviewofmachinelearningapproachesforthepersonalizationofamplificationinhearingaids,327.9259259259259,landmark,True | ||
| 255 | −4311000453,10.48550/arxiv.2212.04356,2212.04356,Robust Speech Recognition via Large-Scale Weak Supervision,arXiv (Cornell University),2022,preprint,speech_audio,5,337.0,759.0,220.57287461123883,1134,,True,True,post,220.57287461123883,landmark,True | 255 | +4311000453,10.48550/arxiv.2212.04356,2212.04356,Robust Speech Recognition via Large-Scale Weak Supervision,arXiv (Cornell University),2022,preprint,speech_audio,5,337.0,759.0,220.57287461123883,1134,,True,True,post,robustspeechrecognitionvialargescaleweaksupervision,220.57287461123883,landmark,True | ||
| 256 | −2936774411,10.21437/interspeech.2019-2680,1904.08779,SpecAugment: A Simple Data Augmentation Method for Automatic Speech Recognition,Interspeech (USB),2019,conference-paper,speech_audio,5,465.0,1205.0,160.2755403270008,3499,180.2006,True,True,baseline,160.2755403270008,landmark,True | 256 | +2936774411,10.21437/interspeech.2019-2680,1904.08779,SpecAugment: A Simple Data Augmentation Method for Automatic Speech Recognition,Interspeech (USB),2019,conference-paper,speech_audio,5,465.0,1205.0,160.2755403270008,3499,180.2006,True,True,baseline,specaugmentasimpledataaugmentationmethodforautomaticspeechrecognition,160.2755403270008,landmark,True | ||
| 257 | −4406417959,10.1109/taslpro.2025.3530270,,Neural Codec Language Models are Zero-Shot Text to Speech Synthesizers,IEEE Transactions on Audio Speech and Language Processing,2025,article,speech_audio,2,281.0,281.0,95.7224566672276,122,50.7671,True,False,post,142.25873821992252,landmark,True | 257 | +2952218014,10.1109/taslp.2019.2915167,1809.07454,Conv-TasNet: Surpassing Ideal Time–Frequency Magnitude Masking for Speech Separation,IEEE/ACM Transactions on Audio Speech and Language Processing,2019,article,speech_audio,2,273.0,598.0,126.90333200584095,2042,137.8473,True,True,baseline,convtasnetsurpassingidealtimefrequencymagnitudemaskingforspeechseparation,126.90333200584095,landmark,True | ||
| 258 | −2952218014,10.1109/taslp.2019.2915167,1809.07454,Conv-TasNet: Surpassing Ideal Time–Frequency Magnitude Masking for Speech Separation,IEEE/ACM Transactions on Audio Speech and Language Processing,2019,article,speech_audio,2,273.0,598.0,126.90333200584095,2042,137.8473,True,True,baseline,126.90333200584095,landmark,True | 258 | +4406417959,10.1109/taslpro.2025.3530270,,Neural Codec Language Models are Zero-Shot Text to Speech Synthesizers,IEEE Transactions on Audio Speech and Language Processing,2025,article,speech_audio,2,281.0,281.0,95.7224566672276,122,50.7671,True,False,post,neuralcodeclanguagemodelsarezeroshottexttospeechsynthesizers,122.78901051211342,landmark,True | ||
| 259 | −2890964092,10.1109/icassp.2018.8461375,,X-Vectors: Robust DNN Embeddings for Speaker Recognition,IEEE International Conference on Acoustics Speech and Signal Processing,2018,conference-paper,speech_audio,4,274.0,698.0,108.08186643624245,2620,119.8439,True,False,baseline,108.08186643624245,landmark,True | 259 | +2890964092,10.1109/icassp.2018.8461375,,X-Vectors: Robust DNN Embeddings for Speaker Recognition,IEEE International Conference on Acoustics Speech and Signal Processing,2018,conference-paper,speech_audio,4,274.0,698.0,108.08186643624245,2620,119.8439,True,False,baseline,xvectorsrobustdnnembeddingsforspeakerrecognition,108.08186643624245,landmark,True | ||
| 260 | −3097777922,10.21437/interspeech.2020-3015,2005.08100,Conformer: Convolution-augmented Transformer for Speech Recognition,Interspeech (USB),2020,conference-paper,speech_audio,4,335.0,755.0,107.00581075694473,3070,145.6429,True,True,baseline,107.00581075694473,landmark,True | 260 | +3097777922,10.21437/interspeech.2020-3015,2005.08100,Conformer: Convolution-augmented Transformer for Speech Recognition,Interspeech (USB),2020,conference-paper,speech_audio,4,335.0,755.0,107.00581075694473,3070,145.6429,True,True,baseline,conformerconvolutionaugmentedtransformerforspeechrecognition,107.00581075694473,landmark,True | ||
| 261 | −2962866211,10.1109/taslp.2018.2842159,1708.07524,Supervised Speech Separation Based on Deep Learning: An Overview,IEEE/ACM Transactions on Audio Speech and Language Processing,2018,article,speech_audio,3,206.0,429.0,106.2474690299835,1524,120.6683,True,True,baseline,106.2474690299835,landmark,True | 261 | +2962866211,10.1109/taslp.2018.2842159,1708.07524,Supervised Speech Separation Based on Deep Learning: An Overview,IEEE/ACM Transactions on Audio Speech and Language Processing,2018,article,speech_audio,3,206.0,429.0,106.2474690299835,1524,120.6683,True,True,baseline,supervisedspeechseparationbasedondeeplearninganoverview,106.2474690299835,landmark,True | ||
| 262 | −1530164934,10.7275/a01b-fx07,,A Probabilistic Model of Hierarchical Music Analysis,Scholarworks (University of Massachusetts Amherst),2020,dissertation,speech_audio,1,15.0,15.0,105.97222222222223,36,,True,True,baseline,105.97222222222223,landmark,True | 262 | +1530164934,10.7275/a01b-fx07,,A Probabilistic Model of Hierarchical Music Analysis,Scholarworks (University of Massachusetts Amherst),2020,dissertation,speech_audio,1,15.0,15.0,105.97222222222223,36,,True,True,baseline,aprobabilisticmodelofhierarchicalmusicanalysis,105.97222222222223,landmark,True | ||
| 263 | −2964243274,10.1109/icassp.2018.8461368,1712.05884,Natural TTS Synthesis by Conditioning Wavenet on MEL Spectrogram Predictions,IEEE International Conference on Acoustics Speech and Signal Processing,2018,conference-paper,speech_audio,3,299.0,662.0,102.50744352549069,2692,119.0117,True,True,baseline,102.50744352549069,landmark,True | 263 | +2964243274,10.1109/icassp.2018.8461368,1712.05884,Natural TTS Synthesis by Conditioning Wavenet on MEL Spectrogram Predictions,IEEE International Conference on Acoustics Speech and Signal Processing,2018,conference-paper,speech_audio,3,299.0,662.0,102.50744352549069,2692,119.0117,True,True,baseline,naturalttssynthesisbyconditioningwavenetonmelspectrogrampredictions,102.50744352549069,landmark,True | ||
| 264 | −3167533889,10.48550/arxiv.2106.04624,2106.04624,SpeechBrain: A General-Purpose Speech Toolkit,arXiv (Cornell University),2021,preprint,speech_audio,1,129.0,288.0,96.44297133944238,504,,True,True,baseline,96.44297133944238,landmark,True | 264 | +3167533889,10.48550/arxiv.2106.04624,2106.04624,SpeechBrain: A General-Purpose Speech Toolkit,arXiv (Cornell University),2021,preprint,speech_audio,1,129.0,288.0,96.44297133944238,504,,True,True,baseline,speechbrainageneralpurposespeechtoolkit,96.44297133944238,landmark,True | ||
| 265 | −3169320628,10.1109/taslp.2021.3122291,2106.07447,HuBERT: Self-Supervised Speech Representation Learning by Masked Prediction of Hidden Units,IEEE/ACM Transactions on Audio Speech and Language Processing,2021,article,speech_audio,5,222.0,765.0,89.15495130101968,2919,124.2084,True,True,baseline,89.15495130101968,landmark,True | 265 | +3169320628,10.1109/taslp.2021.3122291,2106.07447,HuBERT: Self-Supervised Speech Representation Learning by Masked Prediction of Hidden Units,IEEE/ACM Transactions on Audio Speech and Language Processing,2021,article,speech_audio,5,222.0,765.0,89.15495130101968,2919,124.2084,True,True,baseline,hubertselfsupervisedspeechrepresentationlearningbymaskedpredictionofhiddenunits,89.15495130101968,landmark,True | ||
| 266 | −2975281968,,,"Modeling Music : Studies of Music Transcription, Music Perception and Music Production",KTH Publication Database DiVA (KTH Royal Institute of Technology),2018,dissertation,speech_audio,6,1.0,13.0,87.36363636363636,15,,True,True,baseline,87.36363636363636,landmark,True | 266 | +2975281968,,,"Modeling Music : Studies of Music Transcription, Music Perception and Music Production",KTH Publication Database DiVA (KTH Royal Institute of Technology),2018,dissertation,speech_audio,6,1.0,13.0,87.36363636363636,15,,True,True,baseline,modelingmusicstudiesofmusictranscriptionmusicperceptionandmusicproduction,87.36363636363636,landmark,True | ||
| 267 | −4372260310,10.1109/icassp49357.2023.10095969,2211.06687,Large-Scale Contrastive Language-Audio Pretraining with Feature Fusion and Keyword-to-Caption Augmentation,IEEE International Conference on Acoustics Speech and Signal Processing,2023,conference-paper,speech_audio,5,124.0,320.0,87.23607346034898,439,97.1083,True,True,post,87.23607346034898,landmark,True | 267 | +4372260310,10.1109/icassp49357.2023.10095969,2211.06687,Large-Scale Contrastive Language-Audio Pretraining with Feature Fusion and Keyword-to-Caption Augmentation,IEEE International Conference on Acoustics Speech and Signal Processing,2023,conference-paper,speech_audio,5,124.0,320.0,87.23607346034898,439,97.1083,True,True,post,largescalecontrastivelanguageaudiopretrainingwithfeaturefusionandkeywordtocaptionaugmentation,87.23607346034898,landmark,True | ||
| 268 | −4372266552,10.1109/icassp49357.2023.10095889,2206.04769,CLAP Learning Audio Concepts from Natural Language Supervision,IEEE International Conference on Acoustics Speech and Signal Processing,2023,conference-paper,speech_audio,4,134.0,318.0,86.6908480012218,438,96.4447,True,True,baseline,86.6908480012218,landmark,True | 268 | +4372266552,10.1109/icassp49357.2023.10095889,2206.04769,CLAP Learning Audio Concepts from Natural Language Supervision,IEEE International Conference on Acoustics Speech and Signal Processing,2023,conference-paper,speech_audio,4,134.0,318.0,86.6908480012218,438,96.4447,True,True,baseline,claplearningaudioconceptsfromnaturallanguagesupervision,86.6908480012218,landmark,True | ||
| 269 | −2900368655,10.1109/icassp.2019.8683855,1811.02508,SDR – Half-baked or Well Done?,IEEE International Conference on Acoustics Speech and Signal Processing,2019,conference-paper,speech_audio,1,151.0,313.0,85.71885565669702,1146,88.5281,True,True,baseline,85.71885565669702,landmark,True | 269 | +3209984917,10.1109/jstsp.2022.3188113,2110.13900,WavLM: Large-Scale Self-Supervised Pre-Training for Full Stack Speech Processing,IEEE Journal of Selected Topics in Signal Processing,2022,article,speech_audio,5,388.0,800.0,82.43168975381538,1897,117.1333,True,True,baseline,wavlmlargescaleselfsupervisedpretrainingforfullstackspeechprocessing,82.43168975381538,landmark,True | ||
| 270 | −3209984917,10.1109/jstsp.2022.3188113,2110.13900,WavLM: Large-Scale Self-Supervised Pre-Training for Full Stack Speech Processing,IEEE Journal of Selected Topics in Signal Processing,2022,article,speech_audio,5,388.0,800.0,82.43168975381538,1897,117.1333,True,True,baseline,82.43168975381538,landmark,True | 270 | +3196974791,10.21437/interspeech.2021-698,,AST: Audio Spectrogram Transformer,Interspeech (USB),2021,conference-paper,speech_audio,2,119.0,308.0,72.25665452507705,1086,83.5514,True,False,baseline,astaudiospectrogramtransformer,72.25665452507705,landmark,True | ||
| 271 | −4318351475,10.48550/arxiv.2301.11325,2301.11325,MuChoMusic dataset,arXiv (Cornell University),2023,preprint,speech_audio,4,126.0,164.0,77.2652719665272,182,,True,True,post,77.2652719665272,landmark,True | 271 | +2775304348,10.1109/icassp.2018.8462105,1712.01769,State-of-the-Art Speech Recognition with Sequence-to-Sequence Models,IEEE International Conference on Acoustics Speech and Signal Processing,2018,conference-paper,speech_audio,6,240.0,455.0,70.45451178866807,1009,71.1573,True,True,baseline,stateoftheartspeechrecognitionwithsequencetosequencemodels,70.45451178866807,landmark,True | ||
| 272 | −3196974791,10.21437/interspeech.2021-698,,AST: Audio Spectrogram Transformer,Interspeech (USB),2021,conference-paper,speech_audio,2,119.0,308.0,72.25665452507705,1086,83.5514,True,False,baseline,72.25665452507705,landmark,True | 272 | +3015199127,10.1109/icassp40776.2020.9054266,,Dual-Path RNN: Efficient Long Sequence Modeling for Time-Domain Single-Channel Speech Separation,IEEE International Conference on Acoustics Speech and Signal Processing,2020,conference-paper,speech_audio,2,151.0,293.0,68.6972461420411,780,69.2189,True,False,baseline,dualpathrnnefficientlongsequencemodelingfortimedomainsinglechannelspeechseparation,68.6972461420411,landmark,True | ||
| 273 | −7135186946,10.1109/jstsp.2026.3673981,,Scalable Fluid Antenna Systems: A New Paradigm for Array Signal Processing,IEEE Journal of Selected Topics in Signal Processing,2026,article,speech_audio,1,20.0,20.0,66.31436314363144,20,82.3333,True,False,post,71.10441158648091,landmark,True | 273 | +2808631503,10.21437/interspeech.2018-1929,1806.05622,VoxCeleb2: Deep Speaker Recognition,Interspeech (USB),2018,conference-paper,speech_audio,4,149.0,442.0,68.44152573756327,2246,81.0403,True,True,baseline,voxceleb2deepspeakerrecognition,68.44152573756327,landmark,True | ||
| 274 | −2775304348,10.1109/icassp.2018.8462105,1712.01769,State-of-the-Art Speech Recognition with Sequence-to-Sequence Models,IEEE International Conference on Acoustics Speech and Signal Processing,2018,conference-paper,speech_audio,6,240.0,455.0,70.45451178866807,1009,71.1573,True,True,baseline,70.45451178866807,landmark,True | 274 | +2972333964,10.21437/interspeech.2019-2008,,GELP: GAN-Excited Liner Prediction for Speech Synthesis from Mel-Spectrogram,Aaltodoc (Aalto University),2019,dissertation,speech_audio,3,8.0,17.0,61.90681003584229,34,,True,True,baseline,gelpganexcitedlinerpredictionforspeechsynthesisfrommelspectrogram,61.90681003584229,landmark,True | ||
| 275 | −3015199127,10.1109/icassp40776.2020.9054266,,Dual-Path RNN: Efficient Long Sequence Modeling for Time-Domain Single-Channel Speech Separation,IEEE International Conference on Acoustics Speech and Signal Processing,2020,conference-paper,speech_audio,2,151.0,293.0,68.6972461420411,780,69.2189,True,False,baseline,68.6972461420411,landmark,True | 275 | +4221145109,10.48550/arxiv.2202.03555,2202.03555,"data2vec: A General Framework for Self-supervised Learning in Speech, Vision and Language",arXiv (Cornell University),2022,preprint,speech_audio,8,152.0,208.0,60.446848378310506,231,,True,True,baseline,data2vecageneralframeworkforselfsupervisedlearninginspeechvisionandlanguage,60.446848378310506,landmark,True | ||
| 276 | −2808631503,10.21437/interspeech.2018-1929,1806.05622,VoxCeleb2: Deep Speaker Recognition,Interspeech (USB),2018,conference-paper,speech_audio,4,149.0,442.0,68.44152573756327,2246,81.0403,True,True,baseline,68.44152573756327,landmark,True | 276 | +2898847420,10.1109/icassp.2019.8683143,1811.00002,Waveglow: A Flow-based Generative Network for Speech Synthesis,IEEE International Conference on Acoustics Speech and Signal Processing,2019,conference-paper,speech_audio,4,233.0,453.0,60.25296246317956,972,60.7013,True,True,baseline,waveglowaflowbasedgenerativenetworkforspeechsynthesis,60.25296246317956,landmark,True | ||
| 277 | −7205708264,10.1146/annurev,,Relationship between educational robotics and executive functions in children with neurodevelopmental disorders,HAL (Le Centre pour la Communication Scientifique Directe),2026,conference-paper,robotics,1,117.0,117.0,897.9818032562595,123,157.1634,True,True,post,415.96080778091334,landmark,True | 277 | +7205708264,10.1146/annurev,,Relationship between educational robotics and executive functions in children with neurodevelopmental disorders,HAL (Le Centre pour la Communication Scientifique Directe),2026,conference-paper,robotics,1,117.0,117.0,897.9818032562595,123,157.1634,True,True,post,relationshipbetweeneducationalroboticsandexecutivefunctionsinchildrenwithneurodevelopmentaldisorders,296.6500382263346,landmark,True | ||
| 278 | −4385473486,10.48550/arxiv.2307.15818,2307.15818,RT-2: Vision-Language-Action Models Transfer Web Knowledge to Robotic Control,arXiv (Cornell University),2023,preprint,robotics,7,157.0,252.0,151.2,274,,True,True,post,151.2,landmark,True | 278 | +4385473486,10.48550/arxiv.2307.15818,2307.15818,RT-2: Vision-Language-Action Models Transfer Web Knowledge to Robotic Control,arXiv (Cornell University),2023,preprint,robotics,7,157.0,252.0,151.2,274,,True,True,post,rt2visionlanguageactionmodelstransferwebknowledgetoroboticcontrol,151.2,landmark,True | ||
| 279 | −7126053009,10.1016/j.inffus.2026.104193,2508.05342,Information-theoretic graph fusion with vision-language-action model for policy reasoning and dual robotic control,Information Fusion,2026,article,robotics,3,41.0,41.0,45.41643153526971,41,97.2957,False,True,post,145.7640437522859,landmark,True | 279 | +4293774946,10.1007/978-981-19-2980-9_32,,Employing Adaptive Learning and Intelligent Tutoring Robots for Virtual Classrooms and Smart Campuses: Reforming Education in the Age of Artificial Intelligence,Lecture notes in electrical engineering,2022,book-chapter,robotics,1,91.0,175.0,135.97268806899856,262,161.0471,False,False,baseline,employingadaptivelearningandintelligenttutoringrobotsforvirtualclassroomsandsmartcampusesreformingeducationintheageofartificialintelligence,135.97268806899856,landmark,True | ||
| 280 | −4414079054,10.15607/rss.2025.xxi.010,,π₀: A Vision-Language-Action Flow Model for General Robot Control,,2025,conference-paper,robotics,2,274.0,274.0,243.52116128619693,274,276.3475,True,True,post,138.71492623579633,landmark,True | 280 | +2963188159,10.15607/rss.2018.xiv.019,1711.00199,PoseCNN: A Convolutional Neural Network for 6D Object Pose Estimation in Cluttered Scenes,,2018,conference-paper,robotics,4,201.0,451.0,129.2718583898181,2127,284.4153,True,True,baseline,posecnnaconvolutionalneuralnetworkfor6dobjectposeestimationinclutteredscenes,129.2718583898181,landmark,True | ||
| 281 | −4293774946,10.1007/978-981-19-2980-9_32,,Employing Adaptive Learning and Intelligent Tutoring Robots for Virtual Classrooms and Smart Campuses: Reforming Education in the Age of Artificial Intelligence,Lecture notes in electrical engineering,2022,book-chapter,robotics,1,91.0,175.0,135.97268806899856,262,161.0471,False,False,baseline,135.97268806899856,landmark,True | 281 | +4383097638,10.1109/icra48891.2023.10160591,2209.07753,Code as Policies: Language Model Programs for Embodied Control,Proceedings - IEEE International Conference on Robotics and Automation/Proceedings,2023,conference-paper,robotics,3,237.0,511.0,125.95880564003319,722,324.1052,True,True,post,codeaspolicieslanguagemodelprogramsforembodiedcontrol,125.95880564003319,landmark,True | ||
| 282 | −7130402520,10.1109/tro.2026.3666139,2402.13255,How NeRFs and 3-D Gaussian Splatting Are Reshaping SLAM: A Survey,IEEE Transactions on Robotics,2026,article,robotics,3,38.0,38.0,49.59542857142858,38,48.5016,True,True,post,135.09838201431373,landmark,True | 282 | +4385430679,10.15607/rss.2023.xix.025,2212.06817,RT-1: Robotics Transformer for Real-World Control at Scale,,2023,conference-paper,robotics,10,195.0,488.0,120.28942691259529,689,309.7205,True,True,post,rt1roboticstransformerforrealworldcontrolatscale,120.28942691259529,landmark,True | ||
| 283 | −2963188159,10.15607/rss.2018.xiv.019,1711.00199,PoseCNN: A Convolutional Neural Network for 6D Object Pose Estimation in Cluttered Scenes,,2018,conference-paper,robotics,4,201.0,451.0,129.2718583898181,2127,284.4153,True,True,baseline,129.2718583898181,landmark,True | 283 | +4414079054,10.15607/rss.2025.xxi.010,,π₀: A Vision-Language-Action Flow Model for General Robot Control,,2025,conference-paper,robotics,2,274.0,274.0,243.52116128619693,274,276.3475,True,True,post,avisionlanguageactionflowmodelforgeneralrobotcontrol,119.73020953850207,landmark,True | ||
| 284 | −4398796510,10.1109/tnnls.2025.3650584,2405.14093,A Survey on Vision--Language--Action Models for Embodied AI,IEEE Transactions on Neural Networks and Learning Systems,2026,article,robotics,10,36.0,36.0,96.49320091673033,36,77.9076,True,True,post,127.98794085566564,landmark,True | 284 | +2990747716,10.1177/0278364919887447,,Learning dexterous in-hand manipulation,The International Journal of Robotics Research,2019,article,robotics,2,490.0,777.0,118.1470865906983,1585,89.792,True,True,baseline,learningdexterousinhandmanipulation,118.1470865906983,landmark,True | ||
| 285 | −4383097638,10.1109/icra48891.2023.10160591,2209.07753,Code as Policies: Language Model Programs for Embodied Control,Proceedings - IEEE International Conference on Robotics and Automation/Proceedings,2023,conference-paper,robotics,3,237.0,511.0,125.95880564003319,722,324.1052,True,True,post,125.95880564003319,landmark,True | 285 | +4383108457,10.1109/icra48891.2023.10161317,2209.11302,ProgPrompt: Generating Situated Robot Task Plans using Large Language Models,Proceedings - IEEE International Conference on Robotics and Automation/Proceedings,2023,conference-paper,robotics,7,245.0,492.0,113.46421800672258,583,109.6395,True,True,baseline,progpromptgeneratingsituatedrobottaskplansusinglargelanguagemodels,113.46421800672258,landmark,True | ||
| 286 | −4385430679,10.15607/rss.2023.xix.025,2212.06817,RT-1: Robotics Transformer for Real-World Control at Scale,,2023,conference-paper,robotics,10,195.0,488.0,120.28942691259529,689,309.7205,True,True,post,120.28942691259529,landmark,True | 286 | +1581527321,10.7907/2e18-0e29,,Collision Detection and Avoidance in Computer Controlled Manipulators,CaltechTHESIS (California Institute of Technology),2018,dissertation,robotics,1,14.0,16.0,110.6320610687023,276,,True,True,baseline,collisiondetectionandavoidanceincomputercontrolledmanipulators,110.6320610687023,landmark,True | ||
| 287 | −2990747716,10.1177/0278364919887447,,Learning dexterous in-hand manipulation,The International Journal of Robotics Research,2019,article,robotics,2,490.0,777.0,118.1470865906983,1585,89.792,True,True,baseline,118.1470865906983,landmark,True | 287 | +3043971245,10.1109/tro.2021.3075644,2007.11898,"ORB-SLAM3: An Accurate Open-Source Library for Visual, Visual–Inertial, and Multimap SLAM",IEEE Transactions on Robotics,2021,article,robotics,2,542.0,1312.0,104.21312513733956,4274,299.5553,True,True,baseline,orbslam3anaccurateopensourcelibraryforvisualvisualinertialandmultimapslam,104.21312513733956,landmark,True | ||
| 288 | −4383108457,10.1109/icra48891.2023.10161317,2209.11302,ProgPrompt: Generating Situated Robot Task Plans using Large Language Models,Proceedings - IEEE International Conference on Robotics and Automation/Proceedings,2023,conference-paper,robotics,7,245.0,492.0,113.46421800672258,583,109.6395,True,True,baseline,113.46421800672258,landmark,True | 288 | +7126053009,10.1016/j.inffus.2026.104193,2508.05342,Information-theoretic graph fusion with vision-language-action model for policy reasoning and dual robotic control,Information Fusion,2026,article,robotics,3,41.0,41.0,45.41643153526971,41,97.2957,False,True,post,informationtheoreticgraphfusionwithvisionlanguageactionmodelforpolicyreasoninganddualroboticcontrol,103.95428689982666,landmark,True | ||
| 289 | −1581527321,10.7907/2e18-0e29,,Collision Detection and Avoidance in Computer Controlled Manipulators,CaltechTHESIS (California Institute of Technology),2018,dissertation,robotics,1,14.0,16.0,110.6320610687023,276,,True,True,baseline,110.6320610687023,landmark,True | 289 | +4323572061,10.48550/arxiv.2303.03378,2303.03378,PaLM-E: An Embodied Multimodal Language Model,arXiv (Cornell University),2023,preprint,robotics,7,263.0,330.0,103.01438010104935,346,,True,True,post,palmeanembodiedmultimodallanguagemodel,103.01438010104935,landmark,True | ||
| 290 | −3043971245,10.1109/tro.2021.3075644,2007.11898,"ORB-SLAM3: An Accurate Open-Source Library for Visual, Visual–Inertial, and Multimap SLAM",IEEE Transactions on Robotics,2021,article,robotics,2,542.0,1312.0,104.21312513733956,4274,299.5553,True,True,baseline,104.21312513733956,landmark,True | 290 | +3003533476,10.1109/tits.2021.3054625,2002.00444,Deep Reinforcement Learning for Autonomous Driving: A Survey,IEEE Transactions on Intelligent Transportation Systems,2021,article,robotics,3,436.0,870.0,101.39190540115963,2313,122.2676,True,True,baseline,deepreinforcementlearningforautonomousdrivingasurvey,101.39190540115963,landmark,True | ||
| 291 | −4323572061,10.48550/arxiv.2303.03378,2303.03378,PaLM-E: An Embodied Multimodal Language Model,arXiv (Cornell University),2023,preprint,robotics,7,263.0,330.0,103.01438010104935,346,,True,True,post,103.01438010104935,landmark,True | 291 | +4385430674,10.15607/rss.2023.xix.016,2304.13705,Learning Fine-Grained Bimanual Manipulation with Low-Cost Hardware,,2023,conference-paper,robotics,6,86.0,395.0,97.36541727556381,649,291.7396,True,True,post,learningfinegrainedbimanualmanipulationwithlowcosthardware,97.36541727556381,landmark,True | ||
| 292 | −3003533476,10.1109/tits.2021.3054625,2002.00444,Deep Reinforcement Learning for Autonomous Driving: A Survey,IEEE Transactions on Intelligent Transportation Systems,2021,article,robotics,3,436.0,870.0,101.39190540115963,2313,122.2676,True,True,baseline,101.39190540115963,landmark,True | 292 | +7130402520,10.1109/tro.2026.3666139,2402.13255,How NeRFs and 3-D Gaussian Splatting Are Reshaping SLAM: A Survey,IEEE Transactions on Robotics,2026,article,robotics,3,38.0,38.0,49.59542857142858,38,48.5016,True,True,post,hownerfsand3dgaussiansplattingarereshapingslamasurvey,96.34787566325397,landmark,True | ||
| 293 | −7140452175,10.1109/tmech.2025.3579247,2501.02116,"Humanoid Locomotion and Manipulation: Current Progress and Challenges in Control, Planning, and Learning",IEEE/ASME Transactions on Mechatronics,2026,article,robotics,3,28.0,28.0,50.20033955857386,28,41.6958,True,True,post,99.54617622107328,landmark,True | 293 | +4398796510,10.1109/tnnls.2025.3650584,2405.14093,A Survey on Vision--Language--Action Models for Embodied AI,IEEE Transactions on Neural Networks and Learning Systems,2026,article,robotics,10,36.0,36.0,96.49320091673033,36,77.9076,True,True,post,asurveyonvisionlanguageactionmodelsforembodiedai,91.27693483887218,landmark,True | ||
| 294 | −4385430674,10.15607/rss.2023.xix.016,2304.13705,Learning Fine-Grained Bimanual Manipulation with Low-Cost Hardware,,2023,conference-paper,robotics,6,86.0,395.0,97.36541727556381,649,291.7396,True,True,post,97.36541727556381,landmark,True | 294 | +4385403811,10.15607/rss.2023.xix.026,,Diffusion Policy: Visuomotor Policy Learning via Action Diffusion,,2023,conference-paper,robotics,2,113.0,387.0,89.24929343211716,522,98.6756,False,True,post,diffusionpolicyvisuomotorpolicylearningviaactiondiffusion,89.24929343211716,landmark,True | ||
| 295 | −4406918931,10.1186/s44147-025-00582-3,,"UAV swarms: research, challenges, and future directions",Journal of Engineering and Applied Science,2025,article,robotics,1,182.0,182.0,69.22742920177257,182,80.227,True,True,post,92.13911158728078,landmark,True | 295 | +2925329277,10.23919/ecc.2019.8796030,1903.11199,Control Barrier Functions: Theory and Applications,European Control Conference (ECC),2019,conference-paper,robotics,2,90.0,265.0,87.20226791818132,1936,124.0197,True,True,baseline,controlbarrierfunctionstheoryandapplications,87.20226791818132,landmark,True | ||
| 296 | −2923943538,10.14711/thesis-991012769067103412,,FIESTA : fast incremental euclidean distance fields for online motion planning of aerial robots,,2019,dissertation,robotics,3,5.0,12.0,91.15966386554621,15,,True,False,baseline,91.15966386554621,landmark,True | 296 | +4388761637,10.17760/d20592696,2308.13972,Towards autonomous multi-modal mobility morphobot (M4) robot: traversability estimation and 3D path planning,,2023,dissertation,robotics,4,1.0,4.0,86.35051546391752,4,,True,True,post,towardsautonomousmultimodalmobilitymorphobotm4robottraversabilityestimationand3dpathplanning,86.35051546391752,landmark,True | ||
| 297 | −4385403811,10.15607/rss.2023.xix.026,,Diffusion Policy: Visuomotor Policy Learning via Action Diffusion,,2023,conference-paper,robotics,2,113.0,387.0,89.24929343211716,522,98.6756,False,True,post,89.24929343211716,landmark,True | 297 | +3129245057,10.1109/iros45743.2020.9341176,2007.00258,LIO-SAM: Tightly-coupled Lidar Inertial Odometry via Smoothing and Mapping,IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS),2020,conference-paper,robotics,4,136.0,357.0,83.05667731629394,2199,295.3223,True,True,baseline,liosamtightlycoupledlidarinertialodometryviasmoothingandmapping,83.05667731629394,landmark,True | ||
| 298 | −7152514513,10.1016/j.asoc.2026.115169,,Cooperative 4D trajectory planning for multi aerial vehicles combining receding horizon optimization and differential evolution algorithm in dynamic battlefield environment,Applied Soft Computing,2026,article,robotics,3,25.0,25.0,27.82003829717675,25,90.3155,True,True,post,88.88051448310114,landmark,True | 298 | +4390874280,10.1109/iccv51070.2023.00280,2212.04088,LLM-Planner: Few-Shot Grounded Planning for Embodied Agents with Large Language Models,IEEE/CVF International Conference on Computer Vision (ICCV),2023,conference-paper,robotics,9,133.0,329.0,81.09676527508987,420,188.7991,True,True,post,llmplannerfewshotgroundedplanningforembodiedagentswithlargelanguagemodels,81.09676527508987,landmark,True | ||
| 299 | −7123353670,10.1109/tase.2026.3653476,,Trajectory Planning Method for Fracture Reduction of Parallel Robots Based on DMP and APF,IEEE Transactions on Automation Science and Engineering,2026,article,robotics,1,25.0,25.0,27.692946058091287,25,69.497,True,False,post,88.88051448310114,landmark,True | 299 | +4406918931,10.1186/s44147-025-00582-3,,"UAV swarms: research, challenges, and future directions",Journal of Engineering and Applied Science,2025,article,robotics,1,182.0,182.0,69.22742920177257,182,80.227,True,True,post,uavswarmsresearchchallengesandfuturedirections,79.52882531389552,landmark,True | ||
| 300 | −2925329277,10.23919/ecc.2019.8796030,1903.11199,Control Barrier Functions: Theory and Applications,European Control Conference (ECC),2019,conference-paper,robotics,2,90.0,265.0,87.20226791818132,1936,124.0197,True,True,baseline,87.20226791818132,landmark,True | 300 | +2758237641,10.1109/icra.2018.8460875,,Using Simulation and Domain Adaptation to Improve Efficiency of Deep Robotic Grasping,Proceedings - IEEE International Conference on Robotics and Automation/Proceedings,2018,conference-paper,robotics,3,152.0,260.0,74.52479641098161,609,130.2781,True,True,baseline,usingsimulationanddomainadaptationtoimproveefficiencyofdeeproboticgrasping,74.52479641098161,landmark,True | ||
| 301 | −4388761637,10.17760/d20592696,2308.13972,Towards autonomous multi-modal mobility morphobot (M4) robot: traversability estimation and 3D path planning,,2023,dissertation,robotics,4,1.0,4.0,86.35051546391752,4,,True,True,post,86.35051546391752,landmark,True | 301 | +7140452175,10.1109/tmech.2025.3579247,2501.02116,"Humanoid Locomotion and Manipulation: Current Progress and Challenges in Control, Planning, and Learning",IEEE/ASME Transactions on Mechatronics,2026,article,robotics,3,28.0,28.0,50.20033955857386,28,41.6958,True,True,post,humanoidlocomotionandmanipulationcurrentprogressandchallengesincontrolplanningandlearning,70.99317154134503,landmark,True | ||
| 302 | −4399978538,10.3390/diagnostics14131333,,Exploring Augmented Reality Integration in Diagnostic Imaging: Myth or Reality?,Diagnostics,2024,dissertation,hci,3,35.0,60.0,658.2127659574469,60,,True,True,post,658.2127659574469,landmark,True | 302 | +4399978538,10.3390/diagnostics14131333,,Exploring Augmented Reality Integration in Diagnostic Imaging: Myth or Reality?,Diagnostics,2024,dissertation,hci,3,35.0,60.0,658.2127659574469,60,,True,True,post,exploringaugmentedrealityintegrationindiagnosticimagingmythorreality,658.2127659574469,landmark,True | ||
| 303 | −4414820664,10.21203/rs.3.rs-8148142/v1,2503.17473,How AI and Human Behaviors Shape Psychosocial Effects of Extended Chatbot Use: A Longitudinal Randomized Controlled Study,Research Square,2026,preprint,hci,2,97.0,97.0,632.2017543859649,97,,False,True,post,344.8563961944324,landmark,True | 303 | +2518959197,10.25335/nw4q-va87,,Cybersickness prioritization and modeling,Michigan State University Libraries,2024,dissertation,hci,2,23.0,23.0,291.2096774193549,23,,False,True,post,cybersicknessprioritizationandmodeling,291.2096774193549,landmark,True | ||
| 304 | −2518959197,10.25335/nw4q-va87,,Cybersickness prioritization and modeling,Michigan State University Libraries,2024,dissertation,hci,2,23.0,23.0,291.2096774193549,23,,False,True,post,291.2096774193549,landmark,True | 304 | +4387835442,10.1145/3586183.3606763,2304.03442,Generative Agents: Interactive Simulacra of Human Behavior,ACM Symposium on User Interface Software and Technology (UIST),2023,conference-paper,hci,6,466.0,1188.0,273.9745751869643,2048,387.1409,True,True,post,generativeagentsinteractivesimulacraofhumanbehavior,273.9745751869643,landmark,True | ||
| 305 | −4387835442,10.1145/3586183.3606763,2304.03442,Generative Agents: Interactive Simulacra of Human Behavior,ACM Symposium on User Interface Software and Technology (UIST),2023,conference-paper,hci,6,466.0,1188.0,273.9745751869643,2048,387.1409,True,True,post,273.9745751869643,landmark,True | 305 | +4404112583,10.1561/1100000095,2110.05352,"All One Needs to Know about Metaverse: A Complete Survey on Technological Singularity, Virtual Ecosystem, and Research Agenda",Foundations and Trends® in Human–Computer Interaction,2024,article,hci,7,1016.0,1085.0,265.27941176470586,1082,154.4433,True,True,baseline,alloneneedstoknowaboutmetaverseacompletesurveyontechnologicalsingularityvirtualecosystemandresearchagenda,265.27941176470586,landmark,True | ||
| 306 | −4286221734,10.17918/00001117,,Human-computer interaction,,2022,dissertation,hci,2,3.0,3.0,267.6,8,,True,True,baseline,267.6,landmark,True | 306 | +4294891500,10.1109/comst.2022.3202047,2203.02662,"A Survey on Metaverse: Fundamentals, Security, and Privacy",IEEE Communications Surveys & Tutorials,2022,article,hci,7,568.0,1062.0,261.00875052618636,1575,347.0709,True,True,baseline,asurveyonmetaversefundamentalssecurityandprivacy,261.00875052618636,landmark,True | ||
| 307 | −4404112583,10.1561/1100000095,2110.05352,"All One Needs to Know about Metaverse: A Complete Survey on Technological Singularity, Virtual Ecosystem, and Research Agenda",Foundations and Trends® in Human–Computer Interaction,2024,article,hci,7,1016.0,1085.0,265.27941176470586,1082,154.4433,True,True,baseline,265.27941176470586,landmark,True | 307 | +2910064571,10.1007/978-3-319-96906-0_6,,A Practical Guide to Usability Testing,Springer eBooks,2019,book-chapter,hci,1,301.0,354.0,258.125,659,109.4298,False,False,baseline,apracticalguidetousabilitytesting,258.125,landmark,True | ||
| 308 | −4294891500,10.1109/comst.2022.3202047,2203.02662,"A Survey on Metaverse: Fundamentals, Security, and Privacy",IEEE Communications Surveys & Tutorials,2022,article,hci,7,568.0,1062.0,261.00875052618636,1575,347.0709,True,True,baseline,261.00875052618636,landmark,True | 308 | +2915602850,,,"Memes, Communities and Continuous Change: Chinese Internet Vernacular Explained",Data Archiving and Networked Services (DANS),2021,dissertation,hci,1,37.0,38.0,249.76068376068378,39,,False,True,baseline,memescommunitiesandcontinuouschangechineseinternetvernacularexplained,249.76068376068378,landmark,True | ||
| 309 | −2910064571,10.1007/978-3-319-96906-0_6,,A Practical Guide to Usability Testing,Springer eBooks,2019,book-chapter,hci,1,301.0,354.0,258.125,659,109.4298,False,False,baseline,258.125,landmark,True | 309 | +4414820664,10.21203/rs.3.rs-8148142/v1,2503.17473,How AI and Human Behaviors Shape Psychosocial Effects of Extended Chatbot Use: A Longitudinal Randomized Controlled Study,Research Square,2026,preprint,hci,2,97.0,97.0,632.2017543859649,97,,False,True,post,howaiandhumanbehaviorsshapepsychosocialeffectsofextendedchatbotusealongitudinalrandomizedcontrolledstudy,245.94062998251673,landmark,True | ||
| 310 | −4409885395,10.1145/3706598.3713778,,The Impact of Generative AI on Critical Thinking: Self-Reported Reductions in Cognitive Effort and Confidence Effects From a Survey of Knowledge Workers,CHI Conference on Human Factors in Computing Systems,2025,conference-paper,hci,3,502.0,502.0,162.5548189699133,502,530.8542,True,True,post,254.1419451473349,landmark,True | 310 | +4285585446,10.1016/j.ijinfomgt.2022.102542,,"Metaverse beyond the hype: Multidisciplinary perspectives on emerging challenges, opportunities, and agenda for research, practice and policy",International Journal of Information Management,2022,article,hci,2,787.0,1634.0,245.39307870858832,2732,283.5672,True,True,baseline,metaversebeyondthehypemultidisciplinaryperspectivesonemergingchallengesopportunitiesandagendaforresearchpracticeandpolicy,245.39307870858832,landmark,True | ||
| 311 | −2915602850,,,"Memes, Communities and Continuous Change: Chinese Internet Vernacular Explained",Data Archiving and Networked Services (DANS),2021,dissertation,hci,1,37.0,38.0,249.76068376068378,39,,False,True,baseline,249.76068376068378,landmark,True | 311 | +4409885395,10.1145/3706598.3713778,,The Impact of Generative AI on Critical Thinking: Self-Reported Reductions in Cognitive Effort and Confidence Effects From a Survey of Knowledge Workers,CHI Conference on Human Factors in Computing Systems,2025,conference-paper,hci,3,502.0,502.0,162.5548189699133,502,530.8542,True,True,post,theimpactofgenerativeaioncriticalthinkingselfreportedreductionsincognitiveeffortandconfidenceeffectsfromasurveyofknowledgeworkers,219.35972696470085,landmark,True | ||
| 312 | −4285585446,10.1016/j.ijinfomgt.2022.102542,,"Metaverse beyond the hype: Multidisciplinary perspectives on emerging challenges, opportunities, and agenda for research, practice and policy",International Journal of Information Management,2022,article,hci,2,787.0,1634.0,245.39307870858832,2732,283.5672,True,True,baseline,245.39307870858832,landmark,True | 312 | +2308543850,10.17615/cd1t-9y62,,Scene-motion- and latency-perception thresholds for head-mounted displays,Carolina Digital Repository (University of North Carolina at Chapel Hill),2019,dissertation,hci,2,25.0,26.0,195.9915254237288,30,,True,True,baseline,scenemotionandlatencyperceptionthresholdsforheadmounteddisplays,195.9915254237288,landmark,True | ||
| 313 | −2308543850,10.17615/cd1t-9y62,,Scene-motion- and latency-perception thresholds for head-mounted displays,Carolina Digital Repository (University of North Carolina at Chapel Hill),2019,dissertation,hci,2,25.0,26.0,195.9915254237288,30,,True,True,baseline,195.9915254237288,landmark,True | 313 | +4206484811,10.1109/access.2021.3140175,,"A Metaverse: Taxonomy, Components, Applications, and Open Challenges",IEEE Access,2022,article,hci,1,791.0,1282.0,192.52994302595485,1824,197.5614,True,True,baseline,ametaversetaxonomycomponentsapplicationsandopenchallenges,192.52994302595485,landmark,True | ||
| 314 | −4206484811,10.1109/access.2021.3140175,,"A Metaverse: Taxonomy, Components, Applications, and Open Challenges",IEEE Access,2022,article,hci,1,791.0,1282.0,192.52994302595485,1824,197.5614,True,True,baseline,192.52994302595485,landmark,True | 314 | +4404301029,10.32604/cmc.2024.055575,,The Metaverse Review: Exploring the Boundless Ream of Digital Reality,"Computers, materials & continua/Computers, materials & continua (Print)",2024,dissertation,hci,2,11.0,15.0,189.9193548387097,15,,True,True,post,themetaversereviewexploringtheboundlessreamofdigitalreality,189.9193548387097,landmark,True | ||
| 315 | −4404301029,10.32604/cmc.2024.055575,,The Metaverse Review: Exploring the Boundless Ream of Digital Reality,"Computers, materials & continua/Computers, materials & continua (Print)",2024,dissertation,hci,2,11.0,15.0,189.9193548387097,15,,True,True,post,189.9193548387097,landmark,True | 315 | +4402988539,10.3390/info15100596,2309.10892,Artificial Intelligence-Enabled Intelligent Assistant for Personalized and Adaptive Learning in Higher Education,Information,2024,article,hci,3,379.0,597.0,179.74180185270544,597,226.9308,True,True,post,artificialintelligenceenabledintelligentassistantforpersonalizedandadaptivelearninginhighereducation,179.74180185270544,landmark,True | ||
| 316 | −4402988539,10.3390/info15100596,2309.10892,Artificial Intelligence-Enabled Intelligent Assistant for Personalized and Adaptive Learning in Higher Education,Information,2024,article,hci,3,379.0,597.0,179.74180185270544,597,226.9308,True,True,post,179.74180185270544,landmark,True | 316 | +4404826297,10.1080/10447318.2024.2431761,2303.13534,Prompting AI Art: An Investigation into the Creative Skill of Prompt Engineering,International Journal of Human-Computer Interaction,2024,article,hci,4,134.0,237.0,169.09230306674684,237,201.8338,True,True,post,promptingaiartaninvestigationintothecreativeskillofpromptengineering,169.09230306674684,landmark,True | ||
| 317 | −4404826297,10.1080/10447318.2024.2431761,2303.13534,Prompting AI Art: An Investigation into the Creative Skill of Prompt Engineering,International Journal of Human-Computer Interaction,2024,article,hci,4,134.0,237.0,169.09230306674684,237,201.8338,True,True,post,169.09230306674684,landmark,True | 317 | +4402128637,10.1080/0144929x.2024.2394886,,The promise and challenges of generative AI in education,Behaviour and Information Technology,2024,article,hci,3,193.0,515.0,155.05364816439413,515,197.0815,True,True,post,thepromiseandchallengesofgenerativeaiineducation,155.05364816439413,landmark,True | ||
| 318 | −4402128637,10.1080/0144929x.2024.2394886,,The promise and challenges of generative AI in education,Behaviour and Information Technology,2024,article,hci,3,193.0,515.0,155.05364816439413,515,197.0815,True,True,post,155.05364816439413,landmark,True | 318 | +4366548330,10.1145/3544548.3581388,,Why Johnny Can’t Prompt: How Non-AI Experts Try (and Fail) to Design LLM Prompts,CHI Conference on Human Factors in Computing Systems,2023,conference-paper,hci,4,330.0,657.0,151.5162423382454,902,170.5083,True,True,post,whyjohnnycantprompthownonaiexpertstryandfailtodesignllmprompts,151.5162423382454,landmark,True | ||
| 319 | −4366548330,10.1145/3544548.3581388,,Why Johnny Can’t Prompt: How Non-AI Experts Try (and Fail) to Design LLM Prompts,CHI Conference on Human Factors in Computing Systems,2023,conference-paper,hci,4,330.0,657.0,151.5162423382454,902,170.5083,True,True,post,151.5162423382454,landmark,True | 319 | +4403637324,10.1038/s41562-024-02004-5,2408.12143,Promises and challenges of generative artificial intelligence for human learning,Nature Human Behaviour,2024,article,hci,2,213.0,483.0,145.41924672505314,483,184.453,False,True,post,promisesandchallengesofgenerativeartificialintelligenceforhumanlearning,145.41924672505314,landmark,True | ||
| 320 | −4403637324,10.1038/s41562-024-02004-5,2408.12143,Promises and challenges of generative artificial intelligence for human learning,Nature Human Behaviour,2024,article,hci,2,213.0,483.0,145.41924672505314,483,184.453,False,True,post,145.41924672505314,landmark,True | 320 | +4392772072,10.30574/gscarr.2024.18.2.0062,,AI in education: A review of personalized learning and educational technology,GSC Advanced Research and Reviews,2024,article,hci,4,285.0,425.0,127.9568941162476,425,162.6401,True,True,post,aiineducationareviewofpersonalizedlearningandeducationaltechnology,127.9568941162476,landmark,True | ||
| 321 | −4408943584,10.3389/feduc.2025.1562391,,"Digital learning in the 21st century: trends, challenges, and innovations in technology integration",Frontiers in Education,2025,article,hci,2,274.0,274.0,237.88706394470083,274,299.3436,True,True,post,138.71492623579633,landmark,True | 321 | +4392239564,10.1080/03075079.2024.2323593,,Human-AI collaboration patterns in AI-assisted academic writing,Studies in Higher Education,2024,article,hci,3,198.0,423.0,127.35474402628878,423,161.8747,True,True,post,humanaicollaborationpatternsinaiassistedacademicwriting,127.35474402628878,landmark,True | ||
| 322 | −4392772072,10.30574/gscarr.2024.18.2.0062,,AI in education: A review of personalized learning and educational technology,GSC Advanced Research and Reviews,2024,article,hci,4,285.0,425.0,127.9568941162476,425,162.6401,True,True,post,127.9568941162476,landmark,True | 322 | +3102008235,10.17863/cam.56608,,"Addressing Injustices through MOOCs: A study among peri-urban, marginalised, South African youth",Apollo (University of Cambridge),2020,dissertation,hci,2,0.0,22.0,125.7948717948718,29,,True,True,baseline,addressinginjusticesthroughmoocsastudyamongperiurbanmarginalisedsouthafricanyouth,125.7948717948718,landmark,True | ||
| 323 | −4392239564,10.1080/03075079.2024.2323593,,Human-AI collaboration patterns in AI-assisted academic writing,Studies in Higher Education,2024,article,hci,3,198.0,423.0,127.35474402628878,423,161.8747,True,True,post,127.35474402628878,landmark,True | 323 | +4405586205,10.1016/j.caeai.2024.100348,2405.11800,Generative AI in higher education: A global perspective of institutional adoption policies and guidelines,Computers and Education Artificial Intelligence,2024,article,hci,3,149.0,415.0,124.94614366645354,415,158.8133,True,True,post,generativeaiinhighereducationaglobalperspectiveofinstitutionaladoptionpoliciesandguidelines,124.94614366645354,landmark,True | ||
| 324 | −3102008235,10.17863/cam.56608,,"Addressing Injustices through MOOCs: A study among peri-urban, marginalised, South African youth",Apollo (University of Cambridge),2020,dissertation,hci,2,0.0,22.0,125.7948717948718,29,,True,True,baseline,125.7948717948718,landmark,True | 324 | +3207138404,10.1145/3474085.3479238,2108.08985,Metaverse for Social Good,ACM International Conference on Multimedia (ACM MM),2021,conference-paper,hci,4,174.0,468.0,123.76423282498897,832,125.6356,True,True,baseline,metaverseforsocialgood,123.76423282498897,landmark,True | ||
| 325 | −4405586205,10.1016/j.caeai.2024.100348,2405.11800,Generative AI in higher education: A global perspective of institutional adoption policies and guidelines,Computers and Education Artificial Intelligence,2024,article,hci,3,149.0,415.0,124.94614366645354,415,158.8133,True,True,post,124.94614366645354,landmark,True | 325 | +4408943584,10.3389/feduc.2025.1562391,,"Digital learning in the 21st century: trends, challenges, and innovations in technology integration",Frontiers in Education,2025,article,hci,2,274.0,274.0,237.88706394470083,274,299.3436,True,True,post,digitallearninginthe21stcenturytrendschallengesandinnovationsintechnologyintegration,119.73020953850207,landmark,True | ||
| 326 | −3207138404,10.1145/3474085.3479238,2108.08985,Metaverse for Social Good,ACM International Conference on Multimedia (ACM MM),2021,conference-paper,hci,4,174.0,468.0,123.76423282498897,832,125.6356,True,True,baseline,123.76423282498897,landmark,True | 326 | +4377235537,10.1109/jiot.2023.3278329,,"A Survey on the Metaverse: The State-of-the-Art, Technologies, Applications, and Challenges",IEEE Internet of Things Journal,2023,article,hci,1,393.0,633.0,119.44364807995791,716,119.1015,True,False,post,asurveyonthemetaversethestateofthearttechnologiesapplicationsandchallenges,119.44364807995791,landmark,True | ||
| 327 | −2964015378,10.4230/lipics.ecoop.2025.6,,Detecting Functionality-Specific Vulnerabilities via Retrieving Individual Functionality-Equivalent APIs in Open-Source Repositories,Leibniz international proceedings in informatics,2025,conference-paper,software_engineering,3,15245.0,15245.0,11583.902021240152,15246,2196.5447,True,True,post,7717.916242571953,landmark,True | 327 | +2964015378,10.4230/lipics.ecoop.2025.6,,Detecting Functionality-Specific Vulnerabilities via Retrieving Individual Functionality-Equivalent APIs in Open-Source Repositories,Leibniz international proceedings in informatics,2025,conference-paper,software_engineering,3,15245.0,15245.0,11583.902021240152,15246,2196.5447,True,True,post,detectingfunctionalityspecificvulnerabilitiesviaretrievingindividualfunctionalityequivalentapisinopensourcerepositories,6661.631548957897,landmark,True | ||
| 328 | −4293846201,10.4230/oasics.saia.2024.1,,On Assessing ML Model Robustness: A Methodological Framework (Academic Track),OASIcs : OpenAccess Series in Informatics,2025,conference-paper,software_engineering,4,4701.0,4701.0,4178.076566446758,4702,904.6849,True,True,post,2379.92287676817,landmark,True | 328 | +4293846201,10.4230/oasics.saia.2024.1,,On Assessing ML Model Robustness: A Methodological Framework (Academic Track),OASIcs : OpenAccess Series in Informatics,2025,conference-paper,software_engineering,4,4701.0,4701.0,4178.076566446758,4702,904.6849,True,True,post,onassessingmlmodelrobustnessamethodologicalframeworkacademictrack,2054.203339563862,landmark,True | ||
| 329 | −2095152777,10.7551/mitpress/12274.003.0035,,Managing the Development of Large Software Systems (1970),The MIT Press eBooks,2021,book-chapter,software_engineering,1,939.0,970.0,750.7662588538313,1778,102.1417,True,False,baseline,750.7662588538313,landmark,True | 329 | +2095152777,10.7551/mitpress/12274.003.0035,,Managing the Development of Large Software Systems (1970),The MIT Press eBooks,2021,book-chapter,software_engineering,1,939.0,970.0,750.7662588538313,1778,102.1417,True,False,baseline,managingthedevelopmentoflargesoftwaresystems1970,750.7662588538313,landmark,True | ||
| 330 | −2911537985,,,Microservices vs. Service-oriented architecture,Aaltodoc (Aalto University),2018,dissertation,software_engineering,2,50.0,67.0,685.3986866791745,93,,False,False,baseline,685.3986866791745,landmark,True | 330 | +2911537985,,,Microservices vs. Service-oriented architecture,Aaltodoc (Aalto University),2018,dissertation,software_engineering,2,50.0,67.0,685.3986866791745,93,,False,False,baseline,microservicesvsserviceorientedarchitecture,685.3986866791745,landmark,True | ||
| 331 | −1486172410,10.1017/9781108974073.004,,Introduction to Software Testing,Cambridge University Press eBooks,2021,book-chapter,software_engineering,1,869.0,871.0,549.1255565449688,1056,136.0795,True,False,baseline,549.1255565449688,landmark,True | 331 | +1486172410,10.1017/9781108974073.004,,Introduction to Software Testing,Cambridge University Press eBooks,2021,book-chapter,software_engineering,1,869.0,871.0,549.1255565449688,1056,136.0795,True,False,baseline,introductiontosoftwaretesting,549.1255565449688,landmark,True | ||
| 332 | −7151510318,10.70675/416f6582z4576z444eza710z5e930d59bf97,,Unsupervised Translation of Programming Languages,,2022,dissertation,software_engineering,3,51.0,56.0,485.7543859649123,1,,True,False,baseline,485.7543859649123,landmark,True | 332 | +7151510318,10.70675/416f6582z4576z444eza710z5e930d59bf97,,Unsupervised Translation of Programming Languages,,2022,dissertation,software_engineering,3,51.0,56.0,485.7543859649123,1,,True,False,baseline,unsupervisedtranslationofprogramminglanguages,485.7543859649123,landmark,True | ||
| 333 | −4391974543,10.1109/tse.2024.3368208,2307.07221,"Software Testing With Large Language Models: Survey, Landscape, and Vision",IEEE Transactions on Software Engineering,2024,article,software_engineering,3,351.0,554.0,439.6107042253521,554,579.8344,True,True,post,439.6107042253521,landmark,True | 333 | +4391974543,10.1109/tse.2024.3368208,2307.07221,"Software Testing With Large Language Models: Survey, Landscape, and Vision",IEEE Transactions on Software Engineering,2024,article,software_engineering,3,351.0,554.0,439.6107042253521,554,579.8344,True,True,post,softwaretestingwithlargelanguagemodelssurveylandscapeandvision,439.6107042253521,landmark,True | ||
| 334 | −3185223169,,,An Effort Estimation Model for Agile Software Development,,2020,dissertation,software_engineering,1,36.0,45.0,423.2192575406032,60,,False,False,baseline,423.2192575406032,landmark,True | 334 | +3185223169,,,An Effort Estimation Model for Agile Software Development,,2020,dissertation,software_engineering,1,36.0,45.0,423.2192575406032,60,,False,False,baseline,aneffortestimationmodelforagilesoftwaredevelopment,423.2192575406032,landmark,True | ||
| 335 | −2171139698,10.22024/unikent/01.02.86353,,Test data generation: two evolutionary approaches to mutation testing,Kent Academic Repository (University of Kent),2021,dissertation,software_engineering,1,19.0,19.0,394.8918918918919,24,,True,True,baseline,394.8918918918919,landmark,True | 335 | +2171139698,10.22024/unikent/01.02.86353,,Test data generation: two evolutionary approaches to mutation testing,Kent Academic Repository (University of Kent),2021,dissertation,software_engineering,1,19.0,19.0,394.8918918918919,24,,True,True,baseline,testdatagenerationtwoevolutionaryapproachestomutationtesting,394.8918918918919,landmark,True | ||
| 336 | −7131867455,10.1287/mnsc.2025.00535,,The Effects of Generative AI on High-Skilled Work: Evidence from Three Field Experiments with Software Developers,Management Science,2026,article,software_engineering,2,97.0,97.0,689.140622972096,25,228.8208,True,False,post,344.8563961944324,landmark,True | 336 | +4402442491,10.5463/thesis.831,,From Smallest Software Particle to System Specification,,2024,dissertation,software_engineering,2,0.0,1.0,304.3333333333333,1,,True,True,post,fromsmallestsoftwareparticletosystemspecification,304.3333333333333,landmark,True | ||
| 337 | −4399452770,10.5753/compbr.2018.38.4541,,Engenharia de Software,Computação Brasil.,2018,article,software_engineering,1,503.0,611.0,323.9504225668329,1342,158.682,True,True,baseline,323.9504225668329,landmark,True | 337 | +4408219312,10.17760/d20705205,,Leveraging type annotations for effective fuzzing of python programs,,2024,dissertation,software_engineering,3,1.0,1.0,304.3333333333333,1,,True,False,post,leveragingtypeannotationsforeffectivefuzzingofpythonprograms,304.3333333333333,landmark,True | ||
| 338 | −4408219312,10.17760/d20705205,,Leveraging type annotations for effective fuzzing of python programs,,2024,dissertation,software_engineering,3,1.0,1.0,304.3333333333333,1,,True,False,post,304.3333333333333,landmark,True | 338 | +4403110951,10.32657/10356/179951,,Semantics-aware human-computer interaction software testing,,2024,dissertation,software_engineering,6,1.0,1.0,304.3333333333333,1,,True,True,post,semanticsawarehumancomputerinteractionsoftwaretesting,304.3333333333333,landmark,True | ||
| 339 | −4402442491,10.5463/thesis.831,,From Smallest Software Particle to System Specification,,2024,dissertation,software_engineering,2,0.0,1.0,304.3333333333333,1,,True,True,post,304.3333333333333,landmark,True | 339 | +3008797115,10.48550/arxiv.2002.12543,2002.12543,Metamorphic Testing: A New Approach for Generating Next Test Cases,arXiv (Cornell University),2020,preprint,software_engineering,1,246.0,292.0,286.17663817663816,448,,True,True,baseline,metamorphictestinganewapproachforgeneratingnexttestcases,286.17663817663816,landmark,True | ||
| 340 | −4403110951,10.32657/10356/179951,,Semantics-aware human-computer interaction software testing,,2024,dissertation,software_engineering,6,1.0,1.0,304.3333333333333,1,,True,True,post,304.3333333333333,landmark,True | 340 | +3177813494,10.4230/lipics.esem.2026.34,2107.03374,A Direction-Aware Study of LLM-Based Code Translation Across Eight Programming Languages,arXiv (Cornell University),2021,preprint,software_engineering,6,127.0,678.0,275.3873466752744,1430,,True,True,baseline,adirectionawarestudyofllmbasedcodetranslationacrosseightprogramminglanguages,275.3873466752744,landmark,True | ||
| 341 | −3008797115,10.48550/arxiv.2002.12543,2002.12543,Metamorphic Testing: A New Approach for Generating Next Test Cases,arXiv (Cornell University),2020,preprint,software_engineering,1,246.0,292.0,286.17663817663816,448,,True,True,baseline,286.17663817663816,landmark,True | 341 | +7131867455,10.1287/mnsc.2025.00535,,The Effects of Generative AI on High-Skilled Work: Evidence from Three Field Experiments with Software Developers,Management Science,2026,article,software_engineering,2,97.0,97.0,689.140622972096,25,228.8208,True,False,post,theeffectsofgenerativeaionhighskilledworkevidencefromthreefieldexperimentswithsoftwaredevelopers,245.94062998251673,landmark,True | ||
| 342 | −3177813494,10.4230/lipics.esem.2026.34,2107.03374,A Direction-Aware Study of LLM-Based Code Translation Across Eight Programming Languages,arXiv (Cornell University),2021,preprint,software_engineering,6,127.0,678.0,275.3873466752744,1430,,True,True,baseline,275.3873466752744,landmark,True | 342 | +7110046239,10.4230/oasics.icpec.2025.4,,Can Open Large Language Models Catch Vulnerabilities?,Repositório do ISCTE-IUL,2025,article,software_engineering,3,540.0,540.0,468.828520182987,1,1.0925,True,True,post,canopenlargelanguagemodelscatchvulnerabilities,235.96464653573398,landmark,True | ||
| 343 | −7110046239,10.4230/oasics.icpec.2025.4,,Can Open Large Language Models Catch Vulnerabilities?,Repositório do ISCTE-IUL,2025,article,software_engineering,3,540.0,540.0,468.828520182987,1,1.0925,True,True,post,273.37978163259135,landmark,True | 343 | +4391677389,10.17771/pucrio.acad.65972,,IDENTIFYING CONCERNS WHEN SPECIFYING MACHINE LEARNING-ENABLED SYSTEMS: A PERSPECTIVE-BASED APPROACH,,2023,dissertation,software_engineering,1,7.0,8.0,230.9189189189189,3,,True,True,post,identifyingconcernswhenspecifyingmachinelearningenabledsystemsaperspectivebasedapproach,230.9189189189189,landmark,True | ||
| 344 | −4391677389,10.17771/pucrio.acad.65972,,IDENTIFYING CONCERNS WHEN SPECIFYING MACHINE LEARNING-ENABLED SYSTEMS: A PERSPECTIVE-BASED APPROACH,,2023,dissertation,software_engineering,1,7.0,8.0,230.9189189189189,3,,True,True,post,230.9189189189189,landmark,True | 344 | +3007157104,10.1109/tse.2019.2962027,1906.10742,"Machine Learning Testing: Survey, Landscapes and Horizons",IEEE Transactions on Software Engineering,2020,article,software_engineering,4,245.0,385.0,227.48310158362304,888,240.8699,True,True,baseline,machinelearningtestingsurveylandscapesandhorizons,227.48310158362304,landmark,True | ||
| 345 | −7124592699,10.1007/s44443-025-00401-y,,MSTDP: a multi-scale temporal deep learning framework for just-in-time software defect prediction with cross-attention fusion,Journal of King Saud University - Computer and Information Sciences,2026,article,software_engineering,3,64.0,64.0,454.690720311486,64,585.7812,True,True,post,227.53411707673894,landmark,True | 345 | +58732440,10.22024/unikent/01.02.86458,,An exploration of novice compilation behaviour in BlueJ,Kent Academic Repository (University of Kent),2021,dissertation,software_engineering,3,59.0,60.0,226.01941747572815,61,,True,True,baseline,anexplorationofnovicecompilationbehaviourinbluej,226.01941747572815,landmark,True | ||
| 346 | −3007157104,10.1109/tse.2019.2962027,1906.10742,"Machine Learning Testing: Survey, Landscapes and Horizons",IEEE Transactions on Software Engineering,2020,article,software_engineering,4,245.0,385.0,227.48310158362304,888,240.8699,True,True,baseline,227.48310158362304,landmark,True | 346 | +2725449579,10.1016/bs.adcom.2018.03.015,,Mutation Testing Advances: An Analysis and Survey,Advances in computers,2018,book-chapter,software_engineering,1,63.0,129.0,223.78585461689588,425,230.7729,False,True,baseline,mutationtestingadvancesananalysisandsurvey,223.78585461689588,landmark,True | ||
| 347 | −58732440,10.22024/unikent/01.02.86458,,An exploration of novice compilation behaviour in BlueJ,Kent Academic Repository (University of Kent),2021,dissertation,software_engineering,3,59.0,60.0,226.01941747572815,61,,True,True,baseline,226.01941747572815,landmark,True | 347 | +4293212596,10.3847/1538-4357/ac7c74,,The Astropy Project : Sustaining and Growing a Community-oriented Open-source Project and the Latest Major Release (v5.0) of the Core Package*,Repository of the Academy's Library (Library of the Hungarian Academy of Sciences),2022,article,software_engineering,3,704.0,2029.0,209.06737313811422,5022,296.1452,True,True,baseline,theastropyprojectsustainingandgrowingacommunityorientedopensourceprojectandthelatestmajorreleasev50ofthecorepackage,209.06737313811422,landmark,True | ||
| 348 | −2725449579,10.1016/bs.adcom.2018.03.015,,Mutation Testing Advances: An Analysis and Survey,Advances in computers,2018,book-chapter,software_engineering,1,63.0,129.0,223.78585461689588,425,230.7729,False,True,baseline,223.78585461689588,landmark,True | 348 | +4381982883,10.3390/app13095783,,"ChatGPT for Education and Research: Opportunities, Threats, and Strategies",Applied Sciences,2023,article,software_engineering,3,547.0,885.0,207.4225616221095,1062,249.5576,True,True,post,chatgptforeducationandresearchopportunitiesthreatsandstrategies,207.4225616221095,landmark,True | ||
| 349 | −2962772482,10.1145/3236009,,A survey of methods for explaining black box models,ISTI Open Portal,2019,article,software_engineering,1,719.0,1432.0,217.74340797667946,5022,232.193,True,True,baseline,217.74340797667946,landmark,True | 349 | +2505871501,10.3139/9783446480537.002,,2 UML - Unified Modeling Language,Carl Hanser Verlag GmbH & Co. KG eBooks,2024,book-chapter,software_engineering,1,49.0,49.0,202.090395480226,186,0.0,True,True,post,2umlunifiedmodelinglanguage,202.090395480226,landmark,True | ||
| 350 | −4293212596,10.3847/1538-4357/ac7c74,,The Astropy Project : Sustaining and Growing a Community-oriented Open-source Project and the Latest Major Release (v5.0) of the Core Package*,Repository of the Academy's Library (Library of the Hungarian Academy of Sciences),2022,article,software_engineering,3,704.0,2029.0,209.06737313811422,5022,296.1452,True,True,baseline,209.06737313811422,landmark,True | 350 | +4281635063,10.33540/1197,,Evolution of Low-Code Platforms,,2022,dissertation,software_engineering,1,2.0,5.0,200.88235294117646,8,,True,True,baseline,evolutionoflowcodeplatforms,200.88235294117646,landmark,True | ||
| 351 | −4381982883,10.3390/app13095783,,"ChatGPT for Education and Research: Opportunities, Threats, and Strategies",Applied Sciences,2023,article,software_engineering,3,547.0,885.0,207.4225616221095,1062,249.5576,True,True,post,207.4225616221095,landmark,True | 351 | +2100209048,,,Static And Dynamic Reverse Engineering Techniques for Java Software Systems,Tampere University Institutional Repository (Tampere University),2019,dissertation,software_engineering,3,20.0,20.0,200.45167118337852,79,,True,True,baseline,staticanddynamicreverseengineeringtechniquesforjavasoftwaresystems,200.45167118337852,landmark,True | ||
| 352 | −2114444139,10.25946/26315761,,Innovation and Change in the Information Systems Curriculum of an Australian University:a Socio-Technical Perspective,Victoria University Research Repository (Victoria University),2024,dissertation,programming_languages,1,17.0,17.0,661.9925925925926,54,,True,True,post,661.9925925925926,landmark,True | 352 | +2114444139,10.25946/26315761,,Innovation and Change in the Information Systems Curriculum of an Australian University:a Socio-Technical Perspective,Victoria University Research Repository (Victoria University),2024,dissertation,programming_languages,1,17.0,17.0,661.9925925925926,54,,True,True,post,innovationandchangeintheinformationsystemscurriculumofanaustralianuniversityasociotechnicalperspective,661.9925925925926,landmark,True | ||
| 353 | −1844775953,10.82444/warw.33641182,,Metric domains for completeness,Warwick Research Archive Portal (University of Warwick),2026,dissertation,programming_languages,2,34.0,34.0,1040.594982078853,40,,True,True,post,120.87749969701756,landmark,True | 353 | +4396242417,10.1145/3649828,,Enhancing Static Analysis for Practical Bug Detection: An LLM-Integrated Approach,Proceedings of the ACM on Programming Languages,2024,article,programming_languages,4,83.0,148.0,117.44112676056338,148,155.4628,True,True,post,enhancingstaticanalysisforpracticalbugdetectionanllmintegratedapproach,117.44112676056338,landmark,True | ||
| 354 | −4396242417,10.1145/3649828,,Enhancing Static Analysis for Practical Bug Detection: An LLM-Integrated Approach,Proceedings of the ACM on Programming Languages,2024,article,programming_languages,4,83.0,148.0,117.44112676056338,148,155.4628,True,True,post,117.44112676056338,landmark,True | 354 | +2327217190,10.26190/unsworks/23844,,Verification of programs in virtual memory using separation logic,"UNSWorks (University of New South Wales, Sydney, Australia)",2022,dissertation,programming_languages,3,13.0,13.0,97.35745614035089,13,,True,True,baseline,verificationofprogramsinvirtualmemoryusingseparationlogic,97.35745614035089,landmark,True | ||
| 355 | −2327217190,10.26190/unsworks/23844,,Verification of programs in virtual memory using separation logic,"UNSWorks (University of New South Wales, Sydney, Australia)",2022,dissertation,programming_languages,3,13.0,13.0,97.35745614035089,13,,True,True,baseline,97.35745614035089,landmark,True | 355 | +1844775953,10.82444/warw.33641182,,Metric domains for completeness,Warwick Research Archive Portal (University of Warwick),2026,dissertation,programming_languages,2,34.0,34.0,1040.594982078853,40,,True,True,post,metricdomainsforcompleteness,86.2059940144904,landmark,True | ||
| 356 | −2491926874,10.26190/unsworks/17927,,Formal memory models for verifying C systems code,"UNSWorks (University of New South Wales, Sydney, Australia)",2022,dissertation,programming_languages,5,10.0,11.0,82.37938596491229,24,,True,True,baseline,82.37938596491229,landmark,True | 356 | +2491926874,10.26190/unsworks/17927,,Formal memory models for verifying C systems code,"UNSWorks (University of New South Wales, Sydney, Australia)",2022,dissertation,programming_languages,5,10.0,11.0,82.37938596491229,24,,True,True,baseline,formalmemorymodelsforverifyingcsystemscode,82.37938596491229,landmark,True | ||
| 357 | −4205342885,10.1007/s13132-021-00854-2,,The Futures of Europe: Society 5.0 and Industry 5.0 as Driving Forces of Future Universities,Journal of the Knowledge Economy,2022,article,programming_languages,1,171.0,334.0,82.08749781143715,572,117.4739,True,True,baseline,82.08749781143715,landmark,True | 357 | +4205342885,10.1007/s13132-021-00854-2,,The Futures of Europe: Society 5.0 and Industry 5.0 as Driving Forces of Future Universities,Journal of the Knowledge Economy,2022,article,programming_languages,1,171.0,334.0,82.08749781143715,572,117.4739,True,True,baseline,thefuturesofeuropesociety50andindustry50asdrivingforcesoffutureuniversities,82.08749781143715,landmark,True | ||
| 358 | −2189687801,10.7275/7408407.0,,General Program Synthesis from Examples Using Genetic Programming with Parent Selection Based on Random Lexicographic Orderings of Test Cases,Scholarworks (University of Massachusetts Amherst),2021,dissertation,programming_languages,3,18.0,18.0,81.87032967032967,18,,True,True,baseline,81.87032967032967,landmark,True | 358 | +2189687801,10.7275/7408407.0,,General Program Synthesis from Examples Using Genetic Programming with Parent Selection Based on Random Lexicographic Orderings of Test Cases,Scholarworks (University of Massachusetts Amherst),2021,dissertation,programming_languages,3,18.0,18.0,81.87032967032967,18,,True,True,baseline,generalprogramsynthesisfromexamplesusinggeneticprogrammingwithparentselectionbasedonrandomlexicographicorderingsoftestcases,81.87032967032967,landmark,True | ||
| 359 | −2400988715,10.48550/arxiv.2605.09524,2605.09524,Functional Stable Model Semantics and Answer Set Programming Modulo Theories,arXiv (Cornell University),2026,preprint,programming_languages,3,22.0,22.0,856.0701754385965,22,,True,True,post,78.21485274512901,landmark,True | 359 | +2796251079,10.1007/978-3-319-75844-2_6,,A Concise Introduction to Logic,Springer eBooks,2018,book-chapter,programming_languages,1,139.0,167.0,77.56442638324476,401,44.1726,False,False,baseline,aconciseintroductiontologic,77.56442638324476,landmark,True | ||
| 360 | −2796251079,10.1007/978-3-319-75844-2_6,,A Concise Introduction to Logic,Springer eBooks,2018,book-chapter,programming_languages,1,139.0,167.0,77.56442638324476,401,44.1726,False,False,baseline,77.56442638324476,landmark,True | 360 | +159920301,10.48456/tr-346,,On intuitionistic linear logic,OpenGrey (Institut de l'Information Scientifique et Technique),2021,dissertation,programming_languages,2,16.0,16.0,72.77362637362637,39,,True,True,baseline,onintuitionisticlinearlogic,72.77362637362637,landmark,True | ||
| 361 | −159920301,10.48456/tr-346,,On intuitionistic linear logic,OpenGrey (Institut de l'Information Scientifique et Technique),2021,dissertation,programming_languages,2,16.0,16.0,72.77362637362637,39,,True,True,baseline,72.77362637362637,landmark,True | 361 | +4389109635,10.5463/thesis.524,,A Unifying Theory for Graph Transformation,,2023,dissertation,programming_languages,3,2.0,2.0,69.63636363636364,2,,True,True,post,aunifyingtheoryforgraphtransformation,69.63636363636364,landmark,True | ||
| 362 | −4389109635,10.5463/thesis.524,,A Unifying Theory for Graph Transformation,,2023,dissertation,programming_languages,3,2.0,2.0,69.63636363636364,2,,True,True,post,69.63636363636364,landmark,True | 362 | +630549275,10.26190/unsworks/16534,,The clustered multikernel: an approach to formal verification of multiprocessor operating-system kernels,UNSWorks (UNSW Sydney),2022,dissertation,programming_languages,5,8.0,9.0,67.40131578947368,10,,True,True,baseline,theclusteredmultikernelanapproachtoformalverificationofmultiprocessoroperatingsystemkernels,67.40131578947368,landmark,True | ||
| 363 | −630549275,10.26190/unsworks/16534,,The clustered multikernel: an approach to formal verification of multiprocessor operating-system kernels,UNSWorks (UNSW Sydney),2022,dissertation,programming_languages,5,8.0,9.0,67.40131578947368,10,,True,True,baseline,67.40131578947368,landmark,True | 363 | +4403223258,10.1145/3689736,2310.15991,WhiteFox: White-Box Compiler Fuzzing Empowered by Large Language Models,Proceedings of the ACM on Programming Languages,2024,article,programming_languages,8,52.0,82.0,65.0687323943662,82,86.1348,True,True,post,whitefoxwhiteboxcompilerfuzzingempoweredbylargelanguagemodels,65.0687323943662,landmark,True | ||
| 364 | −4403223258,10.1145/3689736,2310.15991,WhiteFox: White-Box Compiler Fuzzing Empowered by Large Language Models,Proceedings of the ACM on Programming Languages,2024,article,programming_languages,8,52.0,82.0,65.0687323943662,82,86.1348,True,True,post,65.0687323943662,landmark,True | 364 | +4313480275,10.1007/978-3-031-21762-3_3,,Algorithmics: The Spirit of Computing,SpringerBriefs in computer science,2023,book-chapter,programming_languages,2,64.0,64.0,57.94535519125683,90,30.3187,False,False,post,algorithmicsthespiritofcomputing,57.94535519125683,landmark,True | ||
| 365 | −4313480275,10.1007/978-3-031-21762-3_3,,Algorithmics: The Spirit of Computing,SpringerBriefs in computer science,2023,book-chapter,programming_languages,2,64.0,64.0,57.94535519125683,90,30.3187,False,False,post,57.94535519125683,landmark,True | 365 | +2790202156,10.14722/ndss.2018.23082,,ZEUS: Analyzing Safety of Smart Contracts,Network and Distributed System Security Symposium,2018,conference-paper,programming_languages,5,94.0,191.0,56.63186311787072,702,60.5919,True,True,baseline,zeusanalyzingsafetyofsmartcontracts,56.63186311787072,landmark,True | ||
| 366 | −2790202156,10.14722/ndss.2018.23082,,ZEUS: Analyzing Safety of Smart Contracts,Network and Distributed System Security Symposium,2018,conference-paper,programming_languages,5,94.0,191.0,56.63186311787072,702,60.5919,True,True,baseline,56.63186311787072,landmark,True | 366 | +3207822760,10.33612/diss.168003240,,Computer programming skills: A cognitive perspective,,2021,dissertation,programming_languages,1,11.0,15.0,56.50485436893204,21,,True,True,baseline,computerprogrammingskillsacognitiveperspective,56.50485436893204,landmark,True | ||
| 367 | −3207822760,10.33612/diss.168003240,,Computer programming skills: A cognitive perspective,,2021,dissertation,programming_languages,1,11.0,15.0,56.50485436893204,21,,True,True,baseline,56.50485436893204,landmark,True | 367 | +2400988715,10.48550/arxiv.2605.09524,2605.09524,Functional Stable Model Semantics and Answer Set Programming Modulo Theories,arXiv (Cornell University),2026,preprint,programming_languages,3,22.0,22.0,856.0701754385965,22,,True,True,post,functionalstablemodelsemanticsandanswersetprogrammingmodulotheories,55.78034906819967,landmark,True | ||
| 368 | −4297611890,10.1017/9781108778756.017,,Subsystems of Second-Order Arithmetic,Cambridge University Press eBooks,2022,book-chapter,programming_languages,3,59.0,61.0,50.93184096224524,65,4.0902,True,False,baseline,50.93184096224524,landmark,True | 368 | +4297611890,10.1017/9781108778756.017,,Subsystems of Second-Order Arithmetic,Cambridge University Press eBooks,2022,book-chapter,programming_languages,3,59.0,61.0,50.93184096224524,65,4.0902,True,False,baseline,subsystemsofsecondorderarithmetic,50.93184096224524,landmark,True | ||
| 369 | −2915211782,10.1017/9781108654555.013,,Novice Programmers and Introductory Programming,Cambridge University Press eBooks,2019,book-chapter,programming_languages,1,11.0,45.0,45.68985849056604,175,59.7005,False,False,baseline,45.68985849056604,landmark,True | 369 | +2915211782,10.1017/9781108654555.013,,Novice Programmers and Introductory Programming,Cambridge University Press eBooks,2019,book-chapter,programming_languages,1,11.0,45.0,45.68985849056604,175,59.7005,False,False,baseline,noviceprogrammersandintroductoryprogramming,45.68985849056604,landmark,True | ||
| 370 | −4381516741,10.1007/978-3-031-22206-1_2,,The Python Programming Language,Springer eBooks,2023,book-chapter,programming_languages,2,70.0,82.0,45.335480407944175,96,25.4404,False,False,post,45.335480407944175,landmark,True | 370 | +4381516741,10.1007/978-3-031-22206-1_2,,The Python Programming Language,Springer eBooks,2023,book-chapter,programming_languages,2,70.0,82.0,45.335480407944175,96,25.4404,False,False,post,thepythonprogramminglanguage,45.335480407944175,landmark,True | ||
| 371 | −3115704172,,,Lineage-driven Fault Injection for Actor-based Programs,KTH Publication Database DiVA (KTH Royal Institute of Technology),2019,dissertation,programming_languages,3,2.0,2.0,42.74766355140187,2,,True,True,baseline,42.74766355140187,landmark,True | 371 | +3115704172,,,Lineage-driven Fault Injection for Actor-based Programs,KTH Publication Database DiVA (KTH Royal Institute of Technology),2019,dissertation,programming_languages,3,2.0,2.0,42.74766355140187,2,,True,True,baseline,lineagedrivenfaultinjectionforactorbasedprograms,42.74766355140187,landmark,True | ||
| 372 | −3146286581,,,Probabilistic Grammatical Evolution,Estudo Geral (Universidade de Coimbra),2021,dissertation,programming_languages,2,4.0,9.0,40.935164835164834,12,,True,True,baseline,40.935164835164834,landmark,True | 372 | +2797025890,10.13025/17505,,Openness and praxis: A situated study of academic staff meaning-making and decision-making with respect to openness and use of open educational practices in higher education,Arrow@dit (Dublin Institute of Technology),2018,dissertation,programming_languages,1,3.0,6.0,38.953125,12,,True,True,baseline,opennessandpraxisasituatedstudyofacademicstaffmeaningmakinganddecisionmakingwithrespecttoopennessanduseofopeneducationalpracticesinhighereducation,38.953125,landmark,True | ||
| 373 | −7134194765,10.1111/tgis.70218,,A Debris‐Flow Hazard Assessment Framework Based on an Improved AHP – CRITIC Method: A Case Study of Gaoling Gully,Transactions in GIS,2026,article,programming_languages,2,11.0,11.0,15.074074074074074,11,77.5749,True,False,post,39.107426372564504,landmark,True | 373 | +4396905794,10.17760/d20653005,,Predicting typeScript type annotations and definitions with machine learning,,2024,dissertation,programming_languages,3,0.0,1.0,38.94074074074074,1,,True,True,post,predictingtypescripttypeannotationsanddefinitionswithmachinelearning,38.94074074074074,landmark,True | ||
| 374 | −2797025890,10.13025/17505,,Openness and praxis: A situated study of academic staff meaning-making and decision-making with respect to openness and use of open educational practices in higher education,Arrow@dit (Dublin Institute of Technology),2018,dissertation,programming_languages,1,3.0,6.0,38.953125,12,,True,True,baseline,38.953125,landmark,True | 374 | +4415797413,10.52202/079017-2000,2312.07104,SGLang: Efficient Execution of Structured Language Model Programs,neural information processing systems,2024,conference-paper,programming_languages,11,13.0,132.0,36.69097472072476,132,40.1561,True,True,post,sglangefficientexecutionofstructuredlanguagemodelprograms,36.69097472072476,landmark,True | ||
| 375 | −4396905794,10.17760/d20653005,,Predicting typeScript type annotations and definitions with machine learning,,2024,dissertation,programming_languages,3,0.0,1.0,38.94074074074074,1,,True,True,post,38.94074074074074,landmark,True | 375 | +4410362977,10.1038/s41586-025-08984-2,,Emergence of Calabi–Yau manifolds in high-precision black-hole scattering,Nature,2025,article,programming_languages,1,74.0,74.0,30.45267489711934,74,33.8684,True,True,post,emergenceofcalabiyaumanifoldsinhighprecisionblackholescattering,32.33589600674873,landmark,True | ||
| 376 | −4410362977,10.1038/s41586-025-08984-2,,Emergence of Calabi–Yau manifolds in high-precision black-hole scattering,Nature,2025,article,programming_languages,1,74.0,74.0,30.45267489711934,74,33.8684,True,True,post,37.46315526076251,landmark,True | 376 | +4391175874,10.11606/d.45.2023.tde-17012024-190825,,VCAT: an automatic assessment model for visual programming languages,,2023,dissertation,programming_languages,5,1.0,1.0,32.09090909090909,1,,True,True,post,vcatanautomaticassessmentmodelforvisualprogramminglanguages,32.09090909090909,landmark,True | ||
| 377 | −3122286897,10.1109/cgo51591.2021.9370308,,MLIR: Scaling Compiler Infrastructure for Domain Specific Computation,IEEE/ACM International Symposium on Code Generation and Optimization (CGO),2021,conference-paper,compilers,4,74.0,155.0,42.480268473059475,541,52.9944,True,False,baseline,42.480268473059475,landmark,True | 377 | +3122286897,10.1109/cgo51591.2021.9370308,,MLIR: Scaling Compiler Infrastructure for Domain Specific Computation,IEEE/ACM International Symposium on Code Generation and Optimization (CGO),2021,conference-paper,compilers,4,74.0,155.0,42.480268473059475,541,52.9944,True,False,baseline,mlirscalingcompilerinfrastructurefordomainspecificcomputation,42.480268473059475,landmark,True | ||
| 378 | −4407983386,10.1016/j.energy.2025.135286,,Parallel TimesNet-BiLSTM model for ultra-short-term photovoltaic power forecasting using STL decomposition and auto-tuning,Energy,2025,article,compilers,1,83.0,83.0,28.27389289459036,83,34.5383,False,False,post,42.01948495463904,landmark,True | 378 | +4399087350,10.1007/978-3-031-56586-1_67,,E-learning and the Future of Business Education: The Case of GCC,"Studies in systems, decision and control",2024,book-chapter,compilers,1,25.0,61.0,39.77033011272142,61,44.6583,False,False,post,elearningandthefutureofbusinesseducationthecaseofgcc,39.77033011272142,landmark,True | ||
| 379 | −4399087350,10.1007/978-3-031-56586-1_67,,E-learning and the Future of Business Education: The Case of GCC,"Studies in systems, decision and control",2024,book-chapter,compilers,1,25.0,61.0,39.77033011272142,61,44.6583,False,False,post,39.77033011272142,landmark,True | 379 | +4398768423,10.1016/j.future.2024.05.034,2310.04963,LLM4VV: Developing LLM-driven testsuite for compiler validation,Future Generation Computer Systems,2024,article,compilers,5,36.0,48.0,38.08901408450704,48,50.4204,False,True,post,llm4vvdevelopingllmdriventestsuiteforcompilervalidation,38.08901408450704,landmark,True | ||
| 380 | −4398768423,10.1016/j.future.2024.05.034,2310.04963,LLM4VV: Developing LLM-driven testsuite for compiler validation,Future Generation Computer Systems,2024,article,compilers,5,36.0,48.0,38.08901408450704,48,50.4204,False,True,post,38.08901408450704,landmark,True | 380 | +4407983386,10.1016/j.energy.2025.135286,,Parallel TimesNet-BiLSTM model for ultra-short-term photovoltaic power forecasting using STL decomposition and auto-tuning,Energy,2025,article,compilers,1,83.0,83.0,28.27389289459036,83,34.5383,False,False,post,paralleltimesnetbilstmmodelforultrashorttermphotovoltaicpowerforecastingusingstldecompositionandautotuning,36.268640115677634,landmark,True | ||
| 381 | −2188794726,10.1007/978-3-319-91734-4_32,,Dynamic Dataflow Graphs,Springer eBooks,2018,book-chapter,compilers,2,25.0,25.0,35.799701046337816,26,8.9221,False,False,baseline,35.799701046337816,landmark,True | 381 | +2884622219,10.1039/c7np00064b,,"The value of universally available raw NMR data for transparency, reproducibility, and integrity in natural product research",Natural Product Reports,2018,article,compilers,1,25.0,51.0,27.040051638148082,122,28.5226,True,True,baseline,thevalueofuniversallyavailablerawnmrdatafortransparencyreproducibilityandintegrityinnaturalproductresearch,27.040051638148082,landmark,True | ||
| 382 | −4406882143,10.3389/fdgth.2025.1460167,,Beyond the current state of just-in-time adaptive interventions in mental health: a qualitative systematic review,Frontiers in Digital Health,2025,review,compilers,2,54.0,54.0,4.153846153846154,54,8.4784,True,True,post,27.337978163259134,landmark,True | 382 | +3188948186,10.48550/arxiv.2108.05450,2108.05450,Speed Control of DC Motor Using Fuzzy PID Controller,arXiv (Cornell University),2021,preprint,compilers,2,55.0,73.0,24.44561426312255,87,,True,True,baseline,speedcontrolofdcmotorusingfuzzypidcontroller,24.44561426312255,landmark,True | ||
| 383 | −2884622219,10.1039/c7np00064b,,"The value of universally available raw NMR data for transparency, reproducibility, and integrity in natural product research",Natural Product Reports,2018,article,compilers,1,25.0,51.0,27.040051638148082,122,28.5226,True,True,baseline,27.040051638148082,landmark,True | 383 | +4406882143,10.3389/fdgth.2025.1460167,,Beyond the current state of just-in-time adaptive interventions in mental health: a qualitative systematic review,Frontiers in Digital Health,2025,review,compilers,2,54.0,54.0,4.153846153846154,54,8.4784,True,True,post,beyondthecurrentstateofjustintimeadaptiveinterventionsinmentalhealthaqualitativesystematicreview,23.5964646535734,landmark,True | ||
| 384 | −3188948186,10.48550/arxiv.2108.05450,2108.05450,Speed Control of DC Motor Using Fuzzy PID Controller,arXiv (Cornell University),2021,preprint,compilers,2,55.0,73.0,24.44561426312255,87,,True,True,baseline,24.44561426312255,landmark,True | 384 | +2962724414,10.1109/jproc.2018.2817118,,Machine Learning in Compiler Optimization,Proceedings of the IEEE,2018,article,compilers,4,25.0,64.0,22.34837655707576,193,27.4802,True,True,baseline,machinelearningincompileroptimization,22.34837655707576,landmark,True | ||
| 385 | −2962724414,10.1109/jproc.2018.2817118,,Machine Learning in Compiler Optimization,Proceedings of the IEEE,2018,article,compilers,4,25.0,64.0,22.34837655707576,193,27.4802,True,True,baseline,22.34837655707576,landmark,True | 385 | +4392397123,10.1016/j.ijer.2024.102326,,Evolution to revolution: Critical exploration of educators’ perceptions of the impact of Artificial Intelligence (AI) on the teaching and learning process in the GCC region,International Journal of Educational Research,2024,article,compilers,1,37.0,64.0,19.268802878681992,64,24.4917,False,True,post,evolutiontorevolutioncriticalexplorationofeducatorsperceptionsoftheimpactofartificialintelligenceaiontheteachingandlearningprocessinthegccregion,19.268802878681992,landmark,True | ||
| 386 | −4408711372,10.1109/tsg.2025.3553737,,A Progressive Polyhedral Approximation Method for Nonlinear PDE-Constrained Electricity-Water Nexus Dispatch,IEEE Transactions on Smart Grid,2025,article,compilers,3,39.0,39.0,8.943719676549865,39,8.8867,True,False,post,19.744095340131597,landmark,True | 386 | +2783614532,10.1145/3197978,1801.04405,A Survey on Compiler Autotuning using Machine Learning,ACM Computing Surveys,2018,article,compilers,5,21.0,55.0,19.205636103736982,233,25.7446,True,True,baseline,asurveyoncompilerautotuningusingmachinelearning,19.205636103736982,landmark,True | ||
| 387 | −4392397123,10.1016/j.ijer.2024.102326,,Evolution to revolution: Critical exploration of educators’ perceptions of the impact of Artificial Intelligence (AI) on the teaching and learning process in the GCC region,International Journal of Educational Research,2024,article,compilers,1,37.0,64.0,19.268802878681992,64,24.4917,False,True,post,19.268802878681992,landmark,True | 387 | +2206959660,10.58088/85wq-pw11,,Automatic selection of compiler optimizations using program characterization and machine learning,"Library, Museums and Press - UDSpace (University of Delaware)",2024,dissertation,compilers,5,1.0,1.0,19.080000000000002,1,,True,True,post,automaticselectionofcompileroptimizationsusingprogramcharacterizationandmachinelearning,19.080000000000002,landmark,True | ||
| 388 | −2783614532,10.1145/3197978,1801.04405,A Survey on Compiler Autotuning using Machine Learning,ACM Computing Surveys,2018,article,compilers,5,21.0,55.0,19.205636103736982,233,25.7446,True,True,baseline,19.205636103736982,landmark,True | 388 | +2249134499,10.58088/vbbd-jy30,,Improving compiler optimizations using machine learning,"Library, Museums and Press - UDSpace (University of Delaware)",2024,dissertation,compilers,8,1.0,1.0,19.080000000000002,1,,True,True,post,improvingcompileroptimizationsusingmachinelearning,19.080000000000002,landmark,True | ||
| 389 | −2206959660,10.58088/85wq-pw11,,Automatic selection of compiler optimizations using program characterization and machine learning,"Library, Museums and Press - UDSpace (University of Delaware)",2024,dissertation,compilers,5,1.0,1.0,19.080000000000002,1,,True,True,post,19.080000000000002,landmark,True | 389 | +3214427835,,,Sparse tensor algebra compilation,DSpace@MIT (Massachusetts Institute of Technology),2020,dissertation,compilers,3,2.0,2.0,18.265060240963855,3,,True,True,baseline,sparsetensoralgebracompilation,18.265060240963855,landmark,True | ||
| 390 | −2249134499,10.58088/vbbd-jy30,,Improving compiler optimizations using machine learning,"Library, Museums and Press - UDSpace (University of Delaware)",2024,dissertation,compilers,8,1.0,1.0,19.080000000000002,1,,True,True,post,19.080000000000002,landmark,True | 390 | +3139485201,,,Towards automated construction of compiler optimizations,DSpace@MIT (Massachusetts Institute of Technology),2020,dissertation,compilers,5,2.0,2.0,18.265060240963855,3,,True,False,baseline,towardsautomatedconstructionofcompileroptimizations,18.265060240963855,landmark,True | ||
| 391 | −3139485201,,,Towards automated construction of compiler optimizations,DSpace@MIT (Massachusetts Institute of Technology),2020,dissertation,compilers,5,2.0,2.0,18.265060240963855,3,,True,False,baseline,18.265060240963855,landmark,True | 391 | +3023977240,10.7488/era/309,,From constraint programming to heterogeneous parallelism,ERA,2020,dissertation,compilers,8,0.0,2.0,18.265060240963855,2,,True,True,baseline,fromconstraintprogrammingtoheterogeneousparallelism,18.265060240963855,landmark,True | ||
| 392 | −3214427835,,,Sparse tensor algebra compilation,DSpace@MIT (Massachusetts Institute of Technology),2020,dissertation,compilers,3,2.0,2.0,18.265060240963855,3,,True,True,baseline,18.265060240963855,landmark,True | 392 | +3046781014,10.1007/978-3-030-47956-5_14,,ExaStencils: Advanced Multigrid Solver Generation,Lecture notes in computational science and engineering,2020,book-chapter,compilers,6,8.0,12.0,18.204255319148935,30,29.7428,True,True,baseline,exastencilsadvancedmultigridsolvergeneration,18.204255319148935,landmark,True | ||
| 393 | −3023977240,10.7488/era/309,,From constraint programming to heterogeneous parallelism,ERA,2020,dissertation,compilers,8,0.0,2.0,18.265060240963855,2,,True,True,baseline,18.265060240963855,landmark,True | 393 | +3132279601,10.1007/978-3-030-62066-0_12,,Coping with COVID-19: Higher Education in the GCC Countries,Springer proceedings in complexity,2021,conference-paper,compilers,1,23.0,37.0,17.288455680779773,43,37.049,False,False,baseline,copingwithcovid19highereducationinthegcccountries,17.288455680779773,landmark,True | ||
| 394 | −3046781014,10.1007/978-3-030-47956-5_14,,ExaStencils: Advanced Multigrid Solver Generation,Lecture notes in computational science and engineering,2020,book-chapter,compilers,6,8.0,12.0,18.204255319148935,30,29.7428,True,True,baseline,18.204255319148935,landmark,True | 394 | +4408711372,10.1109/tsg.2025.3553737,,A Progressive Polyhedral Approximation Method for Nonlinear PDE-Constrained Electricity-Water Nexus Dispatch,IEEE Transactions on Smart Grid,2025,article,compilers,3,39.0,39.0,8.943719676549865,39,8.8867,True,False,post,aprogressivepolyhedralapproximationmethodfornonlinearpdeconstrainedelectricitywaternexusdispatch,17.0418911386919,landmark,True | ||
| 395 | −7127344046,10.1007/s44217-026-01188-4,,Artificial intelligence policy challenges and institutional readiness in Omani higher education,Discover Education,2026,article,compilers,3,5.0,5.0,35.52271252433485,5,45.7642,True,True,post,17.776102896620227,landmark,True | 395 | +3103225940,,,An LLVM backend for the Open Modelica Compiler,KTH Publication Database DiVA (KTH Royal Institute of Technology),2019,dissertation,compilers,4,3.0,3.0,16.862068965517242,3,,True,True,baseline,anllvmbackendfortheopenmodelicacompiler,16.862068965517242,landmark,True | ||
| 396 | −3132279601,10.1007/978-3-030-62066-0_12,,Coping with COVID-19: Higher Education in the GCC Countries,Springer proceedings in complexity,2021,conference-paper,compilers,1,23.0,37.0,17.288455680779773,43,37.049,False,False,baseline,17.288455680779773,landmark,True | 396 | +4313894866,10.3390/publications11010002,,"The Science of Literature Reviews: Searching, Identifying, Selecting, and Synthesising",Publications,2023,article,compilers,1,91.0,187.0,16.423071260306244,248,45.5306,True,True,post,thescienceofliteraturereviewssearchingidentifyingselectingandsynthesising,16.423071260306244,landmark,True | ||
| 397 | −3103225940,,,An LLVM backend for the Open Modelica Compiler,KTH Publication Database DiVA (KTH Royal Institute of Technology),2019,dissertation,compilers,4,3.0,3.0,16.862068965517242,3,,True,True,baseline,16.862068965517242,landmark,True | 397 | +2787911489,10.1007/978-3-319-68394-2_11,,Automated Code Generation for Maximizing Performance of Detailed Chemistry Calculations in OpenFOAM,Springer eBooks,2018,book-chapter,compilers,4,5.0,10.0,14.319880418535128,37,25.2794,False,False,baseline,automatedcodegenerationformaximizingperformanceofdetailedchemistrycalculationsinopenfoam,14.319880418535128,landmark,True | ||
| 398 | −4313894866,10.3390/publications11010002,,"The Science of Literature Reviews: Searching, Identifying, Selecting, and Synthesising",Publications,2023,article,compilers,1,91.0,187.0,16.423071260306244,248,45.5306,True,True,post,16.423071260306244,landmark,True | 398 | +3189874403,,,Efficient memory and GPU operations for Tiramisu compiler,,2019,dissertation,compilers,4,2.0,2.0,13.714285714285714,2,,False,False,baseline,efficientmemoryandgpuoperationsfortiramisucompiler,13.714285714285714,landmark,True | ||
| 399 | −4407942537,10.1145/3708493.3712691,,LLM Compiler: Foundation Language Models for Compiler Optimization,ACM SIGPLAN International Conference on Compiler Construction (CC),2025,conference-paper,compilers,6,31.0,31.0,23.55532716683796,31,36.5894,True,True,post,15.694024501130242,landmark,True | 399 | +4407942537,10.1145/3708493.3712691,,LLM Compiler: Foundation Language Models for Compiler Optimization,ACM SIGPLAN International Conference on Compiler Construction (CC),2025,conference-paper,compilers,6,31.0,31.0,23.55532716683796,31,36.5894,True,True,post,llmcompilerfoundationlanguagemodelsforcompileroptimization,13.546118597421765,landmark,True | ||
| 400 | −2787911489,10.1007/978-3-319-68394-2_11,,Automated Code Generation for Maximizing Performance of Detailed Chemistry Calculations in OpenFOAM,Springer eBooks,2018,book-chapter,compilers,4,5.0,10.0,14.319880418535128,37,25.2794,False,False,baseline,14.319880418535128,landmark,True | 400 | +7127344046,10.1007/s44217-026-01188-4,,Artificial intelligence policy challenges and institutional readiness in Omani higher education,Discover Education,2026,article,compilers,3,5.0,5.0,35.52271252433485,5,45.7642,True,True,post,artificialintelligencepolicychallengesandinstitutionalreadinessinomanihighereducation,12.67735206095447,landmark,True | ||
| 401 | −2949967139,10.1109/cgo.2019.8661197,,Tiramisu: A Polyhedral Compiler for Expressing Fast and Portable Code,IEEE/ACM International Symposium on Code Generation and Optimization (CGO),2019,conference-paper,compilers,6,26.0,53.0,14.250956889605158,182,15.9098,True,True,baseline,14.250956889605158,landmark,True | 401 | +4385482927,10.1145/3596711.3596751,,Decoupling Algorithms from Schedules for Easy Optimization of Image Processing Pipelines,ACM eBooks,2023,book-chapter,compilers,5,7.0,7.0,12.636627906976743,7,3.981,True,False,post,decouplingalgorithmsfromschedulesforeasyoptimizationofimageprocessingpipelines,12.636627906976743,landmark,True | ||
| 402 | −4385245566,10.4230/lipics.itp.2023.19,,Exploiting Generative AI to Scale up Intelligent Tutoring Systems,DROPS (Schloss Dagstuhl – Leibniz Center for Informatics),2023,article,formal_verification,3,54921.0,72130.0,6621.879465206806,76658,4908.38,True,True,post,6621.879465206806,landmark,True | 402 | +4385245566,10.4230/lipics.itp.2023.19,,Exploiting Generative AI to Scale up Intelligent Tutoring Systems,DROPS (Schloss Dagstuhl – Leibniz Center for Informatics),2023,article,formal_verification,3,54921.0,72130.0,6621.879465206806,76658,4908.38,True,True,post,exploitinggenerativeaitoscaleupintelligenttutoringsystems,6621.879465206806,landmark,True | ||
| 403 | −1498342204,10.1145/3788687,,An Introduction to Input/Output Automata,Formal Aspects of Computing,2026,article,formal_verification,2,284.0,284.0,801.9048786467272,1011,3.5639,True,True,post,1009.682644528029,landmark,True | 403 | +1498342204,10.1145/3788687,,An Introduction to Input/Output Automata,Formal Aspects of Computing,2026,article,formal_verification,2,284.0,284.0,801.9048786467272,1011,3.5639,True,True,post,anintroductiontoinputoutputautomata,720.0735970622139,landmark,True | ||
| 404 | −3117137355,10.1145/3815481,,egg: Fast and Extensible Equality Saturation,Communications of the ACM,2026,article,formal_verification,3,132.0,132.0,146.88980220909326,132,0.0,True,False,post,469.28911647077405,landmark,True | 404 | +2254118105,10.48550/arxiv.2608.14274,2608.14274,Solving QBF by Clause Selection,arXiv (Cornell University),2026,preprint,formal_verification,3,60.0,60.0,2151.793313069909,60,,True,True,post,solvingqbfbyclauseselection,152.12822473145363,landmark,True | ||
| 405 | −1481397690,10.1007/978-3-319-10575-8_11,,Satisfiability Modulo Theories,Springer eBooks,2018,book-chapter,formal_verification,2,501.0,585.0,432.45569620253167,1122,250.357,False,False,baseline,432.45569620253167,landmark,True | 405 | +2921681895,10.18154/rwth-2020-02348,1903.07993,Parameter synthesis in Markov models,RWTH Publications (RWTH Aachen),2020,dissertation,formal_verification,6,14.0,19.0,111.636815920398,26,,True,True,baseline,parametersynthesisinmarkovmodels,111.636815920398,landmark,True | ||
| 406 | −2254118105,10.48550/arxiv.2608.14274,2608.14274,Solving QBF by Clause Selection,arXiv (Cornell University),2026,preprint,formal_verification,3,60.0,60.0,2151.793313069909,60,,True,True,post,213.31323475944274,landmark,True | 406 | +2540354435,10.48550/arxiv.2605.09519,2605.09519,Weighted Rules under the Stable Model Semantics,arXiv (Cornell University),2026,preprint,formal_verification,2,39.0,39.0,1517.578947368421,39,,True,True,post,weightedrulesunderthestablemodelsemantics,98.88334607544486,landmark,True | ||
| 407 | −4206807714,10.3233/faia336,,Handbook of Satisfiability,Frontiers in artificial intelligence and applications,2021,book,formal_verification,2,678.0,777.0,184.30546075085323,1038,93.9568,False,False,baseline,184.30546075085323,landmark,True | 407 | +4225922019,10.1007/978-3-030-99524-9_24,,cvc5: A Versatile and Industrial-Strength SMT Solver,Lecture notes in computer science,2022,conference-paper,formal_verification,4,111.0,222.0,98.23784328546233,468,135.8061,True,True,baseline,cvc5aversatileandindustrialstrengthsmtsolver,98.23784328546233,landmark,True | ||
| 408 | −2540354435,10.48550/arxiv.2605.09519,2605.09519,Weighted Rules under the Stable Model Semantics,arXiv (Cornell University),2026,preprint,formal_verification,2,39.0,39.0,1517.578947368421,39,,True,True,post,138.65360259363777,landmark,True | 408 | +4318573502,10.5463/thesis.149,,Semantically informed methods in structural proof theory,,2022,dissertation,formal_verification,2,9.0,13.0,97.35745614035089,14,,True,True,baseline,semanticallyinformedmethodsinstructuralprooftheory,97.35745614035089,landmark,True | ||
| 409 | −2921681895,10.18154/rwth-2020-02348,1903.07993,Parameter synthesis in Markov models,RWTH Publications (RWTH Aachen),2020,dissertation,formal_verification,6,14.0,19.0,111.636815920398,26,,True,True,baseline,111.636815920398,landmark,True | 409 | +2154148696,10.1007/978-3-319-77452-7_9,,Supervisory Control of Timed Discrete-Event Systems,Communications and control engineering/Communications and control engineering series,2018,book-chapter,formal_verification,1,100.0,117.0,86.49113924050633,365,36.4666,False,False,baseline,supervisorycontroloftimeddiscreteeventsystems,86.49113924050633,landmark,True | ||
| 410 | −4225922019,10.1007/978-3-030-99524-9_24,,cvc5: A Versatile and Industrial-Strength SMT Solver,Lecture notes in computer science,2022,conference-paper,formal_verification,4,111.0,222.0,98.23784328546233,468,135.8061,True,True,baseline,98.23784328546233,landmark,True | 410 | +4297781990,10.4230/oasics.dx.2024.10,,"Leveraging Answer Set Programming for Continuous Monitoring, Fault Detection, and Explanation of Automated and Autonomous Driving Systems",HAL (Le Centre pour la Communication Scientifique Directe),2024,preprint,formal_verification,3,426.0,431.0,78.93772893772893,431,,True,True,post,leveraginganswersetprogrammingforcontinuousmonitoringfaultdetectionandexplanationofautomatedandautonomousdrivingsystems,78.93772893772893,landmark,True | ||
| 411 | −4318573502,10.5463/thesis.149,,Semantically informed methods in structural proof theory,,2022,dissertation,formal_verification,2,9.0,13.0,97.35745614035089,14,,True,True,baseline,97.35745614035089,landmark,True | 411 | +2789444712,10.1080/00207543.2018.1444806,,Industry 4.0: state of the art and future trends,International Journal of Production Research,2018,article,formal_verification,4,298.0,734.0,61.81756449008323,3221,267.6956,True,False,baseline,industry40stateoftheartandfuturetrends,61.81756449008323,landmark,True | ||
| 412 | −2154148696,10.1007/978-3-319-77452-7_9,,Supervisory Control of Timed Discrete-Event Systems,Communications and control engineering/Communications and control engineering series,2018,book-chapter,formal_verification,1,100.0,117.0,86.49113924050633,365,36.4666,False,False,baseline,86.49113924050633,landmark,True | 412 | +2486519520,10.48456/tr-792,,Machine learning and automated theorem proving,OpenGrey (Institut de l'Information Scientifique et Technique),2021,dissertation,formal_verification,4,12.0,12.0,54.58021978021978,14,,True,True,baseline,machinelearningandautomatedtheoremproving,54.58021978021978,landmark,True | ||
| 413 | −4297781990,10.4230/oasics.dx.2024.10,,"Leveraging Answer Set Programming for Continuous Monitoring, Fault Detection, and Explanation of Automated and Autonomous Driving Systems",HAL (Le Centre pour la Communication Scientifique Directe),2024,preprint,formal_verification,3,426.0,431.0,78.93772893772893,431,,True,True,post,78.93772893772893,landmark,True | 413 | +149631060,10.48550/arxiv.2411.01592,2411.01592,Decidability Issues for Petri Nets -- a survey,arXiv (Cornell University),2024,preprint,formal_verification,3,33.0,33.0,53.32230215827339,72,,True,True,post,decidabilityissuesforpetrinetsasurvey,53.32230215827339,landmark,True | ||
| 414 | −2789444712,10.1080/00207543.2018.1444806,,Industry 4.0: state of the art and future trends,International Journal of Production Research,2018,article,formal_verification,4,298.0,734.0,61.81756449008323,3221,267.6956,True,False,baseline,61.81756449008323,landmark,True | 414 | +2890660842,10.48550/arxiv.1809.08098,1809.08098,Efficient Formal Safety Analysis of Neural Networks,arXiv (Cornell University),2018,preprint,formal_verification,6,41.0,98.0,52.040918390543304,167,,True,True,baseline,efficientformalsafetyanalysisofneuralnetworks,52.040918390543304,landmark,True | ||
| 415 | −1586677474,,,Handbook of Satisfiability,,2021,article,formal_verification,2,374.0,375.0,60.365327611379016,486,1.7496,True,False,baseline,60.365327611379016,landmark,True | 415 | +4393942723,10.1007/978-3-031-57256-2_15,,State of the Art in Software Verification and Witness Validation: SV-COMP 2024,Lecture notes in computer science,2024,conference-paper,formal_verification,4,66.0,78.0,48.594819515239784,78,53.289,True,True,post,stateoftheartinsoftwareverificationandwitnessvalidationsvcomp2024,48.594819515239784,landmark,True | ||
| 416 | −2486519520,10.48456/tr-792,,Machine learning and automated theorem proving,OpenGrey (Institut de l'Information Scientifique et Technique),2021,dissertation,formal_verification,4,12.0,12.0,54.58021978021978,14,,True,True,baseline,54.58021978021978,landmark,True | 416 | +2957311447,10.1007/978-3-030-25540-4_26,,The Marabou Framework for Verification and Analysis of Deep Neural Networks,Lecture notes in computer science,2019,conference-paper,formal_verification,4,55.0,141.0,46.39818783571157,498,53.6017,True,True,baseline,themarabouframeworkforverificationandanalysisofdeepneuralnetworks,46.39818783571157,landmark,True | ||
| 417 | −4289665848,10.4230/lipics.csl.2026.30,,Reward Interfaces with Best-Effort Implementations,DROPS (Schloss Dagstuhl – Leibniz Center for Informatics),2026,article,formal_verification,4,15.0,15.0,42.354130914439814,15,0.0,True,True,post,53.328308689860684,landmark,True | 417 | +2905489900,,,Machine Learning for SAT Solvers,UWSpace (University of Waterloo),2018,dissertation,formal_verification,3,3.0,5.0,44.97120921305182,9,,True,True,baseline,machinelearningforsatsolvers,44.97120921305182,landmark,True | ||
| 418 | −149631060,10.48550/arxiv.2411.01592,2411.01592,Decidability Issues for Petri Nets -- a survey,arXiv (Cornell University),2024,preprint,formal_verification,3,33.0,33.0,53.32230215827339,72,,True,True,post,53.32230215827339,landmark,True | 418 | +2900153411,10.1145/3290354,,An abstract domain for certifying neural networks,Proceedings of the ACM on Programming Languages,2019,article,formal_verification,3,99.0,209.0,44.06671585274556,609,46.6555,True,True,baseline,anabstractdomainforcertifyingneuralnetworks,44.06671585274556,landmark,True | ||
| 419 | −2890660842,10.48550/arxiv.1809.08098,1809.08098,Efficient Formal Safety Analysis of Neural Networks,arXiv (Cornell University),2018,preprint,formal_verification,6,41.0,98.0,52.040918390543304,167,,True,True,baseline,52.040918390543304,landmark,True | 419 | +6944541633,10.18154/rwth-2023-09669,,Verification of multi-objective Markov models,RWTH Publications (RWTH Aachen),2023,dissertation,formal_verification,6,2.0,2.0,43.15151515151515,4,,True,True,post,verificationofmultiobjectivemarkovmodels,43.15151515151515,landmark,True | ||
| 420 | −1932627192,10.82444/warw.33484729,,Model checking quantum protocols,Warwick Research Archive Portal (University of Warwick),2026,dissertation,formal_verification,4,14.0,14.0,141.45283018867926,18,,True,True,post,49.77308811053664,landmark,True | 420 | +3016155638,10.1109/sp40000.2020.00024,,VerX: Safety Verification of Smart Contracts,Proceedings - IEEE Symposium on Security and Privacy/Proceedings of the ... IEEE Symposium on Security and Privacy,2020,conference-paper,formal_verification,6,76.0,114.0,42.08811748998665,247,40.057,True,True,baseline,verxsafetyverificationofsmartcontracts,42.08811748998665,landmark,True | ||
| 421 | −4393942723,10.1007/978-3-031-57256-2_15,,State of the Art in Software Verification and Witness Validation: SV-COMP 2024,Lecture notes in computer science,2024,conference-paper,formal_verification,4,66.0,78.0,48.594819515239784,78,53.289,True,True,post,48.594819515239784,landmark,True | 421 | +1639950690,10.14279/tuj.eceasst.24.334,,Checking Unsatisfiability for OCL Constraints,Technische Universität Berlin – Universitätsbibliothek,2024,article,formal_verification,3,53.0,53.0,42.056619718309854,58,2.1008,True,True,post,checkingunsatisfiabilityforoclconstraints,42.056619718309854,landmark,True | ||
| 422 | −2957311447,10.1007/978-3-030-25540-4_26,,The Marabou Framework for Verification and Analysis of Deep Neural Networks,Lecture notes in computer science,2019,conference-paper,formal_verification,4,55.0,141.0,46.39818783571157,498,53.6017,True,True,baseline,46.39818783571157,landmark,True | 422 | +4384521943,10.1007/978-3-031-37703-7_18,,nl2spec: Interactively Translating Unstructured Natural Language to Temporal Logics with Large Language Models,Lecture notes in computer science,2023,conference-paper,formal_verification,4,38.0,82.0,40.90918384733345,122,53.4819,True,True,post,nl2specinteractivelytranslatingunstructurednaturallanguagetotemporallogicswithlargelanguagemodels,40.90918384733345,landmark,True | ||
| 423 | −2905489900,,,Machine Learning for SAT Solvers,UWSpace (University of Waterloo),2018,dissertation,formal_verification,3,3.0,5.0,44.97120921305182,9,,True,True,baseline,44.97120921305182,landmark,True | 423 | +2803355841,10.48550/arxiv.1805.08876,1805.08876,Soteria: Automated IoT Safety and Security Analysis,arXiv (Cornell University),2018,preprint,formal_verification,7,35.0,74.0,39.29620368265515,159,,True,True,baseline,soteriaautomatediotsafetyandsecurityanalysis,39.29620368265515,landmark,True | ||
| 424 | −2900153411,10.1145/3290354,,An abstract domain for certifying neural networks,Proceedings of the ACM on Programming Languages,2019,article,formal_verification,3,99.0,209.0,44.06671585274556,609,46.6555,True,True,baseline,44.06671585274556,landmark,True | 424 | +6891455501,10.3929/ethz-b-000553221,,"Efficient, Expressive, and Verified Temporal Query Evaluation",Repository for Publications and Research Data (ETH Zurich),2022,dissertation,formal_verification,5,4.0,5.0,38.535353535353536,5,,True,True,baseline,efficientexpressiveandverifiedtemporalqueryevaluation,38.535353535353536,landmark,True | ||
| 425 | −6944541633,10.18154/rwth-2023-09669,,Verification of multi-objective Markov models,RWTH Publications (RWTH Aachen),2023,dissertation,formal_verification,6,2.0,2.0,43.15151515151515,4,,True,True,post,43.15151515151515,landmark,True | 425 | +2187038411,10.26190/unsworks/22938,,Modelling and programming embedded controllers with timed automata and synchronous languages,"UNSWorks (University of New South Wales, Sydney, Australia)",2022,dissertation,formal_verification,3,4.0,5.0,38.535353535353536,5,,True,True,baseline,modellingandprogrammingembeddedcontrollerswithtimedautomataandsynchronouslanguages,38.535353535353536,landmark,True | ||
| 426 | −3016155638,10.1109/sp40000.2020.00024,,VerX: Safety Verification of Smart Contracts,Proceedings - IEEE Symposium on Security and Privacy/Proceedings of the ... IEEE Symposium on Security and Privacy,2020,conference-paper,formal_verification,6,76.0,114.0,42.08811748998665,247,40.057,True,True,baseline,42.08811748998665,landmark,True | 426 | +4289665848,10.4230/lipics.csl.2026.30,,Reward Interfaces with Best-Effort Implementations,DROPS (Schloss Dagstuhl – Leibniz Center for Informatics),2026,article,formal_verification,4,15.0,15.0,42.354130914439814,15,0.0,True,True,post,rewardinterfaceswithbesteffortimplementations,38.03205618286341,landmark,True | ||
| 427 | −4311415873,10.4230/lipics.wads.2025.45,,Fast Kd-Trees for the Kullback-Leibler Divergence and Other Decomposable Bregman Divergences,Leibniz international proceedings in informatics,2025,conference-paper,algorithms,3,2355.0,2355.0,1915.3516038917253,2354,1042.305,True,True,post,1192.2396032310232,landmark,True | 427 | +4311415873,10.4230/lipics.wads.2025.45,,Fast Kd-Trees for the Kullback-Leibler Divergence and Other Decomposable Bregman Divergences,Leibniz international proceedings in informatics,2025,conference-paper,algorithms,3,2355.0,2355.0,1915.3516038917253,2354,1042.305,True,True,post,fastkdtreesforthekullbackleiblerdivergenceandotherdecomposablebregmandivergences,1029.0680418363954,landmark,True | ||
| 428 | −2402846924,10.1142/9789811205675_0004,,Particle Swarm Optimization,WORLD SCIENTIFIC eBooks,2019,book-chapter,algorithms,1,3563.0,3767.0,1171.7895003921208,6270,302.7094,False,False,baseline,1171.7895003921208,landmark,True | 428 | +4294558607,10.4230/lipics.sea.2024.20,,Targeted Branching for the Maximum Independent Set Problem Using Graph Neural Networks,DROPS (Schloss Dagstuhl – Leibniz Center for Informatics),2024,article,algorithms,4,5110.0,5183.0,861.3021555600685,5183,320.7213,True,True,post,targetedbranchingforthemaximumindependentsetproblemusinggraphneuralnetworks,861.3021555600685,landmark,True | ||
| 429 | −4294558607,10.4230/lipics.sea.2024.20,,Targeted Branching for the Maximum Independent Set Problem Using Graph Neural Networks,DROPS (Schloss Dagstuhl – Leibniz Center for Informatics),2024,article,algorithms,4,5110.0,5183.0,861.3021555600685,5183,320.7213,True,True,post,861.3021555600685,landmark,True | 429 | +4285092328,10.1145/3544585.3544600,,A Note on Two Problems in Connexion with Graphs,ACM eBooks,2022,book-chapter,algorithms,1,631.0,868.0,724.7350484463749,1353,589.8043,True,False,baseline,anoteontwoproblemsinconnexionwithgraphs,724.7350484463749,landmark,True | ||
| 430 | −4372046852,10.1007/978-3-031-26212-8_4,,Introduction to Algorithms,Texts in computer science,2023,book-chapter,algorithms,1,880.0,1114.0,804.2780269058295,1614,491.6762,False,False,post,804.2780269058295,landmark,True | 430 | +2112641412,10.37236/11668,,A Dynamic Survey of Graph Labeling,The Electronic Journal of Combinatorics,2022,article,algorithms,1,1698.0,1780.0,288.61814892416174,2162,44.7232,True,True,post,adynamicsurveyofgraphlabeling,288.61814892416174,landmark,True | ||
| 431 | −4285092328,10.1145/3544585.3544600,,A Note on Two Problems in Connexion with Graphs,ACM eBooks,2022,book-chapter,algorithms,1,631.0,868.0,724.7350484463749,1353,589.8043,True,False,baseline,724.7350484463749,landmark,True | 431 | +2003494253,10.1017/9781009260350.002,,Algorithms+Data Structures = Programs,Cambridge University Press eBooks,2024,book-chapter,algorithms,2,231.0,231.0,275.60804020100505,953,13.0275,True,False,post,algorithmsdatastructuresprograms,275.60804020100505,landmark,True | ||
| 432 | −3148190347,10.1142/9789811273117_0001,,Introduction to Graph Theory,WORLD SCIENTIFIC eBooks,2023,book-chapter,algorithms,1,502.0,503.0,455.41427595628414,885,6.2728,False,False,post,455.41427595628414,landmark,True | 432 | +7128526706,10.1007/s10462-026-11504-x,,Glider snake optimizer (GSO): a nature-inspired metaheuristic algorithm for global and engineering optimization problems,Artificial Intelligence Review,2026,article,algorithms,5,91.0,91.0,101.26493940172338,91,328.7483,True,True,post,glidersnakeoptimizergsoanatureinspiredmetaheuristicalgorithmforglobalandengineeringoptimizationproblems,230.72780750937136,landmark,True | ||
| 433 | −7128526706,10.1007/s10462-026-11504-x,,Glider snake optimizer (GSO): a nature-inspired metaheuristic algorithm for global and engineering optimization problems,Artificial Intelligence Review,2026,article,algorithms,5,91.0,91.0,101.26493940172338,91,328.7483,True,True,post,323.52507271848816,landmark,True | 433 | +1491280261,10.26190/unsworks/6784,,Grammatical bias for evolutionary learning,"UNSWorks (University of New South Wales, Sydney, Australia)",2022,dissertation,algorithms,1,26.0,28.0,209.69298245614038,96,,True,True,baseline,grammaticalbiasforevolutionarylearning,209.69298245614038,landmark,True | ||
| 434 | −2112641412,10.37236/11668,,A Dynamic Survey of Graph Labeling,The Electronic Journal of Combinatorics,2022,article,algorithms,1,1698.0,1780.0,288.61814892416174,2162,44.7232,True,True,post,288.61814892416174,landmark,True | 434 | +7125913058,10.1109/tsmc.2026.3655483,,Multiresource-Constrained Flexible Job Shop Scheduling With Fixture Pallets and Setup Stations Under Pallet Automation Systems,IEEE Transactions on Systems Man and Cybernetics Systems,2026,article,algorithms,3,73.0,73.0,84.02038567493113,73,309.1219,True,True,post,multiresourceconstrainedflexiblejobshopschedulingwithfixturepalletsandsetupstationsunderpalletautomationsystems,185.08934008993526,landmark,True | ||
| 435 | −3183881215,10.1007/978-1-4842-7077-6_3,,Introduction to Algorithms,Apress eBooks,2021,book-chapter,algorithms,1,276.0,434.0,279.4307771487391,877,222.2179,True,False,baseline,279.4307771487391,landmark,True | 435 | +3119051141,10.1016/j.cma.2020.113609,,The Arithmetic Optimization Algorithm,Computer Methods in Applied Mechanics and Engineering,2021,article,algorithms,2,900.0,1513.0,176.3286814620167,2928,183.3132,True,True,baseline,thearithmeticoptimizationalgorithm,176.3286814620167,landmark,True | ||
| 436 | −2003494253,10.1017/9781009260350.002,,Algorithms+Data Structures = Programs,Cambridge University Press eBooks,2024,book-chapter,algorithms,2,231.0,231.0,275.60804020100505,953,13.0275,True,False,post,275.60804020100505,landmark,True | 436 | +4406080942,10.1007/s10462-024-11023-7,,Artificial lemming algorithm: a novel bionic meta-heuristic technique for solving real-world engineering optimization problems,Artificial Intelligence Review,2025,article,algorithms,3,330.0,330.0,112.41427295439541,330,137.3209,True,True,post,artificiallemmingalgorithmanovelbionicmetaheuristictechniqueforsolvingrealworldengineeringoptimizationproblems,144.200617327393,landmark,True | ||
| 437 | −7125913058,10.1109/tsmc.2026.3655483,,Multiresource-Constrained Flexible Job Shop Scheduling With Fixture Pallets and Setup Stations Under Pallet Automation Systems,IEEE Transactions on Systems Man and Cybernetics Systems,2026,article,algorithms,3,73.0,73.0,84.02038567493113,73,309.1219,True,True,post,259.5311022906553,landmark,True | 437 | +2891784792,10.48550/arxiv.2407.17712,2407.17712,Improving Online Algorithms via ML Predictions,arXiv (Cornell University),2024,preprint,algorithms,2,111.0,112.0,142.64098765432098,112,,True,True,post,improvingonlinealgorithmsviamlpredictions,142.64098765432098,landmark,True | ||
| 438 | −1491280261,10.26190/unsworks/6784,,Grammatical bias for evolutionary learning,"UNSWorks (University of New South Wales, Sydney, Australia)",2022,dissertation,algorithms,1,26.0,28.0,209.69298245614038,96,,True,True,baseline,209.69298245614038,landmark,True | 438 | +3139484821,10.1016/j.cie.2021.107250,,Aquila Optimizer: A novel meta-heuristic optimization algorithm,Computers & Industrial Engineering,2021,article,algorithms,1,683.0,1186.0,138.21931012158083,2213,141.9398,False,False,baseline,aquilaoptimizeranovelmetaheuristicoptimizationalgorithm,138.21931012158083,landmark,True | ||
| 439 | −3111526966,10.1201/9781003091479-1,,Introduction to Algorithms,Chapman & Hall/CRC eBooks,2020,book-chapter,algorithms,1,193.0,202.0,200.82966396292002,428,40.7298,True,False,baseline,200.82966396292002,landmark,True | 439 | +2121903617,10.1201/9781482268713-14,,Introduction to evolutionary algorithms,CRC Press eBooks,2018,book-chapter,algorithms,1,260.0,292.0,135.62163175992498,349,50.6462,True,False,baseline,introductiontoevolutionaryalgorithms,135.62163175992498,landmark,True | ||
| 440 | −3119051141,10.1016/j.cma.2020.113609,,The Arithmetic Optimization Algorithm,Computer Methods in Applied Mechanics and Engineering,2021,article,algorithms,2,900.0,1513.0,176.3286814620167,2928,183.3132,True,True,baseline,176.3286814620167,landmark,True | 440 | +2207864362,10.58088/v6j9-5f14,,Properties of some algebraically defined digraphs,"Library, Museums and Press - UDSpace (University of Delaware)",2024,dissertation,algorithms,1,6.0,6.0,134.92307692307693,6,,True,True,post,propertiesofsomealgebraicallydefineddigraphs,134.92307692307693,landmark,True | ||
| 441 | −4406080942,10.1007/s10462-024-11023-7,,Artificial lemming algorithm: a novel bionic meta-heuristic technique for solving real-world engineering optimization problems,Artificial Intelligence Review,2025,article,algorithms,3,330.0,330.0,112.41427295439541,330,137.3209,True,True,post,167.06542210880582,landmark,True | 441 | +2125690626,,,Combinatorial optimization: networks and matroids,,2021,article,algorithms,2,738.0,779.0,125.39890722470469,3320,16.9958,True,True,baseline,combinatorialoptimizationnetworksandmatroids,125.39890722470469,landmark,True | ||
| 442 | −2146101030,10.82444/warw.33642076,,Communication complexity of document exchange,Symposium on Discrete Algorithms,2026,conference-paper,algorithms,3,46.0,46.0,353.0526747845123,122,9.2449,True,True,post,163.5401466489061,landmark,True | 442 | +2181620480,10.26190/unsworks/16444,,Robust solutions for constraint satisfaction and optimisation under uncertainty.,UNSWorks (UNSW Sydney),2022,dissertation,algorithms,2,16.0,16.0,120.8627450980392,17,,True,True,baseline,robustsolutionsforconstraintsatisfactionandoptimisationunderuncertainty,120.8627450980392,landmark,True | ||
| 443 | −4405348595,10.1142/9789811299223_0004,,Positive Definite Matrices,WORLD SCIENTIFIC eBooks,2024,book-chapter,algorithms,2,125.0,125.0,151.20861797162374,135,24.6654,True,True,post,151.20861797162374,landmark,True | 443 | +2117226423,10.1007/s43069-021-00101-z,,Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem,Operations Research Forum,2022,article,algorithms,2,683.0,742.0,120.31161039422922,1131,23.3118,True,True,baseline,worstcaseanalysisofanewheuristicforthetravellingsalesmanproblem,120.31161039422922,landmark,True | ||
| 444 | −7118096636,10.1016/j.eswa.2026.131088,,A modified starfish optimization algorithm (M-SFOA) for global optimization problems and its application to heart disease risk prediction,Expert Systems with Applications,2026,article,algorithms,1,42.0,42.0,46.737664339256945,42,151.73,False,False,post,149.31926433160993,landmark,True | 444 | +2146101030,10.82444/warw.33642076,,Communication complexity of document exchange,Symposium on Discrete Algorithms,2026,conference-paper,algorithms,3,46.0,46.0,353.0526747845123,122,9.2449,True,True,post,communicationcomplexityofdocumentexchange,116.63163896078113,landmark,True | ||
| 445 | −4233225156,10.1007/978-3-030-34209-8_4,,Introduction to Algorithms,Undergraduate topics in computer science,2020,book-chapter,algorithms,1,141.0,149.0,148.13673232908457,330,38.8354,False,False,baseline,148.13673232908457,landmark,True | 445 | +2963224980,10.1109/tkde.2018.2807452,1709.07604,"A Comprehensive Survey of Graph Embedding: Problems, Techniques, and Applications",IEEE Transactions on Knowledge and Data Engineering,2018,article,algorithms,4,296.0,609.0,114.94541813871597,2032,138.3391,True,True,baseline,acomprehensivesurveyofgraphembeddingproblemstechniquesandapplications,114.94541813871597,landmark,True | ||
| 446 | −2891784792,10.48550/arxiv.2407.17712,2407.17712,Improving Online Algorithms via ML Predictions,arXiv (Cornell University),2024,preprint,algorithms,2,111.0,112.0,142.64098765432098,112,,True,True,post,142.64098765432098,landmark,True | 446 | +7118096636,10.1016/j.eswa.2026.131088,,A modified starfish optimization algorithm (M-SFOA) for global optimization problems and its application to heart disease risk prediction,Expert Systems with Applications,2026,article,algorithms,1,42.0,42.0,46.737664339256945,42,151.73,False,False,post,amodifiedstarfishoptimizationalgorithmmsfoaforglobaloptimizationproblemsanditsapplicationtoheartdiseaseriskprediction,106.48975731201755,landmark,True | ||
| 447 | −7155156112,10.1007/s10462-026-11529-2,,Gray langurs optimizer: a multi-group bio-inspired optimization algorithm,Artificial Intelligence Review,2026,article,algorithms,1,40.0,40.0,44.5120612754828,40,144.5047,True,True,post,142.20882317296181,landmark,True | 447 | +2398690976,10.1609/aaai.v26i1.8120,,Online Task Assignment in Crowdsourcing Markets,Proceedings of the AAAI Conference on Artificial Intelligence,2021,conference-paper,algorithms,3,270.0,280.0,104.97509403273355,293,14.5296,True,True,baseline,onlinetaskassignmentincrowdsourcingmarkets,104.97509403273355,landmark,True | ||
| 448 | −3139484821,10.1016/j.cie.2021.107250,,Aquila Optimizer: A novel meta-heuristic optimization algorithm,Computers & Industrial Engineering,2021,article,algorithms,1,683.0,1186.0,138.21931012158083,2213,141.9398,False,False,baseline,138.21931012158083,landmark,True | 448 | +7155156112,10.1007/s10462-026-11529-2,,Gray langurs optimizer: a multi-group bio-inspired optimization algorithm,Artificial Intelligence Review,2026,article,algorithms,1,40.0,40.0,44.5120612754828,40,144.5047,True,True,post,graylangursoptimizeramultigroupbioinspiredoptimizationalgorithm,101.41881648763577,landmark,True | ||
| 449 | −2121903617,10.1201/9781482268713-14,,Introduction to evolutionary algorithms,CRC Press eBooks,2018,book-chapter,algorithms,1,260.0,292.0,135.62163175992498,349,50.6462,True,False,baseline,135.62163175992498,landmark,True | 449 | +2560014408,10.48550/arxiv.2411.10949,2411.10949,Maximization of Approximately Submodular Functions,arXiv (Cornell University),2024,preprint,algorithms,2,62.0,62.0,100.18129496402878,62,,True,True,post,maximizationofapproximatelysubmodularfunctions,100.18129496402878,landmark,True | ||
| 450 | −1486707681,10.82444/warw.33642484,,Sequence distance embeddings,Warwick Research Archive Portal (University of Warwick),2026,dissertation,algorithms,2,38.0,38.0,1163.0179211469535,64,,True,True,post,135.09838201431373,landmark,True | 450 | +4366545219,10.1007/978-1-4471-7503-2_33,,Genetic Algorithms and Their Applications,Springer handbooks,2023,book-chapter,algorithms,1,104.0,181.0,100.06977992485238,232,122.5764,False,False,post,geneticalgorithmsandtheirapplications,100.06977992485238,landmark,True | ||
| 451 | −2207864362,10.58088/v6j9-5f14,,Properties of some algebraically defined digraphs,"Library, Museums and Press - UDSpace (University of Delaware)",2024,dissertation,algorithms,1,6.0,6.0,134.92307692307693,6,,True,True,post,134.92307692307693,landmark,True | 451 | +4322738676,10.1201/9781003216001-5,,Introduction to Genetic Algorithm,Chapman & Hall/CRC eBooks,2023,book-chapter,algorithms,1,176.0,177.0,97.85829307568439,308,4.6255,True,False,post,introductiontogeneticalgorithm,97.85829307568439,landmark,True | ||
| 452 | −4254202520,10.7551/mitpress/12274.003.0008,,"On Computable Numbers, with an Application to the Entscheidungsproblem (1936)",The MIT Press eBooks,2021,book-chapter,computational_complexity,1,312.0,353.0,227.2789500772002,521,95.7524,False,False,baseline,227.2789500772002,landmark,True | 452 | +4254202520,10.7551/mitpress/12274.003.0008,,"On Computable Numbers, with an Application to the Entscheidungsproblem (1936)",The MIT Press eBooks,2021,book-chapter,computational_complexity,1,312.0,353.0,227.2789500772002,521,95.7524,False,False,baseline,oncomputablenumberswithanapplicationtotheentscheidungsproblem1936,227.2789500772002,landmark,True | ||
| 453 | −1638203394,10.1007/978-3-030-11298-1,,An Introduction to Kolmogorov Complexity and Its Applications,Texts in computer science,2019,book,computational_complexity,2,1326.0,1437.0,122.10728346456693,3681,45.0313,False,False,baseline,122.10728346456693,landmark,True | 453 | +1638203394,10.1007/978-3-030-11298-1,,An Introduction to Kolmogorov Complexity and Its Applications,Texts in computer science,2019,book,computational_complexity,2,1326.0,1437.0,122.10728346456693,3681,45.0313,False,False,baseline,anintroductiontokolmogorovcomplexityanditsapplications,122.10728346456693,landmark,True | ||
| 454 | −2979043732,,,ETH-tight algorithms for geometric network problems,TU/e Research Portal,2019,dissertation,computational_complexity,4,5.0,5.0,111.01694915254237,6,,True,True,baseline,111.01694915254237,landmark,True | 454 | +2979043732,,,ETH-tight algorithms for geometric network problems,TU/e Research Portal,2019,dissertation,computational_complexity,4,5.0,5.0,111.01694915254237,6,,True,True,baseline,ethtightalgorithmsforgeometricnetworkproblems,111.01694915254237,landmark,True | ||
| 455 | −2957144896,10.3389/fpsyg.2019.01652,,Factors Determining the Behavioral Intention to Use Mobile Learning: An Application and Extension of the UTAUT Model,Frontiers in Psychology,2019,article,computational_complexity,1,48.0,177.0,72.24848261060211,1039,114.0294,True,True,baseline,72.24848261060211,landmark,True | 455 | +2957144896,10.3389/fpsyg.2019.01652,,Factors Determining the Behavioral Intention to Use Mobile Learning: An Application and Extension of the UTAUT Model,Frontiers in Psychology,2019,article,computational_complexity,1,48.0,177.0,72.24848261060211,1039,114.0294,True,True,baseline,factorsdeterminingthebehavioralintentiontousemobilelearninganapplicationandextensionoftheutautmodel,72.24848261060211,landmark,True | ||
| 456 | −4241184911,10.1201/9780429494093-6,,Two-Dimensional Cellular Automata,CRC Press eBooks,2018,book-chapter,computational_complexity,2,86.0,93.0,68.7493670886076,307,25.2461,True,False,baseline,68.7493670886076,landmark,True | 456 | +4394806711,10.1016/j.heliyon.2024.e29523,,Artificial intelligence and social media on academic performance and mental well-being: Student perceptions of positive impact in the age of smart learning,Heliyon,2024,article,computational_complexity,1,118.0,197.0,59.311783860943,197,74.6231,True,True,post,artificialintelligenceandsocialmediaonacademicperformanceandmentalwellbeingstudentperceptionsofpositiveimpactintheageofsmartlearning,59.311783860943,landmark,True | ||
| 457 | −4394806711,10.1016/j.heliyon.2024.e29523,,Artificial intelligence and social media on academic performance and mental well-being: Student perceptions of positive impact in the age of smart learning,Heliyon,2024,article,computational_complexity,1,118.0,197.0,59.311783860943,197,74.6231,True,True,post,59.311783860943,landmark,True | 457 | +4386113651,10.48550/arxiv.2308.08708,2308.08708,Cheap Correlate or Discriminating Property? An Executable Validation Protocol for Consciousness- and Cognition-Theoretic Claims about AI,arXiv (Cornell University),2023,preprint,computational_complexity,1,89.0,170.0,57.664,193,,True,True,post,cheapcorrelateordiscriminatingpropertyanexecutablevalidationprotocolforconsciousnessandcognitiontheoreticclaimsaboutai,57.664,landmark,True | ||
| 458 | −4386113651,10.48550/arxiv.2308.08708,2308.08708,Cheap Correlate or Discriminating Property? An Executable Validation Protocol for Consciousness- and Cognition-Theoretic Claims about AI,arXiv (Cornell University),2023,preprint,computational_complexity,1,89.0,170.0,57.664,193,,True,True,post,57.664,landmark,True | 458 | +1513303009,,,Cellular Automata And Complexity: Collected Papers,CERN Document Server (European Organization for Nuclear Research),2019,article,computational_complexity,5,236.0,251.0,52.922228129373856,575,9.8222,True,True,baseline,cellularautomataandcomplexitycollectedpapers,52.922228129373856,landmark,True | ||
| 459 | −1513303009,,,Cellular Automata And Complexity: Collected Papers,CERN Document Server (European Organization for Nuclear Research),2019,article,computational_complexity,5,236.0,251.0,52.922228129373856,575,9.8222,True,True,baseline,52.922228129373856,landmark,True | 459 | +2905177801,,,Optimal trees for prediction and prescription,DSpace@MIT (Massachusetts Institute of Technology),2018,dissertation,computational_complexity,1,2.0,5.0,51.149155722326455,27,,True,True,baseline,optimaltreesforpredictionandprescription,51.149155722326455,landmark,True | ||
| 460 | −4406215947,10.3390/systems13010043,,"Digital Transformation and Innovation Performance in Small- and Medium-Sized Enterprises: A Systems Perspective on the Interplay of Digital Adoption, Digital Drive, and Digital Culture",Systems,2025,article,computational_complexity,1,104.0,104.0,24.553686934023286,104,125.7829,True,True,post,52.650920907017586,landmark,True | 460 | +2955897898,10.1109/access.2019.2921522,,Wireless Communications and Applications Above 100 GHz: Opportunities and Challenges for 6G and Beyond,IEEE Access,2019,article,computational_complexity,2,240.0,596.0,49.00829497340763,2594,88.2939,True,True,baseline,wirelesscommunicationsandapplicationsabove100ghzopportunitiesandchallengesfor6gandbeyond,49.00829497340763,landmark,True | ||
| 461 | −2905177801,,,Optimal trees for prediction and prescription,DSpace@MIT (Massachusetts Institute of Technology),2018,dissertation,computational_complexity,1,2.0,5.0,51.149155722326455,27,,True,True,baseline,51.149155722326455,landmark,True | 461 | +4377102915,10.1016/j.heliyon.2023.e16348,,"Challenges, opportunities, and prospects of adopting and using smart digital technologies in learning environments: An iterative review",Heliyon,2023,article,computational_complexity,1,78.0,204.0,47.81265827221507,331,77.7811,True,True,post,challengesopportunitiesandprospectsofadoptingandusingsmartdigitaltechnologiesinlearningenvironmentsaniterativereview,47.81265827221507,landmark,True | ||
| 462 | −2955897898,10.1109/access.2019.2921522,,Wireless Communications and Applications Above 100 GHz: Opportunities and Challenges for 6G and Beyond,IEEE Access,2019,article,computational_complexity,2,240.0,596.0,49.00829497340763,2594,88.2939,True,True,baseline,49.00829497340763,landmark,True | 462 | +3139085460,,,Reorienting machine learning education towards tinkerers and ML-engaged citizens,DSpace@MIT (Massachusetts Institute of Technology),2020,dissertation,computational_complexity,1,3.0,8.0,45.743589743589745,16,,True,False,baseline,reorientingmachinelearningeducationtowardstinkerersandmlengagedcitizens,45.743589743589745,landmark,True | ||
| 463 | −4377102915,10.1016/j.heliyon.2023.e16348,,"Challenges, opportunities, and prospects of adopting and using smart digital technologies in learning environments: An iterative review",Heliyon,2023,article,computational_complexity,1,78.0,204.0,47.81265827221507,331,77.7811,True,True,post,47.81265827221507,landmark,True | 463 | +4406215947,10.3390/systems13010043,,"Digital Transformation and Innovation Performance in Small- and Medium-Sized Enterprises: A Systems Perspective on the Interplay of Digital Adoption, Digital Drive, and Digital Culture",Systems,2025,article,computational_complexity,1,104.0,104.0,24.553686934023286,104,125.7829,True,True,post,digitaltransformationandinnovationperformanceinsmallandmediumsizedenterprisesasystemsperspectiveontheinterplayofdigitaladoptiondigitaldriveanddigitalculture,45.445043036511734,landmark,True | ||
| 464 | −3139085460,,,Reorienting machine learning education towards tinkerers and ML-engaged citizens,DSpace@MIT (Massachusetts Institute of Technology),2020,dissertation,computational_complexity,1,3.0,8.0,45.743589743589745,16,,True,False,baseline,45.743589743589745,landmark,True | 464 | +2808541536,,,Meet-continuity and locally compact sober dcpos,University of Birmingham Institutional Research Archive (University of Birmingham),2018,dissertation,computational_complexity,3,2.0,10.0,44.30861723446894,19,,True,True,baseline,meetcontinuityandlocallycompactsoberdcpos,44.30861723446894,landmark,True | ||
| 465 | −2808541536,,,Meet-continuity and locally compact sober dcpos,University of Birmingham Institutional Research Archive (University of Birmingham),2018,dissertation,computational_complexity,3,2.0,10.0,44.30861723446894,19,,True,True,baseline,44.30861723446894,landmark,True | 465 | +73572444,10.4324/9781003213574,,Complexity Theory and the Social Sciences,Routledge eBooks,2022,book,computational_complexity,1,197.0,215.0,43.70967741935484,454,13.2502,True,False,baseline,complexitytheoryandthesocialsciences,43.70967741935484,landmark,True | ||
| 466 | −73572444,10.4324/9781003213574,,Complexity Theory and the Social Sciences,Routledge eBooks,2022,book,computational_complexity,1,197.0,215.0,43.70967741935484,454,13.2502,True,False,baseline,43.70967741935484,landmark,True | 466 | +3086066649,10.1108/aeds-04-2020-0063,,The role of digital learning toward students' satisfaction and university brand image at educational institutes of Pakistan: a post-effect of COVID-19,Asian Education and Development Studies,2020,article,computational_complexity,1,40.0,110.0,32.031113421948945,216,36.2625,True,False,baseline,theroleofdigitallearningtowardstudentssatisfactionanduniversitybrandimageateducationalinstitutesofpakistanaposteffectofcovid19,32.031113421948945,landmark,True | ||
| 467 | −7122741622,10.3390/metrology6010003,,"Recent Advances in Digital Fringe Projection Profilometry (2022–2025): Techniques, Applications, and Metrological Challenges—A Review",Metrology,2026,article,computational_complexity,1,12.0,12.0,32.16440030557678,12,37.3956,True,True,post,42.66264695188855,landmark,True | 467 | +3122335070,,,Design and development of a mobile learning system for computer science education in Nigerian higher education context,UEF eRepo (University of Eastern Finland),2018,dissertation,computational_complexity,1,2.0,3.0,30.68949343339587,5,,True,True,baseline,designanddevelopmentofamobilelearningsystemforcomputerscienceeducationinnigerianhighereducationcontext,30.68949343339587,landmark,True | ||
| 468 | −7133302269,10.1016/j.chbr.2026.100986,,AI-assisted learning tools and student learning outcomes: A cognitive load theory perspective,Computers in Human Behavior Reports,2026,article,computational_complexity,1,12.0,12.0,85.25451005840362,12,109.834,True,True,post,42.66264695188855,landmark,True | 468 | +7133302269,10.1016/j.chbr.2026.100986,,AI-assisted learning tools and student learning outcomes: A cognitive load theory perspective,Computers in Human Behavior Reports,2026,article,computational_complexity,1,12.0,12.0,85.25451005840362,12,109.834,True,True,post,aiassistedlearningtoolsandstudentlearningoutcomesacognitiveloadtheoryperspective,30.425644946290728,landmark,True | ||
| 469 | −7160425037,10.1016/j.tcs.2026.116009,,Solving SAT by restricted spiking neural P systems with temporal division rules,Theoretical Computer Science,2026,article,computational_complexity,3,12.0,12.0,16.14637579169599,12,22.4653,False,False,post,42.66264695188855,landmark,True | 469 | +7122741622,10.3390/metrology6010003,,"Recent Advances in Digital Fringe Projection Profilometry (2022–2025): Techniques, Applications, and Metrological Challenges—A Review",Metrology,2026,article,computational_complexity,1,12.0,12.0,32.16440030557678,12,37.3956,True,True,post,recentadvancesindigitalfringeprojectionprofilometry20222025techniquesapplicationsandmetrologicalchallengesareview,30.425644946290728,landmark,True | ||
| 470 | −4391177866,10.1007/978-3-031-42209-6_2,,Computational Complexity,Undergraduate topics in computer science,2024,book-chapter,computational_complexity,2,32.0,32.0,38.1794687724336,49,0.0,False,False,post,38.1794687724336,landmark,True | 470 | +7160425037,10.1016/j.tcs.2026.116009,,Solving SAT by restricted spiking neural P systems with temporal division rules,Theoretical Computer Science,2026,article,computational_complexity,3,12.0,12.0,16.14637579169599,12,22.4653,False,False,post,solvingsatbyrestrictedspikingneuralpsystemswithtemporaldivisionrules,30.425644946290728,landmark,True | ||
| 471 | −4396808240,10.1007/978-3-031-53744-8_9,,Parameterized Complexity,Undergraduate topics in computer science,2024,book-chapter,computational_complexity,2,29.0,29.0,35.08039936941671,31,20.0406,False,False,post,35.08039936941671,landmark,True | 471 | +2900179285,10.1145/3313276.3316369,1809.07115,The Reachability Problem for Petri Nets Is Not Elementary,ACM SIGACT Symposium on Theory of Computing (STOC),2019,conference-paper,computational_complexity,4,56.0,92.0,30.27399489989691,145,23.6478,True,True,baseline,thereachabilityproblemforpetrinetsisnotelementary,30.27399489989691,landmark,True | ||
| 472 | −3086066649,10.1108/aeds-04-2020-0063,,The role of digital learning toward students' satisfaction and university brand image at educational institutes of Pakistan: a post-effect of COVID-19,Asian Education and Development Studies,2020,article,computational_complexity,1,40.0,110.0,32.031113421948945,216,36.2625,True,False,baseline,32.031113421948945,landmark,True | 472 | +4313549230,10.1109/acit57182.2022.9994193,,"The Influence of E-Iearning, M-learning, and D-learning on the Student Performance: Moderating Role of Institutional Support",International Arab Conference on Information Technology (ACIT),2022,conference-paper,computational_complexity,1,39.0,58.0,28.716532086697832,67,131.0986,True,False,baseline,theinfluenceofeiearningmlearninganddlearningonthestudentperformancemoderatingroleofinstitutionalsupport,28.716532086697832,landmark,True | ||
| 473 | −7127964361,10.3390/systems14020179,,"Turning Knowledge into Innovation: The Systemic Role of Knowledge Management Capability, Intellectual Capital, and Knowledge Utilization",Systems,2026,article,computational_complexity,1,9.0,9.0,8.79467680608365,9,57.758,True,True,post,31.99698521391641,landmark,True | 473 | +4318219991,10.1108/itp-02-2021-0152,,Students' adoption of AI-based teacher-bots (T-bots) for learning in higher education,Information Technology and People,2023,article,computational_complexity,1,47.0,118.0,27.6563415496146,171,40.183,True,False,post,studentsadoptionofaibasedteacherbotstbotsforlearninginhighereducation,27.6563415496146,landmark,True | ||
| 474 | −3122335070,,,Design and development of a mobile learning system for computer science education in Nigerian higher education context,UEF eRepo (University of Eastern Finland),2018,dissertation,computational_complexity,1,2.0,3.0,30.68949343339587,5,,True,True,baseline,30.68949343339587,landmark,True | 474 | +4408441779,10.1109/tem.2025.3551331,,Enhancing Creativity and Sustainable Competitive Advantage Through Data-Driven Decision-Making and Digital Leadership,IEEE Transactions on Engineering Management,2025,article,computational_complexity,1,59.0,59.0,19.444444444444446,59,84.1776,True,False,post,enhancingcreativityandsustainablecompetitiveadvantagethroughdatadrivendecisionmakinganddigitalleadership,25.781322491867233,landmark,True | ||
| 475 | −2900179285,10.1145/3313276.3316369,1809.07115,The Reachability Problem for Petri Nets Is Not Elementary,ACM SIGACT Symposium on Theory of Computing (STOC),2019,conference-paper,computational_complexity,4,56.0,92.0,30.27399489989691,145,23.6478,True,True,baseline,30.27399489989691,landmark,True | 475 | +3202325891,10.3390/s21196578,,"Electrochemical Impedance Spectroscopy (EIS): Principles, Construction, and Biosensing Applications",Sensors,2021,article,computational_complexity,1,85.0,323.0,25.03316097346723,1335,44.934,True,True,baseline,electrochemicalimpedancespectroscopyeisprinciplesconstructionandbiosensingapplications,25.03316097346723,landmark,True | ||
| 476 | −4408441779,10.1109/tem.2025.3551331,,Enhancing Creativity and Sustainable Competitive Advantage Through Data-Driven Decision-Making and Digital Leadership,IEEE Transactions on Engineering Management,2025,article,computational_complexity,1,59.0,59.0,19.444444444444446,59,84.1776,True,False,post,29.86927243763498,landmark,True | 476 | +2118110454,10.1017/s1755020325100920,,WHEN BI-INTERPRETABILITY IMPLIES SYNONYMY,The Review of Symbolic Logic,2025,article,computational_complexity,1,56.0,56.0,44.757894736842104,56,0.0,True,True,post,whenbiinterpretabilityimpliessynonymy,24.47040778889093,landmark,True | ||
| 477 | −2793823461,,,Endurable Transient Inconsistency in Byte-Addressable Persistent B+-Tree,Scholarworks@UNIST (Ulsan National Institute of Science and Technology),2018,dissertation,database_systems,3,17.0,42.0,377.7581573896353,89,,False,False,baseline,377.7581573896353,landmark,True | 477 | +2793823461,,,Endurable Transient Inconsistency in Byte-Addressable Persistent B+-Tree,Scholarworks@UNIST (Ulsan National Institute of Science and Technology),2018,dissertation,database_systems,3,17.0,42.0,377.7581573896353,89,,False,False,baseline,endurabletransientinconsistencyinbyteaddressablepersistentbtree,377.7581573896353,landmark,True | ||
| 478 | −3080729669,,,Pengembangan Sistem Pemetaan Otomatis EntityRelationship Diagram Ke Dalam Database,,2019,dissertation,database_systems,2,2.0,15.0,320.60747663551405,62,,True,False,baseline,320.60747663551405,landmark,True | 478 | +3080729669,,,Pengembangan Sistem Pemetaan Otomatis EntityRelationship Diagram Ke Dalam Database,,2019,dissertation,database_systems,2,2.0,15.0,320.60747663551405,62,,True,False,baseline,pengembangansistempemetaanotomatisentityrelationshipdiagramkedalamdatabase,320.60747663551405,landmark,True | ||
| 479 | −3204616723,,,Data Mining Concepts and Techniques Third Edition,Thammasat University Digital Collections,2021,article,database_systems,1,886.0,928.0,245.73952451819886,1176,66.8714,False,False,baseline,245.73952451819886,landmark,True | 479 | +3204616723,,,Data Mining Concepts and Techniques Third Edition,Thammasat University Digital Collections,2021,article,database_systems,1,886.0,928.0,245.73952451819886,1176,66.8714,False,False,baseline,dataminingconceptsandtechniquesthirdedition,245.73952451819886,landmark,True | ||
| 480 | −4415124086,10.1109/tbdata.2025.3618474,,The Faiss Library,IEEE Transactions on Big Data,2025,article,database_systems,4,454.0,454.0,148.4520005233547,454,166.1231,True,True,post,229.8415201133268,landmark,True | 480 | +3014294420,10.1017/9781108635592.003,,Introduction to Data Mining,Cambridge University Press eBooks,2019,book-chapter,database_systems,2,163.0,235.0,228.82157331393535,439,233.5555,True,False,baseline,introductiontodatamining,228.82157331393535,landmark,True | ||
| 481 | −3014294420,10.1017/9781108635592.003,,Introduction to Data Mining,Cambridge University Press eBooks,2019,book-chapter,database_systems,2,163.0,235.0,228.82157331393535,439,233.5555,True,False,baseline,228.82157331393535,landmark,True | 481 | +4324129606,10.1371/journal.pone.0279720,,"Data quality in online human-subjects research: Comparisons between MTurk, Prolific, CloudResearch, Qualtrics, and SONA",PLoS ONE,2023,article,database_systems,1,403.0,973.0,228.63551401869157,1500,345.1684,True,True,post,dataqualityinonlinehumansubjectsresearchcomparisonsbetweenmturkprolificcloudresearchqualtricsandsona,228.63551401869157,landmark,True | ||
| 482 | −4324129606,10.1371/journal.pone.0279720,,"Data quality in online human-subjects research: Comparisons between MTurk, Prolific, CloudResearch, Qualtrics, and SONA",PLoS ONE,2023,article,database_systems,1,403.0,973.0,228.63551401869157,1500,345.1684,True,True,post,228.63551401869157,landmark,True | 482 | +2963507231,10.1109/tkde.2017.2781227,,Untangling Blockchain: A Data Processing View of Blockchain Systems,IEEE Transactions on Knowledge and Data Engineering,2018,article,database_systems,5,201.0,405.0,214.72982183235243,1186,244.2498,True,True,baseline,untanglingblockchainadataprocessingviewofblockchainsystems,214.72982183235243,landmark,True | ||
| 483 | −7161586974,10.5070/p9.62178,,Paleobiology Database User Guide Version 2.0,PaleoBios,2026,article,database_systems,1,61.0,61.0,433.3770927968851,61,109.834,True,True,post,216.86845533876678,landmark,True | 483 | +3032576892,,,Comparative study on Python web frameworks: Flask and Django,Theseus (Ammattikorkeakoulujen),2020,dissertation,database_systems,4,7.0,22.0,206.90719257540604,43,,True,True,baseline,comparativestudyonpythonwebframeworksflaskanddjango,206.90719257540604,landmark,True | ||
| 484 | −2963507231,10.1109/tkde.2017.2781227,,Untangling Blockchain: A Data Processing View of Blockchain Systems,IEEE Transactions on Knowledge and Data Engineering,2018,article,database_systems,5,201.0,405.0,214.72982183235243,1186,244.2498,True,True,baseline,214.72982183235243,landmark,True | 484 | +3148181069,10.38094/jastt20165,,Classification Based on Decision Tree Algorithm for Machine Learning,Journal of Applied Science and Technology Trends,2021,article,database_systems,4,257.0,704.0,186.42308756553018,1871,279.1938,True,True,baseline,classificationbasedondecisiontreealgorithmformachinelearning,186.42308756553018,landmark,True | ||
| 485 | −2795038878,10.1145/3458723,1803.09010,Datasheets for datasets,Communications of the ACM,2021,article,database_systems,1,481.0,794.0,210.25558455544171,2104,205.3426,True,True,baseline,210.25558455544171,landmark,True | 485 | +3037795158,10.1016/s2589-7500(20)30142-4,,Applications of digital technology in COVID-19 pandemic planning and response,The Lancet Digital Health,2020,article,database_systems,1,350.0,591.0,172.09443665792568,987,179.9177,True,True,baseline,applicationsofdigitaltechnologyincovid19pandemicplanningandresponse,172.09443665792568,landmark,True | ||
| 486 | −3032576892,,,Comparative study on Python web frameworks: Flask and Django,Theseus (Ammattikorkeakoulujen),2020,dissertation,database_systems,4,7.0,22.0,206.90719257540604,43,,True,True,baseline,206.90719257540604,landmark,True | 486 | +4386450904,10.1145/3591366.3591378,,Linked Data - The Story So Far,ACM eBooks,2023,book-chapter,database_systems,2,285.0,301.0,166.41438539989264,319,42.7861,False,False,post,linkeddatathestorysofar,166.41438539989264,landmark,True | ||
| 487 | −3148181069,10.38094/jastt20165,,Classification Based on Decision Tree Algorithm for Machine Learning,Journal of Applied Science and Technology Trends,2021,article,database_systems,4,257.0,704.0,186.42308756553018,1871,279.1938,True,True,baseline,186.42308756553018,landmark,True | 487 | +7161586974,10.5070/p9.62178,,Paleobiology Database User Guide Version 2.0,PaleoBios,2026,article,database_systems,1,61.0,61.0,433.3770927968851,61,109.834,True,True,post,paleobiologydatabaseuserguideversion20,154.66369514364453,landmark,True | ||
| 488 | −3037795158,10.1016/s2589-7500(20)30142-4,,Applications of digital technology in COVID-19 pandemic planning and response,The Lancet Digital Health,2020,article,database_systems,1,350.0,591.0,172.09443665792568,987,179.9177,True,True,baseline,172.09443665792568,landmark,True | 488 | +4406085118,10.1145/3711118,2303.10158,Data-centric Artificial Intelligence: A Survey,ACM Computing Surveys,2025,article,database_systems,3,334.0,334.0,113.77687020232747,334,110.6889,True,True,post,datacentricartificialintelligenceasurvey,145.94850359802805,landmark,True | ||
| 489 | −4406085118,10.1145/3711118,2303.10158,Data-centric Artificial Intelligence: A Survey,ACM Computing Surveys,2025,article,database_systems,3,334.0,334.0,113.77687020232747,334,110.6889,True,True,post,169.09045752830647,landmark,True | 489 | +4408444355,10.1016/j.is.2025.102549,2207.14529,The effects of data quality on machine learning performance on tabular data,Information Systems,2025,article,database_systems,3,322.0,322.0,80.50468595378078,322,192.6654,True,True,post,theeffectsofdataqualityonmachinelearningperformanceontabulardata,140.70484478612286,landmark,True | ||
| 490 | −4386450904,10.1145/3591366.3591378,,Linked Data - The Story So Far,ACM eBooks,2023,book-chapter,database_systems,2,285.0,301.0,166.41438539989264,319,42.7861,False,False,post,166.41438539989264,landmark,True | 490 | +3202749896,10.3758/s13428-021-01694-3,,Data quality of platforms and panels for online behavioral research,Behavior Research Methods,2021,article,database_systems,1,164.0,469.0,121.87616674723884,1687,188.3384,False,True,baseline,dataqualityofplatformsandpanelsforonlinebehavioralresearch,121.87616674723884,landmark,True | ||
| 491 | −4408444355,10.1016/j.is.2025.102549,2207.14529,The effects of data quality on machine learning performance on tabular data,Information Systems,2025,article,database_systems,3,322.0,322.0,80.50468595378078,322,192.6654,True,True,post,163.01535126980446,landmark,True | 491 | +4400494356,10.11606/t.82.2024.tde-05072024-092611,,Digital health research governance: from FAIR to RE-AIM,,2024,dissertation,database_systems,1,1.0,3.0,116.82222222222222,3,,True,True,post,digitalhealthresearchgovernancefromfairtoreaim,116.82222222222222,landmark,True | ||
| 492 | −4361200200,10.1201/9780429459016,,Spatial Data Science,Chapman & Hall/CRC eBooks,2023,book,database_systems,2,278.0,753.0,129.30007763975155,1250,222.9593,True,False,post,129.30007763975155,landmark,True | 492 | +2593864460,10.1109/tbdata.2019.2921572,1702.08734,Billion-Scale Similarity Search with GPUs,IEEE Transactions on Big Data,2019,article,database_systems,6,384.0,765.0,115.95149891238218,3832,118.3163,True,True,pre,billionscalesimilaritysearchwithgpus,115.95149891238218,landmark,True | ||
| 493 | −3202749896,10.3758/s13428-021-01694-3,,Data quality of platforms and panels for online behavioral research,Behavior Research Methods,2021,article,database_systems,1,164.0,469.0,121.87616674723884,1687,188.3384,False,True,baseline,121.87616674723884,landmark,True | 493 | +4362632858,10.21941/kcss/2023/2,,Scalability Benchmarking of Cloud-Native Applications Applied to Event-Driven Microservices,,2023,dissertation,database_systems,4,2.0,4.0,115.45945945945945,4,,True,True,post,scalabilitybenchmarkingofcloudnativeapplicationsappliedtoeventdrivenmicroservices,115.45945945945945,landmark,True | ||
| 494 | −4400494356,10.11606/t.82.2024.tde-05072024-092611,,Digital health research governance: from FAIR to RE-AIM,,2024,dissertation,database_systems,1,1.0,3.0,116.82222222222222,3,,True,True,post,116.82222222222222,landmark,True | 494 | +3005599391,,,"Entangled Devices : An ethnographic study of students, mobile phones and capitalism",Työväentutkimus Vuosikirja,2020,dissertation,database_systems,1,11.0,12.0,112.8584686774942,15,,True,True,baseline,entangleddevicesanethnographicstudyofstudentsmobilephonesandcapitalism,112.8584686774942,landmark,True | ||
| 495 | −2593864460,10.1109/tbdata.2019.2921572,1702.08734,Billion-Scale Similarity Search with GPUs,IEEE Transactions on Big Data,2019,article,database_systems,6,384.0,765.0,115.95149891238218,3832,118.3163,True,True,pre,115.95149891238218,landmark,True | 495 | +4402762189,10.3390/electronics13183762,,Leveraging AI in E-Learning: Personalized Learning and Adaptive Assessment through Cognitive Neuropsychology—A Systematic Analysis,Electronics,2024,article,database_systems,2,199.0,317.0,95.44078925847174,317,121.3104,True,True,post,leveragingaiinelearningpersonalizedlearningandadaptiveassessmentthroughcognitiveneuropsychologyasystematicanalysis,95.44078925847174,landmark,True | ||
| 496 | −4362632858,10.21941/kcss/2023/2,,Scalability Benchmarking of Cloud-Native Applications Applied to Event-Driven Microservices,,2023,dissertation,database_systems,4,2.0,4.0,115.45945945945945,4,,True,True,post,115.45945945945945,landmark,True | 496 | +4380791906,10.31979/etd.qrrp-3equ,,NoSQL Databases in Kubernetes,,2023,dissertation,database_systems,4,3.0,3.0,86.5945945945946,3,,True,True,post,nosqldatabasesinkubernetes,86.5945945945946,landmark,True | ||
| 497 | −3005599391,,,"Entangled Devices : An ethnographic study of students, mobile phones and capitalism",Työväentutkimus Vuosikirja,2020,dissertation,database_systems,1,11.0,12.0,112.8584686774942,15,,True,True,baseline,112.8584686774942,landmark,True | 497 | +4401495975,10.1186/s40537-024-00973-y,,Enhancing K-nearest neighbor algorithm: a comprehensive review and performance analysis of modifications,Journal Of Big Data,2024,article,database_systems,6,279.0,520.0,83.4394876991742,520,96.1656,True,True,post,enhancingknearestneighboralgorithmacomprehensivereviewandperformanceanalysisofmodifications,83.4394876991742,landmark,True | ||
| 498 | −4396219753,10.4018/979-8-3693-2909-2.ch002,,Machine Learning Mastery,"Advances in systems analysis, software engineering, and high performance computing book series",2024,book-chapter,database_systems,2,195.0,195.0,108.23837846298326,195,27.8969,True,False,post,108.23837846298326,landmark,True | 498 | +4408925021,10.3390/higheredu4020017,,The Impact of Artificial Intelligence on Personalized Learning in Higher Education: A Systematic Review,Trends in Higher Education,2025,review,database_systems,2,189.0,189.0,29.153309284818068,189,31.7339,True,True,post,theimpactofartificialintelligenceonpersonalizedlearninginhighereducationasystematicreview,82.5876262875069,landmark,True | ||
| 499 | −4408925021,10.3390/higheredu4020017,,The Impact of Artificial Intelligence on Personalized Learning in Higher Education: A Systematic Review,Trends in Higher Education,2025,review,database_systems,2,189.0,189.0,29.153309284818068,189,31.7339,True,True,post,95.68292357140696,landmark,True | 499 | +2126034719,10.1142/9789811201967_0002,,Classification and Regression Trees,Series in machine perception and artificial intelligence,2019,book-chapter,database_systems,1,73.0,81.0,78.87041463161177,173,28.4262,False,False,baseline,classificationandregressiontrees,78.87041463161177,landmark,True | ||
| 500 | −4402762189,10.3390/electronics13183762,,Leveraging AI in E-Learning: Personalized Learning and Adaptive Assessment through Cognitive Neuropsychology—A Systematic Analysis,Electronics,2024,article,database_systems,2,199.0,317.0,95.44078925847174,317,121.3104,True,True,post,95.44078925847174,landmark,True | 500 | +4319779432,10.1007/978-3-031-12382-5_106,,NoSQL: Future of BigData Analytics Characteristics and Comparison with RDBMS,Studies in computational intelligence,2023,book-chapter,database_systems,2,62.0,86.0,78.4514106583072,87,75.6244,False,True,post,nosqlfutureofbigdataanalyticscharacteristicsandcomparisonwithrdbms,78.4514106583072,landmark,True | ||
| 501 | −4380791906,10.31979/etd.qrrp-3equ,,NoSQL Databases in Kubernetes,,2023,dissertation,database_systems,4,3.0,3.0,86.5945945945946,3,,True,True,post,86.5945945945946,landmark,True | 501 | +4229641819,10.1017/9781108684163,,Mining of Massive Datasets,Cambridge University Press eBooks,2020,book,database_systems,4,152.0,228.0,77.43724928366763,424,76.3217,True,False,baseline,miningofmassivedatasets,77.43724928366763,landmark,True | ||
| 502 | −7118085507,10.1007/s41019-025-00335-5,2402.19473,Retrieval-Augmented Generation for AI-Generated Content: A Survey,Data Science and Engineering,2026,article,information_retrieval,7,208.0,208.0,231.4627186325106,208,390.1628,True,True,post,739.4858804994016,landmark,True | 502 | +7118085507,10.1007/s41019-025-00335-5,2402.19473,Retrieval-Augmented Generation for AI-Generated Content: A Survey,Data Science and Engineering,2026,article,information_retrieval,7,208.0,208.0,231.4627186325106,208,390.1628,True,True,post,retrievalaugmentedgenerationforaigeneratedcontentasurvey,527.3778457357059,landmark,True | ||
| 503 | −2274895364,10.1145/3591366.3591376,,The Semantic Web: A New Form of Web Content that is Meaningful to Computers will Unleash a Revolution of New Possibilities,ACM eBooks,2023,book-chapter,information_retrieval,2,578.0,606.0,335.0402576489533,1324,58.9755,False,False,post,335.0402576489533,landmark,True | 503 | +2274895364,10.1145/3591366.3591376,,The Semantic Web: A New Form of Web Content that is Meaningful to Computers will Unleash a Revolution of New Possibilities,ACM eBooks,2023,book-chapter,information_retrieval,2,578.0,606.0,335.0402576489533,1324,58.9755,False,False,post,thesemanticwebanewformofwebcontentthatismeaningfultocomputerswillunleasharevolutionofnewpossibilities,335.0402576489533,landmark,True | ||
| 504 | −4394947112,10.1145/3805774,2404.10981,A Survey on Retrieval-Augmented Text Generation for Large Language Models,ACM Computing Surveys,2026,article,information_retrieval,5,70.0,70.0,77.8961072320949,70,184.2436,True,True,post,248.8654405526832,landmark,True | 504 | +4401857375,10.1145/3637528.3671470,2405.06211,A Survey on RAG Meeting LLMs: Towards Retrieval-Augmented Large Language Models,ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD),2024,conference-paper,information_retrieval,8,401.0,795.0,220.97973411345592,795,241.8493,True,True,post,asurveyonragmeetingllmstowardsretrievalaugmentedlargelanguagemodels,220.97973411345592,landmark,True | ||
| 505 | −3045200674,10.1145/3397271.3401063,,LightGCN,International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR),2020,conference-paper,information_retrieval,2,321.0,803.0,226.7421667675404,4430,311.5512,True,False,baseline,226.7421667675404,landmark,True | 505 | +2967467,10.26190/unsworks/23395,,Social networks and collaborative filtering for large-scale requirements elicitation,"UNSWorks (University of New South Wales, Sydney, Australia)",2022,dissertation,information_retrieval,2,22.0,23.0,199.5062656641604,34,,True,True,baseline,socialnetworksandcollaborativefilteringforlargescalerequirementselicitation,199.5062656641604,landmark,True | ||
| 506 | −4401857375,10.1145/3637528.3671470,2405.06211,A Survey on RAG Meeting LLMs: Towards Retrieval-Augmented Large Language Models,ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD),2024,conference-paper,information_retrieval,8,401.0,795.0,220.97973411345592,795,241.8493,True,True,post,220.97973411345592,landmark,True | 506 | +4394947112,10.1145/3805774,2404.10981,A Survey on Retrieval-Augmented Text Generation for Large Language Models,ACM Computing Surveys,2026,article,information_retrieval,5,70.0,70.0,77.8961072320949,70,184.2436,True,True,post,asurveyonretrievalaugmentedtextgenerationforlargelanguagemodels,177.48292885336258,landmark,True | ||
| 507 | −2967467,10.26190/unsworks/23395,,Social networks and collaborative filtering for large-scale requirements elicitation,"UNSWorks (University of New South Wales, Sydney, Australia)",2022,dissertation,information_retrieval,2,22.0,23.0,199.5062656641604,34,,True,True,baseline,199.5062656641604,landmark,True | 507 | +3097300053,10.1145/3535101,2011.02260,Graph Neural Networks in Recommender Systems: A Survey,ACM Computing Surveys,2022,article,information_retrieval,4,336.0,711.0,174.743146538718,1326,268.2685,True,True,baseline,graphneuralnetworksinrecommendersystemsasurvey,174.743146538718,landmark,True | ||
| 508 | −3097300053,10.1145/3535101,2011.02260,Graph Neural Networks in Recommender Systems: A Survey,ACM Computing Surveys,2022,article,information_retrieval,4,336.0,711.0,174.743146538718,1326,268.2685,True,True,baseline,174.743146538718,landmark,True | 508 | +4288083766,10.1145/3285029,1707.07435,Deep Learning Based Recommender System,ACM Computing Surveys,2019,article,information_retrieval,3,224.0,396.0,161.64067295931318,1511,176.8236,True,False,baseline,deeplearningbasedrecommendersystem,161.64067295931318,landmark,True | ||
| 509 | −4288083766,10.1145/3285029,1707.07435,Deep Learning Based Recommender System,ACM Computing Surveys,2019,article,information_retrieval,3,224.0,396.0,161.64067295931318,1511,176.8236,True,False,baseline,161.64067295931318,landmark,True | 509 | +4395483946,10.1186/s41239-024-00453-6,,Generative AI and the future of higher education: a threat to academic integrity or reformation? Evidence from multicultural perspectives,International Journal of Educational Technology in Higher Education,2024,article,information_retrieval,2,263.0,529.0,159.26869879410583,529,202.4391,True,True,post,generativeaiandthefutureofhighereducationathreattoacademicintegrityorreformationevidencefrommulticulturalperspectives,159.26869879410583,landmark,True | ||
| 510 | −4395483946,10.1186/s41239-024-00453-6,,Generative AI and the future of higher education: a threat to academic integrity or reformation? Evidence from multicultural perspectives,International Journal of Educational Technology in Higher Education,2024,article,information_retrieval,2,263.0,529.0,159.26869879410583,529,202.4391,True,True,post,159.26869879410583,landmark,True | 510 | +4394867512,10.57784/1992/7835,,Privacy-enabled scalable recommender systems,HAL (Le Centre pour la Communication Scientifique Directe),2024,dissertation,information_retrieval,3,4.0,4.0,155.76296296296297,4,,True,True,post,privacyenabledscalablerecommendersystems,155.76296296296297,landmark,True | ||
| 511 | −4394867512,10.57784/1992/7835,,Privacy-enabled scalable recommender systems,HAL (Le Centre pour la Communication Scientifique Directe),2024,dissertation,information_retrieval,3,4.0,4.0,155.76296296296297,4,,True,True,post,155.76296296296297,landmark,True | 511 | +2408538552,10.1609/aaai.v26i1.8100,,Fused Matrix Factorization with Geographical and Social Influence in Location-Based Social Networks,Proceedings of the AAAI Conference on Artificial Intelligence,2021,conference-paper,information_retrieval,1,519.0,541.0,151.80700662176693,572,22.962,True,True,baseline,fusedmatrixfactorizationwithgeographicalandsocialinfluenceinlocationbasedsocialnetworks,151.80700662176693,landmark,True | ||
| 512 | −2408538552,10.1609/aaai.v26i1.8100,,Fused Matrix Factorization with Geographical and Social Influence in Location-Based Social Networks,Proceedings of the AAAI Conference on Artificial Intelligence,2021,conference-paper,information_retrieval,1,519.0,541.0,151.80700662176693,572,22.962,True,True,baseline,151.80700662176693,landmark,True | 512 | +4401834466,10.1007/s11280-024-01291-2,2305.19860,A survey on large language models for recommendation,World Wide Web,2024,article,information_retrieval,3,272.0,487.0,146.62354690497077,487,184.0703,False,True,post,asurveyonlargelanguagemodelsforrecommendation,146.62354690497077,landmark,True | ||
| 513 | −4401834466,10.1007/s11280-024-01291-2,2305.19860,A survey on large language models for recommendation,World Wide Web,2024,article,information_retrieval,3,272.0,487.0,146.62354690497077,487,184.0703,False,True,post,146.62354690497077,landmark,True | 513 | +4315977496,10.1145/3568022,2109.12843,"A Survey of Graph Neural Networks for Recommender Systems: Challenges, Methods, and Directions",ACM Transactions on Recommender Systems,2023,article,information_retrieval,3,326.0,612.0,143.4379748166452,756,176.9462,True,True,baseline,asurveyofgraphneuralnetworksforrecommendersystemschallengesmethodsanddirections,143.4379748166452,landmark,True | ||
| 514 | −4315977496,10.1145/3568022,2109.12843,"A Survey of Graph Neural Networks for Recommender Systems: Challenges, Methods, and Directions",ACM Transactions on Recommender Systems,2023,article,information_retrieval,3,326.0,612.0,143.4379748166452,756,176.9462,True,True,baseline,143.4379748166452,landmark,True | 514 | +4394994587,10.1109/tkde.2024.3392335,2307.02046,Recommender Systems in the Era of Large Language Models (LLMs),IEEE Transactions on Knowledge and Data Engineering,2024,article,information_retrieval,5,277.0,469.0,141.20419609534147,469,176.4167,True,True,post,recommendersystemsintheeraoflargelanguagemodelsllms,141.20419609534147,landmark,True | ||
| 515 | −4394994587,10.1109/tkde.2024.3392335,2307.02046,Recommender Systems in the Era of Large Language Models (LLMs),IEEE Transactions on Knowledge and Data Engineering,2024,article,information_retrieval,5,277.0,469.0,141.20419609534147,469,176.4167,True,True,post,141.20419609534147,landmark,True | 515 | +4400531953,10.1145/3626772.3657878,2309.07597,C-Pack: Packed Resources For General Chinese Embeddings,International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR),2024,conference-paper,information_retrieval,6,256.0,485.0,134.81153590569323,485,146.3264,True,True,post,cpackpackedresourcesforgeneralchineseembeddings,134.81153590569323,landmark,True | ||
| 516 | −4400531953,10.1145/3626772.3657878,2309.07597,C-Pack: Packed Resources For General Chinese Embeddings,International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR),2024,conference-paper,information_retrieval,6,256.0,485.0,134.81153590569323,485,146.3264,True,True,post,134.81153590569323,landmark,True | 516 | +2945827670,10.1145/3331184.3331267,1905.08108,Neural Graph Collaborative Filtering,International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR),2019,conference-paper,information_retrieval,3,149.0,465.0,133.92825599565188,3237,200.9814,True,True,baseline,neuralgraphcollaborativefiltering,133.92825599565188,landmark,True | ||
| 517 | −2945827670,10.1145/3331184.3331267,1905.08108,Neural Graph Collaborative Filtering,International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR),2019,conference-paper,information_retrieval,3,149.0,465.0,133.92825599565188,3237,200.9814,True,True,baseline,133.92825599565188,landmark,True | 517 | +4387316367,10.1134/s1995080223060471,,Ontological Approach to a Knowledge Graph Construction in a Semantic Library,Lobachevskii Journal of Mathematics,2023,dissertation,information_retrieval,4,10.0,16.0,133.0924024640657,18,,True,False,post,ontologicalapproachtoaknowledgegraphconstructioninasemanticlibrary,133.0924024640657,landmark,True | ||
| 518 | −2945623882,10.1145/3292500.3330989,1905.07854,KGAT,ACM SIGKDD International Conference on Knowledge Discovery & Data Mining (KDD),2019,conference-paper,information_retrieval,5,157.0,465.0,133.92825599565188,2147,160.7851,True,True,baseline,133.92825599565188,landmark,True | 518 | +2914721378,10.1145/3308558.3313488,1902.07243,Graph Neural Networks for Social Recommendation,,2019,conference-paper,information_retrieval,2,141.0,441.0,127.01582987974727,1984,153.1188,True,True,baseline,graphneuralnetworksforsocialrecommendation,127.01582987974727,landmark,True | ||
| 519 | −4387316367,10.1134/s1995080223060471,,Ontological Approach to a Knowledge Graph Construction in a Semantic Library,Lobachevskii Journal of Mathematics,2023,dissertation,information_retrieval,4,10.0,16.0,133.0924024640657,18,,True,False,post,133.0924024640657,landmark,True | 519 | +2963707260,10.1109/tkde.2018.2833443,,Heterogeneous Information Network Embedding for Recommendation,IEEE Transactions on Knowledge and Data Engineering,2018,article,information_retrieval,5,72.0,234.0,124.06611928091473,1204,188.0081,True,True,baseline,heterogeneousinformationnetworkembeddingforrecommendation,124.06611928091473,landmark,True | ||
| 520 | −7118165812,10.1007/s10115-025-02639-4,,Leveraging hierarchy-aware diffusion model and knowledge-enhanced contrastive learning for recommendation,Knowledge and Information Systems,2026,article,information_retrieval,2,36.0,36.0,255.7635301752109,36,329.5019,False,False,post,127.98794085566564,landmark,True | 520 | +3094605801,10.1145/3404835.3462862,2010.10783,Self-supervised Graph Learning for Recommendation,International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR),2021,conference-paper,information_retrieval,3,141.0,434.0,121.78233063557643,1488,179.1038,True,True,baseline,selfsupervisedgraphlearningforrecommendation,121.78233063557643,landmark,True | ||
| 521 | −2914721378,10.1145/3308558.3313488,1902.07243,Graph Neural Networks for Social Recommendation,,2019,conference-paper,information_retrieval,2,141.0,441.0,127.01582987974727,1984,153.1188,True,True,baseline,127.01582987974727,landmark,True | 521 | +3092103025,10.1145/3564284,2010.03240,Bias and Debias in Recommender System: A Survey and Future Directions,ACM Transactions on Information Systems,2022,article,information_retrieval,3,255.0,475.0,116.74120197734325,733,146.66,True,True,baseline,biasanddebiasinrecommendersystemasurveyandfuturedirections,116.74120197734325,landmark,True | ||
| 522 | −2963707260,10.1109/tkde.2018.2833443,,Heterogeneous Information Network Embedding for Recommendation,IEEE Transactions on Knowledge and Data Engineering,2018,article,information_retrieval,5,72.0,234.0,124.06611928091473,1204,188.0081,True,True,baseline,124.06611928091473,landmark,True | 522 | +4323539384,10.5463/thesis.16,,Scientific dataset recommendation with semantic techniques,,2023,dissertation,information_retrieval,3,4.0,4.0,115.45945945945945,4,,True,True,post,scientificdatasetrecommendationwithsemantictechniques,115.45945945945945,landmark,True | ||
| 523 | −3094605801,10.1145/3404835.3462862,2010.10783,Self-supervised Graph Learning for Recommendation,International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR),2021,conference-paper,information_retrieval,3,141.0,434.0,121.78233063557643,1488,179.1038,True,True,baseline,121.78233063557643,landmark,True | 523 | +2604314403,10.1007/978-3-319-93417-4_38,,Modeling Relational Data with Graph Convolutional Networks,Lecture notes in computer science,2018,conference-paper,information_retrieval,4,278.0,743.0,115.04989507468214,5096,152.5097,True,True,baseline,modelingrelationaldatawithgraphconvolutionalnetworks,115.04989507468214,landmark,True | ||
| 524 | −172918197,10.1007/978-3-030-63007-2,,Computational Collective Intelligence,Lecture notes in computer science,2020,conference-paper,information_retrieval,1,425.0,427.0,120.57148843056008,592,3.7704,False,False,baseline,120.57148843056008,landmark,True | 524 | +3133849783,10.1109/icde53745.2022.00099,2010.14395,Contrastive Learning for Sequential Recommendation,Proceedings - International Conference on Data Engineering,2022,conference-paper,information_retrieval,4,188.0,375.0,112.68765439918921,663,121.9524,True,True,baseline,contrastivelearningforsequentialrecommendation,112.68765439918921,landmark,True | ||
| 525 | −3092103025,10.1145/3564284,2010.03240,Bias and Debias in Recommender System: A Survey and Future Directions,ACM Transactions on Information Systems,2022,article,information_retrieval,3,255.0,475.0,116.74120197734325,733,146.66,True,True,baseline,116.74120197734325,landmark,True | 525 | +2995202934,,,Enhancing VAEs for Collaborative Filtering: Flexible Priors & Gating Mechanisms,,2019,dissertation,information_retrieval,3,2.0,11.0,110.24841915085818,1,,False,False,baseline,enhancingvaesforcollaborativefilteringflexiblepriorsgatingmechanisms,110.24841915085818,landmark,True | ||
| 526 | −4323539384,10.5463/thesis.16,,Scientific dataset recommendation with semantic techniques,,2023,dissertation,information_retrieval,3,4.0,4.0,115.45945945945945,4,,True,True,post,115.45945945945945,landmark,True | 526 | +4400118952,10.1007/s11280-024-01276-1,2307.16376,When large language models meet personalization: perspectives of challenges and opportunities,World Wide Web,2024,article,information_retrieval,4,240.0,358.0,107.78486610262739,358,135.4696,True,True,post,whenlargelanguagemodelsmeetpersonalizationperspectivesofchallengesandopportunities,107.78486610262739,landmark,True | ||
| 527 | −4381304672,10.1007/978-3-031-40744-4_5,,Suspending OpenMP Tasks on Asynchronous Events: Extending the Taskwait Construct,Lecture notes in computer science,2023,conference-paper,distributed_computing,3,12262.0,12891.0,2048.4305614736636,12935,942.1133,False,True,post,2048.4305614736636,landmark,True | 527 | +4381304672,10.1007/978-3-031-40744-4_5,,Suspending OpenMP Tasks on Asynchronous Events: Extending the Taskwait Construct,Lecture notes in computer science,2023,conference-paper,distributed_computing,3,12262.0,12891.0,2048.4305614736636,12935,942.1133,False,True,post,suspendingopenmptasksonasynchronouseventsextendingthetaskwaitconstruct,2048.4305614736636,landmark,True | ||
| 528 | −2122465391,10.21276/ijre.2018.5.5.4,,MapReduce: Simplified Data Processing on Large Cluster,INTERNATIONAL JOURNAL OF RESEARCH AND ENGINEERING,2018,article,distributed_computing,4,2098.0,2186.0,1159.010840803759,2948,215.3255,True,False,baseline,1159.010840803759,landmark,True | 528 | +2122465391,10.21276/ijre.2018.5.5.4,,MapReduce: Simplified Data Processing on Large Cluster,INTERNATIONAL JOURNAL OF RESEARCH AND ENGINEERING,2018,article,distributed_computing,4,2098.0,2186.0,1159.010840803759,2948,215.3255,True,False,baseline,mapreducesimplifieddataprocessingonlargecluster,1159.010840803759,landmark,True | ||
| 529 | −4255535209,10.1504/ijwgs.2018.10016848,,Blockchain challenges and opportunities: a survey,International Journal of Web and Grid Services,2018,article,distributed_computing,4,357.0,804.0,426.27846111904034,1582,497.7393,True,False,baseline,426.27846111904034,landmark,True | 529 | +4255535209,10.1504/ijwgs.2018.10016848,,Blockchain challenges and opportunities: a survey,International Journal of Web and Grid Services,2018,article,distributed_computing,4,357.0,804.0,426.27846111904034,1582,497.7393,True,False,baseline,blockchainchallengesandopportunitiesasurvey,426.27846111904034,landmark,True | ||
| 530 | −1973501242,10.1145/3335772.3335934,,"Time, clocks, and the ordering of events in a distributed system",ACM eBooks,2019,book-chapter,distributed_computing,2,386.0,424.0,331.9512682244857,1979,73.0762,True,False,baseline,331.9512682244857,landmark,True | 530 | +1973501242,10.1145/3335772.3335934,,"Time, clocks, and the ordering of events in a distributed system",ACM eBooks,2019,book-chapter,distributed_computing,2,386.0,424.0,331.9512682244857,1979,73.0762,True,False,baseline,timeclocksandtheorderingofeventsinadistributedsystem,331.9512682244857,landmark,True | ||
| 531 | −2897450989,10.1504/ijwgs.2018.095647,,Blockchain challenges and opportunities: a survey,International Journal of Web and Grid Services,2018,article,distributed_computing,4,251.0,625.0,331.37318184005005,3328,432.6596,True,False,baseline,331.37318184005005,landmark,True | 531 | +2120510885,10.1145/3335772.3335936,,The Byzantine generals problem,ACM eBooks,2019,book-chapter,distributed_computing,3,230.0,335.0,262.2728180547234,1033,180.7332,True,False,baseline,thebyzantinegeneralsproblem,262.2728180547234,landmark,True | ||
| 532 | −2120510885,10.1145/3335772.3335936,,The Byzantine generals problem,ACM eBooks,2019,book-chapter,distributed_computing,3,230.0,335.0,262.2728180547234,1033,180.7332,True,False,baseline,262.2728180547234,landmark,True | 532 | +2902511784,10.5555/3291656.3291738,,Dynamic data race detection for OpenMP programs,Rice Research Repository (Rice University),2018,dissertation,distributed_computing,5,1.0,12.0,219.90243902439025,20,,True,False,baseline,dynamicdataracedetectionforopenmpprograms,219.90243902439025,landmark,True | ||
| 533 | −2902511784,10.5555/3291656.3291738,,Dynamic data race detection for OpenMP programs,Rice Research Repository (Rice University),2018,dissertation,distributed_computing,5,1.0,12.0,219.90243902439025,20,,True,False,baseline,219.90243902439025,landmark,True | 533 | +3182706339,10.7717/peerj-cs.623,,"The coefficient of determination R-squared is more informative than SMAPE, MAE, MAPE, MSE and RMSE in regression analysis evaluation",PeerJ Computer Science,2021,article,distributed_computing,1,409.0,1160.0,189.8515007898894,5310,437.5495,True,True,baseline,thecoefficientofdeterminationrsquaredismoreinformativethansmapemaemapemseandrmseinregressionanalysisevaluation,189.8515007898894,landmark,True | ||
| 534 | −4300092207,10.4230/oasics.nines.2026.5,,OrbitalBrain: A Distributed Framework for Training ML Models in Space,DROPS (Schloss Dagstuhl – Leibniz Center for Informatics),2026,article,distributed_computing,4,54.0,54.0,70.47771428571428,54,0.0,True,True,post,191.98191128349848,landmark,True | 534 | +4387321091,10.1145/3600006.3613165,2309.06180,Efficient Memory Management for Large Language Model Serving with PagedAttention,Symposium on Operating Systems Principles,2023,conference-paper,distributed_computing,9,173.0,787.0,181.49662514489972,1716,324.3817,True,True,post,efficientmemorymanagementforlargelanguagemodelservingwithpagedattention,181.49662514489972,landmark,True | ||
| 535 | −3182706339,10.7717/peerj-cs.623,,"The coefficient of determination R-squared is more informative than SMAPE, MAE, MAPE, MSE and RMSE in regression analysis evaluation",PeerJ Computer Science,2021,article,distributed_computing,1,409.0,1160.0,189.8515007898894,5310,437.5495,True,True,baseline,189.8515007898894,landmark,True | 535 | +2103863878,10.1145/3212998,,Majority is not enough,Communications of the ACM,2018,article,distributed_computing,4,170.0,327.0,173.37444873871416,742,161.0924,True,False,baseline,majorityisnotenough,173.37444873871416,landmark,True | ||
| 536 | −4387321091,10.1145/3600006.3613165,2309.06180,Efficient Memory Management for Large Language Model Serving with PagedAttention,Symposium on Operating Systems Principles,2023,conference-paper,distributed_computing,9,173.0,787.0,181.49662514489972,1716,324.3817,True,True,post,181.49662514489972,landmark,True | 536 | +1502629466,10.1007/978-3-030-26253-2,,Principles of Distributed Database Systems,Springer eBooks,2019,book,distributed_computing,3,789.0,848.0,166.39169139465875,2345,55.809,False,False,baseline,principlesofdistributeddatabasesystems,166.39169139465875,landmark,True | ||
| 537 | −2103863878,10.1145/3212998,,Majority is not enough,Communications of the ACM,2018,article,distributed_computing,4,170.0,327.0,173.37444873871416,742,161.0924,True,False,baseline,173.37444873871416,landmark,True | 537 | +3036601975,10.4230/oasics.nines.2026.13,2006.11477,In-Kernel Aggregation and Broadcast Acceleration for Distributed Communication,arXiv (Cornell University),2020,preprint,distributed_computing,10,200.0,699.0,157.87121576165305,2368,,True,True,baseline,inkernelaggregationandbroadcastaccelerationfordistributedcommunication,157.87121576165305,landmark,True | ||
| 538 | −7130586201,10.1109/tsmc.2026.3661716,,Dynamic Event-Triggered Control for Human–Machine Cooperative Systems Based on Dynamic Authority Allocation,IEEE Transactions on Systems Man and Cybernetics Systems,2026,article,distributed_computing,1,47.0,47.0,132.70961019857808,47,167.5021,True,False,post,167.09536722823015,landmark,True | 538 | +4393370257,10.57784/1992/7669,,Distributed methods for resource allocation - a passivity-based approach,HAL (Le Centre pour la Communication Scientifique Directe),2024,dissertation,distributed_computing,2,6.0,6.0,151.2173913043478,6,,True,True,post,distributedmethodsforresourceallocationapassivitybasedapproach,151.2173913043478,landmark,True | ||
| 539 | −1502629466,10.1007/978-3-030-26253-2,,Principles of Distributed Database Systems,Springer eBooks,2019,book,distributed_computing,3,789.0,848.0,166.39169139465875,2345,55.809,False,False,baseline,166.39169139465875,landmark,True | 539 | +2973502831,,,Performance Analysis of Proof-of-Elapsed-Time (PoET) Consensus in the Sawtooth Blockchain Framework,Scholars' Bank (University of Oregon),2019,dissertation,distributed_computing,5,3.0,14.0,140.31616982836496,28,,True,False,baseline,performanceanalysisofproofofelapsedtimepoetconsensusinthesawtoothblockchainframework,140.31616982836496,landmark,True | ||
| 540 | −3036601975,10.4230/oasics.nines.2026.13,2006.11477,In-Kernel Aggregation and Broadcast Acceleration for Distributed Communication,arXiv (Cornell University),2020,preprint,distributed_computing,10,200.0,699.0,157.87121576165305,2368,,True,True,baseline,157.87121576165305,landmark,True | 540 | +4300092207,10.4230/oasics.nines.2026.5,,OrbitalBrain: A Distributed Framework for Training ML Models in Space,DROPS (Schloss Dagstuhl – Leibniz Center for Informatics),2026,article,distributed_computing,4,54.0,54.0,70.47771428571428,54,0.0,True,True,post,orbitalbrainadistributedframeworkfortrainingmlmodelsinspace,136.9154022583083,landmark,True | ||
| 541 | −2251066406,10.7916/tv64-xc19,,Bypassing Races in Live Applications with Execution Filters,Operating Systems Design and Implementation,2026,article,distributed_computing,4,44.0,44.0,638.0,53,0.0,True,True,post,156.42970549025802,landmark,True | 541 | +2962850638,,,Logiikka ja vaativuus hajautetussa laskennassa,Aaltodoc (Aalto University),2019,dissertation,distributed_computing,4,14.0,22.0,123.65517241379311,38,,True,True,baseline,logiikkajavaativuushajautetussalaskennassa,123.65517241379311,landmark,True | ||
| 542 | −3098508067,10.82308/18894,,Personal volunteer computing,,2020,dissertation,distributed_computing,4,17.0,18.0,154.15037593984962,25,,True,True,baseline,154.15037593984962,landmark,True | 542 | +7130586201,10.1109/tsmc.2026.3661716,,Dynamic Event-Triggered Control for Human–Machine Cooperative Systems Based on Dynamic Authority Allocation,IEEE Transactions on Systems Man and Cybernetics Systems,2026,article,distributed_computing,1,47.0,47.0,132.70961019857808,47,167.5021,True,False,post,dynamiceventtriggeredcontrolforhumanmachinecooperativesystemsbasedondynamicauthorityallocation,119.16710937297202,landmark,True | ||
| 543 | −4393370257,10.57784/1992/7669,,Distributed methods for resource allocation - a passivity-based approach,HAL (Le Centre pour la Communication Scientifique Directe),2024,dissertation,distributed_computing,2,6.0,6.0,151.2173913043478,6,,True,True,post,151.2173913043478,landmark,True | 543 | +3012404397,10.5626/ktcp.2020.26.3.135,1801.10228,Santa Claus Algorithm: Agent-Based Consensus Preprocessing Method for Scalability Improvement in Private Blockchain Environment,정보과학회 컴퓨팅의 실제 논문지,2020,article,distributed_computing,3,328.0,400.0,116.47677607981433,1,0.2325,True,True,baseline,santaclausalgorithmagentbasedconsensuspreprocessingmethodforscalabilityimprovementinprivateblockchainenvironment,116.47677607981433,landmark,True | ||
| 544 | −2973502831,,,Performance Analysis of Proof-of-Elapsed-Time (PoET) Consensus in the Sawtooth Blockchain Framework,Scholars' Bank (University of Oregon),2019,dissertation,distributed_computing,5,3.0,14.0,140.31616982836496,28,,True,False,baseline,140.31616982836496,landmark,True | 544 | +2251066406,10.7916/tv64-xc19,,Bypassing Races in Live Applications with Execution Filters,Operating Systems Design and Implementation,2026,article,distributed_computing,4,44.0,44.0,638.0,53,0.0,True,True,post,bypassingracesinliveapplicationswithexecutionfilters,111.56069813639934,landmark,True | ||
| 545 | −1572499759,10.56726/irjmets66464,,Microservices Architecture,International Research Journal of Modernization in Engineering Technology and Science,2025,article,distributed_computing,4,245.0,245.0,93.19077007930923,245,0.8816,True,True,post,124.03341944441644,landmark,True | 545 | +2970155754,,,Learning Generalizable Device Placement Algorithms for Distributed Machine Learning,DSpace@MIT (Massachusetts Institute of Technology),2019,dissertation,distributed_computing,5,5.0,11.0,110.24841915085818,22,,True,False,baseline,learninggeneralizabledeviceplacementalgorithmsfordistributedmachinelearning,110.24841915085818,landmark,True | ||
| 546 | −2962850638,,,Logiikka ja vaativuus hajautetussa laskennassa,Aaltodoc (Aalto University),2019,dissertation,distributed_computing,4,14.0,22.0,123.65517241379311,38,,True,True,baseline,123.65517241379311,landmark,True | 546 | +4220966162,10.1016/j.iot.2022.100514,2203.04159,AI for next generation computing: Emerging trends and future directions,Internet of Things,2022,article,distributed_computing,5,237.0,423.0,103.9611124977183,686,150.3082,False,True,baseline,aifornextgenerationcomputingemergingtrendsandfuturedirections,103.9611124977183,landmark,True | ||
| 547 | −7123363719,10.1016/j.cnsns.2026.109676,,ADP-based dynamic event-triggered fault-tolerant control for nonlinear systems with actuator failures and full-state time-varying constraints,Communications in Nonlinear Science and Numerical Simulation,2026,article,distributed_computing,1,33.0,33.0,93.17908801176759,33,117.6079,False,False,post,117.32227911769351,landmark,True | 547 | +2926987861,10.1109/comst.2020.2969706,1904.04098,A Survey of Distributed Consensus Protocols for Blockchain Networks,IEEE Communications Surveys & Tutorials,2020,article,distributed_computing,6,177.0,302.0,87.93996594025982,841,109.9497,True,True,baseline,asurveyofdistributedconsensusprotocolsforblockchainnetworks,87.93996594025982,landmark,True | ||
| 548 | −3012404397,10.5626/ktcp.2020.26.3.135,1801.10228,Santa Claus Algorithm: Agent-Based Consensus Preprocessing Method for Scalability Improvement in Private Blockchain Environment,정보과학회 컴퓨팅의 실제 논문지,2020,article,distributed_computing,3,328.0,400.0,116.47677607981433,1,0.2325,True,True,baseline,116.47677607981433,landmark,True | 548 | +2794533297,10.1109/sp.2018.000-5,,"OmniLedger: A Secure, Scale-Out, Decentralized Ledger via Sharding",Proceedings - IEEE Symposium on Security and Privacy/Proceedings of the ... IEEE Symposium on Security and Privacy,2018,conference-paper,distributed_computing,5,135.0,287.0,85.09604562737643,1253,92.4823,True,True,baseline,omniledgerasecurescaleoutdecentralizedledgerviasharding,85.09604562737643,landmark,True | ||
| 549 | −7118998287,10.1016/j.matcom.2026.01.001,,Fixed-time optimal bipartite containment fault-tolerant control for multi-agent systems under multiple faults and saturated actuation,Mathematics and Computers in Simulation,2026,article,distributed_computing,2,32.0,32.0,112.34215540969723,32,134.0959,False,False,post,113.76705853836947,landmark,True | 549 | +7123363719,10.1016/j.cnsns.2026.109676,,ADP-based dynamic event-triggered fault-tolerant control for nonlinear systems with actuator failures and full-state time-varying constraints,Communications in Nonlinear Science and Numerical Simulation,2026,article,distributed_computing,1,33.0,33.0,93.17908801176759,33,117.6079,False,False,post,adpbaseddynamiceventtriggeredfaulttolerantcontrolfornonlinearsystemswithactuatorfailuresandfullstatetimevaryingconstraints,83.6705236022995,landmark,True | ||
| 550 | −4386585104,10.1145/3569951.3597559,,ACCESS: Advancing Innovation,Practice and Experience in Advanced Research Computing,2023,conference-paper,distributed_computing,2,121.0,297.0,111.86639277215944,435,137.5418,True,True,post,111.86639277215944,landmark,True | 550 | +7118998287,10.1016/j.matcom.2026.01.001,,Fixed-time optimal bipartite containment fault-tolerant control for multi-agent systems under multiple faults and saturated actuation,Mathematics and Computers in Simulation,2026,article,distributed_computing,2,32.0,32.0,112.34215540969723,32,134.0959,False,False,post,fixedtimeoptimalbipartitecontainmentfaulttolerantcontrolformultiagentsystemsundermultiplefaultsandsaturatedactuation,81.13505319010861,landmark,True | ||
| 551 | −2970155754,,,Learning Generalizable Device Placement Algorithms for Distributed Machine Learning,DSpace@MIT (Massachusetts Institute of Technology),2019,dissertation,distributed_computing,5,5.0,11.0,110.24841915085818,22,,True,False,baseline,110.24841915085818,landmark,True | 551 | +4391188276,10.1016/j.artmed.2024.102779,,Opportunities and challenges of artificial intelligence and distributed systems to improve the quality of healthcare service,Artificial Intelligence in Medicine,2024,article,distributed_computing,1,196.0,252.0,75.87091133481034,252,96.436,False,False,post,opportunitiesandchallengesofartificialintelligenceanddistributedsystemstoimprovethequalityofhealthcareservice,75.87091133481034,landmark,True | ||
| 552 | −110250037,10.7275/3278307,,The Use of Multimedia Material in Teaching Chinese as a Second Language and Pedagogical Implications,ScholarWorks@UMassAmherst (University of Massachusetts Amherst),2023,dissertation,cloud_computing,1,7.0,7.0,202.05405405405403,7,,True,True,post,202.05405405405403,landmark,True | 552 | +110250037,10.7275/3278307,,The Use of Multimedia Material in Teaching Chinese as a Second Language and Pedagogical Implications,ScholarWorks@UMassAmherst (University of Massachusetts Amherst),2023,dissertation,cloud_computing,1,7.0,7.0,202.05405405405403,7,,True,True,post,theuseofmultimediamaterialinteachingchineseasasecondlanguageandpedagogicalimplications,202.05405405405403,landmark,True | ||
| 553 | −4392909747,10.59646/ccp/156,,Cloud Computing: Principles And Paradigms,,2024,book,cloud_computing,2,504.0,504.0,155.20504731861197,517,14.8571,True,False,post,155.20504731861197,landmark,True | 553 | +4392909747,10.59646/ccp/156,,Cloud Computing: Principles And Paradigms,,2024,book,cloud_computing,2,504.0,504.0,155.20504731861197,517,14.8571,True,False,post,cloudcomputingprinciplesandparadigms,155.20504731861197,landmark,True | ||
| 554 | −4386975643,10.1016/b978-0-323-91150-4.00006-9,,Cloud-based non-destructive characterization,Elsevier eBooks,2023,book-chapter,cloud_computing,2,19.0,35.0,141.43274853801168,37,154.3068,False,False,post,141.43274853801168,landmark,True | 554 | +2784822088,10.2312/2632114,,A microservice architecture for the processing of large geospatial data in the Cloud,Publikationsdatenbank der Fraunhofer-Gesellschaft (Fraunhofer-Gesellschaft),2018,dissertation,cloud_computing,3,3.0,8.0,81.83864915572232,15,,True,False,baseline,amicroservicearchitecturefortheprocessingoflargegeospatialdatainthecloud,81.83864915572232,landmark,True | ||
| 555 | −4229658977,10.1007/978-1-4842-4470-8_7,,Google Colaboratory,Apress eBooks,2019,book-chapter,cloud_computing,2,24.0,126.0,122.68731164917385,709,185.9225,True,False,baseline,122.68731164917385,landmark,True | 555 | +4394946189,10.1145/3627703.3629553,2305.15778,Automatic Root Cause Analysis via Large Language Models for Cloud Incidents,,2024,conference-paper,cloud_computing,5,101.0,187.0,81.27074434424932,187,84.6778,True,True,post,automaticrootcauseanalysisvialargelanguagemodelsforcloudincidents,81.27074434424932,landmark,True | ||
| 556 | −7160954670,10.1109/icsft66733.2026.11506646,,Multi-Cloud Program Management For Large Scale Deployment,,2026,conference-paper,cloud_computing,4,26.0,26.0,245.48521739130436,26,297.1442,True,False,post,92.4357350624252,landmark,True | 556 | +4385584867,10.4018/978-1-6684-8634-4.ch009,,A Study on Smart Energy Management Framework Using Cloud Computing,"Practice, progress, and proficiency in sustainability",2023,book-chapter,cloud_computing,2,94.0,104.0,71.58999271314065,104,70.9894,True,False,post,astudyonsmartenergymanagementframeworkusingcloudcomputing,71.58999271314065,landmark,True | ||
| 557 | −2784822088,10.2312/2632114,,A microservice architecture for the processing of large geospatial data in the Cloud,Publikationsdatenbank der Fraunhofer-Gesellschaft (Fraunhofer-Gesellschaft),2018,dissertation,cloud_computing,3,3.0,8.0,81.83864915572232,15,,True,False,baseline,81.83864915572232,landmark,True | 557 | +4395047770,10.1007/s10462-024-10756-9,2105.04086,Deep reinforcement learning-based methods for resource scheduling in cloud computing: a review and future directions,Artificial Intelligence Review,2024,article,cloud_computing,6,149.0,232.0,69.84941043522221,232,83.4248,True,True,post,deepreinforcementlearningbasedmethodsforresourceschedulingincloudcomputingareviewandfuturedirections,69.84941043522221,landmark,True | ||
| 558 | −7118010419,10.37547/tajet/volume08issue01-02,,"Optimizing Retail Application Performance: A Systematic Review of Monitoring Tools, Metrics, And Best Practices",The American Journal of Engineering And Technology,2026,review,cloud_computing,4,23.0,23.0,30.77027027027027,23,33.0364,True,True,post,81.77007332445305,landmark,True | 558 | +2789491284,10.1016/j.future.2018.03.005,,A hybrid model of Internet of Things and cloud computing to manage big data in health services applications,Future Generation Computer Systems,2018,article,cloud_computing,4,84.0,130.0,68.9256218227304,341,79.9436,False,False,baseline,ahybridmodelofinternetofthingsandcloudcomputingtomanagebigdatainhealthservicesapplications,68.9256218227304,landmark,True | ||
| 559 | −4394946189,10.1145/3627703.3629553,2305.15778,Automatic Root Cause Analysis via Large Language Models for Cloud Incidents,,2024,conference-paper,cloud_computing,5,101.0,187.0,81.27074434424932,187,84.6778,True,True,post,81.27074434424932,landmark,True | 559 | +7160954670,10.1109/icsft66733.2026.11506646,,Multi-Cloud Program Management For Large Scale Deployment,,2026,conference-paper,cloud_computing,4,26.0,26.0,245.48521739130436,26,297.1442,True,False,post,multicloudprogrammanagementforlargescaledeployment,65.92223071696324,landmark,True | ||
| 560 | −4408156900,10.3390/electronics14051019,,Federated Learning for Cloud and Edge Security: A Systematic Review of Challenges and AI Opportunities,Electronics,2025,review,cloud_computing,8,147.0,147.0,18.250462107208875,147,20.0516,True,True,post,74.42005166664985,landmark,True | 560 | +4408156900,10.3390/electronics14051019,,Federated Learning for Cloud and Edge Security: A Systematic Review of Challenges and AI Opportunities,Electronics,2025,review,cloud_computing,8,147.0,147.0,18.250462107208875,147,20.0516,True,True,post,federatedlearningforcloudandedgesecurityasystematicreviewofchallengesandaiopportunities,64.2348204458387,landmark,True | ||
| 561 | −4252792641,10.31979/etd.shqa-fdp6,,PRIORITIZED TASK SCHEDULING IN FOG COMPUTING,,2018,dissertation,cloud_computing,4,5.0,8.0,71.95393474088291,24,,True,False,baseline,71.95393474088291,landmark,True | 561 | +2946627595,10.1007/s11280-019-00684-y,,A QoS-aware virtual machine scheduling method for energy conservation in cloud-based cyber-physical systems,World Wide Web,2019,article,cloud_computing,5,136.0,154.0,62.86026170639958,192,52.7972,False,False,baseline,aqosawarevirtualmachineschedulingmethodforenergyconservationincloudbasedcyberphysicalsystems,62.86026170639958,landmark,True | ||
| 562 | −4385584867,10.4018/978-1-6684-8634-4.ch009,,A Study on Smart Energy Management Framework Using Cloud Computing,"Practice, progress, and proficiency in sustainability",2023,book-chapter,cloud_computing,2,94.0,104.0,71.58999271314065,104,70.9894,True,False,post,71.58999271314065,landmark,True | 562 | +2784168960,,,Energy efficient dynamic virtual machine allocation with cpu usage prediction in cloud datacenters,Bilkent University Institutional Repository (Bilkent University),2018,dissertation,cloud_computing,4,3.0,6.0,61.37898686679174,8,,True,True,baseline,energyefficientdynamicvirtualmachineallocationwithcpuusagepredictioninclouddatacenters,61.37898686679174,landmark,True | ||
| 563 | −4395047770,10.1007/s10462-024-10756-9,2105.04086,Deep reinforcement learning-based methods for resource scheduling in cloud computing: a review and future directions,Artificial Intelligence Review,2024,article,cloud_computing,6,149.0,232.0,69.84941043522221,232,83.4248,True,True,post,69.84941043522221,landmark,True | 563 | +4364375730,10.4018/978-1-7998-8394-4.ch009,,Social Health Protection During the COVID-Pandemic Using IoT,"Advances in electronic government, digital divide, and regional development book series",2023,book-chapter,cloud_computing,1,82.0,87.0,59.88778236580034,87,59.3854,True,False,post,socialhealthprotectionduringthecovidpandemicusingiot,59.88778236580034,landmark,True | ||
| 564 | −2789491284,10.1016/j.future.2018.03.005,,A hybrid model of Internet of Things and cloud computing to manage big data in health services applications,Future Generation Computer Systems,2018,article,cloud_computing,4,84.0,130.0,68.9256218227304,341,79.9436,False,False,baseline,68.9256218227304,landmark,True | 564 | +7118010419,10.37547/tajet/volume08issue01-02,,"Optimizing Retail Application Performance: A Systematic Review of Monitoring Tools, Metrics, And Best Practices",The American Journal of Engineering And Technology,2026,review,cloud_computing,4,23.0,23.0,30.77027027027027,23,33.0364,True,True,post,optimizingretailapplicationperformanceasystematicreviewofmonitoringtoolsmetricsandbestpractices,58.315819480390566,landmark,True | ||
| 565 | −7160823269,10.1109/cisce69494.2026.11504752,,TokenPool-Scheduler: Token-Level GPU Pooling and Resource Slicing for Multi-Model Co-Location,,2026,conference-paper,cloud_computing,6,19.0,19.0,179.3930434782609,19,217.1439,True,False,post,67.54919100715686,landmark,True | 565 | +4293770403,10.1007/s10586-022-03713-0,,Energy efficiency in cloud computing data centers: a survey on software technologies,Cluster Computing,2022,article,cloud_computing,5,63.0,235.0,57.7561736098435,507,98.7462,True,True,baseline,energyefficiencyincloudcomputingdatacentersasurveyonsoftwaretechnologies,57.7561736098435,landmark,True | ||
| 566 | −7161556515,10.1109/gaiis69281.2026.11519206,,DeepServeCB: SLO-Aware and Cost-Aware Elastic Scheduling for Serverless Multi-Tenant LLM Inference,International Conference on Generative Artificial Intelligence and Information Security (GAIIS),2026,conference-paper,cloud_computing,7,19.0,19.0,179.3930434782609,19,217.1439,True,False,post,67.54919100715686,landmark,True | 566 | +2974110037,10.1016/j.iot.2019.100118,1911.01941,"Transformative effects of IoT, Blockchain and Artificial Intelligence on cloud computing: Evolution, vision, trends and open challenges",Internet of Things,2019,article,cloud_computing,4,60.0,141.0,57.553875977937274,496,68.1052,False,True,baseline,transformativeeffectsofiotblockchainandartificialintelligenceoncloudcomputingevolutionvisiontrendsandopenchallenges,57.553875977937274,landmark,True | ||
| 567 | −2946627595,10.1007/s11280-019-00684-y,,A QoS-aware virtual machine scheduling method for energy conservation in cloud-based cyber-physical systems,World Wide Web,2019,article,cloud_computing,5,136.0,154.0,62.86026170639958,192,52.7972,False,False,baseline,62.86026170639958,landmark,True | 567 | +4386827074,10.4018/979-8-3693-1186-8.ch026,,"Synergizing Artificial Intelligence, 5G, and Cloud Computing for Efficient Energy Conversion Using Agricultural Waste","Practice, progress, and proficiency in sustainability",2023,book-chapter,cloud_computing,1,70.0,81.0,55.757590478503765,82,55.9724,True,False,post,synergizingartificialintelligence5gandcloudcomputingforefficientenergyconversionusingagriculturalwaste,55.757590478503765,landmark,True | ||
| 568 | −2784168960,,,Energy efficient dynamic virtual machine allocation with cpu usage prediction in cloud datacenters,Bilkent University Institutional Repository (Bilkent University),2018,dissertation,cloud_computing,4,3.0,6.0,61.37898686679174,8,,True,True,baseline,61.37898686679174,landmark,True | 568 | +3011330593,10.1007/s10586-020-03075-5,,A novel hybrid antlion optimization algorithm for multi-objective task scheduling problems in cloud computing environments,Cluster Computing,2020,article,cloud_computing,3,109.0,189.0,55.03527669771227,355,59.7401,False,False,baseline,anovelhybridantlionoptimizationalgorithmformultiobjectivetaskschedulingproblemsincloudcomputingenvironments,55.03527669771227,landmark,True | ||
| 569 | −4378832451,10.1007/978-1-4842-9303-4_1,,Overview of Amazon Web Services,Apress eBooks,2023,book-chapter,cloud_computing,1,87.0,89.0,61.2645129948992,89,19.7951,True,False,post,61.2645129948992,landmark,True | 569 | +4390660438,10.1016/j.teler.2024.100116,2401.02469,Modern computing: Vision and challenges,Telematics and Informatics Reports,2024,article,cloud_computing,5,146.0,179.0,53.03994732221246,179,68.9762,True,True,post,moderncomputingvisionandchallenges,53.03994732221246,landmark,True | ||
| 570 | −4364375730,10.4018/978-1-7998-8394-4.ch009,,Social Health Protection During the COVID-Pandemic Using IoT,"Advances in electronic government, digital divide, and regional development book series",2023,book-chapter,cloud_computing,1,82.0,87.0,59.88778236580034,87,59.3854,True,False,post,59.88778236580034,landmark,True | 570 | +3042799967,10.1109/ipdps47924.2020.00084,,Smartly Handling Renewable Energy Instability in Supporting A Cloud Datacenter,Proceedings - IEEE International Parallel and Distributed Processing Symposium,2020,conference-paper,cloud_computing,6,98.0,183.0,51.67349504166861,272,42.4662,True,False,baseline,smartlyhandlingrenewableenergyinstabilityinsupportingaclouddatacenter,51.67349504166861,landmark,True | ||
| 571 | −4293770403,10.1007/s10586-022-03713-0,,Energy efficiency in cloud computing data centers: a survey on software technologies,Cluster Computing,2022,article,cloud_computing,5,63.0,235.0,57.7561736098435,507,98.7462,True,True,baseline,57.7561736098435,landmark,True | 571 | +3123888896,10.1016/j.swevo.2021.100841,,"Task Scheduling in Cloud Computing based on Meta-heuristics: Review, Taxonomy, Open Challenges, and Future Trends",Swarm and Evolutionary Computation,2021,article,cloud_computing,3,96.0,191.0,50.57785472303446,355,60.7922,False,False,baseline,taskschedulingincloudcomputingbasedonmetaheuristicsreviewtaxonomyopenchallengesandfuturetrends,50.57785472303446,landmark,True | ||
| 572 | −2974110037,10.1016/j.iot.2019.100118,1911.01941,"Transformative effects of IoT, Blockchain and Artificial Intelligence on cloud computing: Evolution, vision, trends and open challenges",Internet of Things,2019,article,cloud_computing,4,60.0,141.0,57.553875977937274,496,68.1052,False,True,baseline,57.553875977937274,landmark,True | 572 | +3008629209,10.1007/s11227-020-03213-1,,"A survey on security challenges in cloud computing: issues, threats, and solutions",The Journal of Supercomputing,2020,article,cloud_computing,3,67.0,168.0,48.92024595352202,538,68.1084,False,False,baseline,asurveyonsecuritychallengesincloudcomputingissuesthreatsandsolutions,48.92024595352202,landmark,True | ||
| 573 | −7164884893,10.1109/ispp69262.2026.11543010,,Research on Informer Long Sequence Dependency Modeling Method for Short-Term Prediction of Request Volume of Cloud-Native Backend Services,"International Conference on Image, Signal Processing and Pattern Recognition (ISPP)",2026,conference-paper,cloud_computing,1,16.0,16.0,151.06782608695653,16,182.858,False,False,post,56.883529269184734,landmark,True | 573 | +2980789769,10.1145/3362031,,A Survey on End-Edge-Cloud Orchestrated Network Computing Paradigms,ACM Computing Surveys,2019,article,cloud_computing,4,81.0,270.0,48.23825220633149,615,48.6065,True,False,baseline,asurveyonendedgecloudorchestratednetworkcomputingparadigms,48.23825220633149,landmark,True | ||
| 574 | −4386827074,10.4018/979-8-3693-1186-8.ch026,,"Synergizing Artificial Intelligence, 5G, and Cloud Computing for Efficient Energy Conversion Using Agricultural Waste","Practice, progress, and proficiency in sustainability",2023,book-chapter,cloud_computing,1,70.0,81.0,55.757590478503765,82,55.9724,True,False,post,55.757590478503765,landmark,True | 574 | +7161556515,10.1109/gaiis69281.2026.11519206,,DeepServeCB: SLO-Aware and Cost-Aware Elastic Scheduling for Serverless Multi-Tenant LLM Inference,International Conference on Generative Artificial Intelligence and Information Security (GAIIS),2026,conference-paper,cloud_computing,7,19.0,19.0,179.3930434782609,19,217.1439,True,False,post,deepservecbsloawareandcostawareelasticschedulingforserverlessmultitenantllminference,48.173937831626986,landmark,True | ||
| 575 | −3011330593,10.1007/s10586-020-03075-5,,A novel hybrid antlion optimization algorithm for multi-objective task scheduling problems in cloud computing environments,Cluster Computing,2020,article,cloud_computing,3,109.0,189.0,55.03527669771227,355,59.7401,False,False,baseline,55.03527669771227,landmark,True | 575 | +7160823269,10.1109/cisce69494.2026.11504752,,TokenPool-Scheduler: Token-Level GPU Pooling and Resource Slicing for Multi-Model Co-Location,,2026,conference-paper,cloud_computing,6,19.0,19.0,179.3930434782609,19,217.1439,True,False,post,tokenpoolschedulertokenlevelgpupoolingandresourceslicingformultimodelcolocation,48.173937831626986,landmark,True | ||
| 576 | −7160863705,10.1109/cisce69494.2026.11504731,,Multi-Objective Scheduling for Large Language Model Inference with Prompt-Level Cost Prediction and SLO Awareness,,2026,conference-paper,cloud_computing,4,15.0,15.0,141.62608695652176,15,171.4294,True,True,post,53.328308689860684,landmark,True | 576 | +3010543330,10.48550/arxiv.2003.03423,2003.03423,Serverless in the Wild: Characterizing and Optimizing the Serverless Workload at a Large Cloud Provider,arXiv (Cornell University),2020,preprint,cloud_computing,5,84.0,126.0,46.24970414201183,237,,True,True,baseline,serverlessinthewildcharacterizingandoptimizingtheserverlessworkloadatalargecloudprovider,46.24970414201183,landmark,True | ||
| 577 | −4293584584,10.4230/oasics.ng-res.2024.2,,A Multi-Modal Distributed Real-Time IoT System for Urban Traffic Control (Invited Paper),DROPS (Schloss Dagstuhl – Leibniz Center for Informatics),2024,article,edge_computing,3,13850.0,14039.0,991.9504732778122,14040,523.7037,True,True,post,991.9504732778122,landmark,True | 577 | +4293584584,10.4230/oasics.ng-res.2024.2,,A Multi-Modal Distributed Real-Time IoT System for Urban Traffic Control (Invited Paper),DROPS (Schloss Dagstuhl – Leibniz Center for Informatics),2024,article,edge_computing,3,13850.0,14039.0,991.9504732778122,14040,523.7037,True,True,post,amultimodaldistributedrealtimeiotsystemforurbantrafficcontrolinvitedpaper,991.9504732778122,landmark,True | ||
| 578 | −4398201281,10.3390/blockchains2020009,,Situ-Oracle: A Learning-Based Situation Analysis Framework for Blockchain-Based IoT Systems,Blockchains,2024,dissertation,edge_computing,7,7.0,9.0,350.4666666666667,9,,True,True,post,350.4666666666667,landmark,True | 578 | +4398201281,10.3390/blockchains2020009,,Situ-Oracle: A Learning-Based Situation Analysis Framework for Blockchain-Based IoT Systems,Blockchains,2024,dissertation,edge_computing,7,7.0,9.0,350.4666666666667,9,,True,True,post,situoraclealearningbasedsituationanalysisframeworkforblockchainbasediotsystems,350.4666666666667,landmark,True | ||
| 579 | −2803371618,10.1016/j.future.2018.05.046,,On blockchain and its integration with IoT. Challenges and opportunities,Future Generation Computer Systems,2018,article,edge_computing,5,203.0,490.0,259.79657456259923,1909,332.6297,True,True,baseline,259.79657456259923,landmark,True | 579 | +2803371618,10.1016/j.future.2018.05.046,,On blockchain and its integration with IoT. Challenges and opportunities,Future Generation Computer Systems,2018,article,edge_computing,5,203.0,490.0,259.79657456259923,1909,332.6297,True,True,baseline,onblockchainanditsintegrationwithiotchallengesandopportunities,259.79657456259923,landmark,True | ||
| 580 | −2793346081,10.1109/jiot.2018.2812239,,Blockchain Meets IoT: An Architecture for Scalable Access Management in IoT,IEEE Internet of Things Journal,2018,article,edge_computing,4,214.0,449.0,238.05849383389193,1314,280.4052,True,False,baseline,238.05849383389193,landmark,True | 580 | +2793346081,10.1109/jiot.2018.2812239,,Blockchain Meets IoT: An Architecture for Scalable Access Management in IoT,IEEE Internet of Things Journal,2018,article,edge_computing,4,214.0,449.0,238.05849383389193,1314,280.4052,True,False,baseline,blockchainmeetsiotanarchitectureforscalableaccessmanagementiniot,238.05849383389193,landmark,True | ||
| 581 | −3023617420,10.1109/access.2020.2992341,,"A Comprehensive Review of the COVID-19 Pandemic and the Role of IoT, Drones, AI, Blockchain, and 5G in Managing its Impact",IEEE Access,2020,article,edge_computing,3,466.0,725.0,211.1141566446635,1096,210.1365,True,True,baseline,211.1141566446635,landmark,True | 581 | +3023617420,10.1109/access.2020.2992341,,"A Comprehensive Review of the COVID-19 Pandemic and the Role of IoT, Drones, AI, Blockchain, and 5G in Managing its Impact",IEEE Access,2020,article,edge_computing,3,466.0,725.0,211.1141566446635,1096,210.1365,True,True,baseline,acomprehensivereviewofthecovid19pandemicandtheroleofiotdronesaiblockchainand5ginmanagingitsimpact,211.1141566446635,landmark,True | ||
| 582 | −2562507292,10.1201/9781003338628-7,,Internet of Things Applications - From Research and Innovation to Market Deployment,River Publishers eBooks,2022,book-chapter,edge_computing,2,216.0,221.0,171.71408036142103,233,36.0148,True,True,baseline,171.71408036142103,landmark,True | 582 | +2562507292,10.1201/9781003338628-7,,Internet of Things Applications - From Research and Innovation to Market Deployment,River Publishers eBooks,2022,book-chapter,edge_computing,2,216.0,221.0,171.71408036142103,233,36.0148,True,True,baseline,internetofthingsapplicationsfromresearchandinnovationtomarketdeployment,171.71408036142103,landmark,True | ||
| 583 | −3017623177,10.1016/j.dsx.2020.04.032,,Industry 4.0 technologies and their applications in fighting COVID-19 pandemic,Diabetes & Metabolic Syndrome Clinical Research & Reviews,2020,article,edge_computing,1,337.0,508.0,147.9255056213642,757,146.6771,False,True,baseline,147.9255056213642,landmark,True | 583 | +3017623177,10.1016/j.dsx.2020.04.032,,Industry 4.0 technologies and their applications in fighting COVID-19 pandemic,Diabetes & Metabolic Syndrome Clinical Research & Reviews,2020,article,edge_computing,1,337.0,508.0,147.9255056213642,757,146.6771,False,True,baseline,industry40technologiesandtheirapplicationsinfightingcovid19pandemic,147.9255056213642,landmark,True | ||
| 584 | −2908737503,10.3390/s19020326,,A Decentralized Privacy-Preserving Healthcare Blockchain for IoT,Sensors,2019,article,edge_computing,6,167.0,347.0,141.63968059818606,880,158.7039,True,True,baseline,141.63968059818606,landmark,True | 584 | +2908737503,10.3390/s19020326,,A Decentralized Privacy-Preserving Healthcare Blockchain for IoT,Sensors,2019,article,edge_computing,6,167.0,347.0,141.63968059818606,880,158.7039,True,True,baseline,adecentralizedprivacypreservinghealthcareblockchainforiot,141.63968059818606,landmark,True | ||
| 585 | −3023398824,10.1016/j.dsx.2020.04.041,,Internet of things (IoT) applications to fight against COVID-19 pandemic,Diabetes & Metabolic Syndrome Clinical Research & Reviews,2020,article,edge_computing,2,289.0,455.0,132.4923327907888,664,133.1949,False,True,baseline,132.4923327907888,landmark,True | 585 | +3023398824,10.1016/j.dsx.2020.04.041,,Internet of things (IoT) applications to fight against COVID-19 pandemic,Diabetes & Metabolic Syndrome Clinical Research & Reviews,2020,article,edge_computing,2,289.0,455.0,132.4923327907888,664,133.1949,False,True,baseline,internetofthingsiotapplicationstofightagainstcovid19pandemic,132.4923327907888,landmark,True | ||
| 586 | −2947690458,10.1109/jiot.2019.2920987,1906.00245,Blockchain for Internet of Things: A Survey,IEEE Internet of Things Journal,2019,article,edge_computing,7,142.0,323.0,131.8432761764095,1087,171.5127,True,True,baseline,131.8432761764095,landmark,True | 586 | +2947690458,10.1109/jiot.2019.2920987,1906.00245,Blockchain for Internet of Things: A Survey,IEEE Internet of Things Journal,2019,article,edge_computing,7,142.0,323.0,131.8432761764095,1087,171.5127,True,True,baseline,blockchainforinternetofthingsasurvey,131.8432761764095,landmark,True | ||
| 587 | −2885100636,10.3390/s18082575,,Blockchain and IoT Integration: A Systematic Survey,Sensors,2018,article,edge_computing,6,100.0,219.0,116.11316291675352,748,144.2199,True,True,baseline,116.11316291675352,landmark,True | 587 | +2885100636,10.3390/s18082575,,Blockchain and IoT Integration: A Systematic Survey,Sensors,2018,article,edge_computing,6,100.0,219.0,116.11316291675352,748,144.2199,True,True,baseline,blockchainandiotintegrationasystematicsurvey,116.11316291675352,landmark,True | ||
| 588 | −3006456063,10.1016/j.jii.2020.100129,,"Industry 4.0 and Health: Internet of Things, Big Data, and Cloud Computing for Healthcare 4.0",Journal of Industrial Information Integration,2020,article,edge_computing,3,233.0,388.0,112.9824727974199,876,123.8968,False,False,baseline,112.9824727974199,landmark,True | 588 | +3006456063,10.1016/j.jii.2020.100129,,"Industry 4.0 and Health: Internet of Things, Big Data, and Cloud Computing for Healthcare 4.0",Journal of Industrial Information Integration,2020,article,edge_computing,3,233.0,388.0,112.9824727974199,876,123.8968,False,False,baseline,industry40andhealthinternetofthingsbigdataandcloudcomputingforhealthcare40,112.9824727974199,landmark,True | ||
| 589 | −2974429275,10.1109/tii.2019.2942190,,Blockchain and Federated Learning for Privacy-Preserved Data Sharing in Industrial IoT,IEEE Transactions on Industrial Informatics,2019,article,edge_computing,5,79.0,275.0,112.25046733285639,1237,155.2674,True,False,baseline,112.25046733285639,landmark,True | 589 | +2974429275,10.1109/tii.2019.2942190,,Blockchain and Federated Learning for Privacy-Preserved Data Sharing in Industrial IoT,IEEE Transactions on Industrial Informatics,2019,article,edge_computing,5,79.0,275.0,112.25046733285639,1237,155.2674,True,False,baseline,blockchainandfederatedlearningforprivacypreserveddatasharinginindustrialiot,112.25046733285639,landmark,True | ||
| 590 | −4386961654,10.3390/s23198015,,Exploring the Full Potentials of IoT for Better Financial Growth and Stability: A Comprehensive Survey,Sensors,2023,article,edge_computing,4,268.0,473.0,110.8597419743026,563,131.8285,True,True,post,110.8597419743026,landmark,True | 590 | +4386961654,10.3390/s23198015,,Exploring the Full Potentials of IoT for Better Financial Growth and Stability: A Comprehensive Survey,Sensors,2023,article,edge_computing,4,268.0,473.0,110.8597419743026,563,131.8285,True,True,post,exploringthefullpotentialsofiotforbetterfinancialgrowthandstabilityacomprehensivesurvey,110.8597419743026,landmark,True | ||
| 591 | −4362498422,10.12681/eadd/53552,,Security and privacy in the internet of things,,2023,dissertation,edge_computing,3,6.0,6.0,110.13333333333334,6,,True,False,post,110.13333333333334,landmark,True | 591 | +2912978522,10.1109/comst.2019.2894727,,"Integrated Blockchain and Edge Computing Systems: A Survey, Some Research Issues and Challenges",IEEE Communications Surveys & Tutorials,2019,article,edge_computing,5,123.0,257.0,104.90316401652396,688,125.5885,True,False,baseline,integratedblockchainandedgecomputingsystemsasurveysomeresearchissuesandchallenges,104.90316401652396,landmark,True | ||
| 592 | −2912978522,10.1109/comst.2019.2894727,,"Integrated Blockchain and Edge Computing Systems: A Survey, Some Research Issues and Challenges",IEEE Communications Surveys & Tutorials,2019,article,edge_computing,5,123.0,257.0,104.90316401652396,688,125.5885,True,False,baseline,104.90316401652396,landmark,True | 592 | +2950865323,10.1109/jproc.2019.2918951,1905.10083,Edge Intelligence: Paving the Last Mile of Artificial Intelligence With Edge Computing,Proceedings of the IEEE,2019,article,edge_computing,7,242.0,584.0,104.33755292036145,2403,130.9484,True,True,baseline,edgeintelligencepavingthelastmileofartificialintelligencewithedgecomputing,104.33755292036145,landmark,True | ||
| 593 | −2950865323,10.1109/jproc.2019.2918951,1905.10083,Edge Intelligence: Paving the Last Mile of Artificial Intelligence With Edge Computing,Proceedings of the IEEE,2019,article,edge_computing,7,242.0,584.0,104.33755292036145,2403,130.9484,True,True,baseline,104.33755292036145,landmark,True | 593 | +4313646859,10.1002/widm.1485,2301.10009,"Remote patient monitoring using artificial intelligence: Current state, applications, and challenges",Wiley Interdisciplinary Reviews Data Mining and Knowledge Discovery,2023,article,edge_computing,5,192.0,411.0,96.32844387196272,515,121.019,True,True,post,remotepatientmonitoringusingartificialintelligencecurrentstateapplicationsandchallenges,96.32844387196272,landmark,True | ||
| 594 | −7129024920,10.1109/jiot.2026.3665050,,TinyLSN: A Lightweight Network for Real-Time Marine Pipeline Leakage Detection in IoT Systems,IEEE Internet of Things Journal,2026,article,edge_computing,6,29.0,29.0,33.756,29,56.592,True,False,post,103.10139680039732,landmark,True | 594 | +4401806686,10.1016/j.hybadv.2024.100277,,AI revolutionizing industries worldwide: A comprehensive overview of its diverse applications,Hybrid Advances,2024,article,edge_computing,6,415.0,749.0,93.03175978035208,749,111.3178,True,True,post,airevolutionizingindustriesworldwideacomprehensiveoverviewofitsdiverseapplications,93.03175978035208,landmark,True | ||
| 595 | −4408363154,10.3390/s25061763,,"From Sensors to Data Intelligence: Leveraging IoT, Cloud, and Edge Computing with AI",Sensors,2025,article,edge_computing,3,201.0,201.0,76.45446851404553,201,88.6024,True,True,post,101.75802982990899,landmark,True | 595 | +4320712473,10.1016/j.iot.2023.100721,,The Internet of Things (IoT) in healthcare: Taking stock and moving forward,Internet of Things,2023,article,edge_computing,4,233.0,379.0,88.82841904494859,448,105.2748,True,True,post,theinternetofthingsiotinhealthcaretakingstockandmovingforward,88.82841904494859,landmark,True | ||
| 596 | −4407389811,10.3390/electronics14040696,,Integrating Artificial Intelligence Agents with the Internet of Things for Enhanced Environmental Monitoring: Applications in Water Quality and Climate Data,Electronics,2025,article,edge_computing,4,199.0,199.0,172.77199169706373,199,217.4065,True,True,post,100.74551212015865,landmark,True | 596 | +2983008824,10.1016/j.jnca.2019.102481,,"A Comprehensive Survey on Attacks, Security Issues and Blockchain Solutions for IoT and IIoT",Journal of Network and Computer Applications,2019,article,edge_computing,3,69.0,217.0,88.57582331356303,840,122.4644,False,False,baseline,acomprehensivesurveyonattackssecurityissuesandblockchainsolutionsforiotandiiot,88.57582331356303,landmark,True | ||
| 597 | −4313646859,10.1002/widm.1485,2301.10009,"Remote patient monitoring using artificial intelligence: Current state, applications, and challenges",Wiley Interdisciplinary Reviews Data Mining and Knowledge Discovery,2023,article,edge_computing,5,192.0,411.0,96.32844387196272,515,121.019,True,True,post,96.32844387196272,landmark,True | 597 | +4408363154,10.3390/s25061763,,"From Sensors to Data Intelligence: Leveraging IoT, Cloud, and Edge Computing with AI",Sensors,2025,article,edge_computing,3,201.0,201.0,76.45446851404553,201,88.6024,True,True,post,fromsensorstodataintelligenceleveragingiotcloudandedgecomputingwithai,87.8312850994121,landmark,True | ||
| 598 | −4401806686,10.1016/j.hybadv.2024.100277,,AI revolutionizing industries worldwide: A comprehensive overview of its diverse applications,Hybrid Advances,2024,article,edge_computing,6,415.0,749.0,93.03175978035208,749,111.3178,True,True,post,93.03175978035208,landmark,True | 598 | +2918245750,10.1016/j.future.2019.02.060,,"Privacy preservation in blockchain based IoT systems: Integration issues, prospects, challenges, and future research directions",Future Generation Computer Systems,2019,article,edge_computing,4,84.0,215.0,87.75945627841499,520,104.0323,False,True,baseline,privacypreservationinblockchainbasediotsystemsintegrationissuesprospectschallengesandfutureresearchdirections,87.75945627841499,landmark,True | ||
| 599 | −7125650829,10.1007/s44336-025-00031-y,2506.12479,"AI Flow: perspectives, scenarios, and approaches",Vicinagearth.,2026,article,edge_computing,6,25.0,25.0,87.76730891382596,25,96.3814,True,True,post,88.88051448310114,landmark,True | 599 | +4407389811,10.3390/electronics14040696,,Integrating Artificial Intelligence Agents with the Internet of Things for Enhanced Environmental Monitoring: Applications in Water Quality and Climate Data,Electronics,2025,article,edge_computing,4,199.0,199.0,172.77199169706373,199,217.4065,True,True,post,integratingartificialintelligenceagentswiththeinternetofthingsforenhancedenvironmentalmonitoringapplicationsinwaterqualityandclimatedata,86.95734196409457,landmark,True | ||
| 600 | −4320712473,10.1016/j.iot.2023.100721,,The Internet of Things (IoT) in healthcare: Taking stock and moving forward,Internet of Things,2023,article,edge_computing,4,233.0,379.0,88.82841904494859,448,105.2748,True,True,post,88.82841904494859,landmark,True | 600 | +2921608598,10.1109/tii.2019.2903342,,Towards Secure Industrial IoT: Blockchain System With Credit-Based Consensus Mechanism,IEEE Transactions on Industrial Informatics,2019,article,edge_computing,4,97.0,211.0,86.12672220811889,562,98.0965,True,True,baseline,towardssecureindustrialiotblockchainsystemwithcreditbasedconsensusmechanism,86.12672220811889,landmark,True | ||
| 601 | −2983008824,10.1016/j.jnca.2019.102481,,"A Comprehensive Survey on Attacks, Security Issues and Blockchain Solutions for IoT and IIoT",Journal of Network and Computer Applications,2019,article,edge_computing,3,69.0,217.0,88.57582331356303,840,122.4644,False,False,baseline,88.57582331356303,landmark,True | 601 | +2951308194,,,Blockchain and smart contracts for the internet of things,"Portuguese National Funding Agency for Science, Research and Technology (RCAAP Project by FCT)",2018,dissertation,edge_computing,3,7.0,8.0,81.83864915572232,11,,True,True,baseline,blockchainandsmartcontractsfortheinternetofthings,81.83864915572232,landmark,True | ||
| 602 | −2602956630,10.1201/9781003338604-2,,Internet of Things Strategic Research Roadmap,River Publishers eBooks,2022,book-chapter,computer_networks,2,917.0,944.0,727.1609786504597,1002,103.9744,True,True,baseline,727.1609786504597,landmark,True | 602 | +2602956630,10.1201/9781003338604-2,,Internet of Things Strategic Research Roadmap,River Publishers eBooks,2022,book-chapter,computer_networks,2,917.0,944.0,727.1609786504597,1002,103.9744,True,True,baseline,internetofthingsstrategicresearchroadmap,727.1609786504597,landmark,True | ||
| 603 | −1500148551,10.48550/arxiv.2603.08623,2603.08623,Time-based Fairness Improves Performance in Multi-rate WLANs,arXiv (Cornell University),2026,preprint,computer_networks,3,100.0,100.0,2873.046875,231,,True,True,post,355.52205793240455,landmark,True | 603 | +2762829140,10.6069/5wt6-j462,,Deep Learning based Intrusion Detection System for Internet of Things,ResearchWorks at the University of Washington (University of Washington),2024,dissertation,computer_networks,4,12.0,12.0,302.4347826086956,12,,True,True,post,deeplearningbasedintrusiondetectionsystemforinternetofthings,302.4347826086956,landmark,True | ||
| 604 | −2762829140,10.6069/5wt6-j462,,Deep Learning based Intrusion Detection System for Internet of Things,ResearchWorks at the University of Washington (University of Washington),2024,dissertation,computer_networks,4,12.0,12.0,302.4347826086956,12,,True,True,post,302.4347826086956,landmark,True | 604 | +2940715617,,,Offloading Real-time DDoS Attack Detection to Programmable Data Planes,Americanae (AECID Library),2019,dissertation,computer_networks,3,15.0,36.0,281.8709677419355,56,,True,True,baseline,offloadingrealtimeddosattackdetectiontoprogrammabledataplanes,281.8709677419355,landmark,True | ||
| 605 | −2940715617,,,Offloading Real-time DDoS Attack Detection to Programmable Data Planes,Americanae (AECID Library),2019,dissertation,computer_networks,3,15.0,36.0,281.8709677419355,56,,True,True,baseline,281.8709677419355,landmark,True | 605 | +1500148551,10.48550/arxiv.2603.08623,2603.08623,Time-based Fairness Improves Performance in Multi-rate WLANs,arXiv (Cornell University),2026,preprint,computer_networks,3,100.0,100.0,2873.046875,231,,True,True,post,timebasedfairnessimprovesperformanceinmultiratewlans,253.5470412190894,landmark,True | ||
| 606 | −7123361055,10.1109/comst.2026.3651702,,"Toward Edge General Intelligence With Agentic AI and Agentification: Concepts, Technologies, and Future Directions",IEEE Communications Surveys & Tutorials,2026,article,computer_networks,4,73.0,73.0,256.28054202837177,73,305.9063,True,False,post,259.5311022906553,landmark,True | 606 | +2772457693,10.1109/comst.2018.2844341,1712.04301,Deep Learning for IoT Big Data and Streaming Analytics: A Survey,IEEE Communications Surveys & Tutorials,2018,article,computer_networks,5,173.0,419.0,222.15258110556954,1462,281.2086,True,True,baseline,deeplearningforiotbigdataandstreaminganalyticsasurvey,222.15258110556954,landmark,True | ||
| 607 | −7124594522,10.1007/s41870-025-03116-5,,Energy-efficient 5G-enabled sensor networks for smart environmental monitoring in sustainable cities,International Journal of Information Technology,2026,article,computer_networks,2,63.0,63.0,221.1736184628414,63,264.0013,False,False,post,223.97889649741487,landmark,True | 607 | +1823805418,10.17487/rfc8684,,TCP Extensions for Multipath Operation with Multiple Addresses,,2020,report,computer_networks,3,796.0,831.0,214.13475177304963,1008,,True,True,baseline,tcpextensionsformultipathoperationwithmultipleaddresses,214.13475177304963,landmark,True | ||
| 608 | −2772457693,10.1109/comst.2018.2844341,1712.04301,Deep Learning for IoT Big Data and Streaming Analytics: A Survey,IEEE Communications Surveys & Tutorials,2018,article,computer_networks,5,173.0,419.0,222.15258110556954,1462,281.2086,True,True,baseline,222.15258110556954,landmark,True | 608 | +4292259483,10.1109/mcom.2022.9860244,,The IEEE International Conference on Communications 2022 (ICC'22),IEEE Communications Magazine,2022,article,computer_networks,1,38.0,59.0,197.26717557251908,78,,True,True,baseline,theieeeinternationalconferenceoncommunications2022icc22,197.26717557251908,landmark,True | ||
| 609 | −7134136722,10.1016/j.jnca.2026.104462,,Hybrid Al-Biruni and Puma Optimization (BERPO) for boosting the classification of Quality-of-Service (QoS) in 5G networks,Journal of Network and Computer Applications,2026,article,computer_networks,1,61.0,61.0,67.88089344511127,61,220.3697,False,False,post,216.86845533876678,landmark,True | 609 | +7123361055,10.1109/comst.2026.3651702,,"Toward Edge General Intelligence With Agentic AI and Agentification: Concepts, Technologies, and Future Directions",IEEE Communications Surveys & Tutorials,2026,article,computer_networks,4,73.0,73.0,256.28054202837177,73,305.9063,True,False,post,towardedgegeneralintelligencewithagenticaiandagentificationconceptstechnologiesandfuturedirections,185.08934008993526,landmark,True | ||
| 610 | −1823805418,10.17487/rfc8684,,TCP Extensions for Multipath Operation with Multiple Addresses,,2020,report,computer_networks,3,796.0,831.0,214.13475177304963,1008,,True,True,baseline,214.13475177304963,landmark,True | 610 | +7124594522,10.1007/s41870-025-03116-5,,Energy-efficient 5G-enabled sensor networks for smart environmental monitoring in sustainable cities,International Journal of Information Technology,2026,article,computer_networks,2,63.0,63.0,221.1736184628414,63,264.0013,False,False,post,energyefficient5genabledsensornetworksforsmartenvironmentalmonitoringinsustainablecities,159.7346359680263,landmark,True | ||
| 611 | −4415028496,10.1109/comst.2026.3669216,2505.01821,Edge-Cloud Collaborative Computing on Distributed Intelligence and Model Optimization: A Survey,IEEE Communications Surveys & Tutorials,2026,article,computer_networks,9,60.0,60.0,210.64154139318228,60,243.0488,True,True,post,213.31323475944274,landmark,True | 611 | +7134136722,10.1016/j.jnca.2026.104462,,Hybrid Al-Biruni and Puma Optimization (BERPO) for boosting the classification of Quality-of-Service (QoS) in 5G networks,Journal of Network and Computer Applications,2026,article,computer_networks,1,61.0,61.0,67.88089344511127,61,220.3697,False,False,post,hybridalbiruniandpumaoptimizationberpoforboostingtheclassificationofqualityofserviceqosin5gnetworks,154.66369514364453,landmark,True | ||
| 612 | −4285039189,10.12681/eadd/51938,,Mobile ad-hoc networks (MANET),,2022,dissertation,computer_networks,1,28.0,28.0,211.50980392156862,58,,True,False,baseline,211.50980392156862,landmark,True | 612 | +4415028496,10.1109/comst.2026.3669216,2505.01821,Edge-Cloud Collaborative Computing on Distributed Intelligence and Model Optimization: A Survey,IEEE Communications Surveys & Tutorials,2026,article,computer_networks,9,60.0,60.0,210.64154139318228,60,243.0488,True,True,post,edgecloudcollaborativecomputingondistributedintelligenceandmodeloptimizationasurvey,152.12822473145363,landmark,True | ||
| 613 | −4292259483,10.1109/mcom.2022.9860244,,The IEEE International Conference on Communications 2022 (ICC'22),IEEE Communications Magazine,2022,article,computer_networks,1,38.0,59.0,197.26717557251908,78,,True,True,baseline,197.26717557251908,landmark,True | 613 | +2962883549,10.1109/comst.2019.2904897,,Deep Learning in Mobile and Wireless Networking: A Survey,IEEE Communications Surveys & Tutorials,2019,article,computer_networks,2,473.0,812.0,145.07207700570802,1768,138.2463,True,False,baseline,deeplearninginmobileandwirelessnetworkingasurvey,145.07207700570802,landmark,True | ||
| 614 | −7127083419,10.1109/jsac.2026.3660010,2505.22311,From Large AI Models to Agentic AI: A Tutorial on Future Intelligent Communications,IEEE Journal on Selected Areas in Communications,2026,article,computer_networks,2,50.0,50.0,74.70889613414066,50,77.1613,True,True,post,177.76102896620228,landmark,True | 614 | +153405511,10.57709/1059389,,"An Analysis of the MOS under Conditions of Delay, Jitter and Packet Loss and an Analysis of the Impact of Introducing Piggybacking and Reed Solomon FEC for VOIP",Digital Archive @ GSU,2022,dissertation,computer_networks,4,19.0,19.0,143.52450980392155,19,,True,True,baseline,ananalysisofthemosunderconditionsofdelayjitterandpacketlossandananalysisoftheimpactofintroducingpiggybackingandreedsolomonfecforvoip,143.52450980392155,landmark,True | ||
| 615 | −2962883549,10.1109/comst.2019.2904897,,Deep Learning in Mobile and Wireless Networking: A Survey,IEEE Communications Surveys & Tutorials,2019,article,computer_networks,2,473.0,812.0,145.07207700570802,1768,138.2463,True,False,baseline,145.07207700570802,landmark,True | 615 | +4206510620,10.1007/978-3-030-87059-1_4,,The Role of Machine Learning Techniques in Internet of Things-Based Cloud Applications,Internet of things,2022,book-chapter,computer_networks,3,98.0,176.0,136.74967485796427,223,144.059,False,False,baseline,theroleofmachinelearningtechniquesininternetofthingsbasedcloudapplications,136.74967485796427,landmark,True | ||
| 616 | −4395064458,10.1017/9781009489843,,Wireless Communications,Cambridge University Press eBooks,2024,book,computer_networks,1,347.0,458.0,144.12803234501348,541,214.916,True,False,post,144.12803234501348,landmark,True | 616 | +4322576964,10.1109/comst.2023.3249835,,"On the Road to 6G: Visions, Requirements, Key Technologies, and Testbeds",IEEE Communications Surveys & Tutorials,2023,article,computer_networks,1,832.0,1763.0,133.06276599375022,2336,171.2254,True,True,post,ontheroadto6gvisionsrequirementskeytechnologiesandtestbeds,133.06276599375022,landmark,True | ||
| 617 | −153405511,10.57709/1059389,,"An Analysis of the MOS under Conditions of Delay, Jitter and Packet Loss and an Analysis of the Impact of Introducing Piggybacking and Reed Solomon FEC for VOIP",Digital Archive @ GSU,2022,dissertation,computer_networks,4,19.0,19.0,143.52450980392155,19,,True,True,baseline,143.52450980392155,landmark,True | 617 | +7127083419,10.1109/jsac.2026.3660010,2505.22311,From Large AI Models to Agentic AI: A Tutorial on Future Intelligent Communications,IEEE Journal on Selected Areas in Communications,2026,article,computer_networks,2,50.0,50.0,74.70889613414066,50,77.1613,True,True,post,fromlargeaimodelstoagenticaiatutorialonfutureintelligentcommunications,126.7735206095447,landmark,True | ||
| 618 | −4416378800,10.1109/tcomm.2026.3658289,,Pinching-Antenna Systems (PASS): A Tutorial,IEEE Transactions on Communications,2026,article,computer_networks,2,40.0,40.0,52.205714285714286,40,111.2683,True,True,post,142.20882317296181,landmark,True | 618 | +3104550706,10.1184/r1/6468842.v1,,Gossip Algorithms for Distributed Signal Processing,,2018,article,computer_networks,1,553.0,607.0,121.54403377438375,692,30.8092,True,True,baseline,gossipalgorithmsfordistributedsignalprocessing,121.54403377438375,landmark,True | ||
| 619 | −4206510620,10.1007/978-3-030-87059-1_4,,The Role of Machine Learning Techniques in Internet of Things-Based Cloud Applications,Internet of things,2022,book-chapter,computer_networks,3,98.0,176.0,136.74967485796427,223,144.059,False,False,baseline,136.74967485796427,landmark,True | 619 | +1710433637,10.17487/rfc9260,,Stream Control Transmission Protocol,,2022,report,computer_networks,1,645.0,659.0,119.70282413350449,1922,,True,False,baseline,streamcontroltransmissionprotocol,119.70282413350449,landmark,True | ||
| 620 | −4322576964,10.1109/comst.2023.3249835,,"On the Road to 6G: Visions, Requirements, Key Technologies, and Testbeds",IEEE Communications Surveys & Tutorials,2023,article,computer_networks,1,832.0,1763.0,133.06276599375022,2336,171.2254,True,True,post,133.06276599375022,landmark,True | 620 | +3194620979,10.1109/jsac.2022.3156632,,Integrated Sensing and Communications: Toward Dual-Functional Wireless Networks for 6G and Beyond,IEEE Journal on Selected Areas in Communications,2022,article,computer_networks,2,639.0,1558.0,118.9064113669858,3786,312.6996,True,True,baseline,integratedsensingandcommunicationstowarddualfunctionalwirelessnetworksfor6gandbeyond,118.9064113669858,landmark,True | ||
| 621 | −7123349468,10.1109/jiot.2026.3652582,,SMNet: A Novel Compositional Generalization Model for Industrial Robot Multijoint Fault Diagnosis,IEEE Internet of Things Journal,2026,article,computer_networks,4,37.0,37.0,40.9855601659751,37,100.0756,True,False,post,131.54316143498968,landmark,True | 621 | +2545990795,10.17487/rfc9000,,QUIC: A UDP-Based Multiplexed and Secure Transport,,2021,report,computer_networks,3,316.0,458.0,115.2256020278834,828,,True,False,baseline,quicaudpbasedmultiplexedandsecuretransport,115.2256020278834,landmark,True | ||
| 622 | −7125196921,10.1109/jiot.2026.3655796,2505.03036,"Energy, Scalability, Data, and Security in Massive IoT: Current Landscape and Future Directions",IEEE Internet of Things Journal,2026,article,computer_networks,8,35.0,35.0,122.87423247935634,35,146.6674,True,True,post,124.4327202763416,landmark,True | 622 | +3015636663,10.1109/comst.2020.2986024,1909.11875,Federated Learning in Mobile Edge Networks: A Comprehensive Survey,IEEE Communications Surveys & Tutorials,2020,article,computer_networks,6,471.0,885.0,110.69210549120425,2537,130.0371,True,True,baseline,federatedlearninginmobileedgenetworksacomprehensivesurvey,110.69210549120425,landmark,True | ||
| 623 | −3104550706,10.1184/r1/6468842.v1,,Gossip Algorithms for Distributed Signal Processing,,2018,article,computer_networks,1,553.0,607.0,121.54403377438375,692,30.8092,True,True,baseline,121.54403377438375,landmark,True | 623 | +4396669794,10.4018/979-8-3693-1335-0.ch018,,Optimized Throughput-Based Broadcasting for Next Generation Wireless Networks,Advances in civil and industrial engineering book series,2024,book-chapter,computer_networks,1,114.0,114.0,109.86076986076985,114,123.4038,True,False,post,optimizedthroughputbasedbroadcastingfornextgenerationwirelessnetworks,109.86076986076985,landmark,True | ||
| 624 | −7125115033,10.1109/comst.2026.3655674,,Integrated Sensing and Communications Over the Years: An Evolution Perspective,IEEE Communications Surveys & Tutorials,2026,article,computer_networks,1,34.0,34.0,44.374857142857145,32,85.591,False,True,post,120.87749969701756,landmark,True | 624 | +1150714886,,,OPNET simulation of voice over MPLS: With Considering Traffic Engineering,,2019,dissertation,computer_networks,1,13.0,14.0,109.61648745519715,14,,True,False,baseline,opnetsimulationofvoiceovermplswithconsideringtrafficengineering,109.61648745519715,landmark,True | ||
| 625 | −1710433637,10.17487/rfc9260,,Stream Control Transmission Protocol,,2022,report,computer_networks,1,645.0,659.0,119.70282413350449,1922,,True,False,baseline,119.70282413350449,landmark,True | 625 | +4306827119,10.1007/s10586-022-03776-z,,Internet of Things intrusion detection systems: a comprehensive review and future directions,Cluster Computing,2022,book-chapter,computer_networks,4,33.0,141.0,108.61196820944366,340,212.7111,False,False,baseline,internetofthingsintrusiondetectionsystemsacomprehensivereviewandfuturedirections,108.61196820944366,landmark,True | ||
| 626 | −4406207083,10.1109/comst.2025.3527641,,Mobile Edge Intelligence for Large Language Models: A Contemporary Survey,IEEE Communications Surveys & Tutorials,2025,article,computer_networks,6,236.0,236.0,89.76743566823257,235,102.2674,True,True,post,119.47708975053992,landmark,True | 626 | +3102359135,10.1007/978-3-030-72802-1_9,2011.09144,NetFlow Datasets for Machine Learning-Based Network Intrusion Detection Systems,"Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering",2021,book-chapter,computer_networks,2,55.0,126.0,108.5769660827432,403,150.6621,False,True,baseline,netflowdatasetsformachinelearningbasednetworkintrusiondetectionsystems,108.5769660827432,landmark,True | ||
| 627 | −4301785137,10.2139/ssrn.7475259,,The Illusion of Topological Compression: Why Persistent Homology Fails as a Real-Time Prompt-Injection Defense,SSRN Electronic Journal,2026,preprint,cybersecurity,2,252.0,252.0,9805.894736842105,252,,False,True,post,895.9155859896595,landmark,True | 627 | +2905514290,,,An information security risk management gap analysis tool based on ISO/IEC 27005:2011 compliance for SMEs in Kenya,,2018,dissertation,cybersecurity,1,63.0,83.0,849.0759849906191,95,,False,False,baseline,aninformationsecurityriskmanagementgapanalysistoolbasedonisoiec270052011complianceforsmesinkenya,849.0759849906191,landmark,True | ||
| 628 | −2905514290,,,An information security risk management gap analysis tool based on ISO/IEC 27005:2011 compliance for SMEs in Kenya,,2018,dissertation,cybersecurity,1,63.0,83.0,849.0759849906191,95,,False,False,baseline,849.0759849906191,landmark,True | 628 | +2460937040,10.1201/9781351251389-8,,Adversarial Examples in the Physical World,Chapman & Hall/CRC eBooks,2018,book-chapter,cybersecurity,4,805.0,1507.0,699.9376680212566,4388,809.1968,True,True,baseline,adversarialexamplesinthephysicalworld,699.9376680212566,landmark,True | ||
| 629 | −7139094415,10.1201/9781003612742-2,,Fedformer: Frequency Enhanced Decomposed Transformer for Long-term Series Forecasting,CRC Press eBooks,2026,book-chapter,cybersecurity,1,226.0,226.0,216.38297872340425,226,303.4225,True,False,post,803.4798509272343,landmark,True | 629 | +4301785137,10.2139/ssrn.7475259,,The Illusion of Topological Compression: Why Persistent Homology Fails as a Real-Time Prompt-Injection Defense,SSRN Electronic Journal,2026,preprint,cybersecurity,2,252.0,252.0,9805.894736842105,252,,False,True,post,theillusionoftopologicalcompressionwhypersistenthomologyfailsasarealtimepromptinjectiondefense,638.9385438721052,landmark,True | ||
| 630 | −2460937040,10.1201/9781351251389-8,,Adversarial Examples in the Physical World,Chapman & Hall/CRC eBooks,2018,book-chapter,cybersecurity,4,805.0,1507.0,699.9376680212566,4388,809.1968,True,True,baseline,699.9376680212566,landmark,True | 630 | +7129030749,10.1145/3796519,,"Model Context Protocol (MCP): Landscape, Security Threats, and Future Research Directions",ACM Transactions on Software Engineering and Methodology,2026,article,cybersecurity,4,178.0,178.0,198.07867267589847,149,498.5414,True,True,post,modelcontextprotocolmcplandscapesecuritythreatsandfutureresearchdirections,451.31373336997916,landmark,True | ||
| 631 | −7129030749,10.1145/3796519,,"Model Context Protocol (MCP): Landscape, Security Threats, and Future Research Directions",ACM Transactions on Software Engineering and Methodology,2026,article,cybersecurity,4,178.0,178.0,198.07867267589847,149,498.5414,True,True,post,632.8292631196801,landmark,True | 631 | +3188417193,,,Machine learning for offensive cyber operations,NORA - Norwegian Open Research Archives,2023,dissertation,cybersecurity,6,43.0,51.0,424.2320328542094,58,,True,True,post,machinelearningforoffensivecyberoperations,424.2320328542094,landmark,True | ||
| 632 | −4289548059,10.4230/oasics.fmbc.2026.8,,Detecting Cross-Function Reentrancy from EVM Traces,DROPS (Schloss Dagstuhl – Leibniz Center for Informatics),2026,article,cybersecurity,5,148.0,148.0,1051.4722907203115,148,9.1528,True,True,post,526.1726457399587,landmark,True | 632 | +4289548059,10.4230/oasics.fmbc.2026.8,,Detecting Cross-Function Reentrancy from EVM Traces,DROPS (Schloss Dagstuhl – Leibniz Center for Informatics),2026,article,cybersecurity,5,148.0,148.0,1051.4722907203115,148,9.1528,True,True,post,detectingcrossfunctionreentrancyfromevmtraces,375.24962100425233,landmark,True | ||
| 633 | −3188417193,,,Machine learning for offensive cyber operations,NORA - Norwegian Open Research Archives,2023,dissertation,cybersecurity,6,43.0,51.0,424.2320328542094,58,,True,True,post,424.2320328542094,landmark,True | 633 | +3201596224,,,ELLIPTIC CURVE DIGITAL SIGNATURE ALGORITHM,NC Digital Online Collection of Knowledge and Scholarship (The University of North Carolina at Greensboro),2021,dissertation,cybersecurity,2,27.0,28.0,308.9145728643216,35,,True,False,baseline,ellipticcurvedigitalsignaturealgorithm,308.9145728643216,landmark,True | ||
| 634 | −3201596224,,,ELLIPTIC CURVE DIGITAL SIGNATURE ALGORITHM,NC Digital Online Collection of Knowledge and Scholarship (The University of North Carolina at Greensboro),2021,dissertation,cybersecurity,2,27.0,28.0,308.9145728643216,35,,True,False,baseline,308.9145728643216,landmark,True | 634 | +652269645,10.57709/1059372,,A Design and Analysis of Graphical Password,Digital Archive @ GSU,2022,dissertation,cybersecurity,1,35.0,35.0,303.5964912280702,43,,True,True,baseline,adesignandanalysisofgraphicalpassword,303.5964912280702,landmark,True | ||
| 635 | −652269645,10.57709/1059372,,A Design and Analysis of Graphical Password,Digital Archive @ GSU,2022,dissertation,cybersecurity,1,35.0,35.0,303.5964912280702,43,,True,True,baseline,303.5964912280702,landmark,True | 635 | +2231944250,10.7551/mitpress/11636.003.0018,,Enigma: Decentralized Computation Platform with Guaranteed Privacy,The MIT Press eBooks,2018,book-chapter,cybersecurity,6,169.0,230.0,270.2898179020262,368,204.4551,True,True,baseline,enigmadecentralizedcomputationplatformwithguaranteedprivacy,270.2898179020262,landmark,True | ||
| 636 | −2231944250,10.7551/mitpress/11636.003.0018,,Enigma: Decentralized Computation Platform with Guaranteed Privacy,The MIT Press eBooks,2018,book-chapter,cybersecurity,6,169.0,230.0,270.2898179020262,368,204.4551,True,True,baseline,270.2898179020262,landmark,True | 636 | +3041344359,,,Machine Learning for anomaly detection in IoT networks :Malware analysis on the IoT-23 data set,,2020,dissertation,cybersecurity,4,8.0,31.0,265.4812030075188,64,,True,False,baseline,machinelearningforanomalydetectioniniotnetworksmalwareanalysisontheiot23dataset,265.4812030075188,landmark,True | ||
| 637 | −3041344359,,,Machine Learning for anomaly detection in IoT networks :Malware analysis on the IoT-23 data set,,2020,dissertation,cybersecurity,4,8.0,31.0,265.4812030075188,64,,True,False,baseline,265.4812030075188,landmark,True | 637 | +4401666902,10.38124/ijisrt/ijisrt24aug395,,Cyberfraud in the Nigerian Banking Sector: The Techniques and Preventive Measures,International Journal of Innovative Science and Research Technology (IJISRT),2024,article,cybersecurity,1,739.0,739.0,222.49445823978112,739,282.4198,True,True,post,cyberfraudinthenigerianbankingsectorthetechniquesandpreventivemeasures,222.49445823978112,landmark,True | ||
| 638 | −4401666902,10.38124/ijisrt/ijisrt24aug395,,Cyberfraud in the Nigerian Banking Sector: The Techniques and Preventive Measures,International Journal of Innovative Science and Research Technology (IJISRT),2024,article,cybersecurity,1,739.0,739.0,222.49445823978112,739,282.4198,True,True,post,222.49445823978112,landmark,True | 638 | +4353004773,10.1109/mitp.2023.3246667,,IEEE Symposium on Security and Privacy,IT Professional,2023,article,cybersecurity,2,671.0,853.0,199.92253679509537,1167,130.8885,False,True,post,ieeesymposiumonsecurityandprivacy,199.92253679509537,landmark,True | ||
| 639 | −7125967353,10.1016/j.comnet.2026.112061,,An explainable transformer-based model for phishing email detection: A large language model approach,Computer Networks,2026,article,cybersecurity,6,60.0,60.0,426.27255029201814,23,173.9038,True,True,post,213.31323475944274,landmark,True | 639 | +2805930283,10.1109/access.2018.2842685,2402.00687,A Review on the Use of Blockchain for the Internet of Things,IEEE Access,2018,article,cybersecurity,5,184.0,370.0,196.1729236493096,1078,221.3514,True,True,post,areviewontheuseofblockchainfortheinternetofthings,196.1729236493096,landmark,True | ||
| 640 | −4353004773,10.1109/mitp.2023.3246667,,IEEE Symposium on Security and Privacy,IT Professional,2023,article,cybersecurity,2,671.0,853.0,199.92253679509537,1167,130.8885,False,True,post,199.92253679509537,landmark,True | 640 | +2624307925,10.1109/comst.2018.2842460,1706.00916,A Survey on Security and Privacy Issues of Bitcoin,IEEE Communications Surveys & Tutorials,2018,article,cybersecurity,6,207.0,367.0,194.58233237647738,1103,211.3082,True,True,pre,asurveyonsecurityandprivacyissuesofbitcoin,194.58233237647738,landmark,True | ||
| 641 | −2805930283,10.1109/access.2018.2842685,2402.00687,A Review on the Use of Blockchain for the Internet of Things,IEEE Access,2018,article,cybersecurity,5,184.0,370.0,196.1729236493096,1078,221.3514,True,True,post,196.1729236493096,landmark,True | 641 | +4392771733,,,Sécurisation des Algorithmes d'Apprentissage Automatique,theses.fr (ABES),2023,dissertation,cybersecurity,5,17.0,21.0,174.68377823408625,21,,True,True,post,scurisationdesalgorithmesdapprentissageautomatique,174.68377823408625,landmark,True | ||
| 642 | −2624307925,10.1109/comst.2018.2842460,1706.00916,A Survey on Security and Privacy Issues of Bitcoin,IEEE Communications Surveys & Tutorials,2018,article,cybersecurity,6,207.0,367.0,194.58233237647738,1103,211.3082,True,True,pre,194.58233237647738,landmark,True | 642 | +2789828921,10.5220/0006639801080116,,Toward Generating a New Intrusion Detection Dataset and Intrusion Traffic Characterization,International Conference on Information Systems Security and Privacy (ICISSP),2018,conference-paper,cybersecurity,2,200.0,534.0,162.76665116819714,4757,217.8381,False,True,baseline,towardgeneratinganewintrusiondetectiondatasetandintrusiontrafficcharacterization,162.76665116819714,landmark,True | ||
| 643 | −7130652904,10.1145/3797277,,vul-rag : Enhancing LLM-based Vulnerability Detection via Knowledge-level RAG,ACM Transactions on Software Engineering and Methodology,2026,article,cybersecurity,5,51.0,51.0,362.3316677482154,30,247.1264,True,True,post,181.31624954552632,landmark,True | 643 | +4406302454,10.1145/3712001,2402.00888,Security and Privacy Challenges of Large Language Models: A Survey,ACM Computing Surveys,2025,article,cybersecurity,5,357.0,357.0,121.61180437793685,357,141.8982,True,True,post,securityandprivacychallengesoflargelanguagemodelsasurvey,155.99884965417968,landmark,True | ||
| 644 | −4406302454,10.1145/3712001,2402.00888,Security and Privacy Challenges of Large Language Models: A Survey,ACM Computing Surveys,2025,article,cybersecurity,5,357.0,357.0,121.61180437793685,357,141.8982,True,True,post,180.73441119043537,landmark,True | 644 | +2309315845,10.58088/javg-d166,,Human-centric training and assessment for cyber situation awareness,"Library, Museums and Press - UDSpace (University of Delaware)",2024,dissertation,cybersecurity,4,4.0,4.0,155.76296296296297,4,,True,True,post,humancentrictrainingandassessmentforcybersituationawareness,155.76296296296297,landmark,True | ||
| 645 | −4392771733,,,Sécurisation des Algorithmes d'Apprentissage Automatique,theses.fr (ABES),2023,dissertation,cybersecurity,5,17.0,21.0,174.68377823408625,21,,True,True,post,174.68377823408625,landmark,True | 645 | +2795085730,10.1109/mcc.2018.011791712,,Blockchain: A Panacea for Healthcare Cloud-Based Data Security and Privacy?,IEEE Cloud Computing,2018,article,cybersecurity,6,130.0,270.0,143.1532145549016,855,159.8872,True,False,baseline,blockchainapanaceaforhealthcarecloudbaseddatasecurityandprivacy,143.1532145549016,landmark,True | ||
| 646 | −7124456577,10.1007/s41870-025-03069-9,,AF-SGS: Blockchain-assisted secure authentication framework for smart grid systems,International Journal of Information Technology,2026,article,cybersecurity,2,46.0,46.0,161.49184840143977,46,192.7628,False,False,post,163.5401466489061,landmark,True | 646 | +2984937325,,,Trusted Execution Environments in Cloud Computing,Aaltodoc (Aalto University),2021,dissertation,cybersecurity,5,22.0,31.0,140.99890109890111,42,,True,False,baseline,trustedexecutionenvironmentsincloudcomputing,140.99890109890111,landmark,True | ||
| 647 | −2789828921,10.5220/0006639801080116,,Toward Generating a New Intrusion Detection Dataset and Intrusion Traffic Characterization,International Conference on Information Systems Security and Privacy (ICISSP),2018,conference-paper,cybersecurity,2,200.0,534.0,162.76665116819714,4757,217.8381,False,True,baseline,162.76665116819714,landmark,True | 647 | +2946416612,,,Inadvertently Making Cyber Criminals Rich: A Comprehensive Study of Cryptojacking Campaigns at Internet Scale,Research Repository (Delft University of Technology),2019,dissertation,cybersecurity,2,9.0,14.0,140.31616982836496,19,,True,True,baseline,inadvertentlymakingcybercriminalsrichacomprehensivestudyofcryptojackingcampaignsatinternetscale,140.31616982836496,landmark,True | ||
| 648 | −2309315845,10.58088/javg-d166,,Human-centric training and assessment for cyber situation awareness,"Library, Museums and Press - UDSpace (University of Delaware)",2024,dissertation,cybersecurity,4,4.0,4.0,155.76296296296297,4,,True,True,post,155.76296296296297,landmark,True | 648 | +1550000763,10.1184/r1/6621806,,Crying Wolf: An Empirical Study of SSL Warning Effectiveness,KiltHub Repository,2018,article,cybersecurity,3,245.0,262.0,138.91163782734898,331,29.7278,True,True,baseline,cryingwolfanempiricalstudyofsslwarningeffectiveness,138.91163782734898,landmark,True | ||
| 649 | −4387210439,10.3390/telecom7030073,2309.16021,HuntGPT: Integrating Machine Learning-Based Anomaly Detection and Explainable AI with Large Language Models (LLMs),Telecom,2026,article,cybersecurity,7,41.0,41.0,143.93838661867457,41,16.762,True,True,post,145.7640437522859,landmark,True | 649 | +2781723315,10.1109/sp.2019.00002,1801.01203,Spectre Attacks: Exploiting Speculative Execution,Proceedings - IEEE Symposium on Security and Privacy/Proceedings of the ... IEEE Symposium on Security and Privacy,2019,conference-paper,cybersecurity,7,693.0,1001.0,133.14175590649612,1780,109.082,True,True,baseline,spectreattacksexploitingspeculativeexecution,133.14175590649612,landmark,True | ||
| 650 | −3015692940,10.14419/ijet.v7i4.21726,,Performance evaluation measurement of image steganography techniques with analysis of LSB based on variation image formats,International Journal of Engineering & Technology,2026,article,cybersecurity,2,41.0,41.0,109.89503437738733,41,0.0,True,True,post,145.7640437522859,landmark,True | 650 | +4322207773,10.26686/wgtn.22180858,,"Automating Behavior-based Ransomware Analysis, Detection, and Classification Using Machine Learning",,2023,dissertation,cybersecurity,7,9.0,10.0,132.5,11,,True,True,post,automatingbehaviorbasedransomwareanalysisdetectionandclassificationusingmachinelearning,132.5,landmark,True | ||
| 651 | −2795085730,10.1109/mcc.2018.011791712,,Blockchain: A Panacea for Healthcare Cloud-Based Data Security and Privacy?,IEEE Cloud Computing,2018,article,cybersecurity,6,130.0,270.0,143.1532145549016,855,159.8872,True,False,baseline,143.1532145549016,landmark,True | 651 | +4392353733,10.1016/j.hcc.2024.100211,2312.02003,"A survey on large language model (LLM) security and privacy: The Good, The Bad, and The Ugly",High-Confidence Computing,2024,article,cybersecurity,7,728.0,1059.0,131.53622644511728,1059,157.601,True,True,post,asurveyonlargelanguagemodelllmsecurityandprivacythegoodthebadandtheugly,131.53622644511728,landmark,True | ||
| 652 | −2916447643,10.17487/rfc9846,,The Transport Layer Security (TLS) Protocol Version 1.3,,2026,report,applied_cryptography,2,111.0,111.0,1533.1874999999998,301,,True,False,post,394.6294843049691,landmark,True | 652 | +1598516026,10.55277/researchhub.8k9hq1lf.1,,Scantegrity II Municipal Election at Takoma Park: The First E2E Binding Governmental Election with Ballot Privacy,,2026,report,applied_cryptography,2,97.0,97.0,914.8011049723757,107,,True,True,post,scantegrityiimunicipalelectionattakomaparkthefirste2ebindinggovernmentalelectionwithballotprivacy,245.94062998251673,landmark,True | ||
| 653 | −1598516026,10.55277/researchhub.8k9hq1lf.1,,Scantegrity II Municipal Election at Takoma Park: The First E2E Binding Governmental Election with Ballot Privacy,,2026,report,applied_cryptography,2,97.0,97.0,914.8011049723757,107,,True,True,post,344.8563961944324,landmark,True | 653 | +4293168393,10.1145/3549993.3550007,,New Directions in Cryptography,ACM eBooks,2022,book-chapter,applied_cryptography,1,316.0,402.0,215.4337868090236,668,135.2339,True,False,baseline,newdirectionsincryptography,215.4337868090236,landmark,True | ||
| 654 | −4293168393,10.1145/3549993.3550007,,New Directions in Cryptography,ACM eBooks,2022,book-chapter,applied_cryptography,1,316.0,402.0,215.4337868090236,668,135.2339,True,False,baseline,215.4337868090236,landmark,True | 654 | +1497727960,10.82444/warw.33628720,,FLINT : Fast library for number theory,Warwick Research Archive Portal (University of Warwick),2026,article,applied_cryptography,1,59.0,59.0,166.59291493012995,60,0.0,True,True,post,flintfastlibraryfornumbertheory,149.59275431926275,landmark,True | ||
| 655 | −1497727960,10.82444/warw.33628720,,FLINT : Fast library for number theory,Warwick Research Archive Portal (University of Warwick),2026,article,applied_cryptography,1,59.0,59.0,166.59291493012995,60,0.0,True,True,post,209.7580141801187,landmark,True | 655 | +7134847443,10.1109/tce.2026.3672135,,"3D Non-Degenerate Hyperchaos: Design, Analysis, and Application in Image Encryption",IEEE Transactions on Consumer Electronics,2026,article,applied_cryptography,4,59.0,59.0,158.14163483575248,59,183.8619,True,False,post,3dnondegeneratehyperchaosdesignanalysisandapplicationinimageencryption,149.59275431926275,landmark,True | ||
| 656 | −7134847443,10.1109/tce.2026.3672135,,"3D Non-Degenerate Hyperchaos: Design, Analysis, and Application in Image Encryption",IEEE Transactions on Consumer Electronics,2026,article,applied_cryptography,4,59.0,59.0,158.14163483575248,59,183.8619,True,False,post,209.7580141801187,landmark,True | 656 | +1516024962,10.7275/409838,,Energy Efficient Adaptive Reed-Solomon Decoding System,Scholarworks (University of Massachusetts Amherst),2023,dissertation,applied_cryptography,3,8.0,8.0,146.84444444444443,9,,True,True,post,energyefficientadaptivereedsolomondecodingsystem,146.84444444444443,landmark,True | ||
| 657 | −7154469464,10.1145/3808699,,Cryptanalysis and Improvement of a Video Cryptosystem via Chaos and S-Box,ACM Transactions on Multimedia Computing Communications and Applications,2026,article,applied_cryptography,3,57.0,57.0,152.78090145148968,57,177.6293,True,True,post,202.6475730214706,landmark,True | 657 | +7154469464,10.1145/3808699,,Cryptanalysis and Improvement of a Video Cryptosystem via Chaos and S-Box,ACM Transactions on Multimedia Computing Communications and Applications,2026,article,applied_cryptography,3,57.0,57.0,152.78090145148968,57,177.6293,True,True,post,cryptanalysisandimprovementofavideocryptosystemviachaosandsbox,144.52181349488094,landmark,True | ||
| 658 | −1516024962,10.7275/409838,,Energy Efficient Adaptive Reed-Solomon Decoding System,Scholarworks (University of Massachusetts Amherst),2023,dissertation,applied_cryptography,3,8.0,8.0,146.84444444444443,9,,True,True,post,146.84444444444443,landmark,True | 658 | +4220942018,10.1201/9781003187165-10,,Public and private blockchains,CRC Press eBooks,2022,book-chapter,applied_cryptography,2,166.0,175.0,135.97268806899856,179,35.3352,True,False,baseline,publicandprivateblockchains,135.97268806899856,landmark,True | ||
| 659 | −4220942018,10.1201/9781003187165-10,,Public and private blockchains,CRC Press eBooks,2022,book-chapter,applied_cryptography,2,166.0,175.0,135.97268806899856,179,35.3352,True,False,baseline,135.97268806899856,landmark,True | 659 | +2910044495,,,Key Agreement with Physical Unclonable Functions and Biometric Identifiers,mediaTUM – the media and publications repository of the Technical University Munich (Technical University Munich),2019,dissertation,applied_cryptography,3,6.0,17.0,116.57142857142857,21,,False,False,baseline,keyagreementwithphysicalunclonablefunctionsandbiometricidentifiers,116.57142857142857,landmark,True | ||
| 660 | −2910044495,,,Key Agreement with Physical Unclonable Functions and Biometric Identifiers,mediaTUM – the media and publications repository of the Technical University Munich (Technical University Munich),2019,dissertation,applied_cryptography,3,6.0,17.0,116.57142857142857,21,,False,False,baseline,116.57142857142857,landmark,True | 660 | +2915352631,10.17487/rfc8446,,The Transport Layer Security (TLS) Protocol Version 1.3,,2018,report,applied_cryptography,3,316.0,486.0,110.30219435736677,1851,,True,False,baseline,thetransportlayersecuritytlsprotocolversion13,110.30219435736677,landmark,True | ||
| 661 | −2915352631,10.17487/rfc8446,,The Transport Layer Security (TLS) Protocol Version 1.3,,2018,report,applied_cryptography,3,316.0,486.0,110.30219435736677,1851,,True,False,baseline,110.30219435736677,landmark,True | 661 | +4396670109,10.4018/979-8-3693-1335-0.ch012,,Advanced Digital Data Processing Using Cloud Cryptography,Advances in civil and industrial engineering book series,2024,book-chapter,applied_cryptography,4,133.0,133.0,86.71235909822867,133,97.3697,True,False,post,advanceddigitaldataprocessingusingcloudcryptography,86.71235909822867,landmark,True | ||
| 662 | −4413785573,10.1109/tdsc.2025.3603570,,Encrypt a Story: A Video Segment Encryption Method Based on the Discrete Sinusoidal Memristive Rulkov Neuron,IEEE Transactions on Dependable and Secure Computing,2025,article,applied_cryptography,4,176.0,176.0,57.549674211696974,176,64.4002,True,False,post,89.10155845802977,landmark,True | 662 | +4214667959,10.1016/j.bcra.2022.100067,,A survey on blockchain technology and its security,Blockchain Research and Applications,2022,article,applied_cryptography,4,164.0,337.0,82.8248106660309,571,120.3925,True,True,baseline,asurveyonblockchaintechnologyanditssecurity,82.8248106660309,landmark,True | ||
| 663 | −4396670109,10.4018/979-8-3693-1335-0.ch012,,Advanced Digital Data Processing Using Cloud Cryptography,Advances in civil and industrial engineering book series,2024,book-chapter,applied_cryptography,4,133.0,133.0,86.71235909822867,133,97.3697,True,False,post,86.71235909822867,landmark,True | 663 | +4226075590,10.6028/nist.ir.8413,,Status report on the third round of the NIST Post-Quantum Cryptography Standardization process,,2022,report,applied_cryptography,3,144.0,242.0,79.32594644506003,395,,True,True,baseline,statusreportonthethirdroundofthenistpostquantumcryptographystandardizationprocess,79.32594644506003,landmark,True | ||
| 664 | −4401459825,10.6028/nist.fips.203,,Module-lattice-based key-encapsulation mechanism standard,,2024,report,applied_cryptography,3,84.0,236.0,85.45305164319248,236,,True,True,post,85.45305164319248,landmark,True | 664 | +4413785573,10.1109/tdsc.2025.3603570,,Encrypt a Story: A Video Segment Encryption Method Based on the Discrete Sinusoidal Memristive Rulkov Neuron,IEEE Transactions on Dependable and Secure Computing,2025,article,applied_cryptography,4,176.0,176.0,57.549674211696974,176,64.4002,True,False,post,encryptastoryavideosegmentencryptionmethodbasedonthediscretesinusoidalmemristiverulkovneuron,76.90699590794293,landmark,True | ||
| 665 | −4214667959,10.1016/j.bcra.2022.100067,,A survey on blockchain technology and its security,Blockchain Research and Applications,2022,article,applied_cryptography,4,164.0,337.0,82.8248106660309,571,120.3925,True,True,baseline,82.8248106660309,landmark,True | 665 | +2910369831,10.1016/j.future.2019.01.018,,Blockchain based searchable encryption for electronic health record sharing,Future Generation Computer Systems,2019,article,applied_cryptography,5,84.0,167.0,68.16664743486187,482,87.1622,False,False,baseline,blockchainbasedsearchableencryptionforelectronichealthrecordsharing,68.16664743486187,landmark,True | ||
| 666 | −4226075590,10.6028/nist.ir.8413,,Status report on the third round of the NIST Post-Quantum Cryptography Standardization process,,2022,report,applied_cryptography,3,144.0,242.0,79.32594644506003,395,,True,True,baseline,79.32594644506003,landmark,True | 666 | +4365934498,10.1007/978-3-031-30589-4_15,,An Efficient Key Recovery Attack on SIDH,Lecture notes in computer science,2023,conference-paper,applied_cryptography,1,145.0,223.0,67.25882266726688,281,73.5527,False,True,post,anefficientkeyrecoveryattackonsidh,67.25882266726688,landmark,True | ||
| 667 | −7124450903,10.1016/j.inffus.2026.104155,,"On the security and privacy of federated learning: A survey with attacks, defenses, frameworks, applications, and future directions",Information Fusion,2026,article,applied_cryptography,6,22.0,22.0,24.48163370151554,16,57.8019,True,True,post,78.21485274512901,landmark,True | 667 | +2913851998,10.6028/nist.ir.8240,,Status report on the first round of the NIST post-quantum cryptography standardization process,,2019,report,applied_cryptography,2,70.0,153.0,65.49329758713137,363,,True,True,baseline,statusreportonthefirstroundofthenistpostquantumcryptographystandardizationprocess,65.49329758713137,landmark,True | ||
| 668 | −7160693558,10.1007/s10473-026-0325-9,,Passivity-based synchronization of Markovian jump inertial neural networks via adaptive event-driven protocol and its application to image encryption,Acta Mathematica Scientia,2026,article,applied_cryptography,1,21.0,21.0,73.7245394876138,21,88.0004,False,False,post,74.65963216580496,landmark,True | 668 | +3209866323,10.18063/wct.v0i0.407,,Separable Reversible Data Hiding in an Encrypted Image,Wireless Communication Technology,2018,article,applied_cryptography,3,323.0,372.0,65.312839313152,427,26.419,False,False,baseline,separablereversibledatahidinginanencryptedimage,65.312839313152,landmark,True | ||
| 669 | −4406028284,10.1109/jiot.2025.3525623,,A Novel Dynamic Hill Cipher and Its Applications on Medical IoT,IEEE Internet of Things Journal,2025,article,applied_cryptography,4,147.0,147.0,48.06705743817872,147,53.7888,True,False,post,74.42005166664985,landmark,True | 669 | +4406028284,10.1109/jiot.2025.3525623,,A Novel Dynamic Hill Cipher and Its Applications on Medical IoT,IEEE Internet of Things Journal,2025,article,applied_cryptography,4,147.0,147.0,48.06705743817872,147,53.7888,True,False,post,anoveldynamichillcipheranditsapplicationsonmedicaliot,64.2348204458387,landmark,True | ||
| 670 | −2970408908,10.1007/978-3-030-63076-8_2,,Deep Leakage from Gradients,Lecture notes in computer science,2020,conference-paper,applied_cryptography,2,294.0,511.0,72.42380039311094,1489,84.6644,False,False,baseline,72.42380039311094,landmark,True | 670 | +3022665000,10.1016/s0140-6736(20)31034-5,,"COVID-19 immunity passports and vaccination certificates: scientific, equitable, and legal challenges",The Lancet,2020,article,applied_cryptography,1,158.0,218.0,63.47984296349881,291,61.3673,False,True,baseline,covid19immunitypassportsandvaccinationcertificatesscientificequitableandlegalchallenges,63.47984296349881,landmark,True | ||
| 671 | −4401442713,10.6028/nist.fips.204,,Module-lattice-based digital signature standard,,2024,report,applied_cryptography,2,64.0,193.0,69.88321596244131,193,,True,True,post,69.88321596244131,landmark,True | 671 | +3156129242,10.1109/access.2021.3072849,,"A Survey on Blockchain Technology: Evolution, Architecture and Security",IEEE Access,2021,article,applied_cryptography,4,87.0,226.0,59.84604799688895,522,84.4336,True,True,baseline,asurveyonblockchaintechnologyevolutionarchitectureandsecurity,59.84604799688895,landmark,True | ||
| 672 | −2910369831,10.1016/j.future.2019.01.018,,Blockchain based searchable encryption for electronic health record sharing,Future Generation Computer Systems,2019,article,applied_cryptography,5,84.0,167.0,68.16664743486187,482,87.1622,False,False,baseline,68.16664743486187,landmark,True | 672 | +44936433,10.1145/3335741.3335755,,"How to play any mental game, or a completeness theorem for protocols with honest majority",ACM eBooks,2019,book-chapter,applied_cryptography,2,143.0,189.0,58.79166858882687,403,47.6938,True,False,baseline,howtoplayanymentalgameoracompletenesstheoremforprotocolswithhonestmajority,58.79166858882687,landmark,True | ||
| 673 | −4365934498,10.1007/978-3-031-30589-4_15,,An Efficient Key Recovery Attack on SIDH,Lecture notes in computer science,2023,conference-paper,applied_cryptography,1,145.0,223.0,67.25882266726688,281,73.5527,False,True,post,67.25882266726688,landmark,True | 673 | +4317737920,10.3390/electronics12030546,,"Blockchain Technology: Security Issues, Healthcare Applications, Challenges and Future Trends",Electronics,2023,article,applied_cryptography,7,136.0,241.0,56.48456197845015,282,66.2667,True,True,post,blockchaintechnologysecurityissueshealthcareapplicationschallengesandfuturetrends,56.48456197845015,landmark,True | ||
| 674 | −2913851998,10.6028/nist.ir.8240,,Status report on the first round of the NIST post-quantum cryptography standardization process,,2019,report,applied_cryptography,2,70.0,153.0,65.49329758713137,363,,True,True,baseline,65.49329758713137,landmark,True | 674 | +2912977751,10.1109/tii.2019.2897133,,A Blockchain-Based Nonrepudiation Network Computing Service Scheme for Industrial IoT,IEEE Transactions on Industrial Informatics,2019,article,applied_cryptography,4,85.0,138.0,56.3293254252152,230,55.2964,True,False,baseline,ablockchainbasednonrepudiationnetworkcomputingserviceschemeforindustrialiot,56.3293254252152,landmark,True | ||
| 675 | −3209866323,10.18063/wct.v0i0.407,,Separable Reversible Data Hiding in an Encrypted Image,Wireless Communication Technology,2018,article,applied_cryptography,3,323.0,372.0,65.312839313152,427,26.419,False,False,baseline,65.312839313152,landmark,True | 675 | +7160693558,10.1007/s10473-026-0325-9,,Passivity-based synchronization of Markovian jump inertial neural networks via adaptive event-driven protocol and its application to image encryption,Acta Mathematica Scientia,2026,article,applied_cryptography,1,21.0,21.0,73.7245394876138,21,88.0004,False,False,post,passivitybasedsynchronizationofmarkovianjumpinertialneuralnetworksviaadaptiveeventdrivenprotocolanditsapplicationtoimageencryption,53.24487865600877,landmark,True | ||
| 676 | −7135072016,10.1007/s11071-026-12263-8,,A novel heterogeneous coupled neuron model and its application in medical image encryption,Nonlinear Dynamics,2026,article,applied_cryptography,2,18.0,18.0,48.246600458365165,18,56.0935,False,False,post,63.99397042783282,landmark,True | 676 | +4254706618,10.6028/nist.ir.8309,,Status report on the second round of the NIST post-quantum cryptography standardization process,,2020,report,applied_cryptography,2,68.0,152.0,52.898263027295286,296,,True,True,baseline,statusreportonthesecondroundofthenistpostquantumcryptographystandardizationprocess,52.898263027295286,landmark,True | ||
| 677 | −4211068006,10.2139/ssrn.3977007,,Bitcoin: A Peer-to-Peer Electronic Cash System,SSRN Electronic Journal,2022,preprint,blockchain,3,8639.0,10307.0,2271.7939326239048,11148,,False,True,baseline,2271.7939326239048,landmark,True | 677 | +4248175462,10.2139/ssrn.3440802,,Bitcoin: A Peer-to-Peer Electronic Cash System,SSRN Electronic Journal,2019,preprint,blockchain,3,5543.0,7534.0,1699.155537022696,13922,,False,True,baseline,bitcoinapeertopeerelectroniccashsystem,1699.155537022696,landmark,True | ||
| 678 | −4248175462,10.2139/ssrn.3440802,,Bitcoin: A Peer-to-Peer Electronic Cash System,SSRN Electronic Journal,2019,preprint,blockchain,3,5543.0,7534.0,1699.155537022696,13922,,False,True,baseline,1699.155537022696,landmark,True | 678 | +2961501274,10.1007/978-3-030-17740-9_3,,Aleksander Berentsen Recommends “Bitcoin: A Peer-to-Peer Electronic Cash System” by Satoshi Nakamoto,Springer eBooks,2019,book-chapter,blockchain,2,144.0,226.0,220.05819391042294,259,176.7032,False,False,baseline,aleksanderberentsenrecommendsbitcoinapeertopeerelectroniccashsystembysatoshinakamoto,220.05819391042294,landmark,True | ||
| 679 | −2961501274,10.1007/978-3-030-17740-9_3,,Aleksander Berentsen Recommends “Bitcoin: A Peer-to-Peer Electronic Cash System” by Satoshi Nakamoto,Springer eBooks,2019,book-chapter,blockchain,2,144.0,226.0,220.05819391042294,259,176.7032,False,False,baseline,220.05819391042294,landmark,True | 679 | +2898069736,10.1080/00207543.2018.1533261,,Blockchain technology and its relationships to sustainable supply chain management,International Journal of Production Research,2018,article,blockchain,2,100.0,389.0,206.24666837724715,4083,331.4245,True,False,baseline,blockchaintechnologyanditsrelationshipstosustainablesupplychainmanagement,206.24666837724715,landmark,True | ||
| 680 | −4300127641,10.1145/3190508.3190538,,Hyperledger fabric,,2018,conference-paper,blockchain,3,298.0,703.0,208.44083650190112,3605,247.1511,True,False,baseline,208.44083650190112,landmark,True | 680 | +2905867785,10.1109/access.2019.2896108,1805.02707,A Survey on Consensus Mechanisms and Mining Strategy Management in Blockchain Networks,IEEE Access,2019,article,blockchain,4,279.0,493.0,201.23447416399344,995,178.3857,True,True,baseline,asurveyonconsensusmechanismsandminingstrategymanagementinblockchainnetworks,201.23447416399344,landmark,True | ||
| 681 | −2898069736,10.1080/00207543.2018.1533261,,Blockchain technology and its relationships to sustainable supply chain management,International Journal of Production Research,2018,article,blockchain,2,100.0,389.0,206.24666837724715,4083,331.4245,True,False,baseline,206.24666837724715,landmark,True | 681 | +4320717855,10.1016/j.future.2023.02.008,,Blockchain for the metaverse: A Review,Future Generation Computer Systems,2023,article,blockchain,4,569.0,763.0,178.82871696911812,771,171.5415,True,True,baseline,blockchainforthemetaverseareview,178.82871696911812,landmark,True | ||
| 682 | −2905867785,10.1109/access.2019.2896108,1805.02707,A Survey on Consensus Mechanisms and Mining Strategy Management in Blockchain Networks,IEEE Access,2019,article,blockchain,4,279.0,493.0,201.23447416399344,995,178.3857,True,True,baseline,201.23447416399344,landmark,True | 682 | +3162358200,10.48550/arxiv.2105.07447,2105.07447,"Non-Fungible Token (NFT): Overview, Evaluation, Opportunities and Challenges",arXiv (Cornell University),2021,preprint,blockchain,3,157.0,387.0,157.1901226597805,577,,True,True,baseline,nonfungibletokennftoverviewevaluationopportunitiesandchallenges,157.1901226597805,landmark,True | ||
| 683 | −4320717855,10.1016/j.future.2023.02.008,,Blockchain for the metaverse: A Review,Future Generation Computer Systems,2023,article,blockchain,4,569.0,763.0,178.82871696911812,771,171.5415,True,True,baseline,178.82871696911812,landmark,True | 683 | +3123868249,10.1093/rfs/hhz015,,"Sex, Drugs, and Bitcoin: How Much Illegal Activity Is Financed through Cryptocurrencies?",Review of Financial Studies,2019,article,blockchain,2,246.0,368.0,150.21153446724054,1051,145.8951,True,True,baseline,sexdrugsandbitcoinhowmuchillegalactivityisfinancedthroughcryptocurrencies,150.21153446724054,landmark,True | ||
| 684 | −4405432346,10.2139/ssrn.4993270,,Bitcoin: A Peer-to-Peer Electronic Cash System,SSRN Electronic Journal,2024,preprint,blockchain,3,199.0,200.0,176.00641968704025,200,,False,True,post,176.00641968704025,landmark,True | 684 | +2907683311,10.1109/access.2018.2890507,,Blockchain for AI: Review and Open Research Challenges,IEEE Access,2019,article,blockchain,1,200.0,342.0,139.59876301031593,997,153.0805,True,True,baseline,blockchainforaireviewandopenresearchchallenges,139.59876301031593,landmark,True | ||
| 685 | −2927344969,10.2139/ssrn.6433340,,Global Blockchain Benchmarking Study,SSRN Electronic Journal,2026,preprint,blockchain,1,45.0,45.0,1480.9248554913295,45,,False,True,post,159.98492606958206,landmark,True | 685 | +4400662300,10.38124/ijisrt/ijisrt24jul180,,Collaborative Networks: Integrating Blockchain for Enhanced Trust and Transparency,International Journal of Innovative Science and Research Technology (IJISRT),2024,article,blockchain,1,449.0,449.0,135.18269519575335,449,171.8245,True,True,post,collaborativenetworksintegratingblockchainforenhancedtrustandtransparency,135.18269519575335,landmark,True | ||
| 686 | −3162358200,10.48550/arxiv.2105.07447,2105.07447,"Non-Fungible Token (NFT): Overview, Evaluation, Opportunities and Challenges",arXiv (Cornell University),2021,preprint,blockchain,3,157.0,387.0,157.1901226597805,577,,True,True,baseline,157.1901226597805,landmark,True | 686 | +4402275599,10.38124/ijisrt/ijisrt24aug1218,,Implementing Blockchain Technology for Optimized Supply Chain and Enhanced Sustainability,International Journal of Innovative Science and Research Technology (IJISRT),2024,article,blockchain,1,447.0,449.0,135.18269519575335,449,171.8245,True,True,post,implementingblockchaintechnologyforoptimizedsupplychainandenhancedsustainability,135.18269519575335,landmark,True | ||
| 687 | −3123868249,10.1093/rfs/hhz015,,"Sex, Drugs, and Bitcoin: How Much Illegal Activity Is Financed through Cryptocurrencies?",Review of Financial Studies,2019,article,blockchain,2,246.0,368.0,150.21153446724054,1051,145.8951,True,True,baseline,150.21153446724054,landmark,True | 687 | +2606010969,10.1145/3183367,1704.03610,Blockchains for Business Process Management - Challenges and Opportunities,ACM Transactions on Management Information Systems,2018,article,blockchain,3,145.0,253.0,134.13986400885224,704,145.0233,True,True,baseline,blockchainsforbusinessprocessmanagementchallengesandopportunities,134.13986400885224,landmark,True | ||
| 688 | −2907683311,10.1109/access.2018.2890507,,Blockchain for AI: Review and Open Research Challenges,IEEE Access,2019,article,blockchain,1,200.0,342.0,139.59876301031593,997,153.0805,True,True,baseline,139.59876301031593,landmark,True | 688 | +2914735843,10.1109/tsmc.2019.2895123,,"Blockchain-Enabled Smart Contracts: Architecture, Applications, and Future Trends",IEEE Transactions on Systems Man and Cybernetics Systems,2019,article,blockchain,2,136.0,314.0,128.1696245182433,1157,157.1419,True,False,baseline,blockchainenabledsmartcontractsarchitectureapplicationsandfuturetrends,128.1696245182433,landmark,True | ||
| 689 | −2892520153,10.6028/nist.ir.8202,1906.11078,Blockchain technology overview,,2018,report,blockchain,5,103.0,273.0,137.2692548528491,1551,,True,True,baseline,137.2692548528491,landmark,True | 689 | +2973816953,10.7551/mitpress/11645.003.0010,,How Blockchain Will Change Organizations,The MIT Press eBooks,2018,book-chapter,blockchain,1,55.0,109.0,128.09387022313413,375,138.4143,True,False,baseline,howblockchainwillchangeorganizations,128.09387022313413,landmark,True | ||
| 690 | −3122636688,10.1093/rfs/hhz007,,Blockchain Disruption and Smart Contracts,Review of Financial Studies,2019,article,blockchain,1,189.0,332.0,135.5169278345757,1089,145.8951,True,False,baseline,135.5169278345757,landmark,True | 690 | +3123722958,10.1002/isaf.1424,,Toward an ontology‐driven blockchain design for supply‐chain provenance,"Intelligent systems in accounting, finance and management/Intelligent systems in accounting, finance & management",2018,article,blockchain,2,122.0,233.0,123.53592218997065,651,132.5698,True,False,baseline,towardanontologydrivenblockchaindesignforsupplychainprovenance,123.53592218997065,landmark,True | ||
| 691 | −4400662300,10.38124/ijisrt/ijisrt24jul180,,Collaborative Networks: Integrating Blockchain for Enhanced Trust and Transparency,International Journal of Innovative Science and Research Technology (IJISRT),2024,article,blockchain,1,449.0,449.0,135.18269519575335,449,171.8245,True,True,post,135.18269519575335,landmark,True | 691 | +2800028583,10.1016/bs.adcom.2018.03.006,,Blockchain Technology Use Cases in Healthcare,Advances in computers,2018,book-chapter,blockchain,1,42.0,100.0,117.51731213131572,434,154.6983,False,False,baseline,blockchaintechnologyusecasesinhealthcare,117.51731213131572,landmark,True | ||
| 692 | −4402275599,10.38124/ijisrt/ijisrt24aug1218,,Implementing Blockchain Technology for Optimized Supply Chain and Enhanced Sustainability,International Journal of Innovative Science and Research Technology (IJISRT),2024,article,blockchain,1,447.0,449.0,135.18269519575335,449,171.8245,True,True,post,135.18269519575335,landmark,True | 692 | +2784387076,10.1017/s1744137417000200,,Blockchains and the economic institutions of capitalism,Journal of Institutional Economics,2018,article,blockchain,4,143.0,220.0,116.64336000769761,577,110.4748,True,True,baseline,blockchainsandtheeconomicinstitutionsofcapitalism,116.64336000769761,landmark,True | ||
| 693 | −2606010969,10.1145/3183367,1704.03610,Blockchains for Business Process Management - Challenges and Opportunities,ACM Transactions on Management Information Systems,2018,article,blockchain,3,145.0,253.0,134.13986400885224,704,145.0233,True,True,baseline,134.13986400885224,landmark,True | 693 | +4380356557,10.4018/978-1-6684-5422-0.ch012,,Blockchain Technology in Renovating Healthcare,Advances in healthcare information systems and administration book series,2023,book-chapter,blockchain,2,139.0,169.0,116.33373815885354,171,116.723,True,False,post,blockchaintechnologyinrenovatinghealthcare,116.33373815885354,landmark,True | ||
| 694 | −2914735843,10.1109/tsmc.2019.2895123,,"Blockchain-Enabled Smart Contracts: Architecture, Applications, and Future Trends",IEEE Transactions on Systems Man and Cybernetics Systems,2019,article,blockchain,2,136.0,314.0,128.1696245182433,1157,157.1419,True,False,baseline,128.1696245182433,landmark,True | 694 | +2965761488,10.1016/j.tifs.2019.07.034,1908.07391,The rise of blockchain technology in agriculture and food supply chains,Trends in Food Science & Technology,2019,article,blockchain,2,102.0,285.0,116.33230250859661,1261,154.3302,True,True,baseline,theriseofblockchaintechnologyinagricultureandfoodsupplychains,116.33230250859661,landmark,True | ||
| 695 | −2973816953,10.7551/mitpress/11645.003.0010,,How Blockchain Will Change Organizations,The MIT Press eBooks,2018,book-chapter,blockchain,1,55.0,109.0,128.09387022313413,375,138.4143,True,False,baseline,128.09387022313413,landmark,True | 695 | +6906013109,10.15495/epub_ubt_00007183,,Blockchain Adoption in Organizations : Technical Barriers and Potential Solutions,EPub Bayreuth (University of Bayreuth),2023,dissertation,blockchain,5,3.0,4.0,115.45945945945945,5,,True,True,post,blockchainadoptioninorganizationstechnicalbarriersandpotentialsolutions,115.45945945945945,landmark,True | ||
| 696 | −3123722958,10.1002/isaf.1424,,Toward an ontology‐driven blockchain design for supply‐chain provenance,"Intelligent systems in accounting, finance and management/Intelligent systems in accounting, finance & management",2018,article,blockchain,2,122.0,233.0,123.53592218997065,651,132.5698,True,False,baseline,123.53592218997065,landmark,True | 696 | +4386476569,10.11606/d.55.2023.tde-06092023-102200,,Blockchain-based data governance for privacy-preserving in multi-stakeholder settings,,2023,dissertation,blockchain,3,3.0,4.0,115.45945945945945,4,,True,False,post,blockchainbaseddatagovernanceforprivacypreservinginmultistakeholdersettings,115.45945945945945,landmark,True | ||
| 697 | −2800028583,10.1016/bs.adcom.2018.03.006,,Blockchain Technology Use Cases in Healthcare,Advances in computers,2018,book-chapter,blockchain,1,42.0,100.0,117.51731213131572,434,154.6983,False,False,baseline,117.51731213131572,landmark,True | 697 | +2803836845,10.1016/j.joule.2018.04.016,,Bitcoin's Growing Energy Problem,Joule,2018,article,blockchain,1,119.0,217.0,115.05276873486537,687,112.4835,False,True,baseline,bitcoinsgrowingenergyproblem,115.05276873486537,landmark,True | ||
| 698 | −7160824505,10.55124/ijbs.v1i1.103,,Evaluation of Artificial Intelligence and Blockchain Integration Utilizing the DEM ATEL Method to Improve Privacy and Transparent in the Financial Sector,International Journal of Blockchain and Secure Systems,2026,article,blockchain,3,33.0,33.0,234.44990266060998,33,302.0434,True,True,post,117.32227911769351,landmark,True | 698 | +2927344969,10.2139/ssrn.6433340,,Global Blockchain Benchmarking Study,SSRN Electronic Journal,2026,preprint,blockchain,1,45.0,45.0,1480.9248554913295,45,,False,True,post,globalblockchainbenchmarkingstudy,114.09616854859023,landmark,True | ||
| 699 | −2784387076,10.1017/s1744137417000200,,Blockchains and the economic institutions of capitalism,Journal of Institutional Economics,2018,article,blockchain,4,143.0,220.0,116.64336000769761,577,110.4748,True,True,baseline,116.64336000769761,landmark,True | 699 | +2909202584,10.1109/tii.2019.2893433,,Privacy-Preserving Energy Trading Using Consortium Blockchain in Smart Grid,IEEE Transactions on Industrial Informatics,2019,article,blockchain,3,163.0,274.0,111.84228381528236,573,115.279,True,False,baseline,privacypreservingenergytradingusingconsortiumblockchaininsmartgrid,111.84228381528236,landmark,True | ||
| 700 | −4380356557,10.4018/978-1-6684-5422-0.ch012,,Blockchain Technology in Renovating Healthcare,Advances in healthcare information systems and administration book series,2023,book-chapter,blockchain,2,139.0,169.0,116.33373815885354,171,116.723,True,False,post,116.33373815885354,landmark,True | 700 | +3163490558,10.15760/etd.7527,,Assessment of the Blockchain Technology Adoption for the Management of the Electronic Health Record Systems,,2021,dissertation,blockchain,3,4.0,10.0,110.32663316582915,20,,True,True,baseline,assessmentoftheblockchaintechnologyadoptionforthemanagementoftheelectronichealthrecordsystems,110.32663316582915,landmark,True | ||
| 701 | −2965761488,10.1016/j.tifs.2019.07.034,1908.07391,The rise of blockchain technology in agriculture and food supply chains,Trends in Food Science & Technology,2019,article,blockchain,2,102.0,285.0,116.33230250859661,1261,154.3302,True,True,baseline,116.33230250859661,landmark,True | 701 | +2783535300,10.3390/logistics2010002,,The Supply Chain Has No Clothes: Technology Adoption of Blockchain for Supply Chain Transparency,Logistics,2018,article,blockchain,2,82.0,208.0,110.28099491636864,951,138.9974,True,True,baseline,thesupplychainhasnoclothestechnologyadoptionofblockchainforsupplychaintransparency,110.28099491636864,landmark,True | ||
| 702 | −2187800381,10.48456/tr-579,,Practical lock-freedom,OpenGrey (Institut de l'Information Scientifique et Technique),2021,dissertation,computer_architecture,5,281.0,286.0,994.2153284671533,458,,True,True,baseline,994.2153284671533,landmark,True | 702 | +3099878876,,,Array programming with NumPy,RePEc: Research Papers in Economics,2020,article,computer_architecture,4,2343.0,5512.0,689.4179496808111,17096,889.1394,True,True,baseline,arrayprogrammingwithnumpy,689.4179496808111,landmark,True | ||
| 703 | −3099878876,,,Array programming with NumPy,RePEc: Research Papers in Economics,2020,article,computer_architecture,4,2343.0,5512.0,689.4179496808111,17096,889.1394,True,True,baseline,689.4179496808111,landmark,True | 703 | +3046751266,10.1063/5.0014475,,Scalable molecular dynamics on CPU and GPU architectures with NAMD,The Journal of Chemical Physics,2020,article,computer_architecture,7,356.0,869.0,214.60681995758455,3144,304.3728,True,True,baseline,scalablemoleculardynamicsoncpuandgpuarchitectureswithnamd,214.60681995758455,landmark,True | ||
| 704 | −4287393709,10.4230/lipics.ecrts.2026.17,,Uncertainty-Aware Resource Allocation for Multi-Path Programs with In-Kernel Predictions,DROPS (Schloss Dagstuhl – Leibniz Center for Informatics),2026,article,computer_architecture,3,71.0,71.0,330.9365269461078,71,0.0,True,True,post,252.42066113200724,landmark,True | 704 | +4394998532,10.1145/3620665.3640366,,PyTorch 2: Faster Machine Learning Through Dynamic Python Bytecode Transformation and Graph Compilation,ACM International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS),2024,conference-paper,computer_architecture,6,434.0,690.0,204.38576349024112,690,218.9123,True,False,post,pytorch2fastermachinelearningthroughdynamicpythonbytecodetransformationandgraphcompilation,204.38576349024112,landmark,True | ||
| 705 | −3046751266,10.1063/5.0014475,,Scalable molecular dynamics on CPU and GPU architectures with NAMD,The Journal of Chemical Physics,2020,article,computer_architecture,7,356.0,869.0,214.60681995758455,3144,304.3728,True,True,baseline,214.60681995758455,landmark,True | 705 | +4287393709,10.4230/lipics.ecrts.2026.17,,Uncertainty-Aware Resource Allocation for Multi-Path Programs with In-Kernel Predictions,DROPS (Schloss Dagstuhl – Leibniz Center for Informatics),2026,article,computer_architecture,3,71.0,71.0,330.9365269461078,71,0.0,True,True,post,uncertaintyawareresourceallocationformultipathprogramswithinkernelpredictions,180.01839926555348,landmark,True | ||
| 706 | −4394998532,10.1145/3620665.3640366,,PyTorch 2: Faster Machine Learning Through Dynamic Python Bytecode Transformation and Graph Compilation,ACM International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS),2024,conference-paper,computer_architecture,6,434.0,690.0,204.38576349024112,690,218.9123,True,False,post,204.38576349024112,landmark,True | 706 | +4297813615,10.4230/lipics.ecrts.2024.13,,DeepTrust^RT: Confidential Deep Neural Inference Meets Real-Time!,DROPS (Schloss Dagstuhl – Leibniz Center for Informatics),2024,article,computer_architecture,5,674.0,707.0,157.60297582979868,708,51.0217,True,True,post,deeptrustrtconfidentialdeepneuralinferencemeetsrealtime,157.60297582979868,landmark,True | ||
| 707 | −4297813615,10.4230/lipics.ecrts.2024.13,,DeepTrust^RT: Confidential Deep Neural Inference Meets Real-Time!,DROPS (Schloss Dagstuhl – Leibniz Center for Informatics),2024,article,computer_architecture,5,674.0,707.0,157.60297582979868,708,51.0217,True,True,post,157.60297582979868,landmark,True | 707 | +3111721177,10.1007/978-981-16-7487-7_7,,A Modern Primer on Processing in Memory,Computer architecture and design methodologies,2022,book-chapter,computer_architecture,2,90.0,125.0,139.4308943089431,168,112.4027,False,False,baseline,amodernprimeronprocessinginmemory,139.4308943089431,landmark,True | ||
| 708 | −3111721177,10.1007/978-981-16-7487-7_7,,A Modern Primer on Processing in Memory,Computer architecture and design methodologies,2022,book-chapter,computer_architecture,2,90.0,125.0,139.4308943089431,168,112.4027,False,False,baseline,139.4308943089431,landmark,True | 708 | +2273211146,10.17615/nyex-d314,,The multiprocessor real-time scheduling of general task systems,Carolina Digital Repository (University of North Carolina at Chapel Hill),2019,dissertation,computer_architecture,4,19.0,20.0,137.14285714285714,37,,True,True,baseline,themultiprocessorrealtimeschedulingofgeneraltasksystems,137.14285714285714,landmark,True | ||
| 709 | −2273211146,10.17615/nyex-d314,,The multiprocessor real-time scheduling of general task systems,Carolina Digital Repository (University of North Carolina at Chapel Hill),2019,dissertation,computer_architecture,4,19.0,20.0,137.14285714285714,37,,True,True,baseline,137.14285714285714,landmark,True | 709 | +4286840061,10.7302/4622,,Algorithm-Architecture Co-Design for Domain-Specific Accelerators in Communication and Artificial Intelligence,Deep Blue (University of Michigan),2022,dissertation,computer_architecture,5,3.0,14.0,105.75490196078431,14,,True,True,baseline,algorithmarchitecturecodesignfordomainspecificacceleratorsincommunicationandartificialintelligence,105.75490196078431,landmark,True | ||
| 710 | −4406650295,10.1145/3714983.3714987,,AWQ: Activation-aware Weight Quantization for On-Device LLM Compression and Acceleration,GetMobile Mobile Computing and Communications,2025,article,computer_architecture,9,234.0,234.0,76.51490775873349,234,83.4275,True,False,post,118.46457204078958,landmark,True | 710 | +3016932526,10.1063/5.0005082,,Q uantum ESPRESSO toward the exascale,The Journal of Chemical Physics,2020,article,computer_architecture,4,175.0,425.0,104.9573055028463,2032,159.393,True,True,baseline,quantumespressotowardtheexascale,104.9573055028463,landmark,True | ||
| 711 | −4286840061,10.7302/4622,,Algorithm-Architecture Co-Design for Domain-Specific Accelerators in Communication and Artificial Intelligence,Deep Blue (University of Michigan),2022,dissertation,computer_architecture,5,3.0,14.0,105.75490196078431,14,,True,True,baseline,105.75490196078431,landmark,True | 711 | +4406650295,10.1145/3714983.3714987,,AWQ: Activation-aware Weight Quantization for On-Device LLM Compression and Acceleration,GetMobile Mobile Computing and Communications,2025,article,computer_architecture,9,234.0,234.0,76.51490775873349,234,83.4275,True,False,post,awqactivationawareweightquantizationforondevicellmcompressionandacceleration,102.2513468321514,landmark,True | ||
| 712 | −3016932526,10.1063/5.0005082,,Q uantum ESPRESSO toward the exascale,The Journal of Chemical Physics,2020,article,computer_architecture,4,175.0,425.0,104.9573055028463,2032,159.393,True,True,baseline,104.9573055028463,landmark,True | 712 | +4401211704,10.1109/isca59077.2024.00019,,Splitwise: Efficient Generative LLM Inference Using Phase Splitting,ACM/IEEE International Symposium on Computer Architecture (ISCA),2024,conference-paper,computer_architecture,6,125.0,292.0,86.49368541905856,286,90.7376,True,False,post,splitwiseefficientgenerativellminferenceusingphasesplitting,86.49368541905856,landmark,True | ||
| 713 | −4401211704,10.1109/isca59077.2024.00019,,Splitwise: Efficient Generative LLM Inference Using Phase Splitting,ACM/IEEE International Symposium on Computer Architecture (ISCA),2024,conference-paper,computer_architecture,6,125.0,292.0,86.49368541905856,286,90.7376,True,False,post,86.49368541905856,landmark,True | 713 | +5673758,10.7275/4018988,,A Novel Reconfiguration Scheme in Quantum-Dot Cellular Automata for Energy Efficient Nanocomputing,ScholarWorks@UMassAmherst (University of Massachusetts Amherst),2023,dissertation,computer_architecture,4,4.0,4.0,86.3030303030303,4,,True,True,post,anovelreconfigurationschemeinquantumdotcellularautomataforenergyefficientnanocomputing,86.3030303030303,landmark,True | ||
| 714 | −5673758,10.7275/4018988,,A Novel Reconfiguration Scheme in Quantum-Dot Cellular Automata for Energy Efficient Nanocomputing,ScholarWorks@UMassAmherst (University of Massachusetts Amherst),2023,dissertation,computer_architecture,4,4.0,4.0,86.3030303030303,4,,True,True,post,86.3030303030303,landmark,True | 714 | +6922095860,10.1184/r1/14642340,,Practical Mechanisms for Reducing Processor–Memory Data Movement in Modern Workloads,Figshare,2021,dissertation,computer_architecture,9,9.0,11.0,81.43283582089553,11,,True,True,baseline,practicalmechanismsforreducingprocessormemorydatamovementinmodernworkloads,81.43283582089553,landmark,True | ||
| 715 | −6922095860,10.1184/r1/14642340,,Practical Mechanisms for Reducing Processor–Memory Data Movement in Modern Workloads,Figshare,2021,dissertation,computer_architecture,9,9.0,11.0,81.43283582089553,11,,True,True,baseline,81.43283582089553,landmark,True | 715 | +4386978266,10.7302/8543,,Accelerated Systems for Portable DNA Sequencing,Deep Blue (University of Michigan),2023,dissertation,computer_architecture,5,11.0,11.0,75.89999999999999,11,,True,True,post,acceleratedsystemsforportablednasequencing,75.89999999999999,landmark,True | ||
| 716 | −7135078329,10.1109/tvlsi.2026.3670888,,Highly Reliable RRAM-Based Physical Unclonable Function With Auto-Write Technique,IEEE Transactions on Very Large Scale Integration (VLSI) Systems,2026,article,computer_architecture,5,22.0,22.0,102.5437125748503,22,154.5718,True,False,post,78.21485274512901,landmark,True | 716 | +4393145114,10.1109/mm.2024.3373763,2403.14123,AI and Memory Wall,IEEE Micro,2024,article,computer_architecture,8,201.0,336.0,74.90042415673601,336,105.8227,True,True,post,aiandmemorywall,74.90042415673601,landmark,True | ||
| 717 | −4386978266,10.7302/8543,,Accelerated Systems for Portable DNA Sequencing,Deep Blue (University of Michigan),2023,dissertation,computer_architecture,5,11.0,11.0,75.89999999999999,11,,True,True,post,75.89999999999999,landmark,True | 717 | +1224547023,10.1201/9781315218823-12,,Model-Based Framework for Schedulability Analysis Using Uppaal 4.1,CRC Press eBooks,2018,book-chapter,computer_architecture,3,51.0,52.0,74.46337817638266,70,17.8443,True,True,baseline,modelbasedframeworkforschedulabilityanalysisusinguppaal41,74.46337817638266,landmark,True | ||
| 718 | −4393145114,10.1109/mm.2024.3373763,2403.14123,AI and Memory Wall,IEEE Micro,2024,article,computer_architecture,8,201.0,336.0,74.90042415673601,336,105.8227,True,True,post,74.90042415673601,landmark,True | 718 | +2972087877,10.1145/3320060,,Demystifying Parallel and Distributed Deep Learning,ACM Computing Surveys,2019,article,computer_architecture,6,159.0,263.0,74.14530533429881,577,81.2716,True,False,baseline,demystifyingparallelanddistributeddeeplearning,74.14530533429881,landmark,True | ||
| 719 | −1224547023,10.1201/9781315218823-12,,Model-Based Framework for Schedulability Analysis Using Uppaal 4.1,CRC Press eBooks,2018,book-chapter,computer_architecture,3,51.0,52.0,74.46337817638266,70,17.8443,True,True,baseline,74.46337817638266,landmark,True | 719 | +2952332632,10.4230/oasics.asd.2020.1,,Towards a Reliable and Context-Based System Architecture for Autonomous Vehicles,OASIcs : OpenAccess Series in Informatics,2020,conference-paper,computer_architecture,3,395.0,516.0,73.13244814646819,797,52.3105,True,True,baseline,towardsareliableandcontextbasedsystemarchitectureforautonomousvehicles,73.13244814646819,landmark,True | ||
| 720 | −2972087877,10.1145/3320060,,Demystifying Parallel and Distributed Deep Learning,ACM Computing Surveys,2019,article,computer_architecture,6,159.0,263.0,74.14530533429881,577,81.2716,True,False,baseline,74.14530533429881,landmark,True | 720 | +2921153466,10.48550/arxiv.1903.05714,1903.05714,Basic Performance Measurements of the Intel Optane DC Persistent Memory Module,arXiv (Cornell University),2019,preprint,computer_architecture,6,108.0,175.0,71.88172043010752,191,,True,True,baseline,basicperformancemeasurementsoftheinteloptanedcpersistentmemorymodule,71.88172043010752,landmark,True | ||
| 721 | −2952332632,10.4230/oasics.asd.2020.1,,Towards a Reliable and Context-Based System Architecture for Autonomous Vehicles,OASIcs : OpenAccess Series in Informatics,2020,conference-paper,computer_architecture,3,395.0,516.0,73.13244814646819,797,52.3105,True,True,baseline,73.13244814646819,landmark,True | 721 | +4403931219,10.17487/rfc9669,,BPF Instruction Set Architecture (ISA),,2024,report,computer_architecture,4,4.0,9.0,66.0,9,,False,False,post,bpfinstructionsetarchitectureisa,66.0,landmark,True | ||
| 722 | −4410153295,10.1109/tcad.2025.3567878,,Bursting Firings in Memristive Hopfield Neural Network With Image Encryption and Hardware Implementation,IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems,2025,article,computer_architecture,4,142.0,142.0,32.564312668463614,142,32.3565,True,False,post,71.88875739227402,landmark,True | 722 | +2931743911,10.1109/hpca.2019.00048,,Machine Learning at Facebook: Understanding Inference at the Edge,Proceedings - International Symposium on High-Performance Computer Architecture/Proceedings,2019,conference-paper,computer_architecture,7,108.0,212.0,64.45974888151248,439,66.0809,True,False,baseline,machinelearningatfacebookunderstandinginferenceattheedge,64.45974888151248,landmark,True | ||
| 723 | −2921153466,10.48550/arxiv.1903.05714,1903.05714,Basic Performance Measurements of the Intel Optane DC Persistent Memory Module,arXiv (Cornell University),2019,preprint,computer_architecture,6,108.0,175.0,71.88172043010752,191,,True,True,baseline,71.88172043010752,landmark,True | 723 | +1983572666,10.1016/c2011-0-06993-4,,The Art of Multiprocessor Programming,Elsevier eBooks,2020,book,computer_architecture,2,852.0,864.0,63.65562913907285,1093,24.414,False,False,baseline,theartofmultiprocessorprogramming,63.65562913907285,landmark,True | ||
| 724 | −3014555390,10.4230/lipics.ecrts.2026.13,,CacheFlow: Using Maximum Flow to Bound Cache-Based Preemption Delays,Leibniz international proceedings in informatics,2026,conference-paper,computer_architecture,2,19.0,19.0,147.2590476190476,19,17.7143,True,True,post,67.54919100715686,landmark,True | 724 | +75685577,10.7275/2207079,,Electromagnetic Side-Channel Analysis for Hardware and Software Watermarking,Scholarworks (University of Massachusetts Amherst),2023,dissertation,computer_architecture,3,9.0,9.0,62.099999999999994,9,,True,True,post,electromagneticsidechannelanalysisforhardwareandsoftwarewatermarking,62.099999999999994,landmark,True | ||
| 725 | −4409568286,10.1145/3729215,2306.15552,A Survey on Deep Learning Hardware Accelerators for Heterogeneous HPC Platforms,ACM Computing Surveys,2025,article,computer_architecture,7,133.0,133.0,76.14302694136292,133,81.5626,True,True,post,67.3324276983975,landmark,True | 725 | +4410153295,10.1109/tcad.2025.3567878,,Bursting Firings in Memristive Hopfield Neural Network With Image Encryption and Hardware Implementation,IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems,2025,article,computer_architecture,4,142.0,142.0,32.564312668463614,142,32.3565,True,False,post,burstingfiringsinmemristivehopfieldneuralnetworkwithimageencryptionandhardwareimplementation,62.04996260754486,landmark,True | ||
| 726 | −4403931219,10.17487/rfc9669,,BPF Instruction Set Architecture (ISA),,2024,report,computer_architecture,4,4.0,9.0,66.0,9,,False,False,post,66.0,landmark,True | 726 | +4380874786,10.1145/3579371.3589350,2304.01433,TPU v4: An Optically Reconfigurable Supercomputer for Machine Learning with Hardware Support for Embeddings,Proceedings - International Symposium on Computer Architecture/Proceedings,2023,conference-paper,computer_architecture,10,167.0,388.0,61.6547248352945,508,94.1928,True,True,post,tpuv4anopticallyreconfigurablesupercomputerformachinelearningwithhardwaresupportforembeddings,61.6547248352945,landmark,True | ||
| 727 | −2156094048,10.1145/3501714.3501727,,Reverend Bayes on Inference Engines: A Distributed Hierarchical Approach,ACM eBooks,2022,book-chapter,ai_accelerators,2,495.0,513.0,274.919235405545,727,46.4544,True,False,baseline,274.919235405545,landmark,True | 727 | +2156094048,10.1145/3501714.3501727,,Reverend Bayes on Inference Engines: A Distributed Hierarchical Approach,ACM eBooks,2022,book-chapter,ai_accelerators,2,495.0,513.0,274.919235405545,727,46.4544,True,False,baseline,reverendbayesoninferenceenginesadistributedhierarchicalapproach,274.919235405545,landmark,True | ||
| 728 | −7130682590,10.1016/j.vlsi.2026.102688,,Extreme multistability in discrete memristive neuron maps and implications for dual-field applications,Integration,2026,article,ai_accelerators,2,37.0,37.0,38.12608695652174,37,127.1161,False,False,post,131.54316143498968,landmark,True | 728 | +3003967059,10.1038/s41586-020-03070-1,2002.00281,Parallel convolutional processing using an integrated photonic tensor core,Nature,2021,article,ai_accelerators,2,503.0,830.0,96.73020860110631,1874,105.2419,False,True,baseline,parallelconvolutionalprocessingusinganintegratedphotonictensorcore,96.73020860110631,landmark,True | ||
| 729 | −3003967059,10.1038/s41586-020-03070-1,2002.00281,Parallel convolutional processing using an integrated photonic tensor core,Nature,2021,article,ai_accelerators,2,503.0,830.0,96.73020860110631,1874,105.2419,False,True,baseline,96.73020860110631,landmark,True | 729 | +7130682590,10.1016/j.vlsi.2026.102688,,Extreme multistability in discrete memristive neuron maps and implications for dual-field applications,Integration,2026,article,ai_accelerators,2,37.0,37.0,38.12608695652174,37,127.1161,False,False,post,extrememultistabilityindiscretememristiveneuronmapsandimplicationsfordualfieldapplications,93.81240525106308,landmark,True | ||
| 730 | −7131231908,10.1109/tcyb.2026.3664460,,Reconfigurable Multiscroll Memristive Neural Network With Application to Telemedicine Privacy Protection,IEEE Transactions on Cybernetics,2026,article,ai_accelerators,5,25.0,25.0,67.00916730328495,25,77.9076,True,False,post,88.88051448310114,landmark,True | 730 | +4409283612,10.1038/s41586-025-08854-x,,Universal photonic artificial intelligence acceleration,Nature,2025,article,ai_accelerators,1,165.0,165.0,56.20713647719771,165,68.6604,False,False,post,universalphotonicartificialintelligenceacceleration,72.1003086636965,landmark,True | ||
| 731 | −7134974875,10.1109/icears67481.2026.11416637,,Neuromorphic Photonic Computing using Microring Resonator Arrays for Real-Time Edge AI Processing,International Conference on Electronics and Renewable Systems (ICEARS),2026,conference-paper,ai_accelerators,3,24.0,24.0,184.20139553974553,24,221.8777,False,False,post,85.3252939037771,landmark,True | 731 | +2783525259,10.1109/mm.2018.112130359,,Loihi: A Neuromorphic Manycore Processor with On-Chip Learning,IEEE Micro,2018,article,ai_accelerators,4,327.0,745.0,64.97395387432005,3897,115.1562,True,False,baseline,loihianeuromorphicmanycoreprocessorwithonchiplearning,64.97395387432005,landmark,True | ||
| 732 | −7135102590,10.1109/tii.2026.3668794,,Biologically Plausible Memristive Decision-Making Circuit for Adaptive Control in Industrial Autonomous Navigation,IEEE Transactions on Industrial Informatics,2026,article,ai_accelerators,2,24.0,24.0,35.86027014438752,24,41.1527,True,False,post,85.3252939037771,landmark,True | 732 | +7131231908,10.1109/tcyb.2026.3664460,,Reconfigurable Multiscroll Memristive Neural Network With Application to Telemedicine Privacy Protection,IEEE Transactions on Cybernetics,2026,article,ai_accelerators,5,25.0,25.0,67.00916730328495,25,77.9076,True,False,post,reconfigurablemultiscrollmemristiveneuralnetworkwithapplicationtotelemedicineprivacyprotection,63.38676030477235,landmark,True | ||
| 733 | −4409283612,10.1038/s41586-025-08854-x,,Universal photonic artificial intelligence acceleration,Nature,2025,article,ai_accelerators,1,165.0,165.0,56.20713647719771,165,68.6604,False,False,post,83.53271105440291,landmark,True | 733 | +7135102590,10.1109/tii.2026.3668794,,Biologically Plausible Memristive Decision-Making Circuit for Adaptive Control in Industrial Autonomous Navigation,IEEE Transactions on Industrial Informatics,2026,article,ai_accelerators,2,24.0,24.0,35.86027014438752,24,41.1527,True,False,post,biologicallyplausiblememristivedecisionmakingcircuitforadaptivecontrolinindustrialautonomousnavigation,60.851289892581455,landmark,True | ||
| 734 | −7128511721,10.1109/tce.2026.3663359,,A Memristor-Based Neural Network Circuit With Classical Conditioning and Fear Generalization,IEEE Transactions on Consumer Electronics,2026,article,ai_accelerators,3,23.0,23.0,34.366092221704704,23,39.438,True,False,post,81.77007332445305,landmark,True | 734 | +7134974875,10.1109/icears67481.2026.11416637,,Neuromorphic Photonic Computing using Microring Resonator Arrays for Real-Time Edge AI Processing,International Conference on Electronics and Renewable Systems (ICEARS),2026,conference-paper,ai_accelerators,3,24.0,24.0,184.20139553974553,24,221.8777,False,False,post,neuromorphicphotoniccomputingusingmicroringresonatorarraysforrealtimeedgeaiprocessing,60.851289892581455,landmark,True | ||
| 735 | −2783525259,10.1109/mm.2018.112130359,,Loihi: A Neuromorphic Manycore Processor with On-Chip Learning,IEEE Micro,2018,article,ai_accelerators,4,327.0,745.0,64.97395387432005,3897,115.1562,True,False,baseline,64.97395387432005,landmark,True | 735 | +2944119451,10.1038/s41586-019-1157-8,2102.09360,All-optical spiking neurosynaptic networks with self-learning capabilities,Nature,2019,article,ai_accelerators,3,162.0,384.0,58.38929375910958,1529,75.8628,False,True,baseline,allopticalspikingneurosynapticnetworkswithselflearningcapabilities,58.38929375910958,landmark,True | ||
| 736 | −2944119451,10.1038/s41586-019-1157-8,2102.09360,All-optical spiking neurosynaptic networks with self-learning capabilities,Nature,2019,article,ai_accelerators,3,162.0,384.0,58.38929375910958,1529,75.8628,False,True,baseline,58.38929375910958,landmark,True | 736 | +7128511721,10.1109/tce.2026.3663359,,A Memristor-Based Neural Network Circuit With Classical Conditioning and Fear Generalization,IEEE Transactions on Consumer Electronics,2026,article,ai_accelerators,3,23.0,23.0,34.366092221704704,23,39.438,True,False,post,amemristorbasedneuralnetworkcircuitwithclassicalconditioningandfeargeneralization,58.315819480390566,landmark,True | ||
| 737 | −7141052859,10.1016/j.vlsi.2026.102731,,A dual-neuron second-order memristor-based Hopfield neural network with controllable extreme multistability and its application in image encryption,Integration,2026,article,ai_accelerators,4,15.0,15.0,40.20550038197097,15,46.7446,False,False,post,53.328308689860684,landmark,True | 737 | +4210357113,10.1038/s43588-021-00184-y,,Opportunities for neuromorphic computing algorithms and applications,Nature Computational Science,2022,article,ai_accelerators,2,224.0,537.0,42.17948197363679,1107,60.0929,False,True,baseline,opportunitiesforneuromorphiccomputingalgorithmsandapplications,42.17948197363679,landmark,True | ||
| 738 | −7149961640,10.1016/j.neunet.2026.108953,,A discrete memristive cyclic Hopfield neural network with multi-cavity-like attractors and application in secure communication,Neural Networks,2026,article,ai_accelerators,3,14.0,14.0,14.426086956521738,14,48.098,False,False,post,49.77308811053664,landmark,True | 738 | +4394727812,10.1126/science.adl1203,,Large-scale photonic chiplet Taichi empowers 160-TOPS/W artificial general intelligence,Science,2024,article,ai_accelerators,4,198.0,308.0,38.256050750798984,308,45.8367,True,False,post,largescalephotonicchiplettaichiempowers160topswartificialgeneralintelligence,38.256050750798984,landmark,True | ||
| 739 | −7140216027,10.1016/j.neunet.2026.108887,,Discrete bidirectional memristive neural network-based hyperchaotic system and its FPGA implementation,Neural Networks,2026,article,ai_accelerators,3,13.0,13.0,13.395652173913042,13,44.6624,False,False,post,46.2178675312126,landmark,True | 739 | +7141052859,10.1016/j.vlsi.2026.102731,,A dual-neuron second-order memristor-based Hopfield neural network with controllable extreme multistability and its application in image encryption,Integration,2026,article,ai_accelerators,4,15.0,15.0,40.20550038197097,15,46.7446,False,False,post,adualneuronsecondordermemristorbasedhopfieldneuralnetworkwithcontrollableextrememultistabilityanditsapplicationinimageencryption,38.03205618286341,landmark,True | ||
| 740 | −7130433466,10.1109/tcsi.2026.3663432,,A Second-Order Memristor Method to Construct Memristive Neural Networks With Multi-Butterfly and Multi-Scroll Dynamics,IEEE Transactions on Circuits and Systems I Regular Papers,2026,article,ai_accelerators,4,12.0,12.0,17.93013507219376,12,20.5764,True,False,post,42.66264695188855,landmark,True | 740 | +7149961640,10.1016/j.neunet.2026.108953,,A discrete memristive cyclic Hopfield neural network with multi-cavity-like attractors and application in secure communication,Neural Networks,2026,article,ai_accelerators,3,14.0,14.0,14.426086956521738,14,48.098,False,False,post,adiscretememristivecyclichopfieldneuralnetworkwithmulticavitylikeattractorsandapplicationinsecurecommunication,35.49658577067252,landmark,True | ||
| 741 | −7130516837,10.1142/s0218127426500914,,Gaussian-Function-Driven Chaotic Memristive Dynamics with Application to Image Encryption,International Journal of Bifurcation and Chaos,2026,article,ai_accelerators,3,12.0,12.0,32.16440030557678,12,37.3956,True,False,post,42.66264695188855,landmark,True | 741 | +4409363528,10.1186/s43593-025-00085-x,,Intelligent nanophotonics: when machine learning sheds light,eLight,2025,article,ai_accelerators,5,77.0,77.0,26.229997022692263,77,32.0415,True,True,post,intelligentnanophotonicswhenmachinelearningshedslight,33.64681070972503,landmark,True | ||
| 742 | −4210357113,10.1038/s43588-021-00184-y,,Opportunities for neuromorphic computing algorithms and applications,Nature Computational Science,2022,article,ai_accelerators,2,224.0,537.0,42.17948197363679,1107,60.0929,False,True,baseline,42.17948197363679,landmark,True | 742 | +7140216027,10.1016/j.neunet.2026.108887,,Discrete bidirectional memristive neural network-based hyperchaotic system and its FPGA implementation,Neural Networks,2026,article,ai_accelerators,3,13.0,13.0,13.395652173913042,13,44.6624,False,False,post,discretebidirectionalmemristiveneuralnetworkbasedhyperchaoticsystemanditsfpgaimplementation,32.96111535848162,landmark,True | ||
| 743 | −4417057079,10.1038/s41467-026-68452-x,,Single-shot matrix-matrix photonic processor based on spatial-spectral hypermultiplexed parallel diffraction,Nature Communications,2026,article,ai_accelerators,8,11.0,11.0,12.24081685075777,11,39.7388,True,True,post,39.107426372564504,landmark,True | 743 | +4402694963,10.1038/s41377-024-01590-3,,Optical neural networks: progress and challenges,Light Science & Applications,2024,article,ai_accelerators,4,135.0,263.0,32.666692686558875,263,39.1398,True,True,post,opticalneuralnetworksprogressandchallenges,32.666692686558875,landmark,True | ||
| 744 | −4409363528,10.1186/s43593-025-00085-x,,Intelligent nanophotonics: when machine learning sheds light,eLight,2025,article,ai_accelerators,5,77.0,77.0,26.229997022692263,77,32.0415,True,True,post,38.981931825388024,landmark,True | 744 | +4210305137,10.1038/s41377-022-00717-8,,Photonic matrix multiplication lights up photonic accelerator and beyond,Light Science & Applications,2022,article,ai_accelerators,3,161.0,306.0,31.53012133083438,563,38.2097,True,True,baseline,photonicmatrixmultiplicationlightsupphotonicacceleratorandbeyond,31.53012133083438,landmark,True | ||
| 745 | −4394727812,10.1126/science.adl1203,,Large-scale photonic chiplet Taichi empowers 160-TOPS/W artificial general intelligence,Science,2024,article,ai_accelerators,4,198.0,308.0,38.256050750798984,308,45.8367,True,False,post,38.256050750798984,landmark,True | 745 | +4414574650,10.1016/j.chaos.2025.117292,,Field and delay effects on synchronization in a multilayer memristive neuronal network with a hub,Chaos Solitons & Fractals,2025,article,ai_accelerators,1,71.0,71.0,27.006304798493694,71,31.2974,False,False,post,fieldanddelayeffectsonsynchronizationinamultilayermemristiveneuronalnetworkwithahub,31.02498130377243,landmark,True | ||
| 746 | −4414574650,10.1016/j.chaos.2025.117292,,Field and delay effects on synchronization in a multilayer memristive neuronal network with a hub,Chaos Solitons & Fractals,2025,article,ai_accelerators,1,71.0,71.0,27.006304798493694,71,31.2974,False,False,post,35.94437869613701,landmark,True | 746 | +2799210008,10.48550/arxiv.1804.09848,1804.09848,Memristor Crossbars with 4.5 Terabits-per-Inch-Square Density and Two Nanometer Dimension,arXiv (Cornell University),2018,preprint,ai_accelerators,2,38.0,109.0,30.82828282828283,154,,True,True,baseline,memristorcrossbarswith45terabitsperinchsquaredensityandtwonanometerdimension,30.82828282828283,landmark,True | ||
| 747 | −7129076810,10.1109/jiot.2026.3665333,,Dual Memristor-Coupled Unidirectional Ring Neural Network: Abundant Hidden Firings and Application in Hardware Image Encryption,IEEE Internet of Things Journal,2026,article,ai_accelerators,7,10.0,10.0,14.941779226828132,10,17.147,True,False,post,35.552205793240454,landmark,True | 747 | +7130433466,10.1109/tcsi.2026.3663432,,A Second-Order Memristor Method to Construct Memristive Neural Networks With Multi-Butterfly and Multi-Scroll Dynamics,IEEE Transactions on Circuits and Systems I Regular Papers,2026,article,ai_accelerators,4,12.0,12.0,17.93013507219376,12,20.5764,True,False,post,asecondordermemristormethodtoconstructmemristiveneuralnetworkswithmultibutterflyandmultiscrolldynamics,30.425644946290728,landmark,True | ||
| 748 | −7128293306,10.1038/s41467-026-69084-x,,Neuromorphic photonic computing with an electro-optic analog memory,Nature Communications,2026,article,ai_accelerators,3,10.0,10.0,11.1280153188707,9,32.5136,True,True,post,35.552205793240454,landmark,True | 748 | +7130516837,10.1142/s0218127426500914,,Gaussian-Function-Driven Chaotic Memristive Dynamics with Application to Image Encryption,International Journal of Bifurcation and Chaos,2026,article,ai_accelerators,3,12.0,12.0,32.16440030557678,12,37.3956,True,False,post,gaussianfunctiondrivenchaoticmemristivedynamicswithapplicationtoimageencryption,30.425644946290728,landmark,True | ||
| 749 | −4413052649,10.1016/j.vlsi.2025.102500,,An attractor-controllable memristive Hopfield neural network and its application on voice encryption,Integration,2025,article,ai_accelerators,4,66.0,66.0,14.175875486381322,66,28.5628,False,False,post,33.41308442176116,landmark,True | 749 | +3121141908,10.1038/s41467-020-20719-7,,An optical neural chip for implementing complex-valued neural network,Nature Communications,2021,article,ai_accelerators,4,124.0,260.0,30.301029200346555,666,36.6979,True,True,baseline,anopticalneuralchipforimplementingcomplexvaluedneuralnetwork,30.301029200346555,landmark,True | ||
| 750 | −4402694963,10.1038/s41377-024-01590-3,,Optical neural networks: progress and challenges,Light Science & Applications,2024,article,ai_accelerators,4,135.0,263.0,32.666692686558875,263,39.1398,True,True,post,32.666692686558875,landmark,True | 750 | +4360605906,10.1109/isscc42615.2023.10067837,,"33.1 A 16nm 32Mb Embedded STT-MRAM with a 6ns Read-Access Time, a 1M-Cycle Write Endurance, 20-Year Retention at 150°C and MTJ-OTP Solutions for Magnetic Immunity",Digest of technical papers/Digest of technical papers - IEEE International Solid-State Circuits Conference,2023,conference-paper,ai_accelerators,2,27.0,53.0,29.22718446601942,69,119.8281,True,False,post,331a16nm32mbembeddedsttmramwitha6nsreadaccesstimea1mcyclewriteendurance20yearretentionat150candmtjotpsolutionsformagneticimmunity,29.22718446601942,landmark,True | ||
| 751 | −7127097285,10.1364/optica.578687,,Nonlinear photonic neuromorphic chips for spiking reinforcement learning,Optica,2026,article,ai_accelerators,7,9.0,9.0,10.015213786983631,9,32.5136,True,True,post,31.99698521391641,landmark,True | 751 | +4413052649,10.1016/j.vlsi.2025.102500,,An attractor-controllable memristive Hopfield neural network and its application on voice encryption,Integration,2025,article,ai_accelerators,4,66.0,66.0,14.175875486381322,66,28.5628,False,False,post,anattractorcontrollablememristivehopfieldneuralnetworkanditsapplicationonvoiceencryption,28.840123465478598,landmark,True | ||
| 752 | −2916516729,10.5555/3323298.3323317,,SLM-DB: Single-Level Key-Value Store with Persistent Memory,Scholarworks@UNIST (Ulsan National Institute of Science and Technology),2019,dissertation,operating_systems,7,19.0,42.0,328.8494623655914,75,,True,True,baseline,328.8494623655914,landmark,True | 752 | +2916516729,10.5555/3323298.3323317,,SLM-DB: Single-Level Key-Value Store with Persistent Memory,Scholarworks@UNIST (Ulsan National Institute of Science and Technology),2019,dissertation,operating_systems,7,19.0,42.0,328.8494623655914,75,,True,True,baseline,slmdbsinglelevelkeyvaluestorewithpersistentmemory,328.8494623655914,landmark,True | ||
| 753 | −4295093682,10.5281/zenodo.19901496,,fast16 as a Second-Order Subversion Attack,,2026,preprint,operating_systems,4,28.0,28.0,1089.5438596491229,28,,True,True,post,99.54617622107328,landmark,True | 753 | +4295093682,10.5281/zenodo.19901496,,fast16 as a Second-Order Subversion Attack,,2026,preprint,operating_systems,4,28.0,28.0,1089.5438596491229,28,,True,True,post,fast16asasecondordersubversionattack,70.99317154134503,landmark,True | ||
| 754 | −7130515337,10.1186/s12912-026-04420-6,,Artificial intelligence literacy and academic resilience in undergraduate nursing students: the mediating role of self-efficacy and artificial intelligence anxiety,BMC Nursing,2026,article,operating_systems,1,13.0,13.0,92.3590525632706,13,118.9868,True,True,post,46.2178675312126,landmark,True | 754 | +25727798,10.48550/arxiv.1903.01955,1903.01955,The Lustre Storage Architecture,arXiv (Cornell University),2019,preprint,operating_systems,3,96.0,112.0,46.00430107526881,206,,True,True,baseline,thelustrestoragearchitecture,46.00430107526881,landmark,True | ||
| 755 | −25727798,10.48550/arxiv.1903.01955,1903.01955,The Lustre Storage Architecture,arXiv (Cornell University),2019,preprint,operating_systems,3,96.0,112.0,46.00430107526881,206,,True,True,baseline,46.00430107526881,landmark,True | 755 | +2930508541,10.4230/oasics.microservices.2020-2022.5,1902.03383,Cloud Programming Simplified: A Berkeley View on Serverless Computing,arXiv (Cornell University),2019,preprint,operating_systems,6,103.0,195.0,43.97867397390838,409,,True,True,baseline,cloudprogrammingsimplifiedaberkeleyviewonserverlesscomputing,43.97867397390838,landmark,True | ||
| 756 | −2930508541,10.4230/oasics.microservices.2020-2022.5,1902.03383,Cloud Programming Simplified: A Berkeley View on Serverless Computing,arXiv (Cornell University),2019,preprint,operating_systems,6,103.0,195.0,43.97867397390838,409,,True,True,baseline,43.97867397390838,landmark,True | 756 | +4404401018,10.1145/3694715.3695964,2312.12456,PowerInfer: Fast Large Language Model Serving with a Consumer-grade GPU,ACM SIGOPS Symposium on Operating Systems Principles (SOSP),2024,conference-paper,operating_systems,10,64.0,133.0,39.39609644087256,133,42.1961,True,True,post,powerinferfastlargelanguagemodelservingwithaconsumergradegpu,39.39609644087256,landmark,True | ||
| 757 | −4404401018,10.1145/3694715.3695964,2312.12456,PowerInfer: Fast Large Language Model Serving with a Consumer-grade GPU,ACM SIGOPS Symposium on Operating Systems Principles (SOSP),2024,conference-paper,operating_systems,10,64.0,133.0,39.39609644087256,133,42.1961,True,True,post,39.39609644087256,landmark,True | 757 | +3182301081,,,Zico: Efficient {GPU} Memory Sharing for Concurrent {DNN} Training,Scholarworks@UNIST (Ulsan National Institute of Science and Technology),2021,dissertation,operating_systems,5,0.0,5.0,37.01492537313433,8,,True,False,baseline,zicoefficientgpumemorysharingforconcurrentdnntraining,37.01492537313433,landmark,True | ||
| 758 | −3182301081,,,Zico: Efficient {GPU} Memory Sharing for Concurrent {DNN} Training,Scholarworks@UNIST (Ulsan National Institute of Science and Technology),2021,dissertation,operating_systems,5,0.0,5.0,37.01492537313433,8,,True,False,baseline,37.01492537313433,landmark,True | 758 | +7130515337,10.1186/s12912-026-04420-6,,Artificial intelligence literacy and academic resilience in undergraduate nursing students: the mediating role of self-efficacy and artificial intelligence anxiety,BMC Nursing,2026,article,operating_systems,1,13.0,13.0,92.3590525632706,13,118.9868,True,True,post,artificialintelligenceliteracyandacademicresilienceinundergraduatenursingstudentsthemediatingroleofselfefficacyandartificialintelligenceanxiety,32.96111535848162,landmark,True | ||
| 759 | −7162190207,10.1016/j.dss.2026.114696,,"AI-driven mental health therapy: A comparative study of emotional clarity and stigma reduction across journaling, human-guided therapy, and AI-guided therapy",Decision Support Systems,2026,article,operating_systems,1,10.0,10.0,5.225225225225225,10,63.1822,False,False,post,35.552205793240454,landmark,True | 759 | +2975712713,10.1145/3341301.3359642,,A generic communication scheduler for distributed DNN training acceleration,,2019,conference-paper,operating_systems,8,53.0,119.0,31.997431506849313,321,32.6252,True,False,baseline,agenericcommunicationschedulerfordistributeddnntrainingacceleration,31.997431506849313,landmark,True | ||
| 760 | −2975712713,10.1145/3341301.3359642,,A generic communication scheduler for distributed DNN training acceleration,,2019,conference-paper,operating_systems,8,53.0,119.0,31.997431506849313,321,32.6252,True,False,baseline,31.997431506849313,landmark,True | 760 | +4384697207,10.22215/etd/2023-15552,,Methods and Techniques for Inter-cloud Data Transfers,,2023,dissertation,operating_systems,4,1.0,1.0,28.864864864864863,1,,True,True,post,methodsandtechniquesforinterclouddatatransfers,28.864864864864863,landmark,True | ||
| 761 | −4384697207,10.22215/etd/2023-15552,,Methods and Techniques for Inter-cloud Data Transfers,,2023,dissertation,operating_systems,4,1.0,1.0,28.864864864864863,1,,True,True,post,28.864864864864863,landmark,True | 761 | +4394944658,10.1145/3627703.3629578,,"Orion: Interference-aware, Fine-grained GPU Sharing for ML Applications",,2024,conference-paper,operating_systems,7,56.0,97.0,28.73249138920781,97,30.7746,True,False,post,orioninterferenceawarefinegrainedgpusharingformlapplications,28.73249138920781,landmark,True | ||
| 762 | −4394944658,10.1145/3627703.3629578,,"Orion: Interference-aware, Fine-grained GPU Sharing for ML Applications",,2024,conference-paper,operating_systems,7,56.0,97.0,28.73249138920781,97,30.7746,True,False,post,28.73249138920781,landmark,True | 762 | +7162190207,10.1016/j.dss.2026.114696,,"AI-driven mental health therapy: A comparative study of emotional clarity and stigma reduction across journaling, human-guided therapy, and AI-guided therapy",Decision Support Systems,2026,article,operating_systems,1,10.0,10.0,5.225225225225225,10,63.1822,False,False,post,aidrivenmentalhealththerapyacomparativestudyofemotionalclarityandstigmareductionacrossjournalinghumanguidedtherapyandaiguidedtherapy,25.35470412190894,landmark,True | ||
| 763 | −3012028616,10.1145/3373376.3378512,,Catalyzer,International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS),2020,conference-paper,operating_systems,6,56.0,88.0,24.84845663205922,281,26.591,True,False,baseline,24.84845663205922,landmark,True | 763 | +4295682935,,,CodaLab Competitions An Open Source Platform to Organize Scientific Challenges,HAL (Le Centre pour la Communication Scientifique Directe),2022,report,operating_systems,4,28.0,68.0,22.289935364727608,75,,True,True,baseline,codalabcompetitionsanopensourceplatformtoorganizescientificchallenges,22.289935364727608,landmark,True | ||
| 764 | −4295682935,,,CodaLab Competitions An Open Source Platform to Organize Scientific Challenges,HAL (Le Centre pour la Communication Scientifique Directe),2022,report,operating_systems,4,28.0,68.0,22.289935364727608,75,,True,True,baseline,22.289935364727608,landmark,True | 764 | +3152809665,10.1145/3445814.3446701,,"Nightcore: efficient and scalable serverless computing for latency-sensitive, interactive microservices",,2021,conference-paper,operating_systems,5,33.0,78.0,21.88714698058747,215,30.1787,True,True,baseline,nightcoreefficientandscalableserverlesscomputingforlatencysensitiveinteractivemicroservices,21.88714698058747,landmark,True | ||
| 765 | −3152809665,10.1145/3445814.3446701,,"Nightcore: efficient and scalable serverless computing for latency-sensitive, interactive microservices",,2021,conference-paper,operating_systems,5,33.0,78.0,21.88714698058747,215,30.1787,True,True,baseline,21.88714698058747,landmark,True | 765 | +3010663313,10.1145/3373376.3378515,,FlatStore: An Efficient Log-Structured Key-Value Storage Engine for Persistent Memory,International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS),2020,conference-paper,operating_systems,5,38.0,70.0,21.67711021009952,165,23.8709,True,False,baseline,flatstoreanefficientlogstructuredkeyvaluestorageengineforpersistentmemory,21.67711021009952,landmark,True | ||
| 766 | −3010663313,10.1145/3373376.3378515,,FlatStore: An Efficient Log-Structured Key-Value Storage Engine for Persistent Memory,International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS),2020,conference-paper,operating_systems,5,38.0,70.0,21.67711021009952,165,23.8709,True,False,baseline,21.67711021009952,landmark,True | 766 | +3092732687,,,PENGEMBANGAN SISTEM INFORMASI PENERIMAANMAHASISWA BARU DENGAN METODE BUSINESSPROCESS AUTOMATION (STUDI KASUS: INSTITUTTEKNOLOGI KALIMANTAN),,2019,dissertation,operating_systems,1,0.0,1.0,21.373831775700936,1,,True,False,baseline,pengembangansisteminformasipenerimaanmahasiswabarudenganmetodebusinessprocessautomationstudikasusinstitutteknologikalimantan,21.373831775700936,landmark,True | ||
| 767 | −3023238978,10.1145/3342195.3387524,,Autopilot,,2020,conference-paper,operating_systems,5,53.0,76.0,21.46003072768751,303,26.591,True,True,baseline,21.46003072768751,landmark,True | 767 | +3138262672,10.5445/ir/1000097700,,SimuBoost: Scalable Parallelization of Functional System Simulation,Repository KITopen (Karlsruhe Institute of Technology),2019,dissertation,operating_systems,5,3.0,3.0,20.57142857142857,3,,True,True,baseline,simuboostscalableparallelizationoffunctionalsystemsimulation,20.57142857142857,landmark,True | ||
| 768 | −3092732687,,,PENGEMBANGAN SISTEM INFORMASI PENERIMAANMAHASISWA BARU DENGAN METODE BUSINESSPROCESS AUTOMATION (STUDI KASUS: INSTITUTTEKNOLOGI KALIMANTAN),,2019,dissertation,operating_systems,1,0.0,1.0,21.373831775700936,1,,True,False,baseline,21.373831775700936,landmark,True | 768 | +4366587887,10.3390/su15086917,,Promising Emerging Technologies for Teaching and Learning: Recent Developments and Future Challenges,Sustainability,2023,article,operating_systems,1,44.0,83.0,19.453189395067895,108,24.9088,True,True,post,promisingemergingtechnologiesforteachingandlearningrecentdevelopmentsandfuturechallenges,19.453189395067895,landmark,True | ||
| 769 | −7131624127,10.1109/tcyb.2026.3665802,,Zentropy-Enhanced Multigranularity Knowledge Modeling for Robust Feature Selection,IEEE Transactions on Cybernetics,2026,article,operating_systems,1,6.0,6.0,16.941652365775926,6,21.3832,True,False,post,21.331323475944274,landmark,True | 769 | +3134501457,,,KLASIFIKASI INDEKS PEMBANGUNAN MANUSIA KABUPATEN/KOTA DI INDONESIA MENGGUNAKANMETODE RANDOM FOREST,,2020,dissertation,operating_systems,1,1.0,2.0,18.809744779582367,5,,True,False,baseline,klasifikasiindekspembangunanmanusiakabupatenkotadiindonesiamenggunakanmetoderandomforest,18.809744779582367,landmark,True | ||
| 770 | −7127083763,10.1038/s41746-026-02414-x,,Digital medicine’s international race for regulatory sandboxes and voluntary alternative pathways picks up tempo,npj Digital Medicine,2026,article,operating_systems,1,6.0,6.0,7.93984962406015,6,44.8817,True,True,post,21.331323475944274,landmark,True | 770 | +4385215131,10.23919/vlsitechnologyandcir57934.2023.10185294,,QLC Programmable 3D Ferroelectric NAND Flash Memory by Memory Window Expansion using Cell Stack Engineering,IEEE Symposium on VLSI Technology and Circuits (VLSI Technology and Circuits),2023,conference-paper,operating_systems,1,28.0,55.0,18.331575035365766,70,35.7909,True,False,post,qlcprogrammable3dferroelectricnandflashmemorybymemorywindowexpansionusingcellstackengineering,18.331575035365766,landmark,True | ||
| 771 | −2792476970,10.1145/3159450.3159498,,Assessing Bootstrap,ACM Technical Symposium on Computer Science Education (SIGCSE),2018,conference-paper,operating_systems,1,43.0,51.0,20.74425370963049,68,15.3851,True,False,baseline,20.74425370963049,landmark,True | 771 | +2807211499,,,Towards Efficient and Flexible Object Storage Using Resource and Functional Partitioning,VTechWorks (Virginia Tech),2018,dissertation,operating_systems,4,2.0,2.0,17.98848368522073,3,,True,False,baseline,towardsefficientandflexibleobjectstorageusingresourceandfunctionalpartitioning,17.98848368522073,landmark,True | ||
| 772 | −3138262672,10.5445/ir/1000097700,,SimuBoost: Scalable Parallelization of Functional System Simulation,Repository KITopen (Karlsruhe Institute of Technology),2019,dissertation,operating_systems,5,3.0,3.0,20.57142857142857,3,,True,True,baseline,20.57142857142857,landmark,True | 772 | +4407217670,10.1145/3669940.3707256,2405.04437,vAttention: Dynamic Memory Management for Serving LLMs without PagedAttention,ACM International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS),2025,conference-paper,operating_systems,7,40.0,40.0,34.965113033770585,40,35.3801,True,True,post,vattentiondynamicmemorymanagementforservingllmswithoutpagedattention,17.478862706350665,landmark,True | ||
| 773 | −3021475380,10.1145/3342195.3387532,,Keystone,,2020,conference-paper,operating_systems,5,90.0,144.0,20.409055296688795,379,20.3598,True,True,baseline,20.409055296688795,landmark,True | 773 | +1653864426,10.1007/978-981-13-0599-3,,Inside Solid State Drives (SSDs),Springer series in advanced microelectronics,2018,book,operating_systems,2,51.0,57.0,16.97693817468106,82,6.0183,False,False,baseline,insidesolidstatedrivesssds,16.97693817468106,landmark,True | ||
| 774 | −4407217670,10.1145/3669940.3707256,2405.04437,vAttention: Dynamic Memory Management for Serving LLMs without PagedAttention,ACM International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS),2025,conference-paper,operating_systems,7,40.0,40.0,34.965113033770585,40,35.3801,True,True,post,20.250354195006764,landmark,True | 774 | +2798337732,10.1145/3190508.3190524,,Reducing DRAM footprint with NVM in Facebook,,2018,conference-paper,operating_systems,5,27.0,55.0,16.76435545739858,124,15.8731,True,True,baseline,reducingdramfootprintwithnvminfacebook,16.76435545739858,landmark,True | ||
| 775 | −4366587887,10.3390/su15086917,,Promising Emerging Technologies for Teaching and Learning: Recent Developments and Future Challenges,Sustainability,2023,article,operating_systems,1,44.0,83.0,19.453189395067895,108,24.9088,True,True,post,19.453189395067895,landmark,True | 775 | +4396654316,10.1002/sd.3021,,"Digital financial inclusion, financial stability, and sustainable development: Evidence from a quantile‐on‐quantile regression and wavelet coherence",Sustainable Development,2024,article,operating_systems,1,38.0,53.0,15.956977383908523,53,20.2822,True,True,post,digitalfinancialinclusionfinancialstabilityandsustainabledevelopmentevidencefromaquantileonquantileregressionandwaveletcoherence,15.956977383908523,landmark,True | ||
| 776 | −3134501457,,,KLASIFIKASI INDEKS PEMBANGUNAN MANUSIA KABUPATEN/KOTA DI INDONESIA MENGGUNAKANMETODE RANDOM FOREST,,2020,dissertation,operating_systems,1,1.0,2.0,18.809744779582367,5,,True,False,baseline,18.809744779582367,landmark,True | 776 | +3181035463,,,{ZNS}: Avoiding the Block Interface Tax for Flash-based SSDs,USENIX Annual Technical Conference,2021,conference-paper,operating_systems,4,26.0,46.0,15.661939184411095,82,17.1134,False,False,baseline,znsavoidingtheblockinterfacetaxforflashbasedssds,15.661939184411095,landmark,True | ||
| 777 | −2982169647,10.1038/s41586-019-1666-5,,Quantum supremacy using a programmable superconducting processor,Nature,2019,article,quantum_computing,4,941.0,2260.0,343.6453226447595,7695,402.3374,True,True,baseline,343.6453226447595,landmark,True | 777 | +2982169647,10.1038/s41586-019-1666-5,,Quantum supremacy using a programmable superconducting processor,Nature,2019,article,quantum_computing,4,941.0,2260.0,343.6453226447595,7695,402.3374,True,True,baseline,quantumsupremacyusingaprogrammablesuperconductingprocessor,343.6453226447595,landmark,True | ||
| 778 | −2781738013,10.22331/q-2018-08-06-79,,Quantum Computing in the NISQ era and beyond,Quantum,2018,article,quantum_computing,2,386.0,1026.0,193.65188671645743,8559,285.8725,True,True,baseline,193.65188671645743,landmark,True | 778 | +2781738013,10.22331/q-2018-08-06-79,,Quantum Computing in the NISQ era and beyond,Quantum,2018,article,quantum_computing,2,386.0,1026.0,193.65188671645743,8559,285.8725,True,True,baseline,quantumcomputinginthenisqeraandbeyond,193.65188671645743,landmark,True | ||
| 779 | −4396986598,10.48550/arxiv.2405.08810,2405.08810,Quantum computing with Qiskit,arXiv (Cornell University),2024,preprint,quantum_computing,2,148.0,208.0,181.45149859248218,208,,True,True,post,181.45149859248218,landmark,True | 779 | +4396986598,10.48550/arxiv.2405.08810,2405.08810,Quantum computing with Qiskit,arXiv (Cornell University),2024,preprint,quantum_computing,2,148.0,208.0,181.45149859248218,208,,True,True,post,quantumcomputingwithqiskit,181.45149859248218,landmark,True | ||
| 780 | −4408847956,10.1038/s42254-025-00813-9,2405.00781,Barren plateaus in variational quantum computing,Nature Reviews Physics,2025,review,quantum_computing,2,257.0,257.0,31.907270486752928,257,34.4334,False,True,post,130.10852570291846,landmark,True | 780 | +4408847956,10.1038/s42254-025-00813-9,2405.00781,Barren plateaus in variational quantum computing,Nature Reviews Physics,2025,review,quantum_computing,2,257.0,257.0,31.907270486752928,257,34.4334,False,True,post,barrenplateausinvariationalquantumcomputing,112.30169288830302,landmark,True | ||
| 781 | −4407158326,10.1038/s41586-024-08404-x,,Distributed quantum computing across an optical network link,Nature,2025,article,quantum_computing,5,192.0,192.0,65.40466790073914,192,79.0635,True,True,post,97.20170013603247,landmark,True | 781 | +3107463944,10.1126/science.abe8770,,Quantum computational advantage using photons,Science,2020,article,quantum_computing,3,294.0,769.0,96.1833097432046,2267,120.9449,True,True,baseline,quantumcomputationaladvantageusingphotons,96.1833097432046,landmark,True | ||
| 782 | −3107463944,10.1126/science.abe8770,,Quantum computational advantage using photons,Science,2020,article,quantum_computing,3,294.0,769.0,96.1833097432046,2267,120.9449,True,True,baseline,96.1833097432046,landmark,True | 782 | +4213212652,10.1103/revmodphys.94.015004,,Noisy intermediate-scale quantum algorithms,Reviews of Modern Physics,2022,article,quantum_computing,2,509.0,908.0,93.55996787058045,1718,108.1665,True,True,baseline,noisyintermediatescalequantumalgorithms,93.55996787058045,landmark,True | ||
| 783 | −4213212652,10.1103/revmodphys.94.015004,,Noisy intermediate-scale quantum algorithms,Reviews of Modern Physics,2022,article,quantum_computing,2,509.0,908.0,93.55996787058045,1718,108.1665,True,True,baseline,93.55996787058045,landmark,True | 783 | +4405183524,10.1038/s41586-024-08449-y,,Quantum error correction below the surface code threshold,Nature,2024,article,quantum_computing,3,394.0,751.0,93.2801756943183,751,111.7642,True,True,post,quantumerrorcorrectionbelowthesurfacecodethreshold,93.2801756943183,landmark,True | ||
| 784 | −4405183524,10.1038/s41586-024-08449-y,,Quantum error correction below the surface code threshold,Nature,2024,article,quantum_computing,3,394.0,751.0,93.2801756943183,751,111.7642,True,True,post,93.2801756943183,landmark,True | 784 | +4386285839,10.3390/admsci13090196,,Managing the Strategic Transformation of Higher Education through Artificial Intelligence,Administrative Sciences,2023,article,quantum_computing,2,165.0,380.0,89.06279482079277,543,127.3637,True,True,post,managingthestrategictransformationofhighereducationthroughartificialintelligence,89.06279482079277,landmark,True | ||
| 785 | −1868882999,10.82444/warw.33678349,,Formal verification techniques using quantum process calculus,Warwick Research Archive Portal (University of Warwick),2026,dissertation,quantum_computing,5,26.0,26.0,795.7491039426524,27,,True,True,post,92.4357350624252,landmark,True | 785 | +4407158326,10.1038/s41586-024-08404-x,,Distributed quantum computing across an optical network link,Nature,2025,article,quantum_computing,5,192.0,192.0,65.40466790073914,192,79.0635,True,True,post,distributedquantumcomputingacrossanopticalnetworklink,83.8985409904832,landmark,True | ||
| 786 | −4406693713,10.1038/s41586-024-08406-9,,Scaling and networking a modular photonic quantum computer,Nature,2025,article,quantum_computing,4,178.0,178.0,60.63557753297692,178,73.6539,True,True,post,90.1140761677801,landmark,True | 786 | +3156168805,10.15488/11476,,Ultra-low vibration closed-cycle cryogenic surface-electrode ion trap apparatus,Institutional Repository of Leibniz Universität Hannover (Leibniz Universität Hannover),2021,dissertation,quantum_computing,2,10.0,18.0,81.87032967032967,25,,True,True,baseline,ultralowvibrationclosedcyclecryogenicsurfaceelectrodeiontrapapparatus,81.87032967032967,landmark,True | ||
| 787 | −4386285839,10.3390/admsci13090196,,Managing the Strategic Transformation of Higher Education through Artificial Intelligence,Administrative Sciences,2023,article,quantum_computing,2,165.0,380.0,89.06279482079277,543,127.3637,True,True,post,89.06279482079277,landmark,True | 787 | +4321610982,10.1038/s41586-022-05434-1,,Suppressing quantum errors by scaling a surface code logical qubit,Nature,2023,article,quantum_computing,1,462.0,879.0,80.69640995309555,1083,94.0878,True,True,post,suppressingquantumerrorsbyscalingasurfacecodelogicalqubit,80.69640995309555,landmark,True | ||
| 788 | −7160873310,10.55124/jqca.v1i1.101,,Enhancing the Performance Prediction of Quantum Computing Algorithms using Gradient Boosting and Ada Boost Regression,Journal of Quantum Computing and Advanced Algorithms,2026,article,quantum_computing,4,24.0,24.0,26.707236765289682,24,83.0902,True,True,post,85.3252939037771,landmark,True | 788 | +4406693713,10.1038/s41586-024-08406-9,,Scaling and networking a modular photonic quantum computer,Nature,2025,article,quantum_computing,4,178.0,178.0,60.63557753297692,178,73.6539,True,True,post,scalingandnetworkingamodularphotonicquantumcomputer,77.78093904326046,landmark,True | ||
| 789 | −4407091026,10.1016/s2589-7500(24)00267-x,,"Screening performance and characteristics of breast cancer detected in the Mammography Screening with Artificial Intelligence trial (MASAI): a randomised, controlled, parallel-group, non-inferiority, single-blinded, screening accuracy study",The Lancet Digital Health,2025,article,quantum_computing,1,164.0,164.0,55.86648716521469,164,67.8282,True,True,post,83.02645219952774,landmark,True | 789 | +2788945937,10.37686/qrl.v1i2.80,,Classification with Quantum Neural Networks on Near Term Processors,,2020,report,quantum_computing,1,188.0,222.0,77.25930521091811,332,,True,True,baseline,classificationwithquantumneuralnetworksonneartermprocessors,77.25930521091811,landmark,True | ||
| 790 | −3156168805,10.15488/11476,,Ultra-low vibration closed-cycle cryogenic surface-electrode ion trap apparatus,Institutional Repository of Leibniz Universität Hannover (Leibniz Universität Hannover),2021,dissertation,quantum_computing,2,10.0,18.0,81.87032967032967,25,,True,True,baseline,81.87032967032967,landmark,True | 790 | +3174122836,10.1201/9781003358817-7,,Quantum Computing 40 Years Later,CRC Press eBooks,2023,book-chapter,quantum_computing,3,84.0,139.0,76.8491680085883,123,68.2265,True,True,baseline,quantumcomputing40yearslater,76.8491680085883,landmark,True | ||
| 791 | −4321610982,10.1038/s41586-022-05434-1,,Suppressing quantum errors by scaling a surface code logical qubit,Nature,2023,article,quantum_computing,1,462.0,879.0,80.69640995309555,1083,94.0878,True,True,post,80.69640995309555,landmark,True | 791 | +4389373471,10.1038/s41586-023-06927-3,,Logical quantum processor based on reconfigurable atom arrays,Nature,2023,article,quantum_computing,3,242.0,826.0,75.83075611064497,1099,96.5476,True,True,post,logicalquantumprocessorbasedonreconfigurableatomarrays,75.83075611064497,landmark,True | ||
| 792 | −2963194964,,,Lämmönsäätely suprajohtavissa mikroaaltopiireissä,Aaltodoc (Aalto University),2019,dissertation,quantum_computing,1,15.0,22.0,80.11469534050178,32,,True,False,baseline,80.11469534050178,landmark,True | 792 | +4380627387,10.1038/s41586-023-06096-3,,Evidence for the utility of quantum computing before fault tolerance,Nature,2023,article,quantum_computing,3,422.0,821.0,75.37173216324398,1033,90.7495,True,True,post,evidencefortheutilityofquantumcomputingbeforefaulttolerance,75.37173216324398,landmark,True | ||
| 793 | −1521266393,10.1103/revmodphys.93.025005,,Circuit quantum electrodynamics,Reviews of Modern Physics,2021,article,quantum_computing,1,362.0,674.0,78.54959108089838,1931,89.363,True,True,baseline,78.54959108089838,landmark,True | 793 | +4294786246,,,Time-optimal holonomic quantum computation,KTH Publication Database DiVA (KTH Royal Institute of Technology),2022,dissertation,quantum_computing,1,7.0,10.0,74.89035087719299,13,,True,True,baseline,timeoptimalholonomicquantumcomputation,74.89035087719299,landmark,True | ||
| 794 | −4321649614,10.1103/dmn4-snfx,,Quantum-selected configuration interaction: Classical diagonalization of Hamiltonians in subspaces selected by quantum computers,Physical Review Research,2026,article,quantum_computing,2,22.0,22.0,24.48163370151554,22,43.3514,True,True,post,78.21485274512901,landmark,True | 794 | +4407091026,10.1016/s2589-7500(24)00267-x,,"Screening performance and characteristics of breast cancer detected in the Mammography Screening with Artificial Intelligence trial (MASAI): a randomised, controlled, parallel-group, non-inferiority, single-blinded, screening accuracy study",The Lancet Digital Health,2025,article,quantum_computing,1,164.0,164.0,55.86648716521469,164,67.8282,True,True,post,screeningperformanceandcharacteristicsofbreastcancerdetectedinthemammographyscreeningwithartificialintelligencetrialmasaiarandomisedcontrolledparallelgroupnoninferioritysingleblindedscreeningaccuracystudy,71.66333709603774,landmark,True | ||
| 795 | −2788945937,10.37686/qrl.v1i2.80,,Classification with Quantum Neural Networks on Near Term Processors,,2020,report,quantum_computing,1,188.0,222.0,77.25930521091811,332,,True,True,baseline,77.25930521091811,landmark,True | 795 | +2798434869,10.1038/s41586-019-0980-2,,Supervised learning with quantum-enhanced feature spaces,Nature,2019,article,quantum_computing,1,182.0,449.0,68.27289817145886,2519,80.6977,False,True,baseline,supervisedlearningwithquantumenhancedfeaturespaces,68.27289817145886,landmark,True | ||
| 796 | −3174122836,10.1201/9781003358817-7,,Quantum Computing 40 Years Later,CRC Press eBooks,2023,book-chapter,quantum_computing,3,84.0,139.0,76.8491680085883,123,68.2265,True,True,baseline,76.8491680085883,landmark,True | 796 | +4409126690,10.1007/s11227-025-07047-7,2410.00916,"IBM quantum computers: evolution, performance, and future directions",The Journal of Supercomputing,2025,article,quantum_computing,4,151.0,151.0,51.438046109435476,151,61.5863,True,True,post,ibmquantumcomputersevolutionperformanceandfuturedirections,65.98270671647376,landmark,True | ||
| 797 | −4408612646,10.1038/s41586-025-08739-z,,Microsatellite-based real-time quantum key distribution,Nature,2025,article,quantum_computing,3,151.0,151.0,51.438046109435476,151,62.4186,False,True,post,76.44508708615054,landmark,True | 797 | +4408612646,10.1038/s41586-025-08739-z,,Microsatellite-based real-time quantum key distribution,Nature,2025,article,quantum_computing,3,151.0,151.0,51.438046109435476,151,62.4186,False,True,post,microsatellitebasedrealtimequantumkeydistribution,65.98270671647376,landmark,True | ||
| 798 | −4409126690,10.1007/s11227-025-07047-7,2410.00916,"IBM quantum computers: evolution, performance, and future directions",The Journal of Supercomputing,2025,article,quantum_computing,4,151.0,151.0,51.438046109435476,151,61.5863,True,True,post,76.44508708615054,landmark,True | 798 | +1868882999,10.82444/warw.33678349,,Formal verification techniques using quantum process calculus,Warwick Research Archive Portal (University of Warwick),2026,dissertation,quantum_computing,5,26.0,26.0,795.7491039426524,27,,True,True,post,formalverificationtechniquesusingquantumprocesscalculus,65.92223071696324,landmark,True | ||
| 799 | −4389373471,10.1038/s41586-023-06927-3,,Logical quantum processor based on reconfigurable atom arrays,Nature,2023,article,quantum_computing,3,242.0,826.0,75.83075611064497,1099,96.5476,True,True,post,75.83075611064497,landmark,True | 799 | +2482126025,10.1038/s41567-018-0124-x,,Characterizing quantum supremacy in near-term devices,Nature Physics,2018,article,quantum_computing,1,219.0,345.0,65.11686249237604,1156,65.4918,False,True,baseline,characterizingquantumsupremacyinneartermdevices,65.11686249237604,landmark,True | ||
| 800 | −4380627387,10.1038/s41586-023-06096-3,,Evidence for the utility of quantum computing before fault tolerance,Nature,2023,article,quantum_computing,3,422.0,821.0,75.37173216324398,1033,90.7495,True,True,post,75.37173216324398,landmark,True | 800 | +2950805899,10.1063/1.5089550,,A quantum engineer's guide to superconducting qubits,Applied Physics Reviews,2019,article,quantum_computing,1,162.0,416.0,63.255068239035374,2004,77.9349,True,True,baseline,aquantumengineersguidetosuperconductingqubits,63.255068239035374,landmark,True | ||
| 801 | −4294786246,,,Time-optimal holonomic quantum computation,KTH Publication Database DiVA (KTH Royal Institute of Technology),2022,dissertation,quantum_computing,1,7.0,10.0,74.89035087719299,13,,True,True,baseline,74.89035087719299,landmark,True | 801 | +3173899054,10.1103/physrevlett.127.180501,,Strong Quantum Computational Advantage Using a Superconducting Quantum Processor,Physical Review Letters,2021,article,quantum_computing,4,274.0,540.0,62.93290680071977,1060,68.1911,True,True,baseline,strongquantumcomputationaladvantageusingasuperconductingquantumprocessor,62.93290680071977,landmark,True | ||
| 802 | −3029645440,10.1017/9781108993456.011,,Numerical optimization,Cambridge University Press eBooks,2021,book-chapter,scientific_computing,1,9332.0,9351.0,3148.4582677769677,13724,453.7174,True,False,baseline,3148.4582677769677,landmark,True | 802 | +3003257820,10.1038/s41592-019-0686-2,1907.10121,SciPy 1.0: fundamental algorithms for scientific computing in Python,Nature Methods,2020,article,scientific_computing,4,5667.0,10506.0,1314.046621797279,37925,1523.8871,True,True,baseline,scipy10fundamentalalgorithmsforscientificcomputinginpython,1314.046621797279,landmark,True | ||
| 803 | −3003257820,10.1038/s41592-019-0686-2,1907.10121,SciPy 1.0: fundamental algorithms for scientific computing in Python,Nature Methods,2020,article,scientific_computing,4,5667.0,10506.0,1314.046621797279,37925,1523.8871,True,True,baseline,1314.046621797279,landmark,True | 803 | +3201073812,10.1016/j.cpc.2021.108171,,"LAMMPS - a flexible simulation tool for particle-based materials modeling at the atomic, meso, and continuum scales",Computer Physics Communications,2021,article,scientific_computing,8,826.0,2697.0,568.1403850199874,12382,907.8113,True,True,baseline,lammpsaflexiblesimulationtoolforparticlebasedmaterialsmodelingattheatomicmesoandcontinuumscales,568.1403850199874,landmark,True | ||
| 804 | −3035965352,10.1038/s41586-020-2649-2,2006.10256,Array programming with NumPy,Nature,2020,article,scientific_computing,4,2086.0,5137.0,642.5145151506398,23207,829.0931,True,True,baseline,642.5145151506398,landmark,True | 804 | +2990427812,10.21105/joss.01686,,Welcome to the Tidyverse,The Journal of Open Source Software,2019,article,scientific_computing,2,697.0,2788.0,423.93060156353516,21504,642.5886,True,True,baseline,welcometothetidyverse,423.93060156353516,landmark,True | ||
| 805 | −3201073812,10.1016/j.cpc.2021.108171,,"LAMMPS - a flexible simulation tool for particle-based materials modeling at the atomic, meso, and continuum scales",Computer Physics Communications,2021,article,scientific_computing,8,826.0,2697.0,568.1403850199874,12382,907.8113,True,True,baseline,568.1403850199874,landmark,True | 805 | +3099929043,,,Bayesian probabilistic numerical methods,Warwick Research Archive Portal (University of Warwick),2019,dissertation,scientific_computing,3,61.0,81.0,294.96774193548384,85,,True,False,baseline,bayesianprobabilisticnumericalmethods,294.96774193548384,landmark,True | ||
| 806 | −2990427812,10.21105/joss.01686,,Welcome to the Tidyverse,The Journal of Open Source Software,2019,article,scientific_computing,2,697.0,2788.0,423.93060156353516,21504,642.5886,True,True,baseline,423.93060156353516,landmark,True | 806 | +3133457239,10.34726/hss.2010.001,,Numerical methods for topography simulation,reposiTUm (TU Wien),2019,dissertation,scientific_computing,2,9.0,10.0,222.03389830508473,13,,True,True,baseline,numericalmethodsfortopographysimulation,222.03389830508473,landmark,True | ||
| 807 | −90568776,,,PETSc Users Manual,,2019,article,scientific_computing,5,1066.0,1207.0,340.27902486121167,1896,114.6007,True,False,baseline,340.27902486121167,landmark,True | 807 | +2888532099,10.3847/1538-3881/aabc4f,,The Astropy Project: Building an Open-science Project and Status of the v2.0 Core Package *,The Astronomical Journal,2018,article,scientific_computing,1,459.0,1025.0,193.46314218749401,7687,234.9501,True,True,baseline,theastropyprojectbuildinganopenscienceprojectandstatusofthev20corepackage,193.46314218749401,landmark,True | ||
| 808 | −3099929043,,,Bayesian probabilistic numerical methods,Warwick Research Archive Portal (University of Warwick),2019,dissertation,scientific_computing,3,61.0,81.0,294.96774193548384,85,,True,False,baseline,294.96774193548384,landmark,True | 808 | +1494474111,10.1515/9783110666991-007,,7 Linear algebra applications,De Gruyter eBooks,2020,book-chapter,scientific_computing,2,184.0,190.0,163.70790263421142,482,30.6361,True,False,baseline,7linearalgebraapplications,163.70790263421142,landmark,True | ||
| 809 | −3133457239,10.34726/hss.2010.001,,Numerical methods for topography simulation,reposiTUm (TU Wien),2019,dissertation,scientific_computing,2,9.0,10.0,222.03389830508473,13,,True,True,baseline,222.03389830508473,landmark,True | 809 | +2913606428,10.3758/s13428-018-01193-y,,PsychoPy2: Experiments in behavior made easy,Behavior Research Methods,2019,article,scientific_computing,1,351.0,816.0,124.07724923810785,5166,170.3746,True,True,baseline,psychopy2experimentsinbehaviormadeeasy,124.07724923810785,landmark,True | ||
| 810 | −2888532099,10.3847/1538-3881/aabc4f,,The Astropy Project: Building an Open-science Project and Status of the v2.0 Core Package *,The Astronomical Journal,2018,article,scientific_computing,1,459.0,1025.0,193.46314218749401,7687,234.9501,True,True,baseline,193.46314218749401,landmark,True | 810 | +3038025793,10.1016/j.cpc.2021.108033,,VASPKIT: A user-friendly interface facilitating high-throughput computing and analysis using VASP code,Computer Physics Communications,2021,article,scientific_computing,1,947.0,2087.0,120.59877093864604,7856,267.5871,False,True,baseline,vaspkitauserfriendlyinterfacefacilitatinghighthroughputcomputingandanalysisusingvaspcode,120.59877093864604,landmark,True | ||
| 811 | −1494474111,10.1515/9783110666991-007,,7 Linear algebra applications,De Gruyter eBooks,2020,book-chapter,scientific_computing,2,184.0,190.0,163.70790263421142,482,30.6361,True,False,baseline,163.70790263421142,landmark,True | 811 | +7154488692,10.1016/j.engappai.2026.114843,,Lightweight Kolmogorov-Arnold Network with dual-objective optimization for axial capacity prediction of square coal gangue concrete-filled steel tube stub columns based on finite element simulation,Engineering Applications of Artificial Intelligence,2026,article,scientific_computing,1,45.0,45.0,33.579175704989154,45,110.7417,False,False,post,lightweightkolmogorovarnoldnetworkwithdualobjectiveoptimizationforaxialcapacitypredictionofsquarecoalgangueconcretefilledsteeltubestubcolumnsbasedonfiniteelementsimulation,114.09616854859023,landmark,True | ||
| 812 | −7154488692,10.1016/j.engappai.2026.114843,,Lightweight Kolmogorov-Arnold Network with dual-objective optimization for axial capacity prediction of square coal gangue concrete-filled steel tube stub columns based on finite element simulation,Engineering Applications of Artificial Intelligence,2026,article,scientific_computing,1,45.0,45.0,33.579175704989154,45,110.7417,False,False,post,159.98492606958206,landmark,True | 812 | +4383218913,10.1038/s41586-023-06185-3,,Accurate medium-range global weather forecasting with 3D neural networks,Nature,2023,article,scientific_computing,1,511.0,1104.0,106.38333772739257,1634,181.7259,True,True,post,accuratemediumrangeglobalweatherforecastingwith3dneuralnetworks,106.38333772739257,landmark,True | ||
| 813 | −2913606428,10.3758/s13428-018-01193-y,,PsychoPy2: Experiments in behavior made easy,Behavior Research Methods,2019,article,scientific_computing,1,351.0,816.0,124.07724923810785,5166,170.3746,True,True,baseline,124.07724923810785,landmark,True | 813 | +4408339746,10.1007/s44379-025-00015-1,2410.13228,From PINNs to PIKANs: recent advances in physics-informed machine learning,Machine learning for computational science and engineering,2025,article,scientific_computing,3,239.0,239.0,51.33385214007782,239,102.1338,False,True,post,frompinnstopikansrecentadvancesinphysicsinformedmachinelearning,104.43620467044524,landmark,True | ||
| 814 | −4408339746,10.1007/s44379-025-00015-1,2410.13228,From PINNs to PIKANs: recent advances in physics-informed machine learning,Machine learning for computational science and engineering,2025,article,scientific_computing,3,239.0,239.0,51.33385214007782,239,102.1338,False,True,post,120.99586631516542,landmark,True | 814 | +4386373863,10.7717/peerj-cs.1516,,"PyMC: a modern, and comprehensive probabilistic programming framework in Python",PeerJ Computer Science,2023,article,scientific_computing,4,390.0,626.0,100.85192909280501,870,132.4344,True,True,post,pymcamodernandcomprehensiveprobabilisticprogrammingframeworkinpython,100.85192909280501,landmark,True | ||
| 815 | −4417522354,10.1038/s43588-026-01009-6,,NEP89: universal neuroevolution potential for inorganic and organic materials across 89 elements,Nature Computational Science,2026,article,scientific_computing,1,34.0,34.0,26.21830985915493,34,44.9009,False,True,post,120.87749969701756,landmark,True | 815 | +4407925765,10.1016/j.cossms.2025.101214,2503.09814,A practical guide to machine learning interatomic potentials – Status and future,Current Opinion in Solid State and Materials Science,2025,review,scientific_computing,1,214.0,214.0,3.7709251101321586,214,9.2721,False,True,post,apracticalguidetomachinelearninginteratomicpotentialsstatusandfuture,93.51191547897606,landmark,True | ||
| 816 | −3038025793,10.1016/j.cpc.2021.108033,,VASPKIT: A user-friendly interface facilitating high-throughput computing and analysis using VASP code,Computer Physics Communications,2021,article,scientific_computing,1,947.0,2087.0,120.59877093864604,7856,267.5871,False,True,baseline,120.59877093864604,landmark,True | 816 | +2962853966,10.1007/s10915-018-0757-z,1511.06324,Global Convergence of ADMM in Nonconvex Nonsmooth Optimization,Journal of Scientific Computing,2018,article,scientific_computing,2,246.0,390.0,92.76320659281009,1268,89.8329,False,True,baseline,globalconvergenceofadmminnonconvexnonsmoothoptimization,92.76320659281009,landmark,True | ||
| 817 | −3143496104,10.1201/9781315107042-14,,Numerical Optimization,CRC Press eBooks,2018,book-chapter,scientific_computing,2,225.0,235.0,109.14754610815879,335,14.0895,True,False,baseline,109.14754610815879,landmark,True | 817 | +4417522354,10.1038/s43588-026-01009-6,,NEP89: universal neuroevolution potential for inorganic and organic materials across 89 elements,Nature Computational Science,2026,article,scientific_computing,1,34.0,34.0,26.21830985915493,34,44.9009,False,True,post,nep89universalneuroevolutionpotentialforinorganicandorganicmaterialsacross89elements,86.2059940144904,landmark,True | ||
| 818 | −4407925765,10.1016/j.cossms.2025.101214,2503.09814,A practical guide to machine learning interatomic potentials – Status and future,Current Opinion in Solid State and Materials Science,2025,review,scientific_computing,1,214.0,214.0,3.7709251101321586,214,9.2721,False,True,post,108.3393949432862,landmark,True | 818 | +4288039037,10.1007/s10915-022-01939-z,2201.05624,Scientific Machine Learning Through Physics–Informed Neural Networks: Where we are and What’s Next,Journal of Scientific Computing,2022,article,scientific_computing,4,341.0,893.0,76.4919191278996,2784,166.3219,True,True,baseline,scientificmachinelearningthroughphysicsinformedneuralnetworkswhereweareandwhatsnext,76.4919191278996,landmark,True | ||
| 819 | −4383218913,10.1038/s41586-023-06185-3,,Accurate medium-range global weather forecasting with 3D neural networks,Nature,2023,article,scientific_computing,1,511.0,1104.0,106.38333772739257,1634,181.7259,True,True,post,106.38333772739257,landmark,True | 819 | +2766160192,10.32614/rj-2018-017,,Advanced Bayesian Multilevel Modeling with the R Package brms,The R Journal,2018,article,scientific_computing,3,101.0,378.0,75.7268279043758,2942,170.9214,True,True,baseline,advancedbayesianmultilevelmodelingwiththerpackagebrms,75.7268279043758,landmark,True | ||
| 820 | −4386373863,10.7717/peerj-cs.1516,,"PyMC: a modern, and comprehensive probabilistic programming framework in Python",PeerJ Computer Science,2023,article,scientific_computing,4,390.0,626.0,100.85192909280501,870,132.4344,True,True,post,100.85192909280501,landmark,True | 820 | +3010959735,,,Gaussin prosessi -surrogaattimenetelmiä likimääräiseen Bayesilaiseen päättelyyn,Aaltodoc (Aalto University),2020,dissertation,scientific_computing,4,9.0,15.0,69.26632428466618,28,,True,True,baseline,gaussinprosessisurrogaattimenetelmilikimriseenbayesilaiseenpttelyyn,69.26632428466618,landmark,True | ||
| 821 | −4242546620,10.1007/978-1-4842-6876-6_1,,DPLYR,Apress eBooks,2021,book-chapter,scientific_computing,1,185.0,286.0,96.29548332629801,367,143.0004,True,False,baseline,96.29548332629801,landmark,True | 821 | +3161540023,10.21105/joss.03167,,Visualizations with statistical details: The 'ggstatsplot' approach,The Journal of Open Source Software,2021,article,scientific_computing,2,245.0,572.0,66.66226424076243,1496,84.8639,True,True,baseline,visualizationswithstatisticaldetailstheggstatsplotapproach,66.66226424076243,landmark,True | ||
| 822 | −2962853966,10.1007/s10915-018-0757-z,1511.06324,Global Convergence of ADMM in Nonconvex Nonsmooth Optimization,Journal of Scientific Computing,2018,article,scientific_computing,2,246.0,390.0,92.76320659281009,1268,89.8329,False,True,baseline,92.76320659281009,landmark,True | 822 | +4241803778,10.2172/1614847,,PETSc Users Manual (Rev. 3.13),,2020,report,scientific_computing,4,50.0,85.0,65.38461538461539,125,,True,True,baseline,petscusersmanualrev313,65.38461538461539,landmark,True | ||
| 823 | −4211084734,10.1017/9781108594967.028,,Positive Definite Matrices,Cambridge University Press eBooks,2019,book-chapter,scientific_computing,1,102.0,110.0,89.28544845552662,166,22.481,True,False,baseline,89.28544845552662,landmark,True | 823 | +4385811703,10.33915/etd.12076,,Accelerating Manufacturing Decisions using Bayesian Optimization: An Optimization and Prediction Perspective,,2023,dissertation,scientific_computing,3,1.0,3.0,64.72727272727272,3,,True,True,post,acceleratingmanufacturingdecisionsusingbayesianoptimizationanoptimizationandpredictionperspective,64.72727272727272,landmark,True | ||
| 824 | −4245687930,10.1201/9781003090601-06,,Chemical Reaction Engineering,CRC Press eBooks,2020,book-chapter,scientific_computing,2,90.0,102.0,81.77618941255305,322,24.1009,True,False,baseline,81.77618941255305,landmark,True | 824 | +3045710579,10.21468/scipostphyscodeb.4,2007.14822,The ITensor Software Library for Tensor Network Calculations,SciPost Physics Codebases,2022,article,scientific_computing,1,352.0,566.0,63.07331378299121,1078,80.8504,True,True,baseline,theitensorsoftwarelibraryfortensornetworkcalculations,63.07331378299121,landmark,True | ||
| 825 | −7128919969,10.1016/j.advengsoft.2026.104124,,SA-PINN: A self-attention enhanced physics-informed neural network for multiaxial fatigue life prediction with small samples,Advances in Engineering Software,2026,article,scientific_computing,2,23.0,23.0,25.467432950191572,23,46.775,False,False,post,81.77007332445305,landmark,True | 825 | +4399728220,10.2139/ssrn.4868150,,Kolmogorov–Arnold-Informed Neural Network: A Physics-Informed Deep Learning Framework for Solving Pdes Based on Kolmogorov–Arnold Networks,SSRN Electronic Journal,2024,preprint,scientific_computing,2,45.0,53.0,62.46666666666666,53,,False,True,post,kolmogorovarnoldinformedneuralnetworkaphysicsinformeddeeplearningframeworkforsolvingpdesbasedonkolmogorovarnoldnetworks,62.46666666666666,landmark,True | ||
| 826 | −4415338867,10.1137/25m1738863,2503.00768,Nonlinear Model Reduction by Probabilistic Manifold Decomposition,SIAM Journal on Scientific Computing,2026,article,scientific_computing,2,22.0,22.0,22.669565217391305,22,75.5825,True,True,post,78.21485274512901,landmark,True | 826 | +4200153169,10.1201/9781315228969-4,,Variational and Quasi-Variational Inequalities,Chapman & Hall/CRC eBooks,2021,book-chapter,scientific_computing,1,94.0,96.0,61.80957282552753,407,13.851,True,False,baseline,variationalandquasivariationalinequalities,61.80957282552753,landmark,True | ||
| 827 | −2944434778,10.1016/j.jbi.2019.103208,,The REDCap consortium: Building an international community of software platform partners,Journal of Biomedical Informatics,2019,article,computational_biology,1,1231.0,3835.0,1565.383789896379,23807,2212.4824,False,True,baseline,1565.383789896379,landmark,True | 827 | +2944434778,10.1016/j.jbi.2019.103208,,The REDCap consortium: Building an international community of software platform partners,Journal of Biomedical Informatics,2019,article,computational_biology,1,1231.0,3835.0,1565.383789896379,23807,2212.4824,False,True,baseline,theredcapconsortiumbuildinganinternationalcommunityofsoftwareplatformpartners,1565.383789896379,landmark,True | ||
| 828 | −4403324307,10.1101/2024.10.10.615955,,Chai-1: Decoding the molecular interactions of life,bioRxiv (Cold Spring Harbor Laboratory),2024,preprint,computational_biology,2,211.0,430.0,694.8057553956835,430,,True,True,post,694.8057553956835,landmark,True | 828 | +4403324307,10.1101/2024.10.10.615955,,Chai-1: Decoding the molecular interactions of life,bioRxiv (Cold Spring Harbor Laboratory),2024,preprint,computational_biology,2,211.0,430.0,694.8057553956835,430,,True,True,post,chai1decodingthemolecularinteractionsoflife,694.8057553956835,landmark,True | ||
| 829 | −4416043407,10.1038/s41586-026-10644-y,2502.18864,Accelerating scientific discovery with Co-Scientist,Nature,2026,article,computational_biology,7,110.0,110.0,310.59696003922534,110,359.9514,True,True,post,391.07426372564504,landmark,True | 829 | +3097145107,10.1093/nar/gkaa971,,PubChem in 2021: new data content and improved web interfaces,Nucleic Acids Research,2020,article,computational_biology,1,405.0,1318.0,383.79097718298823,3926,538.5909,True,True,baseline,pubchemin2021newdatacontentandimprovedwebinterfaces,383.79097718298823,landmark,True | ||
| 830 | −3097145107,10.1093/nar/gkaa971,,PubChem in 2021: new data content and improved web interfaces,Nucleic Acids Research,2020,article,computational_biology,1,405.0,1318.0,383.79097718298823,3926,538.5909,True,True,baseline,383.79097718298823,landmark,True | 830 | +4411463597,10.1101/2025.06.14.659707,,Boltz-2: Towards Accurate and Efficient Binding Affinity Prediction,bioRxiv (Cold Spring Harbor Laboratory),2025,preprint,computational_biology,3,665.0,665.0,2415.2006880733943,665,,True,True,post,boltz2towardsaccurateandefficientbindingaffinityprediction,290.58609249307983,landmark,True | ||
| 831 | −4411463597,10.1101/2025.06.14.659707,,Boltz-2: Towards Accurate and Efficient Binding Affinity Prediction,bioRxiv (Cold Spring Harbor Laboratory),2025,preprint,computational_biology,3,665.0,665.0,2415.2006880733943,665,,True,True,post,336.6621384919875,landmark,True | 831 | +4416043407,10.1038/s41586-026-10644-y,2502.18864,Accelerating scientific discovery with Co-Scientist,Nature,2026,article,computational_biology,7,110.0,110.0,310.59696003922534,110,359.9514,True,True,post,acceleratingscientificdiscoverywithcoscientist,278.90174534099833,landmark,True | ||
| 832 | −3008142620,10.1016/j.apsb.2020.02.008,,Analysis of therapeutic targets for SARS-CoV-2 and discovery of potential drugs by computational methods,Acta Pharmaceutica Sinica B,2020,article,computational_biology,2,1435.0,1826.0,268.8646986800856,2330,247.2738,True,True,baseline,268.8646986800856,landmark,True | 832 | +3008142620,10.1016/j.apsb.2020.02.008,,Analysis of therapeutic targets for SARS-CoV-2 and discovery of potential drugs by computational methods,Acta Pharmaceutica Sinica B,2020,article,computational_biology,2,1435.0,1826.0,268.8646986800856,2330,247.2738,True,True,baseline,analysisoftherapeutictargetsforsarscov2anddiscoveryofpotentialdrugsbycomputationalmethods,268.8646986800856,landmark,True | ||
| 833 | −4395010444,10.1093/nar/gkae303,,ProTox 3.0: a webserver for the prediction of toxicity of chemicals,Nucleic Acids Research,2024,article,computational_biology,2,785.0,1601.0,266.05146653514754,1601,313.6638,True,True,post,266.05146653514754,landmark,True | 833 | +4395010444,10.1093/nar/gkae303,,ProTox 3.0: a webserver for the prediction of toxicity of chemicals,Nucleic Acids Research,2024,article,computational_biology,2,785.0,1601.0,266.05146653514754,1601,313.6638,True,True,post,protox30awebserverforthepredictionoftoxicityofchemicals,266.05146653514754,landmark,True | ||
| 834 | −2951939904,10.4230/lipics.wabi.2019.10,,Jointly Embedding Multiple Single-Cell Omics Measurements,Leibniz international proceedings in informatics,2019,conference-paper,computational_biology,2,718.0,965.0,260.53544494720967,1141,577.848,True,True,baseline,260.53544494720967,landmark,True | 834 | +2951939904,10.4230/lipics.wabi.2019.10,,Jointly Embedding Multiple Single-Cell Omics Measurements,Leibniz international proceedings in informatics,2019,conference-paper,computational_biology,2,718.0,965.0,260.53544494720967,1141,577.848,True,True,baseline,jointlyembeddingmultiplesinglecellomicsmeasurements,260.53544494720967,landmark,True | ||
| 835 | −4409229284,10.1093/bioinformatics/btaf147,,CoverM: read alignment statistics for metagenomics,Bioinformatics,2025,article,computational_biology,2,511.0,511.0,110.40243438569799,511,130.364,True,True,post,258.6982748412114,landmark,True | 835 | +3156458251,10.1093/nar/gkab301,,Interactive Tree Of Life (iTOL) v5: an online tool for phylogenetic tree display and annotation,Nucleic Acids Research,2021,article,computational_biology,2,1857.0,4291.0,249.05241916110123,11124,520.9954,True,True,baseline,interactivetreeoflifeitolv5anonlinetoolforphylogenetictreedisplayandannotation,249.05241916110123,landmark,True | ||
| 836 | −4406633314,10.1038/s41591-024-03434-4,,Artificial intelligence in drug development,Nature Medicine,2025,article,computational_biology,1,498.0,498.0,209.201336966164,498,241.4884,False,False,post,252.1169097278342,landmark,True | 836 | +4409229284,10.1093/bioinformatics/btaf147,,CoverM: read alignment statistics for metagenomics,Bioinformatics,2025,article,computational_biology,2,511.0,511.0,110.40243438569799,511,130.364,True,True,post,covermreadalignmentstatisticsformetagenomics,223.29247107362977,landmark,True | ||
| 837 | −4323304388,10.26434/chemrxiv-2022-jjm0j-v4,,Uni-Mol: A Universal 3D Molecular Representation Learning Framework,ChemRxiv,2023,preprint,computational_biology,2,71.0,196.0,249.05517241379312,324,,True,True,post,249.05517241379312,landmark,True | 837 | +4393936599,10.1093/nar/gkae236,,"ADMETlab 3.0: an updated comprehensive online ADMET prediction platform enhanced with broader coverage, improved performance, API functionality and decision support",Nucleic Acids Research,2024,article,computational_biology,1,627.0,1260.0,209.38466448112797,1260,247.0103,True,True,post,admetlab30anupdatedcomprehensiveonlineadmetpredictionplatformenhancedwithbroadercoverageimprovedperformanceapifunctionalityanddecisionsupport,209.38466448112797,landmark,True | ||
| 838 | −3156458251,10.1093/nar/gkab301,,Interactive Tree Of Life (iTOL) v5: an online tool for phylogenetic tree display and annotation,Nucleic Acids Research,2021,article,computational_biology,2,1857.0,4291.0,249.05241916110123,11124,520.9954,True,True,baseline,249.05241916110123,landmark,True | 838 | +3168436232,10.1021/acs.jcim.1c00203,,"AutoDock Vina 1.2.0: New Docking Methods, Expanded Force Field, and Python Bindings",Journal of Chemical Information and Modeling,2021,article,computational_biology,2,340.0,1300.0,209.2664690527806,7546,373.4067,True,True,baseline,autodockvina120newdockingmethodsexpandedforcefieldandpythonbindings,209.2664690527806,landmark,True | ||
| 839 | −4307468223,10.1093/nar/gkac956,,PubChem 2023 update,Nucleic Acids Research,2022,article,computational_biology,1,388.0,1481.0,240.13678570600197,3385,333.84,True,True,baseline,240.13678570600197,landmark,True | 839 | +2899070097,10.1093/nar/gky1033,,PubChem 2019 update: improved access to chemical data,Nucleic Acids Research,2018,article,computational_biology,1,200.0,819.0,194.80273384490118,3238,270.9191,True,True,baseline,pubchem2019updateimprovedaccesstochemicaldata,194.80273384490118,landmark,True | ||
| 840 | −7119529911,10.1126/science.ads9530,,Deep contrastive learning enables genome-wide virtual screening,Science,2026,article,computational_biology,3,62.0,62.0,175.0637411130179,62,220.9602,True,True,post,220.42367591809082,landmark,True | 840 | +3011072970,10.1038/s41421-020-0153-3,,Network-based drug repurposing for novel coronavirus 2019-nCoV/SARS-CoV-2,Cell Discovery,2020,article,computational_biology,1,1057.0,1266.0,186.408931286412,1597,164.9683,True,True,baseline,networkbaseddrugrepurposingfornovelcoronavirus2019ncovsarscov2,186.408931286412,landmark,True | ||
| 841 | −4393936599,10.1093/nar/gkae236,,"ADMETlab 3.0: an updated comprehensive online ADMET prediction platform enhanced with broader coverage, improved performance, API functionality and decision support",Nucleic Acids Research,2024,article,computational_biology,1,627.0,1260.0,209.38466448112797,1260,247.0103,True,True,post,209.38466448112797,landmark,True | 841 | +3211795435,10.1093/nar/gkab1061,,AlphaFold Protein Structure Database: massively expanding the structural coverage of protein-sequence space with high-accuracy models,Nucleic Acids Research,2021,article,computational_biology,3,944.0,3084.0,178.99735742084275,7770,355.1571,True,True,baseline,alphafoldproteinstructuredatabasemassivelyexpandingthestructuralcoverageofproteinsequencespacewithhighaccuracymodels,178.99735742084275,landmark,True | ||
| 842 | −3168436232,10.1021/acs.jcim.1c00203,,"AutoDock Vina 1.2.0: New Docking Methods, Expanded Force Field, and Python Bindings",Journal of Chemical Information and Modeling,2021,article,computational_biology,2,340.0,1300.0,209.2664690527806,7546,373.4067,True,True,baseline,209.2664690527806,landmark,True | 842 | +3098269892,10.17863/cam.34134,,Automatic Chemical Design Using a Data-Driven Continuous Representation of Molecules.,Cambridge University Engineering Department Publications Database,2018,article,computational_biology,3,417.0,752.0,178.86649066100819,1703,200.0824,True,True,baseline,automaticchemicaldesignusingadatadrivencontinuousrepresentationofmolecules,178.86649066100819,landmark,True | ||
| 843 | −2899070097,10.1093/nar/gky1033,,PubChem 2019 update: improved access to chemical data,Nucleic Acids Research,2018,article,computational_biology,1,200.0,819.0,194.80273384490118,3238,270.9191,True,True,baseline,194.80273384490118,landmark,True | 843 | +4307425304,10.1093/nar/gkac963,,KEGG for taxonomy-based analysis of pathways and genomes,Nucleic Acids Research,2022,article,computational_biology,1,1600.0,3498.0,177.7903434574516,5752,391.9436,True,True,baseline,keggfortaxonomybasedanalysisofpathwaysandgenomes,177.7903434574516,landmark,True | ||
| 844 | −3011072970,10.1038/s41421-020-0153-3,,Network-based drug repurposing for novel coronavirus 2019-nCoV/SARS-CoV-2,Cell Discovery,2020,article,computational_biology,1,1057.0,1266.0,186.408931286412,1597,164.9683,True,True,baseline,186.408931286412,landmark,True | 844 | +4400581728,10.1021/acs.jmedchem.4c01122,,An Update on the Nitrogen Heterocycle Compositions and Properties of U.S. FDA-Approved Pharmaceuticals (2013–2023),Journal of Medicinal Chemistry,2024,article,computational_biology,2,536.0,1064.0,176.8137166729525,1064,208.5864,True,False,post,anupdateonthenitrogenheterocyclecompositionsandpropertiesofusfdaapprovedpharmaceuticals20132023,176.8137166729525,landmark,True | ||
| 845 | −3211795435,10.1093/nar/gkab1061,,AlphaFold Protein Structure Database: massively expanding the structural coverage of protein-sequence space with high-accuracy models,Nucleic Acids Research,2021,article,computational_biology,3,944.0,3084.0,178.99735742084275,7770,355.1571,True,True,baseline,178.99735742084275,landmark,True | 845 | +4388522045,10.1371/journal.pone.0294236,,SRplot: A free online platform for data visualization and graphing,PLoS ONE,2023,article,computational_biology,2,537.0,1676.0,174.5922042929299,2536,232.667,True,True,post,srplotafreeonlineplatformfordatavisualizationandgraphing,174.5922042929299,landmark,True | ||
| 846 | −3098269892,10.17863/cam.34134,,Automatic Chemical Design Using a Data-Driven Continuous Representation of Molecules.,Cambridge University Engineering Department Publications Database,2018,article,computational_biology,3,417.0,752.0,178.86649066100819,1703,200.0824,True,True,baseline,178.86649066100819,landmark,True | 846 | +4388615774,10.1093/nar/gkad976,,DrugBank 6.0: the DrugBank Knowledgebase for 2024,Nucleic Acids Research,2023,article,computational_biology,2,254.0,1086.0,165.7163852004641,1727,228.2125,True,True,post,drugbank60thedrugbankknowledgebasefor2024,165.7163852004641,landmark,True | ||
| 847 | −4307425304,10.1093/nar/gkac963,,KEGG for taxonomy-based analysis of pathways and genomes,Nucleic Acids Research,2022,article,computational_biology,1,1600.0,3498.0,177.7903434574516,5752,391.9436,True,True,baseline,177.7903434574516,landmark,True | 847 | +4309506674,10.1093/nar/gkac1052,,UniProt: the Universal Protein Knowledgebase in 2023,Nucleic Acids Research,2022,article,computational_biology,1,932.0,3250.0,165.18542488185184,6940,383.312,True,True,baseline,uniprottheuniversalproteinknowledgebasein2023,165.18542488185184,landmark,True | ||
| 848 | −7118182048,10.1038/s41591-025-04060-4,,AI-enabled virtual spatial proteomics from histopathology for interpretable biomarker discovery in lung cancer,Nature Medicine,2026,article,computational_biology,2,50.0,50.0,55.6400765943535,50,180.6309,True,True,post,177.76102896620228,landmark,True | 848 | +4220831425,10.1093/nar/gkac194,,DAVID: a web server for functional enrichment analysis and functional annotation of gene lists (2021 update),Nucleic Acids Research,2022,article,computational_biology,1,1461.0,3170.0,161.11932211552934,6142,356.4505,True,True,baseline,davidawebserverforfunctionalenrichmentanalysisandfunctionalannotationofgenelists2021update,161.11932211552934,landmark,True | ||
| 849 | −4400581728,10.1021/acs.jmedchem.4c01122,,An Update on the Nitrogen Heterocycle Compositions and Properties of U.S. FDA-Approved Pharmaceuticals (2013–2023),Journal of Medicinal Chemistry,2024,article,computational_biology,2,536.0,1064.0,176.8137166729525,1064,208.5864,True,False,post,176.8137166729525,landmark,True | 849 | +7119529911,10.1126/science.ads9530,,Deep contrastive learning enables genome-wide virtual screening,Science,2026,article,computational_biology,3,62.0,62.0,175.0637411130179,62,220.9602,True,True,post,deepcontrastivelearningenablesgenomewidevirtualscreening,157.19916555583544,landmark,True | ||
| 850 | −4388522045,10.1371/journal.pone.0294236,,SRplot: A free online platform for data visualization and graphing,PLoS ONE,2023,article,computational_biology,2,537.0,1676.0,174.5922042929299,2536,232.667,True,True,post,174.5922042929299,landmark,True | 850 | +4302307901,10.48550/arxiv.2210.01776,2210.01776,"DiffDock: Diffusion Steps, Twists, and Turns for Molecular Docking",arXiv (Cornell University),2022,preprint,computational_biology,3,61.0,159.0,155.85750717245776,339,,True,True,baseline,diffdockdiffusionstepstwistsandturnsformoleculardocking,155.85750717245776,landmark,True | ||
| 851 | −7139978436,10.1093/bioinformatics/btag129,,Whole-genome prediction of bacterial pathogenic capacity on novel bacteria using protein language models with PathogenFinder2,Bioinformatics,2026,article,computational_biology,2,48.0,48.0,64.58550316678397,48,73.0121,True,True,post,170.6505878075542,landmark,True | 851 | +2927961455,10.1093/nar/gkz239,,Interactive Tree Of Life (iTOL) v4: recent updates and new developments,Nucleic Acids Research,2019,article,computational_biology,3,1166.0,2754.0,153.24396298061907,5925,277.073,True,True,baseline,interactivetreeoflifeitolv4recentupdatesandnewdevelopments,153.24396298061907,landmark,True | ||
| 852 | −4221151978,10.1145/3528223.3530127,2201.05989,Instant neural graphics primitives with a multiresolution hash encoding,ACM Transactions on Graphics,2022,article,computer_graphics,6,704.0,2033.0,763.1175545066307,4114,1035.1766,True,True,baseline,763.1175545066307,landmark,True | 852 | +4221151978,10.1145/3528223.3530127,2201.05989,Instant neural graphics primitives with a multiresolution hash encoding,ACM Transactions on Graphics,2022,article,computer_graphics,6,704.0,2033.0,763.1175545066307,4114,1035.1766,True,True,baseline,instantneuralgraphicsprimitiveswithamultiresolutionhashencoding,763.1175545066307,landmark,True | ||
| 853 | −1483393136,10.82444/warw.33661294,,Advanced high dynamic range imaging : theory and practice,CERN Document Server (European Organization for Nuclear Research),2026,article,computer_graphics,2,214.0,214.0,573.5984721161192,216,3.1163,True,True,post,760.8172039753458,landmark,True | 853 | +1483393136,10.82444/warw.33661294,,Advanced high dynamic range imaging : theory and practice,CERN Document Server (European Organization for Nuclear Research),2026,article,computer_graphics,2,214.0,214.0,573.5984721161192,216,3.1163,True,True,post,advancedhighdynamicrangeimagingtheoryandpractice,542.5906682088513,landmark,True | ||
| 854 | −2910683382,,,Real-Time Simulation and Rendering of 3D Fluids,,2018,dissertation,computer_graphics,2,26.0,26.0,526.90625,62,,False,False,baseline,526.90625,landmark,True | 854 | +2910683382,,,Real-Time Simulation and Rendering of 3D Fluids,,2018,dissertation,computer_graphics,2,26.0,26.0,526.90625,62,,False,False,baseline,realtimesimulationandrenderingof3dfluids,526.90625,landmark,True | ||
| 855 | −4385318467,10.1145/3592433,2308.04079,3D Gaussian Splatting for Real-Time Radiance Field Rendering,ACM Transactions on Graphics,2023,article,computer_graphics,2,1016.0,3644.0,395.070873513716,5862,825.8872,True,True,post,395.070873513716,landmark,True | 855 | +4385318467,10.1145/3592433,2308.04079,3D Gaussian Splatting for Real-Time Radiance Field Rendering,ACM Transactions on Graphics,2023,article,computer_graphics,2,1016.0,3644.0,395.070873513716,5862,825.8872,True,True,post,3dgaussiansplattingforrealtimeradiancefieldrendering,395.070873513716,landmark,True | ||
| 856 | −3128261063,10.21105/joss.03021,,seaborn: statistical data visualization,The Journal of Open Source Software,2021,article,computer_graphics,3,1232.0,2401.0,279.8183504232003,7190,347.307,True,True,baseline,279.8183504232003,landmark,True | 856 | +3128261063,10.21105/joss.03021,,seaborn: statistical data visualization,The Journal of Open Source Software,2021,article,computer_graphics,3,1232.0,2401.0,279.8183504232003,7190,347.307,True,True,baseline,seabornstatisticaldatavisualization,279.8183504232003,landmark,True | ||
| 857 | −4390723081,10.1145/3807511,2401.03890,A Survey on 3D Gaussian Splatting,ACM Computing Surveys,2026,article,computer_graphics,3,67.0,67.0,121.09388038942977,67,72.919,True,True,post,238.19977881471107,landmark,True | 857 | +1506965148,10.2312/14803,,Mastering the Information Age Solving Problems with Visual Analytics,University of Groningen research database (University of Groningen / Centre for Information Technology),2022,book-chapter,computer_graphics,2,513.0,517.0,220.7091108671789,552,15.8992,True,True,post,masteringtheinformationagesolvingproblemswithvisualanalytics,220.7091108671789,landmark,True | ||
| 858 | −1506965148,10.2312/14803,,Mastering the Information Age Solving Problems with Visual Analytics,University of Groningen research database (University of Groningen / Centre for Information Technology),2022,book-chapter,computer_graphics,2,513.0,517.0,220.7091108671789,552,15.8992,True,True,post,220.7091108671789,landmark,True | 858 | +4231645407,10.2307/j.ctv65sx8p.8,,The Fastest Texture Mapping in Town:,University of Michigan Press eBooks,2018,book-chapter,computer_graphics,2,62.0,66.0,186.86419753086417,107,78.4444,False,False,baseline,thefastesttexturemappingintown,186.86419753086417,landmark,True | ||
| 859 | −4231645407,10.2307/j.ctv65sx8p.8,,The Fastest Texture Mapping in Town:,University of Michigan Press eBooks,2018,book-chapter,computer_graphics,2,62.0,66.0,186.86419753086417,107,78.4444,False,False,baseline,186.86419753086417,landmark,True | 859 | +4390723081,10.1145/3807511,2401.03890,A Survey on 3D Gaussian Splatting,ACM Computing Surveys,2026,article,computer_graphics,3,67.0,67.0,121.09388038942977,67,72.919,True,True,post,asurveyon3dgaussiansplatting,169.8765176167899,landmark,True | ||
| 860 | −4252097634,10.1007/978-3-030-63416-2_778,,Statistical Shape Analysis,Springer eBooks,2021,book-chapter,computer_graphics,2,221.0,229.0,149.26305916305915,416,20.1122,False,False,baseline,149.26305916305915,landmark,True | 860 | +3016007010,10.1111/cgf.14022,2004.03805,State of the Art on Neural Rendering,Computer Graphics Forum,2020,article,computer_graphics,3,129.0,213.0,133.21172638436482,430,143.0402,True,True,baseline,stateoftheartonneuralrendering,133.21172638436482,landmark,True | ||
| 861 | −3016007010,10.1111/cgf.14022,2004.03805,State of the Art on Neural Rendering,Computer Graphics Forum,2020,article,computer_graphics,3,129.0,213.0,133.21172638436482,430,143.0402,True,True,baseline,133.21172638436482,landmark,True | 861 | +3163641770,10.2172/1782521,,Metric Type in the Target-matrix Mesh Optimization Paradigm,,2020,report,computer_graphics,3,2.0,6.0,112.49999999999999,9,,True,True,baseline,metrictypeinthetargetmatrixmeshoptimizationparadigm,112.49999999999999,landmark,True | ||
| 862 | −232012359,10.1109/mm.2020.2996321,,IEEE Computer Graphics and Applications,IEEE Micro,2020,article,computer_graphics,2,181.0,195.0,121.95439739413682,397,51.1209,False,True,baseline,121.95439739413682,landmark,True | 862 | +4385289063,10.1145/3592426,2302.12249,MERF: Memory-Efficient Radiance Fields for Real-time View Synthesis in Unbounded Scenes,ACM Transactions on Graphics,2023,article,computer_graphics,2,114.0,172.0,102.18535708938464,199,115.9383,True,True,post,merfmemoryefficientradiancefieldsforrealtimeviewsynthesisinunboundedscenes,102.18535708938464,landmark,True | ||
| 863 | −4200150166,10.1145/3503250,,NeRF,Communications of the ACM,2021,article,computer_graphics,2,145.0,900.0,113.85132582911535,6744,366.1947,True,True,baseline,113.85132582911535,landmark,True | 863 | +7151814497,10.70675/339cd785z4790z4c97zb09dze298711dbccf,,Designing tools for 3D content authoring based on 3D sketching,,2023,dissertation,computer_graphics,2,0.0,2.0,98.75,2,,True,True,post,designingtoolsfor3dcontentauthoringbasedon3dsketching,98.75,landmark,True | ||
| 864 | −3163641770,10.2172/1782521,,Metric Type in the Target-matrix Mesh Optimization Paradigm,,2020,report,computer_graphics,3,2.0,6.0,112.49999999999999,9,,True,True,baseline,112.49999999999999,landmark,True | 864 | +4385482704,10.1145/3596711.3596766,,Photo tourism: exploring photo collections in 3D,ACM eBooks,2023,book-chapter,computer_graphics,2,184.0,195.0,93.00658376005852,222,25.2247,True,False,post,phototourismexploringphotocollectionsin3d,93.00658376005852,landmark,True | ||
| 865 | −4385289063,10.1145/3592426,2302.12249,MERF: Memory-Efficient Radiance Fields for Real-time View Synthesis in Unbounded Scenes,ACM Transactions on Graphics,2023,article,computer_graphics,2,114.0,172.0,102.18535708938464,199,115.9383,True,True,post,102.18535708938464,landmark,True | 865 | +2478400128,10.26190/unsworks/9223,,Raster scan computer graphics and incremental computing systems,"UNSWorks (University of New South Wales, Sydney, Australia)",2022,dissertation,computer_graphics,3,1.0,1.0,89.2,3,,False,True,baseline,rasterscancomputergraphicsandincrementalcomputingsystems,89.2,landmark,True | ||
| 866 | −7151814497,10.70675/339cd785z4790z4c97zb09dze298711dbccf,,Designing tools for 3D content authoring based on 3D sketching,,2023,dissertation,computer_graphics,2,0.0,2.0,98.75,2,,True,True,post,98.75,landmark,True | 866 | +3113347918,10.1109/iccv48922.2021.01245,2012.03918,NeRD: Neural Reflectance Decomposition from Image Collections,IEEE/CVF International Conference on Computer Vision (ICCV),2021,conference-paper,computer_graphics,2,90.0,203.0,84.667495854063,438,99.214,True,True,baseline,nerdneuralreflectancedecompositionfromimagecollections,84.667495854063,landmark,True | ||
| 867 | −4385482704,10.1145/3596711.3596766,,Photo tourism: exploring photo collections in 3D,ACM eBooks,2023,book-chapter,computer_graphics,2,184.0,195.0,93.00658376005852,222,25.2247,True,False,post,93.00658376005852,landmark,True | 867 | +2978950353,10.33153/citrawira.v1i1.3299,,PERANCANGAN POP UP BOOK AND SOUND TEMBANG DOLANAN SEBAGAI MEDIA PENGENALAN ALAT MUSIK GAMELAN,Institutional Repository ISI Surakarta (Institut Seni Indonesia Surakarta),2020,dissertation,computer_graphics,1,1.0,3.0,81.7,4,,True,False,baseline,perancanganpopupbookandsoundtembangdolanansebagaimediapengenalanalatmusikgamelan,81.7,landmark,True | ||
| 868 | −2478400128,10.26190/unsworks/9223,,Raster scan computer graphics and incremental computing systems,"UNSWorks (University of New South Wales, Sydney, Australia)",2022,dissertation,computer_graphics,3,1.0,1.0,89.2,3,,False,True,baseline,89.2,landmark,True | 868 | +4402660132,10.1109/cvpr52733.2024.00813,2312.16812,Spacetime Gaussian Feature Splatting for Real-Time Dynamic View Synthesis,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2024,conference-paper,computer_graphics,2,110.0,208.0,77.27933949282485,208,83.0854,True,True,post,spacetimegaussianfeaturesplattingforrealtimedynamicviewsynthesis,77.27933949282485,landmark,True | ||
| 869 | −7124433690,10.1145/3789201,2406.01467,RaDe-GS: Rasterizing Depth in Gaussian Splatting,ACM Transactions on Graphics,2026,article,computer_graphics,2,25.0,25.0,45.18428372739917,25,36.4595,True,True,post,88.88051448310114,landmark,True | 869 | +2902812770,10.1145/3272127.3275109,,Differentiable Monte Carlo ray tracing through edge sampling,ACM Transactions on Graphics,2018,article,computer_graphics,5,38.0,105.0,75.6115107913669,428,97.9479,True,True,baseline,differentiablemontecarloraytracingthroughedgesampling,75.6115107913669,landmark,True | ||
| 870 | −3144501610,,,Differentiable visual computing,DSpace@MIT (Massachusetts Institute of Technology),2019,dissertation,computer_graphics,2,2.0,4.0,88.8135593220339,3,,True,True,baseline,88.8135593220339,landmark,True | 870 | +4396833408,10.1007/s10660-024-09855-0,,Integration of artificial intelligence technology and visual communication design in metaverse e-commerce and its potential opportunities,Electronic Commerce Research,2024,book-chapter,computer_graphics,2,10.0,17.0,73.82191780821917,17,84.1119,False,False,post,integrationofartificialintelligencetechnologyandvisualcommunicationdesigninmetaverseecommerceanditspotentialopportunities,73.82191780821917,landmark,True | ||
| 871 | −3113347918,10.1109/iccv48922.2021.01245,2012.03918,NeRD: Neural Reflectance Decomposition from Image Collections,IEEE/CVF International Conference on Computer Vision (ICCV),2021,conference-paper,computer_graphics,2,90.0,203.0,84.667495854063,438,99.214,True,True,baseline,84.667495854063,landmark,True | 871 | +2942551262,10.1145/3306346.3323008,1905.00824,Single image portrait relighting,ACM Transactions on Graphics,2019,article,computer_graphics,2,41.0,103.0,72.34294926183607,259,80.372,True,True,baseline,singleimageportraitrelighting,72.34294926183607,landmark,True | ||
| 872 | −2986023562,10.1145/3355089.3356498,,Mitsuba 2,ACM Transactions on Graphics,2019,article,computer_graphics,7,41.0,120.0,84.28304768369252,404,109.5482,True,True,baseline,84.28304768369252,landmark,True | 872 | +3135538239,10.1007/978-3-030-92540-6_7,2103.04183,HexDom: Polycube-Based Hexahedral-Dominant Mesh Generation,SEMA SIMAI Springer series,2022,book-chapter,computer_graphics,3,17.0,21.0,69.5427135678392,25,60.724,False,True,baseline,hexdompolycubebasedhexahedraldominantmeshgeneration,69.5427135678392,landmark,True | ||
| 873 | −2978950353,10.33153/citrawira.v1i1.3299,,PERANCANGAN POP UP BOOK AND SOUND TEMBANG DOLANAN SEBAGAI MEDIA PENGENALAN ALAT MUSIK GAMELAN,Institutional Repository ISI Surakarta (Institut Seni Indonesia Surakarta),2020,dissertation,computer_graphics,1,1.0,3.0,81.7,4,,True,False,baseline,81.7,landmark,True | 873 | +2972175553,10.1029/2019gc008515,,The Generic Mapping Tools Version 6,Geochemistry Geophysics Geosystems,2019,article,computer_graphics,3,99.0,447.0,67.9687872664635,3192,104.5271,True,True,baseline,thegenericmappingtoolsversion6,67.9687872664635,landmark,True | ||
| 874 | −3115857147,10.2312/pg.20201223,,Illumination Space: A Feature Space for Radiance Maps,ResearchArchive–Te Puna Rangahau (Victoria University of Wellington),2020,dissertation,computer_graphics,1,1.0,3.0,81.7,3,,True,True,baseline,81.7,landmark,True | 874 | +2202024431,10.1201/9781003059325-5,,Signed Distance Fields for Polygon Soup Meshes,A K Peters/CRC Press eBooks,2020,book-chapter,computer_graphics,3,34.0,35.0,67.15547703180212,39,32.903,True,False,baseline,signeddistancefieldsforpolygonsoupmeshes,67.15547703180212,landmark,True | ||
| 875 | −4402660132,10.1109/cvpr52733.2024.00813,2312.16812,Spacetime Gaussian Feature Splatting for Real-Time Dynamic View Synthesis,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2024,conference-paper,computer_graphics,2,110.0,208.0,77.27933949282485,208,83.0854,True,True,post,77.27933949282485,landmark,True | 875 | +2521773018,10.17615/3myy-vc96,,Efficient computation of discrete Voronoi diagram and homotopy-preserving simplified medial axis of a 3d polyhedron,Carolina Digital Repository (University of North Carolina at Chapel Hill),2019,dissertation,computer_graphics,4,3.0,3.0,66.61016949152543,3,,True,True,baseline,efficientcomputationofdiscretevoronoidiagramandhomotopypreservingsimplifiedmedialaxisofa3dpolyhedron,66.61016949152543,landmark,True | ||
| 876 | −2885324189,10.1145/3341156,,Neural Importance Sampling,ACM Transactions on Graphics,2019,article,computer_graphics,3,52.0,110.0,77.25946037671814,321,80.9225,True,True,baseline,77.25946037671814,landmark,True | 876 | +3045012476,10.70675/aa144e03zf76fz490bzab50ze72464fe07f4,,Kinetic data structures for the geometric modeling of urban environments,,2019,dissertation,computer_graphics,3,2.0,3.0,66.61016949152543,3,,True,True,baseline,kineticdatastructuresforthegeometricmodelingofurbanenvironments,66.61016949152543,landmark,True | ||
| 877 | −4408302972,10.3390/educsci15030343,,The Impact of Artificial Intelligence (AI) on Students’ Academic Development,Education Sciences,2025,article,privacy_preserving_computation,1,469.0,469.0,407.18625178855723,469,511.2876,True,True,post,237.43540293645432,landmark,True | 877 | +4408302972,10.3390/educsci15030343,,The Impact of Artificial Intelligence (AI) on Students’ Academic Development,Education Sciences,2025,article,privacy_preserving_computation,1,469.0,469.0,407.18625178855723,469,511.2876,True,True,post,theimpactofartificialintelligenceaionstudentsacademicdevelopment,204.93966523196156,landmark,True | ||
| 878 | −2912213068,10.1145/3298981,,Federated Machine Learning,ACM Transactions on Intelligent Systems and Technology,2019,article,privacy_preserving_computation,5,504.0,1382.0,210.14063535179542,6223,251.7631,True,False,baseline,210.14063535179542,landmark,True | 878 | +7127055292,10.3389/feduc.2025.1648661,,Artificial intelligence in higher education: a systematic review of its impact on student engagement and the mediating role of teaching methods,Frontiers in Education,2026,review,privacy_preserving_computation,1,54.0,54.0,102.8810408921933,54,112.4196,True,True,post,artificialintelligenceinhighereducationasystematicreviewofitsimpactonstudentengagementandthemediatingroleofteachingmethods,136.9154022583083,landmark,True | ||
| 879 | −7127055292,10.3389/feduc.2025.1648661,,Artificial intelligence in higher education: a systematic review of its impact on student engagement and the mediating role of teaching methods,Frontiers in Education,2026,review,privacy_preserving_computation,1,54.0,54.0,102.8810408921933,54,112.4196,True,True,post,191.98191128349848,landmark,True | 879 | +3036422000,10.1109/access.2020.3010226,2006.10306,A Survey of COVID-19 Contact Tracing Apps,IEEE Access,2020,article,privacy_preserving_computation,4,302.0,443.0,128.99802950839438,582,117.8531,True,True,baseline,asurveyofcovid19contacttracingapps,128.99802950839438,landmark,True | ||
| 880 | −3036422000,10.1109/access.2020.3010226,2006.10306,A Survey of COVID-19 Contact Tracing Apps,IEEE Access,2020,article,privacy_preserving_computation,4,302.0,443.0,128.99802950839438,582,117.8531,True,True,baseline,128.99802950839438,landmark,True | 880 | +4302383326,,,Private Information Retrieval with Side Information,OakTrust (Texas A&M University Libraries),2018,dissertation,privacy_preserving_computation,5,24.0,28.0,124.06412825651303,28,,True,True,baseline,privateinformationretrievalwithsideinformation,124.06412825651303,landmark,True | ||
| 881 | −4302383326,,,Private Information Retrieval with Side Information,OakTrust (Texas A&M University Libraries),2018,dissertation,privacy_preserving_computation,5,24.0,28.0,124.06412825651303,28,,True,True,baseline,124.06412825651303,landmark,True | 881 | +3014084098,10.48550/arxiv.2003.11511,2003.11511,Contact Tracing Mobile Apps for COVID-19: Privacy Considerations and Related Trade-offs,arXiv (Cornell University),2020,preprint,privacy_preserving_computation,2,247.0,307.0,112.68777120315582,350,,True,True,baseline,contacttracingmobileappsforcovid19privacyconsiderationsandrelatedtradeoffs,112.68777120315582,landmark,True | ||
| 882 | −7137155252,10.1145/3801079,,Differentially Private Federated Learning: A Systematic Review,ACM Computing Surveys,2026,review,privacy_preserving_computation,4,33.0,33.0,37.86734693877551,21,27.926,True,True,post,117.32227911769351,landmark,True | 882 | +3013489453,10.1038/s41591-020-0832-5,,On the responsible use of digital data to tackle the COVID-19 pandemic,Nature Medicine,2020,article,privacy_preserving_computation,1,284.0,368.0,107.15863399342919,488,96.9324,False,True,baseline,ontheresponsibleuseofdigitaldatatotacklethecovid19pandemic,107.15863399342919,landmark,True | ||
| 883 | −3014084098,10.48550/arxiv.2003.11511,2003.11511,Contact Tracing Mobile Apps for COVID-19: Privacy Considerations and Related Trade-offs,arXiv (Cornell University),2020,preprint,privacy_preserving_computation,2,247.0,307.0,112.68777120315582,350,,True,True,baseline,112.68777120315582,landmark,True | 883 | +3021970994,10.2196/19857,,Acceptability of App-Based Contact Tracing for COVID-19: Cross-Country Survey Study,JMIR mhealth and uhealth,2020,article,privacy_preserving_computation,2,171.0,290.0,84.4456626578654,402,81.5906,True,True,baseline,acceptabilityofappbasedcontacttracingforcovid19crosscountrysurveystudy,84.4456626578654,landmark,True | ||
| 884 | −3013489453,10.1038/s41591-020-0832-5,,On the responsible use of digital data to tackle the COVID-19 pandemic,Nature Medicine,2020,article,privacy_preserving_computation,1,284.0,368.0,107.15863399342919,488,96.9324,False,True,baseline,107.15863399342919,landmark,True | 884 | +7137155252,10.1145/3801079,,Differentially Private Federated Learning: A Systematic Review,ACM Computing Surveys,2026,review,privacy_preserving_computation,4,33.0,33.0,37.86734693877551,21,27.926,True,True,post,differentiallyprivatefederatedlearningasystematicreview,83.6705236022995,landmark,True | ||
| 885 | −4414891672,10.1038/s41746-025-02280-z,2506.00660,"Differential privacy for medical deep learning: methods, tradeoffs, and deployment implications",npj Digital Medicine,2026,article,privacy_preserving_computation,5,29.0,29.0,32.27124442472503,29,104.7659,True,True,post,103.10139680039732,landmark,True | 885 | +4407111324,10.3389/fpsyg.2025.1498132,,Exploring the effects of artificial intelligence on student and academic well-being in higher education: a mini-review,Frontiers in Psychology,2025,review,privacy_preserving_computation,1,190.0,190.0,29.307559598494354,190,32.5824,True,True,post,exploringtheeffectsofartificialintelligenceonstudentandacademicwellbeinginhighereducationaminireview,83.02459785516567,landmark,True | ||
| 886 | −4407111324,10.3389/fpsyg.2025.1498132,,Exploring the effects of artificial intelligence on student and academic well-being in higher education: a mini-review,Frontiers in Psychology,2025,review,privacy_preserving_computation,1,190.0,190.0,29.307559598494354,190,32.5824,True,True,post,96.18918242628213,landmark,True | 886 | +4406636601,10.1016/j.accinf.2025.100734,,Challenges and opportunities for artificial intelligence in auditing: Evidence from the field,International Journal of Accounting Information Systems,2025,article,privacy_preserving_computation,2,183.0,183.0,31.465784036766877,183,92.2647,True,True,post,challengesandopportunitiesforartificialintelligenceinauditingevidencefromthefield,79.9657968815543,landmark,True | ||
| 887 | −7135198685,10.1098/rsos.250959,,Breaking interprovincial data silos: how federated learning can unlock Canada's public health potential,Royal Society Open Science,2026,article,privacy_preserving_computation,3,27.0,27.0,30.045641360950892,27,46.964,True,True,post,95.99095564174924,landmark,True | 887 | +4286110439,10.1515/9783839459249-009,,»Ohne die geht’s nicht« Zur Rolle von Apple und Google bei der Corona-Warn-App,transcript Verlag eBooks,2022,book-chapter,privacy_preserving_computation,1,100.0,100.0,77.6986788965706,100,67.9524,True,True,baseline,ohnediegehtsnichtzurrollevonappleundgooglebeidercoronawarnapp,77.6986788965706,landmark,True | ||
| 888 | −4406636601,10.1016/j.accinf.2025.100734,,Challenges and opportunities for artificial intelligence in auditing: Evidence from the field,International Journal of Accounting Information Systems,2025,article,privacy_preserving_computation,2,183.0,183.0,31.465784036766877,183,92.2647,True,True,post,92.64537044215595,landmark,True | 888 | +4399027046,10.22024/unikent/01.02.102717,,Secure and Privacy-preserving Federated Learning with Explainable Artificial Intelligence for Smart Healthcare System,theses.fr (ABES),2023,dissertation,privacy_preserving_computation,5,8.0,9.0,74.86447638603696,9,,True,True,post,secureandprivacypreservingfederatedlearningwithexplainableartificialintelligenceforsmarthealthcaresystem,74.86447638603696,landmark,True | ||
| 889 | −2384897939,10.38007/978-1-80053-622-7,,Big Data Security and Privacy Protection,,2025,book,privacy_preserving_computation,2,171.0,171.0,127.25255832992222,171,0.0,True,False,post,86.57026418365392,landmark,True | 889 | +3018102029,10.1609/aaai.v36i8.20825,2004.12088,SplitFed: When Federated Learning Meets Split Learning,Proceedings of the AAAI Conference on Artificial Intelligence,2022,conference-paper,privacy_preserving_computation,7,202.0,373.0,74.10667093485475,720,85.2216,True,True,baseline,splitfedwhenfederatedlearningmeetssplitlearning,74.10667093485475,landmark,True | ||
| 890 | −7155564432,10.1109/isbdas69350.2026.11484374,,Privacy-Preserving Anomaly Detection in Cloud Services using Hierarchical Federated Learning with Differential Privacy,,2026,conference-paper,privacy_preserving_computation,6,24.0,24.0,184.20139553974553,24,221.8777,True,True,post,85.3252939037771,landmark,True | 890 | +4414891672,10.1038/s41746-025-02280-z,2506.00660,"Differential privacy for medical deep learning: methods, tradeoffs, and deployment implications",npj Digital Medicine,2026,article,privacy_preserving_computation,5,29.0,29.0,32.27124442472503,29,104.7659,True,True,post,differentialprivacyformedicaldeeplearningmethodstradeoffsanddeploymentimplications,73.52864195353592,landmark,True | ||
| 891 | −3021970994,10.2196/19857,,Acceptability of App-Based Contact Tracing for COVID-19: Cross-Country Survey Study,JMIR mhealth and uhealth,2020,article,privacy_preserving_computation,2,171.0,290.0,84.4456626578654,402,81.5906,True,True,baseline,84.4456626578654,landmark,True | 891 | +4205766150,10.1787/8f394636-en,,Tracking and tracing COVID: Protecting privacy and data while using apps and biometrics,OECD policy responses to coronavirus (Covid-19),2020,report,privacy_preserving_computation,2,124.0,130.0,72.61058109280138,139,,False,False,baseline,trackingandtracingcovidprotectingprivacyanddatawhileusingappsandbiometrics,72.61058109280138,landmark,True | ||
| 892 | −4412565294,10.1145/3749987,2209.02299,A Survey of Machine Unlearning,ACM Transactions on Intelligent Systems and Technology,2025,article,privacy_preserving_computation,7,164.0,164.0,55.86648716521469,164,47.4381,True,True,post,83.02645219952774,landmark,True | 892 | +4412565294,10.1145/3749987,2209.02299,A Survey of Machine Unlearning,ACM Transactions on Intelligent Systems and Technology,2025,article,privacy_preserving_computation,7,164.0,164.0,55.86648716521469,164,47.4381,True,True,post,asurveyofmachineunlearning,71.66333709603774,landmark,True | ||
| 893 | −7154488736,10.1109/iccsc67078.2026.11468534,,Predicting Mental Health Challenges Among University Students Using a Federated CNN-BiLSTM-Attention Framework,"International Conference on Computing, Sciences and Communications (ICCSC)",2026,conference-paper,privacy_preserving_computation,3,22.0,22.0,289.37333333333333,22,365.288,True,False,post,78.21485274512901,landmark,True | 893 | +2797770018,10.1016/j.future.2018.02.050,,A two-stage locality-sensitive hashing based approach for privacy-preserving mobile service recommendation in cross-platform edge environment,Future Generation Computer Systems,2018,article,privacy_preserving_computation,3,55.0,132.0,69.98601600461856,192,60.259,False,False,baseline,atwostagelocalitysensitivehashingbasedapproachforprivacypreservingmobileservicerecommendationincrossplatformedgeenvironment,69.98601600461856,landmark,True | ||
| 894 | −4286110439,10.1515/9783839459249-009,,»Ohne die geht’s nicht« Zur Rolle von Apple und Google bei der Corona-Warn-App,transcript Verlag eBooks,2022,book-chapter,privacy_preserving_computation,1,100.0,100.0,77.6986788965706,100,67.9524,True,True,baseline,77.6986788965706,landmark,True | 894 | +7135198685,10.1098/rsos.250959,,Breaking interprovincial data silos: how federated learning can unlock Canada's public health potential,Royal Society Open Science,2026,article,privacy_preserving_computation,3,27.0,27.0,30.045641360950892,27,46.964,True,True,post,breakinginterprovincialdatasiloshowfederatedlearningcanunlockcanadaspublichealthpotential,68.45770112915415,landmark,True | ||
| 895 | −4399027046,10.22024/unikent/01.02.102717,,Secure and Privacy-preserving Federated Learning with Explainable Artificial Intelligence for Smart Healthcare System,theses.fr (ABES),2023,dissertation,privacy_preserving_computation,5,8.0,9.0,74.86447638603696,9,,True,True,post,74.86447638603696,landmark,True | 895 | +2799796316,10.1155/2018/3075849,,Privacy‐Aware Multidimensional Mobile Service Quality Prediction and Recommendation in Distributed Fog Environment,Wireless Communications and Mobile Computing,2018,article,privacy_preserving_computation,5,58.0,129.0,68.39542473178632,166,58.2504,True,True,baseline,privacyawaremultidimensionalmobileservicequalitypredictionandrecommendationindistributedfogenvironment,68.39542473178632,landmark,True | ||
| 896 | −3018102029,10.1609/aaai.v36i8.20825,2004.12088,SplitFed: When Federated Learning Meets Split Learning,Proceedings of the AAAI Conference on Artificial Intelligence,2022,conference-paper,privacy_preserving_computation,7,202.0,373.0,74.10667093485475,720,85.2216,True,True,baseline,74.10667093485475,landmark,True | 896 | +3016632787,10.1109/tifs.2020.2988575,1911.00222,Federated Learning With Differential Privacy: Algorithms and Performance Analysis,IEEE Transactions on Information Forensics and Security,2020,article,privacy_preserving_computation,8,206.0,490.0,61.28715445275716,2379,83.9132,True,True,baseline,federatedlearningwithdifferentialprivacyalgorithmsandperformanceanalysis,61.28715445275716,landmark,True | ||
| 897 | −4205766150,10.1787/8f394636-en,,Tracking and tracing COVID: Protecting privacy and data while using apps and biometrics,OECD policy responses to coronavirus (Covid-19),2020,report,privacy_preserving_computation,2,124.0,130.0,72.61058109280138,139,,False,False,baseline,72.61058109280138,landmark,True | 897 | +7155564432,10.1109/isbdas69350.2026.11484374,,Privacy-Preserving Anomaly Detection in Cloud Services using Hierarchical Federated Learning with Differential Privacy,,2026,conference-paper,privacy_preserving_computation,6,24.0,24.0,184.20139553974553,24,221.8777,True,True,post,privacypreservinganomalydetectionincloudservicesusinghierarchicalfederatedlearningwithdifferentialprivacy,60.851289892581455,landmark,True | ||
| 898 | −7125591879,10.1109/tii.2025.3649540,,Privacy Protection-Enhanced Vertical-Horizontal Federated Learning Secure Sharing for Multisource Heterogeneous Data,IEEE Transactions on Industrial Informatics,2026,article,privacy_preserving_computation,4,20.0,20.0,22.2560306377414,20,72.2524,False,False,post,71.10441158648091,landmark,True | 898 | +4389365236,10.3390/educsci13121216,,Adaptive Learning Using Artificial Intelligence in e-Learning: A Literature Review,Education Sciences,2023,article,privacy_preserving_computation,1,200.0,642.0,58.93867484628822,957,83.985,True,True,post,adaptivelearningusingartificialintelligenceinelearningaliteraturereview,58.93867484628822,landmark,True | ||
| 899 | −2797770018,10.1016/j.future.2018.02.050,,A two-stage locality-sensitive hashing based approach for privacy-preserving mobile service recommendation in cross-platform edge environment,Future Generation Computer Systems,2018,article,privacy_preserving_computation,3,55.0,132.0,69.98601600461856,192,60.259,False,False,baseline,69.98601600461856,landmark,True | 899 | +3041977451,,,Analyzing adoption of contact tracing apps using UTAUT,,2020,dissertation,privacy_preserving_computation,1,1.0,6.0,56.4292343387471,7,,True,False,baseline,analyzingadoptionofcontacttracingappsusingutaut,56.4292343387471,landmark,True | ||
| 900 | −2799796316,10.1155/2018/3075849,,Privacy‐Aware Multidimensional Mobile Service Quality Prediction and Recommendation in Distributed Fog Environment,Wireless Communications and Mobile Computing,2018,article,privacy_preserving_computation,5,58.0,129.0,68.39542473178632,166,58.2504,True,True,baseline,68.39542473178632,landmark,True | 900 | +7154488736,10.1109/iccsc67078.2026.11468534,,Predicting Mental Health Challenges Among University Students Using a Federated CNN-BiLSTM-Attention Framework,"International Conference on Computing, Sciences and Communications (ICCSC)",2026,conference-paper,privacy_preserving_computation,3,22.0,22.0,289.37333333333333,22,365.288,True,False,post,predictingmentalhealthchallengesamonguniversitystudentsusingafederatedcnnbilstmattentionframework,55.78034906819967,landmark,True | ||
| 901 | −7147711523,10.1109/tie.2026.3672787,,Open-Circuit Fault Diagnosis for Power Converters Under Variable Operational Conditions: From a Source-Free Domain Adaptation Perspective,IEEE Transactions on Industrial Electronics,2026,article,privacy_preserving_computation,1,18.0,18.0,19.938921161825725,18,50.0378,True,False,post,63.99397042783282,landmark,True | 901 | +2790400697,10.1109/access.2018.2806881,,"A Survey on Big Data Market: Pricing, Trading and Protection",IEEE Access,2018,article,privacy_preserving_computation,5,60.0,105.0,55.670694549128406,356,61.4642,True,True,baseline,asurveyonbigdatamarketpricingtradingandprotection,55.670694549128406,landmark,True | ||
| 902 | −7125492275,10.1016/j.ress.2026.112271,,Source-free domain adaptation for cross-domain remaining useful life prediction: A distributed federated learning perspective,Reliability Engineering & System Safety,2026,article,federated_learning,1,34.0,34.0,37.662406639004146,34,94.5159,False,False,post,120.87749969701756,landmark,True | 902 | +7125492275,10.1016/j.ress.2026.112271,,Source-free domain adaptation for cross-domain remaining useful life prediction: A distributed federated learning perspective,Reliability Engineering & System Safety,2026,article,federated_learning,1,34.0,34.0,37.662406639004146,34,94.5159,False,False,post,sourcefreedomainadaptationforcrossdomainremainingusefullifepredictionadistributedfederatedlearningperspective,86.2059940144904,landmark,True | ||
| 903 | −4382463479,10.1609/aaai.v37i9.26330,2212.01197,FedALA: Adaptive Local Aggregation for Personalized Federated Learning,Proceedings of the AAAI Conference on Artificial Intelligence,2023,conference-paper,federated_learning,9,131.0,320.0,73.79786537022606,420,79.3941,True,True,post,73.79786537022606,landmark,True | 903 | +4382463479,10.1609/aaai.v37i9.26330,2212.01197,FedALA: Adaptive Local Aggregation for Personalized Federated Learning,Proceedings of the AAAI Conference on Artificial Intelligence,2023,conference-paper,federated_learning,9,131.0,320.0,73.79786537022606,420,79.3941,True,True,post,fedalaadaptivelocalaggregationforpersonalizedfederatedlearning,73.79786537022606,landmark,True | ||
| 904 | −4220990555,10.14711/thesis-991012994506603412,,Robust federated learning with attack-adaptive aggregation,,2021,dissertation,federated_learning,5,9.0,14.0,63.67692307692308,24,,True,False,baseline,63.67692307692308,landmark,True | 904 | +4220990555,10.14711/thesis-991012994506603412,,Robust federated learning with attack-adaptive aggregation,,2021,dissertation,federated_learning,5,9.0,14.0,63.67692307692308,24,,True,False,baseline,robustfederatedlearningwithattackadaptiveaggregation,63.67692307692308,landmark,True | ||
| 905 | −3133814152,10.1109/tnnls.2022.3160699,2103.00710,Towards Personalized Federated Learning,IEEE Transactions on Neural Networks and Learning Systems,2022,article,federated_learning,7,231.0,554.0,57.083945154517146,1182,74.5614,True,True,baseline,57.083945154517146,landmark,True | 905 | +3133814152,10.1109/tnnls.2022.3160699,2103.00710,Towards Personalized Federated Learning,IEEE Transactions on Neural Networks and Learning Systems,2022,article,federated_learning,7,231.0,554.0,57.083945154517146,1182,74.5614,True,True,baseline,towardspersonalizedfederatedlearning,57.083945154517146,landmark,True | ||
| 906 | −7159977201,10.1109/tmc.2026.3688489,,AsyncFed-SAR: Toward Communication-Efficient Asynchronous Federated Learning for SAR Image Target Recognition,IEEE Transactions on Mobile Computing,2026,article,federated_learning,3,16.0,16.0,17.80482451019312,16,57.8019,False,False,post,56.883529269184734,landmark,True | 906 | +3159080474,,,Federated Learning for Internet of Things: A Comprehensive Survey,Deakin Research Online (Deakin University),2021,article,federated_learning,4,142.0,416.0,48.48164672055449,894,61.8395,True,True,baseline,federatedlearningforinternetofthingsacomprehensivesurvey,48.48164672055449,landmark,True | ||
| 907 | −3123459983,10.1016/j.knosys.2021.106775,,A survey on federated learning,Knowledge-Based Systems,2021,article,federated_learning,3,153.0,433.0,50.46286786057715,1861,83.6289,False,False,baseline,50.46286786057715,landmark,True | 907 | +3100779497,10.1007/s41666-020-00082-4,1911.06270,Federated Learning for Healthcare Informatics,Journal of Healthcare Informatics Research,2020,article,federated_learning,2,140.0,343.0,42.90100811693001,1515,58.5309,False,True,baseline,federatedlearningforhealthcareinformatics,42.90100811693001,landmark,True | ||
| 908 | −3159080474,,,Federated Learning for Internet of Things: A Comprehensive Survey,Deakin Research Online (Deakin University),2021,article,federated_learning,4,142.0,416.0,48.48164672055449,894,61.8395,True,True,baseline,48.48164672055449,landmark,True | 908 | +2995735216,,,Fair Resource Allocation in Federated Learning,International Conference on Learning Representations,2020,conference-paper,federated_learning,4,225.0,300.0,42.51886520143499,120,11.8933,True,False,baseline,fairresourceallocationinfederatedlearning,42.51886520143499,landmark,True | ||
| 909 | −7118779462,10.1016/j.compeleceng.2025.110924,,Federated learning in healthcare: Recent progress and challenges,Computers & Electrical Engineering,2026,article,federated_learning,2,13.0,13.0,14.466419914531912,13,46.964,False,False,post,46.2178675312126,landmark,True | 909 | +7159977201,10.1109/tmc.2026.3688489,,AsyncFed-SAR: Toward Communication-Efficient Asynchronous Federated Learning for SAR Image Target Recognition,IEEE Transactions on Mobile Computing,2026,article,federated_learning,3,16.0,16.0,17.80482451019312,16,57.8019,False,False,post,asyncfedsartowardcommunicationefficientasynchronousfederatedlearningforsarimagetargetrecognition,40.567526595054304,landmark,True | ||
| 910 | −3100779497,10.1007/s41666-020-00082-4,1911.06270,Federated Learning for Healthcare Informatics,Journal of Healthcare Informatics Research,2020,article,federated_learning,2,140.0,343.0,42.90100811693001,1515,58.5309,False,True,baseline,42.90100811693001,landmark,True | 910 | +3045674654,10.1038/s41598-020-69250-1,,Federated learning in medicine: facilitating multi-institutional collaborations without sharing patient data,Scientific Reports,2020,article,federated_learning,4,122.0,323.0,40.39949160865421,1607,50.8594,True,True,baseline,federatedlearninginmedicinefacilitatingmultiinstitutionalcollaborationswithoutsharingpatientdata,40.39949160865421,landmark,True | ||
| 911 | −7133255133,10.3390/computers15030155,,"Federated Learning: A Survey of Core Challenges, Current Methods, and Opportunities",Computers,2026,article,federated_learning,5,12.0,12.0,13.353618382644841,12,43.3514,True,True,post,42.66264695188855,landmark,True | 911 | +3018464563,10.1109/mis.2020.2988604,1907.09173,FedHealth: A Federated Transfer Learning Framework for Wearable Healthcare,IEEE Intelligent Systems,2020,article,federated_learning,7,141.0,309.0,38.648430052861144,999,49.6281,True,True,baseline,fedhealthafederatedtransferlearningframeworkforwearablehealthcare,38.648430052861144,landmark,True | ||
| 912 | −2995735216,,,Fair Resource Allocation in Federated Learning,International Conference on Learning Representations,2020,conference-paper,federated_learning,4,225.0,300.0,42.51886520143499,120,11.8933,True,False,baseline,42.51886520143499,landmark,True | 912 | +4387105517,10.1145/3625558,2307.10616,Heterogeneous Federated Learning: State-of-the-art and Research Challenges,ACM Computing Surveys,2023,article,federated_learning,7,133.0,417.0,38.282597213243285,608,53.4131,True,True,post,heterogeneousfederatedlearningstateoftheartandresearchchallenges,38.282597213243285,landmark,True | ||
| 913 | −4408476406,10.1016/j.jnca.2025.104165,,CBRFL: A framework for Committee-based Byzantine-Resilient Federated Learning,Journal of Network and Computer Applications,2025,article,federated_learning,4,83.0,83.0,28.27389289459036,83,34.5383,False,False,post,42.01948495463904,landmark,True | 913 | +4408476406,10.1016/j.jnca.2025.104165,,CBRFL: A framework for Committee-based Byzantine-Resilient Federated Learning,Journal of Network and Computer Applications,2025,article,federated_learning,4,83.0,83.0,28.27389289459036,83,34.5383,False,False,post,cbrflaframeworkforcommitteebasedbyzantineresilientfederatedlearning,36.268640115677634,landmark,True | ||
| 914 | −4407318675,10.1016/j.aei.2025.103179,,Federated learning-empowered smart manufacturing and product lifecycle management: A review,Advanced Engineering Informatics,2025,article,federated_learning,2,82.0,82.0,27.933243582607346,82,34.1222,False,False,post,41.51322609976387,landmark,True | 914 | +4407318675,10.1016/j.aei.2025.103179,,Federated learning-empowered smart manufacturing and product lifecycle management: A review,Advanced Engineering Informatics,2025,article,federated_learning,2,82.0,82.0,27.933243582607346,82,34.1222,False,False,post,federatedlearningempoweredsmartmanufacturingandproductlifecyclemanagementareview,35.83166854801887,landmark,True | ||
| 915 | −3045674654,10.1038/s41598-020-69250-1,,Federated learning in medicine: facilitating multi-institutional collaborations without sharing patient data,Scientific Reports,2020,article,federated_learning,4,122.0,323.0,40.39949160865421,1607,50.8594,True,True,baseline,40.39949160865421,landmark,True | 915 | +4393156671,10.1609/aaai.v38i15.29617,2401.03230,FedTGP: Trainable Global Prototypes with Adaptive-Margin-Enhanced Contrastive Learning for Data and Model Heterogeneity in Federated Learning,Proceedings of the AAAI Conference on Artificial Intelligence,2024,conference-paper,federated_learning,8,66.0,121.0,33.633393493997694,121,36.8098,True,True,post,fedtgptrainableglobalprototypeswithadaptivemarginenhancedcontrastivelearningfordataandmodelheterogeneityinfederatedlearning,33.633393493997694,landmark,True | ||
| 916 | −7121318593,10.1007/s10115-025-02673-2,,A comprehensive survey on federated learning for privacy preservation in digital healthcare applications,Knowledge and Information Systems,2026,article,federated_learning,3,11.0,11.0,12.24081685075777,11,39.7388,False,False,post,39.107426372564504,landmark,True | 916 | +7118779462,10.1016/j.compeleceng.2025.110924,,Federated learning in healthcare: Recent progress and challenges,Computers & Electrical Engineering,2026,article,federated_learning,2,13.0,13.0,14.466419914531912,13,46.964,False,False,post,federatedlearninginhealthcarerecentprogressandchallenges,32.96111535848162,landmark,True | ||
| 917 | −3018464563,10.1109/mis.2020.2988604,1907.09173,FedHealth: A Federated Transfer Learning Framework for Wearable Healthcare,IEEE Intelligent Systems,2020,article,federated_learning,7,141.0,309.0,38.648430052861144,999,49.6281,True,True,baseline,38.648430052861144,landmark,True | 917 | +3196371845,10.1016/j.neucom.2021.07.098,2106.06843,Federated learning on non-IID data: A survey,Neurocomputing,2021,article,federated_learning,6,75.0,277.0,32.28225034036922,1043,48.3425,False,True,baseline,federatedlearningonnoniiddataasurvey,32.28225034036922,landmark,True | ||
| 918 | −4387105517,10.1145/3625558,2307.10616,Heterogeneous Federated Learning: State-of-the-art and Research Challenges,ACM Computing Surveys,2023,article,federated_learning,7,133.0,417.0,38.282597213243285,608,53.4131,True,True,post,38.282597213243285,landmark,True | 918 | +7133255133,10.3390/computers15030155,,"Federated Learning: A Survey of Core Challenges, Current Methods, and Opportunities",Computers,2026,article,federated_learning,5,12.0,12.0,13.353618382644841,12,43.3514,True,True,post,federatedlearningasurveyofcorechallengescurrentmethodsandopportunities,30.425644946290728,landmark,True | ||
| 919 | −4415878254,10.1109/jiot.2026.3669440,2510.15300,DFCA: Decentralized Federated Clustering Algorithm,IEEE Internet of Things Journal,2026,article,federated_learning,6,10.0,10.0,11.1280153188707,10,36.1262,True,True,post,35.552205793240454,landmark,True | 919 | +7104465905,10.71781/10873,,Re-weighted softmax cross-entropy to control forgetting in federated learning,Papyrus : Institutional Repository (Université de Montréal),2022,dissertation,federated_learning,3,1.0,4.0,29.956140350877195,0,,True,True,post,reweightedsoftmaxcrossentropytocontrolforgettinginfederatedlearning,29.956140350877195,landmark,True | ||
| 920 | −4406269727,10.1016/j.eswa.2024.126354,,Federated learning framework based on trimmed mean aggregation rules,Expert Systems with Applications,2025,article,federated_learning,3,67.0,67.0,22.8235039028621,67,22.0546,False,True,post,33.91934327663633,landmark,True | 920 | +4406269727,10.1016/j.eswa.2024.126354,,Federated learning framework based on trimmed mean aggregation rules,Expert Systems with Applications,2025,article,federated_learning,3,67.0,67.0,22.8235039028621,67,22.0546,False,True,post,federatedlearningframeworkbasedontrimmedmeanaggregationrules,29.277095033137364,landmark,True | ||
| 921 | −4393156671,10.1609/aaai.v38i15.29617,2401.03230,FedTGP: Trainable Global Prototypes with Adaptive-Margin-Enhanced Contrastive Learning for Data and Model Heterogeneity in Federated Learning,Proceedings of the AAAI Conference on Artificial Intelligence,2024,conference-paper,federated_learning,8,66.0,121.0,33.633393493997694,121,36.8098,True,True,post,33.633393493997694,landmark,True | 921 | +4402716118,10.1109/cvpr52733.2024.01139,,FedAS: Bridging Inconsistency in Personalized Federated Learning,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2024,conference-paper,federated_learning,5,56.0,104.0,28.90804068905587,104,31.6381,True,False,post,fedasbridginginconsistencyinpersonalizedfederatedlearning,28.90804068905587,landmark,True | ||
| 922 | −4412162472,10.1038/s41746-025-01836-3,,A scoping review of the governance of federated learning in healthcare,npj Digital Medicine,2025,article,federated_learning,2,65.0,65.0,22.142205278896068,65,27.048,True,True,post,32.90682556688599,landmark,True | 922 | +4412162472,10.1038/s41746-025-01836-3,,A scoping review of the governance of federated learning in healthcare,npj Digital Medicine,2025,article,federated_learning,2,65.0,65.0,22.142205278896068,65,27.048,True,True,post,ascopingreviewofthegovernanceoffederatedlearninginhealthcare,28.403151897819832,landmark,True | ||
| 923 | −3196371845,10.1016/j.neucom.2021.07.098,2106.06843,Federated learning on non-IID data: A survey,Neurocomputing,2021,article,federated_learning,6,75.0,277.0,32.28225034036922,1043,48.3425,False,True,baseline,32.28225034036922,landmark,True | 923 | +4293155325,10.1016/j.ipm.2022.103061,,"Federated learning review: Fundamentals, enabling technologies, and future applications",Information Processing & Management,2022,article,federated_learning,3,116.0,274.0,28.232853740681765,550,37.8866,False,False,baseline,federatedlearningreviewfundamentalsenablingtechnologiesandfutureapplications,28.232853740681765,landmark,True | ||
| 924 | −4226376129,10.1007/978-3-030-85559-8_13,,"Federated Learning: Challenges, Methods, and Future Directions",EAI/Springer Innovations in Communication and Computing,2022,book-chapter,federated_learning,3,37.0,57.0,30.546581711727224,99,39.2282,False,False,baseline,30.546581711727224,landmark,True | 924 | +7121318593,10.1007/s10115-025-02673-2,,A comprehensive survey on federated learning for privacy preservation in digital healthcare applications,Knowledge and Information Systems,2026,article,federated_learning,3,11.0,11.0,12.24081685075777,11,39.7388,False,False,post,acomprehensivesurveyonfederatedlearningforprivacypreservationindigitalhealthcareapplications,27.890174534099835,landmark,True | ||
| 925 | −7104465905,10.71781/10873,,Re-weighted softmax cross-entropy to control forgetting in federated learning,Papyrus : Institutional Repository (Université de Montréal),2022,dissertation,federated_learning,3,1.0,4.0,29.956140350877195,0,,True,True,post,29.956140350877195,landmark,True | 925 | +4415878254,10.1109/jiot.2026.3669440,2510.15300,DFCA: Decentralized Federated Clustering Algorithm,IEEE Internet of Things Journal,2026,article,federated_learning,6,10.0,10.0,11.1280153188707,10,36.1262,True,True,post,dfcadecentralizedfederatedclusteringalgorithm,25.35470412190894,landmark,True | ||
| 926 | −4402716118,10.1109/cvpr52733.2024.01139,,FedAS: Bridging Inconsistency in Personalized Federated Learning,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2024,conference-paper,federated_learning,5,56.0,104.0,28.90804068905587,104,31.6381,True,False,post,28.90804068905587,landmark,True | 926 | +4312634912,10.1109/cvpr52688.2022.00985,2205.03993,Layer-wised Model Aggregation for Personalized Federated Learning,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2022,conference-paper,federated_learning,6,48.0,126.0,25.033352648235116,240,30.554,True,True,baseline,layerwisedmodelaggregationforpersonalizedfederatedlearning,25.033352648235116,landmark,True | ||
| 927 | −4406063062,10.1016/j.jsis.2024.101885,,Responsible artificial intelligence governance: A review and research framework,The Journal of Strategic Information Systems,2025,article,ai_safety,1,534.0,534.0,74.49083144938457,534,564.6901,True,True,post,270.3422285033403,landmark,True | 927 | +4406063062,10.1016/j.jsis.2024.101885,,Responsible artificial intelligence governance: A review and research framework,The Journal of Strategic Information Systems,2025,article,ai_safety,1,534.0,534.0,74.49083144938457,534,564.6901,True,True,post,responsibleartificialintelligencegovernanceareviewandresearchframework,233.3428171297814,landmark,True | ||
| 928 | −7130596601,10.1016/j.ijmedinf.2026.106362,,"Human in the loop artificial intelligence in healthcare: applications, outcomes, and implementation challenges",International Journal of Medical Informatics,2026,article,ai_safety,6,65.0,65.0,29.591261451726567,65,120.3431,True,True,post,231.08933765606298,landmark,True | 928 | +3084163594,10.26522/brocked.v29i2.849,,Age of Surveillance Capitalism – The Fight for a Human Future at the New Frontier of Power.,Brock Education Journal,2020,article,ai_safety,2,484.0,775.0,225.67375365464028,2135,237.3333,True,True,baseline,ageofsurveillancecapitalismthefightforahumanfutureatthenewfrontierofpower,225.67375365464028,landmark,True | ||
| 929 | −3084163594,10.26522/brocked.v29i2.849,,Age of Surveillance Capitalism – The Fight for a Human Future at the New Frontier of Power.,Brock Education Journal,2020,article,ai_safety,2,484.0,775.0,225.67375365464028,2135,237.3333,True,True,baseline,225.67375365464028,landmark,True | 929 | +2963808661,10.4230/oasics.saia.2024.4,,Scaling of End-To-End Governance Risk Assessments for AI Systems (Practitioner Track),OASIcs : OpenAccess Series in Informatics,2025,conference-paper,ai_safety,1,390.0,390.0,126.28760836308005,390,127.9549,True,True,post,scalingofendtoendgovernanceriskassessmentsforaisystemspractitionertrack,170.418911386919,landmark,True | ||
| 930 | −2963808661,10.4230/oasics.saia.2024.4,,Scaling of End-To-End Governance Risk Assessments for AI Systems (Practitioner Track),OASIcs : OpenAccess Series in Informatics,2025,conference-paper,ai_safety,1,390.0,390.0,126.28760836308005,390,127.9549,True,True,post,197.44095340131597,landmark,True | 930 | +2981731882,10.1016/j.inffus.2019.12.012,1910.10045,"Explainable Artificial Intelligence (XAI): Concepts, taxonomies, opportunities and challenges toward responsible AI",Information Fusion,2019,article,ai_safety,4,225.0,1097.0,166.80483138995626,10111,264.5411,False,True,baseline,explainableartificialintelligencexaiconceptstaxonomiesopportunitiesandchallengestowardresponsibleai,166.80483138995626,landmark,True | ||
| 931 | −7133236347,10.1016/j.aiopen.2026.02.006,2506.04133,"TRiSM for Agentic AI: A review of Trust, Risk, and Security Management in LLM-based Agentic Multi-Agent Systems",AI Open,2026,article,ai_safety,5,51.0,51.0,44.51662971175166,51,274.4005,True,True,post,181.31624954552632,landmark,True | 931 | +7130596601,10.1016/j.ijmedinf.2026.106362,,"Human in the loop artificial intelligence in healthcare: applications, outcomes, and implementation challenges",International Journal of Medical Informatics,2026,article,ai_safety,6,65.0,65.0,29.591261451726567,65,120.3431,True,True,post,humanintheloopartificialintelligenceinhealthcareapplicationsoutcomesandimplementationchallenges,164.80557679240812,landmark,True | ||
| 932 | −7128782475,10.1038/s41746-026-02428-5,,Large language models provide unsafe answers to patient-posed medical questions,npj Digital Medicine,2026,article,ai_safety,3,51.0,51.0,23.217758985200845,50,94.0181,True,True,post,181.31624954552632,landmark,True | 932 | +4406571986,10.1016/j.chbah.2025.100121,2402.01659,Generative artificial intelligence in higher education: Evidence from an analysis of institutional policies and guidelines,Computers in Human Behavior Artificial Humans,2025,article,ai_safety,3,347.0,347.0,301.26573426573424,347,363.8008,True,True,post,generativeartificialintelligenceinhighereducationevidencefromananalysisofinstitutionalpoliciesandguidelines,151.62913397759203,landmark,True | ||
| 933 | −4406571986,10.1016/j.chbah.2025.100121,2402.01659,Generative artificial intelligence in higher education: Evidence from an analysis of institutional policies and guidelines,Computers in Human Behavior Artificial Humans,2025,article,ai_safety,3,347.0,347.0,301.26573426573424,347,363.8008,True,True,post,175.6718226416837,landmark,True | 933 | +4330336443,10.48550/arxiv.2303.10130,2303.10130,GPTs are GPTs: An Early Look at the Labor Market Impact Potential of Large Language Models,RePEc: Research Papers in Economics,2023,preprint,ai_safety,5,397.0,495.0,146.63793103448276,527,,True,True,post,gptsaregptsanearlylookatthelabormarketimpactpotentialoflargelanguagemodels,146.63793103448276,landmark,True | ||
| 934 | −2981731882,10.1016/j.inffus.2019.12.012,1910.10045,"Explainable Artificial Intelligence (XAI): Concepts, taxonomies, opportunities and challenges toward responsible AI",Information Fusion,2019,article,ai_safety,4,225.0,1097.0,166.80483138995626,10111,264.5411,False,True,baseline,166.80483138995626,landmark,True | 934 | +4399450035,10.1145/3630106.3658542,2311.16863,Power Hungry Processing: Watts Driving the Cost of AI Deployment?,,2024,conference-paper,ai_safety,3,210.0,359.0,138.53682019255788,359,285.6538,True,True,post,powerhungryprocessingwattsdrivingthecostofaideployment,138.53682019255788,landmark,True | ||
| 935 | −4402698709,10.1016/j.patter.2026.101517,2408.12622,"The AI risk repository: A meta-review, database, and taxonomy of risks from artificial intelligence",Patterns,2026,article,ai_safety,4,44.0,44.0,38.40650406504065,44,146.3469,True,True,post,156.42970549025802,landmark,True | 935 | +4318586239,10.1007/978-3-031-21448-6_2,,Artificial Intelligence: Definition and Background,Research for policy,2023,book-chapter,ai_safety,1,95.0,247.0,136.55931293612454,373,215.6652,True,True,post,artificialintelligencedefinitionandbackground,136.55931293612454,landmark,True | ||
| 936 | −4408314709,10.1038/s41746-025-01503-7,,Bias recognition and mitigation strategies in artificial intelligence healthcare applications,npj Digital Medicine,2025,article,ai_safety,1,303.0,303.0,42.26726953026878,303,319.4957,True,True,post,153.39643302717624,landmark,True | 936 | +4408314709,10.1038/s41746-025-01503-7,,Bias recognition and mitigation strategies in artificial intelligence healthcare applications,npj Digital Medicine,2025,article,ai_safety,1,303.0,303.0,42.26726953026878,303,319.4957,True,True,post,biasrecognitionandmitigationstrategiesinartificialintelligencehealthcareapplications,132.4023850006063,landmark,True | ||
| 937 | −4407243994,10.1080/08839514.2025.2463722,,"AI Ethics: Integrating Transparency, Fairness, and Privacy in AI Development",Applied Artificial Intelligence,2025,article,ai_safety,1,300.0,300.0,41.8487817131374,300,317.3728,True,True,post,151.87765646255073,landmark,True | 937 | +4407243994,10.1080/08839514.2025.2463722,,"AI Ethics: Integrating Transparency, Fairness, and Privacy in AI Development",Applied Artificial Intelligence,2025,article,ai_safety,1,300.0,300.0,41.8487817131374,300,317.3728,True,True,post,aiethicsintegratingtransparencyfairnessandprivacyinaidevelopment,131.09147029763,landmark,True | ||
| 938 | −4330336443,10.48550/arxiv.2303.10130,2303.10130,GPTs are GPTs: An Early Look at the Labor Market Impact Potential of Large Language Models,RePEc: Research Papers in Economics,2023,preprint,ai_safety,5,397.0,495.0,146.63793103448276,527,,True,True,post,146.63793103448276,landmark,True | 938 | +4360615722,10.3390/su15075614,,Chatbots in Education and Research: A Critical Examination of Ethical Implications and Solutions,Sustainability,2023,article,ai_safety,2,322.0,557.0,130.5473071452147,658,154.3873,True,True,post,chatbotsineducationandresearchacriticalexaminationofethicalimplicationsandsolutions,130.5473071452147,landmark,True | ||
| 939 | −7128600296,10.1038/s41746-026-02418-7,,Advancing healthcare AI governance through a comprehensive maturity model based on systematic review,npj Digital Medicine,2026,review,ai_safety,1,41.0,41.0,12.755555555555555,41,37.52,True,True,post,145.7640437522859,landmark,True | 939 | +7133236347,10.1016/j.aiopen.2026.02.006,2506.04133,"TRiSM for Agentic AI: A review of Trust, Risk, and Security Management in LLM-based Agentic Multi-Agent Systems",AI Open,2026,article,ai_safety,5,51.0,51.0,44.51662971175166,51,274.4005,True,True,post,trismforagenticaiareviewoftrustriskandsecuritymanagementinllmbasedagenticmultiagentsystems,129.3089910217356,landmark,True | ||
| 940 | −4399450035,10.1145/3630106.3658542,2311.16863,Power Hungry Processing: Watts Driving the Cost of AI Deployment?,,2024,conference-paper,ai_safety,3,210.0,359.0,138.53682019255788,359,285.6538,True,True,post,138.53682019255788,landmark,True | 940 | +7128782475,10.1038/s41746-026-02428-5,,Large language models provide unsafe answers to patient-posed medical questions,npj Digital Medicine,2026,article,ai_safety,3,51.0,51.0,23.217758985200845,50,94.0181,True,True,post,largelanguagemodelsprovideunsafeanswerstopatientposedmedicalquestions,129.3089910217356,landmark,True | ||
| 941 | −4318586239,10.1007/978-3-031-21448-6_2,,Artificial Intelligence: Definition and Background,Research for policy,2023,book-chapter,ai_safety,1,95.0,247.0,136.55931293612454,373,215.6652,True,True,post,136.55931293612454,landmark,True | 941 | +2670253439,10.1016/j.artint.2018.07.007,1706.07269,Explanation in artificial intelligence: Insights from the social sciences,Artificial Intelligence,2018,article,ai_safety,1,267.0,676.0,127.59130157926435,5207,192.3734,False,True,baseline,explanationinartificialintelligenceinsightsfromthesocialsciences,127.59130157926435,landmark,True | ||
| 942 | −4360615722,10.3390/su15075614,,Chatbots in Education and Research: A Critical Examination of Ethical Implications and Solutions,Sustainability,2023,article,ai_safety,2,322.0,557.0,130.5473071452147,658,154.3873,True,True,post,130.5473071452147,landmark,True | 942 | +4402698709,10.1016/j.patter.2026.101517,2408.12622,"The AI risk repository: A meta-review, database, and taxonomy of risks from artificial intelligence",Patterns,2026,article,ai_safety,4,44.0,44.0,38.40650406504065,44,146.3469,True,True,post,theairiskrepositoryametareviewdatabaseandtaxonomyofrisksfromartificialintelligence,111.56069813639934,landmark,True | ||
| 943 | −2670253439,10.1016/j.artint.2018.07.007,1706.07269,Explanation in artificial intelligence: Insights from the social sciences,Artificial Intelligence,2018,article,ai_safety,1,267.0,676.0,127.59130157926435,5207,192.3734,False,True,baseline,127.59130157926435,landmark,True | 943 | +4366262984,10.1016/j.inffus.2023.101805,,Explainable Artificial Intelligence (XAI): What we know and what is left to attain Trustworthy Artificial Intelligence,Information Fusion,2023,article,ai_safety,5,510.0,1197.0,109.89033300779907,1728,151.7177,True,True,post,explainableartificialintelligencexaiwhatweknowandwhatislefttoattaintrustworthyartificialintelligence,109.89033300779907,landmark,True | ||
| 944 | −7118631510,10.1016/j.cie.2026.111805,,Towards trustworthy AI in Industry 5.0: Ante-hoc interpretability with deep learning,Computers & Industrial Engineering,2026,article,ai_safety,2,35.0,35.0,38.94805361604745,35,126.4417,False,True,post,124.4327202763416,landmark,True | 944 | +7128600296,10.1038/s41746-026-02418-7,,Advancing healthcare AI governance through a comprehensive maturity model based on systematic review,npj Digital Medicine,2026,review,ai_safety,1,41.0,41.0,12.755555555555555,41,37.52,True,True,post,advancinghealthcareaigovernancethroughacomprehensivematuritymodelbasedonsystematicreview,103.95428689982666,landmark,True | ||
| 945 | −7127143535,10.1016/j.jii.2026.101089,,"Industrial information integration through autonomous AI agents: paradoxical effects on transparency, dehumanization, and responsible retail operations",Journal of Industrial Information Integration,2026,article,ai_safety,2,33.0,33.0,50.00583941605839,33,209.0741,False,False,post,117.32227911769351,landmark,True | 945 | +2969896603,10.1145/3457607,1908.09635,A Survey on Bias and Fairness in Machine Learning,ACM Computing Surveys,2021,article,ai_safety,3,952.0,1794.0,102.2847403248446,5442,822.4428,True,True,baseline,asurveyonbiasandfairnessinmachinelearning,102.2847403248446,landmark,True | ||
| 946 | −4409249263,10.1371/journal.pdig.0000810,2412.03576,Ethical challenges and evolving strategies in the integration of artificial intelligence into clinical practice,PLOS Digital Health,2025,article,ai_safety,3,218.0,218.0,14.499719652368936,218,44.6351,True,True,post,110.36443036278686,landmark,True | 946 | +4409249263,10.1371/journal.pdig.0000810,2412.03576,Ethical challenges and evolving strategies in the integration of artificial intelligence into clinical practice,PLOS Digital Health,2025,article,ai_safety,3,218.0,218.0,14.499719652368936,218,44.6351,True,True,post,ethicalchallengesandevolvingstrategiesintheintegrationofartificialintelligenceintoclinicalpractice,95.25980174961113,landmark,True | ||
| 947 | −4366262984,10.1016/j.inffus.2023.101805,,Explainable Artificial Intelligence (XAI): What we know and what is left to attain Trustworthy Artificial Intelligence,Information Fusion,2023,article,ai_safety,5,510.0,1197.0,109.89033300779907,1728,151.7177,True,True,post,109.89033300779907,landmark,True | 947 | +7118631510,10.1016/j.cie.2026.111805,,Towards trustworthy AI in Industry 5.0: Ante-hoc interpretability with deep learning,Computers & Industrial Engineering,2026,article,ai_safety,2,35.0,35.0,38.94805361604745,35,126.4417,False,True,post,towardstrustworthyaiinindustry50antehocinterpretabilitywithdeeplearning,88.74146442668129,landmark,True | ||
| 948 | −2969896603,10.1145/3457607,1908.09635,A Survey on Bias and Fairness in Machine Learning,ACM Computing Surveys,2021,article,ai_safety,3,952.0,1794.0,102.2847403248446,5442,822.4428,True,True,baseline,102.2847403248446,landmark,True | 948 | +4406152291,10.1038/s41591-024-03445-1,,Medical large language models are vulnerable to data-poisoning attacks,Nature Medicine,2025,article,ai_safety,4,199.0,199.0,67.78921308462026,199,81.9764,True,True,post,medicallargelanguagemodelsarevulnerabletodatapoisoningattacks,86.95734196409457,landmark,True | ||
| 949 | −4406152291,10.1038/s41591-024-03445-1,,Medical large language models are vulnerable to data-poisoning attacks,Nature Medicine,2025,article,ai_safety,4,199.0,199.0,67.78921308462026,199,81.9764,True,True,post,100.74551212015865,landmark,True | 949 | +4400609581,10.1057/s41599-024-03432-4,,"Exploring the impact of artificial intelligence on higher education: The dynamics of ethical, social, and educational implications",Humanities and Social Sciences Communications,2024,article,ai_safety,1,151.0,284.0,85.50531277415134,284,108.6819,True,True,post,exploringtheimpactofartificialintelligenceonhighereducationthedynamicsofethicalsocialandeducationalimplications,85.50531277415134,landmark,True | ||
| 950 | −4410609100,10.1109/satml64287.2025.00010,2310.08419,Jailbreaking Black Box Large Language Models in Twenty Queries,IEEE Conference on Secure and Trustworthy Machine Learning (SaTML),2025,conference-paper,ai_safety,7,193.0,193.0,171.53132893516792,193,175.4907,True,True,post,97.70795899090764,landmark,True | 950 | +4401588926,10.1787/15df715b-en,,The potential impact of Artificial Intelligence on equity and inclusion in education,OECD artificial intelligence papers,2024,report,ai_safety,1,34.0,75.0,84.79411764705883,75,,True,True,post,thepotentialimpactofartificialintelligenceonequityandinclusionineducation,84.79411764705883,landmark,True | ||
| 951 | −4411542009,10.1145/3715275.3732039,2504.18412,Expressing stigma and inappropriate responses prevents LLMs from safely replacing mental health providers.,"ACM Conference on Fairness, Accountability, and Transparency (FAccT)",2025,conference-paper,ai_safety,3,191.0,191.0,61.84854665986741,191,201.9784,True,True,post,96.6954412811573,landmark,True | 951 | +4410609100,10.1109/satml64287.2025.00010,2310.08419,Jailbreaking Black Box Large Language Models in Twenty Queries,IEEE Conference on Secure and Trustworthy Machine Learning (SaTML),2025,conference-paper,ai_safety,7,193.0,193.0,171.53132893516792,193,175.4907,True,True,post,jailbreakingblackboxlargelanguagemodelsintwentyqueries,84.33551255814196,landmark,True | ||
| 952 | −7117963061,10.1016/j.rser.2025.116664,,"Toward sustainable data center operation: A review on existing infrastructures, integrated smart energy management frameworks, and future perspectives",Renewable and Sustainable Energy Reviews,2026,article,sustainable_computing,3,30.0,30.0,213.13627514600907,30,274.5849,False,False,post,106.65661737972137,landmark,True | 952 | +4362707075,10.48550/arxiv.2304.03271,2304.03271,"Making AI Less ""Thirsty"": Uncovering and Addressing the Secret Water Footprint of AI Models",arXiv (Cornell University),2023,preprint,sustainable_computing,2,66.0,133.0,93.25822253324003,162,,True,True,post,makingailessthirstyuncoveringandaddressingthesecretwaterfootprintofaimodels,93.25822253324003,landmark,True | ||
| 953 | −4362707075,10.48550/arxiv.2304.03271,2304.03271,"Making AI Less ""Thirsty"": Uncovering and Addressing the Secret Water Footprint of AI Models",arXiv (Cornell University),2023,preprint,sustainable_computing,2,66.0,133.0,93.25822253324003,162,,True,True,post,93.25822253324003,landmark,True | 953 | +2963840171,10.1109/comst.2018.2812301,1802.09345,"Information and Communications Technologies for Sustainable Development Goals: State-of-the-Art, Needs and Perspectives",IEEE Communications Surveys & Tutorials,2018,article,sustainable_computing,2,95.0,155.0,82.1805490963324,613,105.2524,True,True,baseline,informationandcommunicationstechnologiesforsustainabledevelopmentgoalsstateoftheartneedsandperspectives,82.1805490963324,landmark,True | ||
| 954 | −4411368489,10.1145/3724499,,Making AI Less 'Thirsty',Communications of the ACM,2025,article,sustainable_computing,2,163.0,163.0,37.38016172506738,163,37.1417,True,True,post,82.52019334465257,landmark,True | 954 | +7117963061,10.1016/j.rser.2025.116664,,"Toward sustainable data center operation: A review on existing infrastructures, integrated smart energy management frameworks, and future perspectives",Renewable and Sustainable Energy Reviews,2026,article,sustainable_computing,3,30.0,30.0,213.13627514600907,30,274.5849,False,False,post,towardsustainabledatacenteroperationareviewonexistinginfrastructuresintegratedsmartenergymanagementframeworksandfutureperspectives,76.06411236572681,landmark,True | ||
| 955 | −2963840171,10.1109/comst.2018.2812301,1802.09345,"Information and Communications Technologies for Sustainable Development Goals: State-of-the-Art, Needs and Perspectives",IEEE Communications Surveys & Tutorials,2018,article,sustainable_computing,2,95.0,155.0,82.1805490963324,613,105.2524,True,True,baseline,82.1805490963324,landmark,True | 955 | +4411368489,10.1145/3724499,,Making AI Less 'Thirsty',Communications of the ACM,2025,article,sustainable_computing,2,163.0,163.0,37.38016172506738,163,37.1417,True,True,post,makingailessthirsty,71.22636552837896,landmark,True | ||
| 956 | −7140797778,10.1109/tetci.2026.3671111,,Carbon Footprint Efficiency Ratio: A Unified Indicator for Green Evaluation of Evolutionary Algorithms,IEEE Transactions on Emerging Topics in Computational Intelligence,2026,article,sustainable_computing,5,20.0,20.0,29.883558453656264,20,34.2939,True,False,post,71.10441158648091,landmark,True | 956 | +4403458785,10.1186/s41239-024-00490-1,,"Artificial intelligence in higher education: exploring faculty use, self-efficacy, distinct profiles, and professional development needs",International Journal of Educational Technology in Higher Education,2024,article,sustainable_computing,1,72.0,206.0,62.021459265757656,206,78.8326,True,True,post,artificialintelligenceinhighereducationexploringfacultyuseselfefficacydistinctprofilesandprofessionaldevelopmentneeds,62.021459265757656,landmark,True | ||
| 957 | −4415057924,10.1016/j.ynexs.2026.100162,2509.07218,Electricity demand and grid impacts of AI data centers: Challenges and prospects,Nexus,2026,article,sustainable_computing,3,18.0,18.0,26.89520260829064,18,29.1498,True,True,post,63.99397042783282,landmark,True | 957 | +2892611063,10.1007/978-3-030-00253-4_8,,Improving Big Data Centers Energy Efficiency: Traffic Based Model and Method,"Studies in systems, decision and control",2018,book-chapter,sustainable_computing,3,28.0,50.0,58.75865606565786,88,58.8035,False,False,baseline,improvingbigdatacentersenergyefficiencytrafficbasedmodelandmethod,58.75865606565786,landmark,True | ||
| 958 | −4403458785,10.1186/s41239-024-00490-1,,"Artificial intelligence in higher education: exploring faculty use, self-efficacy, distinct profiles, and professional development needs",International Journal of Educational Technology in Higher Education,2024,article,sustainable_computing,1,72.0,206.0,62.021459265757656,206,78.8326,True,True,post,62.021459265757656,landmark,True | 958 | +7140797778,10.1109/tetci.2026.3671111,,Carbon Footprint Efficiency Ratio: A Unified Indicator for Green Evaluation of Evolutionary Algorithms,IEEE Transactions on Emerging Topics in Computational Intelligence,2026,article,sustainable_computing,5,20.0,20.0,29.883558453656264,20,34.2939,True,False,post,carbonfootprintefficiencyratioaunifiedindicatorforgreenevaluationofevolutionaryalgorithms,50.70940824381788,landmark,True | ||
| 959 | −2892611063,10.1007/978-3-030-00253-4_8,,Improving Big Data Centers Energy Efficiency: Traffic Based Model and Method,"Studies in systems, decision and control",2018,book-chapter,sustainable_computing,3,28.0,50.0,58.75865606565786,88,58.8035,False,False,baseline,58.75865606565786,landmark,True | 959 | +4308245305,10.48550/arxiv.2211.02001,2211.02001,"Estimating the Carbon Footprint of BLOOM, a 176B Parameter Language Model",arXiv (Cornell University),2022,preprint,sustainable_computing,2,24.0,94.0,49.0919881305638,178,,True,True,baseline,estimatingthecarbonfootprintofblooma176bparameterlanguagemodel,49.0919881305638,landmark,True | ||
| 960 | −7131638452,10.1007/s12525-026-00877-0,,Digital product passports,Electronic Markets,2026,article,sustainable_computing,1,14.0,14.0,13.680608365019012,14,89.8458,True,True,post,49.77308811053664,landmark,True | 960 | +4415057924,10.1016/j.ynexs.2026.100162,2509.07218,Electricity demand and grid impacts of AI data centers: Challenges and prospects,Nexus,2026,article,sustainable_computing,3,18.0,18.0,26.89520260829064,18,29.1498,True,True,post,electricitydemandandgridimpactsofaidatacenterschallengesandprospects,45.63846741943609,landmark,True | ||
| 961 | −4308245305,10.48550/arxiv.2211.02001,2211.02001,"Estimating the Carbon Footprint of BLOOM, a 176B Parameter Language Model",arXiv (Cornell University),2022,preprint,sustainable_computing,2,24.0,94.0,49.0919881305638,178,,True,True,baseline,49.0919881305638,landmark,True | 961 | +4399913870,10.1016/j.neucom.2024.128096,,A review of green artificial intelligence: Towards a more sustainable future,Neurocomputing,2024,article,sustainable_computing,3,244.0,466.0,42.08809549196657,466,47.9661,True,True,post,areviewofgreenartificialintelligencetowardsamoresustainablefuture,42.08809549196657,landmark,True | ||
| 962 | −7129692983,10.1109/tnse.2026.3665604,,Spatio-Temporal Coordinated Operation Strategy of Data Centers Considering Virtual Storage System via Two-Stage Distributionally Robust Optimization,IEEE Transactions on Network Science and Engineering,2026,article,sustainable_computing,4,13.0,13.0,92.3590525632706,13,118.9868,True,True,post,46.2178675312126,landmark,True | 962 | +4391530352,10.1016/j.ijrefrig.2024.02.007,,"Data centers cooling: A critical review of techniques, challenges, and energy saving solutions",International Journal of Refrigeration,2024,article,sustainable_computing,3,82.0,173.0,38.56480172355753,173,54.4861,False,False,post,datacenterscoolingacriticalreviewoftechniqueschallengesandenergysavingsolutions,38.56480172355753,landmark,True | ||
| 963 | −7128511066,10.1016/j.ssaho.2026.102560,,"The impacts of globalization, institutional quality, and digital technology innovation on OECD countries sustainable digital economic growth",Social Sciences & Humanities Open,2026,article,sustainable_computing,1,13.0,13.0,92.3590525632706,13,118.9868,True,True,post,46.2178675312126,landmark,True | 963 | +4385481791,10.1145/3604930.3605705,,Reducing the Carbon Impact of Generative AI Inference (today and in 2035),,2023,conference-paper,sustainable_computing,5,44.0,110.0,36.66315007073153,127,64.935,True,True,post,reducingthecarbonimpactofgenerativeaiinferencetodayandin2035,36.66315007073153,landmark,True | ||
| 964 | −4399913870,10.1016/j.neucom.2024.128096,,A review of green artificial intelligence: Towards a more sustainable future,Neurocomputing,2024,article,sustainable_computing,3,244.0,466.0,42.08809549196657,466,47.9661,True,True,post,42.08809549196657,landmark,True | 964 | +7129692983,10.1109/tnse.2026.3665604,,Spatio-Temporal Coordinated Operation Strategy of Data Centers Considering Virtual Storage System via Two-Stage Distributionally Robust Optimization,IEEE Transactions on Network Science and Engineering,2026,article,sustainable_computing,4,13.0,13.0,92.3590525632706,13,118.9868,True,True,post,spatiotemporalcoordinatedoperationstrategyofdatacentersconsideringvirtualstoragesystemviatwostagedistributionallyrobustoptimization,32.96111535848162,landmark,True | ||
| 965 | −4391530352,10.1016/j.ijrefrig.2024.02.007,,"Data centers cooling: A critical review of techniques, challenges, and energy saving solutions",International Journal of Refrigeration,2024,article,sustainable_computing,3,82.0,173.0,38.56480172355753,173,54.4861,False,False,post,38.56480172355753,landmark,True | 965 | +7128511066,10.1016/j.ssaho.2026.102560,,"The impacts of globalization, institutional quality, and digital technology innovation on OECD countries sustainable digital economic growth",Social Sciences & Humanities Open,2026,article,sustainable_computing,1,13.0,13.0,92.3590525632706,13,118.9868,True,True,post,theimpactsofglobalizationinstitutionalqualityanddigitaltechnologyinnovationonoecdcountriessustainabledigitaleconomicgrowth,32.96111535848162,landmark,True | ||
| 966 | −4385481791,10.1145/3604930.3605705,,Reducing the Carbon Impact of Generative AI Inference (today and in 2035),,2023,conference-paper,sustainable_computing,5,44.0,110.0,36.66315007073153,127,64.935,True,True,post,36.66315007073153,landmark,True | 966 | +4390660405,10.1109/access.2024.3351468,,The Optimization of Carbon Emission Prediction in Low Carbon Energy Economy Under Big Data,IEEE Access,2024,article,sustainable_computing,1,167.0,193.0,32.37439457539554,193,69.0898,True,True,post,theoptimizationofcarbonemissionpredictioninlowcarbonenergyeconomyunderbigdata,32.37439457539554,landmark,True | ||
| 967 | −7115707641,10.1016/j.patter.2025.101430,,The carbon and water footprints of data centers and what this could mean for artificial intelligence,Patterns,2025,article,sustainable_computing,3,71.0,71.0,16.282156334231807,71,15.9504,True,True,post,35.94437869613701,landmark,True | 967 | +4283157527,10.1145/3531146.3533234,2206.05229,Measuring the Carbon Intensity of AI in Cloud Instances,"ACM Conference on Fairness, Accountability, and Transparency (FAccT)",2022,conference-paper,sustainable_computing,4,47.0,104.0,31.08684263550272,234,73.2411,True,True,baseline,measuringthecarbonintensityofaiincloudinstances,31.08684263550272,landmark,True | ||
| 968 | −4407614581,10.1007/s11528-025-01055-3,,Examining Teaching Competencies and Challenges While Integrating Artificial Intelligence in Higher Education,TechTrends,2025,article,sustainable_computing,1,71.0,71.0,61.64226839442977,71,77.5671,True,True,post,35.94437869613701,landmark,True | 968 | +4407614581,10.1007/s11528-025-01055-3,,Examining Teaching Competencies and Challenges While Integrating Artificial Intelligence in Higher Education,TechTrends,2025,article,sustainable_computing,1,71.0,71.0,61.64226839442977,71,77.5671,True,True,post,examiningteachingcompetenciesandchallengeswhileintegratingartificialintelligenceinhighereducation,31.02498130377243,landmark,True | ||
| 969 | −7122842330,10.3389/frai.2025.1692763,,Bridging technology and sustainability: examining the role of green AI adoption in Indian banking sector,Frontiers in Artificial Intelligence,2026,article,sustainable_computing,1,10.0,10.0,9.609756097560977,10,77.2657,True,True,post,35.552205793240454,landmark,True | 969 | +7115707641,10.1016/j.patter.2025.101430,,The carbon and water footprints of data centers and what this could mean for artificial intelligence,Patterns,2025,article,sustainable_computing,3,71.0,71.0,16.282156334231807,71,15.9504,True,True,post,thecarbonandwaterfootprintsofdatacentersandwhatthiscouldmeanforartificialintelligence,31.02498130377243,landmark,True | ||
| 970 | −4407592994,10.1145/3718363,2409.12626,Green Federated Learning: A New Era of Green Aware AI,ACM Computing Surveys,2025,article,sustainable_computing,9,65.0,65.0,14.906199460916442,65,14.5832,True,True,post,32.90682556688599,landmark,True | 970 | +3156891177,10.48550/arxiv.2104.10350,2104.10350,Carbon Emissions and Large Neural Network Training,arXiv (Cornell University),2021,preprint,sustainable_computing,6,47.0,77.0,29.52943615257048,122,,True,True,baseline,carbonemissionsandlargeneuralnetworktraining,29.52943615257048,landmark,True | ||
| 971 | −4390660405,10.1109/access.2024.3351468,,The Optimization of Carbon Emission Prediction in Low Carbon Energy Economy Under Big Data,IEEE Access,2024,article,sustainable_computing,1,167.0,193.0,32.37439457539554,193,69.0898,True,True,post,32.37439457539554,landmark,True | 971 | +4407592994,10.1145/3718363,2409.12626,Green Federated Learning: A New Era of Green Aware AI,ACM Computing Surveys,2025,article,sustainable_computing,9,65.0,65.0,14.906199460916442,65,14.5832,True,True,post,greenfederatedlearninganeweraofgreenawareai,28.403151897819832,landmark,True | ||
| 972 | −4416596047,10.1109/access.2026.3659894,2511.17179,Toward Sustainable AI: A Scoping Review of Carbon Footprint and Environmental Impacts Across Training and Inference Stages,IEEE Access,2026,article,sustainable_computing,2,9.0,9.0,13.44760130414532,9,15.4323,True,True,post,31.99698521391641,landmark,True | 972 | +4401304802,10.2172/2417618,,Best Practices Guide for Energy-Efficient Data Center Design,,2024,report,sustainable_computing,3,19.0,25.0,28.26470588235294,25,,True,True,post,bestpracticesguideforenergyefficientdatacenterdesign,28.26470588235294,landmark,True | ||
| 973 | −7138433923,10.1609/aaai.v40i38.40535,,TokenPowerBench: Benchmarking the Power Consumption of LLM Inference,Proceedings of the AAAI Conference on Artificial Intelligence,2026,conference-paper,sustainable_computing,6,9.0,9.0,77.99494097807758,8,183.5393,True,True,post,31.99698521391641,landmark,True | 973 | +3137672894,10.1109/tgcn.2021.3067374,,SSUR: An Approach to Optimizing Virtual Machine Allocation Strategy Based on User Requirements for Cloud Data Center,IEEE Transactions on Green Communications and Networking,2021,article,sustainable_computing,5,89.0,105.0,27.80457982156345,160,29.0452,True,False,baseline,ssuranapproachtooptimizingvirtualmachineallocationstrategybasedonuserrequirementsforclouddatacenter,27.80457982156345,landmark,True | ||
| 974 | −4411541921,10.1145/3715275.3732007,2501.16548,From Efficiency Gains to Rebound Effects: The Problem of Jevons' Paradox in AI's Polarized Environmental Debate,"ACM Conference on Fairness, Accountability, and Transparency (FAccT)",2025,conference-paper,sustainable_computing,2,62.0,62.0,60.833434492326376,62,144.145,True,True,post,31.388049002260484,landmark,True | 974 | +4411541921,10.1145/3715275.3732007,2501.16548,From Efficiency Gains to Rebound Effects: The Problem of Jevons' Paradox in AI's Polarized Environmental Debate,"ACM Conference on Fairness, Accountability, and Transparency (FAccT)",2025,conference-paper,sustainable_computing,2,62.0,62.0,60.833434492326376,62,144.145,True,True,post,fromefficiencygainstoreboundeffectstheproblemofjevonsparadoxinaispolarizedenvironmentaldebate,27.09223719484353,landmark,True | ||
| 975 | −4283157527,10.1145/3531146.3533234,2206.05229,Measuring the Carbon Intensity of AI in Cloud Instances,"ACM Conference on Fairness, Accountability, and Transparency (FAccT)",2022,conference-paper,sustainable_computing,4,47.0,104.0,31.08684263550272,234,73.2411,True,True,baseline,31.08684263550272,landmark,True | 975 | +2803823791,10.1016/j.suscom.2018.05.002,,A review of thermal management and innovative cooling strategies for data center,Sustainable Computing Informatics and Systems,2018,article,sustainable_computing,3,24.0,50.0,26.509854547204004,324,37.3606,False,False,baseline,areviewofthermalmanagementandinnovativecoolingstrategiesfordatacenter,26.509854547204004,landmark,True | ||
| 976 | −3156891177,10.48550/arxiv.2104.10350,2104.10350,Carbon Emissions and Large Neural Network Training,arXiv (Cornell University),2021,preprint,sustainable_computing,6,47.0,77.0,29.52943615257048,122,,True,True,baseline,29.52943615257048,landmark,True | 976 | +3037032032,10.1609/aaai.v34i09.7123,,Energy and Policy Considerations for Modern Deep Learning Research,Proceedings of the AAAI Conference on Artificial Intelligence,2020,conference-paper,sustainable_computing,4,31.0,98.0,25.856691345196346,755,70.4108,True,True,baseline,energyandpolicyconsiderationsformoderndeeplearningresearch,25.856691345196346,landmark,True | ||
| 977 | −7140287209,10.1038/s41586-026-10265-5,,Towards end-to-end automation of AI research,Nature,2026,article,autonomous_scientific_discovery,4,94.0,94.0,104.60334399738458,94,335.9735,True,True,post,334.1907344564603,landmark,True | 977 | +7140287209,10.1038/s41586-026-10265-5,,Towards end-to-end automation of AI research,Nature,2026,article,autonomous_scientific_discovery,4,94.0,94.0,104.60334399738458,94,335.9735,True,True,post,towardsendtoendautomationofairesearch,238.33421874594404,landmark,True | ||
| 978 | −7125546963,10.1016/j.addr.2026.115781,,Artificial intelligence and machine learning guided optimization in drug delivery,Advanced Drug Delivery Reviews,2026,review,autonomous_scientific_discovery,4,36.0,36.0,17.176470588235293,36,21.0789,True,True,post,127.98794085566564,landmark,True | 978 | +4385490607,10.1038/s41586-023-06221-2,,Scientific discovery in the age of artificial intelligence,Nature,2023,article,autonomous_scientific_discovery,1,578.0,1284.0,117.87734969257644,1779,156.2859,False,True,post,scientificdiscoveryintheageofartificialintelligence,117.87734969257644,landmark,True | ||
| 979 | −4385490607,10.1038/s41586-023-06221-2,,Scientific discovery in the age of artificial intelligence,Nature,2023,article,autonomous_scientific_discovery,1,578.0,1284.0,117.87734969257644,1779,156.2859,False,True,post,117.87734969257644,landmark,True | 979 | +3007309629,10.1016/j.cell.2020.01.021,,A Deep Learning Approach to Antibiotic Discovery,Cell,2020,article,autonomous_scientific_discovery,2,489.0,780.0,114.84910458404532,2361,125.0662,False,True,baseline,adeeplearningapproachtoantibioticdiscovery,114.84910458404532,landmark,True | ||
| 980 | −3007309629,10.1016/j.cell.2020.01.021,,A Deep Learning Approach to Antibiotic Discovery,Cell,2020,article,autonomous_scientific_discovery,2,489.0,780.0,114.84910458404532,2361,125.0662,False,True,baseline,114.84910458404532,landmark,True | 980 | +7125546963,10.1016/j.addr.2026.115781,,Artificial intelligence and machine learning guided optimization in drug delivery,Advanced Drug Delivery Reviews,2026,review,autonomous_scientific_discovery,4,36.0,36.0,17.176470588235293,36,21.0789,True,True,post,artificialintelligenceandmachinelearningguidedoptimizationindrugdelivery,91.27693483887218,landmark,True | ||
| 981 | −4406405186,10.1038/s42256-024-00956-x,,The design space of E(3)-equivariant atom-centred interatomic potentials,Nature Machine Intelligence,2025,article,autonomous_scientific_discovery,5,196.0,196.0,30.34398782343988,196,40.9323,True,True,post,99.22673555553315,landmark,True | 981 | +4406405186,10.1038/s42256-024-00956-x,,The design space of E(3)-equivariant atom-centred interatomic potentials,Nature Machine Intelligence,2025,article,autonomous_scientific_discovery,5,196.0,196.0,30.34398782343988,196,40.9323,True,True,post,thedesignspaceofe3equivariantatomcentredinteratomicpotentials,85.64642726111826,landmark,True | ||
| 982 | −4365512576,10.1016/j.iotcps.2023.04.003,,"ChatGPT: A comprehensive review on background, applications, key challenges, bias, ethics, limitations and future scope",Internet of Things and Cyber-Physical Systems,2023,article,autonomous_scientific_discovery,6,1309.0,2124.0,76.85650367529561,2423,590.6367,True,True,post,76.85650367529561,landmark,True | 982 | +4365512576,10.1016/j.iotcps.2023.04.003,,"ChatGPT: A comprehensive review on background, applications, key challenges, bias, ethics, limitations and future scope",Internet of Things and Cyber-Physical Systems,2023,article,autonomous_scientific_discovery,6,1309.0,2124.0,76.85650367529561,2423,590.6367,True,True,post,chatgptacomprehensivereviewonbackgroundapplicationskeychallengesbiasethicslimitationsandfuturescope,76.85650367529561,landmark,True | ||
| 983 | −4414990951,10.1016/j.matt.2026.102748,2508.13197,The rise of generative AI for metal-organic framework design and synthesis,Matter,2026,article,autonomous_scientific_discovery,3,21.0,21.0,16.40625,21,28.4842,True,True,post,74.65963216580496,landmark,True | 983 | +4406406714,10.1038/s42256-024-00972-x,,Battery lifetime prediction across diverse ageing conditions with inter-cell deep learning,Nature Machine Intelligence,2025,article,autonomous_scientific_discovery,1,140.0,140.0,25.71533113794365,140,34.876,True,True,post,batterylifetimepredictionacrossdiverseageingconditionswithintercelldeeplearning,61.17601947222733,landmark,True | ||
| 984 | −4406406714,10.1038/s42256-024-00972-x,,Battery lifetime prediction across diverse ageing conditions with inter-cell deep learning,Nature Machine Intelligence,2025,article,autonomous_scientific_discovery,1,140.0,140.0,25.71533113794365,140,34.876,True,True,post,70.87623968252367,landmark,True | 984 | +4396723768,10.1038/s42256-024-00832-8,,Augmenting large language models with chemistry tools,Nature Machine Intelligence,2024,article,autonomous_scientific_discovery,4,395.0,762.0,60.19669891861127,762,71.2953,True,True,post,augmentinglargelanguagemodelswithchemistrytools,60.19669891861127,landmark,True | ||
| 985 | −4396723768,10.1038/s42256-024-00832-8,,Augmenting large language models with chemistry tools,Nature Machine Intelligence,2024,article,autonomous_scientific_discovery,4,395.0,762.0,60.19669891861127,762,71.2953,True,True,post,60.19669891861127,landmark,True | 985 | +4319754774,10.1016/j.caeai.2023.100132,,Acceptance of artificial intelligence in teaching science: Science teachers' perspective,Computers and Education Artificial Intelligence,2023,article,autonomous_scientific_discovery,1,120.0,252.0,59.06269551273626,323,75.9012,True,True,post,acceptanceofartificialintelligenceinteachingsciencescienceteachersperspective,59.06269551273626,landmark,True | ||
| 986 | −4319754774,10.1016/j.caeai.2023.100132,,Acceptance of artificial intelligence in teaching science: Science teachers' perspective,Computers and Education Artificial Intelligence,2023,article,autonomous_scientific_discovery,1,120.0,252.0,59.06269551273626,323,75.9012,True,True,post,59.06269551273626,landmark,True | 986 | +4414990951,10.1016/j.matt.2026.102748,2508.13197,The rise of generative AI for metal-organic framework design and synthesis,Matter,2026,article,autonomous_scientific_discovery,3,21.0,21.0,16.40625,21,28.4842,True,True,post,theriseofgenerativeaiformetalorganicframeworkdesignandsynthesis,53.24487865600877,landmark,True | ||
| 987 | −4389991855,10.1038/s41586-023-06887-8,,Discovery of a structural class of antibiotics with explainable deep learning,Nature,2023,article,autonomous_scientific_discovery,2,136.0,330.0,50.355807657599584,458,60.2776,False,True,post,50.355807657599584,landmark,True | 987 | +4389991855,10.1038/s41586-023-06887-8,,Discovery of a structural class of antibiotics with explainable deep learning,Nature,2023,article,autonomous_scientific_discovery,2,136.0,330.0,50.355807657599584,458,60.2776,False,True,post,discoveryofastructuralclassofantibioticswithexplainabledeeplearning,50.355807657599584,landmark,True | ||
| 988 | −4409069046,10.1038/s42256-025-01009-7,2404.07181,A predictive machine learning force-field framework for liquid electrolyte development,Nature Machine Intelligence,2025,article,autonomous_scientific_discovery,2,95.0,95.0,14.707545118504024,95,19.6308,False,True,post,48.094591213141065,landmark,True | 988 | +4409069046,10.1038/s42256-025-01009-7,2404.07181,A predictive machine learning force-field framework for liquid electrolyte development,Nature Machine Intelligence,2025,article,autonomous_scientific_discovery,2,95.0,95.0,14.707545118504024,95,19.6308,False,True,post,apredictivemachinelearningforcefieldframeworkforliquidelectrolytedevelopment,41.51229892758283,landmark,True | ||
| 989 | −4400064820,10.1038/s43588-026-01045-2,2406.17295,Less can be more for predicting properties with large language models,Nature Computational Science,2026,article,autonomous_scientific_discovery,5,13.0,13.0,10.024647887323944,13,1.4032,True,True,post,46.2178675312126,landmark,True | 989 | +3210165781,10.1016/j.xinn.2021.100179,,Artificial intelligence: A powerful paradigm for scientific research,The Innovation,2021,article,autonomous_scientific_discovery,1,93.0,334.0,38.92516828044519,1702,74.7191,True,True,baseline,artificialintelligenceapowerfulparadigmforscientificresearch,38.92516828044519,landmark,True | ||
| 990 | −4407922392,10.1038/s42256-025-00994-z,,Large language models for scientific discovery in molecular property prediction,Nature Machine Intelligence,2025,article,autonomous_scientific_discovery,3,83.0,83.0,34.86688949436066,83,40.2481,False,True,post,42.01948495463904,landmark,True | 990 | +4390940921,10.1038/s41586-023-06747-5,,Solving olympiad geometry without human demonstrations,Nature,2024,article,autonomous_scientific_discovery,2,207.0,307.0,38.13184279381587,307,45.3903,True,True,post,solvingolympiadgeometrywithouthumandemonstrations,38.13184279381587,landmark,True | ||
| 991 | −4407041525,10.1088/0256-307x/42/2/027403,2411.09429,"AI-Driven Inverse Design of Materials: Past, Present, and Future",Chinese Physics Letters,2025,article,autonomous_scientific_discovery,3,78.0,78.0,12.07566862361383,78,16.2894,True,True,post,39.488190680263195,landmark,True | 991 | +4407922392,10.1038/s42256-025-00994-z,,Large language models for scientific discovery in molecular property prediction,Nature Machine Intelligence,2025,article,autonomous_scientific_discovery,3,83.0,83.0,34.86688949436066,83,40.2481,False,True,post,largelanguagemodelsforscientificdiscoveryinmolecularpropertyprediction,36.268640115677634,landmark,True | ||
| 992 | −7128476819,10.3389/frai.2026.1678539,,The future of fundamental science led by generative closed-loop artificial intelligence,Frontiers in Artificial Intelligence,2026,article,autonomous_scientific_discovery,4,11.0,11.0,12.24081685075777,11,32.5136,True,True,post,39.107426372564504,landmark,True | 992 | +4225106311,10.1038/s41586-022-04501-x,,FAIR data enabling new horizons for materials research,Nature,2022,article,autonomous_scientific_discovery,1,77.0,145.0,35.636787972031094,247,48.6434,True,True,baseline,fairdataenablingnewhorizonsformaterialsresearch,35.636787972031094,landmark,True | ||
| 993 | −4410552772,10.1021/acs.accounts.5c00155,,"ASKCOS: Open-Source, Data-Driven Synthesis Planning",Accounts of Chemical Research,2025,article,autonomous_scientific_discovery,4,77.0,77.0,32.34639145862375,77,37.3386,True,True,post,38.981931825388024,landmark,True | 993 | +4407041525,10.1088/0256-307x/42/2/027403,2411.09429,"AI-Driven Inverse Design of Materials: Past, Present, and Future",Chinese Physics Letters,2025,article,autonomous_scientific_discovery,3,78.0,78.0,12.07566862361383,78,16.2894,True,True,post,aidriveninversedesignofmaterialspastpresentandfuture,34.0837822773838,landmark,True | ||
| 994 | −3210165781,10.1016/j.xinn.2021.100179,,Artificial intelligence: A powerful paradigm for scientific research,The Innovation,2021,article,autonomous_scientific_discovery,1,93.0,334.0,38.92516828044519,1702,74.7191,True,True,baseline,38.92516828044519,landmark,True | 994 | +4410552772,10.1021/acs.accounts.5c00155,,"ASKCOS: Open-Source, Data-Driven Synthesis Planning",Accounts of Chemical Research,2025,article,autonomous_scientific_discovery,4,77.0,77.0,32.34639145862375,77,37.3386,True,True,post,askcosopensourcedatadrivensynthesisplanning,33.64681070972503,landmark,True | ||
| 995 | −4407002549,10.3389/frai.2025.1518049,,"Benefits, limits, and risks of ChatGPT in medicine",Frontiers in Artificial Intelligence,2025,article,autonomous_scientific_discovery,4,76.0,76.0,5.054948135688253,76,15.5609,True,True,post,38.47567297051285,landmark,True | 995 | +4407002549,10.3389/frai.2025.1518049,,"Benefits, limits, and risks of ChatGPT in medicine",Frontiers in Artificial Intelligence,2025,article,autonomous_scientific_discovery,4,76.0,76.0,5.054948135688253,76,15.5609,True,True,post,benefitslimitsandrisksofchatgptinmedicine,33.209839142066265,landmark,True | ||
| 996 | −4390940921,10.1038/s41586-023-06747-5,,Solving olympiad geometry without human demonstrations,Nature,2024,article,autonomous_scientific_discovery,2,207.0,307.0,38.13184279381587,307,45.3903,True,True,post,38.13184279381587,landmark,True | 996 | +4400064820,10.1038/s43588-026-01045-2,2406.17295,Less can be more for predicting properties with large language models,Nature Computational Science,2026,article,autonomous_scientific_discovery,5,13.0,13.0,10.024647887323944,13,1.4032,True,True,post,lesscanbemoreforpredictingpropertieswithlargelanguagemodels,32.96111535848162,landmark,True | ||
| 997 | −4225106311,10.1038/s41586-022-04501-x,,FAIR data enabling new horizons for materials research,Nature,2022,article,autonomous_scientific_discovery,1,77.0,145.0,35.636787972031094,247,48.6434,True,True,baseline,35.636787972031094,landmark,True | 997 | +4389991792,10.1038/s41586-023-06792-0,,Autonomous chemical research with large language models,Nature,2023,article,autonomous_scientific_discovery,4,189.0,590.0,32.419795221843,1012,71.2047,True,True,post,autonomouschemicalresearchwithlargelanguagemodels,32.419795221843,landmark,True | ||
| 998 | −4415202617,10.1016/j.matt.2026.102812,2503.08537,Chemical reasoning in LLMs unlocks strategy-aware synthesis planning and reaction mechanism elucidation,Matter,2026,article,autonomous_scientific_discovery,5,10.0,10.0,28.23608727629321,10,28.511,True,True,post,35.552205793240454,landmark,True | 998 | +4386740800,10.1038/s42256-023-00716-3,,CHGNet as a pretrained universal neural network potential for charge-informed atomistic modelling,Nature Machine Intelligence,2023,article,autonomous_scientific_discovery,5,176.0,566.0,31.101023890784983,916,64.5205,True,True,post,chgnetasapretraineduniversalneuralnetworkpotentialforchargeinformedatomisticmodelling,31.101023890784983,landmark,True | ||
| 999 | −4368755578,10.1007/s10994-025-06955-2,2305.02251,Automated Scientific Discovery: From Equation Discovery to Autonomous Discovery Systems,Machine Learning,2026,article,autonomous_scientific_discovery,4,10.0,10.0,7.711267605633803,10,9.8221,True,True,post,35.552205793240454,landmark,True | 999 | +4393097303,10.1038/s42256-024-00809-7,,Generative AI for designing and validating easily synthesizable and structurally novel antibiotics,Nature Machine Intelligence,2024,article,autonomous_scientific_discovery,3,113.0,184.0,30.576808146450436,184,36.0713,False,False,post,generativeaifordesigningandvalidatingeasilysynthesizableandstructurallynovelantibiotics,30.576808146450436,landmark,True | ||
| 1000 | −4389991792,10.1038/s41586-023-06792-0,,Autonomous chemical research with large language models,Nature,2023,article,autonomous_scientific_discovery,4,189.0,590.0,32.419795221843,1012,71.2047,True,True,post,32.419795221843,landmark,True | 1000 | +2769423117,10.1039/c8sc02339e,,“Found in Translation”: predicting outcomes of complex organic chemistry reactions using neural sequence-to-sequence models,Chemical Science,2018,article,autonomous_scientific_discovery,3,65.0,126.0,29.96965136075403,441,34.7969,True,True,baseline,foundintranslationpredictingoutcomesofcomplexorganicchemistryreactionsusingneuralsequencetosequencemodels,29.96965136075403,landmark,True | ||
| 1001 | −4402696779,10.1145/3794853,2408.08044,Crystalline Material Discovery in the Era of Artificial Intelligence,ACM Computing Surveys,2026,article,autonomous_scientific_discovery,4,9.0,9.0,6.940140845070423,9,5.6126,True,True,post,31.99698521391641,landmark,True | 1001 | +4391561379,10.1038/s42256-023-00788-1,,Leveraging large language models for predictive chemistry,Nature Machine Intelligence,2024,article,autonomous_scientific_discovery,6,257.0,367.0,28.992373363688102,367,34.6508,True,True,post,leveraginglargelanguagemodelsforpredictivechemistry,28.992373363688102,landmark,True | ||
| 1002 | −4200503948,10.7735/ksmte.2021.30.6.513,2004.10934,Comparative Analysis of Defect Detection Using YOLO of Deep Learning,Journal of the korean society of manufacturing technology engineers,2021,article,computer_vision,3,4221.0,6845.0,406.01302821116474,8,0.9035,True,True,baseline,406.01302821116474,landmark,True | 1002 | +2796347433,10.48550/arxiv.1804.02767,1804.02767,YOLOv3: An Incremental Improvement,arXiv (Cornell University),2018,preprint,computer_vision,5,1204.0,3187.0,289.4544999852894,5512,,True,True,baseline,yolov3anincrementalimprovement,289.4544999852894,landmark,True | ||
| 1003 | −1797268635,10.57702/i9oeewf6,,Caltech-UCSD Birds-200-2011 Dataset,CaltechAUTHORS (California Institute of Technology),2024,article,computer_vision,2,3520.0,3523.0,417.3662846615462,3525,69.4971,True,True,post,417.3662846615462,landmark,True | 1003 | +4360620450,10.1016/j.ijinfomgt.2023.102642,,"Opinion Paper: “So what if ChatGPT wrote it?” Multidisciplinary perspectives on opportunities, challenges and implications of generative conversational AI for research, practice and policy",International Journal of Information Management,2023,article,llm,3,1920.0,3137.0,113.51170057881467,4478,1093.1295,True,True,post,opinionpapersowhatifchatgptwroteitmultidisciplinaryperspectivesonopportunitieschallengesandimplicationsofgenerativeconversationalaiforresearchpracticeandpolicy,113.51170057881467,landmark,True | ||
| 1004 | −2963163009,10.1109/cvpr.2018.00474,1801.04381,MobileNetV2: Inverted Residuals and Linear Bottlenecks,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2018,conference-paper,computer_vision,3,1242.0,3514.0,430.50535987748856,27247,513.8505,True,True,baseline,430.50535987748856,landmark,True | 1004 | +4320002812,10.1109/jproc.2023.3238524,1905.05055,Object Detection in 20 Years: A Survey,Proceedings of the IEEE,2023,article,computer_vision,2,2067.0,3080.0,320.84963557411936,3650,278.5821,True,True,post,objectdetectionin20yearsasurvey,320.84963557411936,landmark,True | ||
| 1005 | −4309506674,10.1093/nar/gkac1052,,UniProt: the Universal Protein Knowledgebase in 2023,Nucleic Acids Research,2022,article,computational_biology,1,932.0,3250.0,165.18542488185184,6940,383.312,True,True,baseline,165.18542488185184,landmark,True | 1005 | +4391109864,10.1038/s41467-024-44824-z,,Segment anything in medical images,Nature Communications,2024,article,computer_vision,3,1944.0,3007.0,356.2362810040504,2941,409.3548,True,True,post,segmentanythinginmedicalimages,356.2362810040504,landmark,True | ||
| 1006 | −2796347433,10.48550/arxiv.1804.02767,1804.02767,YOLOv3: An Incremental Improvement,arXiv (Cornell University),2018,preprint,computer_vision,5,1204.0,3187.0,289.4544999852894,5512,,True,True,baseline,289.4544999852894,landmark,True | 1006 | +3030520226,10.1007/978-3-030-58452-8_13,2005.12872,End-to-End Object Detection with Transformers,Lecture notes in computer science,2020,conference-paper,computer_vision,3,864.0,2877.0,348.31327045713607,16417,486.7957,False,True,baseline,endtoendobjectdetectionwithtransformers,348.31327045713607,landmark,True | ||
| 1007 | −4220831425,10.1093/nar/gkac194,,DAVID: a web server for functional enrichment analysis and functional annotation of gene lists (2021 update),Nucleic Acids Research,2022,article,computational_biology,1,1461.0,3170.0,161.11932211552934,6142,356.4505,True,True,baseline,161.11932211552934,landmark,True | 1007 | +4308834893,10.1093/nar/gkac1000,,The STRING database in 2023: protein–protein association networks and functional enrichment analyses for any sequenced genome of interest,Nucleic Acids Research,2022,article,computational_biology,3,535.0,2781.0,141.34789741428614,9363,448.2907,True,True,baseline,thestringdatabasein2023proteinproteinassociationnetworksandfunctionalenrichmentanalysesforanysequencedgenomeofinterest,141.34789741428614,landmark,True | ||
| 1008 | −4360620450,10.1016/j.ijinfomgt.2023.102642,,"Opinion Paper: “So what if ChatGPT wrote it?” Multidisciplinary perspectives on opportunities, challenges and implications of generative conversational AI for research, practice and policy",International Journal of Information Management,2023,article,llm,3,1920.0,3137.0,113.51170057881467,4478,1093.1295,True,True,post,113.51170057881467,landmark,True | 1008 | +2904367110,10.1109/cvpr.2019.00453,1812.04948,A Style-Based Generator Architecture for Generative Adversarial Networks,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2019,conference-paper,computer_vision,4,1224.0,2727.0,332.8687255628226,11051,354.5442,True,True,baseline,astylebasedgeneratorarchitectureforgenerativeadversarialnetworks,332.8687255628226,landmark,True | ||
| 1009 | −2752782242,10.1109/cvpr.2018.00745,,Squeeze-and-Excitation Networks,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2018,conference-paper,computer_vision,4,1289.0,3107.0,380.64318529862175,30519,447.0037,True,False,baseline,380.64318529862175,landmark,True | 1009 | +3112376646,10.1093/nar/gkaa1100,,UniProt: the universal protein knowledgebase in 2021,Nucleic Acids Research,2020,article,computational_biology,1,679.0,2641.0,150.5152761457109,6342,306.9602,True,True,baseline,uniprottheuniversalproteinknowledgebasein2021,150.5152761457109,landmark,True | ||
| 1010 | −4320002812,10.1109/jproc.2023.3238524,1905.05055,Object Detection in 20 Years: A Survey,Proceedings of the IEEE,2023,article,computer_vision,2,2067.0,3080.0,320.84963557411936,3650,278.5821,True,True,post,320.84963557411936,landmark,True | 1010 | +2900569176,10.1093/nar/gky1131,,"STRING v11: protein–protein association networks with increased coverage, supporting functional discovery in genome-wide experimental datasets",Nucleic Acids Research,2018,article,computational_biology,3,421.0,2624.0,131.1704666044956,17675,509.3871,True,True,baseline,stringv11proteinproteinassociationnetworkswithincreasedcoveragesupportingfunctionaldiscoveryingenomewideexperimentaldatasets,131.1704666044956,landmark,True | ||
| 1011 | −4391109864,10.1038/s41467-024-44824-z,,Segment anything in medical images,Nature Communications,2024,article,computer_vision,3,1944.0,3007.0,356.2362810040504,2941,409.3548,True,True,post,356.2362810040504,landmark,True | 1011 | +3185341429,10.1145/3560815,2107.13586,"Pre-train, Prompt, and Predict: A Systematic Survey of Prompting Methods in Natural Language Processing",ACM Computing Surveys,2022,article,llm,6,1233.0,2462.0,253.6835252173668,4309,297.4377,True,True,baseline,pretrainpromptandpredictasystematicsurveyofpromptingmethodsinnaturallanguageprocessing,253.6835252173668,landmark,True | ||
| 1012 | −3030520226,10.1007/978-3-030-58452-8_13,2005.12872,End-to-End Object Detection with Transformers,Lecture notes in computer science,2020,conference-paper,computer_vision,3,864.0,2877.0,348.31327045713607,16417,486.7957,False,True,baseline,348.31327045713607,landmark,True | 1012 | +2804822363,10.1093/nar/gky427,,SWISS-MODEL: homology modelling of protein structures and complexes,Nucleic Acids Research,2018,article,computational_biology,3,904.0,2454.0,122.67237997234459,13067,345.6079,True,True,baseline,swissmodelhomologymodellingofproteinstructuresandcomplexes,122.67237997234459,landmark,True | ||
| 1013 | −4308834893,10.1093/nar/gkac1000,,The STRING database in 2023: protein–protein association networks and functional enrichment analyses for any sequenced genome of interest,Nucleic Acids Research,2022,article,computational_biology,3,535.0,2781.0,141.34789741428614,9363,448.2907,True,True,baseline,141.34789741428614,landmark,True | 1013 | +4384071683,10.1038/s41586-023-06291-2,2212.13138,Large language models encode clinical knowledge,Nature,2023,article,llm,5,1174.0,2448.0,38.05321679482215,3967,137.2207,True,True,post,largelanguagemodelsencodeclinicalknowledge,38.05321679482215,landmark,True | ||
| 1014 | −2927961455,10.1093/nar/gkz239,,Interactive Tree Of Life (iTOL) v4: recent updates and new developments,Nucleic Acids Research,2019,article,computational_biology,3,1166.0,2754.0,153.24396298061907,5925,277.073,True,True,baseline,153.24396298061907,landmark,True | 1014 | +2964309882,10.1007/978-3-030-01234-2_49,1802.02611,Encoder-Decoder with Atrous Separable Convolution for Semantic Image Segmentation,Lecture notes in computer science,2018,conference-paper,computer_vision,3,954.0,2432.0,297.947932618683,18734,350.6183,False,True,baseline,encoderdecoderwithatrousseparableconvolutionforsemanticimagesegmentation,297.947932618683,landmark,True | ||
| 1015 | −2904367110,10.1109/cvpr.2019.00453,1812.04948,A Style-Based Generator Architecture for Generative Adversarial Networks,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2019,conference-paper,computer_vision,4,1224.0,2727.0,332.8687255628226,11051,354.5442,True,True,baseline,332.8687255628226,landmark,True | 1015 | +4384918448,10.48550/arxiv.2307.09288,2307.09288,Behavioral Safety and Context Retention of Large Language Models in a Longitudinal ICU Simulation under Offline Conditions,arXiv (Cornell University),2023,preprint,llm,6,1623.0,2431.0,88.45470297029703,2595,,True,True,post,behavioralsafetyandcontextretentionoflargelanguagemodelsinalongitudinalicusimulationunderofflineconditions,88.45470297029703,landmark,True | ||
| 1016 | −3112376646,10.1093/nar/gkaa1100,,UniProt: the universal protein knowledgebase in 2021,Nucleic Acids Research,2020,article,computational_biology,1,679.0,2641.0,150.5152761457109,6342,306.9602,True,True,baseline,150.5152761457109,landmark,True | 1016 | +3208691473,10.1093/nar/gkab1038,,The PRIDE database resources in 2022: a hub for mass spectrometry-based proteomics evidences,Nucleic Acids Research,2021,article,computational_biology,2,743.0,2312.0,100.20101036958255,6103,381.4154,True,True,baseline,thepridedatabaseresourcesin2022ahubformassspectrometrybasedproteomicsevidences,100.20101036958255,landmark,True | ||
| 1017 | −2900569176,10.1093/nar/gky1131,,"STRING v11: protein–protein association networks with increased coverage, supporting functional discovery in genome-wide experimental datasets",Nucleic Acids Research,2018,article,computational_biology,3,421.0,2624.0,131.1704666044956,17675,509.3871,True,True,baseline,131.1704666044956,landmark,True | 1017 | +3034971973,10.1109/cvpr42600.2020.01079,1911.09070,EfficientDet: Scalable and Efficient Object Detection,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2020,conference-paper,computer_vision,4,1099.0,2290.0,277.2462250075918,9258,321.5836,True,True,baseline,efficientdetscalableandefficientobjectdetection,277.2462250075918,landmark,True | ||
| 1018 | −3185341429,10.1145/3560815,2107.13586,"Pre-train, Prompt, and Predict: A Systematic Survey of Prompting Methods in Natural Language Processing",ACM Computing Surveys,2022,article,llm,6,1233.0,2462.0,253.6835252173668,4309,297.4377,True,True,baseline,253.6835252173668,landmark,True | 1018 | +4388823657,10.3390/make5040083,2304.00501,A Comprehensive Review of YOLO Architectures in Computer Vision: From YOLOv1 to YOLOv8 and YOLO-NAS,Machine Learning and Knowledge Extraction,2023,article,computer_vision,4,907.0,2277.0,237.19955201372395,3052,277.6729,True,True,post,acomprehensivereviewofyoloarchitecturesincomputervisionfromyolov1toyolov8andyolonas,237.19955201372395,landmark,True | ||
| 1019 | −2804822363,10.1093/nar/gky427,,SWISS-MODEL: homology modelling of protein structures and complexes,Nucleic Acids Research,2018,article,computational_biology,3,904.0,2454.0,122.67237997234459,13067,345.6079,True,True,baseline,122.67237997234459,landmark,True | 1019 | +2938574745,10.1093/nar/gkz268,,The EMBL-EBI search and sequence analysis tools APIs in 2019,Nucleic Acids Research,2019,article,computational_biology,2,1094.0,2262.0,149.0781904899552,4162,956.3441,True,True,baseline,theemblebisearchandsequenceanalysistoolsapisin2019,149.0781904899552,landmark,True | ||
| 1020 | −4384071683,10.1038/s41586-023-06291-2,2212.13138,Large language models encode clinical knowledge,Nature,2023,article,llm,5,1174.0,2448.0,38.05321679482215,3967,137.2207,True,True,post,38.05321679482215,landmark,True | 1020 | +2954996726,10.1186/s40537-019-0197-0,,A survey on Image Data Augmentation for Deep Learning,Journal Of Big Data,2019,article,computer_vision,3,636.0,2134.0,323.4516322601615,13005,461.5342,True,True,baseline,asurveyonimagedataaugmentationfordeeplearning,323.4516322601615,landmark,True | ||
| 1021 | −2964309882,10.1007/978-3-030-01234-2_49,1802.02611,Encoder-Decoder with Atrous Separable Convolution for Semantic Image Segmentation,Lecture notes in computer science,2018,conference-paper,computer_vision,3,954.0,2432.0,297.947932618683,18734,350.6183,False,True,baseline,297.947932618683,landmark,True | 1021 | +3187418919,10.1109/tpami.2022.3152247,2012.12556,A Survey on Vision Transformer,IEEE Transactions on Pattern Analysis and Machine Intelligence,2022,article,computer_vision,6,982.0,2110.0,226.46590993554688,4585,293.5626,True,True,baseline,asurveyonvisiontransformer,226.46590993554688,landmark,True | ||
| 1022 | −4384918448,10.48550/arxiv.2307.09288,2307.09288,Behavioral Safety and Context Retention of Large Language Models in a Longitudinal ICU Simulation under Offline Conditions,arXiv (Cornell University),2023,preprint,llm,6,1623.0,2431.0,88.45470297029703,2595,,True,True,post,88.45470297029703,landmark,True | 1022 | +3136918052,10.1093/nar/gky1049,,UniProt: a worldwide hub of protein knowledge,Nucleic Acids Research,2018,article,computational_biology,1,457.0,2078.0,103.87661189182235,7679,309.1951,True,True,baseline,uniprotaworldwidehubofproteinknowledge,103.87661189182235,landmark,True | ||
| 1023 | −3208691473,10.1093/nar/gkab1038,,The PRIDE database resources in 2022: a hub for mass spectrometry-based proteomics evidences,Nucleic Acids Research,2021,article,computational_biology,2,743.0,2312.0,100.20101036958255,6103,381.4154,True,True,baseline,100.20101036958255,landmark,True | 1023 | +3107527779,10.1093/nar/gkaa1074,,"The STRING database in 2021: customizable protein–protein networks, and functional characterization of user-uploaded gene/measurement sets",Nucleic Acids Research,2020,article,computational_biology,4,246.0,2031.0,115.75029377203289,8015,303.9867,True,True,baseline,thestringdatabasein2021customizableproteinproteinnetworksandfunctionalcharacterizationofuseruploadedgenemeasurementsets,115.75029377203289,landmark,True | ||
| 1024 | −3034971973,10.1109/cvpr42600.2020.01079,1911.09070,EfficientDet: Scalable and Efficient Object Detection,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2020,conference-paper,computer_vision,4,1099.0,2290.0,277.2462250075918,9258,321.5836,True,True,baseline,277.2462250075918,landmark,True | 1024 | +3159995035,10.1093/nar/gkab382,,MetaboAnalyst 5.0: narrowing the gap between raw spectra and functional insights,Nucleic Acids Research,2021,article,computational_biology,3,1102.0,2027.0,117.64839283140344,3958,207.4321,True,True,baseline,metaboanalyst50narrowingthegapbetweenrawspectraandfunctionalinsights,117.64839283140344,landmark,True | ||
| 1025 | −4388823657,10.3390/make5040083,2304.00501,A Comprehensive Review of YOLO Architectures in Computer Vision: From YOLOv1 to YOLOv8 and YOLO-NAS,Machine Learning and Knowledge Extraction,2023,article,computer_vision,4,907.0,2277.0,237.19955201372395,3052,277.6729,True,True,post,237.19955201372395,landmark,True | 1025 | +3095583226,10.1093/nar/gkaa913,,Pfam: The protein families database in 2021,Nucleic Acids Research,2020,article,computational_biology,1,792.0,1991.0,113.47062279670975,7261,214.3673,True,True,baseline,pfamtheproteinfamiliesdatabasein2021,113.47062279670975,landmark,True | ||
| 1026 | −2938574745,10.1093/nar/gkz268,,The EMBL-EBI search and sequence analysis tools APIs in 2019,Nucleic Acids Research,2019,article,computational_biology,2,1094.0,2262.0,149.0781904899552,4162,956.3441,True,True,baseline,149.0781904899552,landmark,True | 1026 | +2995327724,10.1109/cvpr42600.2020.00813,1912.04958,Analyzing and Improving the Image Quality of StyleGAN,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2020,conference-paper,computer_vision,5,1027.0,1989.0,240.80469062886468,6002,265.6208,True,True,baseline,analyzingandimprovingtheimagequalityofstylegan,240.80469062886468,landmark,True | ||
| 1027 | −2954996726,10.1186/s40537-019-0197-0,,A survey on Image Data Augmentation for Deep Learning,Journal Of Big Data,2019,article,computer_vision,3,636.0,2134.0,323.4516322601615,13005,461.5342,True,True,baseline,323.4516322601615,landmark,True | 1027 | +2784874046,10.1109/cvpr.2019.00482,1801.07698,ArcFace: Additive Angular Margin Loss for Deep Face Recognition,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2019,conference-paper,computer_vision,3,955.0,1970.0,240.46622272048424,7537,250.3062,True,True,baseline,arcfaceadditiveangularmarginlossfordeepfacerecognition,240.46622272048424,landmark,True | ||
| 1028 | −3187418919,10.1109/tpami.2022.3152247,2012.12556,A Survey on Vision Transformer,IEEE Transactions on Pattern Analysis and Machine Intelligence,2022,article,computer_vision,6,982.0,2110.0,226.46590993554688,4585,293.5626,True,True,baseline,226.46590993554688,landmark,True | 1028 | +3177052299,10.1109/cvpr46437.2021.01350,2103.02907,Coordinate Attention for Efficient Mobile Network Design,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2021,conference-paper,computer_vision,5,672.0,1959.0,244.60506070745512,6447,314.9922,True,True,baseline,coordinateattentionforefficientmobilenetworkdesign,244.60506070745512,landmark,True | ||
| 1029 | −3136918052,10.1093/nar/gky1049,,UniProt: a worldwide hub of protein knowledge,Nucleic Acids Research,2018,article,computational_biology,1,457.0,2078.0,103.87661189182235,7679,309.1951,True,True,baseline,103.87661189182235,landmark,True | 1029 | +3096828292,10.1093/nar/gkaa970,,KEGG: integrating viruses and cellular organisms,Nucleic Acids Research,2020,article,computational_biology,1,541.0,1955.0,111.4189189189189,4022,222.942,True,True,baseline,keggintegratingvirusesandcellularorganisms,111.4189189189189,landmark,True | ||
| 1030 | −3107527779,10.1093/nar/gkaa1074,,"The STRING database in 2021: customizable protein–protein networks, and functional characterization of user-uploaded gene/measurement sets",Nucleic Acids Research,2020,article,computational_biology,4,246.0,2031.0,115.75029377203289,8015,303.9867,True,True,baseline,115.75029377203289,landmark,True | 1030 | +4386072096,10.1109/cvpr52729.2023.02155,,DreamBooth: Fine Tuning Text-to-Image Diffusion Models for Subject-Driven Generation,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2023,conference-paper,computer_vision,6,1113.0,1918.0,267.65970062911276,2234,253.5618,True,False,baseline,dreamboothfinetuningtexttoimagediffusionmodelsforsubjectdrivengeneration,267.65970062911276,landmark,True | ||
| 1031 | −3159995035,10.1093/nar/gkab382,,MetaboAnalyst 5.0: narrowing the gap between raw spectra and functional insights,Nucleic Acids Research,2021,article,computational_biology,3,1102.0,2027.0,117.64839283140344,3958,207.4321,True,True,baseline,117.64839283140344,landmark,True | 1031 | +3119997354,10.1145/3505244,2101.01169,Transformers in Vision: A Survey,ACM Computing Surveys,2022,article,computer_vision,9,1080.0,1899.0,203.8193189419922,3536,224.1986,True,True,baseline,transformersinvisionasurvey,203.8193189419922,landmark,True | ||
| 1032 | −3095583226,10.1093/nar/gkaa913,,Pfam: The protein families database in 2021,Nucleic Acids Research,2020,article,computational_biology,1,792.0,1991.0,113.47062279670975,7261,214.3673,True,True,baseline,113.47062279670975,landmark,True | 1032 | +4386047745,10.1109/cvpr52729.2023.01157,2303.03667,"Run, Don't Walk: Chasing Higher FLOPS for Faster Neural Networks",IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2023,conference-paper,computer_vision,7,879.0,1888.0,263.4731568236522,2343,266.4104,True,True,post,rundontwalkchasinghigherflopsforfasterneuralnetworks,263.4731568236522,landmark,True | ||
| 1033 | −2995327724,10.1109/cvpr42600.2020.00813,1912.04958,Analyzing and Improving the Image Quality of StyleGAN,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2020,conference-paper,computer_vision,5,1027.0,1989.0,240.80469062886468,6002,265.6208,True,True,baseline,240.80469062886468,landmark,True | 1033 | +3171007011,10.1109/cvpr46437.2021.01549,,Exploring Simple Siamese Representation Learning,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2021,conference-paper,computer_vision,3,954.0,1869.0,296.32486388384757,3498,304.7959,True,False,baseline,exploringsimplesiameserepresentationlearning,296.32486388384757,landmark,True | ||
| 1034 | −2784874046,10.1109/cvpr.2019.00482,1801.07698,ArcFace: Additive Angular Margin Loss for Deep Face Recognition,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2019,conference-paper,computer_vision,3,955.0,1970.0,240.46622272048424,7537,250.3062,True,True,baseline,240.46622272048424,landmark,True | 1034 | +2955058313,10.1109/cvpr.2019.00326,1809.02983,Dual Attention Network for Scene Segmentation,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2019,conference-paper,computer_vision,3,709.0,1862.0,227.28330289621402,6834,261.5228,True,True,baseline,dualattentionnetworkforscenesegmentation,227.28330289621402,landmark,True | ||
| 1035 | −3177052299,10.1109/cvpr46437.2021.01350,2103.02907,Coordinate Attention for Efficient Mobile Network Design,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2021,conference-paper,computer_vision,5,672.0,1959.0,244.60506070745512,6447,314.9922,True,True,baseline,244.60506070745512,landmark,True | 1035 | +2736941579,10.1109/cvpr.2018.00907,1707.07012,Learning Transferable Architectures for Scalable Image Recognition,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2018,conference-paper,computer_vision,4,845.0,1862.0,228.11638591117918,6249,236.7712,True,True,baseline,learningtransferablearchitecturesforscalableimagerecognition,228.11638591117918,landmark,True | ||
| 1036 | −3096828292,10.1093/nar/gkaa970,,KEGG: integrating viruses and cellular organisms,Nucleic Acids Research,2020,article,computational_biology,1,541.0,1955.0,111.4189189189189,4022,222.942,True,True,baseline,111.4189189189189,landmark,True | 1036 | +3131500599,10.1109/iccv48922.2021.00061,,Pyramid Vision Transformer: A Versatile Backbone for Dense Prediction without Convolutions,IEEE/CVF International Conference on Computer Vision (ICCV),2021,conference-paper,computer_vision,4,730.0,1844.0,230.24590706715023,4926,273.2358,True,False,baseline,pyramidvisiontransformeraversatilebackbonefordensepredictionwithoutconvolutions,230.24590706715023,landmark,True | ||
| 1037 | −4386072096,10.1109/cvpr52729.2023.02155,,DreamBooth: Fine Tuning Text-to-Image Diffusion Models for Subject-Driven Generation,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2023,conference-paper,computer_vision,6,1113.0,1918.0,267.65970062911276,2234,253.5618,True,False,baseline,267.65970062911276,landmark,True | 1037 | +2999607073,10.1109/tpami.2021.3059968,2001.05566,Image Segmentation Using Deep Learning: A Survey,IEEE Transactions on Pattern Analysis and Machine Intelligence,2021,article,computer_vision,5,1058.0,1837.0,219.61025275964155,3634,227.7791,True,True,baseline,imagesegmentationusingdeeplearningasurvey,219.61025275964155,landmark,True | ||
| 1038 | −3119997354,10.1145/3505244,2101.01169,Transformers in Vision: A Survey,ACM Computing Surveys,2022,article,computer_vision,9,1080.0,1899.0,203.8193189419922,3536,224.1986,True,True,baseline,203.8193189419922,landmark,True | 1038 | +4404612908,10.1007/978-3-031-72970-6_3,,Grounding DINO: Marrying DINO with Grounded Pre-training for Open-Set Object Detection,Lecture notes in computer science,2024,conference-paper,computer_vision,4,1177.0,1834.0,384.91288350030993,1834,395.6291,False,False,post,groundingdinomarryingdinowithgroundedpretrainingforopensetobjectdetection,384.91288350030993,landmark,True | ||
| 1039 | −4386047745,10.1109/cvpr52729.2023.01157,2303.03667,"Run, Don't Walk: Chasing Higher FLOPS for Faster Neural Networks",IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2023,conference-paper,computer_vision,7,879.0,1888.0,263.4731568236522,2343,266.4104,True,True,post,263.4731568236522,landmark,True | 1039 | +4393065402,10.1007/s11704-024-40231-1,2308.11432,A survey on large language model based autonomous agents,Frontiers of Computer Science,2024,article,llm,3,876.0,1820.0,226.05848170926672,1820,269.514,True,True,post,asurveyonlargelanguagemodelbasedautonomousagents,226.05848170926672,landmark,True | ||
| 1040 | −4224035735,10.48550/arxiv.2204.06125,2204.06125,Hierarchical Text-Conditional Image Generation with CLIP Latents,arXiv (Cornell University),2022,preprint,computer_vision,5,904.0,1882.0,408.5254913442887,2203,,True,True,baseline,408.5254913442887,landmark,True | 1040 | +2899760200,10.1093/nar/gky1106,,The PRIDE database and related tools and resources in 2019: improving support for quantification data,Nucleic Acids Research,2018,article,computational_biology,3,507.0,1805.0,74.32352941176471,6693,384.4369,True,True,baseline,thepridedatabaseandrelatedtoolsandresourcesin2019improvingsupportforquantificationdata,74.32352941176471,landmark,True | ||
| 1041 | −2963091558,10.1109/cvpr.2018.00813,1711.07971,Non-local Neural Networks,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2018,conference-paper,computer_vision,4,654.0,1881.0,230.44410413476265,10954,299.8487,True,True,baseline,230.44410413476265,landmark,True | 1041 | +2963125010,10.1109/cvpr.2018.00716,,ShuffleNet: An Extremely Efficient Convolutional Neural Network for Mobile Devices,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2018,conference-paper,computer_vision,3,843.0,1788.0,219.05053598774887,9452,225.5404,True,True,baseline,shufflenetanextremelyefficientconvolutionalneuralnetworkformobiledevices,219.05053598774887,landmark,True | ||
| 1042 | −4398756379,10.1109/adics58448.2024.10533619,,YOLOv8: A Novel Object Detection Algorithm with Enhanced Performance and Robustness,,2024,conference-paper,computer_vision,2,1232.0,1876.0,393.72768235909564,1876,409.6027,True,False,post,393.72768235909564,landmark,True | 1042 | +4225672218,10.1109/cvpr52688.2022.00564,2111.09881,Restormer: Efficient Transformer for High-Resolution Image Restoration,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2022,conference-paper,computer_vision,6,674.0,1779.0,240.36855118869533,4143,303.731,True,True,baseline,restormerefficienttransformerforhighresolutionimagerestoration,240.36855118869533,landmark,True | ||
| 1043 | −3171007011,10.1109/cvpr46437.2021.01549,,Exploring Simple Siamese Representation Learning,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2021,conference-paper,computer_vision,3,954.0,1869.0,296.32486388384757,3498,304.7959,True,False,baseline,296.32486388384757,landmark,True | 1043 | +4223552703,10.1093/nar/gkac240,,Search and sequence analysis tools services from EMBL-EBI in 2022,Nucleic Acids Research,2022,article,computational_biology,2,862.0,1760.0,89.45426085909514,2267,150.397,True,True,baseline,searchandsequenceanalysistoolsservicesfromemblebiin2022,89.45426085909514,landmark,True | ||
| 1044 | −2955058313,10.1109/cvpr.2019.00326,1809.02983,Dual Attention Network for Scene Segmentation,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2019,conference-paper,computer_vision,3,709.0,1862.0,227.28330289621402,6834,261.5228,True,True,baseline,227.28330289621402,landmark,True | 1044 | +4368358469,10.1093/nar/gkad344,,"antiSMASH 7.0: new and improved predictions for detection, regulation, chemical structures and visualisation",Nucleic Acids Research,2023,article,computational_biology,1,830.0,1741.0,32.99382988100485,2290,294.6456,True,True,post,antismash70newandimprovedpredictionsfordetectionregulationchemicalstructuresandvisualisation,32.99382988100485,landmark,True | ||
| 1045 | −2736941579,10.1109/cvpr.2018.00907,1707.07012,Learning Transferable Architectures for Scalable Image Recognition,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2018,conference-paper,computer_vision,4,845.0,1862.0,228.11638591117918,6249,236.7712,True,True,baseline,228.11638591117918,landmark,True | 1045 | +3170841864,10.1109/cvpr46437.2021.00681,2012.15840,Rethinking Semantic Segmentation from a Sequence-to-Sequence Perspective with Transformers,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2021,conference-paper,computer_vision,4,814.0,1733.0,216.38620224911676,3695,231.1329,True,True,baseline,rethinkingsemanticsegmentationfromasequencetosequenceperspectivewithtransformers,216.38620224911676,landmark,True | ||
| 1046 | −3131500599,10.1109/iccv48922.2021.00061,,Pyramid Vision Transformer: A Versatile Backbone for Dense Prediction without Convolutions,IEEE/CVF International Conference on Computer Vision (ICCV),2021,conference-paper,computer_vision,4,730.0,1844.0,230.24590706715023,4926,273.2358,True,False,baseline,230.24590706715023,landmark,True | 1046 | +3027286012,10.1093/nar/gkaa407,,TIMER2.0 for analysis of tumor-infiltrating immune cells,Nucleic Acids Research,2020,article,computational_biology,2,587.0,1720.0,57.035267668961644,5209,230.0925,True,True,baseline,timer20foranalysisoftumorinfiltratingimmunecells,57.035267668961644,landmark,True | ||
| 1047 | −2999607073,10.1109/tpami.2021.3059968,2001.05566,Image Segmentation Using Deep Learning: A Survey,IEEE Transactions on Pattern Analysis and Machine Intelligence,2021,article,computer_vision,5,1058.0,1837.0,219.61025275964155,3634,227.7791,True,True,baseline,219.61025275964155,landmark,True | 1047 | +2999044305,10.1038/s41586-019-1923-7,,Improved protein structure prediction using potentials from deep learning,Nature,2020,article,computational_biology,1,1072.0,1692.0,96.4300822561692,3363,151.7168,False,True,baseline,improvedproteinstructurepredictionusingpotentialsfromdeeplearning,96.4300822561692,landmark,True | ||
| 1048 | −4404612908,10.1007/978-3-031-72970-6_3,,Grounding DINO: Marrying DINO with Grounded Pre-training for Open-Set Object Detection,Lecture notes in computer science,2024,conference-paper,computer_vision,4,1177.0,1834.0,384.91288350030993,1834,395.6291,False,False,post,384.91288350030993,landmark,True | 1048 | +3017855299,10.1016/j.compbiomed.2020.103792,,Automated detection of COVID-19 cases using deep neural networks with X-ray images,Computers in Biology and Medicine,2020,article,computer_vision,2,1049.0,1675.0,53.07790388996886,2594,236.7839,False,True,baseline,automateddetectionofcovid19casesusingdeepneuralnetworkswithxrayimages,53.07790388996886,landmark,True | ||
| 1049 | −4393065402,10.1007/s11704-024-40231-1,2308.11432,A survey on large language model based autonomous agents,Frontiers of Computer Science,2024,article,llm,3,876.0,1820.0,226.05848170926672,1820,269.514,True,True,post,226.05848170926672,landmark,True | 1049 | +2979750740,10.1145/3326362,1801.07829,Dynamic Graph CNN for Learning on Point Clouds,ACM Transactions on Graphics,2019,article,computer_vision,4,815.0,1673.0,204.21997406985423,7010,434.8669,True,True,baseline,dynamicgraphcnnforlearningonpointclouds,204.21997406985423,landmark,True | ||
| 1050 | −2899760200,10.1093/nar/gky1106,,The PRIDE database and related tools and resources in 2019: improving support for quantification data,Nucleic Acids Research,2018,article,computational_biology,3,507.0,1805.0,74.32352941176471,6693,384.4369,True,True,baseline,74.32352941176471,landmark,True | 1050 | +2925148167,10.1109/cvpr42600.2020.01164,1903.11027,nuScenes: A Multimodal Dataset for Autonomous Driving,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2020,conference-paper,computer_vision,6,935.0,1637.0,189.37948256099557,6888,578.0759,True,True,baseline,nuscenesamultimodaldatasetforautonomousdriving,189.37948256099557,landmark,True | ||
| 1051 | −2963125010,10.1109/cvpr.2018.00716,,ShuffleNet: An Extremely Efficient Convolutional Neural Network for Mobile Devices,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2018,conference-paper,computer_vision,3,843.0,1788.0,219.05053598774887,9452,225.5404,True,True,baseline,219.05053598774887,landmark,True | 1051 | +4402727764,10.1109/cvpr52733.2024.02484,2310.03744,Improved Baselines with Visual Instruction Tuning,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2024,conference-paper,computer_vision,8,1070.0,1637.0,343.5672793293388,1637,356.7648,True,True,post,improvedbaselineswithvisualinstructiontuning,343.5672793293388,landmark,True | ||
| 1052 | −4225672218,10.1109/cvpr52688.2022.00564,2111.09881,Restormer: Efficient Transformer for High-Resolution Image Restoration,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2022,conference-paper,computer_vision,6,674.0,1779.0,240.36855118869533,4143,303.731,True,True,baseline,240.36855118869533,landmark,True | 1052 | +2998508940,10.1609/aaai.v34i07.7000,,Random Erasing Data Augmentation,Proceedings of the AAAI Conference on Artificial Intelligence,2020,conference-paper,computer_vision,3,1114.0,1602.0,193.95128928478692,3303,157.9126,True,True,baseline,randomerasingdataaugmentation,193.95128928478692,landmark,True | ||
| 1053 | −4223552703,10.1093/nar/gkac240,,Search and sequence analysis tools services from EMBL-EBI in 2022,Nucleic Acids Research,2022,article,computational_biology,2,862.0,1760.0,89.45426085909514,2267,150.397,True,True,baseline,89.45426085909514,landmark,True | 1053 | +2962730651,10.1109/tpami.2019.2929257,1812.08008,OpenPose: Realtime Multi-Person 2D Pose Estimation Using Part Affinity Fields,IEEE Transactions on Pattern Analysis and Machine Intelligence,2019,article,computer_vision,1,634.0,1600.0,242.51293890171436,5491,280.2052,True,True,baseline,openposerealtimemultiperson2dposeestimationusingpartaffinityfields,242.51293890171436,landmark,True | ||
| 1054 | −4368358469,10.1093/nar/gkad344,,"antiSMASH 7.0: new and improved predictions for detection, regulation, chemical structures and visualisation",Nucleic Acids Research,2023,article,computational_biology,1,830.0,1741.0,32.99382988100485,2290,294.6456,True,True,post,32.99382988100485,landmark,True | 1054 | +4319083882,10.1038/d41586-023-00288-7,,ChatGPT: five priorities for research,Nature,2023,article,llm,2,1183.0,1590.0,145.96961527351755,1831,160.4149,False,True,post,chatgptfiveprioritiesforresearch,145.96961527351755,landmark,True | ||
| 1055 | −3170841864,10.1109/cvpr46437.2021.00681,2012.15840,Rethinking Semantic Segmentation from a Sequence-to-Sequence Perspective with Transformers,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2021,conference-paper,computer_vision,4,814.0,1733.0,216.38620224911676,3695,231.1329,True,True,baseline,216.38620224911676,landmark,True | 1055 | +2884367402,10.1109/tnnls.2018.2876865,1807.05511,Object Detection With Deep Learning: A Review,IEEE Transactions on Neural Networks and Learning Systems,2019,article,computer_vision,2,699.0,1580.0,239.4815271654429,5487,286.797,True,True,baseline,objectdetectionwithdeeplearningareview,239.4815271654429,landmark,True | ||
| 1056 | −3027286012,10.1093/nar/gkaa407,,TIMER2.0 for analysis of tumor-infiltrating immune cells,Nucleic Acids Research,2020,article,computational_biology,2,587.0,1720.0,57.035267668961644,5209,230.0925,True,True,baseline,57.035267668961644,landmark,True | 1056 | +3013601031,10.1007/s13246-020-00865-4,2003.11617,Covid-19: automatic detection from X-ray images utilizing transfer learning with convolutional neural networks,Physical and Engineering Sciences in Medicine,2020,article,computer_vision,3,1035.0,1579.0,50.03582701030497,2336,215.8286,False,True,baseline,covid19automaticdetectionfromxrayimagesutilizingtransferlearningwithconvolutionalneuralnetworks,50.03582701030497,landmark,True | ||
| 1057 | −2999044305,10.1038/s41586-019-1923-7,,Improved protein structure prediction using potentials from deep learning,Nature,2020,article,computational_biology,1,1072.0,1692.0,96.4300822561692,3363,151.7168,False,True,baseline,96.4300822561692,landmark,True | 1057 | +2803664483,10.1093/nar/gky310,,MetaboAnalyst 4.0: towards more transparent and integrative metabolomics analysis,Nucleic Acids Research,2018,article,computational_biology,4,660.0,1555.0,77.73249831173425,3629,185.9094,True,True,baseline,metaboanalyst40towardsmoretransparentandintegrativemetabolomicsanalysis,77.73249831173425,landmark,True | ||
| 1058 | −3017855299,10.1016/j.compbiomed.2020.103792,,Automated detection of COVID-19 cases using deep neural networks with X-ray images,Computers in Biology and Medicine,2020,article,computer_vision,2,1049.0,1675.0,53.07790388996886,2594,236.7839,False,True,baseline,53.07790388996886,landmark,True | 1058 | +2911489562,10.1093/bioinformatics/btz682,1901.08746,BioBERT: a pre-trained biomedical language representation model for biomedical text mining,Bioinformatics,2019,article,nlp,8,666.0,1526.0,84.91295842716947,7155,176.5991,True,True,baseline,biobertapretrainedbiomedicallanguagerepresentationmodelforbiomedicaltextmining,84.91295842716947,landmark,True | ||
| 1059 | −2979750740,10.1145/3326362,1801.07829,Dynamic Graph CNN for Learning on Point Clouds,ACM Transactions on Graphics,2019,article,computer_vision,4,815.0,1673.0,204.21997406985423,7010,434.8669,True,True,baseline,204.21997406985423,landmark,True | 1059 | +2942829220,10.1093/nar/gkz310,,antiSMASH 5.0: updates to the secondary metabolite genome mining pipeline,Nucleic Acids Research,2019,article,computational_biology,2,661.0,1520.0,18.891765924391507,2907,264.3601,True,True,baseline,antismash50updatestothesecondarymetabolitegenomeminingpipeline,18.891765924391507,landmark,True | ||
| 1060 | −2925148167,10.1109/cvpr42600.2020.01164,1903.11027,nuScenes: A Multimodal Dataset for Autonomous Driving,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2020,conference-paper,computer_vision,6,935.0,1637.0,189.37948256099557,6888,578.0759,True,True,baseline,189.37948256099557,landmark,True | 1060 | +4212875960,10.1109/wacv51458.2022.00181,2103.10504,UNETR: Transformers for 3D Medical Image Segmentation,IEEE/CVF Winter Conference on Applications of Computer Vision (WACV),2022,conference-paper,computer_vision,4,698.0,1509.0,203.88765809091694,3313,245.4958,True,True,baseline,unetrtransformersfor3dmedicalimagesegmentation,203.88765809091694,landmark,True | ||
| 1061 | −4402727764,10.1109/cvpr52733.2024.02484,2310.03744,Improved Baselines with Visual Instruction Tuning,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2024,conference-paper,computer_vision,8,1070.0,1637.0,343.5672793293388,1637,356.7648,True,True,post,343.5672793293388,landmark,True | 1061 | +4391876619,10.1162/tacl_a_00638,2307.03172,Lost in the Middle: How Language Models Use Long Contexts,Transactions of the Association for Computational Linguistics,2024,article,nlp,4,688.0,1484.0,184.32460816294056,1484,217.8733,True,True,post,lostinthemiddlehowlanguagemodelsuselongcontexts,184.32460816294056,landmark,True | ||
| 1062 | −2998508940,10.1609/aaai.v34i07.7000,,Random Erasing Data Augmentation,Proceedings of the AAAI Conference on Artificial Intelligence,2020,conference-paper,computer_vision,3,1114.0,1602.0,193.95128928478692,3303,157.9126,True,True,baseline,193.95128928478692,landmark,True | 1062 | +4399790131,10.1186/s40561-024-00316-7,,The effects of over-reliance on AI dialogue systems on students' cognitive abilities: a systematic review,Smart Learning Environments,2024,review,ai_safety,3,613.0,1484.0,81.80055076520247,1484,96.2475,True,True,post,theeffectsofoverrelianceonaidialoguesystemsonstudentscognitiveabilitiesasystematicreview,81.80055076520247,landmark,True | ||
| 1063 | −2962730651,10.1109/tpami.2019.2929257,1812.08008,OpenPose: Realtime Multi-Person 2D Pose Estimation Using Part Affinity Fields,IEEE Transactions on Pattern Analysis and Machine Intelligence,2019,article,computer_vision,1,634.0,1600.0,242.51293890171436,5491,280.2052,True,True,baseline,242.51293890171436,landmark,True | 1063 | +3184439416,10.48550/arxiv.2107.08430,2107.08430,YOLOX: Exceeding YOLO Series in 2021,arXiv (Cornell University),2021,preprint,computer_vision,6,470.0,1483.0,235.02214532871972,2962,,True,True,baseline,yoloxexceedingyoloseriesin2021,235.02214532871972,landmark,True | ||
| 1064 | −4319083882,10.1038/d41586-023-00288-7,,ChatGPT: five priorities for research,Nature,2023,article,llm,2,1183.0,1590.0,145.96961527351755,1831,160.4149,False,True,post,145.96961527351755,landmark,True | 1064 | +3127751679,10.48550/arxiv.2102.04306,2102.04306,TransUNet: Transformers Make Strong Encoders for Medical Image Segmentation,arXiv (Cornell University),2021,preprint,computer_vision,4,489.0,1465.0,232.16955017301038,3859,,True,True,baseline,transunettransformersmakestrongencodersformedicalimagesegmentation,232.16955017301038,landmark,True | ||
| 1065 | −2884367402,10.1109/tnnls.2018.2876865,1807.05511,Object Detection With Deep Learning: A Review,IEEE Transactions on Neural Networks and Learning Systems,2019,article,computer_vision,2,699.0,1580.0,239.4815271654429,5487,286.797,True,True,baseline,239.4815271654429,landmark,True | 1065 | +3133702157,10.1145/3442188.3445922,,On the Dangers of Stochastic Parrots,"ACM Conference on Fairness, Accountability, and Transparency (FAccT)",2021,conference-paper,llm,3,623.0,1464.0,232.11321601174575,6788,321.4548,True,True,baseline,onthedangersofstochasticparrots,232.11321601174575,landmark,True | ||
| 1066 | −3013601031,10.1007/s13246-020-00865-4,2003.11617,Covid-19: automatic detection from X-ray images utilizing transfer learning with convolutional neural networks,Physical and Engineering Sciences in Medicine,2020,article,computer_vision,3,1035.0,1579.0,50.03582701030497,2336,215.8286,False,True,baseline,50.03582701030497,landmark,True | 1066 | +2978017171,10.4230/tgdk.3.3.5,1910.01108,"DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lighter",arXiv (Cornell University),2019,preprint,nlp,5,502.0,1462.0,165.6218897479667,4347,,True,True,baseline,distilbertadistilledversionofbertsmallerfastercheaperandlighter,165.6218897479667,landmark,True | ||
| 1067 | −3194620979,10.1109/jsac.2022.3156632,,Integrated Sensing and Communications: Toward Dual-Functional Wireless Networks for 6G and Beyond,IEEE Journal on Selected Areas in Communications,2022,article,computer_networks,2,639.0,1558.0,118.9064113669858,3786,312.6996,True,True,baseline,118.9064113669858,landmark,True | 1067 | +4384652177,10.1186/s12859-023-05385-y,,MitoHiFi: a python pipeline for mitochondrial genome assembly from PacBio high fidelity reads,BMC Bioinformatics,2023,article,computational_biology,5,839.0,1444.0,100.66579880594335,1858,138.9013,True,True,post,mitohifiapythonpipelineformitochondrialgenomeassemblyfrompacbiohighfidelityreads,100.66579880594335,landmark,True | ||
| 1068 | −2803664483,10.1093/nar/gky310,,MetaboAnalyst 4.0: towards more transparent and integrative metabolomics analysis,Nucleic Acids Research,2018,article,computational_biology,4,660.0,1555.0,77.73249831173425,3629,185.9094,True,True,baseline,77.73249831173425,landmark,True | 1068 | +3212386989,10.1007/s41095-022-0271-y,2111.07624,Attention mechanisms in computer vision: A survey,Computational Visual Media,2022,article,computer_vision,4,714.0,1442.0,154.76959342514627,2500,171.4269,True,True,baseline,attentionmechanismsincomputervisionasurvey,154.76959342514627,landmark,True | ||
| 1069 | −2911489562,10.1093/bioinformatics/btz682,1901.08746,BioBERT: a pre-trained biomedical language representation model for biomedical text mining,Bioinformatics,2019,article,nlp,8,666.0,1526.0,84.91295842716947,7155,176.5991,True,True,baseline,84.91295842716947,landmark,True | 1069 | +3159481202,10.1109/iccv48922.2021.00951,2104.14294,Emerging Properties in Self-Supervised Vision Transformers,IEEE/CVF International Conference on Computer Vision (ICCV),2021,conference-paper,computer_vision,5,497.0,1438.0,227.9909867656355,5690,363.2871,True,True,baseline,emergingpropertiesinselfsupervisedvisiontransformers,227.9909867656355,landmark,True | ||
| 1070 | −2942829220,10.1093/nar/gkz310,,antiSMASH 5.0: updates to the secondary metabolite genome mining pipeline,Nucleic Acids Research,2019,article,computational_biology,2,661.0,1520.0,18.891765924391507,2907,264.3601,True,True,baseline,18.891765924391507,landmark,True | 1070 | +2980282514,10.48550/arxiv.1910.03771,1910.03771,HuggingFace's Transformers: State-of-the-art Natural Language Processing,arXiv (Cornell University),2019,preprint,nlp,5,692.0,1434.0,162.44992469123406,2972,,True,True,baseline,huggingfacestransformersstateoftheartnaturallanguageprocessing,162.44992469123406,landmark,True | ||
| 1071 | −4212875960,10.1109/wacv51458.2022.00181,2103.10504,UNETR: Transformers for 3D Medical Image Segmentation,IEEE/CVF Winter Conference on Applications of Computer Vision (WACV),2022,conference-paper,computer_vision,4,698.0,1509.0,203.88765809091694,3313,245.4958,True,True,baseline,203.88765809091694,landmark,True | 1071 | +4287824654,10.4230/oasics.slate.2022.3,,Question Answering For Toxicological Information Extraction,DROPS (Schloss Dagstuhl – Leibniz Center for Informatics),2022,article,nlp,3,1238.0,1430.0,147.34664543494497,1520,94.4336,True,True,baseline,questionansweringfortoxicologicalinformationextraction,147.34664543494497,landmark,True | ||
| 1072 | −4391876619,10.1162/tacl_a_00638,2307.03172,Lost in the Middle: How Language Models Use Long Contexts,Transactions of the Association for Computational Linguistics,2024,article,nlp,4,688.0,1484.0,184.32460816294056,1484,217.8733,True,True,post,184.32460816294056,landmark,True | 1072 | +4226069476,10.1109/cvpr52688.2022.00135,2112.01527,Masked-attention Mask Transformer for Universal Image Segmentation,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2022,conference-paper,computer_vision,3,497.0,1420.0,191.86247481053815,3362,243.9506,True,True,baseline,maskedattentionmasktransformerforuniversalimagesegmentation,191.86247481053815,landmark,True | ||
| 1073 | −4399790131,10.1186/s40561-024-00316-7,,The effects of over-reliance on AI dialogue systems on students' cognitive abilities: a systematic review,Smart Learning Environments,2024,review,ai_safety,3,613.0,1484.0,81.80055076520247,1484,96.2475,True,True,post,81.80055076520247,landmark,True | 1073 | +4210598935,10.1016/j.procs.2022.01.135,,A Review of Yolo Algorithm Developments,Procedia Computer Science,2022,conference-paper,computer_vision,2,544.0,1406.0,189.9708729462089,2733,219.8066,True,True,baseline,areviewofyoloalgorithmdevelopments,189.9708729462089,landmark,True | ||
| 1074 | −3184439416,10.48550/arxiv.2107.08430,2107.08430,YOLOX: Exceeding YOLO Series in 2021,arXiv (Cornell University),2021,preprint,computer_vision,6,470.0,1483.0,235.02214532871972,2962,,True,True,baseline,235.02214532871972,landmark,True | 1074 | +3135367836,10.48550/arxiv.2103.00020,2103.00020,Learning Transferable Visual Models From Natural Language Supervision,arXiv (Cornell University),2021,preprint,computer_vision,6,625.0,1405.0,222.66089965397924,5217,,True,True,baseline,learningtransferablevisualmodelsfromnaturallanguagesupervision,222.66089965397924,landmark,True | ||
| 1075 | −3127751679,10.48550/arxiv.2102.04306,2102.04306,TransUNet: Transformers Make Strong Encoders for Medical Image Segmentation,arXiv (Cornell University),2021,preprint,computer_vision,4,489.0,1465.0,232.16955017301038,3859,,True,True,baseline,232.16955017301038,landmark,True | 1075 | +3042011474,10.1109/cvprw50498.2020.00203,1911.11929,CSPNet: A New Backbone that can Enhance Learning Capability of CNN,IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW),2020,conference-paper,computer_vision,3,534.0,1403.0,169.85871339984772,4922,202.034,True,True,baseline,cspnetanewbackbonethatcanenhancelearningcapabilityofcnn,169.85871339984772,landmark,True | ||
| 1076 | −3133702157,10.1145/3442188.3445922,,On the Dangers of Stochastic Parrots,"ACM Conference on Fairness, Accountability, and Transparency (FAccT)",2021,conference-paper,llm,3,623.0,1464.0,232.11321601174575,6788,321.4548,True,True,baseline,232.11321601174575,landmark,True | 1076 | +2898402099,10.1093/nar/gky995,,The Pfam protein families database in 2019,Nucleic Acids Research,2018,article,computational_biology,2,366.0,1396.0,69.7842878734283,4595,208.2751,True,True,baseline,thepfamproteinfamiliesdatabasein2019,69.7842878734283,landmark,True | ||
| 1077 | −2978017171,10.4230/tgdk.3.3.5,1910.01108,"DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lighter",arXiv (Cornell University),2019,preprint,nlp,5,502.0,1462.0,165.6218897479667,4347,,True,True,baseline,165.6218897479667,landmark,True | 1077 | +3129486236,10.1109/tcomm.2021.3051897,2007.02759,Intelligent Reflecting Surface-Aided Wireless Communications: A Tutorial,IEEE Transactions on Communications,2021,article,computer_networks,2,774.0,1396.0,108.19285671504721,3002,145.9637,True,True,baseline,intelligentreflectingsurfaceaidedwirelesscommunicationsatutorial,108.19285671504721,landmark,True | ||
| 1078 | −4384652177,10.1186/s12859-023-05385-y,,MitoHiFi: a python pipeline for mitochondrial genome assembly from PacBio high fidelity reads,BMC Bioinformatics,2023,article,computational_biology,5,839.0,1444.0,100.66579880594335,1858,138.9013,True,True,post,100.66579880594335,landmark,True | 1078 | +3161596995,10.1093/nar/gkab335,,antiSMASH 6.0: improving cluster detection and comparison capabilities,Nucleic Acids Research,2021,article,computational_biology,1,649.0,1396.0,21.18855808523059,2562,230.4087,True,True,baseline,antismash60improvingclusterdetectionandcomparisoncapabilities,21.18855808523059,landmark,True | ||
| 1079 | −3212386989,10.1007/s41095-022-0271-y,2111.07624,Attention mechanisms in computer vision: A survey,Computational Visual Media,2022,article,computer_vision,4,714.0,1442.0,154.76959342514627,2500,171.4269,True,True,baseline,154.76959342514627,landmark,True | 1079 | +4360884927,10.1109/tpami.2023.3261988,2209.04747,Diffusion Models in Vision: A Survey,IEEE Transactions on Pattern Analysis and Machine Intelligence,2023,article,computer_vision,5,632.0,1386.0,144.38233600835372,1859,168.9313,True,True,post,diffusionmodelsinvisionasurvey,144.38233600835372,landmark,True | ||
| 1080 | −3159481202,10.1109/iccv48922.2021.00951,2104.14294,Emerging Properties in Self-Supervised Vision Transformers,IEEE/CVF International Conference on Computer Vision (ICCV),2021,conference-paper,computer_vision,5,497.0,1438.0,227.9909867656355,5690,363.2871,True,True,baseline,227.9909867656355,landmark,True | 1080 | +4400881081,10.1016/j.media.2024.103280,,TransUNet: Rethinking the U-Net architecture design for medical image segmentation through the lens of transformers,Medical Image Analysis,2024,article,computer_vision,3,646.0,1365.0,161.71018409395703,1365,192.8121,True,True,post,transunetrethinkingtheunetarchitecturedesignformedicalimagesegmentationthroughthelensoftransformers,161.71018409395703,landmark,True | ||
| 1081 | −2980282514,10.48550/arxiv.1910.03771,1910.03771,HuggingFace's Transformers: State-of-the-art Natural Language Processing,arXiv (Cornell University),2019,preprint,nlp,5,692.0,1434.0,162.44992469123406,2972,,True,True,baseline,162.44992469123406,landmark,True | 1081 | +3014641072,10.1109/tpami.2020.2983686,,Deep High-Resolution Representation Learning for Visual Recognition,IEEE Transactions on Pattern Analysis and Machine Intelligence,2020,article,computer_vision,4,639.0,1362.0,183.6448855499229,4785,201.7077,True,False,baseline,deephighresolutionrepresentationlearningforvisualrecognition,183.6448855499229,landmark,True | ||
| 1082 | −4287824654,10.4230/oasics.slate.2022.3,,Question Answering For Toxicological Information Extraction,DROPS (Schloss Dagstuhl – Leibniz Center for Informatics),2022,article,nlp,3,1238.0,1430.0,147.34664543494497,1520,94.4336,True,True,baseline,147.34664543494497,landmark,True | 1082 | +2982770724,10.1109/iccv.2019.00972,1904.01355,FCOS: Fully Convolutional One-Stage Object Detection,IEEE/CVF International Conference on Computer Vision (ICCV),2019,conference-paper,computer_vision,4,431.0,1335.0,162.95553671667332,6648,207.8857,True,True,baseline,fcosfullyconvolutionalonestageobjectdetection,162.95553671667332,landmark,True | ||
| 1083 | −4226069476,10.1109/cvpr52688.2022.00135,2112.01527,Masked-attention Mask Transformer for Universal Image Segmentation,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2022,conference-paper,computer_vision,3,497.0,1420.0,191.86247481053815,3362,243.9506,True,True,baseline,191.86247481053815,landmark,True | 1083 | +2998789541,10.1148/radiol.2020191145,1612.07003,The Image Biomarker Standardization Initiative: Standardized Quantitative Radiomics for High-Throughput Image-based Phenotyping,Radiology,2020,article,computer_vision,2,724.0,1331.0,42.1771284045066,4094,214.4839,True,True,baseline,theimagebiomarkerstandardizationinitiativestandardizedquantitativeradiomicsforhighthroughputimagebasedphenotyping,42.1771284045066,landmark,True | ||
| 1084 | −4210598935,10.1016/j.procs.2022.01.135,,A Review of Yolo Algorithm Developments,Procedia Computer Science,2022,conference-paper,computer_vision,2,544.0,1406.0,189.9708729462089,2733,219.8066,True,True,baseline,189.9708729462089,landmark,True | 1084 | +4390692489,10.1109/tkde.2024.3352100,2306.08302,Unifying Large Language Models and Knowledge Graphs: A Roadmap,IEEE Transactions on Knowledge and Data Engineering,2024,article,nlp,5,799.0,1324.0,164.45133504564237,1324,191.8297,True,True,post,unifyinglargelanguagemodelsandknowledgegraphsaroadmap,164.45133504564237,landmark,True | ||
| 1085 | −3135367836,10.48550/arxiv.2103.00020,2103.00020,Learning Transferable Visual Models From Natural Language Supervision,arXiv (Cornell University),2021,preprint,computer_vision,6,625.0,1405.0,222.66089965397924,5217,,True,True,baseline,222.66089965397924,landmark,True | 1085 | +2886953980,10.1109/cvpr.2019.00293,1807.11626,MnasNet: Platform-Aware Neural Architecture Search for Mobile,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2019,conference-paper,computer_vision,6,640.0,1322.0,161.368703774863,3231,147.9235,True,True,baseline,mnasnetplatformawareneuralarchitecturesearchformobile,161.368703774863,landmark,True | ||
| 1086 | −3042011474,10.1109/cvprw50498.2020.00203,1911.11929,CSPNet: A New Backbone that can Enhance Learning Capability of CNN,IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW),2020,conference-paper,computer_vision,3,534.0,1403.0,169.85871339984772,4922,202.034,True,True,baseline,169.85871339984772,landmark,True | 1086 | +4372347372,10.1109/icassp49357.2023.10096516,2305.13563,Efficient Multi-Scale Attention Module with Cross-Spatial Learning,IEEE International Conference on Acoustics Speech and Signal Processing,2023,conference-paper,computer_vision,3,505.0,1322.0,184.48703036062932,1788,203.3043,True,True,post,efficientmultiscaleattentionmodulewithcrossspatiallearning,184.48703036062932,landmark,True | ||
| 1087 | −2898402099,10.1093/nar/gky995,,The Pfam protein families database in 2019,Nucleic Acids Research,2018,article,computational_biology,2,366.0,1396.0,69.7842878734283,4595,208.2751,True,True,baseline,69.7842878734283,landmark,True | 1087 | +4415796023,10.52202/079017-3273,2401.10166,VMamba: Visual State Space Model,neural information processing systems,2024,conference-paper,computer_vision,6,427.0,1295.0,271.7896314792265,1295,282.7481,True,True,post,vmambavisualstatespacemodel,271.7896314792265,landmark,True | ||
| 1088 | −3129486236,10.1109/tcomm.2021.3051897,2007.02759,Intelligent Reflecting Surface-Aided Wireless Communications: A Tutorial,IEEE Transactions on Communications,2021,article,computer_networks,2,774.0,1396.0,108.19285671504721,3002,145.9637,True,True,baseline,108.19285671504721,landmark,True | 1088 | +4387195417,10.1145/3626235,2209.00796,Diffusion Models: A Comprehensive Survey of Methods and Applications,ACM Computing Surveys,2023,article,computer_vision,7,621.0,1294.0,134.7985157249709,1666,151.1108,True,True,post,diffusionmodelsacomprehensivesurveyofmethodsandapplications,134.7985157249709,landmark,True | ||
| 1089 | −3161596995,10.1093/nar/gkab335,,antiSMASH 6.0: improving cluster detection and comparison capabilities,Nucleic Acids Research,2021,article,computational_biology,1,649.0,1396.0,21.18855808523059,2562,230.4087,True,True,baseline,21.18855808523059,landmark,True | 1089 | +2789843538,10.1093/bioinformatics/bty191,,Minimap2: pairwise alignment for nucleotide sequences,Bioinformatics,2018,article,computational_biology,4,450.0,1291.0,64.53546965945267,15142,230.1698,True,True,baseline,minimap2pairwisealignmentfornucleotidesequences,64.53546965945267,landmark,True | ||
| 1090 | −4321499901,10.1186/s40561-023-00237-x,,What if the devil is my guardian angel: ChatGPT as a case study of using chatbots in education,Smart Learning Environments,2023,article,llm,3,941.0,1389.0,325.547952647582,1931,453.5275,True,True,post,325.547952647582,landmark,True | 1090 | +4392741075,10.1038/s41598-024-56706-x,,Evaluation metrics and statistical tests for machine learning,Scientific Reports,2024,article,computer_vision,4,741.0,1288.0,159.97984859425029,1288,191.6809,True,True,post,evaluationmetricsandstatisticaltestsformachinelearning,159.97984859425029,landmark,True | ||
| 1091 | −4308616064,10.1093/nar/gkac993,,InterPro in 2022,Nucleic Acids Research,2022,article,computational_biology,2,418.0,1388.0,70.5468829956955,2399,150.466,True,True,baseline,70.5468829956955,landmark,True | ||||
| 1092 | −4360884927,10.1109/tpami.2023.3261988,2209.04747,Diffusion Models in Vision: A Survey,IEEE Transactions on Pattern Analysis and Machine Intelligence,2023,article,computer_vision,5,632.0,1386.0,144.38233600835372,1859,168.9313,True,True,post,144.38233600835372,landmark,True | ||||
| 1093 | −4400881081,10.1016/j.media.2024.103280,,TransUNet: Rethinking the U-Net architecture design for medical image segmentation through the lens of transformers,Medical Image Analysis,2024,article,computer_vision,3,646.0,1365.0,161.71018409395703,1365,192.8121,True,True,post,161.71018409395703,landmark,True | ||||
| 1094 | −3014641072,10.1109/tpami.2020.2983686,,Deep High-Resolution Representation Learning for Visual Recognition,IEEE Transactions on Pattern Analysis and Machine Intelligence,2020,article,computer_vision,4,639.0,1362.0,183.6448855499229,4785,201.7077,True,False,baseline,183.6448855499229,landmark,True | ||||
modified
literature_synthesis/landmarks/perception_interaction_abstracts.jsonl
+100 −99
@@ -1,43 +1,18 @@ | |||||
| 1 | −{"work_id": 2923943538, "title": "FIESTA : fast incremental euclidean distance fields for online motion planning of aerial robots", "abstract": "991012769067103412 HKUST Electronic Theses FIESTA : fast incremental euclidean distance fields for online motion planning of aerial robots by Luxin Han thesis 2019 x, 42 pages : illustrations ; 30 cm As the rapid development of robotics, Micro Aerial Vehicles\u2026Read more \u203a"} | ||||
| 2 | −{"work_id": 3169320628, "title": "HuBERT: Self-Supervised Speech Representation Learning by Masked Prediction of Hidden Units", "abstract": "Self-supervised approaches for speech representation learning are challenged by three unique problems: (1) there are multiple sound units in each input utterance, (2) there is no lexicon of input sound units during the pre-training phase, and (3) sound units have variable lengths with no explicit segmentation. To deal with these three problems, we propose the Hidden-Unit BERT (HuBERT) approach for self-supervised speech representation learning, which utilizes an offline clustering step to provide aligned target labels for a BERT-like prediction loss. A key ingredient of our approach is applying the prediction loss over the masked regions only, which forces the model to learn a combined acoustic and language model over the continuous inputs. HuBERT relies primarily on the consistency of the unsupervised clustering step rather than the intrinsic quality of the assigned cluster labels. Starting with a simple k-means teacher of 100 clusters, and using two iterations of clustering, the HuBERT model either matches or improves upon the state-of-the-art wav2vec 2.0 performance on the Librispeech (960h) and Libri-light (60,000h) benchmarks with 10min, 1h, 10h, 100h, and 960h fine-tuning subsets. Using a 1B parameter model, HuBERT shows up to 19% and 13% relative WER reduction on the more challenging dev-other and test-other evaluation subsets."} | ||||
| 3 | −{"work_id": 2995327724, "title": "Analyzing and Improving the Image Quality of StyleGAN", "abstract": "The style-based GAN architecture (StyleGAN) yields state-of-the-art results in data-driven unconditional generative image modeling. We expose and analyze several of its characteristic artifacts, and propose changes in both model architecture and training methods to address them. In particular, we redesign the generator normalization, revisit progressive growing, and regularize the generator to encourage good conditioning in the mapping from latent codes to images. In addition to improving image quality, this path length regularizer yields the additional benefit that the generator becomes significantly easier to invert. This makes it possible to reliably attribute a generated image to a particular network. We furthermore visualize how well the generator utilizes its output resolution, and identify a capacity problem, motivating us to train larger models for additional quality improvements. Overall, our improved model redefines the state of the art in unconditional image modeling, both in terms of existing distribution quality metrics as well as perceived image quality."} | ||||
| 4 | −{"work_id": 4385318467, "title": "3D Gaussian Splatting for Real-Time Radiance Field Rendering", "abstract": "Radiance Field methods have recently revolutionized novel-view synthesis of scenes captured with multiple photos or videos. However, achieving high visual quality still requires neural networks that are costly to train and render, while recent faster methods inevitably trade off speed for quality. For unbounded and complete scenes (rather than isolated objects) and 1080p resolution rendering, no current method can achieve real-time display rates. We introduce three key elements that allow us to achieve state-of-the-art visual quality while maintaining competitive training times and importantly allow high-quality real-time (\u2265 30 fps) novel-view synthesis at 1080p resolution. First, starting from sparse points produced during camera calibration, we represent the scene with 3D Gaussians that preserve desirable properties of continuous volumetric radiance fields for scene optimization while avoiding unnecessary computation in empty space; Second, we perform interleaved optimization/density control of the 3D Gaussians, notably optimizing anisotropic covariance to achieve an accurate representation of the scene; Third, we develop a fast visibility-aware rendering algorithm that supports anisotropic splatting and both accelerates training and allows realtime rendering. We demonstrate state-of-the-art visual quality and real-time rendering on several established datasets."} | ||||
| 5 | −{"work_id": 4221142221, "title": "BERTopic: Neural topic modeling with a class-based TF-IDF procedure", "abstract": "Topic models can be useful tools to discover latent topics in collections of documents. Recent studies have shown the feasibility of approach topic modeling as a clustering task. We present BERTopic, a topic model that extends this process by extracting coherent topic representation through the development of a class-based variation of TF-IDF. More specifically, BERTopic generates document embedding with pre-trained transformer-based language models, clusters these embeddings, and finally, generates topic representations with the class-based TF-IDF procedure. BERTopic generates coherent topics and remains competitive across a variety of benchmarks involving classical models and those that follow the more recent clustering approach of topic modeling."} | ||||
| 6 | −{"work_id": 3127751679, "title": "TransUNet: Transformers Make Strong Encoders for Medical Image Segmentation", "abstract": "Medical image segmentation is an essential prerequisite for developing healthcare systems, especially for disease diagnosis and treatment planning. On various medical image segmentation tasks, the u-shaped architecture, also known as U-Net, has become the de-facto standard and achieved tremendous success. However, due to the intrinsic locality of convolution operations, U-Net generally demonstrates limitations in explicitly modeling long-range dependency. Transformers, designed for sequence-to-sequence prediction, have emerged as alternative architectures with innate global self-attention mechanisms, but can result in limited localization abilities due to insufficient low-level details. In this paper, we propose TransUNet, which merits both Transformers and U-Net, as a strong alternative for medical image segmentation. On one hand, the Transformer encodes tokenized image patches from a convolution neural network (CNN) feature map as the input sequence for extracting global contexts. On the other hand, the decoder upsamples the encoded features which are then combined with the high-resolution CNN feature maps to enable precise localization. We argue that Transformers can serve as strong encoders for medical image segmentation tasks, with the combination of U-Net to enhance finer details by recovering localized spatial information. TransUNet achieves superior performances to various competing methods on different medical applications including multi-organ segmentation and cardiac segmentation. Code and models are available at https://github.com/Beckschen/TransUNet."} | ||||
| 7 | −{"work_id": 3138516171, "title": "Swin Transformer: Hierarchical Vision Transformer using Shifted Windows", "abstract": "This paper presents a new vision Transformer, called Swin Transformer, that capably serves as a general-purpose backbone for computer vision. Challenges in adapting Transformer from language to vision arise from differences between the two domains, such as large variations in the scale of visual entities and the high resolution of pixels in images compared to words in text. To address these differences, we propose a hierarchical Transformer whose representation is computed with Shifted windows. The shifted windowing scheme brings greater efficiency by limiting self-attention computation to non-overlapping local windows while also allowing for cross-window connection. This hierarchical architecture has the flexibility to model at various scales and has linear computational complexity with respect to image size. These qualities of Swin Transformer make it compatible with a broad range of vision tasks, including image classification (87.3 top-1 accuracy on ImageNet-1K) and dense prediction tasks such as object detection (58.7 box AP and 51.1 mask AP on COCO test-dev) and semantic segmentation (53.5 mIoU on ADE20K val). Its performance surpasses the previous state-of-the-art by a large margin of +2.7 box AP and +2.6 mask AP on COCO, and +3.2 mIoU on ADE20K, demonstrating the potential of Transformer-based models as vision backbones. The hierarchical design and the shifted window approach also prove beneficial for all-MLP architectures. The code and models are publicly available at https://github.com/microsoft/Swin-Transformer."} | ||||
| 8 | −{"work_id": 1506965148, "title": "Mastering the Information Age Solving Problems with Visual Analytics", "abstract": "Today, in many spheres of human activity, massive amounts of data are collected and stored. As the volumes of data available to lawmakers, civil servants, business people and scientists increase, their effective use becomes more challenging. Simply keeping up to date with the flood of data, using standard tools for data management and analysis, is fraught with difficulty. The field of visual analytics seeks to provide people with better and more effective means to understand and analyse massive amounts of data. It also seeks to enable them to act upon their findings immediately, that is, in real time. Visual analytics integrates the analytic capabilities of the computer and the abilities of the human analyst. In so doing it allows novel discoveries and empowers individuals to take control of the analytical process. Visual analytics opens the door to the discoveries and unexpected insights which lead to beneficial and profitable innovation. This book is the result of the VisMaster project, a coordination action funded by the European Commission to form a strong visual analytics research community."} | ||||
| 9 | −{"work_id": 2963420686, "title": "Squeeze-and-Excitation Networks", "abstract": "The central building block of convolutional neural networks (CNNs) is the convolution operator, which enables networks to construct informative features by fusing both spatial and channel-wise information within local receptive fields at each layer. A broad range of prior research has investigated the spatial component of this relationship, seeking to strengthen the representational power of a CNN by enhancing the quality of spatial encodings throughout its feature hierarchy. In this work, we focus instead on the channel relationship and propose a novel architectural unit, which we term the \"Squeeze-and-Excitation\" (SE) block, that adaptively recalibrates channel-wise feature responses by explicitly modelling interdependencies between channels. We show that these blocks can be stacked together to form SENet architectures that generalise extremely effectively across different datasets. We further demonstrate that SE blocks bring significant improvements in performance for existing state-of-the-art CNNs at slight additional computational cost. Squeeze-and-Excitation Networks formed the foundation of our ILSVRC 2017 classification submission which won first place and reduced the top-5 error to 2.251 percent, surpassing the winning entry of 2016 by a relative improvement of \u223c 25 percent. Models and code are available at https://github.com/hujie-frank/SENet."} | ||||
| 10 | −{"work_id": 2982399380, "title": "BART: Denoising Sequence-to-Sequence Pre-training for Natural Language Generation, Translation, and Comprehension", "abstract": "Mike Lewis, Yinhan Liu, Naman Goyal, Marjan Ghazvininejad, Abdelrahman Mohamed, Omer Levy, Veselin Stoyanov, Luke Zettlemoyer. Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics. 2020."} | ||||
| 11 | −{"work_id": 2963341956, "title": "BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding", "abstract": "Jacob Devlin, Ming-Wei Chang, Kenton Lee, Kristina Toutanova. Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long and Short Papers). 2019."} | ||||
| 12 | −{"work_id": 3035524453, "title": "Momentum Contrast for Unsupervised Visual Representation Learning", "abstract": "We present Momentum Contrast (MoCo) for unsupervised visual representation learning. From a perspective on contrastive learning as dictionary look-up, we build a dynamic dictionary with a queue and a moving-averaged encoder. This enables building a large and consistent dictionary on-the-fly that facilitates contrastive unsupervised learning. MoCo provides competitive results under the common linear protocol on ImageNet classification. More importantly, the representations learned by MoCo transfer well to downstream tasks. MoCo can outperform its supervised pre-training counterpart in 7 detection/segmentation tasks on PASCAL VOC, COCO, and other datasets, sometimes surpassing it by large margins. This suggests that the gap between unsupervised and supervised representation learning has been largely closed in many vision tasks."} | ||||
| 13 | −{"work_id": 1524333225, "title": "Kaldi Speech Recognition Toolkit", "abstract": "Abstract\u2014We describe the design of Kaldi, a free, open-source toolkit for speech recognition research. Kaldi provides a speech recognition system based on finite-state transducers (using the freely available OpenFst), together with detailed documentation and scripts for building complete recognition systems. Kaldi is written is C++, and the core library supports modeling of arbitrary phonetic-context sizes, acoustic modeling with subspace Gaussian mixture models (SGMM) as well as standard Gaussian mixture models, together with all commonly used linear and affine transforms. Kaldi is released under the Apache License v2.0, which is highly nonrestrictive, making it suitable for a wide community of users. I."} | ||||
| 14 | −{"work_id": 2896457183, "title": "AI-Assisted Pipeline for Dynamic Generation of Trustworthy Health Supplement Content at Scale", "abstract": "Although geospatial question answering systems have received increasing attention in recent years, existing prototype systems struggle to properly answer qualitative spatial questions. In this work, we propose a unique framework for answering qualitative spatial questions, which comprises three main components: a geoparser that takes the input questions and extracts place semantic information from text, a reasoning system which is embedded with a crisp reasoner, and finally, answer extraction, which refines the solution space and generates final answers. We present an experimental design to evaluate our framework for point-based cardinal direction calculus (CDC) relations by developing an automated approach for generating three types of synthetic qualitative spatial questions. The initial evaluations of generated answers in our system are promising because a high proportion of answers were labelled correct."} | ||||
| 15 | −{"work_id": 3042011474, "title": "CSPNet: A New Backbone that can Enhance Learning Capability of CNN", "abstract": "Neural networks have enabled state-of-the-art approaches to achieve incredible results on computer vision tasks such as object detection. However, such success greatly relies on costly computation resources, which hinders people with cheap devices from appreciating the advanced technology. In this paper, we propose Cross Stage Partial Network (CSPNet) to mitigate the problem that previous works require heavy inference computations from the network architecture perspective. We attribute the problem to the duplicate gradient information within network optimization. The proposed networks respect the variability of the gradients by integrating feature maps from the beginning and the end of a network stage, which, in our experiments, reduces computations by 20% with equivalent or even superior accuracy on the ImageNet dataset, and significantly outperforms state-of-the-art approaches in terms of AP50on the MS COCO object detection dataset. The CSPNet is easy to implement and general enough to cope with architectures based on ResNet, ResNeXt, and DenseNet."} | ||||
| 16 | −{"work_id": 2900368655, "title": "SDR \u2013 Half-baked or Well Done?", "abstract": "In speech enhancement and source separation, signal-to-noise ratio is a ubiquitous objective measure of denoising/separation quality. A decade ago, the BSS_eval toolkit was developed to give researchers worldwide a way to evaluate the quality of their algorithms in a simple, fair, and hopefully insightful way: it attempted to account for channel variations, and to not only evaluate the total distortion in the estimated signal but also split it in terms of various factors such as remaining interference, newly added artifacts, and channel errors. In recent years, hundreds of papers have been relying on this toolkit to evaluate their proposed methods and compare them to previous works, often arguing that differences on the order of 0.1 dB proved the effectiveness of a method over others. We argue here that the signal-to-distortion ratio (SDR) implemented in the BSS_eval toolkit has generally been improperly used and abused, especially in the case of single-channel separation, resulting in misleading results. We propose to use a slightly modified definition, resulting in a simpler, more robust measure, called scale-invariant SDR (SI-SDR). We present various examples of critical failure of the original SDR that SI-SDR overcomes."} | ||||
| 17 | −{"work_id": 2911489562, "title": "BioBERT: a pre-trained biomedical language representation model for biomedical text mining", "abstract": "MOTIVATION: Biomedical text mining is becoming increasingly important as the number of biomedical documents rapidly grows. With the progress in natural language processing (NLP), extracting valuable information from biomedical literature has gained popularity among researchers, and deep learning has boosted the development of effective biomedical text mining models. However, directly applying the advancements in NLP to biomedical text mining often yields unsatisfactory results due to a word distribution shift from general domain corpora to biomedical corpora. In this article, we investigate how the recently introduced pre-trained language model BERT can be adapted for biomedical corpora. RESULTS: We introduce BioBERT (Bidirectional Encoder Representations from Transformers for Biomedical Text Mining), which is a domain-specific language representation model pre-trained on large-scale biomedical corpora. With almost the same architecture across tasks, BioBERT largely outperforms BERT and previous state-of-the-art models in a variety of biomedical text mining tasks when pre-trained on biomedical corpora. While BERT obtains performance comparable to that of previous state-of-the-art models, BioBERT significantly outperforms them on the following three representative biomedical text mining tasks: biomedical named entity recognition (0.62% F1 score improvement), biomedical relation extraction (2.80% F1 score improvement) and biomedical question answering (12.24% MRR improvement). Our analysis results show that pre-training BERT on biomedical corpora helps it to understand complex biomedical texts. AVAILABILITY AND IMPLEMENTATION: We make the pre-trained weights of BioBERT freely available at https://github.com/naver/biobert-pretrained, and the source code for fine-tuning BioBERT available at https://github.com/dmis-lab/biobert."} | ||||
| 18 | −{"work_id": 3016007010, "title": "State of the Art on Neural Rendering", "abstract": "Abstract Efficient rendering of photo\u2010realistic virtual worlds is a long standing effort of computer graphics. Modern graphics techniques have succeeded in synthesizing photo\u2010realistic images from hand\u2010crafted scene representations. However, the automatic generation of shape, materials, lighting, and other aspects of scenes remains a challenging problem that, if solved, would make photo\u2010realistic computer graphics more widely accessible. Concurrently, progress in computer vision and machine learning have given rise to a new approach to image synthesis and editing, namely deep generative models. Neural rendering is a new and rapidly emerging field that combines generative machine learning techniques with physical knowledge from computer graphics, e.g., by the integration of differentiable rendering into network training. With a plethora of applications in computer graphics and vision, neural rendering is poised to become a new area in the graphics community, yet no survey of this emerging field exists. This state\u2010of\u2010the\u2010art report summarizes the recent trends and applications of neural rendering. We focus on approaches that combine classic computer graphics techniques with deep generative models to obtain controllable and photorealistic outputs. Starting with an overview of the underlying computer graphics and machine learning concepts, we discuss critical aspects of neural rendering approaches. Specifically, our emphasis is on the type of control, i.e., how the control is provided, which parts of the pipeline are learned, explicit vs. implicit control, generalization, and stochastic vs. deterministic synthesis. The second half of this state\u2010of\u2010the\u2010art report is focused on the many important use cases for the described algorithms such as novel view synthesis, semantic photo manipulation, facial and body reenactment, relighting, free\u2010viewpoint video, and the creation of photo\u2010realistic avatars for virtual and augmented reality telepresence. Finally, we conclude with a discussion of the social implications of such technology and investigate open research problems."} | ||||
| 19 | −{"work_id": 3177052299, "title": "Coordinate Attention for Efficient Mobile Network Design", "abstract": "Recent studies on mobile network design have demonstrated the remarkable effectiveness of channel attention (e.g., the Squeeze-and-Excitation attention) for lifting model performance, but they generally neglect the positional information, which is important for generating spatially selective attention maps. In this paper, we propose a novel attention mechanism for mobile networks by embedding positional information into channel attention, which we call \"coordinate attention\". Unlike channel attention that transforms a feature tensor to a single feature vector via 2D global pooling, the coordinate attention factorizes channel attention into two 1D feature encoding processes that aggregate features along the two spatial directions, respectively. In this way, long-range dependencies can be captured along one spatial direction and meanwhile precise positional information can be preserved along the other spatial direction. The resulting feature maps are then encoded separately into a pair of direction-aware and position-sensitive attention maps that can be complementarily applied to the input feature map to augment the representations of the objects of interest. Our coordinate attention is simple and can be flexibly plugged into classic mobile networks, such as MobileNetV2, MobileNeXt, and EfficientNet with nearly no computational overhead. Extensive experiments demonstrate that our coordinate attention is not only beneficial to ImageNet classification but more interestingly, behaves better in down-stream tasks, such as object detection and semantic segmentation. Code is available at https://github.com/Andrew-Qibin/CoordAttention."} | ||||
| 20 | −{"work_id": 4402128637, "title": "The promise and challenges of generative AI in education", "abstract": "Generative artificial intelligence (GenAI) tools, such as large language models (LLMs), generate natural language and other types of content to perform a wide range of tasks. This represents a significant technological advancement that poses opportunities and challenges to educational research and practice. This commentary brings together contributions from nine experts working in the intersection of learning and technology and presents critical reflections on the opportunities, challenges, and implications related to GenAI technologies in the context of education. In the commentary, it is acknowledged that GenAI\u2019s capabilities can enhance some teaching and learning practices, such as learning design, regulation of learning, automated content, feedback, and assessment. Nevertheless, we also highlight its limitations, potential disruptions, ethical consequences, and potential misuses. The identified avenues for further research include the development of new insights into the roles human experts can play, strong and continuous evidence, human-centric design of technology, necessary policy, and support and competence mechanisms. Overall, we concur with the general skeptical optimism about the use of GenAI tools such as LLMs in education. Moreover, we highlight the danger of hastily adopting GenAI tools in education without deep consideration of the efficacy, ecosystem-level implications, ethics, and pedagogical soundness of such practices."} | ||||
| 21 | −{"work_id": 4392233542, "title": "A Review of Machine Learning Approaches for the Personalization of Amplification in Hearing Aids", "abstract": "This paper provides a review of various machine learning approaches that have appeared in the literature aimed at individualizing or personalizing the amplification settings of hearing aids. After stating the limitations associated with the current one-size-fits-all settings of hearing aid prescriptions, a spectrum of studies in engineering and hearing science are discussed. These studies involve making adjustments to prescriptive values in order to enable preferred and individualized settings for a hearing aid user in an audio environment of interest to that user. This review gathers, in one place, a comprehensive collection of works that have been conducted thus far with respect to achieving the personalization or individualization of the amplification function of hearing aids. Furthermore, it underscores the impact that machine learning can have on enabling an improved and personalized hearing experience for hearing aid users. This paper concludes by stating the challenges and future research directions in this area."} | ||||
| 22 | −{"work_id": 2998508940, "title": "Random Erasing Data Augmentation", "abstract": "In this paper, we introduce Random Erasing, a new data augmentation method for training the convolutional neural network (CNN). In training, Random Erasing randomly selects a rectangle region in an image and erases its pixels with random values. In this process, training images with various levels of occlusion are generated, which reduces the risk of over-fitting and makes the model robust to occlusion. Random Erasing is parameter learning free, easy to implement, and can be integrated with most of the CNN-based recognition models. Albeit simple, Random Erasing is complementary to commonly used data augmentation techniques such as random cropping and flipping, and yields consistent improvement over strong baselines in image classification, object detection and person re-identification. Code is available at: https://github.com/zhunzhong07/Random-Erasing."} | ||||
| 23 | −{"work_id": 2952218014, "title": "Conv-TasNet: Surpassing Ideal Time\u2013Frequency Magnitude Masking for Speech Separation", "abstract": "Single-channel, speaker-independent speech separation methods have recently seen great progress. However, the accuracy, latency, and computational cost of such methods remain insufficient. The majority of the previous methods have formulated the separation problem through the time-frequency representation of the mixed signal, which has several drawbacks, including the decoupling of the phase and magnitude of the signal, the suboptimality of time-frequency representation for speech separation, and the long latency of the entire system. To address these shortcomings, we propose a fully-convolutional time-domain audio separation network (Conv-TasNet), a deep learning framework for end-to-end time-domain speech separation. Conv-TasNet uses a linear encoder to generate a representation of the speech waveform optimized for separating individual speakers. Speaker separation is achieved by applying a set of weighting functions (masks) to the encoder output. The modified encoder representations are then inverted back to the waveforms using a linear decoder. The masks are found using a temporal convolutional network (TCN) consisting of stacked 1-D dilated convolutional blocks, which allows the network to model the long-term dependencies of the speech signal while maintaining a small model size. The proposed Conv-TasNet system significantly outperforms previous time-frequency masking methods in separating two- and three-speaker mixtures. Additionally, Conv-TasNet surpasses several ideal time-frequency magnitude masks in two-speaker speech separation as evaluated by both objective distortion measures and subjective quality assessment by human listeners. Finally, Conv-TasNet has a significantly smaller model size and a much shorter minimum latency, making it a suitable solution for both offline and real-time speech separation applications. This study therefore represents a major step toward the realization of speech separation systems for real-world speech processing technologies."} | ||||
| 24 | −{"work_id": 2784874046, "title": "ArcFace: Additive Angular Margin Loss for Deep Face Recognition", "abstract": "Recently, a popular line of research in face recognition is adopting margins in the well-established softmax loss function to maximize class separability. In this paper, we first introduce an Additive Angular Margin Loss (ArcFace), which not only has a clear geometric interpretation but also significantly enhances the discriminative power. Since ArcFace is susceptible to the massive label noise, we further propose sub-center ArcFace, in which each class contains K sub-centers and training samples only need to be close to any of the K positive sub-centers. Sub-center ArcFace encourages one dominant sub-class that contains the majority of clean faces and non-dominant sub-classes that include hard or noisy faces. Based on this self-propelled isolation, we boost the performance through automatically purifying raw web faces under massive real-world noise. Besides discriminative feature embedding, we also explore the inverse problem, mapping feature vectors to face images. Without training any additional generator or discriminator, the pre-trained ArcFace model can generate identity-preserved face images for both subjects inside and outside the training data only by using the network gradient and Batch Normalization (BN) priors. Extensive experiments demonstrate that ArcFace can enhance the discriminative feature embedding as well as strengthen the generative face synthesis."} | ||||
| 25 | −{"work_id": 2983040767, "title": "Unsupervised Cross-lingual Representation Learning at Scale", "abstract": "Alexis Conneau, Kartikay Khandelwal, Naman Goyal, Vishrav Chaudhary, Guillaume Wenzek, Francisco Guzm\u00e1n, Edouard Grave, Myle Ott, Luke Zettlemoyer, Veselin Stoyanov. Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics. 2020."} | ||||
| 26 | −{"work_id": 4318351475, "title": "MuChoMusic dataset", "abstract": "MuChoMusic: Evaluating Music Understanding in Multimodal Audio-Language Models MuChoMusic is a benchmark designed to evaluate music understanding in multimodal language models focused on audio. It includes 1,187 multiple-choice questions validated by human annotators, based on 644 music tracks from two publicly available music datasets. These questions cover a wide variety of genres and assess knowledge and reasoning across several musical concepts and their cultural and functional contexts. The benchmark provides a holistic evaluation of five open-source models, revealing challenges such as over-reliance on the language modality and highlighting the need for better multimodal integration. Note on Audio Files This dataset comes without audio files. The audio files can be downloaded from two datasets: SongDescriberDataset (SDD) and MusicCaps. Please see the code repository for more information on how to download the audio. Citation If you use this dataset, please cite our paper: @inproceedings{weck2024muchomusic, title={MuChoMusic: Evaluating Music Understanding in Multimodal Audio-Language Models}, author={Weck, Benno and Manco, Ilaria and Benetos, Emmanouil and Quinton, Elio and Fazekas, Gy\u00f6rgy and Bogdanov, Dmitry}, booktitle = {Proceedings of the 25th International Society for Music Information Retrieval Conference (ISMIR)}, year={2024} }"} | ||||
| 27 | −{"work_id": 4404534210, "title": "A Survey on Hallucination in Large Language Models: Principles, Taxonomy, Challenges, and Open Questions", "abstract": "The emergence of large language models (LLMs) has marked a significant breakthrough in natural language processing (NLP), fueling a paradigm shift in information acquisition. Nevertheless, LLMs are prone to hallucination, generating plausible yet nonfactual content. This phenomenon raises significant concerns over the reliability of LLMs in real-world information retrieval (IR) systems and has attracted intensive research to detect and mitigate such hallucinations. Given the open-ended general-purpose attributes inherent to LLMs, LLM hallucinations present distinct challenges that diverge from prior task-specific models. This divergence highlights the urgency for a nuanced understanding and comprehensive overview of recent advances in LLM hallucinations. In this survey, we begin with an innovative taxonomy of hallucination in the era of LLM and then delve into the factors contributing to hallucinations. Subsequently, we present a thorough overview of hallucination detection methods and benchmarks. Our discussion then transfers to representative methodologies for mitigating LLM hallucinations. Additionally, we delve into the current limitations faced by retrieval-augmented LLMs in combating hallucinations, offering insights for developing more robust IR systems. Finally, we highlight the promising research directions on LLM hallucinations, including hallucination in large vision-language models and understanding of knowledge boundaries in LLM hallucinations."} | ||||
| 28 | −{"work_id": 4360884927, "title": "Diffusion Models in Vision: A Survey", "abstract": "Denoising diffusion models represent a recent emerging topic in computer vision, demonstrating remarkable results in the area of generative modeling. A diffusion model is a deep generative model that is based on two stages, a forward diffusion stage and a reverse diffusion stage. In the forward diffusion stage, the input data is gradually perturbed over several steps by adding Gaussian noise. In the reverse stage, a model is tasked at recovering the original input data by learning to gradually reverse the diffusion process, step by step. Diffusion models are widely appreciated for the quality and diversity of the generated samples, despite their known computational burdens, i.e., low speeds due to the high number of steps involved during sampling. In this survey, we provide a comprehensive review of articles on denoising diffusion models applied in vision, comprising both theoretical and practical contributions in the field. First, we identify and present three generic diffusion modeling frameworks, which are based on denoising diffusion probabilistic models, noise conditioned score networks, and stochastic differential equations. We further discuss the relations between diffusion models and other deep generative models, including variational auto-encoders, generative adversarial networks, energy-based models, autoregressive models and normalizing flows. Then, we introduce a multi-perspective categorization of diffusion models applied in computer vision. Finally, we illustrate the current limitations of diffusion models and envision some interesting directions for future research."} | ||||
| 29 | −{"work_id": 7152514513, "title": "Cooperative 4D trajectory planning for multi aerial vehicles combining receding horizon optimization and differential evolution algorithm in dynamic battlefield environment", "abstract": "Aiming to the problem of cooperative trajectory planning for multi aerial vehicles in dynamic battlefield environment, this article develops a cooperative four-dimensional trajectory planning method combining receding horizon optimization (RHO) and differential evolution algorithm, and the main contributions are threefold: (1) An effective framework for multi aerial vehicles cooperative trajectory planning in dynamic environment is introduced. Therein, RHO serves as the outer layer, while the DE algorithm is employed in the inner loop to implement local trajectory planning. (2) A population diversity-based adaptive DE algorithm, named PDADE, is proposed to tackle the issues of slow convergence speed and low convergence accuracy in the classical DE algorithm. (3) A flight speed adjustment strategy based on the required time of arrival is presented to ensure synchronization of arrival times. Eventually, some numerical simulations are conducted, and the performance of the proposed PDADE algorithm is compared with other seven state-of-the-art swarm optimization algorithms. The results demonstrate that PDADE achieves optimal convergence accuracy and convergence speed."} | ||||
| 30 | {"work_id": 4366548330, "title": "Why Johnny Can\u2019t Prompt: How Non-AI Experts Try (and Fail) to Design LLM Prompts", "abstract": "Pre-trained large language models (\u201cLLMs\u201d) like GPT-3 can engage in fluent, multi-turn instruction-taking out-of-the-box, making them attractive materials for designing natural language interactions. Using natural language to steer LLM outputs (\u201cprompting\u201d) has emerged as an important design technique potentially accessible to non-AI-experts. Crafting effective prompts can be challenging, however, and prompt-based interactions are brittle. Here, we explore whether non-AI-experts can successfully engage in \u201cend-user prompt engineering\u201d using a design probe\u2014a prototype LLM-based chatbot design tool supporting development and systematic evaluation of prompting strategies. Ultimately, our probe participants explored prompt designs opportunistically, not systematically, and struggled in ways echoing end-user programming systems and interactive machine learning systems. Expectations stemming from human-to-human instructional experiences, and a tendency to overgeneralize, were barriers to effective prompt design. These findings have implications for non-AI-expert-facing LLM-based tool design and for improving LLM-and-prompt literacy among programmers and the public, and present opportunities for further research."} | 1 | {"work_id": 4366548330, "title": "Why Johnny Can\u2019t Prompt: How Non-AI Experts Try (and Fail) to Design LLM Prompts", "abstract": "Pre-trained large language models (\u201cLLMs\u201d) like GPT-3 can engage in fluent, multi-turn instruction-taking out-of-the-box, making them attractive materials for designing natural language interactions. Using natural language to steer LLM outputs (\u201cprompting\u201d) has emerged as an important design technique potentially accessible to non-AI-experts. Crafting effective prompts can be challenging, however, and prompt-based interactions are brittle. Here, we explore whether non-AI-experts can successfully engage in \u201cend-user prompt engineering\u201d using a design probe\u2014a prototype LLM-based chatbot design tool supporting development and systematic evaluation of prompting strategies. Ultimately, our probe participants explored prompt designs opportunistically, not systematically, and struggled in ways echoing end-user programming systems and interactive machine learning systems. Expectations stemming from human-to-human instructional experiences, and a tendency to overgeneralize, were barriers to effective prompt design. These findings have implications for non-AI-expert-facing LLM-based tool design and for improving LLM-and-prompt literacy among programmers and the public, and present opportunities for further research."} | ||
| 31 | {"work_id": 4383097638, "title": "Code as Policies: Language Model Programs for Embodied Control", "abstract": "Large language models (LLMs) trained on code-completion have been shown to be capable of synthesizing simple Python programs from docstrings [1]. We find that these code-writing LLMs can be re-purposed to write robot policy code, given natural language commands. Specifically, policy code can express functions or feedback loops that process perception outputs (e.g., from object detectors [2], [3]) and parameterize control primitive APIs. When provided as input several example language commands (formatted as comments) followed by corresponding policy code (via few-shot prompting), LLMs can take in new commands and autonomously re-compose API calls to generate new policy code respectively. By chaining classic logic structures and referencing third-party libraries (e.g., NumPy, Shapely) to perform arithmetic, LLMs used in this way can write robot policies that (i) exhibit spatial-geometric reasoning, (ii) generalize to new instructions, and (iii) prescribe precise values (e.g., velocities) to ambiguous descriptions (\u2018faster\u2019) depending on context (i.e., behavioral commonsense). This paper presents Code as Policies: a robot-centric formulation of language model generated programs (LMPs) that can represent reactive policies (e.g., impedance controllers), as well as waypoint-based policies (vision-based pick and place, trajectory-based control), demonstrated across multiple real robot platforms. Central to our approach is prompting hierarchical code-gen (recursively defining undefined functions), which can write more complex code and also improves state-of-the-art to solve 39.8% of problems on the HumanEval [1] benchmark. Code and videos are available at https://code-as-policies.github.io"} | 2 | {"work_id": 4383097638, "title": "Code as Policies: Language Model Programs for Embodied Control", "abstract": "Large language models (LLMs) trained on code-completion have been shown to be capable of synthesizing simple Python programs from docstrings [1]. We find that these code-writing LLMs can be re-purposed to write robot policy code, given natural language commands. Specifically, policy code can express functions or feedback loops that process perception outputs (e.g., from object detectors [2], [3]) and parameterize control primitive APIs. When provided as input several example language commands (formatted as comments) followed by corresponding policy code (via few-shot prompting), LLMs can take in new commands and autonomously re-compose API calls to generate new policy code respectively. By chaining classic logic structures and referencing third-party libraries (e.g., NumPy, Shapely) to perform arithmetic, LLMs used in this way can write robot policies that (i) exhibit spatial-geometric reasoning, (ii) generalize to new instructions, and (iii) prescribe precise values (e.g., velocities) to ambiguous descriptions (\u2018faster\u2019) depending on context (i.e., behavioral commonsense). This paper presents Code as Policies: a robot-centric formulation of language model generated programs (LMPs) that can represent reactive policies (e.g., impedance controllers), as well as waypoint-based policies (vision-based pick and place, trajectory-based control), demonstrated across multiple real robot platforms. Central to our approach is prompting hierarchical code-gen (recursively defining undefined functions), which can write more complex code and also improves state-of-the-art to solve 39.8% of problems on the HumanEval [1] benchmark. Code and videos are available at https://code-as-policies.github.io"} | ||
| 32 | {"work_id": 4404301029, "title": "The Metaverse Review: Exploring the Boundless Ream of Digital Reality", "abstract": "The metaverse has emerged as a prominent topic with growing interest fueled by advancements in Web 3.0, blockchain, and immersive technologies. This paper presents a thorough analysis of the metaverse, showcasing its evolutio... | Find, read and cite all the research you need on Tech Science Press"} | 3 | {"work_id": 4404301029, "title": "The Metaverse Review: Exploring the Boundless Ream of Digital Reality", "abstract": "The metaverse has emerged as a prominent topic with growing interest fueled by advancements in Web 3.0, blockchain, and immersive technologies. This paper presents a thorough analysis of the metaverse, showcasing its evolutio... | Find, read and cite all the research you need on Tech Science Press"} | ||
| 33 | {"work_id": 2936774411, "title": "SpecAugment: A Simple Data Augmentation Method for Automatic Speech Recognition", "abstract": "We present SpecAugment, a simple data augmentation method for speech recognition. SpecAugment is applied directly to the feature inputs of a neural network (i.e., filter bank coefficients). The augmentation policy consists of warping the features, masking blocks of frequency channels, and masking blocks of time steps. We apply SpecAugment on Listen, Attend and Spell networks for end-to-end speech recognition tasks. We achieve state-of-the-art performance on the LibriSpeech 960h and Swichboard 300h tasks, outperforming all prior work. On LibriSpeech, we achieve 6.8% WER on test-other without the use of a language model, and 5.8% WER with shallow fusion with a language model. This compares to the previous state-of-the-art hybrid system of 7.5% WER. For Switchboard, we achieve 7.2%/14.6% on the Switchboard/CallHome portion of the Hub5'00 test set without the use of a language model, and 6.8%/14.1% with shallow fusion, which compares to the previous state-of-the-art hybrid system at 8.3%/17.3% WER."} | 4 | {"work_id": 2936774411, "title": "SpecAugment: A Simple Data Augmentation Method for Automatic Speech Recognition", "abstract": "We present SpecAugment, a simple data augmentation method for speech recognition. SpecAugment is applied directly to the feature inputs of a neural network (i.e., filter bank coefficients). The augmentation policy consists of warping the features, masking blocks of frequency channels, and masking blocks of time steps. We apply SpecAugment on Listen, Attend and Spell networks for end-to-end speech recognition tasks. We achieve state-of-the-art performance on the LibriSpeech 960h and Swichboard 300h tasks, outperforming all prior work. On LibriSpeech, we achieve 6.8% WER on test-other without the use of a language model, and 5.8% WER with shallow fusion with a language model. This compares to the previous state-of-the-art hybrid system of 7.5% WER. For Switchboard, we achieve 7.2%/14.6% on the Switchboard/CallHome portion of the Hub5'00 test set without the use of a language model, and 6.8%/14.1% with shallow fusion, which compares to the previous state-of-the-art hybrid system at 8.3%/17.3% WER."} | ||
| 34 | {"work_id": 4385430679, "title": "RT-1: Robotics Transformer for Real-World Control at Scale", "abstract": "By transferring knowledge from large, diverse, taskagnostic datasets, modern machine learning models can solve specific downstream tasks either zero-shot or with small taskspecific datasets to a high level of performance.While this capability has been demonstrated in other fields such as computer vision, natural language processing or speech recognition, it remains to be shown in robotics, where the generalization capabilities of the models are particularly critical due to the difficulty of collecting real-world robotic data.We argue that one of the keys to the success of such general robotic models lies with open-ended task-agnostic training, combined with highcapacity architectures that can absorb all of the diverse, robotic data.In this paper, we present a model class, dubbed Robotics Transformer, that exhibits promising scalable model properties.We verify our conclusions in a study of different model classes and their ability to generalize as a function of the data size, model size, and data diversity based on a large-scale data collection on real robots performing real-world tasks.How would you bring me two sodas?How would you move three cokes to the trash can?How would you throw away two cokes?How would you bring me two different sodas?How would you bring me an apple, a coke, and water bottle?I spilled my coke on the table, how would you throw it away and then bring me something to help clean?I just worked out, can you bring me a drink and a snack to recover?How would you bring me a fruit, a soda, and a bag of chips for lunchTABLE XI: List of SayCan instructions evaluated in Sec.IV-D"} | 5 | {"work_id": 4385430679, "title": "RT-1: Robotics Transformer for Real-World Control at Scale", "abstract": "By transferring knowledge from large, diverse, taskagnostic datasets, modern machine learning models can solve specific downstream tasks either zero-shot or with small taskspecific datasets to a high level of performance.While this capability has been demonstrated in other fields such as computer vision, natural language processing or speech recognition, it remains to be shown in robotics, where the generalization capabilities of the models are particularly critical due to the difficulty of collecting real-world robotic data.We argue that one of the keys to the success of such general robotic models lies with open-ended task-agnostic training, combined with highcapacity architectures that can absorb all of the diverse, robotic data.In this paper, we present a model class, dubbed Robotics Transformer, that exhibits promising scalable model properties.We verify our conclusions in a study of different model classes and their ability to generalize as a function of the data size, model size, and data diversity based on a large-scale data collection on real robots performing real-world tasks.How would you bring me two sodas?How would you move three cokes to the trash can?How would you throw away two cokes?How would you bring me two different sodas?How would you bring me an apple, a coke, and water bottle?I spilled my coke on the table, how would you throw it away and then bring me something to help clean?I just worked out, can you bring me a drink and a snack to recover?How would you bring me a fruit, a soda, and a bag of chips for lunchTABLE XI: List of SayCan instructions evaluated in Sec.IV-D"} | ||
| 35 | {"work_id": 3207138404, "title": "Metaverse for Social Good", "abstract": "In recent years, the metaverse has attracted enormous attention from around the world with the development of related technologies. The expected metaverse should be a realistic society with more direct and physical interactions, while the concepts of race, gender, and even physical disability would be weakened, which would be highly beneficial for society. However, the development of metaverse is still in its infancy, with great potential for improvement. Regarding metaverse's huge potential, industry has already come forward with advance preparation, accompanied by feverish investment, but there are few discussions about metaverse in academia to scientifically guide its development. In this paper, we highlight the representative applications for social good. Then we propose a three-layer metaverse architecture from a macro perspective, containing infrastructure, interaction, and ecosystem. Moreover, we journey toward both a historical and novel metaverse with a detailed timeline and table of specific attributes. Lastly, we illustrate our implemented blockchain-driven metaverse prototype of a university campus and discuss the prototype design and insights."} | 6 | {"work_id": 3207138404, "title": "Metaverse for Social Good", "abstract": "In recent years, the metaverse has attracted enormous attention from around the world with the development of related technologies. The expected metaverse should be a realistic society with more direct and physical interactions, while the concepts of race, gender, and even physical disability would be weakened, which would be highly beneficial for society. However, the development of metaverse is still in its infancy, with great potential for improvement. Regarding metaverse's huge potential, industry has already come forward with advance preparation, accompanied by feverish investment, but there are few discussions about metaverse in academia to scientifically guide its development. In this paper, we highlight the representative applications for social good. Then we propose a three-layer metaverse architecture from a macro perspective, containing infrastructure, interaction, and ecosystem. Moreover, we journey toward both a historical and novel metaverse with a detailed timeline and table of specific attributes. Lastly, we illustrate our implemented blockchain-driven metaverse prototype of a university campus and discuss the prototype design and insights."} | ||
| 7 | +{"work_id": 4390874280, "title": "LLM-Planner: Few-Shot Grounded Planning for Embodied Agents with Large Language Models", "abstract": "This study focuses on using large language models (LLMs) as a planner for embodied agents that can follow natural language instructions to complete complex tasks in a visually-perceived environment. The high data cost and poor sample efficiency of existing methods hinders the development of versatile agents that are capable of many tasks and can learn new tasks quickly. In this work, we propose a novel method, LLM-Planner, that harnesses the power of large language models to do few-shot planning for embodied agents. We further propose a simple but effective way to enhance LLMs with physical grounding to generate and update plans that are grounded in the current environment. Experiments on the ALFRED dataset show that our method can achieve very competitive few-shot performance: Despite using less than 0.5% of paired training data, LLM-Planner achieves competitive performance with recent baselines that are trained using the full training data. Existing methods can barely complete any task successfully under the same few-shot setting. Our work opens the door for developing versatile and sample-efficient embodied agents that can quickly learn many tasks.1"} | ||||
| 36 | {"work_id": 4210598935, "title": "A Review of Yolo Algorithm Developments", "abstract": "Object detection techniques are the foundation for the artificial intelligence field. This research paper gives a brief overview of the You Only Look Once (YOLO) algorithm and its subsequent advanced versions. Through the analysis, we reach many remarks and insightful results. The results show the differences and similarities among the YOLO versions and between YOLO and Convolutional Neural Networks (CNNs). The central insight is the YOLO algorithm improvement is still ongoing.This article briefly describes the development process of the YOLO algorithm, summarizes the methods of target recognition and feature selection, and provides literature support for the targeted picture news and feature extraction in the financial and other fields. Besides, this paper contributes a lot to YOLO and other object detection literature."} | 8 | {"work_id": 4210598935, "title": "A Review of Yolo Algorithm Developments", "abstract": "Object detection techniques are the foundation for the artificial intelligence field. This research paper gives a brief overview of the You Only Look Once (YOLO) algorithm and its subsequent advanced versions. Through the analysis, we reach many remarks and insightful results. The results show the differences and similarities among the YOLO versions and between YOLO and Convolutional Neural Networks (CNNs). The central insight is the YOLO algorithm improvement is still ongoing.This article briefly describes the development process of the YOLO algorithm, summarizes the methods of target recognition and feature selection, and provides literature support for the targeted picture news and feature extraction in the financial and other fields. Besides, this paper contributes a lot to YOLO and other object detection literature."} | ||
| 37 | {"work_id": 3184439416, "title": "YOLOX: Exceeding YOLO Series in 2021", "abstract": "In this report, we present some experienced improvements to YOLO series, forming a new high-performance detector -- YOLOX. We switch the YOLO detector to an anchor-free manner and conduct other advanced detection techniques, i.e., a decoupled head and the leading label assignment strategy SimOTA to achieve state-of-the-art results across a large scale range of models: For YOLO-Nano with only 0.91M parameters and 1.08G FLOPs, we get 25.3% AP on COCO, surpassing NanoDet by 1.8% AP; for YOLOv3, one of the most widely used detectors in industry, we boost it to 47.3% AP on COCO, outperforming the current best practice by 3.0% AP; for YOLOX-L with roughly the same amount of parameters as YOLOv4-CSP, YOLOv5-L, we achieve 50.0% AP on COCO at a speed of 68.9 FPS on Tesla V100, exceeding YOLOv5-L by 1.8% AP. Further, we won the 1st Place on Streaming Perception Challenge (Workshop on Autonomous Driving at CVPR 2021) using a single YOLOX-L model. We hope this report can provide useful experience for developers and researchers in practical scenes, and we also provide deploy versions with ONNX, TensorRT, NCNN, and Openvino supported. Source code is at https://github.com/Megvii-BaseDetection/YOLOX."} | 9 | {"work_id": 3184439416, "title": "YOLOX: Exceeding YOLO Series in 2021", "abstract": "In this report, we present some experienced improvements to YOLO series, forming a new high-performance detector -- YOLOX. We switch the YOLO detector to an anchor-free manner and conduct other advanced detection techniques, i.e., a decoupled head and the leading label assignment strategy SimOTA to achieve state-of-the-art results across a large scale range of models: For YOLO-Nano with only 0.91M parameters and 1.08G FLOPs, we get 25.3% AP on COCO, surpassing NanoDet by 1.8% AP; for YOLOv3, one of the most widely used detectors in industry, we boost it to 47.3% AP on COCO, outperforming the current best practice by 3.0% AP; for YOLOX-L with roughly the same amount of parameters as YOLOv4-CSP, YOLOv5-L, we achieve 50.0% AP on COCO at a speed of 68.9 FPS on Tesla V100, exceeding YOLOv5-L by 1.8% AP. Further, we won the 1st Place on Streaming Perception Challenge (Workshop on Autonomous Driving at CVPR 2021) using a single YOLOX-L model. We hope this report can provide useful experience for developers and researchers in practical scenes, and we also provide deploy versions with ONNX, TensorRT, NCNN, and Openvino supported. Source code is at https://github.com/Megvii-BaseDetection/YOLOX."} | ||
| 38 | {"work_id": 4391136507, "title": "A Survey on Evaluation of Large Language Models", "abstract": "Large language models (LLMs) are gaining increasing popularity in both academia and industry, owing to their unprecedented performance in various applications. As LLMs continue to play a vital role in both research and daily use, their evaluation becomes increasingly critical, not only at the task level, but also at the society level for better understanding of their potential risks. Over the past years, significant efforts have been made to examine LLMs from various perspectives. This paper presents a comprehensive review of these evaluation methods for LLMs, focusing on three key dimensions: what to evaluate , where to evaluate , and how to evaluate . Firstly, we provide an overview from the perspective of evaluation tasks, encompassing general natural language processing tasks, reasoning, medical usage, ethics, education, natural and social sciences, agent applications, and other areas. Secondly, we answer the \u2018where\u2019 and \u2018how\u2019 questions by diving into the evaluation methods and benchmarks, which serve as crucial components in assessing the performance of LLMs. Then, we summarize the success and failure cases of LLMs in different tasks. Finally, we shed light on several future challenges that lie ahead in LLMs evaluation. Our aim is to offer invaluable insights to researchers in the realm of LLMs evaluation, thereby aiding the development of more proficient LLMs. Our key point is that evaluation should be treated as an essential discipline to better assist the development of LLMs. We consistently maintain the related open-source materials at: https://github.com/MLGroupJLU/LLM-eval-survey"} | 10 | {"work_id": 4391136507, "title": "A Survey on Evaluation of Large Language Models", "abstract": "Large language models (LLMs) are gaining increasing popularity in both academia and industry, owing to their unprecedented performance in various applications. As LLMs continue to play a vital role in both research and daily use, their evaluation becomes increasingly critical, not only at the task level, but also at the society level for better understanding of their potential risks. Over the past years, significant efforts have been made to examine LLMs from various perspectives. This paper presents a comprehensive review of these evaluation methods for LLMs, focusing on three key dimensions: what to evaluate , where to evaluate , and how to evaluate . Firstly, we provide an overview from the perspective of evaluation tasks, encompassing general natural language processing tasks, reasoning, medical usage, ethics, education, natural and social sciences, agent applications, and other areas. Secondly, we answer the \u2018where\u2019 and \u2018how\u2019 questions by diving into the evaluation methods and benchmarks, which serve as crucial components in assessing the performance of LLMs. Then, we summarize the success and failure cases of LLMs in different tasks. Finally, we shed light on several future challenges that lie ahead in LLMs evaluation. Our aim is to offer invaluable insights to researchers in the realm of LLMs evaluation, thereby aiding the development of more proficient LLMs. Our key point is that evaluation should be treated as an essential discipline to better assist the development of LLMs. We consistently maintain the related open-source materials at: https://github.com/MLGroupJLU/LLM-eval-survey"} | ||
| 11 | +{"work_id": 2998789541, "title": "The Image Biomarker Standardization Initiative: Standardized Quantitative Radiomics for High-Throughput Image-based Phenotyping", "abstract": "See also the editorial by Kuhl and Truhn in this issue."} | ||||
| 39 | {"work_id": 4312933868, "title": "High-Resolution Image Synthesis with Latent Diffusion Models", "abstract": "By decomposing the image formation process into a sequential application of denoising autoencoders, diffusion models (DMs) achieve state-of-the-art synthesis results on image data and beyond. Additionally, their formulation allows for a guiding mechanism to control the image generation process without retraining. However, since these models typically operate directly in pixel space, optimization of powerful DMs often consumes hundreds of GPU days and inference is expensive due to sequential evaluations. To enable DM training on limited computational resources while retaining their quality and flexibility, we apply them in the latent space of powerful pretrained autoencoders. In contrast to previous work, training diffusion models on such a representation allows for the first time to reach a near-optimal point between complexity reduction and detail preservation, greatly boosting visual fidelity. By introducing cross-attention layers into the model architecture, we turn diffusion models into powerful and flexible generators for general conditioning inputs such as text or bounding boxes and high-resolution synthesis becomes possible in a convolutional manner. Our latent diffusion models (LDMs) achieve new state of the art scores for image inpainting and class-conditional image synthesis and highly competitive performance on various tasks, including unconditional image generation, text-to-image synthesis, and super-resolution, while significantly reducing computational requirements compared to pixel-based DMs."} | 12 | {"work_id": 4312933868, "title": "High-Resolution Image Synthesis with Latent Diffusion Models", "abstract": "By decomposing the image formation process into a sequential application of denoising autoencoders, diffusion models (DMs) achieve state-of-the-art synthesis results on image data and beyond. Additionally, their formulation allows for a guiding mechanism to control the image generation process without retraining. However, since these models typically operate directly in pixel space, optimization of powerful DMs often consumes hundreds of GPU days and inference is expensive due to sequential evaluations. To enable DM training on limited computational resources while retaining their quality and flexibility, we apply them in the latent space of powerful pretrained autoencoders. In contrast to previous work, training diffusion models on such a representation allows for the first time to reach a near-optimal point between complexity reduction and detail preservation, greatly boosting visual fidelity. By introducing cross-attention layers into the model architecture, we turn diffusion models into powerful and flexible generators for general conditioning inputs such as text or bounding boxes and high-resolution synthesis becomes possible in a convolutional manner. Our latent diffusion models (LDMs) achieve new state of the art scores for image inpainting and class-conditional image synthesis and highly competitive performance on various tasks, including unconditional image generation, text-to-image synthesis, and super-resolution, while significantly reducing computational requirements compared to pixel-based DMs."} | ||
| 13 | +{"work_id": 3045012476, "title": "Kinetic data structures for the geometric modeling of urban environments", "abstract": "Structures de donn\u00e9es cin\u00e9tiques pour la mod\u00e9lisation g\u00e9om\u00e9trique d\u2019environnements urbains La mod\u00e9lisation g\u00e9om\u00e9trique d'objets urbains \u00e0 partir de mesures physiques et leur repr\u00e9sentation de mani\u00e8re efficace, compacte et pr\u00e9cise est un probl\u00e8me difficile en vision par ordinateur et en infographie. Dans la litt\u00e9rature scientifique, les structures de donn\u00e9es g\u00e9om\u00e9triques \u00e0 l'interface entre les mesures physiques en entr\u00e9e et les mod\u00e8les produits en sortie passent rarement \u00e0 l'\u00e9chelle et ne permettent pas de partitionner des domaines ferm\u00e9s 2D et 3D repr\u00e9sentant des sc\u00e8nes complexes. Dans cette th\u00e8se, on \u00e9tudie une nouvelle famille de structures de donn\u00e9es g\u00e9om\u00e9trique qui repose sur une formulation cin\u00e9tique. Plus pr\u00e9cis\u00e9ment, on r\u00e9alise une partition de domaines ferm\u00e9s en d\u00e9tectant et en propageant au cours du temps des formes g\u00e9om\u00e9triques telles que des segments de droites ou des plans, jusqu'\u00e0 collision et cr\u00e9ation de cellules polygonales. On propose en particulier deux m\u00e9thodes de mod\u00e9lisation g\u00e9om\u00e9trique, une pour la vectorisation de r\u00e9gions d'int\u00e9r\u00eat dans des images, et une autre pour la reconstruction d'objets en maillages polygonaux concis \u00e0 partir de nuages de points 3D. Les deux approches exploitent les structures de donn\u00e9es cin\u00e9tiques pour d\u00e9composer efficacement en cellules soit un domaine image en 2D, soit un domaine ferm\u00e9 en 3D. Les objets sont ensuite extraits de la partition \u00e0 l\u2019aide d\u2019une proc\u00e9dure d\u2019\u00e9tiquetage binaire des cellules. Les exp\u00e9riences men\u00e9es sur une grande vari\u00e9t\u00e9 de donn\u00e9es en termes de nature, contenus, complexit\u00e9, taille et caract\u00e9ristiques d'acquisition d\u00e9montrent la polyvalence de ces deux m\u00e9thodes. On montre en particulier leur potentiel applicatif sur le probl\u00e8me de mod\u00e9lisation urbaine \u00e0 grande \u00e9chelle \u00e0 partir de donn\u00e9es a\u00e9riennes et satellitaires."} | ||||
| 40 | {"work_id": 7205708264, "title": "Relationship between educational robotics and executive functions in children with neurodevelopmental disorders", "abstract": "International audience"} | 14 | {"work_id": 7205708264, "title": "Relationship between educational robotics and executive functions in children with neurodevelopmental disorders", "abstract": "International audience"} | ||
| 15 | +{"work_id": 2942551262, "title": "Single image portrait relighting", "abstract": "Lighting plays a central role in conveying the essence and depth of the subject in a portrait photograph. Professional photographers will carefully control the lighting in their studio to manipulate the appearance of their subject, while consumer photographers are usually constrained to the illumination of their environment. Though prior works have explored techniques for relighting an image, their utility is usually limited due to requirements of specialized hardware, multiple images of the subject under controlled or known illuminations, or accurate models of geometry and reflectance. To this end, we present a system for portrait relighting : a neural network that takes as input a single RGB image of a portrait taken with a standard cellphone camera in an unconstrained environment, and from that image produces a relit image of that subject as though it were illuminated according to any provided environment map. Our method is trained on a small database of 18 individuals captured under different directional light sources in a controlled light stage setup consisting of a densely sampled sphere of lights. Our proposed technique produces quantitatively superior results on our dataset's validation set compared to prior works, and produces convincing qualitative relighting results on a dataset of hundreds of real-world cellphone portraits. Because our technique can produce a 640 \u00d7 640 image in only 160 milliseconds, it may enable interactive user-facing photographic applications in the future."} | ||||
| 41 | {"work_id": 4372260310, "title": "Large-Scale Contrastive Language-Audio Pretraining with Feature Fusion and Keyword-to-Caption Augmentation", "abstract": "Contrastive learning has shown remarkable success in the field of multimodal representation learning. In this paper, we propose a pipeline of contrastive language-audio pretraining to develop an audio representation by combining audio data with natural language descriptions. To accomplish this target, we first release LAION-Audio-630K, a large collection of 633,526 audio-text pairs from different data sources. Second, we construct a contrastive language-audio pretraining model by considering different audio encoders and text encoders. We incorporate the feature fusion mechanism and keyword-to-caption augmentation into the model design to further enable the model to process audio inputs of variable lengths and enhance the performance. Third, we perform comprehensive experiments to evaluate our model across three tasks: text-to-audio retrieval, zero-shot audio classification, and supervised audio classification. The results demonstrate that our model achieves superior performance in text-to-audio retrieval task. In audio classification tasks, the model achieves state-of-the-art performance in the zero-shot setting and is able to obtain performance comparable to models\u2019 results in the non-zero-shot setting. LAION-Audio-630K1and the proposed model2are both available to the public."} | 16 | {"work_id": 4372260310, "title": "Large-Scale Contrastive Language-Audio Pretraining with Feature Fusion and Keyword-to-Caption Augmentation", "abstract": "Contrastive learning has shown remarkable success in the field of multimodal representation learning. In this paper, we propose a pipeline of contrastive language-audio pretraining to develop an audio representation by combining audio data with natural language descriptions. To accomplish this target, we first release LAION-Audio-630K, a large collection of 633,526 audio-text pairs from different data sources. Second, we construct a contrastive language-audio pretraining model by considering different audio encoders and text encoders. We incorporate the feature fusion mechanism and keyword-to-caption augmentation into the model design to further enable the model to process audio inputs of variable lengths and enhance the performance. Third, we perform comprehensive experiments to evaluate our model across three tasks: text-to-audio retrieval, zero-shot audio classification, and supervised audio classification. The results demonstrate that our model achieves superior performance in text-to-audio retrieval task. In audio classification tasks, the model achieves state-of-the-art performance in the zero-shot setting and is able to obtain performance comparable to models\u2019 results in the non-zero-shot setting. LAION-Audio-630K1and the proposed model2are both available to the public."} | ||
| 42 | {"work_id": 4411403346, "title": "A Comprehensive Overview of Large Language Models", "abstract": "Large Language Models (LLMs) have recently demonstrated remarkable capabilities in natural language processing tasks and beyond. This success of LLMs has led to a large influx of research contributions in this direction. These works encompass diverse topics such as architectural innovations, better training strategies, context length improvements, fine-tuning, multimodal LLMs, robotics, datasets, benchmarking, efficiency, and more. With the rapid development of techniques and regular breakthroughs in LLM research, it has become considerably challenging to perceive the bigger picture of the advances in this direction. Considering the rapidly emerging plethora of literature on LLMs, it is imperative that the research community is able to benefit from a concise yet comprehensive overview of the recent developments in this field. This article provides an overview of the literature on a broad range of LLM-related concepts. Our self-contained comprehensive overview of LLMs discusses relevant background concepts along with covering the advanced topics at the frontier of research in LLMs. This review article is intended to provide not only a systematic survey but also a quick, comprehensive reference for the researchers and practitioners to draw insights from extensive, informative summaries of the existing works to advance the LLM research."} | 17 | {"work_id": 4411403346, "title": "A Comprehensive Overview of Large Language Models", "abstract": "Large Language Models (LLMs) have recently demonstrated remarkable capabilities in natural language processing tasks and beyond. This success of LLMs has led to a large influx of research contributions in this direction. These works encompass diverse topics such as architectural innovations, better training strategies, context length improvements, fine-tuning, multimodal LLMs, robotics, datasets, benchmarking, efficiency, and more. With the rapid development of techniques and regular breakthroughs in LLM research, it has become considerably challenging to perceive the bigger picture of the advances in this direction. Considering the rapidly emerging plethora of literature on LLMs, it is imperative that the research community is able to benefit from a concise yet comprehensive overview of the recent developments in this field. This article provides an overview of the literature on a broad range of LLM-related concepts. Our self-contained comprehensive overview of LLMs discusses relevant background concepts along with covering the advanced topics at the frontier of research in LLMs. This review article is intended to provide not only a systematic survey but also a quick, comprehensive reference for the researchers and practitioners to draw insights from extensive, informative summaries of the existing works to advance the LLM research."} | ||
| 43 | {"work_id": 3212386989, "title": "Attention mechanisms in computer vision: A survey", "abstract": "Humans can naturally and effectively find salient regions in complex scenes. Motivated by this observation, attention mechanisms were introduced into computer vision with the aim of imitating this aspect of the human visual system. Such an attention mechanism can be regarded as a dynamic weight adjustment process based on features of the input image. Attention mechanisms have achieved great success in many visual tasks, including image classification, object detection, semantic segmentation, video understanding, image generation, 3D vision, multimodal tasks, and self-supervised learning. In this survey, we provide a comprehensive review of various attention mechanisms in computer vision and categorize them according to approach, such as channel attention, spatial attention, temporal attention, and branch attention; a related repository https://github.com/MenghaoGuo/Awesome-Vision-Attentions is dedicated to collecting related work. We also suggest future directions for attention mechanism research."} | 18 | {"work_id": 3212386989, "title": "Attention mechanisms in computer vision: A survey", "abstract": "Humans can naturally and effectively find salient regions in complex scenes. Motivated by this observation, attention mechanisms were introduced into computer vision with the aim of imitating this aspect of the human visual system. Such an attention mechanism can be regarded as a dynamic weight adjustment process based on features of the input image. Attention mechanisms have achieved great success in many visual tasks, including image classification, object detection, semantic segmentation, video understanding, image generation, 3D vision, multimodal tasks, and self-supervised learning. In this survey, we provide a comprehensive review of various attention mechanisms in computer vision and categorize them according to approach, such as channel attention, spatial attention, temporal attention, and branch attention; a related repository https://github.com/MenghaoGuo/Awesome-Vision-Attentions is dedicated to collecting related work. We also suggest future directions for attention mechanism research."} | ||
@@ -48,38 +23,47 @@ | |||||
| 48 | {"work_id": 2787560479, "title": "Deep Contextualized Word Representations", "abstract": "Matthew E. Peters, Mark Neumann, Mohit Iyyer, Matt Gardner, Christopher Clark, Kenton Lee, Luke Zettlemoyer. Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long Papers). 2018."} | 23 | {"work_id": 2787560479, "title": "Deep Contextualized Word Representations", "abstract": "Matthew E. Peters, Mark Neumann, Mohit Iyyer, Matt Gardner, Christopher Clark, Kenton Lee, Luke Zettlemoyer. Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long Papers). 2018."} | ||
| 49 | {"work_id": 2954996726, "title": "A survey on Image Data Augmentation for Deep Learning", "abstract": "Deep convolutional neural networks have performed remarkably well on many Computer Vision tasks. However, these networks are heavily reliant on big data to avoid overfitting. Overfitting refers to the phenomenon when a network learns a function with very high variance such as to perfectly model the training data. Unfortunately, many application domains do not have access to big data, such as medical image analysis. This survey focuses on Data Augmentation, a data-space solution to the problem of limited data. Data Augmentation encompasses a suite of techniques that enhance the size and quality of training datasets such that better Deep Learning models can be built using them. The image augmentation algorithms discussed in this survey include geometric transformations, color space augmentations, kernel filters, mixing images, random erasing, feature space augmentation, adversarial training, generative adversarial networks, neural style transfer, and meta-learning. The application of augmentation methods based on GANs are heavily covered in this survey. In addition to augmentation techniques, this paper will briefly discuss other characteristics of Data Augmentation such as test-time augmentation, resolution impact, final dataset size, and curriculum learning. This survey will present existing methods for Data Augmentation, promising developments, and meta-level decisions for implementing Data Augmentation. Readers will understand how Data Augmentation can improve the performance of their models and expand limited datasets to take advantage of the capabilities of big data."} | 24 | {"work_id": 2954996726, "title": "A survey on Image Data Augmentation for Deep Learning", "abstract": "Deep convolutional neural networks have performed remarkably well on many Computer Vision tasks. However, these networks are heavily reliant on big data to avoid overfitting. Overfitting refers to the phenomenon when a network learns a function with very high variance such as to perfectly model the training data. Unfortunately, many application domains do not have access to big data, such as medical image analysis. This survey focuses on Data Augmentation, a data-space solution to the problem of limited data. Data Augmentation encompasses a suite of techniques that enhance the size and quality of training datasets such that better Deep Learning models can be built using them. The image augmentation algorithms discussed in this survey include geometric transformations, color space augmentations, kernel filters, mixing images, random erasing, feature space augmentation, adversarial training, generative adversarial networks, neural style transfer, and meta-learning. The application of augmentation methods based on GANs are heavily covered in this survey. In addition to augmentation techniques, this paper will briefly discuss other characteristics of Data Augmentation such as test-time augmentation, resolution impact, final dataset size, and curriculum learning. This survey will present existing methods for Data Augmentation, promising developments, and meta-level decisions for implementing Data Augmentation. Readers will understand how Data Augmentation can improve the performance of their models and expand limited datasets to take advantage of the capabilities of big data."} | ||
| 50 | {"work_id": 4390873054, "title": "Adding Conditional Control to Text-to-Image Diffusion Models", "abstract": "We present ControlNet, a neural network architecture to add spatial conditioning controls to large, pretrained text-to-image diffusion models. ControlNet locks the production-ready large diffusion models, and reuses their deep and robust encoding layers pretrained with billions of images as a strong backbone to learn a diverse set of conditional controls. The neural architecture is connected with \"zero convolutions\" (zero-initialized convolution layers) that progressively grow the parameters from zero and ensure that no harmful noise could affect the finetuning. We test various conditioning controls, e.g., edges, depth, segmentation, human pose, etc., with Stable Diffusion, using single or multiple conditions, with or without prompts. We show that the training of ControlNets is robust with small (1m) datasets. Extensive results show that ControlNet may facilitate wider applications to control image diffusion models."} | 25 | {"work_id": 4390873054, "title": "Adding Conditional Control to Text-to-Image Diffusion Models", "abstract": "We present ControlNet, a neural network architecture to add spatial conditioning controls to large, pretrained text-to-image diffusion models. ControlNet locks the production-ready large diffusion models, and reuses their deep and robust encoding layers pretrained with billions of images as a strong backbone to learn a diverse set of conditional controls. The neural architecture is connected with \"zero convolutions\" (zero-initialized convolution layers) that progressively grow the parameters from zero and ensure that no harmful noise could affect the finetuning. We test various conditioning controls, e.g., edges, depth, segmentation, human pose, etc., with Stable Diffusion, using single or multiple conditions, with or without prompts. We show that the training of ControlNets is robust with small (1m) datasets. Extensive results show that ControlNet may facilitate wider applications to control image diffusion models."} | ||
| 51 | −{"work_id": 4320002812, "title": "Object Detection in 20 Years: A Survey", "abstract": "Object detection, as of one the most fundamental and challenging problems in computer vision, has received great attention in recent years. Over the past two decades, we have seen a rapid technological evolution of object detection and its profound impact on the entire computer vision field. If we consider today\u2019s object detection technique as a revolution driven by deep learning, then, back in the 1990s, we would see the ingenious thinking and long-term perspective design of early computer vision. This article extensively reviews this fast-moving research field in the light of technical evolution, spanning over a quarter-century\u2019s time (from the 1990s to 2022). A number of topics have been covered in this article, including the milestone detectors in history, detection datasets, metrics, fundamental building blocks of the detection system, speedup techniques, and recent state-of-the-art detection methods."} | 26 | +{"work_id": 1506965148, "title": "Mastering the Information Age Solving Problems with Visual Analytics", "abstract": "Today, in many spheres of human activity, massive amounts of data are collected and stored. As the volumes of data available to lawmakers, civil servants, business people and scientists increase, their effective use becomes more challenging. Simply keeping up to date with the flood of data, using standard tools for data management and analysis, is fraught with difficulty. The field of visual analytics seeks to provide people with better and more effective means to understand and analyse massive amounts of data. It also seeks to enable them to act upon their findings immediately, that is, in real time. Visual analytics integrates the analytic capabilities of the computer and the abilities of the human analyst. In so doing it allows novel discoveries and empowers individuals to take control of the analytical process. Visual analytics opens the door to the discoveries and unexpected insights which lead to beneficial and profitable innovation. This book is the result of the VisMaster project, a coordination action funded by the European Commission to form a strong visual analytics research community."} | ||
| 52 | −{"work_id": 2798812533, "title": "Universal Language Model Fine-tuning for Text Classification", "abstract": "Inductive transfer learning has greatly impacted computer vision, but existing approaches in NLP still require task-specific modifications and training from scratch.We propose Universal Language Model Fine-tuning (ULMFiT), an effective transfer learning method that can be applied to any task in NLP, and introduce techniques that are key for fine-tuning a language model.Our method significantly outperforms the state-of-the-art on six text classification tasks, reducing the error by 18-24% on the majority of datasets.Furthermore, with only 100 labeled examples, it matches the performance of training from scratch on 100\u00d7 more data.We opensource our pretrained models and code 1 ."} | 27 | +{"work_id": 2982399380, "title": "BART: Denoising Sequence-to-Sequence Pre-training for Natural Language Generation, Translation, and Comprehension", "abstract": "Mike Lewis, Yinhan Liu, Naman Goyal, Marjan Ghazvininejad, Abdelrahman Mohamed, Omer Levy, Veselin Stoyanov, Luke Zettlemoyer. Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics. 2020."} | ||
| 53 | −{"work_id": 4372266552, "title": "CLAP Learning Audio Concepts from Natural Language Supervision", "abstract": "Mainstream machine listening models are trained to learn audio concepts under the paradigm of one class label to many recordings focusing on one task. Learning under such restricted supervision limits the flexibility of models because they require labeled audio for training and can only predict the predefined categories. Instead, we propose to learn audio concepts from natural language supervision. We call our approach Contrastive Language-Audio Pretraining (CLAP), which connects language and audio by using two encoders and a contrastive learning objective, bringing audio and text descriptions into a joint multimodal space. We trained CLAP with 128k audio and text pairs and evaluated it on 16 downstream tasks across 7 domains, such as classification of sound events, scenes, music, and speech. CLAP establishes state-of-the-art (SoTA) in Zero-Shot performance. Also, we evaluated CLAP\u2019s audio encoder in a supervised learning setup and achieved SoTA in 5 tasks. The Zero-Shot capability removes the need of training with class labeled audio, enables flexible class prediction at inference time, and generalizes well in multiple downstream tasks. Code is available at: https://github.com/microsoft/CLAP."} | 28 | +{"work_id": 4377235537, "title": "A Survey on the Metaverse: The State-of-the-Art, Technologies, Applications, and Challenges", "abstract": "In recent years, the concept of the Metaverse has attracted considerable attention. This article provides a comprehensive overview of the Metaverse. First, the development status of the Metaverse is presented. We summarize the policies of various countries, companies, and organizations relevant to the Metaverse, as well as statistics on the number of Metaverse-related publications. Characteristics of the Metaverse are identified: 1) multitechnology convergence; 2) sociality; and 3) hyper-spatio-temporality. For the multitechnology convergence of the Metaverse, we divide the technological framework of the Metaverse into five dimensions. For the sociality of the Metaverse, we focus on the Metaverse as a virtual social world. Regarding the characteristic of hyper-spatio-temporality, we introduce the Metaverse as an open, immersive, and interactive 3-D virtual world which can break through the constraints of time and space in the real world. The challenges of the Metaverse are also discussed."} | ||
| 54 | −{"work_id": 4385482704, "title": "Photo tourism: exploring photo collections in 3D", "abstract": "We present a system for interactively browsing and exploring large unstructured collections of photographs of a scene using a novel 3D interface. Our system consists of an image-based modeling front end that automatically computes the viewpoint of each photograph as well as a sparse 3D model of the scene and image to model correspondences. Our photo explorer uses image-based rendering techniques to smoothly transition between photographs, while also enabling full 3D navigation and exploration of the set of images and world geometry, along with auxiliary information such as overhead maps. Our system also makes it easy to construct photo tours of scenic or historic locations, and to annotate image details, which are automatically transferred to other relevant images. We demonstrate our system on several large personal photo collections as well as images gathered from Internet photo sharing sites."} | 29 | +{"work_id": 2963341956, "title": "BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding", "abstract": "Jacob Devlin, Ming-Wei Chang, Kenton Lee, Kristina Toutanova. Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long and Short Papers). 2019."} | ||
| 55 | −{"work_id": 2308543850, "title": "Scene-motion- and latency-perception thresholds for head-mounted displays", "abstract": "A fundamental task of an immersive virtual environment (IVE) system is to present images of the virtual world that change appropriately as the user's head moves. Current IVE systems, especially those using head-mounted displays (HMDs), often produce spatially unstable scenes, resulting in simulator sickness, degraded task performance, degraded visual acuity, and breaks in presence. In HMDs, instability resulting from latency is greater than all other causes of instability combined. The primary way users perceive latency in an HMD is by improper motion of scenes that should be stationary in the world. Whereas latency-induced scene motion is well defined mathematically, less is understood about how much scene motion and/or latency can occur without subjects noticing, and how this varies under different conditions. I built a simulated HMD system with zero effective latency---no scene motion occurs due to latency. I intentionally and artificially inserted scene motion into the virtual environment in order to determine how much scene motion and/or latency can occur without subjects noticing. I measured perceptual thresholds of scene-motion and latency under different conditions across five experiments. Based on the study of latency, head motion, scene motion, and perceptual thresholds, I developed a mathematical model of latency thresholds as an inverse function of peak head-yaw acceleration. Psychophysics studies showed that measured latency thresholds correlate with this inverse function better than with a linear function. The work reported here readily enables scientists and engineers to, under their particular conditions, measure latency thresholds as a function of head motion by using an off-the-shelf projector system. Latency requirements can thus be determined before designing HMD systems."} | 30 | +{"work_id": 3035524453, "title": "Momentum Contrast for Unsupervised Visual Representation Learning", "abstract": "We present Momentum Contrast (MoCo) for unsupervised visual representation learning. From a perspective on contrastive learning as dictionary look-up, we build a dynamic dictionary with a queue and a moving-averaged encoder. This enables building a large and consistent dictionary on-the-fly that facilitates contrastive unsupervised learning. MoCo provides competitive results under the common linear protocol on ImageNet classification. More importantly, the representations learned by MoCo transfer well to downstream tasks. MoCo can outperform its supervised pre-training counterpart in 7 detection/segmentation tasks on PASCAL VOC, COCO, and other datasets, sometimes surpassing it by large margins. This suggests that the gap between unsupervised and supervised representation learning has been largely closed in many vision tasks."} | ||
| 56 | −{"work_id": 4386076325, "title": "YOLOv7: Trainable Bag-of-Freebies Sets New State-of-the-Art for Real-Time Object Detectors", "abstract": "Real-time object detection is one of the most important research topics in computer vision. As new approaches regarding architecture optimization and training optimization are continually being developed, we have found two research topics that have spawned when dealing with these latest state-of-the-art methods. To address the topics, we propose a trainable bag-of-freebies oriented solution. We combine the flexible and efficient training tools with the proposed architecture and the compound scaling method. YOLOv7 surpasses all known object detectors in both speed and accuracy in the range from 5 FPS to 120 FPS and has the highest accuracy 56.8% AP among all known real-time object detectors with 30 FPS or higher on GPU V100. Source code is released in https://github.com/WongKinYiu/yolov7."} | 31 | +{"work_id": 1524333225, "title": "Kaldi Speech Recognition Toolkit", "abstract": "Abstract\u2014We describe the design of Kaldi, a free, open-source toolkit for speech recognition research. Kaldi provides a speech recognition system based on finite-state transducers (using the freely available OpenFst), together with detailed documentation and scripts for building complete recognition systems. Kaldi is written is C++, and the core library supports modeling of arbitrary phonetic-context sizes, acoustic modeling with subspace Gaussian mixture models (SGMM) as well as standard Gaussian mixture models, together with all commonly used linear and affine transforms. Kaldi is released under the Apache License v2.0, which is highly nonrestrictive, making it suitable for a wide community of users. I."} | ||
| 57 | −{"work_id": 4206484811, "title": "A Metaverse: Taxonomy, Components, Applications, and Open Challenges", "abstract": "Unlike previous studies on the Metaverse based on Second Life, the current Metaverse is based on the social value of Generation Z that online and offline selves are not different. With the technological development of deep learning-based high-precision recognition models and natural generation models, Metaverse is being strengthened with various factors, from mobile-based always-on access to connectivity with reality using virtual currency. The integration of enhanced social activities and neural-net methods requires a new definition of Metaverse suitable for the present, different from the previous Metaverse. This paper divides the concepts and essential techniques necessary for realizing the Metaverse into three components (i.e., hardware, software, and contents) and three approaches (i.e., user interaction, implementation, and application) rather than marketing or hardware approach to conduct a comprehensive analysis. Furthermore, we describe essential methods based on three components and techniques to Metaverse\u2019s representative Ready Player One, Roblox, and Facebook research in the domain of films, games, and studies. Finally, we summarize the limitations and directions for implementing the immersive Metaverse as social influences, constraints, and open challenges."} | 32 | +{"work_id": 2886953980, "title": "MnasNet: Platform-Aware Neural Architecture Search for Mobile", "abstract": "Designing convolutional neural networks (CNN) for mobile devices is challenging because mobile models need to be small and fast, yet still accurate. Although significant efforts have been dedicated to design and improve mobile CNNs on all dimensions, it is very difficult to manually balance these trade-offs when there are so many architectural possibilities to consider. In this paper, we propose an automated mobile neural architecture search (MNAS) approach, which explicitly incorporate model latency into the main objective so that the search can identify a model that achieves a good trade-off between accuracy and latency. Unlike previous work, where latency is considered via another, often inaccurate proxy (e.g., FLOPS), our approach directly measures real-world inference latency by executing the model on mobile phones. To further strike the right balance between flexibility and search space size, we propose a novel factorized hierarchical search space that encourages layer diversity throughout the network. Experimental results show that our approach consistently outperforms state-of-the-art mobile CNN models across multiple vision tasks. On the ImageNet classification task, our MnasNet achieves 75.2% top-1 accuracy with 78ms latency on a Pixel phone, which is 1.8\u00d7 faster than MobileNetV2 with 0.5% higher accuracy and 2.3\u00d7 faster than NASNet with 1.2% higher accuracy. Our MnasNet also achieves better mAP quality than MobileNets for COCO object detection. Code is at https://github.com/tensorflow/tpu/tree/master/models/official/mnasnet."} | ||
| 58 | −{"work_id": 2884367402, "title": "Object Detection With Deep Learning: A Review", "abstract": "Due to object detection's close relationship with video analysis and image understanding, it has attracted much research attention in recent years. Traditional object detection methods are built on handcrafted features and shallow trainable architectures. Their performance easily stagnates by constructing complex ensembles that combine multiple low-level image features with high-level context from object detectors and scene classifiers. With the rapid development in deep learning, more powerful tools, which are able to learn semantic, high-level, deeper features, are introduced to address the problems existing in traditional architectures. These models behave differently in network architecture, training strategy, and optimization function. In this paper, we provide a review of deep learning-based object detection frameworks. Our review begins with a brief introduction on the history of deep learning and its representative tool, namely, the convolutional neural network. Then, we focus on typical generic object detection architectures along with some modifications and useful tricks to improve detection performance further. As distinct specific detection tasks exhibit different characteristics, we also briefly survey several specific tasks, including salient object detection, face detection, and pedestrian detection. Experimental analyses are also provided to compare various methods and draw some meaningful conclusions. Finally, several promising directions and tasks are provided to serve as guidelines for future work in both object detection and relevant neural network-based learning systems."} | 33 | +{"work_id": 2896457183, "title": "AI-Assisted Pipeline for Dynamic Generation of Trustworthy Health Supplement Content at Scale", "abstract": "Although geospatial question answering systems have received increasing attention in recent years, existing prototype systems struggle to properly answer qualitative spatial questions. In this work, we propose a unique framework for answering qualitative spatial questions, which comprises three main components: a geoparser that takes the input questions and extracts place semantic information from text, a reasoning system which is embedded with a crisp reasoner, and finally, answer extraction, which refines the solution space and generates final answers. We present an experimental design to evaluate our framework for point-based cardinal direction calculus (CDC) relations by developing an automated approach for generating three types of synthetic qualitative spatial questions. The initial evaluations of generated answers in our system are promising because a high proportion of answers were labelled correct."} | ||
| 59 | −{"work_id": 4388823657, "title": "A Comprehensive Review of YOLO Architectures in Computer Vision: From YOLOv1 to YOLOv8 and YOLO-NAS", "abstract": "YOLO has become a central real-time object detection system for robotics, driverless cars, and video monitoring applications. We present a comprehensive analysis of YOLO\u2019s evolution, examining the innovations and contributions in each iteration from the original YOLO up to YOLOv8, YOLO-NAS, and YOLO with transformers. We start by describing the standard metrics and postprocessing; then, we discuss the major changes in network architecture and training tricks for each model. Finally, we summarize the essential lessons from YOLO\u2019s development and provide a perspective on its future, highlighting potential research directions to enhance real-time object detection systems."} | 34 | +{"work_id": 3042011474, "title": "CSPNet: A New Backbone that can Enhance Learning Capability of CNN", "abstract": "Neural networks have enabled state-of-the-art approaches to achieve incredible results on computer vision tasks such as object detection. However, such success greatly relies on costly computation resources, which hinders people with cheap devices from appreciating the advanced technology. In this paper, we propose Cross Stage Partial Network (CSPNet) to mitigate the problem that previous works require heavy inference computations from the network architecture perspective. We attribute the problem to the duplicate gradient information within network optimization. The proposed networks respect the variability of the gradients by integrating feature maps from the beginning and the end of a network stage, which, in our experiments, reduces computations by 20% with equivalent or even superior accuracy on the ImageNet dataset, and significantly outperforms state-of-the-art approaches in terms of AP50on the MS COCO object detection dataset. The CSPNet is easy to implement and general enough to cope with architectures based on ResNet, ResNeXt, and DenseNet."} | ||
| 60 | −{"work_id": 4226069476, "title": "Masked-attention Mask Transformer for Universal Image Segmentation", "abstract": "Image segmentation groups pixels with different semantics, e.g., category or instance membership. Each choice of semantics defines a task. While only the semantics of each task differ, current research focuses on designing spe-cialized architectures for each task. We present Masked- attention Mask Transformer (Mask2Former), a new archi-tecture capable of addressing any image segmentation task (panoptic, instance or semantic). Its key components in-clude masked attention, which extracts localized features by constraining cross-attention within predicted mask regions. In addition to reducing the research effort by at least three times, it outperforms the best specialized architectures by a significant margin on four popular datasets. Most no-tably, Mask2Former sets a new state-of-the-art for panoptic segmentation (57.8 PQ on COCO), instance segmentation (50.1 AP on COCO) and semantic segmentation (57.7 mIoU onADE20K)."} | 35 | +{"work_id": 4387195417, "title": "Diffusion Models: A Comprehensive Survey of Methods and Applications", "abstract": "Diffusion models have emerged as a powerful new family of deep generative models with record-breaking performance in many applications, including image synthesis, video generation, and molecule design. In this survey, we provide an overview of the rapidly expanding body of work on diffusion models, categorizing the research into three key areas: efficient sampling, improved likelihood estimation, and handling data with special structures. We also discuss the potential for combining diffusion models with other generative models for enhanced results. We further review the wide-ranging applications of diffusion models in fields spanning from computer vision, natural language processing, temporal data modeling, to interdisciplinary applications in other scientific disciplines. This survey aims to provide a contextualized, in-depth look at the state of diffusion models, identifying the key areas of focus and pointing to potential areas for further exploration. Github: https://github.com/YangLing0818/Diffusion-Models-Papers-Survey-Taxonomy"} | ||
| 61 | −{"work_id": 4224035735, "title": "Hierarchical Text-Conditional Image Generation with CLIP Latents", "abstract": "Contrastive models like CLIP have been shown to learn robust representations of images that capture both semantics and style. To leverage these representations for image generation, we propose a two-stage model: a prior that generates a CLIP image embedding given a text caption, and a decoder that generates an image conditioned on the image embedding. We show that explicitly generating image representations improves image diversity with minimal loss in photorealism and caption similarity. Our decoders conditioned on image representations can also produce variations of an image that preserve both its semantics and style, while varying the non-essential details absent from the image representation. Moreover, the joint embedding space of CLIP enables language-guided image manipulations in a zero-shot fashion. We use diffusion models for the decoder and experiment with both autoregressive and diffusion models for the prior, finding that the latter are computationally more efficient and produce higher-quality samples."} | 36 | +{"work_id": 7151814497, "title": "Designing tools for 3D content authoring based on 3D sketching", "abstract": "Conception d'outils de cr\u00e9ation de contenu 3D bas\u00e9s sur le dessin 3D L'accessibilit\u00e9 croissante du rendu 3D en temps r\u00e9el a fait de la cr\u00e9ation de contenu 3D un moyen majeur d'expression et de communication. Mais la cr\u00e9ation de contenu 3D n\u00e9cessite d'interagir avec des repr\u00e9sentations num\u00e9riques de la forme et de l'apparence qui sont compatibles avec les algorithmes de rendu et d'animation. Les maillages triangulaires, les mod\u00e8les de mat\u00e9riaux param\u00e9triques et les courbes d'animation sont bien adapt\u00e9s aux op\u00e9rations de rendu mais obligent les artistes \u00e0 exprimer leurs id\u00e9es en terme de commandes bas niveau qui doivent \u00eatre apprises et m\u00e9moris\u00e9es.Dans cette th\u00e8se, nous explorons l'utilisation de coups de crayon 3D ou courbes 3D comme moyen pour les artistes d'exprimer leurs id\u00e9es. Inspir\u00e9s par la fa\u00e7on dont les artistes travaillent avec un pinceau et une toile, nous consid\u00e9rons ce geste de coup de crayon de l'artiste comme la principale commande d'entr\u00e9e du syst\u00e8me de cr\u00e9ation. Les courbes 3D sont des primitives flexibles qui peuvent \u00eatre cr\u00e9\u00e9es dans des interfaces utilisateur 2D ou dans des interfaces de r\u00e9alit\u00e9 virtuelle (RV), et elles peuvent encoder une forme 3D ou l'apparence finale d'une peinture 3D. La conception d'outils qui consid\u00e8rent les courbes 3D comme une repr\u00e9sentation de la forme ou de l'apparence ouvre un espace vaste et passionnant \u00e0 explorer.Les designers peuvent utiliser les courbes 3D comme une repr\u00e9sentation partielle de la forme 3D. Nous \u00e9tudions comment convertir un croquis 3D clairsem\u00e9 en un mod\u00e8le de surface 3D.\u00c9tant donn\u00e9 que les courbes caract\u00e9ristiques de l'objet sont un \u00e9l\u00e9ment important de la forme design\u00e9e et qu'elles sont repr\u00e9sent\u00e9es avec soin dans l'esquisse, nous reconstruisons une surface lisse par morceaux qui pr\u00e9serve ces courbes caract\u00e9ristiques. En obtenant une surface \u00e0 partir des courbes 3D, notre algorithme permet le rendu 3D de la forme d\u00e9crite par l'esquisse.Pour mieux comprendre comment les courbes 3D peuvent repr\u00e9senter non seulement la forme mais aussi l'apparence des objets, nous \u00e9tudions la pratique de la peinture en RV au sein d'une communaut\u00e9 d'artistes qui travaillent avec un logiciel commercial de peinture en RV. Sur la base de cette \u00e9tude, nous proposons une conception et une impl\u00e9mentation pour les \"calques 3D\", une nouvelle primitive d'interaction pour la peinture RV qui consid\u00e8re les courbes 3D comme repr\u00e9sentation \u00e0 la fois de la forme et de l'apparence 3D, tout en d\u00e9couplant l'\u00e9dition de ces deux \u00e9l\u00e9ments. Inspir\u00e9s par l'utilisation de la composition de calques en peinture num\u00e9rique 2D, nous proposons un processus non destructif pour modifier l'apparence d'une peinture RV.L'animation dessin\u00e9e \u00e0 la main est un moyen expressif de cr\u00e9er une animation avec des coups de crayons. Dans les animations de type \"video doodles\", les artistes cr\u00e9ent un dessin anim\u00e9 qui semble bouger dans le m\u00eame espace 3D qu'une vid\u00e9o film\u00e9e. Prendre en compte les effets de perspective et les occlusions tout en dessinant des courbes 2D n'est pas une t\u00e2che facile, c'est pourquoi nous utilisons des techniques de vision par ordinateur pour placer les courbes dans l'espace 3D et les rendre en respectant le contexte de la vid\u00e9o. Nous concevons une interface utilisateur en 2D qui ressemble aux outils traditionnels d'animation en 2D, afin de permettre aux utilisateurs qui ne sont pas familiers avec les outils 3D de cr\u00e9er de telles animations.Globalement, nous montrons que les courbes 3D sont une repr\u00e9sentation puissante pour la cr\u00e9ation de contenu 3D en proposant trois syst\u00e8mes qui exploitent les courbes 3D ou les dessins 3D en tant que primitives d'interaction pour des applications cr\u00e9atives allant de la cr\u00e9ation de forme \u00e0 celle d'apparence et d'animation. Nous abordons la conception de ces syst\u00e8mes sous deux angles compl\u00e9mentaires ; nous d\u00e9veloppons de nouveaux algorithmes pour interpr\u00e9ter les dessins et les commandes de bas niveau de l'utilisateur, et nous concevons des interactions qui permettent aux utilisateurs d'exprimer leurs intentions haut niveau."} | ||
| 62 | −{"work_id": 4402660132, "title": "Spacetime Gaussian Feature Splatting for Real-Time Dynamic View Synthesis", "abstract": "Novel view synthesis of dynamic scenes has been an intriguing yet challenging problem. Despite recent advancements, simultaneously achieving high-resolution photorealistic results, real-time rendering, and compact storage remains a formidable task. To address these challenges, we propose Spacetime Gaussian Feature Splatting as a novel dynamic scene representation, composed of three pivotal components. First, we formulate expressive Spacetime Gaussians by enhancing 3D Gaussians with temporal opacity and parametric motion/rotation. This enables Space-time Gaussians to capture static, dynamic, as well as transient content within a scene. Second, we introduce splatted feature rendering, which replaces spherical harmonics with neural features. These features facilitate the modeling of view- and time-dependent appearance while maintaining small size. Third, we leverage the guidance of training error and coarse depth to sample new Gaussians in areas that are challenging to converge with existing pipelines. Experiments on several established real-world datasets demonstrate that our method achieves state-of-the-art rendering quality and speed, while retaining compact storage. At 8K resolution, our lite-version model can render at 60 FPS on an Nvidia RTX 4090 GPU."} | 37 | +{"work_id": 3170841864, "title": "Rethinking Semantic Segmentation from a Sequence-to-Sequence Perspective with Transformers", "abstract": "Most recent semantic segmentation methods adopt a fully-convolutional network (FCN) with an encoder-decoder architecture. The encoder progressively reduces the spatial resolution and learns more abstract/semantic visual concepts with larger receptive fields. Since context modeling is critical for segmentation, the latest efforts have been focused on increasing the receptive field, through either dilated/atrous convolutions or inserting attention modules. However, the encoder-decoder based FCN architecture remains unchanged. In this paper, we aim to provide an alternative perspective by treating semantic segmentation as a sequence-to-sequence prediction task. Specifically, we deploy a pure transformer (i.e., without convolution and resolution reduction) to encode an image as a sequence of patches. With the global context modeled in every layer of the transformer, this encoder can be combined with a simple decoder to provide a powerful segmentation model, termed SEgmentation TRansformer (SETR). Extensive experiments show that SETR achieves new state of the art on ADE20K (50.28% mIoU), Pascal Context (55.83% mIoU) and competitive results on Cityscapes. Particularly, we achieve the first position in the highly competitive ADE20K test server leaderboard on the day of submission."} | ||
| 63 | −{"work_id": 2963188159, "title": "PoseCNN: A Convolutional Neural Network for 6D Object Pose Estimation in Cluttered Scenes", "abstract": "Estimating the 6D pose of known objects is important for robots to interact with the real world.The problem is challenging due to the variety of objects as well as the complexity of a scene caused by clutter and occlusions between objects.In this work, we introduce PoseCNN, a new Convolutional Neural Network for 6D object pose estimation.PoseCNN estimates the 3D translation of an object by localizing its center in the image and predicting its distance from the camera.The 3D rotation of the object is estimated by regressing to a quaternion representation.We also introduce a novel loss function that enables PoseCNN to handle symmetric objects.In addition, we contribute a large scale video dataset for 6D object pose estimation named the YCB-Video dataset.Our dataset provides accurate 6D poses of 21 objects from the YCB dataset observed in 92 videos with 133,827 frames.We conduct extensive experiments on our YCB-Video dataset and the OccludedLINEMOD dataset to show that PoseCNN is highly robust to occlusions, can handle symmetric objects, and provide accurate pose estimation using only color images as input.When using depth data to further refine the poses, our approach achieves state-of-the-art results on the challenging OccludedLINEMOD dataset."} | 38 | +{"work_id": 3209984917, "title": "WavLM: Large-Scale Self-Supervised Pre-Training for Full Stack Speech Processing", "abstract": "Self-supervised learning (SSL) achieves great success in speech recognition, while limited exploration has been attempted for other speech processing tasks. As speech signal contains multi-faceted information including speaker identity, paralinguistics, spoken content, etc., learning universal representations for all speech tasks is challenging. To tackle the problem, we propose a new pre-trained model, WavLM, to solve full-stack downstream speech tasks. WavLM jointly learns masked speech prediction and denoising in pre-training. By this means, WavLM does not only keep the speech content modeling capability by the masked speech prediction, but also improves the potential to non-ASR tasks by the speech denoising. In addition, WavLM employs gated relative position bias for the Transformer structure to better capture the sequence ordering of input speech. We also scale up the training dataset from 60 k hours to 94 k hours. WavLM Large achieves state-of-the-art performance on the SUPERB benchmark, and brings significant improvements for various speech processing tasks on their representative benchmarks."} | ||
| 64 | −{"work_id": 4385289063, "title": "MERF: Memory-Efficient Radiance Fields for Real-time View Synthesis in Unbounded Scenes", "abstract": "Neural radiance fields enable state-of-the-art photorealistic view synthesis. However, existing radiance field representations are either too compute-intensive for real-time rendering or require too much memory to scale to large scenes. We present a Memory-Efficient Radiance Field (MERF) representation that achieves real-time rendering of large-scale scenes in a browser. MERF reduces the memory consumption of prior sparse volumetric radiance fields using a combination of a sparse feature grid and high-resolution 2D feature planes. To support large-scale unbounded scenes, we introduce a novel contraction function that maps scene coordinates into a bounded volume while still allowing for efficient ray-box intersection. We design a lossless procedure for baking the parameterization used during training into a model that achieves real-time rendering while still preserving the photorealistic view synthesis quality of a volumetric radiance field."} | 39 | +{"work_id": 4402670856, "title": "M3-Embedding: Multi-Linguality, Multi-Functionality, Multi-Granularity Text Embeddings Through Self-Knowledge Distillation", "abstract": "In this paper, we introduce a new embedding model called M3-Embedding, which is distinguished for its versatility in Multi-Linguality, Multi-Functionality, and Multi-Granularity.It provides a uniform support for the semantic retrieval of more than 100 working languages.It can simultaneously accomplish the three common retrieval functionalities: dense retrieval, multi-vector retrieval, and sparse retrieval.Besides, it is also capable of processing inputs of different granularities, spanning from short sentences to long documents of up to 8,192 tokens.The effective training of M3-Embedding presents a series of technical contributions.Notably, we propose a novel self-knowledge distillation approach, where the relevance scores from different retrieval functionalities can be integrated as the teacher signal to enhance the training quality.We also optimize the batching strategy, which enables a large batch size and high training throughput to improve the discriminativeness of embeddings.M3-Embedding exhibits a superior performance in our experiment, leading to new state-of-the-art results on multilingual, cross-lingual, and longdocument retrieval benchmarks. 1"} | ||
| 65 | −{"work_id": 3003533476, "title": "Deep Reinforcement Learning for Autonomous Driving: A Survey", "abstract": "With the development of deep representation learning, the domain of reinforcement learning (RL) has become a powerful learning framework now capable of learning complex policies in high dimensional environments. This review summarises deep reinforcement learning (DRL) algorithms and provides a taxonomy of automated driving tasks where (D)RL methods have been employed, while addressing key computational challenges in real world deployment of autonomous driving agents. It also delineates adjacent domains such as behavior cloning, imitation learning, inverse reinforcement learning that are related but are not classical RL algorithms. The role of simulators in training agents, methods to validate, test and robustify existing solutions in RL are discussed."} | 40 | +{"work_id": 4402754006, "title": "DETRs Beat YOLOs on Real-time Object Detection", "abstract": "The YOLO series has become the most popular frame-work for real-time object detection due to its reasonable trade-off between speed and accuracy. However, we observe that the speed and accuracy of YOLOs are negatively affected by the NMS. Recently, end-to-end Transformer-based detectors (DETRs) have provided an alternative to eliminating NMS. Nevertheless, the high computational cost limits their practicality and hinders them from fully exploiting the advantage of excluding NMS. In this paper, we propose the Real-Time DEtection TRansformer (RT-DETR), the first real-time end-to-end object detector to our best knowledge that addresses the above dilemma. We build RT-DETR in two steps, drawing on the advanced DETR: first we focus on maintaining accuracy while improving speed, followed by maintaining speed while improving accuracy. Specifically, we design an efficient hybrid encoder to expeditiously process multi-scale features by decoupling intra-scale interaction and cross-scale fusion to improve speed. Then, we propose the uncertainty-minimal query selection to provide high-quality initial queries to the decoder, thereby improving accuracy. In addition, RT-DETR supports flexible speed tuning by adjusting the number of decoder layers to adapt to various scenarios without retraining. Our RT-DETR-R50 /R101 achieves 53.1% 154.3% AP on COCO and 108 /74 FPS on T4 GPU, outperforming previously advanced YOLOs in both speed and accuracy. Furthermore, RT-DETR-R50 outperforms DINO-R50 by 2.2% AP in accuracy and about 21 times in FPS. After pre-training with Objects365, RT-DETR-R50 / R101 achieves 55.3% 156.2% AP. The project page: https://zhao-yian.github.io/RTDEtr."} | ||
| 66 | −{"work_id": 2796347433, "title": "YOLOv3: An Incremental Improvement", "abstract": "We present some updates to YOLO! We made a bunch of little design changes to make it better. We also trained this new network that's pretty swell. It's a little bigger than last time but more accurate. It's still fast though, don't worry. At 320x320 YOLOv3 runs in 22 ms at 28.2 mAP, as accurate as SSD but three times faster. When we look at the old .5 IOU mAP detection metric YOLOv3 is quite good. It achieves 57.9 mAP@50 in 51 ms on a Titan X, compared to 57.5 mAP@50 in 198 ms by RetinaNet, similar performance but 3.8x faster. As always, all the code is online at https://pjreddie.com/yolo/"} | 41 | +{"work_id": 3119997354, "title": "Transformers in Vision: A Survey", "abstract": "Astounding results from Transformer models on natural language tasks have intrigued the vision community to study their application to computer vision problems. Among their salient benefits, Transformers enable modeling long dependencies between input sequence elements and support parallel processing of sequence as compared to recurrent networks, e.g., Long short-term memory. Different from convolutional networks, Transformers require minimal inductive biases for their design and are naturally suited as set-functions. Furthermore, the straightforward design of Transformers allows processing multiple modalities (e.g., images, videos, text, and speech) using similar processing blocks and demonstrates excellent scalability to very large capacity networks and huge datasets. These strengths have led to exciting progress on a number of vision tasks using Transformer networks. This survey aims to provide a comprehensive overview of the Transformer models in the computer vision discipline. We start with an introduction to fundamental concepts behind the success of Transformers, i.e., self-attention, large-scale pre-training, and bidirectional feature encoding. We then cover extensive applications of transformers in vision including popular recognition tasks (e.g., image classification, object detection, action recognition, and segmentation), generative modeling, multi-modal tasks (e.g., visual-question answering, visual reasoning, and visual grounding), video processing (e.g., activity recognition, video forecasting), low-level vision (e.g., image super-resolution, image enhancement, and colorization), and three-dimensional analysis (e.g., point cloud classification and segmentation). We compare the respective advantages and limitations of popular techniques both in terms of architectural design and their experimental value. Finally, we provide an analysis on open research directions and possible future works. We hope this effort will ignite further interest in the community to solve current challenges toward the application of transformer models in computer vision."} | ||
| 67 | −{"work_id": 2775304348, "title": "State-of-the-Art Speech Recognition with Sequence-to-Sequence Models", "abstract": "Attention-based encoder-decoder architectures such as Listen, Attend, and Spell (LAS), subsume the acoustic, pronunciation and language model components of a traditional automatic speech recognition (ASR) system into a single neural network. In previous work, we have shown that such architectures are comparable to state-of-the-art ASR systems on dictation tasks, but it was not clear if such architectures would be practical for more challenging tasks such as voice search. In this work, we explore a variety of structural and optimization improvements to our LAS model which significantly improve performance. On the structural side, we show that word piece models can be used instead of graphemes. We also introduce a multi-head attention architecture, which offers improvements over the commonly-used single-head attention. On the optimization side, we explore synchronous training, scheduled sampling, label smoothing, and minimum word error rate optimization, which are all shown to improve accuracy. We present results with a unidirectional LSTM encoder for streaming recognition. On a 12, 500 hour voice search task, we find that the proposed changes improve the WER from 9.2% to 5.6%, while the best conventional system achieves 6.7%; on a dictation task our model achieves a WER of 4.1% compared to 5% for the conventional system."} | 42 | +{"work_id": 4402128637, "title": "The promise and challenges of generative AI in education", "abstract": "Generative artificial intelligence (GenAI) tools, such as large language models (LLMs), generate natural language and other types of content to perform a wide range of tasks. This represents a significant technological advancement that poses opportunities and challenges to educational research and practice. This commentary brings together contributions from nine experts working in the intersection of learning and technology and presents critical reflections on the opportunities, challenges, and implications related to GenAI technologies in the context of education. In the commentary, it is acknowledged that GenAI\u2019s capabilities can enhance some teaching and learning practices, such as learning design, regulation of learning, automated content, feedback, and assessment. Nevertheless, we also highlight its limitations, potential disruptions, ethical consequences, and potential misuses. The identified avenues for further research include the development of new insights into the roles human experts can play, strong and continuous evidence, human-centric design of technology, necessary policy, and support and competence mechanisms. Overall, we concur with the general skeptical optimism about the use of GenAI tools such as LLMs in education. Moreover, we highlight the danger of hastily adopting GenAI tools in education without deep consideration of the efficacy, ecosystem-level implications, ethics, and pedagogical soundness of such practices."} | ||
| 68 | −{"work_id": 3097777922, "title": "Conformer: Convolution-augmented Transformer for Speech Recognition", "abstract": "Recently Transformer and Convolution neural network (CNN) based models have shown promising results in Automatic Speech Recognition (ASR), outperforming Recurrent neural networks (RNNs). Transformer models are good at capturing content-based global interactions, while CNNs exploit local features effectively. In this work, we achieve the best of both worlds by studying how to combine convolution neural networks and transformers to model both local and global dependencies of an audio sequence in a parameter-efficient way. To this regard, we propose the convolution-augmented transformer for speech recognition, named Conformer. Conformer significantly outperforms the previous Transformer and CNN based models achieving state-of-the-art accuracies. On the widely used LibriSpeech benchmark, our model achieves WER of 2.1%/4.3% without using a language model and 1.9%/3.9% with an external language model on test/testother. We also observe competitive performance of 2.7%/6.3% with a small model of only 10M parameters."} | 43 | +{"work_id": 4392233542, "title": "A Review of Machine Learning Approaches for the Personalization of Amplification in Hearing Aids", "abstract": "This paper provides a review of various machine learning approaches that have appeared in the literature aimed at individualizing or personalizing the amplification settings of hearing aids. After stating the limitations associated with the current one-size-fits-all settings of hearing aid prescriptions, a spectrum of studies in engineering and hearing science are discussed. These studies involve making adjustments to prescriptive values in order to enable preferred and individualized settings for a hearing aid user in an audio environment of interest to that user. This review gathers, in one place, a comprehensive collection of works that have been conducted thus far with respect to achieving the personalization or individualization of the amplification function of hearing aids. Furthermore, it underscores the impact that machine learning can have on enabling an improved and personalized hearing experience for hearing aid users. This paper concludes by stating the challenges and future research directions in this area."} | ||
| 69 | −{"work_id": 7140452175, "title": "Humanoid Locomotion and Manipulation: Current Progress and Challenges in Control, Planning, and Learning", "abstract": "Humanoid robots hold great potential to perform various human-level skills, involving unified locomotion and manipulation in real-world settings. Driven by advances in machine learning and the strength of existing model-based approaches, these capabilities have progressed rapidly, but often separately. This survey offers a comprehensive overview of the state-of-the-art in humanoid locomotion and manipulation, with a focus on control, planning, and learning methods. We first review the model-based methods that have been the backbone of humanoid robotics for the past three decades. We discuss contact planning, motion planning, and whole-body control, highlighting the tradeoffs between model fidelity and computational efficiency. Then, the focus is shifted to examine emerging learning-based methods, with an emphasis on reinforcement and imitation learning that enhance the robustness and versatility of loco-manipulation skills. Furthermore, we assess the potential of integrating foundation models with humanoid embodiments to enable the development of generalist humanoid agents. This survey also highlights the emerging role of tactile sensing, particularly whole-body tactile feedback, as a crucial modality for handling contact-rich interactions. Finally, we compare the strengths and limitations of model-based and learning-based paradigms from multiple perspectives, such as robustness, computational efficiency, versatility, and generalizability, and suggest potential solutions to existing challenges."} | 44 | +{"work_id": 2998508940, "title": "Random Erasing Data Augmentation", "abstract": "In this paper, we introduce Random Erasing, a new data augmentation method for training the convolutional neural network (CNN). In training, Random Erasing randomly selects a rectangle region in an image and erases its pixels with random values. In this process, training images with various levels of occlusion are generated, which reduces the risk of over-fitting and makes the model robust to occlusion. Random Erasing is parameter learning free, easy to implement, and can be integrated with most of the CNN-based recognition models. Albeit simple, Random Erasing is complementary to commonly used data augmentation techniques such as random cropping and flipping, and yields consistent improvement over strong baselines in image classification, object detection and person re-identification. Code is available at: https://github.com/zhunzhong07/Random-Erasing."} | ||
| 70 | −{"work_id": 4405586205, "title": "Generative AI in higher education: A global perspective of institutional adoption policies and guidelines", "abstract": "Integrating generative AI (GAI) into higher education is crucial for preparing a future generation of GAI-literate students. However, a comprehensive understanding of global institutional adoption policies remains absent, with most prior studies focusing on the Global North and lacking a theoretical lens. This study utilizes the Diffusion of Innovations Theory to examine GAI adoption strategies in higher education across 40 universities from six global regions. It explores the characteristics of GAI innovation, including compatibility, trialability, and observability, and analyses the communication channels and roles and responsibilities outlined in university policies and guidelines. The findings reveal that universities are proactively addressing GAI integration by emphasising academic integrity, enhancing teaching and learning practices, and promoting equity. Key policy measures include the development of guidelines for ethical GAI use, the design of authentic assessments to mitigate misuse, and the provision of training programs for faculty and students to foster GAI literacy. Despite these efforts, gaps remain in comprehensive policy frameworks, particularly in addressing data privacy concerns and ensuring equitable access to GAI tools. The study underscores the importance of clear communication channels, stakeholder collaboration, and ongoing evaluation to support effective GAI adoption. These insights provide actionable insights for policymakers to craft inclusive, transparent, and adaptive strategies for integrating GAI into higher education."} | 45 | +{"work_id": 2982770724, "title": "FCOS: Fully Convolutional One-Stage Object Detection", "abstract": "We propose a fully convolutional one-stage object detector (FCOS) to solve object detection in a per-pixel prediction fashion, analogue to semantic segmentation. Almost all state-of-the-art object detectors such as RetinaNet, SSD, YOLOv3, and Faster R-CNN rely on pre-defined anchor boxes. In contrast, our proposed detector FCOS is anchor box free, as well as proposal free. By eliminating the pre-defined set of anchor boxes, FCOS completely avoids the complicated computation related to anchor boxes such as calculating overlapping during training. More importantly, we also avoid all hyper-parameters related to anchor boxes, which are often very sensitive to the final detection performance. With the only post-processing non-maximum suppression (NMS), FCOS with ResNeXt-64x4d-101 achieves 44.7% in AP with single-model and single-scale testing, surpassing previous one-stage detectors with the advantage of being much simpler. For the first time, we demonstrate a much simpler and flexible detection framework achieving improved detection accuracy. We hope that the proposed FCOS framework can serve as a simple and strong alternative for many other instance-level tasks. Code is available at: https://tinyurl.com/FCOSv1."} | ||
| 71 | −{"work_id": 2964243274, "title": "Natural TTS Synthesis by Conditioning Wavenet on MEL Spectrogram Predictions", "abstract": "This paper describes Tacotron 2, a neural network architecture for speech synthesis directly from text. The system is composed of a recurrent sequence-to-sequence feature prediction network that maps character embeddings to mel-scale spectrograms, followed by a modified WaveNet model acting as a vocoder to synthesize time-domain waveforms from those spectrograms. Our model achieves a mean opinion score (MOS) of 4.53 comparable to a MOS of 4.58 for professionally recorded speech. To validate our design choices, we present ablation studies of key components of our system and evaluate the impact of using mel spectrograms as the conditioning input to WaveNet instead of linguistic, duration, and F0 features. We further show that using this compact acoustic intermediate representation allows for a significant reduction in the size of the WaveNet architecture."} | 46 | +{"work_id": 2952218014, "title": "Conv-TasNet: Surpassing Ideal Time\u2013Frequency Magnitude Masking for Speech Separation", "abstract": "Single-channel, speaker-independent speech separation methods have recently seen great progress. However, the accuracy, latency, and computational cost of such methods remain insufficient. The majority of the previous methods have formulated the separation problem through the time-frequency representation of the mixed signal, which has several drawbacks, including the decoupling of the phase and magnitude of the signal, the suboptimality of time-frequency representation for speech separation, and the long latency of the entire system. To address these shortcomings, we propose a fully-convolutional time-domain audio separation network (Conv-TasNet), a deep learning framework for end-to-end time-domain speech separation. Conv-TasNet uses a linear encoder to generate a representation of the speech waveform optimized for separating individual speakers. Speaker separation is achieved by applying a set of weighting functions (masks) to the encoder output. The modified encoder representations are then inverted back to the waveforms using a linear decoder. The masks are found using a temporal convolutional network (TCN) consisting of stacked 1-D dilated convolutional blocks, which allows the network to model the long-term dependencies of the speech signal while maintaining a small model size. The proposed Conv-TasNet system significantly outperforms previous time-frequency masking methods in separating two- and three-speaker mixtures. Additionally, Conv-TasNet surpasses several ideal time-frequency magnitude masks in two-speaker speech separation as evaluated by both objective distortion measures and subjective quality assessment by human listeners. Finally, Conv-TasNet has a significantly smaller model size and a much shorter minimum latency, making it a suitable solution for both offline and real-time speech separation applications. This study therefore represents a major step toward the realization of speech separation systems for real-world speech processing technologies."} | ||
| 72 | −{"work_id": 3131500599, "title": "Pyramid Vision Transformer: A Versatile Backbone for Dense Prediction without Convolutions", "abstract": "Although convolutional neural networks (CNNs) have achieved great success in computer vision, this work investigates a simpler, convolution-free backbone network use-fid for many dense prediction tasks. Unlike the recently-proposed Vision Transformer (ViT) that was designed for image classification specifically, we introduce the Pyramid Vision Transformer (PVT), which overcomes the difficulties of porting Transformer to various dense prediction tasks. PVT has several merits compared to current state of the arts. (1) Different from ViT that typically yields low-resolution outputs and incurs high computational and memory costs, PVT not only can be trained on dense partitions of an image to achieve high output resolution, which is important for dense prediction, but also uses a progressive shrinking pyramid to reduce the computations of large feature maps. (2) PVT inherits the advantages of both CNN and Transformer, making it a unified backbone for various vision tasks without convolutions, where it can be used as a direct replacement for CNN backbones. (3) We validate PVT through extensive experiments, showing that it boosts the performance of many downstream tasks, including object detection, instance and semantic segmentation. For example, with a comparable number of parameters, PVT+RetinaNet achieves 40.4 AP on the COCO dataset, surpassing ResNet50+RetinNet (36.3 AP) by 4.1 absolute AP (see Figure 2). We hope that PVT could, serre as an alternative and useful backbone for pixel-level predictions and facilitate future research."} | 47 | +{"work_id": 2784874046, "title": "ArcFace: Additive Angular Margin Loss for Deep Face Recognition", "abstract": "Recently, a popular line of research in face recognition is adopting margins in the well-established softmax loss function to maximize class separability. In this paper, we first introduce an Additive Angular Margin Loss (ArcFace), which not only has a clear geometric interpretation but also significantly enhances the discriminative power. Since ArcFace is susceptible to the massive label noise, we further propose sub-center ArcFace, in which each class contains K sub-centers and training samples only need to be close to any of the K positive sub-centers. Sub-center ArcFace encourages one dominant sub-class that contains the majority of clean faces and non-dominant sub-classes that include hard or noisy faces. Based on this self-propelled isolation, we boost the performance through automatically purifying raw web faces under massive real-world noise. Besides discriminative feature embedding, we also explore the inverse problem, mapping feature vectors to face images. Without training any additional generator or discriminator, the pre-trained ArcFace model can generate identity-preserved face images for both subjects inside and outside the training data only by using the network gradient and Batch Normalization (BN) priors. Extensive experiments demonstrate that ArcFace can enhance the discriminative feature embedding as well as strengthen the generative face synthesis."} | ||
| 73 | −{"work_id": 2335728318, "title": "Reading digits in natural images with unsupervised feature learning", "abstract": "Detecting and reading text from natural images is a hard computer vision task that is central to a variety of emerging applications. Related problems like document character recognition have been widely studied by computer vision and machine learning researchers and are virtually solved for practical applications like reading handwritten digits. Reliably recognizing characters in more complex scenes like photographs, however, is far more difficult: the best existing methods lag well behind human performance on the same tasks. In this paper we attack the problem of recognizing digits in a real application using unsupervised feature learning methods: reading house numbers from street level photos. To this end, we introduce a new benchmark dataset for research use containing over 600,000 labeled digits cropped from Street View images. We then demonstrate the difficulty of recognizing these digits when the problem is approached with hand-designed features. Finally, we employ variants of two recently proposed unsupervised feature learning methods and find that they are convincingly superior on our benchmarks. 1"} | 48 | +{"work_id": 2983040767, "title": "Unsupervised Cross-lingual Representation Learning at Scale", "abstract": "Alexis Conneau, Kartikay Khandelwal, Naman Goyal, Vishrav Chaudhary, Guillaume Wenzek, Francisco Guzm\u00e1n, Edouard Grave, Myle Ott, Luke Zettlemoyer, Veselin Stoyanov. Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics. 2020."} | ||
| 74 | −{"work_id": 4388761637, "title": "Towards autonomous multi-modal mobility morphobot (M4) robot: traversability estimation and 3D path planning", "abstract": "This thesis enhances the autonomy of the M4 (Multi-Modal Mobility Morphobot) robot,designed for Mars and rescue missions. The research enables the robot to autonomously select its locomotion mode and path in complex terrains. Focusing on walking and flying modes, a Gazebo simulation and custom perception-navigations pipelines are developed. Leveraging deep learning, the robot determines optimal mode transitions based on a 2.5D map. Additionally, an energyefficient path planner based on 2.5D mapping is implemented and validated in simulations. The contributions demonstrate scalability for future mode integrations. The M4 robot showcases intelligent mode switching, efficient navigation, and reduced energy consumption, bringing us closer to fully autonomous multi-modal robots for exploration and rescue missions. This work paves the way for future advancements in autonomous robotics, with the ultimate vision of deploying the M4 robot for exploration and rescue tasks, making a significant impact in the quest for intelligent and versatile robotic systems.--Author's abstract"} | 49 | +{"work_id": 4404534210, "title": "A Survey on Hallucination in Large Language Models: Principles, Taxonomy, Challenges, and Open Questions", "abstract": "The emergence of large language models (LLMs) has marked a significant breakthrough in natural language processing (NLP), fueling a paradigm shift in information acquisition. Nevertheless, LLMs are prone to hallucination, generating plausible yet nonfactual content. This phenomenon raises significant concerns over the reliability of LLMs in real-world information retrieval (IR) systems and has attracted intensive research to detect and mitigate such hallucinations. Given the open-ended general-purpose attributes inherent to LLMs, LLM hallucinations present distinct challenges that diverge from prior task-specific models. This divergence highlights the urgency for a nuanced understanding and comprehensive overview of recent advances in LLM hallucinations. In this survey, we begin with an innovative taxonomy of hallucination in the era of LLM and then delve into the factors contributing to hallucinations. Subsequently, we present a thorough overview of hallucination detection methods and benchmarks. Our discussion then transfers to representative methodologies for mitigating LLM hallucinations. Additionally, we delve into the current limitations faced by retrieval-augmented LLMs in combating hallucinations, offering insights for developing more robust IR systems. Finally, we highlight the promising research directions on LLM hallucinations, including hallucination in large vision-language models and understanding of knowledge boundaries in LLM hallucinations."} | ||
| 50 | +{"work_id": 4360884927, "title": "Diffusion Models in Vision: A Survey", "abstract": "Denoising diffusion models represent a recent emerging topic in computer vision, demonstrating remarkable results in the area of generative modeling. A diffusion model is a deep generative model that is based on two stages, a forward diffusion stage and a reverse diffusion stage. In the forward diffusion stage, the input data is gradually perturbed over several steps by adding Gaussian noise. In the reverse stage, a model is tasked at recovering the original input data by learning to gradually reverse the diffusion process, step by step. Diffusion models are widely appreciated for the quality and diversity of the generated samples, despite their known computational burdens, i.e., low speeds due to the high number of steps involved during sampling. In this survey, we provide a comprehensive review of articles on denoising diffusion models applied in vision, comprising both theoretical and practical contributions in the field. First, we identify and present three generic diffusion modeling frameworks, which are based on denoising diffusion probabilistic models, noise conditioned score networks, and stochastic differential equations. We further discuss the relations between diffusion models and other deep generative models, including variational auto-encoders, generative adversarial networks, energy-based models, autoregressive models and normalizing flows. Then, we introduce a multi-perspective categorization of diffusion models applied in computer vision. Finally, we illustrate the current limitations of diffusion models and envision some interesting directions for future research."} | ||||
| 51 | +{"work_id": 3169320628, "title": "HuBERT: Self-Supervised Speech Representation Learning by Masked Prediction of Hidden Units", "abstract": "Self-supervised approaches for speech representation learning are challenged by three unique problems: (1) there are multiple sound units in each input utterance, (2) there is no lexicon of input sound units during the pre-training phase, and (3) sound units have variable lengths with no explicit segmentation. To deal with these three problems, we propose the Hidden-Unit BERT (HuBERT) approach for self-supervised speech representation learning, which utilizes an offline clustering step to provide aligned target labels for a BERT-like prediction loss. A key ingredient of our approach is applying the prediction loss over the masked regions only, which forces the model to learn a combined acoustic and language model over the continuous inputs. HuBERT relies primarily on the consistency of the unsupervised clustering step rather than the intrinsic quality of the assigned cluster labels. Starting with a simple k-means teacher of 100 clusters, and using two iterations of clustering, the HuBERT model either matches or improves upon the state-of-the-art wav2vec 2.0 performance on the Librispeech (960h) and Libri-light (60,000h) benchmarks with 10min, 1h, 10h, 100h, and 960h fine-tuning subsets. Using a 1B parameter model, HuBERT shows up to 19% and 13% relative WER reduction on the more challenging dev-other and test-other evaluation subsets."} | ||||
| 52 | +{"work_id": 2995327724, "title": "Analyzing and Improving the Image Quality of StyleGAN", "abstract": "The style-based GAN architecture (StyleGAN) yields state-of-the-art results in data-driven unconditional generative image modeling. We expose and analyze several of its characteristic artifacts, and propose changes in both model architecture and training methods to address them. In particular, we redesign the generator normalization, revisit progressive growing, and regularize the generator to encourage good conditioning in the mapping from latent codes to images. In addition to improving image quality, this path length regularizer yields the additional benefit that the generator becomes significantly easier to invert. This makes it possible to reliably attribute a generated image to a particular network. We furthermore visualize how well the generator utilizes its output resolution, and identify a capacity problem, motivating us to train larger models for additional quality improvements. Overall, our improved model redefines the state of the art in unconditional image modeling, both in terms of existing distribution quality metrics as well as perceived image quality."} | ||||
| 53 | +{"work_id": 4385318467, "title": "3D Gaussian Splatting for Real-Time Radiance Field Rendering", "abstract": "Radiance Field methods have recently revolutionized novel-view synthesis of scenes captured with multiple photos or videos. However, achieving high visual quality still requires neural networks that are costly to train and render, while recent faster methods inevitably trade off speed for quality. For unbounded and complete scenes (rather than isolated objects) and 1080p resolution rendering, no current method can achieve real-time display rates. We introduce three key elements that allow us to achieve state-of-the-art visual quality while maintaining competitive training times and importantly allow high-quality real-time (\u2265 30 fps) novel-view synthesis at 1080p resolution. First, starting from sparse points produced during camera calibration, we represent the scene with 3D Gaussians that preserve desirable properties of continuous volumetric radiance fields for scene optimization while avoiding unnecessary computation in empty space; Second, we perform interleaved optimization/density control of the 3D Gaussians, notably optimizing anisotropic covariance to achieve an accurate representation of the scene; Third, we develop a fast visibility-aware rendering algorithm that supports anisotropic splatting and both accelerates training and allows realtime rendering. We demonstrate state-of-the-art visual quality and real-time rendering on several established datasets."} | ||||
| 54 | +{"work_id": 2972175553, "title": "The Generic Mapping Tools Version 6", "abstract": "Abstract The Generic Mapping Tools (GMT) software is ubiquitous in the Earth and ocean sciences. As a cross\u2010platform tool producing high\u2010quality maps and figures, it is used by tens of thousands of scientists around the world. The basic syntax of GMT scripts has evolved very slowly since the 1990s, despite the fact that GMT is generally perceived to have a steep learning curve with many pitfalls for beginners and experienced users alike. Reducing these pitfalls means changing the interface, which would break compatibility with thousands of existing scripts. With the latest GMT version 6, we solve this conundrum by introducing a new \u201cmodern mode\u201d to complement the interface used in previous versions, which GMT 6 now calls \u201cclassic mode.\u201d GMT 6 defaults to classic mode and thus is a recommended upgrade for all GMT 5 users. Nonetheless, new users should take advantage of modern mode to make shorter scripts, quickly access commonly used global data sets, and take full advantage of the new tools to draw subplots, place insets, and create animations."} | ||||
| 55 | +{"work_id": 4221142221, "title": "BERTopic: Neural topic modeling with a class-based TF-IDF procedure", "abstract": "Topic models can be useful tools to discover latent topics in collections of documents. Recent studies have shown the feasibility of approach topic modeling as a clustering task. We present BERTopic, a topic model that extends this process by extracting coherent topic representation through the development of a class-based variation of TF-IDF. More specifically, BERTopic generates document embedding with pre-trained transformer-based language models, clusters these embeddings, and finally, generates topic representations with the class-based TF-IDF procedure. BERTopic generates coherent topics and remains competitive across a variety of benchmarks involving classical models and those that follow the more recent clustering approach of topic modeling."} | ||||
| 56 | +{"work_id": 3127751679, "title": "TransUNet: Transformers Make Strong Encoders for Medical Image Segmentation", "abstract": "Medical image segmentation is an essential prerequisite for developing healthcare systems, especially for disease diagnosis and treatment planning. On various medical image segmentation tasks, the u-shaped architecture, also known as U-Net, has become the de-facto standard and achieved tremendous success. However, due to the intrinsic locality of convolution operations, U-Net generally demonstrates limitations in explicitly modeling long-range dependency. Transformers, designed for sequence-to-sequence prediction, have emerged as alternative architectures with innate global self-attention mechanisms, but can result in limited localization abilities due to insufficient low-level details. In this paper, we propose TransUNet, which merits both Transformers and U-Net, as a strong alternative for medical image segmentation. On one hand, the Transformer encodes tokenized image patches from a convolution neural network (CNN) feature map as the input sequence for extracting global contexts. On the other hand, the decoder upsamples the encoded features which are then combined with the high-resolution CNN feature maps to enable precise localization. We argue that Transformers can serve as strong encoders for medical image segmentation tasks, with the combination of U-Net to enhance finer details by recovering localized spatial information. TransUNet achieves superior performances to various competing methods on different medical applications including multi-organ segmentation and cardiac segmentation. Code and models are available at https://github.com/Beckschen/TransUNet."} | ||||
| 57 | +{"work_id": 3138516171, "title": "Swin Transformer: Hierarchical Vision Transformer using Shifted Windows", "abstract": "This paper presents a new vision Transformer, called Swin Transformer, that capably serves as a general-purpose backbone for computer vision. Challenges in adapting Transformer from language to vision arise from differences between the two domains, such as large variations in the scale of visual entities and the high resolution of pixels in images compared to words in text. To address these differences, we propose a hierarchical Transformer whose representation is computed with Shifted windows. The shifted windowing scheme brings greater efficiency by limiting self-attention computation to non-overlapping local windows while also allowing for cross-window connection. This hierarchical architecture has the flexibility to model at various scales and has linear computational complexity with respect to image size. These qualities of Swin Transformer make it compatible with a broad range of vision tasks, including image classification (87.3 top-1 accuracy on ImageNet-1K) and dense prediction tasks such as object detection (58.7 box AP and 51.1 mask AP on COCO test-dev) and semantic segmentation (53.5 mIoU on ADE20K val). Its performance surpasses the previous state-of-the-art by a large margin of +2.7 box AP and +2.6 mask AP on COCO, and +3.2 mIoU on ADE20K, demonstrating the potential of Transformer-based models as vision backbones. The hierarchical design and the shifted window approach also prove beneficial for all-MLP architectures. The code and models are publicly available at https://github.com/microsoft/Swin-Transformer."} | ||||
| 75 | {"work_id": 1530164934, "title": "A Probabilistic Model of Hierarchical Music Analysis", "abstract": "Schenkerian music theory supposes that Western tonal compositions can be viewed as hierarchies of musical objects. The process of Schenkerian analysis reveals this hierarchy by identifying connections between notes or chords of a composition that illustrate both the small- and large-scale construction of the music. We present a new probabilistic model of this variety of music analysis, details of how the parameters of the model can be learned from a corpus, an algorithm for deriving the most probable analysis for a given piece of music, and both quantitative and human-based evaluations of the algorithm's performance. In addition, we describe the creation of the corpus, the first publicly available data set to contain both musical excerpts and corresponding computer-readable Schenkerian analyses. Combining this corpus with the probabilistic model gives us the first completely data-driven computational approach to hierarchical music analysis."} | 58 | {"work_id": 1530164934, "title": "A Probabilistic Model of Hierarchical Music Analysis", "abstract": "Schenkerian music theory supposes that Western tonal compositions can be viewed as hierarchies of musical objects. The process of Schenkerian analysis reveals this hierarchy by identifying connections between notes or chords of a composition that illustrate both the small- and large-scale construction of the music. We present a new probabilistic model of this variety of music analysis, details of how the parameters of the model can be learned from a corpus, an algorithm for deriving the most probable analysis for a given piece of music, and both quantitative and human-based evaluations of the algorithm's performance. In addition, we describe the creation of the corpus, the first publicly available data set to contain both musical excerpts and corresponding computer-readable Schenkerian analyses. Combining this corpus with the probabilistic model gives us the first completely data-driven computational approach to hierarchical music analysis."} | ||
| 76 | {"work_id": 3098044990, "title": "Traduction Non Supervis\u00e9e de Langages de Programmation", "abstract": "A transcompiler, also known as source-to-source translator, is a system that converts source code from a high-level programming language (such as C++ or Python) to another. Transcompilers are primarily used for interoperability, and to port codebases written in an obsolete or deprecated language (e.g. COBOL, Python2) to a modern one. They typically rely on handcrafted rewrite rules, applied to the source code abstract syntax tree. Unfortunately, the resulting translations often lack readability, fail to respect the target language conventions, and require manual modifications in order to work properly. The overall translation process is time-consuming and requires expertise in both the source and target languages, making code-translation projects expensive. Although neural models significantly outperform their rule-based counterparts in the context of natural language translation, their applications to transcompilation have been limited due to the scarcity of parallel data in this domain. In this thesis, we propose methods to train effective and fully unsupervised neural transcompilers.Natural language translators are evaluated with metrics based on token co-occurences between the translation and the reference. We identify that they do not capture the semantics of programming languages. Hence, we build and release a test set composed of 852 parallel functions, along with unit tests to check the semantic correctness of translations. We first leverage objectives designed for natural languages to learn multilingual representations of source code, and train a model to translate, using source code from open source GitHub projects. This model outperforms rule-based methods for translating functions between C++, Java, and Python. Then, we develop an improved pre-training method, which leads the model to learn deeper semantic representations of source code. It results in enhanced performances on several tasks including unsupervised code translation. Finally, we use automated unit tests to automatically create examples of program translations. Training on these examples leads to significant improvements in the performance of our neural transcompilers. Our methods rely exclusively on monolingual source code, require no expertise in the source or target languages, and can easily be generalized to other programming languages."} | 59 | {"work_id": 3098044990, "title": "Traduction Non Supervis\u00e9e de Langages de Programmation", "abstract": "A transcompiler, also known as source-to-source translator, is a system that converts source code from a high-level programming language (such as C++ or Python) to another. Transcompilers are primarily used for interoperability, and to port codebases written in an obsolete or deprecated language (e.g. COBOL, Python2) to a modern one. They typically rely on handcrafted rewrite rules, applied to the source code abstract syntax tree. Unfortunately, the resulting translations often lack readability, fail to respect the target language conventions, and require manual modifications in order to work properly. The overall translation process is time-consuming and requires expertise in both the source and target languages, making code-translation projects expensive. Although neural models significantly outperform their rule-based counterparts in the context of natural language translation, their applications to transcompilation have been limited due to the scarcity of parallel data in this domain. In this thesis, we propose methods to train effective and fully unsupervised neural transcompilers.Natural language translators are evaluated with metrics based on token co-occurences between the translation and the reference. We identify that they do not capture the semantics of programming languages. Hence, we build and release a test set composed of 852 parallel functions, along with unit tests to check the semantic correctness of translations. We first leverage objectives designed for natural languages to learn multilingual representations of source code, and train a model to translate, using source code from open source GitHub projects. This model outperforms rule-based methods for translating functions between C++, Java, and Python. Then, we develop an improved pre-training method, which leads the model to learn deeper semantic representations of source code. It results in enhanced performances on several tasks including unsupervised code translation. Finally, we use automated unit tests to automatically create examples of program translations. Training on these examples leads to significant improvements in the performance of our neural transcompilers. Our methods rely exclusively on monolingual source code, require no expertise in the source or target languages, and can easily be generalized to other programming languages."} | ||
| 60 | +{"work_id": 4221145109, "title": "data2vec: A General Framework for Self-supervised Learning in Speech, Vision and Language", "abstract": "While the general idea of self-supervised learning is identical across modalities, the actual algorithms and objectives differ widely because they were developed with a single modality in mind. To get us closer to general self-supervised learning, we present data2vec, a framework that uses the same learning method for either speech, NLP or computer vision. The core idea is to predict latent representations of the full input data based on a masked view of the input in a self-distillation setup using a standard Transformer architecture. Instead of predicting modality-specific targets such as words, visual tokens or units of human speech which are local in nature, data2vec predicts contextualized latent representations that contain information from the entire input. Experiments on the major benchmarks of speech recognition, image classification, and natural language understanding demonstrate a new state of the art or competitive performance to predominant approaches."} | ||||
| 77 | {"work_id": 3014641072, "title": "Deep High-Resolution Representation Learning for Visual Recognition", "abstract": "High-resolution representations are essential for position-sensitive vision problems, such as human pose estimation, semantic segmentation, and object detection. Existing state-of-the-art frameworks first encode the input image as a low-resolution representation through a subnetwork that is formed by connecting high-to-low resolution convolutions in series (e.g., ResNet, VGGNet), and then recover the high-resolution representation from the encoded low-resolution representation. Instead, our proposed network, named as High-Resolution Network (HRNet), maintains high-resolution representations through the whole process. There are two key characteristics: (i) Connect the high-to-low resolution convolution streams in parallel and (ii) repeatedly exchange the information across resolutions. The benefit is that the resulting representation is semantically richer and spatially more precise. We show the superiority of the proposed HRNet in a wide range of applications, including human pose estimation, semantic segmentation, and object detection, suggesting that the HRNet is a stronger backbone for computer vision problems. All the codes are available at https://github.com/HRNet."} | 61 | {"work_id": 3014641072, "title": "Deep High-Resolution Representation Learning for Visual Recognition", "abstract": "High-resolution representations are essential for position-sensitive vision problems, such as human pose estimation, semantic segmentation, and object detection. Existing state-of-the-art frameworks first encode the input image as a low-resolution representation through a subnetwork that is formed by connecting high-to-low resolution convolutions in series (e.g., ResNet, VGGNet), and then recover the high-resolution representation from the encoded low-resolution representation. Instead, our proposed network, named as High-Resolution Network (HRNet), maintains high-resolution representations through the whole process. There are two key characteristics: (i) Connect the high-to-low resolution convolution streams in parallel and (ii) repeatedly exchange the information across resolutions. The benefit is that the resulting representation is semantically richer and spatially more precise. We show the superiority of the proposed HRNet in a wide range of applications, including human pose estimation, semantic segmentation, and object detection, suggesting that the HRNet is a stronger backbone for computer vision problems. All the codes are available at https://github.com/HRNet."} | ||
| 78 | −{"work_id": 2752782242, "title": "Squeeze-and-Excitation Networks", "abstract": "Convolutional neural networks are built upon the convolution operation, which extracts informative features by fusing spatial and channel-wise information together within local receptive fields. In order to boost the representational power of a network, several recent approaches have shown the benefit of enhancing spatial encoding. In this work, we focus on the channel relationship and propose a novel architectural unit, which we term the \"Squeeze-and-Excitation\" (SE) block, that adaptively recalibrates channel-wise feature responses by explicitly modelling interdependencies between channels. We demonstrate that by stacking these blocks together, we can construct SENet architectures that generalise extremely well across challenging datasets. Crucially, we find that SE blocks produce significant performance improvements for existing state-of-the-art deep architectures at minimal additional computational cost. SENets formed the foundation of our ILSVRC 2017 classification submission which won first place and significantly reduced the top-5 error to 2.251%, achieving a ~25% relative improvement over the winning entry of 2016. Code and models are available at https://github.com/hujie-frank/SENet."} | ||||
| 79 | {"work_id": 4294891500, "title": "A Survey on Metaverse: Fundamentals, Security, and Privacy", "abstract": "Metaverse, as an evolving paradigm of the next-generation Internet, aims to build a fully immersive, hyper spatiotemporal, and self-sustaining virtual shared space for humans to play, work, and socialize. Driven by recent advances in emerging technologies such as extended reality, artificial intelligence, and blockchain, metaverse is stepping from science fiction to an upcoming reality. However, severe privacy invasions and security breaches (inherited from underlying technologies or emerged in the new digital ecology) of metaverse can impede its wide deployment. At the same time, a series of fundamental challenges (e.g., scalability and interoperability) can arise in metaverse security provisioning owing to the intrinsic characteristics of metaverse, such as immersive realism, hyper spatiotemporality, sustainability, and heterogeneity. In this paper, we present a comprehensive survey of the fundamentals, security, and privacy of metaverse. Specifically, we first investigate a novel distributed metaverse architecture and its key characteristics with ternary-world interactions. Then, we discuss the security and privacy threats, present the critical challenges of metaverse systems, and review the state-of-the-art countermeasures. Finally, we draw open research directions for building future metaverse systems."} | 62 | {"work_id": 4294891500, "title": "A Survey on Metaverse: Fundamentals, Security, and Privacy", "abstract": "Metaverse, as an evolving paradigm of the next-generation Internet, aims to build a fully immersive, hyper spatiotemporal, and self-sustaining virtual shared space for humans to play, work, and socialize. Driven by recent advances in emerging technologies such as extended reality, artificial intelligence, and blockchain, metaverse is stepping from science fiction to an upcoming reality. However, severe privacy invasions and security breaches (inherited from underlying technologies or emerged in the new digital ecology) of metaverse can impede its wide deployment. At the same time, a series of fundamental challenges (e.g., scalability and interoperability) can arise in metaverse security provisioning owing to the intrinsic characteristics of metaverse, such as immersive realism, hyper spatiotemporality, sustainability, and heterogeneity. In this paper, we present a comprehensive survey of the fundamentals, security, and privacy of metaverse. Specifically, we first investigate a novel distributed metaverse architecture and its key characteristics with ternary-world interactions. Then, we discuss the security and privacy threats, present the critical challenges of metaverse systems, and review the state-of-the-art countermeasures. Finally, we draw open research directions for building future metaverse systems."} | ||
| 80 | {"work_id": 3005680577, "title": "A Simple Framework for Contrastive Learning of Visual Representations", "abstract": "This paper presents SimCLR: a simple framework for contrastive learning of visual representations. We simplify recently proposed contrastive self-supervised learning algorithms without requiring specialized architectures or a memory bank. In order to understand what enables the contrastive prediction tasks to learn useful representations, we systematically study the major components of our framework. We show that (1) composition of data augmentations plays a critical role in defining effective predictive tasks, (2) introducing a learnable nonlinear transformation between the representation and the contrastive loss substantially improves the quality of the learned representations, and (3) contrastive learning benefits from larger batch sizes and more training steps compared to supervised learning. By combining these findings, we are able to considerably outperform previous methods for self-supervised and semi-supervised learning on ImageNet. A linear classifier trained on self-supervised representations learned by SimCLR achieves 76.5% top-1 accuracy, which is a 7% relative improvement over previous state-of-the-art, matching the performance of a supervised ResNet-50. When fine-tuned on only 1% of the labels, we achieve 85.8% top-5 accuracy, outperforming AlexNet with 100X fewer labels."} | 63 | {"work_id": 3005680577, "title": "A Simple Framework for Contrastive Learning of Visual Representations", "abstract": "This paper presents SimCLR: a simple framework for contrastive learning of visual representations. We simplify recently proposed contrastive self-supervised learning algorithms without requiring specialized architectures or a memory bank. In order to understand what enables the contrastive prediction tasks to learn useful representations, we systematically study the major components of our framework. We show that (1) composition of data augmentations plays a critical role in defining effective predictive tasks, (2) introducing a learnable nonlinear transformation between the representation and the contrastive loss substantially improves the quality of the learned representations, and (3) contrastive learning benefits from larger batch sizes and more training steps compared to supervised learning. By combining these findings, we are able to considerably outperform previous methods for self-supervised and semi-supervised learning on ImageNet. A linear classifier trained on self-supervised representations learned by SimCLR achieves 76.5% top-1 accuracy, which is a 7% relative improvement over previous state-of-the-art, matching the performance of a supervised ResNet-50. When fine-tuned on only 1% of the labels, we achieve 85.8% top-5 accuracy, outperforming AlexNet with 100X fewer labels."} | ||
| 81 | {"work_id": 4392772072, "title": "AI in education: A review of personalized learning and educational technology", "abstract": "The integration of Artificial Intelligence (AI) in education has ushered in a transformative era, redefining traditional teaching and learning methods. This review explores the multifaceted role of AI in education, with a particular focus on personalized learning and educational technology. The synergy between AI and education promises to address individualized needs, enhance student engagement, and optimize learning outcomes. Personalized learning, enabled by AI algorithms, tailors educational experiences to the unique needs, preferences, and pace of each student. This approach goes beyond a one-size-fits-all model, fostering a more inclusive and effective learning environment. The review delves into the diverse applications of AI-driven personalized learning, ranging from adaptive content delivery and real-time feedback to intelligent tutoring systems. It analyzes the impact of these technologies on student performance, highlighting the potential to narrow educational gaps and cater to diverse learning styles. Educational technology, powered by AI, extends beyond the classroom, encompassing online platforms, virtual reality, and interactive tools. The review explores the integration of AI in curriculum development, content creation, and assessment methods, offering insights into how these technologies augment the teaching and learning experience. Furthermore, the review examines the role of AI in automating administrative tasks, allowing educators to redirect their focus towards personalized instruction. Challenges and ethical considerations associated with the adoption of AI in education are also scrutinized. Privacy concerns, algorithmic biases, and the digital divide are discussed, emphasizing the importance of responsible AI implementation. The review underscores the need for collaborative efforts among educators, policymakers, and technologists to establish ethical guidelines and ensure the equitable distribution of AI-enhanced educational resources. This review provides a comprehensive examination of the evolving landscape of AI in education, with a spotlight on personalized learning and educational technology. As the symbiosis between AI and education continues to evolve, this synthesis of current research and trends aims to guide future developments, fostering an informed and progressive approach to the integration of AI in the educational sphere."} | 64 | {"work_id": 4392772072, "title": "AI in education: A review of personalized learning and educational technology", "abstract": "The integration of Artificial Intelligence (AI) in education has ushered in a transformative era, redefining traditional teaching and learning methods. This review explores the multifaceted role of AI in education, with a particular focus on personalized learning and educational technology. The synergy between AI and education promises to address individualized needs, enhance student engagement, and optimize learning outcomes. Personalized learning, enabled by AI algorithms, tailors educational experiences to the unique needs, preferences, and pace of each student. This approach goes beyond a one-size-fits-all model, fostering a more inclusive and effective learning environment. The review delves into the diverse applications of AI-driven personalized learning, ranging from adaptive content delivery and real-time feedback to intelligent tutoring systems. It analyzes the impact of these technologies on student performance, highlighting the potential to narrow educational gaps and cater to diverse learning styles. Educational technology, powered by AI, extends beyond the classroom, encompassing online platforms, virtual reality, and interactive tools. The review explores the integration of AI in curriculum development, content creation, and assessment methods, offering insights into how these technologies augment the teaching and learning experience. Furthermore, the review examines the role of AI in automating administrative tasks, allowing educators to redirect their focus towards personalized instruction. Challenges and ethical considerations associated with the adoption of AI in education are also scrutinized. Privacy concerns, algorithmic biases, and the digital divide are discussed, emphasizing the importance of responsible AI implementation. The review underscores the need for collaborative efforts among educators, policymakers, and technologists to establish ethical guidelines and ensure the equitable distribution of AI-enhanced educational resources. This review provides a comprehensive examination of the evolving landscape of AI in education, with a spotlight on personalized learning and educational technology. As the symbiosis between AI and education continues to evolve, this synthesis of current research and trends aims to guide future developments, fostering an informed and progressive approach to the integration of AI in the educational sphere."} | ||
| 82 | {"work_id": 4398756379, "title": "YOLOv8: A Novel Object Detection Algorithm with Enhanced Performance and Robustness", "abstract": "In recent years, the You Only Look Once (YOLO) series of object detection algorithms have garnered significant attention for their speed and accuracy in real-time applications. This paper presents YOLOv8, a novel object detection algorithm that builds upon the advancements of previous iterations, aiming to further enhance performance and robustness. Inspired by the evolution of YOLO architectures from YOLOv1 to YOLOv7, as well as insights from comparative analyses of models like YOLOv5 and YOLOv6, YOLOv8 incorporates key innovations to achieve optimal speed and accuracy. Leveraging attention mechanisms and dynamic convolution, YOLOv8 introduces improvements specifically tailored for small object detection, addressing challenges highlighted in YOLOv7. Additionally, the integration of voice recognition techniques enhances the algorithm's capabilities for video-based object detection, as demonstrated in YOLOv7. The proposed algorithm undergoes rigorous evaluation against state-of-the-art benchmarks, showcasing superior performance in terms of both detection accuracy and computational efficiency. Experimental results on various datasets confirm the effectiveness of YOLOv8 across diverse scenarios, further validating its suitability for real-world applications. This paper contributes to the ongoing advancements in object detection research by presenting YOLOv8 as a versatile and high-performing algorithm, poised to address the evolving needs of computer vision systems."} | 65 | {"work_id": 4398756379, "title": "YOLOv8: A Novel Object Detection Algorithm with Enhanced Performance and Robustness", "abstract": "In recent years, the You Only Look Once (YOLO) series of object detection algorithms have garnered significant attention for their speed and accuracy in real-time applications. This paper presents YOLOv8, a novel object detection algorithm that builds upon the advancements of previous iterations, aiming to further enhance performance and robustness. Inspired by the evolution of YOLO architectures from YOLOv1 to YOLOv7, as well as insights from comparative analyses of models like YOLOv5 and YOLOv6, YOLOv8 incorporates key innovations to achieve optimal speed and accuracy. Leveraging attention mechanisms and dynamic convolution, YOLOv8 introduces improvements specifically tailored for small object detection, addressing challenges highlighted in YOLOv7. Additionally, the integration of voice recognition techniques enhances the algorithm's capabilities for video-based object detection, as demonstrated in YOLOv7. The proposed algorithm undergoes rigorous evaluation against state-of-the-art benchmarks, showcasing superior performance in terms of both detection accuracy and computational efficiency. Experimental results on various datasets confirm the effectiveness of YOLOv8 across diverse scenarios, further validating its suitability for real-world applications. This paper contributes to the ongoing advancements in object detection research by presenting YOLOv8 as a versatile and high-performing algorithm, poised to address the evolving needs of computer vision systems."} | ||
| 66 | +{"work_id": 4392741075, "title": "Evaluation metrics and statistical tests for machine learning", "abstract": "Research on different machine learning (ML) has become incredibly popular during the past few decades. However, for some researchers not familiar with statistics, it might be difficult to understand how to evaluate the performance of ML models and compare them with each other. Here, we introduce the most common evaluation metrics used for the typical supervised ML tasks including binary, multi-class, and multi-label classification, regression, image segmentation, object detection, and information retrieval. We explain how to choose a suitable statistical test for comparing models, how to obtain enough values of the metric for testing, and how to perform the test and interpret its results. We also present a few practical examples about comparing convolutional neural networks used to classify X-rays with different lung infections and detect cancer tumors in positron emission tomography images."} | ||||
| 83 | {"work_id": 4229005866, "title": "Analysing Off-The-Shelf Options for Question Answering with Portuguese FAQs", "abstract": "Following the current interest in developing automatic question answering systems, we analyse alternative approaches for finding suitable answers from a list of Frequently Asked Questions (FAQs), in Portuguese. These rely on different technologies, some more established and others more recent, and are all easily adaptable to new lists of FAQs, on new domains. We analyse the effort required for their configuration, the accuracy of their answers, and the time they take to get such answers. We conclude that traditional Information Retrieval (IR) can be a solution for smaller lists of FAQs, but approaches based on deep neural networks for sentence encoding are at least as reliable and less dependent on the number and complexity of the FAQs. We also contribute with a small dataset of Portuguese FAQs on the domain of telecommunications, which was used in our experiments."} | 67 | {"work_id": 4229005866, "title": "Analysing Off-The-Shelf Options for Question Answering with Portuguese FAQs", "abstract": "Following the current interest in developing automatic question answering systems, we analyse alternative approaches for finding suitable answers from a list of Frequently Asked Questions (FAQs), in Portuguese. These rely on different technologies, some more established and others more recent, and are all easily adaptable to new lists of FAQs, on new domains. We analyse the effort required for their configuration, the accuracy of their answers, and the time they take to get such answers. We conclude that traditional Information Retrieval (IR) can be a solution for smaller lists of FAQs, but approaches based on deep neural networks for sentence encoding are at least as reliable and less dependent on the number and complexity of the FAQs. We also contribute with a small dataset of Portuguese FAQs on the domain of telecommunications, which was used in our experiments."} | ||
| 84 | {"work_id": 3167533889, "title": "SpeechBrain: A General-Purpose Speech Toolkit", "abstract": "SpeechBrain is an open-source and all-in-one speech toolkit. It is designed to facilitate the research and development of neural speech processing technologies by being simple, flexible, user-friendly, and well-documented. This paper describes the core architecture designed to support several tasks of common interest, allowing users to naturally conceive, compare and share novel speech processing pipelines. SpeechBrain achieves competitive or state-of-the-art performance in a wide range of speech benchmarks. It also provides training recipes, pretrained models, and inference scripts for popular speech datasets, as well as tutorials which allow anyone with basic Python proficiency to familiarize themselves with speech technologies."} | 68 | {"work_id": 3167533889, "title": "SpeechBrain: A General-Purpose Speech Toolkit", "abstract": "SpeechBrain is an open-source and all-in-one speech toolkit. It is designed to facilitate the research and development of neural speech processing technologies by being simple, flexible, user-friendly, and well-documented. This paper describes the core architecture designed to support several tasks of common interest, allowing users to naturally conceive, compare and share novel speech processing pipelines. SpeechBrain achieves competitive or state-of-the-art performance in a wide range of speech benchmarks. It also provides training recipes, pretrained models, and inference scripts for popular speech datasets, as well as tutorials which allow anyone with basic Python proficiency to familiarize themselves with speech technologies."} | ||
| 85 | {"work_id": 4404112583, "title": "All One Needs to Know about Metaverse: A Complete Survey on Technological Singularity, Virtual Ecosystem, and Research Agenda", "abstract": "Since the popularisation of the Internet in the 1990s, the cyberspace has kept evolving. We have created various computer-mediated virtual environments, including social networks, video conferencing, virtual 3D worlds (e.g., VR Chat), augmented reality applications (e.g., Pok\u00e9mon Go), and Non-Fungible Token Games (e.g., Upland). Such virtual environments, albeit non-perpetual and unconnected, have brought us various degrees of digital transformation. The term \u201cmetaverse\u201d has been coined to facilitate further digital transformation in every aspect of our physical lives. At the core of the metaverse stands the vision of an immersive Internet as a gigantic, unified, persistent, and shared realm. While the metaverse may seem futuristic, catalyzed by emerging technologies such as Extended Reality, 5G, and Artificial Intelligence, the digital \u201cbig bang\u201d of our cyberspace is not far away. This survey presents the first effort to offer a comprehensive framework that examines the latest metaverse development under the dimensions of state-of-the-art technologies and metaverse ecosystems and illustrates the possibility of the digital \u201cbig bang\u201d. It is essential to highlight that the metaverse encompasses diverse technologies and ecosystems, calling it an interdisciplinary and emerging field. Its primary objective is to provide users with satisfactory and interactive experiences. First, technologies are the enablers that drive the transition from the current Internet to the metaverse. We thus examine eight enabling technologies rigorously \u2013 Extended Reality, User Interactivity (Human-Computer Interaction), Artificial Intelligence, Blockchain, Computer Vision, IoT and Robotics, Edge and Cloud computing, and Future Mobile Networks. In terms of applications, the metaverse ecosystem allows human users to live and play within a self-sustaining, persistent, and shared realm. Therefore, we discuss six user-centric factors \u2013 Avatar, Content Creation, Virtual Economy, Social Acceptability, Security and Privacy, and Trust and Accountability. Finally, we propose a concrete research agenda for developing the metaverse."} | 69 | {"work_id": 4404112583, "title": "All One Needs to Know about Metaverse: A Complete Survey on Technological Singularity, Virtual Ecosystem, and Research Agenda", "abstract": "Since the popularisation of the Internet in the 1990s, the cyberspace has kept evolving. We have created various computer-mediated virtual environments, including social networks, video conferencing, virtual 3D worlds (e.g., VR Chat), augmented reality applications (e.g., Pok\u00e9mon Go), and Non-Fungible Token Games (e.g., Upland). Such virtual environments, albeit non-perpetual and unconnected, have brought us various degrees of digital transformation. The term \u201cmetaverse\u201d has been coined to facilitate further digital transformation in every aspect of our physical lives. At the core of the metaverse stands the vision of an immersive Internet as a gigantic, unified, persistent, and shared realm. While the metaverse may seem futuristic, catalyzed by emerging technologies such as Extended Reality, 5G, and Artificial Intelligence, the digital \u201cbig bang\u201d of our cyberspace is not far away. This survey presents the first effort to offer a comprehensive framework that examines the latest metaverse development under the dimensions of state-of-the-art technologies and metaverse ecosystems and illustrates the possibility of the digital \u201cbig bang\u201d. It is essential to highlight that the metaverse encompasses diverse technologies and ecosystems, calling it an interdisciplinary and emerging field. Its primary objective is to provide users with satisfactory and interactive experiences. First, technologies are the enablers that drive the transition from the current Internet to the metaverse. We thus examine eight enabling technologies rigorously \u2013 Extended Reality, User Interactivity (Human-Computer Interaction), Artificial Intelligence, Blockchain, Computer Vision, IoT and Robotics, Edge and Cloud computing, and Future Mobile Networks. In terms of applications, the metaverse ecosystem allows human users to live and play within a self-sustaining, persistent, and shared realm. Therefore, we discuss six user-centric factors \u2013 Avatar, Content Creation, Virtual Economy, Social Acceptability, Security and Privacy, and Trust and Accountability. Finally, we propose a concrete research agenda for developing the metaverse."} | ||
@@ -91,24 +75,8 @@ | |||||
| 91 | {"work_id": 4414079054, "title": "\u03c0\u2080: A Vision-Language-Action Flow Model for General Robot Control", "abstract": "&&0'% ) 8::!7 2/ .()/) 'GG) Z)0./GSO/,SGL ./O/), G m l hg/%('(G0 /)S/,G% y&/%,)p.n 2.G .G,)|{z 0 /) G2G.G.G 0%G) 2.G .(\u00b02G)\u00a9\u00afSO/,SG )\u00a1 G ,)S\u00b3)S/.G\u00b1 O') O%G 20 )O/ %G O()(./0G.G /2G)2/20/.%/,),pG /. )%G(/ S G)0/&&GG \u00c0GG2) O%G GS2 \u00b3),.\u00b3G.G ) O%G 20 )pG%& &% G)O/ \u00d5(p\u00d3'% \u00b3)2/ .(),p(p),G G. \u00b3"} | 75 | {"work_id": 4414079054, "title": "\u03c0\u2080: A Vision-Language-Action Flow Model for General Robot Control", "abstract": "&&0'% ) 8::!7 2/ .()/) 'GG) Z)0./GSO/,SGL ./O/), G m l hg/%('(G0 /)S/,G% y&/%,)p.n 2.G .G,)|{z 0 /) G2G.G.G 0%G) 2.G .(\u00b02G)\u00a9\u00afSO/,SG )\u00a1 G ,)S\u00b3)S/.G\u00b1 O') O%G 20 )O/ %G O()(./0G.G /2G)2/20/.%/,),pG /. )%G(/ S G)0/&&GG \u00c0GG2) O%G GS2 \u00b3),.\u00b3G.G ) O%G 20 )pG%& &% G)O/ \u00d5(p\u00d3'% \u00b3)2/ .(),p(p),G G. \u00b3"} | ||
| 92 | {"work_id": 4311000453, "title": "Robust Speech Recognition via Large-Scale Weak Supervision", "abstract": "We study the capabilities of speech processing systems trained simply to predict large amounts of transcripts of audio on the internet. When scaled to 680,000 hours of multilingual and multitask supervision, the resulting models generalize well to standard benchmarks and are often competitive with prior fully supervised results but in a zero-shot transfer setting without the need for any fine-tuning. When compared to humans, the models approach their accuracy and robustness. We are releasing models and inference code to serve as a foundation for further work on robust speech processing."} | 76 | {"work_id": 4311000453, "title": "Robust Speech Recognition via Large-Scale Weak Supervision", "abstract": "We study the capabilities of speech processing systems trained simply to predict large amounts of transcripts of audio on the internet. When scaled to 680,000 hours of multilingual and multitask supervision, the resulting models generalize well to standard benchmarks and are often competitive with prior fully supervised results but in a zero-shot transfer setting without the need for any fine-tuning. When compared to humans, the models approach their accuracy and robustness. We are releasing models and inference code to serve as a foundation for further work on robust speech processing."} | ||
| 93 | {"work_id": 2963125010, "title": "ShuffleNet: An Extremely Efficient Convolutional Neural Network for Mobile Devices", "abstract": "We introduce an extremely computation-efficient CNN architecture named ShuffleNet, which is designed specially for mobile devices with very limited computing power (e.g., 10-150 MFLOPs). The new architecture utilizes two new operations, pointwise group convolution and channel shuffle, to greatly reduce computation cost while maintaining accuracy. Experiments on ImageNet classification and MS COCO object detection demonstrate the superior performance of ShuffleNet over other structures, e.g. lower top-1 error (absolute 7.8%) than recent MobileNet [12] on ImageNet classification task, under the computation budget of 40 MFLOPs. On an ARM-based mobile device, ShuffleNet achieves ~13\u00d7 actual speedup over AlexNet while maintaining comparable accuracy."} | 77 | {"work_id": 2963125010, "title": "ShuffleNet: An Extremely Efficient Convolutional Neural Network for Mobile Devices", "abstract": "We introduce an extremely computation-efficient CNN architecture named ShuffleNet, which is designed specially for mobile devices with very limited computing power (e.g., 10-150 MFLOPs). The new architecture utilizes two new operations, pointwise group convolution and channel shuffle, to greatly reduce computation cost while maintaining accuracy. Experiments on ImageNet classification and MS COCO object detection demonstrate the superior performance of ShuffleNet over other structures, e.g. lower top-1 error (absolute 7.8%) than recent MobileNet [12] on ImageNet classification task, under the computation budget of 40 MFLOPs. On an ARM-based mobile device, ShuffleNet achieves ~13\u00d7 actual speedup over AlexNet while maintaining comparable accuracy."} | ||
| 94 | −{"work_id": 2885324189, "title": "Neural Importance Sampling", "abstract": "We propose to use deep neural networks for generating samples in Monte Carlo integration. Our work is based on non-linear independent components estimation (NICE), which we extend in numerous ways to improve performance and enable its application to integration problems. First, we introduce piecewise-polynomial coupling transforms that greatly increase the modeling power of individual coupling layers. Second, we propose to preprocess the inputs of neural networks using one-blob encoding, which stimulates localization of computation and improves inference. Third, we derive a gradient-descent-based optimization for the Kullback-Leibler and the \u03c7 2 divergence for the specific application of Monte Carlo integration with unnormalized stochastic estimates of the target distribution. Our approach enables fast and accurate inference and efficient sample generation independently of the dimensionality of the integration domain. We show its benefits on generating natural images and in two applications to light-transport simulation: first, we demonstrate learning of joint path-sampling densities in the primary sample space and importance sampling of multi-dimensional path prefixes thereof. Second, we use our technique to extract conditional directional densities driven by the product of incident illumination and the BSDF in the rendering equation, and we leverage the densities for path guiding. In all applications, our approach yields on-par or higher performance than competing techniques at equal sample count."} | ||||
| 95 | {"work_id": 4383108457, "title": "ProgPrompt: Generating Situated Robot Task Plans using Large Language Models", "abstract": "Task planning can require defining myriad domain knowledge about the world in which a robot needs to act. To ameliorate that effort, large language models (LLMs) can be used to score potential next actions during task planning, and even generate action sequences directly, given an instruction in natural language with no additional domain information. However, such methods either require enumerating all possible next steps for scoring, or generate free-form text that may contain actions not possible on a given robot in its current context. We present a programmatic LLM prompt structure that enables plan generation functional across situated environments, robot capabilities, and tasks. Our key insight is to prompt the LLM with program-like specifications of the available actions and objects in an environment, as well as with example programs that can be executed. We make concrete recommendations about prompt structure and generation constraints through ablation experiments, demonstrate state of the art success rates in VirtualHome household tasks, and deploy our method on a physical robot arm for tabletop tasks. Website at progprompt.github.io"} | 78 | {"work_id": 4383108457, "title": "ProgPrompt: Generating Situated Robot Task Plans using Large Language Models", "abstract": "Task planning can require defining myriad domain knowledge about the world in which a robot needs to act. To ameliorate that effort, large language models (LLMs) can be used to score potential next actions during task planning, and even generate action sequences directly, given an instruction in natural language with no additional domain information. However, such methods either require enumerating all possible next steps for scoring, or generate free-form text that may contain actions not possible on a given robot in its current context. We present a programmatic LLM prompt structure that enables plan generation functional across situated environments, robot capabilities, and tasks. Our key insight is to prompt the LLM with program-like specifications of the available actions and objects in an environment, as well as with example programs that can be executed. We make concrete recommendations about prompt structure and generation constraints through ablation experiments, demonstrate state of the art success rates in VirtualHome household tasks, and deploy our method on a physical robot arm for tabletop tasks. Website at progprompt.github.io"} | ||
| 96 | {"work_id": 7125799258, "title": "Parameter-Efficient Fine-Tuning Methods for Pretrained Language Models: A Critical Review and Assessment", "abstract": "With the continuous growth in the number of parameters of the Transformer-based pretrained language models (PLMs), particularly the emergence of large language models (LLMs) with billions of parameters, many natural language processing (NLP) tasks have demonstrated remarkable success. However, the enormous size and computational demands of these models pose significant challenges for adapting them to specific downstream tasks, especially in environments with limited computational resources. Parameter-Efficient Fine-Tuning (PEFT) offers an effective solution by reducing the number of fine-tuning parameters and memory usage while achieving comparable performance to full fine-tuning. The demands for fine-tuning PLMs, especially LLMs, have led to a surge in the development of PEFT methods, as depicted in Fig. 1. In this paper, we present a comprehensive and systematic review of PEFT methods for PLMs. We summarize these PEFT methods, discuss their applications, and outline future directions. Furthermore, extensive experiments are conducted using several representative PEFT methods to better understand their effectiveness in parameter efficiency and memory efficiency. By offering insights into the latest advancements and practical applications, this survey serves as an invaluable resource for researchers and practitioners seeking to navigate the challenges and opportunities presented by PEFT in the context of PLMs."} | 79 | {"work_id": 7125799258, "title": "Parameter-Efficient Fine-Tuning Methods for Pretrained Language Models: A Critical Review and Assessment", "abstract": "With the continuous growth in the number of parameters of the Transformer-based pretrained language models (PLMs), particularly the emergence of large language models (LLMs) with billions of parameters, many natural language processing (NLP) tasks have demonstrated remarkable success. However, the enormous size and computational demands of these models pose significant challenges for adapting them to specific downstream tasks, especially in environments with limited computational resources. Parameter-Efficient Fine-Tuning (PEFT) offers an effective solution by reducing the number of fine-tuning parameters and memory usage while achieving comparable performance to full fine-tuning. The demands for fine-tuning PLMs, especially LLMs, have led to a surge in the development of PEFT methods, as depicted in Fig. 1. In this paper, we present a comprehensive and systematic review of PEFT methods for PLMs. We summarize these PEFT methods, discuss their applications, and outline future directions. Furthermore, extensive experiments are conducted using several representative PEFT methods to better understand their effectiveness in parameter efficiency and memory efficiency. By offering insights into the latest advancements and practical applications, this survey serves as an invaluable resource for researchers and practitioners seeking to navigate the challenges and opportunities presented by PEFT in the context of PLMs."} | ||
| 97 | −{"work_id": 3115857147, "title": "Illumination Space: A Feature Space for Radiance Maps", "abstract": "Radiance maps (RM) are used for capturing the lighting properties of real-world environments. Databases of RMs are useful for various rendering applications such as Look Development, live action composition, mixed reality, and machine learning. Such databases are not useful if they cannot be organized in a meaningful way. To address this, we introduce the illumination space, a feature space that arranges RM databases based on illumination properties. We avoid manual labeling by automatically extracting features from an RM that provides a concise and semantically meaningful representation of its typical lighting effects. This is made possible with the following contributions: a method to automatically extract a small set of dominant and ambient lighting properties from RMs, and a low-dimensional (5D) light feature vector summarizing these properties to form the illumination space. Our method is motivated by how the RM illuminates the scene as opposed to describing the textural content of the RM."} | ||||
| 98 | −{"work_id": 2978950353, "title": "PERANCANGAN POP UP BOOK AND SOUND TEMBANG DOLANAN SEBAGAI MEDIA PENGENALAN ALAT MUSIK GAMELAN", "abstract": "Perancangan Pop Up Book and Sound Tembang Dolanan Sebagai Pengenalan Alat Musik Gamelan. NAMA: Ilham Musyafa Asya Ari NIM. 12151125. Program Studi S-1 Desain Komunikasii Visual. Kesenian tradisional Jawa banyak macamnya, salah satunya adalah seni tembang dolanan yang diiringi dengan gamelan jawa. Saat ini dalam mata pelajaran sekolah siswa SD (sekolah Dasar) di Surakarta sangat jarang diperkenalkan, karena pada kenyataannya instrument gamelan tidak dimiliki atau jarang ada sebagai laboratorim pembelajaran. Pembelajaran tembang dolanan diiringi instrumen gamelan dianggap kurang menarik dan ketinggalan jaman, meskipun ada instrument campursari atau organ tunggal. Perancangan buku pop up book tembang dolanan ini diciptakan, sebagai media ajar yang baru bertujuan agar lebih menarik generasi masa kini terutama anak-anak sekolah dasar untuk mengenal kembali kebudayaan musik tradisi yang sarat akan makna yang keberadaannya sudah mulai dilupakan. Metode penciptaan ini dimulai dengan riset dan wawancara ke sekolah-sekolah dasar di Surakarta, melakukan brainstorming, eksplorasi ide, penciptaan naskah, sketsa, layout, dummy, dan artwork. Media promosi untuk memperkenalkan Pop up book ini melalui media lini atas yaitu website atau media sosial dan media pendukung seperti pensil warna, totegbag, pin dan sticker, sebagai bentuk untuk menyadarkan arti pentingnya mencintai budaya lokal pada tembang dolanan."} | ||||
| 99 | −{"work_id": 4212875960, "title": "UNETR: Transformers for 3D Medical Image Segmentation", "abstract": "Fully Convolutional Neural Networks (FCNNs) with contracting and expanding paths have shown prominence for the majority of medical image segmentation applications since the past decade. In FCNNs, the encoder plays an integral role by learning both global and local features and contextual representations which can be utilized for semantic output prediction by the decoder. Despite their success, the locality of convolutional layers in FCNNs, limits the capability of learning long-range spatial dependencies. Inspired by the recent success of transformers for Natural Language Processing (NLP) in long-range sequence learning, we reformulate the task of volumetric (3D) medical image segmentation as a sequence-to-sequence prediction problem. We introduce a novel architecture, dubbed as UNEt TRansformers (UNETR), that utilizes a transformer as the encoder to learn sequence representations of the input volume and effectively capture the global multi-scale information, while also following the successful \"U-shaped\" network design for the encoder and decoder. The transformer encoder is directly connected to a decoder via skip connections at different resolutions to compute the final semantic segmentation output. We have validated the performance of our method on the Multi Atlas Labeling Beyond The Cranial Vault (BTCV) dataset for multi-organ segmentation and the Medical Segmentation Decathlon (MSD) dataset for brain tumor and spleen segmentation tasks. Our benchmarks demonstrate new state-of-the-art performance on the BTCV leaderboard."} | ||||
| 100 | −{"work_id": 4400881081, "title": "TransUNet: Rethinking the U-Net architecture design for medical image segmentation through the lens of transformers", "abstract": "Medical image segmentation is crucial for healthcare, yet convolution-based methods like U-Net face limitations in modeling long-range dependencies. To address this, Transformers designed for sequence-to-sequence predictions have been integrated into medical image segmentation. However, a comprehensive understanding of Transformers' self-attention in U-Net components is lacking. TransUNet, first introduced in 2021, is widely recognized as one of the first models to integrate Transformer into medical image analysis. In this study, we present the versatile framework of TransUNet that encapsulates Transformers' self-attention into two key modules: (1) a Transformer encoder tokenizing image patches from a convolution neural network (CNN) feature map, facilitating global context extraction, and (2) a Transformer decoder refining candidate regions through cross-attention between proposals and U-Net features. These modules can be flexibly inserted into the U-Net backbone, resulting in three configurations: Encoder-only, Decoder-only, and Encoder+Decoder. TransUNet provides a library encompassing both 2D and 3D implementations, enabling users to easily tailor the chosen architecture. Our findings highlight the encoder's efficacy in modeling interactions among multiple abdominal organs and the decoder's strength in handling small targets like tumors. It excels in diverse medical applications, such as multi-organ segmentation, pancreatic tumor segmentation, and hepatic vessel segmentation. Notably, our TransUNet achieves a significant average Dice improvement of 1.06% and 4.30% for multi-organ segmentation and pancreatic tumor segmentation, respectively, when compared to the highly competitive nn-UNet, and surpasses the top-1 solution in the BrasTS2021 challenge. 2D/3D Code and models are available at https://github.com/Beckschen/TransUNet and https://github.com/Beckschen/TransUNet-3D, respectively."} | ||||
| 101 | −{"work_id": 7135186946, "title": "Scalable Fluid Antenna Systems: A New Paradigm for Array Signal Processing", "abstract": "Most existing antenna array-based source localization methods rely on fixed-position arrays (FPAs) and strict assumptions about source field conditions (near-field or far-field), which limits their effectiveness in complex, dynamic real-world scenarios where high-precision localization is required. In contrast, this paper introduces a novel scalable fluid antenna system (SFAS) that can dynamically adjust its aperture configuration to optimize performance for different localization tasks. Within this framework, we develop a two-stage source localization strategy based on the exact spatial geometry (ESG) model: the first stage uses a compact aperture configuration for initial direction-of-arrival (DOA) estimation, while the second stage employs an expanded aperture for enhanced DOA and range estimation. The proposed approach eliminates the traditional need for signal separation or isolation to classify source types and enables a single SFAS array to achieve high localization accuracy without field-specific assumptions, model simplifications, or approximations, representing a new paradigm in array-based source localization. Extensive simulations demonstrate the superiority of the proposed method in terms of localization accuracy, computational efficiency, and robustness to different source types."} | ||||
| 102 | −{"work_id": 2963163009, "title": "MobileNetV2: Inverted Residuals and Linear Bottlenecks", "abstract": "In this paper we describe a new mobile architecture, MobileNetV2, that improves the state of the art performance of mobile models on multiple tasks and benchmarks as well as across a spectrum of different model sizes. We also describe efficient ways of applying these mobile models to object detection in a novel framework we call SSDLite. Additionally, we demonstrate how to build mobile semantic segmentation models through a reduced form of DeepLabv3 which we call Mobile DeepLabv3. is based on an inverted residual structure where the shortcut connections are between the thin bottleneck layers. The intermediate expansion layer uses lightweight depthwise convolutions to filter features as a source of non-linearity. Additionally, we find that it is important to remove non-linearities in the narrow layers in order to maintain representational power. We demonstrate that this improves performance and provide an intuition that led to this design. Finally, our approach allows decoupling of the input/output domains from the expressiveness of the transformation, which provides a convenient framework for further analysis. We measure our performance on ImageNet [1] classification, COCO object detection [2], VOC image segmentation [3]. We evaluate the trade-offs between accuracy, and number of operations measured by multiply-adds (MAdd), as well as actual latency, and the number of parameters."} | ||||
| 103 | −{"work_id": 2999607073, "title": "Image Segmentation Using Deep Learning: A Survey", "abstract": "Image segmentation is a key task in computer vision and image processing with important applications such as scene understanding, medical image analysis, robotic perception, video surveillance, augmented reality, and image compression, among others, and numerous segmentation algorithms are found in the literature. Against this backdrop, the broad success of deep learning (DL) has prompted the development of new image segmentation approaches leveraging DL models. We provide a comprehensive review of this recent literature, covering the spectrum of pioneering efforts in semantic and instance segmentation, including convolutional pixel-labeling networks, encoder-decoder architectures, multiscale and pyramid-based approaches, recurrent networks, visual attention models, and generative models in adversarial settings. We investigate the relationships, strengths, and challenges of these DL-based segmentation models, examine the widely used datasets, compare performances, and discuss promising research directions."} | ||||
| 104 | −{"work_id": 4406918931, "title": "UAV swarms: research, challenges, and future directions", "abstract": "Abstract Unmanned Aerial Vehicle (UAV) swarms represent a transformative advancement in aerial robotics, leveraging collaborative autonomy to enhance operational capabilities. This paper provides a comprehensive exploration of UAV swarm infrastructure, recent research advancements, and diverse applications. Key areas such as coordinated path planning, task assignment, formation control, and security considerations are examined, highlighting how Artificial Intelligence (AI) and Machine Learning (ML) are integrated to improve decision-making and adaptability. Applications span civilian sectors, including entertainment, infrastructure inspection, and delivery services, as well as military applications in surveillance, combat support, and logistics. The paper addresses technical challenges, regulatory constraints, and ethical considerations, while outlining future directions focused on scalability, robustness, and societal integration. This review consolidates the evolving landscape of UAV swarms, identifying critical challenges and guiding future research endeavors."} | ||||
| 105 | −{"work_id": 2925329277, "title": "Control Barrier Functions: Theory and Applications", "abstract": "This paper provides an introduction and overview of recent work on control barrier functions and their use to verify and enforce safety properties in the context of (optimization based) safety-critical controllers. We survey the main technical results and discuss applications to several domains including robotic systems."} | ||||
| 106 | −{"work_id": 2978017171, "title": "DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lighter", "abstract": "As Transfer Learning from large-scale pre-trained models becomes more prevalent in Natural Language Processing (NLP), operating these large models in on-the-edge and/or under constrained computational training or inference budgets remains challenging. In this work, we propose a method to pre-train a smaller general-purpose language representation model, called DistilBERT, which can then be fine-tuned with good performances on a wide range of tasks like its larger counterparts. While most prior work investigated the use of distillation for building task-specific models, we leverage knowledge distillation during the pre-training phase and show that it is possible to reduce the size of a BERT model by 40%, while retaining 97% of its language understanding capabilities and being 60% faster. To leverage the inductive biases learned by larger models during pre-training, we introduce a triple loss combining language modeling, distillation and cosine-distance losses. Our smaller, faster and lighter model is cheaper to pre-train and we demonstrate its capabilities for on-device computations in a proof-of-concept experiment and a comparative on-device study."} | ||||
| 107 | −{"work_id": 3156636935, "title": "SimCSE: Simple Contrastive Learning of Sentence Embeddings", "abstract": "This paper presents SimCSE, a simple contrastive learning framework that greatly advances the state-of-the-art sentence embeddings.We first describe an unsupervised approach, which takes an input sentence and predicts itself in a contrastive objective, with only standard dropout used as noise.This simple method works surprisingly well, performing on par with previous supervised counterparts.We find that dropout acts as minimal data augmentation and removing it leads to a representation collapse.Then, we propose a supervised approach, which incorporates annotated pairs from natural language inference datasets into our contrastive learning framework, by using \"entailment\" pairs as positives and \"contradiction\" pairs as hard negatives.We evaluate SimCSE on standard semantic textual similarity (STS) tasks, and our unsupervised and supervised models using BERT base achieve an average of 76.3% and 81.6% Spearman's correlation respectively, a 4.2% and 2.2% improvement compared to previous best results.We also show-both theoretically and empirically-that contrastive learning objective regularizes pre-trained embeddings' anisotropic space to be more uniform, and it better aligns positive pairs when supervised signals are available.1"} | ||||
| 108 | −{"work_id": 4391109864, "title": "Segment anything in medical images", "abstract": "Medical image segmentation is a critical component in clinical practice, facilitating accurate diagnosis, treatment planning, and disease monitoring. However, existing methods, often tailored to specific modalities or disease types, lack generalizability across the diverse spectrum of medical image segmentation tasks. Here we present MedSAM, a foundation model designed for bridging this gap by enabling universal medical image segmentation. The model is developed on a large-scale medical image dataset with 1,570,263 image-mask pairs, covering 10 imaging modalities and over 30 cancer types. We conduct a comprehensive evaluation on 86 internal validation tasks and 60 external validation tasks, demonstrating better accuracy and robustness than modality-wise specialist models. By delivering accurate and efficient segmentation across a wide spectrum of tasks, MedSAM holds significant potential to expedite the evolution of diagnostic tools and the personalization of treatment plans."} | ||||
| 109 | −{"work_id": 2962866211, "title": "Supervised Speech Separation Based on Deep Learning: An Overview", "abstract": "Speech separation is the task of separating target speech from background interference. Traditionally, speech separation is studied as a signal processing problem. A more recent approach formulates speech separation as a supervised learning problem, where the discriminative patterns of speech, speakers, and background noise are learned from training data. Over the past decade, many supervised separation algorithms have been put forward. In particular, the recent introduction of deep learning to supervised speech separation has dramatically accelerated progress and boosted separation performance. This paper provides a comprehensive overview of the research on deep learning based supervised speech separation in the last several years. We first introduce the background of speech separation and the formulation of supervised separation. Then, we discuss three main components of supervised separation: learning machines, training targets, and acoustic features. Much of the overview is on separation algorithms where we review monaural methods, including speech enhancement (speech-nonspeech separation), speaker separation (multitalker separation), and speech dereverberation, as well as multimicrophone techniques. The important issue of generalization, unique to supervised learning, is discussed. This overview provides a historical perspective on how advances are made. In addition, we discuss a number of conceptual issues, including what constitutes the target source."} | ||||
| 110 | −{"work_id": 4221151978, "title": "Instant neural graphics primitives with a multiresolution hash encoding", "abstract": "Neural graphics primitives, parameterized by fully connected neural networks, can be costly to train and evaluate. We reduce this cost with a versatile new input encoding that permits the use of a smaller network without sacrificing quality, thus significantly reducing the number of floating point and memory access operations: a small neural network is augmented by a multiresolution hash table of trainable feature vectors whose values are optimized through stochastic gradient descent. The multiresolution structure allows the network to disambiguate hash collisions, making for a simple architecture that is trivial to parallelize on modern GPUs. We leverage this parallelism by implementing the whole system using fully-fused CUDA kernels with a focus on minimizing wasted bandwidth and compute operations. We achieve a combined speedup of several orders of magnitude, enabling training of high-quality neural graphics primitives in a matter of seconds, and rendering in tens of milliseconds at a resolution of 1920\u00d71080."} | ||||
| 111 | −{"work_id": 2904367110, "title": "A Style-Based Generator Architecture for Generative Adversarial Networks", "abstract": "We propose an alternative generator architecture for generative adversarial networks, borrowing from style transfer literature. The new architecture leads to an automatically learned, unsupervised separation of high-level attributes (e.g., pose and identity when trained on human faces) and stochastic variation in the generated images (e.g., freckles, hair), and it enables intuitive, scale-specific control of the synthesis. The new generator improves the state-of-the-art in terms of traditional distribution quality metrics, leads to demonstrably better interpolation properties, and also better disentangles the latent factors of variation. To quantify interpolation quality and disentanglement, we propose two new, automated methods that are applicable to any generator architecture. Finally, we introduce a new, highly varied and high-quality dataset of human faces."} | ||||
| 112 | {"work_id": 4390723081, "title": "A Survey on 3D Gaussian Splatting", "abstract": "3D Gaussian splatting (GS) has emerged as a transformative technique in radiance fields. Unlike mainstream implicit neural models, 3D GS uses millions of learnable 3D Gaussians for an explicit scene representation. Paired with a differentiable rendering algorithm, this approach achieves real-time rendering and unprecedented editability, making it a potential game-changer for 3D reconstruction and representation. In the present article, we provide the first systematic overview of the recent developments and critical contributions in 3D GS. We begin with a detailed exploration of the underlying principles and the driving forces behind the emergence of 3D GS, laying the groundwork for understanding its significance. A focal point of our discussion is the practical applicability of 3D GS. By enabling unprecedented rendering speed, 3D GS opens up a plethora of applications, ranging from virtual reality to interactive media and beyond. This is complemented by a comparative analysis of leading 3D GS models, evaluated across various benchmark tasks to highlight their performance and practical utility. The survey concludes by identifying current challenges and suggesting potential avenues for future research. Through this survey, we aim to provide a valuable resource for both newcomers and seasoned researchers, fostering further exploration and advancement in explicit radiance field."} | 80 | {"work_id": 4390723081, "title": "A Survey on 3D Gaussian Splatting", "abstract": "3D Gaussian splatting (GS) has emerged as a transformative technique in radiance fields. Unlike mainstream implicit neural models, 3D GS uses millions of learnable 3D Gaussians for an explicit scene representation. Paired with a differentiable rendering algorithm, this approach achieves real-time rendering and unprecedented editability, making it a potential game-changer for 3D reconstruction and representation. In the present article, we provide the first systematic overview of the recent developments and critical contributions in 3D GS. We begin with a detailed exploration of the underlying principles and the driving forces behind the emergence of 3D GS, laying the groundwork for understanding its significance. A focal point of our discussion is the practical applicability of 3D GS. By enabling unprecedented rendering speed, 3D GS opens up a plethora of applications, ranging from virtual reality to interactive media and beyond. This is complemented by a comparative analysis of leading 3D GS models, evaluated across various benchmark tasks to highlight their performance and practical utility. The survey concludes by identifying current challenges and suggesting potential avenues for future research. Through this survey, we aim to provide a valuable resource for both newcomers and seasoned researchers, fostering further exploration and advancement in explicit radiance field."} | ||
| 113 | {"work_id": 4323572061, "title": "PaLM-E: An Embodied Multimodal Language Model", "abstract": "Large language models excel at a wide range of complex tasks. However, enabling general inference in the real world, e.g., for robotics problems, raises the challenge of grounding. We propose embodied language models to directly incorporate real-world continuous sensor modalities into language models and thereby establish the link between words and percepts. Input to our embodied language model are multi-modal sentences that interleave visual, continuous state estimation, and textual input encodings. We train these encodings end-to-end, in conjunction with a pre-trained large language model, for multiple embodied tasks including sequential robotic manipulation planning, visual question answering, and captioning. Our evaluations show that PaLM-E, a single large embodied multimodal model, can address a variety of embodied reasoning tasks, from a variety of observation modalities, on multiple embodiments, and further, exhibits positive transfer: the model benefits from diverse joint training across internet-scale language, vision, and visual-language domains. Our largest model, PaLM-E-562B with 562B parameters, in addition to being trained on robotics tasks, is a visual-language generalist with state-of-the-art performance on OK-VQA, and retains generalist language capabilities with increasing scale."} | 81 | {"work_id": 4323572061, "title": "PaLM-E: An Embodied Multimodal Language Model", "abstract": "Large language models excel at a wide range of complex tasks. However, enabling general inference in the real world, e.g., for robotics problems, raises the challenge of grounding. We propose embodied language models to directly incorporate real-world continuous sensor modalities into language models and thereby establish the link between words and percepts. Input to our embodied language model are multi-modal sentences that interleave visual, continuous state estimation, and textual input encodings. We train these encodings end-to-end, in conjunction with a pre-trained large language model, for multiple embodied tasks including sequential robotic manipulation planning, visual question answering, and captioning. Our evaluations show that PaLM-E, a single large embodied multimodal model, can address a variety of embodied reasoning tasks, from a variety of observation modalities, on multiple embodiments, and further, exhibits positive transfer: the model benefits from diverse joint training across internet-scale language, vision, and visual-language domains. Our largest model, PaLM-E-562B with 562B parameters, in addition to being trained on robotics tasks, is a visual-language generalist with state-of-the-art performance on OK-VQA, and retains generalist language capabilities with increasing scale."} | ||
| 114 | {"work_id": 3196350727, "title": "HISTORIAE, History of Socio-Cultural Transformation as Linguistic Data Science. A Humanities Use Case", "abstract": "The paper proposes an interdisciplinary approach including methods from disciplines such as history of concepts, linguistics, natural language processing (NLP) and Semantic Web, to create a comparative framework for detecting semantic change in multilingual historical corpora and generating diachronic ontologies as linguistic linked open data (LLOD). Initiated as a use case (UC4.2.1) within the COST Action Nexus Linguarum, European network for Web-centred linguistic data science, the study will explore emerging trends in knowledge extraction, analysis and representation from linguistic data science, and apply the devised methodology to datasets in the humanities to trace the evolution of concepts from the domain of socio-cultural transformation. The paper will describe the main elements of the methodological framework and preliminary planning of the intended workflow."} | 82 | {"work_id": 3196350727, "title": "HISTORIAE, History of Socio-Cultural Transformation as Linguistic Data Science. A Humanities Use Case", "abstract": "The paper proposes an interdisciplinary approach including methods from disciplines such as history of concepts, linguistics, natural language processing (NLP) and Semantic Web, to create a comparative framework for detecting semantic change in multilingual historical corpora and generating diachronic ontologies as linguistic linked open data (LLOD). Initiated as a use case (UC4.2.1) within the COST Action Nexus Linguarum, European network for Web-centred linguistic data science, the study will explore emerging trends in knowledge extraction, analysis and representation from linguistic data science, and apply the devised methodology to datasets in the humanities to trace the evolution of concepts from the domain of socio-cultural transformation. The paper will describe the main elements of the methodological framework and preliminary planning of the intended workflow."} | ||
@@ -121,28 +89,78 @@ | |||||
| 121 | {"work_id": 2990747716, "title": "Learning dexterous in-hand manipulation", "abstract": "We use reinforcement learning (RL) to learn dexterous in-hand manipulation policies that can perform vision-based object reorientation on a physical Shadow Dexterous Hand. The training is performed in a simulated environment in which we randomize many of the physical properties of the system such as friction coefficients and an object\u2019s appearance. Our policies transfer to the physical robot despite being trained entirely in simulation. Our method does not rely on any human demonstrations, but many behaviors found in human manipulation emerge naturally, including finger gaiting, multi-finger coordination, and the controlled use of gravity. Our results were obtained using the same distributed RL system that was used to train OpenAI Five. We also include a video of our results: https://youtu.be/jwSbzNHGflM ."} | 89 | {"work_id": 2990747716, "title": "Learning dexterous in-hand manipulation", "abstract": "We use reinforcement learning (RL) to learn dexterous in-hand manipulation policies that can perform vision-based object reorientation on a physical Shadow Dexterous Hand. The training is performed in a simulated environment in which we randomize many of the physical properties of the system such as friction coefficients and an object\u2019s appearance. Our policies transfer to the physical robot despite being trained entirely in simulation. Our method does not rely on any human demonstrations, but many behaviors found in human manipulation emerge naturally, including finger gaiting, multi-finger coordination, and the controlled use of gravity. Our results were obtained using the same distributed RL system that was used to train OpenAI Five. We also include a video of our results: https://youtu.be/jwSbzNHGflM ."} | ||
| 122 | {"work_id": 4312443924, "title": "A ConvNet for the 2020s", "abstract": "The \u201cRoaring 20s\u201d of visual recognition began with the introduction of Vision Transformers (ViTs), which quickly superseded ConvNets as the state-of-the-art image classification model. A vanilla ViT, on the other hand, faces difficulties when applied to general computer vision tasks such as object detection and semantic segmentation. It is the hierarchical Transformers (e.g., Swin Transformers) that reintroduced several ConvNet priors, making Transformers practically viable as a generic vision backbone and demonstrating remarkable performance on a wide variety of vision tasks. However, the effectiveness of such hybrid approaches is still largely credited to the intrinsic superiority of Transformers, rather than the inherent inductive biases of convolutions. In this work, we reexamine the design spaces and test the limits of what a pure ConvNet can achieve. We gradually \u201cmodernize\u201d a standard ResNet toward the design of a vision Transformer, and discover several key components that contribute to the performance difference along the way. The outcome of this exploration is a family of pure ConvNet models dubbed ConvNeXt. Constructed entirely from standard ConvNet modules, ConvNeXts compete favorably with Transformers in terms of accuracy and scalability, achieving 87.8% ImageNet top-1 accuracy and outperforming Swin Transformers on COCO detection and ADE20K segmentation, while maintaining the simplicity and efficiency of standard ConvNets."} | 90 | {"work_id": 4312443924, "title": "A ConvNet for the 2020s", "abstract": "The \u201cRoaring 20s\u201d of visual recognition began with the introduction of Vision Transformers (ViTs), which quickly superseded ConvNets as the state-of-the-art image classification model. A vanilla ViT, on the other hand, faces difficulties when applied to general computer vision tasks such as object detection and semantic segmentation. It is the hierarchical Transformers (e.g., Swin Transformers) that reintroduced several ConvNet priors, making Transformers practically viable as a generic vision backbone and demonstrating remarkable performance on a wide variety of vision tasks. However, the effectiveness of such hybrid approaches is still largely credited to the intrinsic superiority of Transformers, rather than the inherent inductive biases of convolutions. In this work, we reexamine the design spaces and test the limits of what a pure ConvNet can achieve. We gradually \u201cmodernize\u201d a standard ResNet toward the design of a vision Transformer, and discover several key components that contribute to the performance difference along the way. The outcome of this exploration is a family of pure ConvNet models dubbed ConvNeXt. Constructed entirely from standard ConvNet modules, ConvNeXts compete favorably with Transformers in terms of accuracy and scalability, achieving 87.8% ImageNet top-1 accuracy and outperforming Swin Transformers on COCO detection and ADE20K segmentation, while maintaining the simplicity and efficiency of standard ConvNets."} | ||
| 123 | {"work_id": 2962730651, "title": "OpenPose: Realtime Multi-Person 2D Pose Estimation Using Part Affinity Fields", "abstract": "Realtime multi-person 2D pose estimation is a key component in enabling machines to have an understanding of people in images and videos. In this work, we present a realtime approach to detect the 2D pose of multiple people in an image. The proposed method uses a nonparametric representation, which we refer to as Part Affinity Fields (PAFs), to learn to associate body parts with individuals in the image. This bottom-up system achieves high accuracy and realtime performance, regardless of the number of people in the image. In previous work, PAFs and body part location estimation were refined simultaneously across training stages. We demonstrate that a PAF-only refinement rather than both PAF and body part location refinement results in a substantial increase in both runtime performance and accuracy. We also present the first combined body and foot keypoint detector, based on an internal annotated foot dataset that we have publicly released. We show that the combined detector not only reduces the inference time compared to running them sequentially, but also maintains the accuracy of each component individually. This work has culminated in the release of OpenPose, the first open-source realtime system for multi-person 2D pose detection, including body, foot, hand, and facial keypoints."} | 91 | {"work_id": 2962730651, "title": "OpenPose: Realtime Multi-Person 2D Pose Estimation Using Part Affinity Fields", "abstract": "Realtime multi-person 2D pose estimation is a key component in enabling machines to have an understanding of people in images and videos. In this work, we present a realtime approach to detect the 2D pose of multiple people in an image. The proposed method uses a nonparametric representation, which we refer to as Part Affinity Fields (PAFs), to learn to associate body parts with individuals in the image. This bottom-up system achieves high accuracy and realtime performance, regardless of the number of people in the image. In previous work, PAFs and body part location estimation were refined simultaneously across training stages. We demonstrate that a PAF-only refinement rather than both PAF and body part location refinement results in a substantial increase in both runtime performance and accuracy. We also present the first combined body and foot keypoint detector, based on an internal annotated foot dataset that we have publicly released. We show that the combined detector not only reduces the inference time compared to running them sequentially, but also maintains the accuracy of each component individually. This work has culminated in the release of OpenPose, the first open-source realtime system for multi-person 2D pose detection, including body, foot, hand, and facial keypoints."} | ||
| 124 | −{"work_id": 4286221734, "title": "Human-computer interaction", "abstract": "This study aims to understand the potential of evolving technology to spark inspiration and provide a solution to creative blocks for artists and acting as a catalyst for designers in the ideation stage of design. Specifically, this project evaluates a method delivered through a prototype designed to provide artists with intelligent choices from augmented visual data. Ambiguity and abstraction were carefully used as techniques to initiate subconscious ideation in response to visual media, opening the door to the realm of creativity. This study conducts two rounds of interviews to design and evaluate a method that uses these visual techniques. The data collected from these two rounds of interviews indicates the Squiggle tool effectively inspired the creation of new ideas and assisted in reducing creative blocks by presenting users with abstract visual design choices. This indicates a promising potential with this method, which is to strategically utilize ambiguity and abstraction, like the prototype instanced in this study, to remedy creative blocks and inspire creativity for artists and designers."} | ||||
| 125 | {"work_id": 3119786062, "title": "An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale", "abstract": "While the Transformer architecture has become the de-facto standard for natural language processing tasks, its applications to computer vision remain limited. In vision, attention is either applied in conjunction with convolutional networks, or used to replace certain components of convolutional networks while keeping their overall structure in place. We show that this reliance on CNNs is not necessary and a pure transformer applied directly to sequences of image patches can perform very well on image classification tasks. When pre-trained on large amounts of data and transferred to multiple mid-sized or small image recognition benchmarks (ImageNet, CIFAR-100, VTAB, etc.), Vision Transformer (ViT) attains excellent results compared to state-of-the-art convolutional networks while requiring substantially fewer computational resources to train."} | 92 | {"work_id": 3119786062, "title": "An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale", "abstract": "While the Transformer architecture has become the de-facto standard for natural language processing tasks, its applications to computer vision remain limited. In vision, attention is either applied in conjunction with convolutional networks, or used to replace certain components of convolutional networks while keeping their overall structure in place. We show that this reliance on CNNs is not necessary and a pure transformer applied directly to sequences of image patches can perform very well on image classification tasks. When pre-trained on large amounts of data and transferred to multiple mid-sized or small image recognition benchmarks (ImageNet, CIFAR-100, VTAB, etc.), Vision Transformer (ViT) attains excellent results compared to state-of-the-art convolutional networks while requiring substantially fewer computational resources to train."} | ||
| 126 | {"work_id": 4406417959, "title": "Neural Codec Language Models are Zero-Shot Text to Speech Synthesizers", "abstract": "We introduce a language modeling approach for text to speech synthesis (TTS). Specifically, we train aneural codec language model(calledVALL-E) using discrete codes derived from an off-the-shelf neural audio codec model, and regard TTS as a conditional language modeling task rather than continuous signal regression as in previous work. During the pre-training stage, we scale up the TTS training data to 50 k hours of English speech which is hundreds of times larger than existing systems.VALL-Eemergesin-context learningcapability and can be used to synthesize high-quality personalized speech with only a 3-second enrolled recording of an unseen speaker as a prompt. Experiment results show thatVALL-Esignificantly outperforms the state-of-the-art zero-shot TTS system in terms of speech naturalness and speaker similarity. In addition, we findVALL-Ecould preserve the speaker's emotion and acoustic environment from the prompt in synthesis."} | 93 | {"work_id": 4406417959, "title": "Neural Codec Language Models are Zero-Shot Text to Speech Synthesizers", "abstract": "We introduce a language modeling approach for text to speech synthesis (TTS). Specifically, we train aneural codec language model(calledVALL-E) using discrete codes derived from an off-the-shelf neural audio codec model, and regard TTS as a conditional language modeling task rather than continuous signal regression as in previous work. During the pre-training stage, we scale up the TTS training data to 50 k hours of English speech which is hundreds of times larger than existing systems.VALL-Eemergesin-context learningcapability and can be used to synthesize high-quality personalized speech with only a 3-second enrolled recording of an unseen speaker as a prompt. Experiment results show thatVALL-Esignificantly outperforms the state-of-the-art zero-shot TTS system in terms of speech naturalness and speaker similarity. In addition, we findVALL-Ecould preserve the speaker's emotion and acoustic environment from the prompt in synthesis."} | ||
| 127 | −{"work_id": 4200150166, "title": "NeRF", "abstract": "We present a method that achieves state-of-the-art results for synthesizing novel views of complex scenes by optimizing an underlying continuous volumetric scene function using a sparse set of input views. Our algorithm represents a scene using a fully connected (nonconvolutional) deep network, whose input is a single continuous 5D coordinate (spatial location ( x , y , z ) and viewing direction ( \u03b8, \u03d5 )) and whose output is the volume density and view-dependent emitted radiance at that spatial location. We synthesize views by querying 5D coordinates along camera rays and use classic volume rendering techniques to project the output colors and densities into an image. Because volume rendering is naturally differentiable, the only input required to optimize our representation is a set of images with known camera poses. We describe how to effectively optimize neural radiance fields to render photorealistic novel views of scenes with complicated geometry and appearance, and demonstrate results that outperform prior work on neural rendering and view synthesis."} | ||||
| 128 | {"work_id": 4398796510, "title": "A Survey on Vision--Language--Action Models for Embodied AI", "abstract": "Embodied AI is widely recognized as a cornerstone of artificial general intelligence (AGI) because it involves controlling embodied agents to perform tasks in the physical world. Building on the success of large language models (LLMs) and vision-language models (VLMs), a new category of multimodal models-referred to as vision-language-action (VLA) models-has emerged to address language-conditioned robotic tasks in embodied AI by leveraging their distinct ability to generate actions. The recent proliferation of VLAs necessitates a comprehensive survey to capture the rapidly evolving landscape. To this end, we present the first survey on VLAs for embodied AI. This work provides a detailed taxonomy of VLAs, organized into three major lines of research. The first line focuses on individual components of VLAs. The second line is dedicated to developing VLA-based control policies adept at predicting low-level actions. The third line comprises high-level task planners capable of decomposing long-horizon tasks into a sequence of subtasks, thereby guiding VLAs to follow more general user instructions. Furthermore, we provide an extensive summary of relevant resources, including datasets, simulators, and benchmarks. Finally, we discuss the challenges facing VLAs and outline promising future directions in embodied AI. A curated repository associated with this survey is available at: https://github.com/yueen-ma/Awesome-VLA."} | 94 | {"work_id": 4398796510, "title": "A Survey on Vision--Language--Action Models for Embodied AI", "abstract": "Embodied AI is widely recognized as a cornerstone of artificial general intelligence (AGI) because it involves controlling embodied agents to perform tasks in the physical world. Building on the success of large language models (LLMs) and vision-language models (VLMs), a new category of multimodal models-referred to as vision-language-action (VLA) models-has emerged to address language-conditioned robotic tasks in embodied AI by leveraging their distinct ability to generate actions. The recent proliferation of VLAs necessitates a comprehensive survey to capture the rapidly evolving landscape. To this end, we present the first survey on VLAs for embodied AI. This work provides a detailed taxonomy of VLAs, organized into three major lines of research. The first line focuses on individual components of VLAs. The second line is dedicated to developing VLA-based control policies adept at predicting low-level actions. The third line comprises high-level task planners capable of decomposing long-horizon tasks into a sequence of subtasks, thereby guiding VLAs to follow more general user instructions. Furthermore, we provide an extensive summary of relevant resources, including datasets, simulators, and benchmarks. Finally, we discuss the challenges facing VLAs and outline promising future directions in embodied AI. A curated repository associated with this survey is available at: https://github.com/yueen-ma/Awesome-VLA."} | ||
| 129 | −{"work_id": 2986023562, "title": "Mitsuba 2", "abstract": "Modern rendering systems are confronted with a dauntingly large and growing set of requirements: in their pursuit of realism, physically based techniques must increasingly account for intricate properties of light, such as its spectral composition or polarization. To reduce prohibitive rendering times, vectorized renderers exploit coherence via instruction-level parallelism on CPUs and GPUs. Differentiable rendering algorithms propagate derivatives through a simulation to optimize an objective function, e.g., to reconstruct a scene from reference images. Catering to such diverse use cases is challenging and has led to numerous purpose-built systems---partly, because retrofitting features of this complexity onto an existing renderer involves an error-prone and infeasibly intrusive transformation of elementary data structures, interfaces between components, and their implementations (in other words, everything). We propose Mitsuba 2, a versatile renderer that is intrinsically retargetable to various applications including the ones listed above. Mitsuba 2 is implemented in modern C++ and leverages template metaprogramming to replace types and instrument the control flow of components such as BSDFs, volumes, emitters, and rendering algorithms. At compile time, it automatically transforms arithmetic, data structures, and function dispatch, turning generic algorithms into a variety of efficient implementations without the tedium of manual redesign. Possible transformations include changing the representation of color, generating a \"wide\" renderer that operates on bundles of light paths, just-in-time compilation to create computational kernels that run on the GPU, and forward/reverse-mode automatic differentiation. Transformations can be chained, which further enriches the space of algorithms derived from a single generic implementation. We demonstrate the effectiveness and simplicity of our approach on several applications that would be very challenging to create without assistance: a rendering algorithm based on coherent MCMC exploration, a caustic design method for gradient-index optics, and a technique for reconstructing heterogeneous media in the presence of multiple scattering."} | 95 | +{"work_id": 4320002812, "title": "Object Detection in 20 Years: A Survey", "abstract": "Object detection, as of one the most fundamental and challenging problems in computer vision, has received great attention in recent years. Over the past two decades, we have seen a rapid technological evolution of object detection and its profound impact on the entire computer vision field. If we consider today\u2019s object detection technique as a revolution driven by deep learning, then, back in the 1990s, we would see the ingenious thinking and long-term perspective design of early computer vision. This article extensively reviews this fast-moving research field in the light of technical evolution, spanning over a quarter-century\u2019s time (from the 1990s to 2022). A number of topics have been covered in this article, including the milestone detectors in history, detection datasets, metrics, fundamental building blocks of the detection system, speedup techniques, and recent state-of-the-art detection methods."} | ||
| 96 | +{"work_id": 2798812533, "title": "Universal Language Model Fine-tuning for Text Classification", "abstract": "Inductive transfer learning has greatly impacted computer vision, but existing approaches in NLP still require task-specific modifications and training from scratch.We propose Universal Language Model Fine-tuning (ULMFiT), an effective transfer learning method that can be applied to any task in NLP, and introduce techniques that are key for fine-tuning a language model.Our method significantly outperforms the state-of-the-art on six text classification tasks, reducing the error by 18-24% on the majority of datasets.Furthermore, with only 100 labeled examples, it matches the performance of training from scratch on 100\u00d7 more data.We opensource our pretrained models and code 1 ."} | ||||
| 97 | +{"work_id": 4372266552, "title": "CLAP Learning Audio Concepts from Natural Language Supervision", "abstract": "Mainstream machine listening models are trained to learn audio concepts under the paradigm of one class label to many recordings focusing on one task. Learning under such restricted supervision limits the flexibility of models because they require labeled audio for training and can only predict the predefined categories. Instead, we propose to learn audio concepts from natural language supervision. We call our approach Contrastive Language-Audio Pretraining (CLAP), which connects language and audio by using two encoders and a contrastive learning objective, bringing audio and text descriptions into a joint multimodal space. We trained CLAP with 128k audio and text pairs and evaluated it on 16 downstream tasks across 7 domains, such as classification of sound events, scenes, music, and speech. CLAP establishes state-of-the-art (SoTA) in Zero-Shot performance. Also, we evaluated CLAP\u2019s audio encoder in a supervised learning setup and achieved SoTA in 5 tasks. The Zero-Shot capability removes the need of training with class labeled audio, enables flexible class prediction at inference time, and generalizes well in multiple downstream tasks. Code is available at: https://github.com/microsoft/CLAP."} | ||||
| 98 | +{"work_id": 4385482704, "title": "Photo tourism: exploring photo collections in 3D", "abstract": "We present a system for interactively browsing and exploring large unstructured collections of photographs of a scene using a novel 3D interface. Our system consists of an image-based modeling front end that automatically computes the viewpoint of each photograph as well as a sparse 3D model of the scene and image to model correspondences. Our photo explorer uses image-based rendering techniques to smoothly transition between photographs, while also enabling full 3D navigation and exploration of the set of images and world geometry, along with auxiliary information such as overhead maps. Our system also makes it easy to construct photo tours of scenic or historic locations, and to annotate image details, which are automatically transferred to other relevant images. We demonstrate our system on several large personal photo collections as well as images gathered from Internet photo sharing sites."} | ||||
| 99 | +{"work_id": 2308543850, "title": "Scene-motion- and latency-perception thresholds for head-mounted displays", "abstract": "A fundamental task of an immersive virtual environment (IVE) system is to present images of the virtual world that change appropriately as the user's head moves. Current IVE systems, especially those using head-mounted displays (HMDs), often produce spatially unstable scenes, resulting in simulator sickness, degraded task performance, degraded visual acuity, and breaks in presence. In HMDs, instability resulting from latency is greater than all other causes of instability combined. The primary way users perceive latency in an HMD is by improper motion of scenes that should be stationary in the world. Whereas latency-induced scene motion is well defined mathematically, less is understood about how much scene motion and/or latency can occur without subjects noticing, and how this varies under different conditions. I built a simulated HMD system with zero effective latency---no scene motion occurs due to latency. I intentionally and artificially inserted scene motion into the virtual environment in order to determine how much scene motion and/or latency can occur without subjects noticing. I measured perceptual thresholds of scene-motion and latency under different conditions across five experiments. Based on the study of latency, head motion, scene motion, and perceptual thresholds, I developed a mathematical model of latency thresholds as an inverse function of peak head-yaw acceleration. Psychophysics studies showed that measured latency thresholds correlate with this inverse function better than with a linear function. The work reported here readily enables scientists and engineers to, under their particular conditions, measure latency thresholds as a function of head motion by using an off-the-shelf projector system. Latency requirements can thus be determined before designing HMD systems."} | ||||
| 100 | +{"work_id": 4386076325, "title": "YOLOv7: Trainable Bag-of-Freebies Sets New State-of-the-Art for Real-Time Object Detectors", "abstract": "Real-time object detection is one of the most important research topics in computer vision. As new approaches regarding architecture optimization and training optimization are continually being developed, we have found two research topics that have spawned when dealing with these latest state-of-the-art methods. To address the topics, we propose a trainable bag-of-freebies oriented solution. We combine the flexible and efficient training tools with the proposed architecture and the compound scaling method. YOLOv7 surpasses all known object detectors in both speed and accuracy in the range from 5 FPS to 120 FPS and has the highest accuracy 56.8% AP among all known real-time object detectors with 30 FPS or higher on GPU V100. Source code is released in https://github.com/WongKinYiu/yolov7."} | ||||
| 101 | +{"work_id": 4206484811, "title": "A Metaverse: Taxonomy, Components, Applications, and Open Challenges", "abstract": "Unlike previous studies on the Metaverse based on Second Life, the current Metaverse is based on the social value of Generation Z that online and offline selves are not different. With the technological development of deep learning-based high-precision recognition models and natural generation models, Metaverse is being strengthened with various factors, from mobile-based always-on access to connectivity with reality using virtual currency. The integration of enhanced social activities and neural-net methods requires a new definition of Metaverse suitable for the present, different from the previous Metaverse. This paper divides the concepts and essential techniques necessary for realizing the Metaverse into three components (i.e., hardware, software, and contents) and three approaches (i.e., user interaction, implementation, and application) rather than marketing or hardware approach to conduct a comprehensive analysis. Furthermore, we describe essential methods based on three components and techniques to Metaverse\u2019s representative Ready Player One, Roblox, and Facebook research in the domain of films, games, and studies. Finally, we summarize the limitations and directions for implementing the immersive Metaverse as social influences, constraints, and open challenges."} | ||||
| 102 | +{"work_id": 2884367402, "title": "Object Detection With Deep Learning: A Review", "abstract": "Due to object detection's close relationship with video analysis and image understanding, it has attracted much research attention in recent years. Traditional object detection methods are built on handcrafted features and shallow trainable architectures. Their performance easily stagnates by constructing complex ensembles that combine multiple low-level image features with high-level context from object detectors and scene classifiers. With the rapid development in deep learning, more powerful tools, which are able to learn semantic, high-level, deeper features, are introduced to address the problems existing in traditional architectures. These models behave differently in network architecture, training strategy, and optimization function. In this paper, we provide a review of deep learning-based object detection frameworks. Our review begins with a brief introduction on the history of deep learning and its representative tool, namely, the convolutional neural network. Then, we focus on typical generic object detection architectures along with some modifications and useful tricks to improve detection performance further. As distinct specific detection tasks exhibit different characteristics, we also briefly survey several specific tasks, including salient object detection, face detection, and pedestrian detection. Experimental analyses are also provided to compare various methods and draw some meaningful conclusions. Finally, several promising directions and tasks are provided to serve as guidelines for future work in both object detection and relevant neural network-based learning systems."} | ||||
| 103 | +{"work_id": 4388823657, "title": "A Comprehensive Review of YOLO Architectures in Computer Vision: From YOLOv1 to YOLOv8 and YOLO-NAS", "abstract": "YOLO has become a central real-time object detection system for robotics, driverless cars, and video monitoring applications. We present a comprehensive analysis of YOLO\u2019s evolution, examining the innovations and contributions in each iteration from the original YOLO up to YOLOv8, YOLO-NAS, and YOLO with transformers. We start by describing the standard metrics and postprocessing; then, we discuss the major changes in network architecture and training tricks for each model. Finally, we summarize the essential lessons from YOLO\u2019s development and provide a perspective on its future, highlighting potential research directions to enhance real-time object detection systems."} | ||||
| 104 | +{"work_id": 4226069476, "title": "Masked-attention Mask Transformer for Universal Image Segmentation", "abstract": "Image segmentation groups pixels with different semantics, e.g., category or instance membership. Each choice of semantics defines a task. While only the semantics of each task differ, current research focuses on designing spe-cialized architectures for each task. We present Masked- attention Mask Transformer (Mask2Former), a new archi-tecture capable of addressing any image segmentation task (panoptic, instance or semantic). Its key components in-clude masked attention, which extracts localized features by constraining cross-attention within predicted mask regions. In addition to reducing the research effort by at least three times, it outperforms the best specialized architectures by a significant margin on four popular datasets. Most no-tably, Mask2Former sets a new state-of-the-art for panoptic segmentation (57.8 PQ on COCO), instance segmentation (50.1 AP on COCO) and semantic segmentation (57.7 mIoU onADE20K)."} | ||||
| 105 | +{"work_id": 4224035735, "title": "Hierarchical Text-Conditional Image Generation with CLIP Latents", "abstract": "Contrastive models like CLIP have been shown to learn robust representations of images that capture both semantics and style. To leverage these representations for image generation, we propose a two-stage model: a prior that generates a CLIP image embedding given a text caption, and a decoder that generates an image conditioned on the image embedding. We show that explicitly generating image representations improves image diversity with minimal loss in photorealism and caption similarity. Our decoders conditioned on image representations can also produce variations of an image that preserve both its semantics and style, while varying the non-essential details absent from the image representation. Moreover, the joint embedding space of CLIP enables language-guided image manipulations in a zero-shot fashion. We use diffusion models for the decoder and experiment with both autoregressive and diffusion models for the prior, finding that the latter are computationally more efficient and produce higher-quality samples."} | ||||
| 106 | +{"work_id": 4402660132, "title": "Spacetime Gaussian Feature Splatting for Real-Time Dynamic View Synthesis", "abstract": "Novel view synthesis of dynamic scenes has been an intriguing yet challenging problem. Despite recent advancements, simultaneously achieving high-resolution photorealistic results, real-time rendering, and compact storage remains a formidable task. To address these challenges, we propose Spacetime Gaussian Feature Splatting as a novel dynamic scene representation, composed of three pivotal components. First, we formulate expressive Spacetime Gaussians by enhancing 3D Gaussians with temporal opacity and parametric motion/rotation. This enables Space-time Gaussians to capture static, dynamic, as well as transient content within a scene. Second, we introduce splatted feature rendering, which replaces spherical harmonics with neural features. These features facilitate the modeling of view- and time-dependent appearance while maintaining small size. Third, we leverage the guidance of training error and coarse depth to sample new Gaussians in areas that are challenging to converge with existing pipelines. Experiments on several established real-world datasets demonstrate that our method achieves state-of-the-art rendering quality and speed, while retaining compact storage. At 8K resolution, our lite-version model can render at 60 FPS on an Nvidia RTX 4090 GPU."} | ||||
| 107 | +{"work_id": 2963188159, "title": "PoseCNN: A Convolutional Neural Network for 6D Object Pose Estimation in Cluttered Scenes", "abstract": "Estimating the 6D pose of known objects is important for robots to interact with the real world.The problem is challenging due to the variety of objects as well as the complexity of a scene caused by clutter and occlusions between objects.In this work, we introduce PoseCNN, a new Convolutional Neural Network for 6D object pose estimation.PoseCNN estimates the 3D translation of an object by localizing its center in the image and predicting its distance from the camera.The 3D rotation of the object is estimated by regressing to a quaternion representation.We also introduce a novel loss function that enables PoseCNN to handle symmetric objects.In addition, we contribute a large scale video dataset for 6D object pose estimation named the YCB-Video dataset.Our dataset provides accurate 6D poses of 21 objects from the YCB dataset observed in 92 videos with 133,827 frames.We conduct extensive experiments on our YCB-Video dataset and the OccludedLINEMOD dataset to show that PoseCNN is highly robust to occlusions, can handle symmetric objects, and provide accurate pose estimation using only color images as input.When using depth data to further refine the poses, our approach achieves state-of-the-art results on the challenging OccludedLINEMOD dataset."} | ||||
| 108 | +{"work_id": 4385289063, "title": "MERF: Memory-Efficient Radiance Fields for Real-time View Synthesis in Unbounded Scenes", "abstract": "Neural radiance fields enable state-of-the-art photorealistic view synthesis. However, existing radiance field representations are either too compute-intensive for real-time rendering or require too much memory to scale to large scenes. We present a Memory-Efficient Radiance Field (MERF) representation that achieves real-time rendering of large-scale scenes in a browser. MERF reduces the memory consumption of prior sparse volumetric radiance fields using a combination of a sparse feature grid and high-resolution 2D feature planes. To support large-scale unbounded scenes, we introduce a novel contraction function that maps scene coordinates into a bounded volume while still allowing for efficient ray-box intersection. We design a lossless procedure for baking the parameterization used during training into a model that achieves real-time rendering while still preserving the photorealistic view synthesis quality of a volumetric radiance field."} | ||||
| 109 | +{"work_id": 3003533476, "title": "Deep Reinforcement Learning for Autonomous Driving: A Survey", "abstract": "With the development of deep representation learning, the domain of reinforcement learning (RL) has become a powerful learning framework now capable of learning complex policies in high dimensional environments. This review summarises deep reinforcement learning (DRL) algorithms and provides a taxonomy of automated driving tasks where (D)RL methods have been employed, while addressing key computational challenges in real world deployment of autonomous driving agents. It also delineates adjacent domains such as behavior cloning, imitation learning, inverse reinforcement learning that are related but are not classical RL algorithms. The role of simulators in training agents, methods to validate, test and robustify existing solutions in RL are discussed."} | ||||
| 110 | +{"work_id": 2972333964, "title": "GELP: GAN-Excited Liner Prediction for Speech Synthesis from Mel-Spectrogram", "abstract": "Recent advances in neural network -based text-to-speech have reached human level naturalness in synthetic speech. The present sequence-to-sequence models can directly map text to mel-spectrogram acoustic features, which are convenient for modeling, but present additional challenges for vocoding (i.e., waveform generation from the acoustic features). Highquality synthesis can be achieved with neural vocoders, such as WaveNet, but such autoregressive models suffer from slow sequential inference. Meanwhile, their existing parallel inference counterparts are difficult to train and require increasingly large model sizes. In this paper, we propose an alternative training strategy for a parallel neural vocoder utilizing generative adversarial networks, and integrate a linear predictive synthesis filter into the model. Results show that the proposed model achieves significant improvement in inference speed, while outperforming a WaveNet in copy-synthesis quality."} | ||||
| 111 | +{"work_id": 2796347433, "title": "YOLOv3: An Incremental Improvement", "abstract": "We present some updates to YOLO! We made a bunch of little design changes to make it better. We also trained this new network that's pretty swell. It's a little bigger than last time but more accurate. It's still fast though, don't worry. At 320x320 YOLOv3 runs in 22 ms at 28.2 mAP, as accurate as SSD but three times faster. When we look at the old .5 IOU mAP detection metric YOLOv3 is quite good. It achieves 57.9 mAP@50 in 51 ms on a Titan X, compared to 57.5 mAP@50 in 198 ms by RetinaNet, similar performance but 3.8x faster. As always, all the code is online at https://pjreddie.com/yolo/"} | ||||
| 112 | +{"work_id": 2775304348, "title": "State-of-the-Art Speech Recognition with Sequence-to-Sequence Models", "abstract": "Attention-based encoder-decoder architectures such as Listen, Attend, and Spell (LAS), subsume the acoustic, pronunciation and language model components of a traditional automatic speech recognition (ASR) system into a single neural network. In previous work, we have shown that such architectures are comparable to state-of-the-art ASR systems on dictation tasks, but it was not clear if such architectures would be practical for more challenging tasks such as voice search. In this work, we explore a variety of structural and optimization improvements to our LAS model which significantly improve performance. On the structural side, we show that word piece models can be used instead of graphemes. We also introduce a multi-head attention architecture, which offers improvements over the commonly-used single-head attention. On the optimization side, we explore synchronous training, scheduled sampling, label smoothing, and minimum word error rate optimization, which are all shown to improve accuracy. We present results with a unidirectional LSTM encoder for streaming recognition. On a 12, 500 hour voice search task, we find that the proposed changes improve the WER from 9.2% to 5.6%, while the best conventional system achieves 6.7%; on a dictation task our model achieves a WER of 4.1% compared to 5% for the conventional system."} | ||||
| 113 | +{"work_id": 3097777922, "title": "Conformer: Convolution-augmented Transformer for Speech Recognition", "abstract": "Recently Transformer and Convolution neural network (CNN) based models have shown promising results in Automatic Speech Recognition (ASR), outperforming Recurrent neural networks (RNNs). Transformer models are good at capturing content-based global interactions, while CNNs exploit local features effectively. In this work, we achieve the best of both worlds by studying how to combine convolution neural networks and transformers to model both local and global dependencies of an audio sequence in a parameter-efficient way. To this regard, we propose the convolution-augmented transformer for speech recognition, named Conformer. Conformer significantly outperforms the previous Transformer and CNN based models achieving state-of-the-art accuracies. On the widely used LibriSpeech benchmark, our model achieves WER of 2.1%/4.3% without using a language model and 1.9%/3.9% with an external language model on test/testother. We also observe competitive performance of 2.7%/6.3% with a small model of only 10M parameters."} | ||||
| 114 | +{"work_id": 7140452175, "title": "Humanoid Locomotion and Manipulation: Current Progress and Challenges in Control, Planning, and Learning", "abstract": "Humanoid robots hold great potential to perform various human-level skills, involving unified locomotion and manipulation in real-world settings. Driven by advances in machine learning and the strength of existing model-based approaches, these capabilities have progressed rapidly, but often separately. This survey offers a comprehensive overview of the state-of-the-art in humanoid locomotion and manipulation, with a focus on control, planning, and learning methods. We first review the model-based methods that have been the backbone of humanoid robotics for the past three decades. We discuss contact planning, motion planning, and whole-body control, highlighting the tradeoffs between model fidelity and computational efficiency. Then, the focus is shifted to examine emerging learning-based methods, with an emphasis on reinforcement and imitation learning that enhance the robustness and versatility of loco-manipulation skills. Furthermore, we assess the potential of integrating foundation models with humanoid embodiments to enable the development of generalist humanoid agents. This survey also highlights the emerging role of tactile sensing, particularly whole-body tactile feedback, as a crucial modality for handling contact-rich interactions. Finally, we compare the strengths and limitations of model-based and learning-based paradigms from multiple perspectives, such as robustness, computational efficiency, versatility, and generalizability, and suggest potential solutions to existing challenges."} | ||||
| 115 | +{"work_id": 4405586205, "title": "Generative AI in higher education: A global perspective of institutional adoption policies and guidelines", "abstract": "Integrating generative AI (GAI) into higher education is crucial for preparing a future generation of GAI-literate students. However, a comprehensive understanding of global institutional adoption policies remains absent, with most prior studies focusing on the Global North and lacking a theoretical lens. This study utilizes the Diffusion of Innovations Theory to examine GAI adoption strategies in higher education across 40 universities from six global regions. It explores the characteristics of GAI innovation, including compatibility, trialability, and observability, and analyses the communication channels and roles and responsibilities outlined in university policies and guidelines. The findings reveal that universities are proactively addressing GAI integration by emphasising academic integrity, enhancing teaching and learning practices, and promoting equity. Key policy measures include the development of guidelines for ethical GAI use, the design of authentic assessments to mitigate misuse, and the provision of training programs for faculty and students to foster GAI literacy. Despite these efforts, gaps remain in comprehensive policy frameworks, particularly in addressing data privacy concerns and ensuring equitable access to GAI tools. The study underscores the importance of clear communication channels, stakeholder collaboration, and ongoing evaluation to support effective GAI adoption. These insights provide actionable insights for policymakers to craft inclusive, transparent, and adaptive strategies for integrating GAI into higher education."} | ||||
| 116 | +{"work_id": 2964243274, "title": "Natural TTS Synthesis by Conditioning Wavenet on MEL Spectrogram Predictions", "abstract": "This paper describes Tacotron 2, a neural network architecture for speech synthesis directly from text. The system is composed of a recurrent sequence-to-sequence feature prediction network that maps character embeddings to mel-scale spectrograms, followed by a modified WaveNet model acting as a vocoder to synthesize time-domain waveforms from those spectrograms. Our model achieves a mean opinion score (MOS) of 4.53 comparable to a MOS of 4.58 for professionally recorded speech. To validate our design choices, we present ablation studies of key components of our system and evaluate the impact of using mel spectrograms as the conditioning input to WaveNet instead of linguistic, duration, and F0 features. We further show that using this compact acoustic intermediate representation allows for a significant reduction in the size of the WaveNet architecture."} | ||||
| 117 | +{"work_id": 3131500599, "title": "Pyramid Vision Transformer: A Versatile Backbone for Dense Prediction without Convolutions", "abstract": "Although convolutional neural networks (CNNs) have achieved great success in computer vision, this work investigates a simpler, convolution-free backbone network use-fid for many dense prediction tasks. Unlike the recently-proposed Vision Transformer (ViT) that was designed for image classification specifically, we introduce the Pyramid Vision Transformer (PVT), which overcomes the difficulties of porting Transformer to various dense prediction tasks. PVT has several merits compared to current state of the arts. (1) Different from ViT that typically yields low-resolution outputs and incurs high computational and memory costs, PVT not only can be trained on dense partitions of an image to achieve high output resolution, which is important for dense prediction, but also uses a progressive shrinking pyramid to reduce the computations of large feature maps. (2) PVT inherits the advantages of both CNN and Transformer, making it a unified backbone for various vision tasks without convolutions, where it can be used as a direct replacement for CNN backbones. (3) We validate PVT through extensive experiments, showing that it boosts the performance of many downstream tasks, including object detection, instance and semantic segmentation. For example, with a comparable number of parameters, PVT+RetinaNet achieves 40.4 AP on the COCO dataset, surpassing ResNet50+RetinNet (36.3 AP) by 4.1 absolute AP (see Figure 2). We hope that PVT could, serre as an alternative and useful backbone for pixel-level predictions and facilitate future research."} | ||||
| 118 | +{"work_id": 2335728318, "title": "Reading digits in natural images with unsupervised feature learning", "abstract": "Detecting and reading text from natural images is a hard computer vision task that is central to a variety of emerging applications. Related problems like document character recognition have been widely studied by computer vision and machine learning researchers and are virtually solved for practical applications like reading handwritten digits. Reliably recognizing characters in more complex scenes like photographs, however, is far more difficult: the best existing methods lag well behind human performance on the same tasks. In this paper we attack the problem of recognizing digits in a real application using unsupervised feature learning methods: reading house numbers from street level photos. To this end, we introduce a new benchmark dataset for research use containing over 600,000 labeled digits cropped from Street View images. We then demonstrate the difficulty of recognizing these digits when the problem is approached with hand-designed features. Finally, we employ variants of two recently proposed unsupervised feature learning methods and find that they are convincingly superior on our benchmarks. 1"} | ||||
| 119 | +{"work_id": 4388761637, "title": "Towards autonomous multi-modal mobility morphobot (M4) robot: traversability estimation and 3D path planning", "abstract": "This thesis enhances the autonomy of the M4 (Multi-Modal Mobility Morphobot) robot,designed for Mars and rescue missions. The research enables the robot to autonomously select its locomotion mode and path in complex terrains. Focusing on walking and flying modes, a Gazebo simulation and custom perception-navigations pipelines are developed. Leveraging deep learning, the robot determines optimal mode transitions based on a 2.5D map. Additionally, an energyefficient path planner based on 2.5D mapping is implemented and validated in simulations. The contributions demonstrate scalability for future mode integrations. The M4 robot showcases intelligent mode switching, efficient navigation, and reduced energy consumption, bringing us closer to fully autonomous multi-modal robots for exploration and rescue missions. This work paves the way for future advancements in autonomous robotics, with the ultimate vision of deploying the M4 robot for exploration and rescue tasks, making a significant impact in the quest for intelligent and versatile robotic systems.--Author's abstract"} | ||||
| 120 | +{"work_id": 2521773018, "title": "Efficient computation of discrete Voronoi diagram and homotopy-preserving simplified medial axis of a 3d polyhedron", "abstract": "The Voronoi diagram is a fundamental geometric data structure and has been well studied in computational geometry and related areas. A Voronoi diagram defined using the Euclidean distance metric is also closely related to the Blum medial axis, a well known skeletal representation. Voronoi diagrams and medial axes have been shown useful for many 3D computations and operations, including proximity queries, motion planning, mesh generation, finite element analysis, and shape analysis. However, their application to complex 3D polyhedral and deformable models has been limited. This is due to the difficulty of computing exact Voronoi diagrams in an efficient and reliable manner. In this dissertation, we bridge this gap by presenting efficient algorithms to compute discrete Voronoi diagrams and simplified medial axes of 3D polyhedral models with geometric and topological guarantees. We apply these algorithms to complex 3D models and use them to perform interactive proximity queries, motion planning and skeletal computations. We present three new results. First, we describe an algorithm to compute 3D distance fields of geometric models by using a linear factorization of Euclidean distance vectors. This formulation maps directly to the linearly interpolating graphics rasterization hardware and enables us to compute distance fields of complex 3D models at interactive rates. We also use clamping and culling algorithms based on properties of Voronoi diagrams to accelerate this computation. We introduce surface distance maps, which are a compact distance vector field representation based on a mesh parameterization of triangulated two-manifolds, and use them to perform proximity computations. Our second main result is an adaptive sampling algorithm to compute an approximate Voronoi diagram that is homotopy equivalent to the exact Voronoi diagram and preserves topological features. We use this algorithm to compute a homotopy-preserving simplified medial axis of complex 3D models. Our third result is a unified approach to perform different proximity queries among multiple deformable models using second order discrete Voronoi diagrams. We introduce a new query called N-body distance query and show that different proximity queries, including collision detection, separation distance and penetration depth can be performed based on Nbody distance query. We compute the second order discrete Voronoi diagram using graphics hardware and use distance bounds to overcome the sampling errors and perform conservative computations. We have applied these queries to various deformable simulations and observed up to an order of magnitude improvement over prior algorithms."} | ||||
| 130 | {"work_id": 3102008235, "title": "Addressing Injustices through MOOCs: A study among peri-urban, marginalised, South African youth", "abstract": "The legacies of colonial rule continue to impact everyday life, particularly in education. These structural inequalities are often reinforced and amplified in online \u2018global\u2019 education through a form of digital neocolonialism, which is where hegemonic powers indirectly control or influence marginalised groups through the internet or information technology. In striving for justice-oriented online education models, this study analyses to what extent Massive Open Online Courses (MOOCs), produced both internationally and locally, support (or could support) the needs, preferences, and aspirations of marginalised South African youth and address the material, cultural-epistemic, political, and geopolitical injustices they face. To evaluate what South African peri-urban youth desire in their education and futures, as well as the challenges they experience, a seven-part survey was conducted with 250 youth from five townships in South Africa. Responses showed that whilst participants strongly value and aspire to further their education, financial difficulties, infrastructural barriers, family problems, and lack of emotional support and life mentorship limit them from achieving this. Participants reflected on how colonial and apartheid legacies have affected their educational experiences and identities through inferior quality of education, forced languages, forgotten histories and incongruent values, cultural norms and practices. In parallel, semi-structured interviews were conducted with 35 MOOC designers, from South Africa and the USA, to investigate the ways in which efforts, if any, were being made to reach students most in need of quality education. Interviews covered themes of openness, accessibility, and justice. It was found that, depending on the MOOC designer\u2019s understanding of social justice and decolonial thought, they placed varying emphasis on addressing different forms of injustice. Some focused on resource, access and infrastructural barriers, while others focused on issues of content relevance and knowledge production. Furthermore, MOOC designers\u2019 attempts to address injustices strongly related to their own identities and lived experiences, highlighting the importance of plurality of thought and epistemic diversity in the producers of MOOCs. Drawing on the historical injustices and lived experiences of the youth, and the attempts to address injustices by the MOOC designers, it was ascertained that there is no one size-fits-all formula to creating equitable MOOCs. Rather, depending on the purpose and target audience of the MOOC, nuanced approaches to addressing injustices are suggested. These approaches are shaped by various leverage points that influence the types of, and the extent to which, participatory methods, accessibility measures, knowledge sources, assessment and critical pedagogy are implemented. Additionally, the importance of these leverage points varies over the MOOC\u2019s lifecycle, from inception and design, to implementation and assessment. Bearing in mind the broad-ranging injustices that youth participants raised, these approaches are presented with great caution that educational technologies and open education are not panaceas but if designed and used appropriately and justly, can be tools for liberation."} | 121 | {"work_id": 3102008235, "title": "Addressing Injustices through MOOCs: A study among peri-urban, marginalised, South African youth", "abstract": "The legacies of colonial rule continue to impact everyday life, particularly in education. These structural inequalities are often reinforced and amplified in online \u2018global\u2019 education through a form of digital neocolonialism, which is where hegemonic powers indirectly control or influence marginalised groups through the internet or information technology. In striving for justice-oriented online education models, this study analyses to what extent Massive Open Online Courses (MOOCs), produced both internationally and locally, support (or could support) the needs, preferences, and aspirations of marginalised South African youth and address the material, cultural-epistemic, political, and geopolitical injustices they face. To evaluate what South African peri-urban youth desire in their education and futures, as well as the challenges they experience, a seven-part survey was conducted with 250 youth from five townships in South Africa. Responses showed that whilst participants strongly value and aspire to further their education, financial difficulties, infrastructural barriers, family problems, and lack of emotional support and life mentorship limit them from achieving this. Participants reflected on how colonial and apartheid legacies have affected their educational experiences and identities through inferior quality of education, forced languages, forgotten histories and incongruent values, cultural norms and practices. In parallel, semi-structured interviews were conducted with 35 MOOC designers, from South Africa and the USA, to investigate the ways in which efforts, if any, were being made to reach students most in need of quality education. Interviews covered themes of openness, accessibility, and justice. It was found that, depending on the MOOC designer\u2019s understanding of social justice and decolonial thought, they placed varying emphasis on addressing different forms of injustice. Some focused on resource, access and infrastructural barriers, while others focused on issues of content relevance and knowledge production. Furthermore, MOOC designers\u2019 attempts to address injustices strongly related to their own identities and lived experiences, highlighting the importance of plurality of thought and epistemic diversity in the producers of MOOCs. Drawing on the historical injustices and lived experiences of the youth, and the attempts to address injustices by the MOOC designers, it was ascertained that there is no one size-fits-all formula to creating equitable MOOCs. Rather, depending on the purpose and target audience of the MOOC, nuanced approaches to addressing injustices are suggested. These approaches are shaped by various leverage points that influence the types of, and the extent to which, participatory methods, accessibility measures, knowledge sources, assessment and critical pedagogy are implemented. Additionally, the importance of these leverage points varies over the MOOC\u2019s lifecycle, from inception and design, to implementation and assessment. Bearing in mind the broad-ranging injustices that youth participants raised, these approaches are presented with great caution that educational technologies and open education are not panaceas but if designed and used appropriately and justly, can be tools for liberation."} | ||
| 131 | {"work_id": 1581527321, "title": "Collision Detection and Avoidance in Computer Controlled Manipulators", "abstract": "This dissertation tackles the problem of planning safe trajectories for computer controlled manipulators with two links and multiple degrees of freedom. There are two ways to look at safe trajectory planning. The first concerns itself with planning trajectories in empty space; obstacles enter into consideration only indirectly in that they determine what part of the maneuverable space is free. The second considers obstacles alone; free space considerations are of secondary importance. We show how these complementary views can be used to advantage in the safe trajectory planning problem. Obstacles are naturally described in cartesian space and trajectories in joint space. If obstacles and trajectories are both represented in one space, collision checks would not require the constant and expensive conversion between the two spaces. We show how it is possible to decompose the planning task so as to get the best of both cartesian space and joint space representations, and yet avoid the constant conversion overhead problem. We show how the principles of hierarchical decomposition can be used to reduce the complexity of the manipulator trajectory planning problem. Different strategies are used for maneuvering far away from obstacles and for maneuvering close to obstacles. A characterization of large chunks of empty space makes maneuvering far away from obstacles very easy. A characterization of obstacle configuration types simplifies planning of maneuvers close to obstacles. The key ideas in the representation that make it possible to realize the above claims are: 1) the identification of a hierarchy of abstraction spaces that permit simplified manipulator descriptions. These spaces make it possible to model the manipulator as two line segments, a single line segment, or incredibly as a point. 2) the identification of primitive trajectory types that make collision detection, trajectory hypothesis and modification numerically tractable. 3) the polyhedra-model of obstacles and the identification of one-time-only transformations on obstacles that significantly simplify trajectory planning. 4) a neat characterization of empty space. Empty space is approximated by easily describable entities called charts; the approximation is dynamic and under program control; the approximation can be selective, and thus it is easy to make incremental modifications to the charts. The thesis describes a model for collision detection and avoidance systems for computer controlled manipulators. The justification for the model lies in the computer implementations for 2D and 3D manipulator systems. These systems incorporate a significant portion of the model. The promising performance of the implementation makes fast collision avoiders a distinct possibility. The solution presented treats manipulators with a sliding joint, and permits the manipulator to transport objects which can be enclosed within the minimum bounding cylinder of the manipulator link. Modifications of the solution that permit handling of large objects are indicated. An extension of the solution that solves the problem for manipulators with only rotary joints is described. A consequence of the investigations into the collision detection and avoidance problem has been the identification of execution-time strategies for terminal phase motion. Guidelines have been presented for incorporating proximity sensors into the manipulator system."} | 122 | {"work_id": 1581527321, "title": "Collision Detection and Avoidance in Computer Controlled Manipulators", "abstract": "This dissertation tackles the problem of planning safe trajectories for computer controlled manipulators with two links and multiple degrees of freedom. There are two ways to look at safe trajectory planning. The first concerns itself with planning trajectories in empty space; obstacles enter into consideration only indirectly in that they determine what part of the maneuverable space is free. The second considers obstacles alone; free space considerations are of secondary importance. We show how these complementary views can be used to advantage in the safe trajectory planning problem. Obstacles are naturally described in cartesian space and trajectories in joint space. If obstacles and trajectories are both represented in one space, collision checks would not require the constant and expensive conversion between the two spaces. We show how it is possible to decompose the planning task so as to get the best of both cartesian space and joint space representations, and yet avoid the constant conversion overhead problem. We show how the principles of hierarchical decomposition can be used to reduce the complexity of the manipulator trajectory planning problem. Different strategies are used for maneuvering far away from obstacles and for maneuvering close to obstacles. A characterization of large chunks of empty space makes maneuvering far away from obstacles very easy. A characterization of obstacle configuration types simplifies planning of maneuvers close to obstacles. The key ideas in the representation that make it possible to realize the above claims are: 1) the identification of a hierarchy of abstraction spaces that permit simplified manipulator descriptions. These spaces make it possible to model the manipulator as two line segments, a single line segment, or incredibly as a point. 2) the identification of primitive trajectory types that make collision detection, trajectory hypothesis and modification numerically tractable. 3) the polyhedra-model of obstacles and the identification of one-time-only transformations on obstacles that significantly simplify trajectory planning. 4) a neat characterization of empty space. Empty space is approximated by easily describable entities called charts; the approximation is dynamic and under program control; the approximation can be selective, and thus it is easy to make incremental modifications to the charts. The thesis describes a model for collision detection and avoidance systems for computer controlled manipulators. The justification for the model lies in the computer implementations for 2D and 3D manipulator systems. These systems incorporate a significant portion of the model. The promising performance of the implementation makes fast collision avoiders a distinct possibility. The solution presented treats manipulators with a sliding joint, and permits the manipulator to transport objects which can be enclosed within the minimum bounding cylinder of the manipulator link. Modifications of the solution that permit handling of large objects are indicated. An extension of the solution that solves the problem for manipulators with only rotary joints is described. A consequence of the investigations into the collision detection and avoidance problem has been the identification of execution-time strategies for terminal phase motion. Guidelines have been presented for incorporating proximity sensors into the manipulator system."} | ||
| 123 | +{"work_id": 2898847420, "title": "Waveglow: A Flow-based Generative Network for Speech Synthesis", "abstract": "In this paper we propose WaveGlow: a flow-based network capable of generating high quality speech from mel-spectrograms. WaveGlow combines insights from Glow [1] and WaveNet [2] in order to provide fast, efficient and high-quality audio synthesis, without the need for auto-regression. WaveGlow is implemented using only a single network, trained using only a single cost function: maximizing the likelihood of the training data, which makes the training procedure simple and stable. Our PyTorch implementation produces audio samples at a rate of more than 500 kHz on an NVIDIA V100 GPU. Mean Opinion Scores show that it delivers audio quality as good as the best publicly available WaveNet implementation. All code will be made publicly available online [3]."} | ||||
| 132 | {"work_id": 4392239564, "title": "Human-AI collaboration patterns in AI-assisted academic writing", "abstract": "Artificial Intelligence (AI) has increasingly influenced higher education, notably in academic writing where AI-powered assisting tools offer both opportunities and challenges.Recently, the rapid growth of generative AI (GAI) has brought its impacts into sharper focus, yet the dynamics of its utilisation in academic writing remain largely unexplored.This paper focuses on examining the nature of human-AI interactions in academic writing, specifically investigating the strategies doctoral students employ when collaborating with a GAI-powered assisting tool.This study involves 626 recorded activities on how ten doctoral students interact with GAI-powered assisting tool during academic writing.AIdriven learning analytics approach was adopted for three layered analyses: (1) data pre-processing and analysis with quantitative content analysis, (2) sequence analysis with Hidden Markov Model (HMM) and hierarchical sequence clustering, and (3) pattern analysis with process mining.Findings indicate that doctoral students engaging in iterative, highly interactive processes with the GAI-powered assisting tool generally achieve better performance in the writing task.In contrast, those who use GAI merely as a supplementary information source, maintaining a linear writing approach, tend to get lower writing performance.This study points to the need for further investigations into human-AI collaboration in learning in higher education, with implications for tailored educational strategies and solutions."} | 124 | {"work_id": 4392239564, "title": "Human-AI collaboration patterns in AI-assisted academic writing", "abstract": "Artificial Intelligence (AI) has increasingly influenced higher education, notably in academic writing where AI-powered assisting tools offer both opportunities and challenges.Recently, the rapid growth of generative AI (GAI) has brought its impacts into sharper focus, yet the dynamics of its utilisation in academic writing remain largely unexplored.This paper focuses on examining the nature of human-AI interactions in academic writing, specifically investigating the strategies doctoral students employ when collaborating with a GAI-powered assisting tool.This study involves 626 recorded activities on how ten doctoral students interact with GAI-powered assisting tool during academic writing.AIdriven learning analytics approach was adopted for three layered analyses: (1) data pre-processing and analysis with quantitative content analysis, (2) sequence analysis with Hidden Markov Model (HMM) and hierarchical sequence clustering, and (3) pattern analysis with process mining.Findings indicate that doctoral students engaging in iterative, highly interactive processes with the GAI-powered assisting tool generally achieve better performance in the writing task.In contrast, those who use GAI merely as a supplementary information source, maintaining a linear writing approach, tend to get lower writing performance.This study points to the need for further investigations into human-AI collaboration in learning in higher education, with implications for tailored educational strategies and solutions."} | ||
| 133 | {"work_id": 2890964092, "title": "X-Vectors: Robust DNN Embeddings for Speaker Recognition", "abstract": "In this paper, we use data augmentation to improve performance of deep neural network (DNN) embeddings for speaker recognition. The DNN, which is trained to discriminate between speakers, maps variable-length utterances to fixed-dimensional embeddings that we call x-vectors. Prior studies have found that embeddings leverage large-scale training datasets better than i-vectors. However, it can be challenging to collect substantial quantities of labeled data for training. We use data augmentation, consisting of added noise and reverberation, as an inexpensive method to multiply the amount of training data and improve robustness. The x-vectors are compared with i-vector baselines on Speakers in the Wild and NIST SRE 2016 Cantonese. We find that while augmentation is beneficial in the PLDA classifier, it is not helpful in the i-vector extractor. However, the x-vector DNN effectively exploits data augmentation, due to its supervised training. As a result, the x-vectors achieve superior performance on the evaluation datasets."} | 125 | {"work_id": 2890964092, "title": "X-Vectors: Robust DNN Embeddings for Speaker Recognition", "abstract": "In this paper, we use data augmentation to improve performance of deep neural network (DNN) embeddings for speaker recognition. The DNN, which is trained to discriminate between speakers, maps variable-length utterances to fixed-dimensional embeddings that we call x-vectors. Prior studies have found that embeddings leverage large-scale training datasets better than i-vectors. However, it can be challenging to collect substantial quantities of labeled data for training. We use data augmentation, consisting of added noise and reverberation, as an inexpensive method to multiply the amount of training data and improve robustness. The x-vectors are compared with i-vector baselines on Speakers in the Wild and NIST SRE 2016 Cantonese. We find that while augmentation is beneficial in the PLDA classifier, it is not helpful in the i-vector extractor. However, the x-vector DNN effectively exploits data augmentation, due to its supervised training. As a result, the x-vectors achieve superior performance on the evaluation datasets."} | ||
| 134 | {"work_id": 4399978538, "title": "Exploring Augmented Reality Integration in Diagnostic Imaging: Myth or Reality?", "abstract": "This study delves into the transformative potential of integrating augmented reality (AR) within imaging technologies, shedding light on this evolving landscape. Through a comprehensive narrative review, this research uncovers a wealth of literature exploring the intersection between AR and medical imaging, highlighting its growing prominence in healthcare. AR's integration offers a host of potential opportunities to enhance surgical precision, bolster patient engagement, and customize medical interventions. Moreover, when combined with technologies like virtual reality (VR), artificial intelligence (AI), and robotics, AR opens up new avenues for innovation in clinical practice, education, and training. However, amidst these promising prospects lie numerous unanswered questions and areas ripe for exploration. This study emphasizes the need for rigorous research to elucidate the clinical efficacy of AR-integrated interventions, optimize surgical workflows, and address technological challenges. As the healthcare landscape continues to evolve, sustained research efforts are crucial to fully realizing AR's transformative impact in medical imaging. Systematic reviews on AR in healthcare also overlook regulatory and developmental factors, particularly in regard to medical devices. These include compliance with standards, safety regulations, risk management, clinical validation, and developmental processes. Addressing these aspects will provide a comprehensive understanding of the challenges and opportunities in integrating AR into clinical settings, informing stakeholders about crucial regulatory and developmental considerations for successful implementation. Moreover, navigating the regulatory approval process requires substantial financial resources and expertise, presenting barriers to entry for smaller innovators. Collaboration across disciplines and concerted efforts to overcome barriers will be essential in navigating this frontier and harnessing the potential of AR to revolutionize healthcare delivery."} | 126 | {"work_id": 4399978538, "title": "Exploring Augmented Reality Integration in Diagnostic Imaging: Myth or Reality?", "abstract": "This study delves into the transformative potential of integrating augmented reality (AR) within imaging technologies, shedding light on this evolving landscape. Through a comprehensive narrative review, this research uncovers a wealth of literature exploring the intersection between AR and medical imaging, highlighting its growing prominence in healthcare. AR's integration offers a host of potential opportunities to enhance surgical precision, bolster patient engagement, and customize medical interventions. Moreover, when combined with technologies like virtual reality (VR), artificial intelligence (AI), and robotics, AR opens up new avenues for innovation in clinical practice, education, and training. However, amidst these promising prospects lie numerous unanswered questions and areas ripe for exploration. This study emphasizes the need for rigorous research to elucidate the clinical efficacy of AR-integrated interventions, optimize surgical workflows, and address technological challenges. As the healthcare landscape continues to evolve, sustained research efforts are crucial to fully realizing AR's transformative impact in medical imaging. Systematic reviews on AR in healthcare also overlook regulatory and developmental factors, particularly in regard to medical devices. These include compliance with standards, safety regulations, risk management, clinical validation, and developmental processes. Addressing these aspects will provide a comprehensive understanding of the challenges and opportunities in integrating AR into clinical settings, informing stakeholders about crucial regulatory and developmental considerations for successful implementation. Moreover, navigating the regulatory approval process requires substantial financial resources and expertise, presenting barriers to entry for smaller innovators. Collaboration across disciplines and concerted efforts to overcome barriers will be essential in navigating this frontier and harnessing the potential of AR to revolutionize healthcare delivery."} | ||
| 127 | +{"work_id": 4372347372, "title": "Efficient Multi-Scale Attention Module with Cross-Spatial Learning", "abstract": "Remarkable effectiveness of the channel or spatial attention mechanisms for producing more discernible feature representation are illustrated in various computer vision tasks. However, modeling the cross-channel relationships with channel dimensionality reduction may bring side effect in extracting deep visual representations. In this paper, a novel efficient multi-scale attention (EMA) module is proposed. Focusing on retaining the information on per channel and decreasing the computational overhead, EMA groups the channel dimensions into multiple sub-features and makes the spatial semantic features well-distributed inside each feature group. Specifically, apart from encoding the global information to re-calibrate the channel-wise weight in each parallel branch, the output features of the two parallel branches are further aggregated by a cross-dimension interaction method. The extensive experiments on common-used benchmarks, such as CIFAR100 for image classification, and object detection on MS COCO and VisDrone2019 datasets, are conducted which indicate that EMA outperforms several recent attention mechanisms significantly without changing networks depth."} | ||||
| 135 | {"work_id": 2975281968, "title": "Modeling Music : Studies of Music Transcription, Music Perception and Music Production", "abstract": "This dissertation presents ten studies focusing on three important subfields of music information retrieval (MIR): music transcription (Part A), music perception (Part B), and music production (Part C). In Part A, systems capable of transcribing rhythm and polyphonic pitch are described. The first two publications present methods for tempo estimation and beat tracking. A method is developed for computing the most salient periodicity (the \u201ccepstroid\u201d), and the computed cepstroid is used to guide the machine learning processing. The polyphonic pitch tracking system uses novel pitch-invariant and tone-shift-invariant processing techniques. Furthermore, the neural flux is introduced \u2013 a latent feature for onset and offset detection. The transcription systems use a layered learning technique with separate intermediate networks of varying depth. Important music concepts are used as intermediate targets to create a processing chain with high generalization. State-of-the-art performance is reported for all tasks. Part B is devoted to perceptual features of music, which can be used as intermediate targets or as parameters for exploring fundamental music perception mechanisms. Systems are proposed that can predict the perceived speed and performed dynamics of an audio file with high accuracy, using the average ratings from around 20 listeners as ground truths. In Part C, aspects related to music production are explored. The first paper analyzes long-term average spectrum (LTAS) in popular music. A compact equation is derived to describe the mean LTAS of a large dataset, and the variation is visualized. Further analysis shows that the level of the percussion is an important factor for LTAS. The second paper examines songwriting and composition through the development of an algorithmic composer of popular music. Various factors relevant for writing good compositions are encoded, and a listening test employed that shows the validity of the proposed methods. The dissertation is concluded by Part D - Looking Back and Ahead, which acts as a discussion and provides a road-map for future work. The first paper discusses the deep layered learning (DLL) technique, outlining concepts and pointing out a direction for future MIR implementations. It is suggested that DLL can help generalization by enforcing the validity of intermediate representations, and by letting the inferred representations establish disentangled structures supporting high-level invariant processing. The second paper proposes an architecture for tempo-invariant processing of rhythm with convolutional neural networks. Log-frequency representations of rhythm-related activations are suggested at the main stage of processing. Methods relying on magnitude, relative phase, and raw phase information are described for a wide variety of rhythm processing tasks."} | 128 | {"work_id": 2975281968, "title": "Modeling Music : Studies of Music Transcription, Music Perception and Music Production", "abstract": "This dissertation presents ten studies focusing on three important subfields of music information retrieval (MIR): music transcription (Part A), music perception (Part B), and music production (Part C). In Part A, systems capable of transcribing rhythm and polyphonic pitch are described. The first two publications present methods for tempo estimation and beat tracking. A method is developed for computing the most salient periodicity (the \u201ccepstroid\u201d), and the computed cepstroid is used to guide the machine learning processing. The polyphonic pitch tracking system uses novel pitch-invariant and tone-shift-invariant processing techniques. Furthermore, the neural flux is introduced \u2013 a latent feature for onset and offset detection. The transcription systems use a layered learning technique with separate intermediate networks of varying depth. Important music concepts are used as intermediate targets to create a processing chain with high generalization. State-of-the-art performance is reported for all tasks. Part B is devoted to perceptual features of music, which can be used as intermediate targets or as parameters for exploring fundamental music perception mechanisms. Systems are proposed that can predict the perceived speed and performed dynamics of an audio file with high accuracy, using the average ratings from around 20 listeners as ground truths. In Part C, aspects related to music production are explored. The first paper analyzes long-term average spectrum (LTAS) in popular music. A compact equation is derived to describe the mean LTAS of a large dataset, and the variation is visualized. Further analysis shows that the level of the percussion is an important factor for LTAS. The second paper examines songwriting and composition through the development of an algorithmic composer of popular music. Various factors relevant for writing good compositions are encoded, and a listening test employed that shows the validity of the proposed methods. The dissertation is concluded by Part D - Looking Back and Ahead, which acts as a discussion and provides a road-map for future work. The first paper discusses the deep layered learning (DLL) technique, outlining concepts and pointing out a direction for future MIR implementations. It is suggested that DLL can help generalization by enforcing the validity of intermediate representations, and by letting the inferred representations establish disentangled structures supporting high-level invariant processing. The second paper proposes an architecture for tempo-invariant processing of rhythm with convolutional neural networks. Log-frequency representations of rhythm-related activations are suggested at the main stage of processing. Methods relying on magnitude, relative phase, and raw phase information are described for a wide variety of rhythm processing tasks."} | ||
| 136 | {"work_id": 2979736514, "title": "Neural transfer learning for natural language processing", "abstract": "The current generation of neural network-based natural language processing models excels at learning from large amounts of labelled data. Given these capabilities, natural language processing is increasingly applied to new tasks, new domains, and new languages. Current models, however, are sensitive to noise and adversarial examples and prone to overfitting. This brittleness, together with the cost of attention, challenges the supervised learning paradigm. Transfer learning allows us to leverage knowledge acquired from related data in order to improve performance on a target task. Implicit transfer learning in the form of pretrained word representations has been a common component in natural language processing. In this dissertation, we argue that more explicit transfer learning is key to deal with the dearth of training data and to improve downstream performance of natural language processing models. We show experimental results transferring knowledge from related domains, tasks, and languages that support this hypothesis. We make several contributions to transfer learning for natural language processing: Firstly, we propose new methods to automatically select relevant data for supervised and unsupervised domain adaptation. Secondly, we propose two novel architectures that improve sharing in multi-task learning and outperform single-task learning as well as the state-of-the-art. Thirdly, we analyze the limitations of current models for unsupervised cross-lingual transfer and propose a method to mitigate them as well as a novel latent variable cross-lingual word embedding model. Finally, we propose a framework based on fine-tuning language models for sequential transfer learning and analyze the adaptation phase."} | 129 | {"work_id": 2979736514, "title": "Neural transfer learning for natural language processing", "abstract": "The current generation of neural network-based natural language processing models excels at learning from large amounts of labelled data. Given these capabilities, natural language processing is increasingly applied to new tasks, new domains, and new languages. Current models, however, are sensitive to noise and adversarial examples and prone to overfitting. This brittleness, together with the cost of attention, challenges the supervised learning paradigm. Transfer learning allows us to leverage knowledge acquired from related data in order to improve performance on a target task. Implicit transfer learning in the form of pretrained word representations has been a common component in natural language processing. In this dissertation, we argue that more explicit transfer learning is key to deal with the dearth of training data and to improve downstream performance of natural language processing models. We show experimental results transferring knowledge from related domains, tasks, and languages that support this hypothesis. We make several contributions to transfer learning for natural language processing: Firstly, we propose new methods to automatically select relevant data for supervised and unsupervised domain adaptation. Secondly, we propose two novel architectures that improve sharing in multi-task learning and outperform single-task learning as well as the state-of-the-art. Thirdly, we analyze the limitations of current models for unsupervised cross-lingual transfer and propose a method to mitigate them as well as a novel latent variable cross-lingual word embedding model. Finally, we propose a framework based on fine-tuning language models for sequential transfer learning and analyze the adaptation phase."} | ||
| 137 | {"work_id": 2955058313, "title": "Dual Attention Network for Scene Segmentation", "abstract": "In this paper, we address the scene segmentation task by capturing rich contextual dependencies based on the self-attention mechanism. Unlike previous works that capture contexts by multi-scale features fusion, we propose a Dual Attention Networks (DANet) to adaptively integrate local features with their global dependencies. Specifically, we append two types of attention modules on top of traditional dilated FCN, which model the semantic interdependencies in spatial and channel dimensions respectively. The position attention module selectively aggregates the features at each position by a weighted sum of the features at all positions. Similar features would be related to each other regardless of their distances. Meanwhile, the channel attention module selectively emphasizes interdependent channel maps by integrating associated features among all channel maps. We sum the outputs of the two attention modules to further improve feature representation which contributes to more precise segmentation results. We achieve new state-of-the-art segmentation performance on three challenging scene segmentation datasets, i.e., Cityscapes, PASCAL Context and COCO Stuff dataset. In particular, a Mean IoU score of 81.5% on Cityscapes test set is achieved without using coarse data."} | 130 | {"work_id": 2955058313, "title": "Dual Attention Network for Scene Segmentation", "abstract": "In this paper, we address the scene segmentation task by capturing rich contextual dependencies based on the self-attention mechanism. Unlike previous works that capture contexts by multi-scale features fusion, we propose a Dual Attention Networks (DANet) to adaptively integrate local features with their global dependencies. Specifically, we append two types of attention modules on top of traditional dilated FCN, which model the semantic interdependencies in spatial and channel dimensions respectively. The position attention module selectively aggregates the features at each position by a weighted sum of the features at all positions. Similar features would be related to each other regardless of their distances. Meanwhile, the channel attention module selectively emphasizes interdependent channel maps by integrating associated features among all channel maps. We sum the outputs of the two attention modules to further improve feature representation which contributes to more precise segmentation results. We achieve new state-of-the-art segmentation performance on three challenging scene segmentation datasets, i.e., Cityscapes, PASCAL Context and COCO Stuff dataset. In particular, a Mean IoU score of 81.5% on Cityscapes test set is achieved without using coarse data."} | ||
| 138 | {"work_id": 2980282514, "title": "HuggingFace's Transformers: State-of-the-art Natural Language Processing", "abstract": "Recent progress in natural language processing has been driven by advances in both model architecture and model pretraining. Transformer architectures have facilitated building higher-capacity models and pretraining has made it possible to effectively utilize this capacity for a wide variety of tasks. \\textit{Transformers} is an open-source library with the goal of opening up these advances to the wider machine learning community. The library consists of carefully engineered state-of-the art Transformer architectures under a unified API. Backing this library is a curated collection of pretrained models made by and available for the community. \\textit{Transformers} is designed to be extensible by researchers, simple for practitioners, and fast and robust in industrial deployments. The library is available at \\url{https://github.com/huggingface/transformers}."} | 131 | {"work_id": 2980282514, "title": "HuggingFace's Transformers: State-of-the-art Natural Language Processing", "abstract": "Recent progress in natural language processing has been driven by advances in both model architecture and model pretraining. Transformer architectures have facilitated building higher-capacity models and pretraining has made it possible to effectively utilize this capacity for a wide variety of tasks. \\textit{Transformers} is an open-source library with the goal of opening up these advances to the wider machine learning community. The library consists of carefully engineered state-of-the art Transformer architectures under a unified API. Backing this library is a curated collection of pretrained models made by and available for the community. \\textit{Transformers} is designed to be extensible by researchers, simple for practitioners, and fast and robust in industrial deployments. The library is available at \\url{https://github.com/huggingface/transformers}."} | ||
| 132 | +{"work_id": 4390692489, "title": "Unifying Large Language Models and Knowledge Graphs: A Roadmap", "abstract": "Large language models (LLMs), such as ChatGPT and GPT4, are making new waves in the field of natural language processing and artificial intelligence, due to their emergent ability and generalizability. However, LLMs are black-box models, which often fall short of capturing and accessing factual knowledge. In contrast, Knowledge Graphs (KGs), Wikipedia and Huapu for example, are structured knowledge models that explicitly store rich factual knowledge. KGs can enhance LLMs by providing external knowledge for inference and interpretability. Meanwhile, KGs are difficult to construct and evolve by nature, which challenges the existing methods in KGs to generate new facts and represent unseen knowledge. Therefore, it is complementary to unify LLMs and KGs together and simultaneously leverage their advantages. In this article, we present a forward-looking roadmap for the unification of LLMs and KGs. Our roadmap consists of three general frameworks, namely,1) KG-enhanced LLMs,which incorporate KGs during the pre-training and inference phases of LLMs, or for the purpose of enhancing understanding of the knowledge learned by LLMs;2) LLM-augmented KGs,that leverage LLMs for different KG tasks such as embedding, completion, construction, graph-to-text generation, and question answering; and3) Synergized LLMs + KGs, in which LLMs and KGs play equal roles and work in a mutually beneficial way to enhance both LLMs and KGs for bidirectional reasoning driven by both data and knowledge. We review and summarize existing efforts within these three frameworks in our roadmap and pinpoint their future research directions."} | ||||
| 139 | {"work_id": 4386072096, "title": "DreamBooth: Fine Tuning Text-to-Image Diffusion Models for Subject-Driven Generation", "abstract": "Large text-to-image models achieved a remarkable leap in the evolution of AI, enabling high-quality and diverse synthesis of images from a given text prompt. However, these models lack the ability to mimic the appearance of subjects in a given reference set and synthesize novel renditions of them in different contexts. In this work, we present a new approach for \u201cpersonalization\u201d of text-to-image diffusion models. Given as input just a few images of a subject, we fine-tune a pretrained text-to-image model such that it learns to bind a unique identifier with that specific subject. Once the subject is embedded in the output domain of the model, the unique identifier can be used to synthesize novel photorealistic images of the subject contextualized in different scenes. By leveraging the semantic prior embedded in the model with a new autogenous class-specific prior preservation loss, our technique enables synthesizing the subject in diverse scenes, poses, views and lighting conditions that do not appear in the reference images. We apply our technique to several previously-unassailable tasks, including subject recontextualization, text-guided view synthesis, and artistic rendering, all while preserving the subject's key features. We also provide a new dataset and evaluation protocol for this new task of subject-driven generation. Project page: https://dreambooth.github.io/"} | 133 | {"work_id": 4386072096, "title": "DreamBooth: Fine Tuning Text-to-Image Diffusion Models for Subject-Driven Generation", "abstract": "Large text-to-image models achieved a remarkable leap in the evolution of AI, enabling high-quality and diverse synthesis of images from a given text prompt. However, these models lack the ability to mimic the appearance of subjects in a given reference set and synthesize novel renditions of them in different contexts. In this work, we present a new approach for \u201cpersonalization\u201d of text-to-image diffusion models. Given as input just a few images of a subject, we fine-tune a pretrained text-to-image model such that it learns to bind a unique identifier with that specific subject. Once the subject is embedded in the output domain of the model, the unique identifier can be used to synthesize novel photorealistic images of the subject contextualized in different scenes. By leveraging the semantic prior embedded in the model with a new autogenous class-specific prior preservation loss, our technique enables synthesizing the subject in diverse scenes, poses, views and lighting conditions that do not appear in the reference images. We apply our technique to several previously-unassailable tasks, including subject recontextualization, text-guided view synthesis, and artistic rendering, all while preserving the subject's key features. We also provide a new dataset and evaluation protocol for this new task of subject-driven generation. Project page: https://dreambooth.github.io/"} | ||
| 140 | {"work_id": 4387835442, "title": "Generative Agents: Interactive Simulacra of Human Behavior", "abstract": "Believable proxies of human behavior can empower interactive applications ranging from immersive environments to rehearsal spaces for interpersonal communication to prototyping tools. In this paper, we introduce generative agents: computational software agents that simulate believable human behavior. Generative agents wake up, cook breakfast, and head to work; artists paint, while authors write; they form opinions, notice each other, and initiate conversations; they remember and reflect on days past as they plan the next day. To enable generative agents, we describe an architecture that extends a large language model to store a complete record of the agent\u2019s experiences using natural language, synthesize those memories over time into higher-level reflections, and retrieve them dynamically to plan behavior. We instantiate generative agents to populate an interactive sandbox environment inspired by The Sims, where end users can interact with a small town of twenty-five agents using natural language. In an evaluation, these generative agents produce believable individual and emergent social behaviors. For example, starting with only a single user-specified notion that one agent wants to throw a Valentine\u2019s Day party, the agents autonomously spread invitations to the party over the next two days, make new acquaintances, ask each other out on dates to the party, and coordinate to show up for the party together at the right time. We demonstrate through ablation that the components of our agent architecture\u2014observation, planning, and reflection\u2014each contribute critically to the believability of agent behavior. By fusing large language models with computational interactive agents, this work introduces architectural and interaction patterns for enabling believable simulations of human behavior."} | 134 | {"work_id": 4387835442, "title": "Generative Agents: Interactive Simulacra of Human Behavior", "abstract": "Believable proxies of human behavior can empower interactive applications ranging from immersive environments to rehearsal spaces for interpersonal communication to prototyping tools. In this paper, we introduce generative agents: computational software agents that simulate believable human behavior. Generative agents wake up, cook breakfast, and head to work; artists paint, while authors write; they form opinions, notice each other, and initiate conversations; they remember and reflect on days past as they plan the next day. To enable generative agents, we describe an architecture that extends a large language model to store a complete record of the agent\u2019s experiences using natural language, synthesize those memories over time into higher-level reflections, and retrieve them dynamically to plan behavior. We instantiate generative agents to populate an interactive sandbox environment inspired by The Sims, where end users can interact with a small town of twenty-five agents using natural language. In an evaluation, these generative agents produce believable individual and emergent social behaviors. For example, starting with only a single user-specified notion that one agent wants to throw a Valentine\u2019s Day party, the agents autonomously spread invitations to the party over the next two days, make new acquaintances, ask each other out on dates to the party, and coordinate to show up for the party together at the right time. We demonstrate through ablation that the components of our agent architecture\u2014observation, planning, and reflection\u2014each contribute critically to the believability of agent behavior. By fusing large language models with computational interactive agents, this work introduces architectural and interaction patterns for enabling believable simulations of human behavior."} | ||
| 141 | {"work_id": 4225672218, "title": "Restormer: Efficient Transformer for High-Resolution Image Restoration", "abstract": "Since convolutional neural networks (CNNs) perform well at learning generalizable image priors from large-scale data, these models have been extensively applied to image restoration and related tasks. Recently, another class of neural architectures, Transformers, have shown significant performance gains on natural language and high-level vision tasks. While the Transformer model mitigates the shortcomings of CNNs (i.e., limited receptive field and inadaptability to input content), its computational complexity grows quadratically with the spatial resolution, therefore making it infeasible to apply to most image restoration tasks involving high-resolution images. In this work, we propose an efficient Transformer model by making several key designs in the building blocks (multi-head attention and feed-forward network) such that it can capture long-range pixel interactions, while still remaining applicable to large images. Our model, named Restoration Transformer (Restormer), achieves state-of-the-art results on several image restoration tasks, including image deraining, single-image motion deblurring, defocus deblurring (single-image and dual-pixel data), and image denoising (Gaussian grayscale/color denoising, and real image denoising). The source code and pre-trained models are available at https://github.com/swz30/Restormer."} | 135 | {"work_id": 4225672218, "title": "Restormer: Efficient Transformer for High-Resolution Image Restoration", "abstract": "Since convolutional neural networks (CNNs) perform well at learning generalizable image priors from large-scale data, these models have been extensively applied to image restoration and related tasks. Recently, another class of neural architectures, Transformers, have shown significant performance gains on natural language and high-level vision tasks. While the Transformer model mitigates the shortcomings of CNNs (i.e., limited receptive field and inadaptability to input content), its computational complexity grows quadratically with the spatial resolution, therefore making it infeasible to apply to most image restoration tasks involving high-resolution images. In this work, we propose an efficient Transformer model by making several key designs in the building blocks (multi-head attention and feed-forward network) such that it can capture long-range pixel interactions, while still remaining applicable to large images. Our model, named Restoration Transformer (Restormer), achieves state-of-the-art results on several image restoration tasks, including image deraining, single-image motion deblurring, defocus deblurring (single-image and dual-pixel data), and image denoising (Gaussian grayscale/color denoising, and real image denoising). The source code and pre-trained models are available at https://github.com/swz30/Restormer."} | ||
| 142 | −{"work_id": 7130436101, "title": "An agentic system for rare disease diagnosis with traceable reasoning", "abstract": "Rare diseases affect more than 300 million people worldwide1\u20133, yet timely and accurate diagnosis remains an urgent challenge1,3\u20135. Patients often endure a prolonged \u2018diagnostic odyssey\u2019 exceeding 5 years, marked by repeated referrals, misdiagnoses and unnecessary interventions, leading to delayed treatment and substantial emotional and economic burden4,5. Here we present DeepRare\u2014a multi-agent system for rare disease differential diagnosis decision support6\u20138 powered by large language models, integrating more than 40 specialized tools and up-to-date knowledge sources. DeepRare processes heterogeneous clinical inputs, including free-text descriptions, structured human phenotype ontology terms and genetic testing results to generate ranked diagnostic hypotheses with transparent reasoning linked to verifiable medical evidence. Evaluated across nine datasets from literature, case reports and clinical centres across Asia, North America and Europe spanning 14 medical specialties, DeepRare demonstrates exceptional performance on 2,919 diseases. In human-phenotype-ontology-based tasks, it achieves an average Recall@1 of 57.18%, outperforming the next best method by 23.79%; in multi-modal tests, it reaches 69.1% compared with Exomiser\u2019s 55.9% on 168 cases. Expert review achieved 95.4% agreement on its reasoning chains, confirming their validity and traceability. Our work not only advances rare disease diagnosis but also demonstrates how the latest powerful large-language-model-driven agentic systems can reshape current clinical workflows. DeepRare\u2014a multi-agent system for rare disease differential diagnosis decision support powered by large language models, integrating specialized tools and up-to-date knowledge sources\u2014has the potential to reduce healthcare disparities in rare disease diagnosis."} | 136 | +{"work_id": 1483393136, "title": "Advanced high dynamic range imaging : theory and practice", "abstract": "Imaging techniques seek to simulate the array of light that reaches our eyes to provide the illusion of sensing scenes directly. Both photography and computer graphics deal with the generation of images. Both disciplines have to cope with the high dynamic range in the energy of visible light that human eyes can sense. Traditionally photography and computer graphics took different approaches to the high dynamic range problem. Work over the last ten years though has unified these disciplines and created powerful new tools for the creation of complex, compelling and realistic images. This book provides a practical introduction to the emerging new discipline of high dynamic range imaging that combines photography and computer graphics. By providing detailed equations and code, the book gives the reader the tools needed to experiment with new techniques for creating compelling images. A supplemental website contains downloads and additional information."} | ||
| 137 | +{"work_id": 4287824654, "title": "Question Answering For Toxicological Information Extraction", "abstract": "Working with large amounts of text data has become hectic and time-consuming. In order to reduce human effort, costs, and make the process more efficient, companies and organizations resort to intelligent algorithms to automate and assist the manual work. This problem is also present in the field of toxicological analysis of chemical substances, where information needs to be searched from multiple documents. That said, we propose an approach that relies on Question Answering for acquiring information from unstructured data, in our case, English PDF documents containing information about physicochemical and toxicological properties of chemical substances. Experimental results confirm that our approach achieves promising results which can be applicable in the business scenario, especially if further revised by humans."} | ||||
| 138 | +{"work_id": 3118608800, "title": "Learning Multiple Layers of Features from Tiny Images", "abstract": "April 8, 2009Groups at MIT and NYU have collected a dataset of millions of tiny colour images from the web. It is, in principle, an excellent dataset for unsupervised training of deep generative models, but previous researchers who have tried this have found it di cult to learn a good set of lters from the images. We show how to train a multi-layer generative model that learns to extract meaningful features which resemble those found in the human visual cortex. Using a novel parallelization algorithm to distribute the work among multiple machines connected on a network, we show how training such a model can be done in reasonable time. A second problematic aspect of the tiny images dataset is that there are no reliable class labels which makes it hard to use for object recognition experiments. We created two sets of reliable labels. The CIFAR-10 set has 6000 examples of each of 10 classes and the CIFAR-100 set has 600 examples of each of 100 non-overlapping classes. Using these labels, we show that object recognition is signi cantly"} | ||||
| 139 | +{"work_id": 4285585446, "title": "Metaverse beyond the hype: Multidisciplinary perspectives on emerging challenges, opportunities, and agenda for research, practice and policy", "abstract": "The metaverse has the potential to extend the physical world using augmented and virtual reality technologies allowing users to seamlessly interact within real and simulated environments using avatars and holograms. Virtual environments and immersive games (such as, Second Life, Fortnite, Roblox and VRChat) have been described as antecedents of the metaverse and offer some insight to the potential socio-economic impact of a fully functional persistent cross platform metaverse. Separating the hype and \u201cmeta\u2026\u201d rebranding from current reality is difficult, as \u201cbig tech\u201d paints a picture of the transformative nature of the metaverse and how it will positively impact people in their work, leisure, and social interaction. The potential impact on the way we conduct business, interact with brands and others, and develop shared experiences is likely to be transformational as the distinct lines between physical and digital are likely to be somewhat blurred from current perceptions. However, although the technology and infrastructure does not yet exist to allow the development of new immersive virtual worlds at scale - one that our avatars could transcend across platforms, researchers are increasingly examining the transformative impact of the metaverse. Impacted sectors include marketing, education, healthcare as well as societal effects relating to social interaction factors from widespread adoption, and issues relating to trust, privacy, bias, disinformation, application of law as well as psychological aspects linked to addiction and impact on vulnerable people. This study examines these topics in detail by combining the informed narrative and multi-perspective approach from experts with varied disciplinary backgrounds on many aspects of the metaverse and its transformational impact. The paper concludes by proposing a future research agenda that is valuable for researchers, professionals and policy makers alike."} | ||||
| 140 | +{"work_id": 3187418919, "title": "A Survey on Vision Transformer", "abstract": "Transformer, first applied to the field of natural language processing, is a type of deep neural network mainly based on the self-attention mechanism. Thanks to its strong representation capabilities, researchers are looking at ways to apply transformer to computer vision tasks. In a variety of visual benchmarks, transformer-based models perform similar to or better than other types of networks such as convolutional and recurrent neural networks. Given its high performance and less need for vision-specific inductive bias, transformer is receiving more and more attention from the computer vision community. In this paper, we review these vision transformer models by categorizing them in different tasks and analyzing their advantages and disadvantages. The main categories we explore include the backbone network, high/mid-level vision, low-level vision, and video processing. We also include efficient transformer methods for pushing transformer into real device-based applications. Furthermore, we also take a brief look at the self-attention mechanism in computer vision, as it is the base component in transformer. Toward the end of this paper, we discuss the challenges and provide several further research directions for vision transformers."} | ||||
| 141 | +{"work_id": 4415796023, "title": "VMamba: Visual State Space Model", "abstract": "Designing computationally efficient network architectures remains an ongoing necessity in computer vision. In this paper, we adapt Mamba, a state-space language model, into VMamba, a vision backbone with linear time complexity. At the core of VMamba is a stack of Visual State-Space (VSS) blocks with the 2D Selective Scan (SS2D) module. By traversing along four scanning routes, SS2D bridges the gap between the ordered nature of 1D selective scan and the non-sequential structure of 2D vision data, which facilitates the collection of contextual information from various sources and perspectives. Based on the VSS blocks, we develop a family of VMamba architectures and accelerate them through a succession of architectural and implementation enhancements. Extensive experiments demonstrate VMamba's promising performance across diverse visual perception tasks, highlighting its superior input scaling efficiency compared to existing benchmark models. Source code is available at https://github.com/MzeroMiko/VMamba."} | ||||
| 142 | +{"work_id": 4408943584, "title": "Digital learning in the 21st century: trends, challenges, and innovations in technology integration", "abstract": "The integration of digital technologies into education represents a significant evolution in the pedagogical landscape, with the potential to enhance accessibility, engagement, and personalization in learning. This review synthesizes current trends, challenges, and innovations within digital learning, emphasizing the impact of artificial intelligence (AI), virtual reality (VR), and online platforms on student achievement. It highlights the importance of addressing technical, pedagogical, and socioeconomic challenges to ensure equitable access to technology. Successful initiatives like the Open University illustrate digital learning's potential to improve educational outcomes. The review also anticipates future directions, including the expanding role of AI, VR, mobile learning, and blockchain in education. It concludes with strategic recommendations for educators and policymakers to adopt best practices, prioritize infrastructure development, and focus on continuous professional development to leverage the benefits of digital learning. As education enters an era of digital transformation, a collaborative approach among stakeholders will be essential in creating an inclusive and effective learning environment for the future."} | ||||
| 143 | +{"work_id": 3128261063, "title": "seaborn: statistical data visualization", "abstract": "seaborn is a library for making statistical graphics in Python.It provides a high-level interface to matplotlib and integrates closely with pandas data structures.Functions in the seaborn library expose a declarative, dataset-oriented API that makes it easy to translate questions about data into graphics that can answer them.When given a dataset and a specification of the plot to make, seaborn automatically maps the data values to visual attributes such as color, size, or style, internally computes statistical transformations, and decorates the plot with informative axis labels and a legend.Many seaborn functions can generate figures with multiple panels that elicit comparisons between conditional subsets of data or across different pairings of variables in a dataset.seaborn is designed to be useful throughout the lifecycle of a scientific project.By producing complete graphics from a single function call with minimal arguments, seaborn facilitates rapid prototyping and exploratory data analysis.And by offering extensive options for customization, along with exposing the underlying matplotlib objects, it can be used to create polished, publication-quality figures."} | ||||
| 144 | +{"work_id": 2736941579, "title": "Learning Transferable Architectures for Scalable Image Recognition", "abstract": "Developing neural network image classification models often requires significant architecture engineering. In this paper, we study a method to learn the model architectures directly on the dataset of interest. As this approach is expensive when the dataset is large, we propose to search for an architectural building block on a small dataset and then transfer the block to a larger dataset. The key contribution of this work is the design of a new search space (which we call the \"NASNet search space\") which enables transferability. In our experiments, we search for the best convolutional layer (or \"cell\") on the CIFAR-10 dataset and then apply this cell to the ImageNet dataset by stacking together more copies of this cell, each with their own parameters to design a convolutional architecture, which we name a \"NASNet architecture\". We also introduce a new regularization technique called ScheduledDropPath that significantly improves generalization in the NASNet models. On CIFAR-10 itself, a NASNet found by our method achieves 2.4% error rate, which is state-of-the-art. Although the cell is not searched for directly on ImageNet, a NASNet constructed from the best cell achieves, among the published works, state-of-the-art accuracy of 82.7% top-1 and 96.2% top-5 on ImageNet. Our model is 1.2% better in top-1 accuracy than the best human-invented architectures while having 9 billion fewer FLOPS - a reduction of 28% in computational demand from the previous state-of-the-art model. When evaluated at different levels of computational cost, accuracies of NASNets exceed those of the state-of-the-art human-designed models. For instance, a small version of NASNet also achieves 74% top-1 accuracy, which is 3.1% better than equivalently-sized, state-of-the-art models for mobile platforms. Finally, the image features learned from image classification are generically useful and can be transferred to other computer vision problems. On the task of object detection, the learned features by NASNet used with the Faster-RCNN framework surpass state-of-the-art by 4.0% achieving 43.1% mAP on the COCO dataset."} | ||||
| 145 | +{"work_id": 3169483174, "title": "mT5: A Massively Multilingual Pre-trained Text-to-Text Transformer", "abstract": "Linting Xue, Noah Constant, Adam Roberts, Mihir Kale, Rami Al-Rfou, Aditya Siddhant, Aditya Barua, Colin Raffel. Proceedings of the 2021 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies. 2021."} | ||||
| 146 | +{"work_id": 3171007011, "title": "Exploring Simple Siamese Representation Learning", "abstract": "Siamese networks have become a common structure in various recent models for unsupervised visual representation learning. These models maximize the similarity between two augmentations of one image, subject to certain conditions for avoiding collapsing solutions. In this paper, we report surprising empirical results that simple Siamese networks can learn meaningful representations even using none of the following: (i) negative sample pairs, (ii) large batches, (iii) momentum encoders. Our experiments show that collapsing solutions do exist for the loss and structure, but a stop-gradient operation plays an essential role in preventing collapsing. We provide a hypothesis on the implication of stop-gradient, and further show proof-of-concept experiments verifying it. Our \"SimSiam\" method achieves competitive results on ImageNet and downstream tasks. We hope this simple baseline will motivate people to rethink the roles of Siamese architectures for unsupervised representation learning. Code is made available.1"} | ||||
| 147 | +{"work_id": 2202024431, "title": "Signed Distance Fields for Polygon Soup Meshes", "abstract": "Many meshes in computer animation practice are meant to approximate solid objects, but the provided triangular geometry is often unoriented, non-manifold or contains self-intersections, causing inside/outside of objects to be mathematically ill-defined. We describe a robust and efficient automatic approach to define and compute a signed distance field for arbitrary triangular geometry. Starting with arbitrary (non-manifold) triangular geometry, we first define and extract an offset manifold surface using an unsigned distance field. We then automatically remove any interior surface components. Finally, we exploit the manifoldness of the offset surface to quickly detect interior distance field grid points. We prove that exterior grid points can reuse a shifted original unsigned distance field, whereas for interior cells, we compute the signed field from the offset surface geometry. We demonstrate improved performance both using exact distance fields computed using an octree, and approximate distance fields computed using fast marching. We analyze the time and memory costs for complex meshes that include self-intersections and non-manifold geometry. We demonstrate the effectiveness of our algorithm by using the signed distance field for collision detection and generation of tetrahedral meshes for physically based simulation."} | ||||
| 148 | +{"work_id": 2978950353, "title": "PERANCANGAN POP UP BOOK AND SOUND TEMBANG DOLANAN SEBAGAI MEDIA PENGENALAN ALAT MUSIK GAMELAN", "abstract": "Perancangan Pop Up Book and Sound Tembang Dolanan Sebagai Pengenalan Alat Musik Gamelan. NAMA: Ilham Musyafa Asya Ari NIM. 12151125. Program Studi S-1 Desain Komunikasii Visual. Kesenian tradisional Jawa banyak macamnya, salah satunya adalah seni tembang dolanan yang diiringi dengan gamelan jawa. Saat ini dalam mata pelajaran sekolah siswa SD (sekolah Dasar) di Surakarta sangat jarang diperkenalkan, karena pada kenyataannya instrument gamelan tidak dimiliki atau jarang ada sebagai laboratorim pembelajaran. Pembelajaran tembang dolanan diiringi instrumen gamelan dianggap kurang menarik dan ketinggalan jaman, meskipun ada instrument campursari atau organ tunggal. Perancangan buku pop up book tembang dolanan ini diciptakan, sebagai media ajar yang baru bertujuan agar lebih menarik generasi masa kini terutama anak-anak sekolah dasar untuk mengenal kembali kebudayaan musik tradisi yang sarat akan makna yang keberadaannya sudah mulai dilupakan. Metode penciptaan ini dimulai dengan riset dan wawancara ke sekolah-sekolah dasar di Surakarta, melakukan brainstorming, eksplorasi ide, penciptaan naskah, sketsa, layout, dummy, dan artwork. Media promosi untuk memperkenalkan Pop up book ini melalui media lini atas yaitu website atau media sosial dan media pendukung seperti pensil warna, totegbag, pin dan sticker, sebagai bentuk untuk menyadarkan arti pentingnya mencintai budaya lokal pada tembang dolanan."} | ||||
| 149 | +{"work_id": 4212875960, "title": "UNETR: Transformers for 3D Medical Image Segmentation", "abstract": "Fully Convolutional Neural Networks (FCNNs) with contracting and expanding paths have shown prominence for the majority of medical image segmentation applications since the past decade. In FCNNs, the encoder plays an integral role by learning both global and local features and contextual representations which can be utilized for semantic output prediction by the decoder. Despite their success, the locality of convolutional layers in FCNNs, limits the capability of learning long-range spatial dependencies. Inspired by the recent success of transformers for Natural Language Processing (NLP) in long-range sequence learning, we reformulate the task of volumetric (3D) medical image segmentation as a sequence-to-sequence prediction problem. We introduce a novel architecture, dubbed as UNEt TRansformers (UNETR), that utilizes a transformer as the encoder to learn sequence representations of the input volume and effectively capture the global multi-scale information, while also following the successful \"U-shaped\" network design for the encoder and decoder. The transformer encoder is directly connected to a decoder via skip connections at different resolutions to compute the final semantic segmentation output. We have validated the performance of our method on the Multi Atlas Labeling Beyond The Cranial Vault (BTCV) dataset for multi-organ segmentation and the Medical Segmentation Decathlon (MSD) dataset for brain tumor and spleen segmentation tasks. Our benchmarks demonstrate new state-of-the-art performance on the BTCV leaderboard."} | ||||
| 150 | +{"work_id": 4400881081, "title": "TransUNet: Rethinking the U-Net architecture design for medical image segmentation through the lens of transformers", "abstract": "Medical image segmentation is crucial for healthcare, yet convolution-based methods like U-Net face limitations in modeling long-range dependencies. To address this, Transformers designed for sequence-to-sequence predictions have been integrated into medical image segmentation. However, a comprehensive understanding of Transformers' self-attention in U-Net components is lacking. TransUNet, first introduced in 2021, is widely recognized as one of the first models to integrate Transformer into medical image analysis. In this study, we present the versatile framework of TransUNet that encapsulates Transformers' self-attention into two key modules: (1) a Transformer encoder tokenizing image patches from a convolution neural network (CNN) feature map, facilitating global context extraction, and (2) a Transformer decoder refining candidate regions through cross-attention between proposals and U-Net features. These modules can be flexibly inserted into the U-Net backbone, resulting in three configurations: Encoder-only, Decoder-only, and Encoder+Decoder. TransUNet provides a library encompassing both 2D and 3D implementations, enabling users to easily tailor the chosen architecture. Our findings highlight the encoder's efficacy in modeling interactions among multiple abdominal organs and the decoder's strength in handling small targets like tumors. It excels in diverse medical applications, such as multi-organ segmentation, pancreatic tumor segmentation, and hepatic vessel segmentation. Notably, our TransUNet achieves a significant average Dice improvement of 1.06% and 4.30% for multi-organ segmentation and pancreatic tumor segmentation, respectively, when compared to the highly competitive nn-UNet, and surpasses the top-1 solution in the BrasTS2021 challenge. 2D/3D Code and models are available at https://github.com/Beckschen/TransUNet and https://github.com/Beckschen/TransUNet-3D, respectively."} | ||||
| 151 | +{"work_id": 2963163009, "title": "MobileNetV2: Inverted Residuals and Linear Bottlenecks", "abstract": "In this paper we describe a new mobile architecture, MobileNetV2, that improves the state of the art performance of mobile models on multiple tasks and benchmarks as well as across a spectrum of different model sizes. We also describe efficient ways of applying these mobile models to object detection in a novel framework we call SSDLite. Additionally, we demonstrate how to build mobile semantic segmentation models through a reduced form of DeepLabv3 which we call Mobile DeepLabv3. is based on an inverted residual structure where the shortcut connections are between the thin bottleneck layers. The intermediate expansion layer uses lightweight depthwise convolutions to filter features as a source of non-linearity. Additionally, we find that it is important to remove non-linearities in the narrow layers in order to maintain representational power. We demonstrate that this improves performance and provide an intuition that led to this design. Finally, our approach allows decoupling of the input/output domains from the expressiveness of the transformation, which provides a convenient framework for further analysis. We measure our performance on ImageNet [1] classification, COCO object detection [2], VOC image segmentation [3]. We evaluate the trade-offs between accuracy, and number of operations measured by multiply-adds (MAdd), as well as actual latency, and the number of parameters."} | ||||
| 152 | +{"work_id": 2999607073, "title": "Image Segmentation Using Deep Learning: A Survey", "abstract": "Image segmentation is a key task in computer vision and image processing with important applications such as scene understanding, medical image analysis, robotic perception, video surveillance, augmented reality, and image compression, among others, and numerous segmentation algorithms are found in the literature. Against this backdrop, the broad success of deep learning (DL) has prompted the development of new image segmentation approaches leveraging DL models. We provide a comprehensive review of this recent literature, covering the spectrum of pioneering efforts in semantic and instance segmentation, including convolutional pixel-labeling networks, encoder-decoder architectures, multiscale and pyramid-based approaches, recurrent networks, visual attention models, and generative models in adversarial settings. We investigate the relationships, strengths, and challenges of these DL-based segmentation models, examine the widely used datasets, compare performances, and discuss promising research directions."} | ||||
| 153 | +{"work_id": 4406918931, "title": "UAV swarms: research, challenges, and future directions", "abstract": "Abstract Unmanned Aerial Vehicle (UAV) swarms represent a transformative advancement in aerial robotics, leveraging collaborative autonomy to enhance operational capabilities. This paper provides a comprehensive exploration of UAV swarm infrastructure, recent research advancements, and diverse applications. Key areas such as coordinated path planning, task assignment, formation control, and security considerations are examined, highlighting how Artificial Intelligence (AI) and Machine Learning (ML) are integrated to improve decision-making and adaptability. Applications span civilian sectors, including entertainment, infrastructure inspection, and delivery services, as well as military applications in surveillance, combat support, and logistics. The paper addresses technical challenges, regulatory constraints, and ethical considerations, while outlining future directions focused on scalability, robustness, and societal integration. This review consolidates the evolving landscape of UAV swarms, identifying critical challenges and guiding future research endeavors."} | ||||
| 154 | +{"work_id": 2925329277, "title": "Control Barrier Functions: Theory and Applications", "abstract": "This paper provides an introduction and overview of recent work on control barrier functions and their use to verify and enforce safety properties in the context of (optimization based) safety-critical controllers. We survey the main technical results and discuss applications to several domains including robotic systems."} | ||||
| 155 | +{"work_id": 2978017171, "title": "DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lighter", "abstract": "As Transfer Learning from large-scale pre-trained models becomes more prevalent in Natural Language Processing (NLP), operating these large models in on-the-edge and/or under constrained computational training or inference budgets remains challenging. In this work, we propose a method to pre-train a smaller general-purpose language representation model, called DistilBERT, which can then be fine-tuned with good performances on a wide range of tasks like its larger counterparts. While most prior work investigated the use of distillation for building task-specific models, we leverage knowledge distillation during the pre-training phase and show that it is possible to reduce the size of a BERT model by 40%, while retaining 97% of its language understanding capabilities and being 60% faster. To leverage the inductive biases learned by larger models during pre-training, we introduce a triple loss combining language modeling, distillation and cosine-distance losses. Our smaller, faster and lighter model is cheaper to pre-train and we demonstrate its capabilities for on-device computations in a proof-of-concept experiment and a comparative on-device study."} | ||||
| 156 | +{"work_id": 3156636935, "title": "SimCSE: Simple Contrastive Learning of Sentence Embeddings", "abstract": "This paper presents SimCSE, a simple contrastive learning framework that greatly advances the state-of-the-art sentence embeddings.We first describe an unsupervised approach, which takes an input sentence and predicts itself in a contrastive objective, with only standard dropout used as noise.This simple method works surprisingly well, performing on par with previous supervised counterparts.We find that dropout acts as minimal data augmentation and removing it leads to a representation collapse.Then, we propose a supervised approach, which incorporates annotated pairs from natural language inference datasets into our contrastive learning framework, by using \"entailment\" pairs as positives and \"contradiction\" pairs as hard negatives.We evaluate SimCSE on standard semantic textual similarity (STS) tasks, and our unsupervised and supervised models using BERT base achieve an average of 76.3% and 81.6% Spearman's correlation respectively, a 4.2% and 2.2% improvement compared to previous best results.We also show-both theoretically and empirically-that contrastive learning objective regularizes pre-trained embeddings' anisotropic space to be more uniform, and it better aligns positive pairs when supervised signals are available.1"} | ||||
| 157 | +{"work_id": 4391109864, "title": "Segment anything in medical images", "abstract": "Medical image segmentation is a critical component in clinical practice, facilitating accurate diagnosis, treatment planning, and disease monitoring. However, existing methods, often tailored to specific modalities or disease types, lack generalizability across the diverse spectrum of medical image segmentation tasks. Here we present MedSAM, a foundation model designed for bridging this gap by enabling universal medical image segmentation. The model is developed on a large-scale medical image dataset with 1,570,263 image-mask pairs, covering 10 imaging modalities and over 30 cancer types. We conduct a comprehensive evaluation on 86 internal validation tasks and 60 external validation tasks, demonstrating better accuracy and robustness than modality-wise specialist models. By delivering accurate and efficient segmentation across a wide spectrum of tasks, MedSAM holds significant potential to expedite the evolution of diagnostic tools and the personalization of treatment plans."} | ||||
| 158 | +{"work_id": 2962866211, "title": "Supervised Speech Separation Based on Deep Learning: An Overview", "abstract": "Speech separation is the task of separating target speech from background interference. Traditionally, speech separation is studied as a signal processing problem. A more recent approach formulates speech separation as a supervised learning problem, where the discriminative patterns of speech, speakers, and background noise are learned from training data. Over the past decade, many supervised separation algorithms have been put forward. In particular, the recent introduction of deep learning to supervised speech separation has dramatically accelerated progress and boosted separation performance. This paper provides a comprehensive overview of the research on deep learning based supervised speech separation in the last several years. We first introduce the background of speech separation and the formulation of supervised separation. Then, we discuss three main components of supervised separation: learning machines, training targets, and acoustic features. Much of the overview is on separation algorithms where we review monaural methods, including speech enhancement (speech-nonspeech separation), speaker separation (multitalker separation), and speech dereverberation, as well as multimicrophone techniques. The important issue of generalization, unique to supervised learning, is discussed. This overview provides a historical perspective on how advances are made. In addition, we discuss a number of conceptual issues, including what constitutes the target source."} | ||||
| 159 | +{"work_id": 4221151978, "title": "Instant neural graphics primitives with a multiresolution hash encoding", "abstract": "Neural graphics primitives, parameterized by fully connected neural networks, can be costly to train and evaluate. We reduce this cost with a versatile new input encoding that permits the use of a smaller network without sacrificing quality, thus significantly reducing the number of floating point and memory access operations: a small neural network is augmented by a multiresolution hash table of trainable feature vectors whose values are optimized through stochastic gradient descent. The multiresolution structure allows the network to disambiguate hash collisions, making for a simple architecture that is trivial to parallelize on modern GPUs. We leverage this parallelism by implementing the whole system using fully-fused CUDA kernels with a focus on minimizing wasted bandwidth and compute operations. We achieve a combined speedup of several orders of magnitude, enabling training of high-quality neural graphics primitives in a matter of seconds, and rendering in tens of milliseconds at a resolution of 1920\u00d71080."} | ||||
| 160 | +{"work_id": 2904367110, "title": "A Style-Based Generator Architecture for Generative Adversarial Networks", "abstract": "We propose an alternative generator architecture for generative adversarial networks, borrowing from style transfer literature. The new architecture leads to an automatically learned, unsupervised separation of high-level attributes (e.g., pose and identity when trained on human faces) and stochastic variation in the generated images (e.g., freckles, hair), and it enables intuitive, scale-specific control of the synthesis. The new generator improves the state-of-the-art in terms of traditional distribution quality metrics, leads to demonstrably better interpolation properties, and also better disentangles the latent factors of variation. To quantify interpolation quality and disentanglement, we propose two new, automated methods that are applicable to any generator architecture. Finally, we introduce a new, highly varied and high-quality dataset of human faces."} | ||||
| 143 | {"work_id": 7106270182, "title": "Bridging the Gap between Object and Image-level Representations for Open-Vocabulary Detection", "abstract": "Existing open-vocabulary object detectors typically enlarge their vocabulary sizes by leveraging different forms of weak supervision. This helps generalize to novel objects at inference. Two popular forms of weak-supervision used in open-vocabulary detection (OVD) include pretrained CLIP model and image-level supervision. We note that both these modes of supervision are not optimally aligned for the detection task: CLIP is trained with image-text pairs and lacks precise localization of objects while the image-level supervision has been used with heuristics that do not accurately specify local object regions. In this work, we propose to address this problem by performing object-centric alignment of the language embeddings from the CLIP model. Furthermore, we visually ground the objects with only image-level supervision using a pseudo-labeling process that provides high-quality object proposals and helps expand the vocabulary during training. We establish a bridge between the above two object-alignment strategies via a novel weight transfer function that aggregates their complimentary strengths. In essence, the proposed model seeks to minimize the gap between object and image-centric representations in the OVD setting. On the COCO benchmark, our proposed approach achieves 36.6 AP-50 on novel classes, an absolute 8.2 gain over the previous best performance. For LVIS, we surpass the state-of-the-art ViLD model by 5.0 mask AP for rare categories and 3.4 overall."} | 161 | {"work_id": 7106270182, "title": "Bridging the Gap between Object and Image-level Representations for Open-Vocabulary Detection", "abstract": "Existing open-vocabulary object detectors typically enlarge their vocabulary sizes by leveraging different forms of weak supervision. This helps generalize to novel objects at inference. Two popular forms of weak-supervision used in open-vocabulary detection (OVD) include pretrained CLIP model and image-level supervision. We note that both these modes of supervision are not optimally aligned for the detection task: CLIP is trained with image-text pairs and lacks precise localization of objects while the image-level supervision has been used with heuristics that do not accurately specify local object regions. In this work, we propose to address this problem by performing object-centric alignment of the language embeddings from the CLIP model. Furthermore, we visually ground the objects with only image-level supervision using a pseudo-labeling process that provides high-quality object proposals and helps expand the vocabulary during training. We establish a bridge between the above two object-alignment strategies via a novel weight transfer function that aggregates their complimentary strengths. In essence, the proposed model seeks to minimize the gap between object and image-centric representations in the OVD setting. On the COCO benchmark, our proposed approach achieves 36.6 AP-50 on novel classes, an absolute 8.2 gain over the previous best performance. For LVIS, we surpass the state-of-the-art ViLD model by 5.0 mask AP for rare categories and 3.4 overall."} | ||
| 144 | {"work_id": 3163641770, "title": "Metric Type in the Target-matrix Mesh Optimization Paradigm", "abstract": "The Target Matrix Optimization Paradigm (TMOP) is a method for improving the accuracy, efficiency, and robustness of numerical solutions to partial differential equations by improving the geometric quality of the computational mesh, primarily through node movement.TMOP has been sucessfully applied to a number applications even though the paradigm was not fully understood at the time.With this work, TMOP can be seen to be a tightly woven fabric of interconnecting ideas and concepts that provides a powerful approach to mesh optimization.The central unifying concepts in TMOP are the concept of a Target Matrix and the concept of Metric Type.Targetmatrices are motivated by the desire to make mesh quality improvement application-specific and, when needed, solution-adaptive.Metric type plays an essential role because it provides, through the use of typed metrics, the bridge between application-specific quality and target construction.It is shown that there are eight theoretical metric types, including the shape and shape+size types used informally in the past.It is shown further that there exist well-posed metrics corresponding to six of the eight metric types.A well-posed metric is a metric that is typed and convex, polyconvex, or invex, and further, it is a metric that simplifies target construction."} | 162 | {"work_id": 3163641770, "title": "Metric Type in the Target-matrix Mesh Optimization Paradigm", "abstract": "The Target Matrix Optimization Paradigm (TMOP) is a method for improving the accuracy, efficiency, and robustness of numerical solutions to partial differential equations by improving the geometric quality of the computational mesh, primarily through node movement.TMOP has been sucessfully applied to a number applications even though the paradigm was not fully understood at the time.With this work, TMOP can be seen to be a tightly woven fabric of interconnecting ideas and concepts that provides a powerful approach to mesh optimization.The central unifying concepts in TMOP are the concept of a Target Matrix and the concept of Metric Type.Targetmatrices are motivated by the desire to make mesh quality improvement application-specific and, when needed, solution-adaptive.Metric type plays an essential role because it provides, through the use of typed metrics, the bridge between application-specific quality and target construction.It is shown that there are eight theoretical metric types, including the shape and shape+size types used informally in the past.It is shown further that there exist well-posed metrics corresponding to six of the eight metric types.A well-posed metric is a metric that is typed and convex, polyconvex, or invex, and further, it is a metric that simplifies target construction."} | ||
| 145 | −{"work_id": 4390874575, "title": "Segment Anything", "abstract": "We introduce the Segment Anything (SA) project: a new task, model, and dataset for image segmentation. Using our efficient model in a data collection loop, we built the largest segmentation dataset to date (by far), with over 1 billion masks on 11M licensed and privacy respecting images. The model is designed and trained to be promptable, so it can transfer zero-shot to new image distributions and tasks. We evaluate its capabilities on numerous tasks and find that its zero-shot performance is impressive \u2013 often competitive with or even superior to prior fully supervised results. We are releasing the Segment Anything Model (SAM) and corresponding dataset (SA-1B) of 1B masks and 11M images at segment-anything.com to foster research into foundation models for computer vision. We recommend reading the full paper at: arxiv.org/abs/2304.02643."} | 163 | +{"work_id": 2902812770, "title": "Differentiable Monte Carlo ray tracing through edge sampling", "abstract": "Gradient-based methods are becoming increasingly important for computer graphics, machine learning, and computer vision. The ability to compute gradients is crucial to optimization, inverse problems, and deep learning. In rendering, the gradient is required with respect to variables such as camera parameters, light sources, scene geometry, or material appearance. However, computing the gradient of rendering is challenging because the rendering integral includes visibility terms that are not differentiable. Previous work on differentiable rendering has focused on approximate solutions. They often do not handle secondary effects such as shadows or global illumination, or they do not provide the gradient with respect to variables other than pixel coordinates. We introduce a general-purpose differentiable ray tracer, which, to our knowledge, is the first comprehensive solution that is able to compute derivatives of scalar functions over a rendered image with respect to arbitrary scene parameters such as camera pose, scene geometry, materials, and lighting parameters. The key to our method is a novel edge sampling algorithm that directly samples the Dirac delta functions introduced by the derivatives of the discontinuous integrand. We also develop efficient importance sampling methods based on spatial hierarchies. Our method can generate gradients in times running from seconds to minutes depending on scene complexity and desired precision. We interface our differentiable ray tracer with the deep learning library PyTorch and show prototype applications in inverse rendering and the generation of adversarial examples for neural networks."} | ||
| 146 | {"work_id": 3159481202, "title": "Emerging Properties in Self-Supervised Vision Transformers", "abstract": "In this paper, we question if self-supervised learning provides new properties to Vision Transformer (ViT) [16] that stand out compared to convolutional networks (convnets). Beyond the fact that adapting self-supervised methods to this architecture works particularly well, we make the following observations: first, self-supervised ViT features contain explicit information about the semantic segmentation of an image, which does not emerge as clearly with supervised ViTs, nor with convnets. Second, these features are also excellent k-NN classifiers, reaching 78.3% top-1 on ImageNet with a small ViT. Our study also underlines the importance of momentum encoder [26], multi-crop training [9], and the use of small patches with ViTs. We implement our findings into a simple self-supervised method, called DINO, which we interpret as a form of self-distillation with no labels. We show the synergy between DINO and ViTs by achieving 80.1% top-1 on ImageNet in linear evaluation with ViT-Base."} | 164 | {"work_id": 3159481202, "title": "Emerging Properties in Self-Supervised Vision Transformers", "abstract": "In this paper, we question if self-supervised learning provides new properties to Vision Transformer (ViT) [16] that stand out compared to convolutional networks (convnets). Beyond the fact that adapting self-supervised methods to this architecture works particularly well, we make the following observations: first, self-supervised ViT features contain explicit information about the semantic segmentation of an image, which does not emerge as clearly with supervised ViTs, nor with convnets. Second, these features are also excellent k-NN classifiers, reaching 78.3% top-1 on ImageNet with a small ViT. Our study also underlines the importance of momentum encoder [26], multi-crop training [9], and the use of small patches with ViTs. We implement our findings into a simple self-supervised method, called DINO, which we interpret as a form of self-distillation with no labels. We show the synergy between DINO and ViTs by achieving 80.1% top-1 on ImageNet in linear evaluation with ViT-Base."} | ||
| 147 | {"work_id": 3113347918, "title": "NeRD: Neural Reflectance Decomposition from Image Collections", "abstract": "Decomposing a scene into its shape, reflectance, and illumination is a challenging but important problem in computer vision and graphics. This problem is inherently more challenging when the illumination is not a single light source under laboratory conditions but is instead an unconstrained environmental illumination. Though recent work has shown that implicit representations can be used to model the radiance field of an object, most of these techniques only enable view synthesis and not relighting. Additionally, evaluating these radiance fields is resource and time-intensive. We propose a neural reflectance decomposition (NeRD) technique that uses physically-based rendering to decompose the scene into spatially varying BRDF material properties. In contrast to existing techniques, our input images can be captured under different illumination conditions. In addition, we also propose techniques to convert the learned reflectance volume into a relightable textured mesh enabling fast real-time rendering with novel illuminations. We demonstrate the potential of the proposed approach with experiments on both synthetic and real datasets, where we are able to obtain high-quality relightable 3D assets from image collections. The datasets and code are available at the project page: https://markboss.me/publication/2021-nerd/."} | 165 | {"work_id": 3113347918, "title": "NeRD: Neural Reflectance Decomposition from Image Collections", "abstract": "Decomposing a scene into its shape, reflectance, and illumination is a challenging but important problem in computer vision and graphics. This problem is inherently more challenging when the illumination is not a single light source under laboratory conditions but is instead an unconstrained environmental illumination. Though recent work has shown that implicit representations can be used to model the radiance field of an object, most of these techniques only enable view synthesis and not relighting. Additionally, evaluating these radiance fields is resource and time-intensive. We propose a neural reflectance decomposition (NeRD) technique that uses physically-based rendering to decompose the scene into spatially varying BRDF material properties. In contrast to existing techniques, our input images can be captured under different illumination conditions. In addition, we also propose techniques to convert the learned reflectance volume into a relightable textured mesh enabling fast real-time rendering with novel illuminations. We demonstrate the potential of the proposed approach with experiments on both synthetic and real datasets, where we are able to obtain high-quality relightable 3D assets from image collections. The datasets and code are available at the project page: https://markboss.me/publication/2021-nerd/."} | ||
| 148 | {"work_id": 3182555022, "title": "Generative Adversarial Networks for Semantic Image Synthesis and Unconditional Synthesis with Limited Data", "abstract": "Generative modeling of images is an important task aimed at synthesizing new images that are indistinguishable from real samples. The ability to generate diverse, realistic- looking images holds numerous applications, ranging from artistic content creation to data augmentation for other computer vision tasks. In this thesis, we study generative adversarial networks (GANs), which have gained popularity as the leading image synthesis framework due to their exceptional performance. GANs consist of a generator and a discriminator that are engaged in an adversarial game. In this game, the discriminator learns to correctly classify incoming real and fake images, while the generator is trained to fool the discriminator by producing more realistic samples. Although GANs have made significant advancements in recent years, more research is needed to further enhance their scalability across diverse datasets, as well as the quality and diversity of their synthesis. To this end, this thesis presents several new GAN methods that expand the literature on GANs in various aspects. \\n \\nFirstly, we address the task of semantic image synthesis, generating realistic images from semantic label maps. For this task, our work introduces a new segmentation-based discriminator that provides a strong training signal for the generator, eliminating the need for additional losses and tricks used in prior models. Compared to previous GAN approaches, our proposed method achieves a synthesis with higher image quality and diversity, while showing much better scalability to datasets with severe class imbalances. \\n \\nSecondly, we explore the training of unconditional GAN models in low data regimes. Previously, under limited data, GAN models suffered from training instabilities and memorization issues, which limited their application in restricted image domains. To address this, we propose new GAN approaches for various limited-data scenarios, including traditional one-shot and few-shot learning regimes. The advancements of our methods include new training schemes, improved architectures of discriminators, and novel regularization terms for generators. Our proposed methods enable high-quality and diverse synthesis from extremely small datasets, on which prior GAN models could not be trained successfully. \\n \\nOverall, this thesis advances the field of generative adversarial networks by introducing new GAN models that improve over prior work in the image synthesis quality, diversity, and applicability across various image domains. The proposed approaches demonstrate superior performance in semantic image synthesis and unconditional training with limited data, making GANs more powerful and effective for a wide range of computer vision applications."} | 166 | {"work_id": 3182555022, "title": "Generative Adversarial Networks for Semantic Image Synthesis and Unconditional Synthesis with Limited Data", "abstract": "Generative modeling of images is an important task aimed at synthesizing new images that are indistinguishable from real samples. The ability to generate diverse, realistic- looking images holds numerous applications, ranging from artistic content creation to data augmentation for other computer vision tasks. In this thesis, we study generative adversarial networks (GANs), which have gained popularity as the leading image synthesis framework due to their exceptional performance. GANs consist of a generator and a discriminator that are engaged in an adversarial game. In this game, the discriminator learns to correctly classify incoming real and fake images, while the generator is trained to fool the discriminator by producing more realistic samples. Although GANs have made significant advancements in recent years, more research is needed to further enhance their scalability across diverse datasets, as well as the quality and diversity of their synthesis. To this end, this thesis presents several new GAN methods that expand the literature on GANs in various aspects. \\n \\nFirstly, we address the task of semantic image synthesis, generating realistic images from semantic label maps. For this task, our work introduces a new segmentation-based discriminator that provides a strong training signal for the generator, eliminating the need for additional losses and tricks used in prior models. Compared to previous GAN approaches, our proposed method achieves a synthesis with higher image quality and diversity, while showing much better scalability to datasets with severe class imbalances. \\n \\nSecondly, we explore the training of unconditional GAN models in low data regimes. Previously, under limited data, GAN models suffered from training instabilities and memorization issues, which limited their application in restricted image domains. To address this, we propose new GAN approaches for various limited-data scenarios, including traditional one-shot and few-shot learning regimes. The advancements of our methods include new training schemes, improved architectures of discriminators, and novel regularization terms for generators. Our proposed methods enable high-quality and diverse synthesis from extremely small datasets, on which prior GAN models could not be trained successfully. \\n \\nOverall, this thesis advances the field of generative adversarial networks by introducing new GAN models that improve over prior work in the image synthesis quality, diversity, and applicability across various image domains. The proposed approaches demonstrate superior performance in semantic image synthesis and unconditional training with limited data, making GANs more powerful and effective for a wide range of computer vision applications."} | ||
@@ -150,42 +168,24 @@ | |||||
| 150 | {"work_id": 4300424419, "title": "U-Prithvi: Integrating a Foundation Model and U-Net for Enhanced Flood Inundation Mapping", "abstract": "In recent years, large pre-trained models, commonly referred to as foundation models, have become increasingly popular for various tasks leveraging transfer learning. This trend has expanded to remote sensing, where transformer-based foundation models such as Prithvi, msGFM, and SatSwinMAE have been utilized for a range of applications. While these transformer-based models, particularly the Prithvi model, exhibit strong generalization capabilities, they have limitations on capturing fine-grained details compared to convolutional neural network architectures like U-Net in segmentation tasks. In this paper, we propose a novel architecture, U-Prithvi, which combines the strengths of the Prithvi transformer with those of U-Net. We introduce a RandomHalfMaskLayer to ensure balanced learning from both models during training. Our approach is evaluated on the Sen1Floods11 dataset for flood inundation mapping, and experimental results demonstrate better performance of U-Prithvi over both individual models, achieving improved performance on out-of-sample data. While this principle is illustrated using the Prithvi model, it is easily adaptable to other foundation models."} | 168 | {"work_id": 4300424419, "title": "U-Prithvi: Integrating a Foundation Model and U-Net for Enhanced Flood Inundation Mapping", "abstract": "In recent years, large pre-trained models, commonly referred to as foundation models, have become increasingly popular for various tasks leveraging transfer learning. This trend has expanded to remote sensing, where transformer-based foundation models such as Prithvi, msGFM, and SatSwinMAE have been utilized for a range of applications. While these transformer-based models, particularly the Prithvi model, exhibit strong generalization capabilities, they have limitations on capturing fine-grained details compared to convolutional neural network architectures like U-Net in segmentation tasks. In this paper, we propose a novel architecture, U-Prithvi, which combines the strengths of the Prithvi transformer with those of U-Net. We introduce a RandomHalfMaskLayer to ensure balanced learning from both models during training. Our approach is evaluated on the Sen1Floods11 dataset for flood inundation mapping, and experimental results demonstrate better performance of U-Prithvi over both individual models, achieving improved performance on out-of-sample data. While this principle is illustrated using the Prithvi model, it is easily adaptable to other foundation models."} | ||
| 151 | {"work_id": 4385473486, "title": "RT-2: Vision-Language-Action Models Transfer Web Knowledge to Robotic Control", "abstract": "We study how vision-language models trained on Internet-scale data can be incorporated directly into end-to-end robotic control to boost generalization and enable emergent semantic reasoning. Our goal is to enable a single end-to-end trained model to both learn to map robot observations to actions and enjoy the benefits of large-scale pretraining on language and vision-language data from the web. To this end, we propose to co-fine-tune state-of-the-art vision-language models on both robotic trajectory data and Internet-scale vision-language tasks, such as visual question answering. In contrast to other approaches, we propose a simple, general recipe to achieve this goal: in order to fit both natural language responses and robotic actions into the same format, we express the actions as text tokens and incorporate them directly into the training set of the model in the same way as natural language tokens. We refer to such category of models as vision-language-action models (VLA) and instantiate an example of such a model, which we call RT-2. Our extensive evaluation (6k evaluation trials) shows that our approach leads to performant robotic policies and enables RT-2 to obtain a range of emergent capabilities from Internet-scale training. This includes significantly improved generalization to novel objects, the ability to interpret commands not present in the robot training data (such as placing an object onto a particular number or icon), and the ability to perform rudimentary reasoning in response to user commands (such as picking up the smallest or largest object, or the one closest to another object). We further show that incorporating chain of thought reasoning allows RT-2 to perform multi-stage semantic reasoning, for example figuring out which object to pick up for use as an improvised hammer (a rock), or which type of drink is best suited for someone who is tired (an energy drink)."} | 169 | {"work_id": 4385473486, "title": "RT-2: Vision-Language-Action Models Transfer Web Knowledge to Robotic Control", "abstract": "We study how vision-language models trained on Internet-scale data can be incorporated directly into end-to-end robotic control to boost generalization and enable emergent semantic reasoning. Our goal is to enable a single end-to-end trained model to both learn to map robot observations to actions and enjoy the benefits of large-scale pretraining on language and vision-language data from the web. To this end, we propose to co-fine-tune state-of-the-art vision-language models on both robotic trajectory data and Internet-scale vision-language tasks, such as visual question answering. In contrast to other approaches, we propose a simple, general recipe to achieve this goal: in order to fit both natural language responses and robotic actions into the same format, we express the actions as text tokens and incorporate them directly into the training set of the model in the same way as natural language tokens. We refer to such category of models as vision-language-action models (VLA) and instantiate an example of such a model, which we call RT-2. Our extensive evaluation (6k evaluation trials) shows that our approach leads to performant robotic policies and enables RT-2 to obtain a range of emergent capabilities from Internet-scale training. This includes significantly improved generalization to novel objects, the ability to interpret commands not present in the robot training data (such as placing an object onto a particular number or icon), and the ability to perform rudimentary reasoning in response to user commands (such as picking up the smallest or largest object, or the one closest to another object). We further show that incorporating chain of thought reasoning allows RT-2 to perform multi-stage semantic reasoning, for example figuring out which object to pick up for use as an improvised hammer (a rock), or which type of drink is best suited for someone who is tired (an energy drink)."} | ||
| 152 | {"work_id": 2925148167, "title": "nuScenes: A Multimodal Dataset for Autonomous Driving", "abstract": "Robust detection and tracking of objects is crucial for the deployment of autonomous vehicle technology. Image based benchmark datasets have driven development in computer vision tasks such as object detection, tracking and segmentation of agents in the environment. Most autonomous vehicles, however, carry a combination of cameras and range sensors such as lidar and radar. As machine learning based methods for detection and tracking become more prevalent, there is a need to train and evaluate such methods on datasets containing range sensor data along with images. In this work we present nuTonomy scenes (nuScenes), the first dataset to carry the full autonomous vehicle sensor suite: 6 cameras, 5 radars and 1 lidar, all with full 360 degree field of view. nuScenes comprises 1000 scenes, each 20s long and fully annotated with 3D bounding boxes for 23 classes and 8 attributes. It has 7x as many annotations and 100x as many images as the pioneering KITTI dataset. We define novel 3D detection and tracking metrics. We also provide careful dataset analysis as well as baselines for lidar and image based detection and tracking. Data, development kit and more information are available online."} | 170 | {"work_id": 2925148167, "title": "nuScenes: A Multimodal Dataset for Autonomous Driving", "abstract": "Robust detection and tracking of objects is crucial for the deployment of autonomous vehicle technology. Image based benchmark datasets have driven development in computer vision tasks such as object detection, tracking and segmentation of agents in the environment. Most autonomous vehicles, however, carry a combination of cameras and range sensors such as lidar and radar. As machine learning based methods for detection and tracking become more prevalent, there is a need to train and evaluate such methods on datasets containing range sensor data along with images. In this work we present nuTonomy scenes (nuScenes), the first dataset to carry the full autonomous vehicle sensor suite: 6 cameras, 5 radars and 1 lidar, all with full 360 degree field of view. nuScenes comprises 1000 scenes, each 20s long and fully annotated with 3D bounding boxes for 23 classes and 8 attributes. It has 7x as many annotations and 100x as many images as the pioneering KITTI dataset. We define novel 3D detection and tracking metrics. We also provide careful dataset analysis as well as baselines for lidar and image based detection and tracking. Data, development kit and more information are available online."} | ||
| 171 | +{"work_id": 2758237641, "title": "Using Simulation and Domain Adaptation to Improve Efficiency of Deep Robotic Grasping", "abstract": "Instrumenting and collecting annotated visual grasping datasets to train modern machine learning algorithms can be extremely time-consuming and expensive. An appealing alternative is to use off-the-shelf simulators to render synthetic data for which ground-truth annotations are generated automatically. Unfortunately, models trained purely on simulated data often fail to generalize to the real world. We study how randomized simulated environments and domain adaptation methods can be extended to train a grasping system to grasp novel objects from raw monocular RGB images. We extensively evaluate our approaches with a total of more than 25,000 physical test grasps, studying a range of simulation conditions and domain adaptation methods, including a novel extension of pixel-level domain adaptation that we term the GraspGAN. We show that, by using synthetic data and domain adaptation, we are able to reduce the number of real-world samples needed to achieve a given level of performance by up to 50 times, using only randomly generated simulated objects. We also show that by using only unlabeled real-world data and our GraspGAN methodology, we obtain real-world grasping performance without any real-world labels that is similar to that achieved with 939,777 labeled real-world samples."} | ||||
| 153 | {"work_id": 4385430674, "title": "Learning Fine-Grained Bimanual Manipulation with Low-Cost Hardware", "abstract": "Meta Fig. 1: ALOHA : A Low-cost Open-source Hardware System for Bimanual Teleoperation.The whole system costs <$20k with off-the-shelf robots and 3D printed components.Left: The user teleoperates by backdriving the leader robots, with the follower robots mirroring the motion.Right: ALOHA is capable of precise, contact-rich, and dynamic tasks.We show examples of both teleoperated and learned skills.Abstract-Fine manipulation tasks, such as threading cable ties or slotting a battery, are notoriously difficult for robots because they require precision, careful coordination of contact forces, and closed-loop visual feedback.Performing these tasks typically requires high-end robots, accurate sensors, or careful calibration, which can be expensive and difficult to set up.Can learning enable low-cost and imprecise hardware to perform these fine manipulation tasks?We present a low-cost system that performs end-to-end imitation learning directly from real demonstrations, collected with a custom teleoperation interface.Imitation learning, however, presents its own challenges, particularly in high-precision domains: errors in the policy can compound over time, and human demonstrations can be non-stationary.To address these challenges, we develop a simple yet novel algorithm, Action Chunking with Transformers (ACT), which learns a generative model over action sequences.ACT allows the robot to learn 6 difficult tasks in the real world, such as opening a translucent condiment cup and slotting a battery with 80-90% success, with only 10 minutes worth of demonstrations.Project website: tonyzhaozh.github.io/aloha"} | 172 | {"work_id": 4385430674, "title": "Learning Fine-Grained Bimanual Manipulation with Low-Cost Hardware", "abstract": "Meta Fig. 1: ALOHA : A Low-cost Open-source Hardware System for Bimanual Teleoperation.The whole system costs <$20k with off-the-shelf robots and 3D printed components.Left: The user teleoperates by backdriving the leader robots, with the follower robots mirroring the motion.Right: ALOHA is capable of precise, contact-rich, and dynamic tasks.We show examples of both teleoperated and learned skills.Abstract-Fine manipulation tasks, such as threading cable ties or slotting a battery, are notoriously difficult for robots because they require precision, careful coordination of contact forces, and closed-loop visual feedback.Performing these tasks typically requires high-end robots, accurate sensors, or careful calibration, which can be expensive and difficult to set up.Can learning enable low-cost and imprecise hardware to perform these fine manipulation tasks?We present a low-cost system that performs end-to-end imitation learning directly from real demonstrations, collected with a custom teleoperation interface.Imitation learning, however, presents its own challenges, particularly in high-precision domains: errors in the policy can compound over time, and human demonstrations can be non-stationary.To address these challenges, we develop a simple yet novel algorithm, Action Chunking with Transformers (ACT), which learns a generative model over action sequences.ACT allows the robot to learn 6 difficult tasks in the real world, such as opening a translucent condiment cup and slotting a battery with 80-90% success, with only 10 minutes worth of demonstrations.Project website: tonyzhaozh.github.io/aloha"} | ||
| 154 | −{"work_id": 3144501610, "title": "Differentiable visual computing", "abstract": "This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections."} | ||||
| 155 | {"work_id": 4402988539, "title": "Artificial Intelligence-Enabled Intelligent Assistant for Personalized and Adaptive Learning in Higher Education", "abstract": "This paper presents a novel framework, artificial intelligence-enabled intelligent assistant (AIIA), for personalized and adaptive learning in higher education. The AIIA system leverages advanced AI and natural language processing (NLP) techniques to create an interactive and engaging learning platform. This platform is engineered to reduce cognitive load on learners by providing easy access to information, facilitating knowledge assessment, and delivering personalized learning support tailored to individual needs and learning styles. The AIIA\u2019s capabilities include understanding and responding to student inquiries, generating quizzes and flashcards, and offering personalized learning pathways. The research findings have the potential to significantly impact the design, implementation, and evaluation of AI-enabled virtual teaching assistants (VTAs) in higher education, informing the development of innovative educational tools that can enhance student learning outcomes, engagement, and satisfaction. The paper presents the methodology, system architecture, intelligent services, and integration with learning management systems (LMSs) while discussing the challenges, limitations, and future directions for the development of AI-enabled intelligent assistants in education."} | 173 | {"work_id": 4402988539, "title": "Artificial Intelligence-Enabled Intelligent Assistant for Personalized and Adaptive Learning in Higher Education", "abstract": "This paper presents a novel framework, artificial intelligence-enabled intelligent assistant (AIIA), for personalized and adaptive learning in higher education. The AIIA system leverages advanced AI and natural language processing (NLP) techniques to create an interactive and engaging learning platform. This platform is engineered to reduce cognitive load on learners by providing easy access to information, facilitating knowledge assessment, and delivering personalized learning support tailored to individual needs and learning styles. The AIIA\u2019s capabilities include understanding and responding to student inquiries, generating quizzes and flashcards, and offering personalized learning pathways. The research findings have the potential to significantly impact the design, implementation, and evaluation of AI-enabled virtual teaching assistants (VTAs) in higher education, informing the development of innovative educational tools that can enhance student learning outcomes, engagement, and satisfaction. The paper presents the methodology, system architecture, intelligent services, and integration with learning management systems (LMSs) while discussing the challenges, limitations, and future directions for the development of AI-enabled intelligent assistants in education."} | ||
| 156 | {"work_id": 4224308101, "title": "PaLM: Scaling Language Modeling with Pathways", "abstract": "Large language models have been shown to achieve remarkable performance across a variety of natural language tasks using few-shot learning, which drastically reduces the number of task-specific training examples needed to adapt the model to a particular application. To further our understanding of the impact of scale on few-shot learning, we trained a 540-billion parameter, densely activated, Transformer language model, which we call Pathways Language Model PaLM. We trained PaLM on 6144 TPU v4 chips using Pathways, a new ML system which enables highly efficient training across multiple TPU Pods. We demonstrate continued benefits of scaling by achieving state-of-the-art few-shot learning results on hundreds of language understanding and generation benchmarks. On a number of these tasks, PaLM 540B achieves breakthrough performance, outperforming the finetuned state-of-the-art on a suite of multi-step reasoning tasks, and outperforming average human performance on the recently released BIG-bench benchmark. A significant number of BIG-bench tasks showed discontinuous improvements from model scale, meaning that performance steeply increased as we scaled to our largest model. PaLM also has strong capabilities in multilingual tasks and source code generation, which we demonstrate on a wide array of benchmarks. We additionally provide a comprehensive analysis on bias and toxicity, and study the extent of training data memorization with respect to model scale. Finally, we discuss the ethical considerations related to large language models and discuss potential mitigation strategies."} | 174 | {"work_id": 4224308101, "title": "PaLM: Scaling Language Modeling with Pathways", "abstract": "Large language models have been shown to achieve remarkable performance across a variety of natural language tasks using few-shot learning, which drastically reduces the number of task-specific training examples needed to adapt the model to a particular application. To further our understanding of the impact of scale on few-shot learning, we trained a 540-billion parameter, densely activated, Transformer language model, which we call Pathways Language Model PaLM. We trained PaLM on 6144 TPU v4 chips using Pathways, a new ML system which enables highly efficient training across multiple TPU Pods. We demonstrate continued benefits of scaling by achieving state-of-the-art few-shot learning results on hundreds of language understanding and generation benchmarks. On a number of these tasks, PaLM 540B achieves breakthrough performance, outperforming the finetuned state-of-the-art on a suite of multi-step reasoning tasks, and outperforming average human performance on the recently released BIG-bench benchmark. A significant number of BIG-bench tasks showed discontinuous improvements from model scale, meaning that performance steeply increased as we scaled to our largest model. PaLM also has strong capabilities in multilingual tasks and source code generation, which we demonstrate on a wide array of benchmarks. We additionally provide a comprehensive analysis on bias and toxicity, and study the extent of training data memorization with respect to model scale. Finally, we discuss the ethical considerations related to large language models and discuss potential mitigation strategies."} | ||
| 157 | {"work_id": 2949117887, "title": "Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shift", "abstract": "Training Deep Neural Networks is complicated by the fact that the distribution of each layer's inputs changes during training, as the parameters of the previous layers change. This slows down the training by requiring lower learning rates and careful parameter initialization, and makes it notoriously hard to train models with saturating nonlinearities. We refer to this phenomenon as internal covariate shift, and address the problem by normalizing layer inputs. Our method draws its strength from making normalization a part of the model architecture and performing the normalization for each training mini-batch. Batch Normalization allows us to use much higher learning rates and be less careful about initialization. It also acts as a regularizer, in some cases eliminating the need for Dropout. Applied to a state-of-the-art image classification model, Batch Normalization achieves the same accuracy with 14 times fewer training steps, and beats the original model by a significant margin. Using an ensemble of batch-normalized networks, we improve upon the best published result on ImageNet classification: reaching 4.9% top-5 validation error (and 4.8% test error), exceeding the accuracy of human raters."} | 175 | {"work_id": 2949117887, "title": "Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shift", "abstract": "Training Deep Neural Networks is complicated by the fact that the distribution of each layer's inputs changes during training, as the parameters of the previous layers change. This slows down the training by requiring lower learning rates and careful parameter initialization, and makes it notoriously hard to train models with saturating nonlinearities. We refer to this phenomenon as internal covariate shift, and address the problem by normalizing layer inputs. Our method draws its strength from making normalization a part of the model architecture and performing the normalization for each training mini-batch. Batch Normalization allows us to use much higher learning rates and be less careful about initialization. It also acts as a regularizer, in some cases eliminating the need for Dropout. Applied to a state-of-the-art image classification model, Batch Normalization achieves the same accuracy with 14 times fewer training steps, and beats the original model by a significant margin. Using an ensemble of batch-normalized networks, we improve upon the best published result on ImageNet classification: reaching 4.9% top-5 validation error (and 4.8% test error), exceeding the accuracy of human raters."} | ||
| 158 | {"work_id": 4399300671, "title": "The effects of back\u2010projection variants in BPF\u2010like TOF PET reconstruction using CNN filtration \u2013 Based on simulated and clinical brain data", "abstract": "Abstract Background The back\u2010projection strategies such as confidence weighting (CW) and most likely annihilation position (MLAP) have been adopted into back\u2010projection\u2010and\u2010filtering\u2010like (BPF\u2010like) deep reconstruction model and shown great potential on fast and accurate PET reconstruction. Although the two methods degenerate to an identical model at the time resolution of 0 ps, they represent two distinct approaches at the realistic time resolutions of current commercial systems. There is a lack of a systematic and fair assessment on these differences. Purpose This work aims to analyze the impact of back\u2010projection variants on CNN\u2010based PET image reconstruction to find the most effective back\u2010projection model, and ultimately contribute to accurate PET reconstruction. Methods Different back\u2010projection strategies (CW and MLAP) and different angular view processing methods (view\u2010summed and view\u2010grouped) were considered, leading to the comparison of four back\u2010projection variants integrated with the same CNN filtration model. Meanwhile, we investigated two strategies of physical effect compensation, either introducing pre\u2010corrected data as the input or adding a channel of attenuation map to the CNN model. After training models separately on Monte\u2010Carlo\u2010simulated BrainWeb phantoms with full dose (events = 3\u00d7107), we tested them on both simulated phantoms and clinical brain scans with two dosage levels. For the performance assessment, peak signal\u2010to\u2010noise ratio (PSNR) and root mean square error (RMSE) were used to evaluate the pixel\u2010wise error, structural similarity index (SSIM) to evaluate the structural similarity, and contrast recovery coefficient (CRC) in manually selected ROI to compare the region recovery. Results Compared to two MLAP\u2010based histo\u2010image reconstruction models, two CW\u2010based back\u2010projected image methods produced clearer, sharper, and more detailed images, from both simulated and clinical data. For angular view processing methods, view\u2010grouped histo\u2010image improved image quality, while view\u2010grouped cwbp\u2010image showed no advantage except for contrast recovery. Quantitative analysis on simulated data demonstrated that the view\u2010summed cwbp\u2010image model achieved the best PSNR, RMSE, SSIM, while the 8\u2010view cwbp\u2010image model achieved the best CRC in lesions and the white matter. Additionally, the multi\u2010channel input model including the back\u2010projection image and attenuation map was proved to be the most efficient and simplest method for compensating for physical effects for brain data. Applying Gaussian blur to the histo\u2010image yielded images with limited improvement. All above results hold for both the half\u2010dose and the full\u2010dose cases. Conclusion For brain imaging, the evaluation based on metrics PSNR, RMSE, SSIM, and CRC indicates that the view\u2010summed CW\u2010based back\u2010projection variant is the most effective input for the BPF\u2010like reconstruction model using CNN filtration, which can involve the attenuation map through an additional channel to effectively compensate for physical effects."} | 176 | {"work_id": 4399300671, "title": "The effects of back\u2010projection variants in BPF\u2010like TOF PET reconstruction using CNN filtration \u2013 Based on simulated and clinical brain data", "abstract": "Abstract Background The back\u2010projection strategies such as confidence weighting (CW) and most likely annihilation position (MLAP) have been adopted into back\u2010projection\u2010and\u2010filtering\u2010like (BPF\u2010like) deep reconstruction model and shown great potential on fast and accurate PET reconstruction. Although the two methods degenerate to an identical model at the time resolution of 0 ps, they represent two distinct approaches at the realistic time resolutions of current commercial systems. There is a lack of a systematic and fair assessment on these differences. Purpose This work aims to analyze the impact of back\u2010projection variants on CNN\u2010based PET image reconstruction to find the most effective back\u2010projection model, and ultimately contribute to accurate PET reconstruction. Methods Different back\u2010projection strategies (CW and MLAP) and different angular view processing methods (view\u2010summed and view\u2010grouped) were considered, leading to the comparison of four back\u2010projection variants integrated with the same CNN filtration model. Meanwhile, we investigated two strategies of physical effect compensation, either introducing pre\u2010corrected data as the input or adding a channel of attenuation map to the CNN model. After training models separately on Monte\u2010Carlo\u2010simulated BrainWeb phantoms with full dose (events = 3\u00d7107), we tested them on both simulated phantoms and clinical brain scans with two dosage levels. For the performance assessment, peak signal\u2010to\u2010noise ratio (PSNR) and root mean square error (RMSE) were used to evaluate the pixel\u2010wise error, structural similarity index (SSIM) to evaluate the structural similarity, and contrast recovery coefficient (CRC) in manually selected ROI to compare the region recovery. Results Compared to two MLAP\u2010based histo\u2010image reconstruction models, two CW\u2010based back\u2010projected image methods produced clearer, sharper, and more detailed images, from both simulated and clinical data. For angular view processing methods, view\u2010grouped histo\u2010image improved image quality, while view\u2010grouped cwbp\u2010image showed no advantage except for contrast recovery. Quantitative analysis on simulated data demonstrated that the view\u2010summed cwbp\u2010image model achieved the best PSNR, RMSE, SSIM, while the 8\u2010view cwbp\u2010image model achieved the best CRC in lesions and the white matter. Additionally, the multi\u2010channel input model including the back\u2010projection image and attenuation map was proved to be the most efficient and simplest method for compensating for physical effects for brain data. Applying Gaussian blur to the histo\u2010image yielded images with limited improvement. All above results hold for both the half\u2010dose and the full\u2010dose cases. Conclusion For brain imaging, the evaluation based on metrics PSNR, RMSE, SSIM, and CRC indicates that the view\u2010summed CW\u2010based back\u2010projection variant is the most effective input for the BPF\u2010like reconstruction model using CNN filtration, which can involve the attenuation map through an additional channel to effectively compensate for physical effects."} | ||
| 159 | {"work_id": 2979826702, "title": "Transformers: State-of-the-Art Natural Language Processing", "abstract": "Thomas Wolf, Lysandre Debut, Victor Sanh, Julien Chaumond, Clement Delangue, Anthony Moi, Pierric Cistac, Tim Rault, Remi Louf, Morgan Funtowicz, Joe Davison, Sam Shleifer, Patrick von Platen, Clara Ma, Yacine Jernite, Julien Plu, Canwen Xu, Teven Le Scao, Sylvain Gugger, Mariama Drame, Quentin Lhoest, Alexander Rush. Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing: System Demonstrations. 2020."} | 177 | {"work_id": 2979826702, "title": "Transformers: State-of-the-Art Natural Language Processing", "abstract": "Thomas Wolf, Lysandre Debut, Victor Sanh, Julien Chaumond, Clement Delangue, Anthony Moi, Pierric Cistac, Tim Rault, Remi Louf, Morgan Funtowicz, Joe Davison, Sam Shleifer, Patrick von Platen, Clara Ma, Yacine Jernite, Julien Plu, Canwen Xu, Teven Le Scao, Sylvain Gugger, Mariama Drame, Quentin Lhoest, Alexander Rush. Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing: System Demonstrations. 2020."} | ||
| 160 | {"work_id": 4402727764, "title": "Improved Baselines with Visual Instruction Tuning", "abstract": "Large multimodal models (LMM) have recently shown encouraging progress with visual instruction tuning. In this paper, we present the first systematic study to investigate the design choices of LMMs in a controlled setting under the LLaVA framework. We show that the fully-connected vision-language connector in LLaVA is surprisingly power-ful and data-efficient. With simple modifications to LLa VA, namely, using CLIP- ViT-L-336px with an MLP projection and adding academic-task-oriented VQA data with response formatting prompts, we establish stronger baselines that achieve state-of-the-art across 11 benchmarks. Our final 13B checkpoint uses merely 1.2M publicly available data, and finishes full training in ~ 1 day on a single 8-AI00 node. Furthermore, we present some early exploration of open problems in LMMs, including scaling to higher resolution inputs, compositional capabilities, and model hallucination, etc. We hope this makes state-of-the-art LMM research more accessible. Code and model will be publicly available."} | 178 | {"work_id": 4402727764, "title": "Improved Baselines with Visual Instruction Tuning", "abstract": "Large multimodal models (LMM) have recently shown encouraging progress with visual instruction tuning. In this paper, we present the first systematic study to investigate the design choices of LMMs in a controlled setting under the LLaVA framework. We show that the fully-connected vision-language connector in LLaVA is surprisingly power-ful and data-efficient. With simple modifications to LLa VA, namely, using CLIP- ViT-L-336px with an MLP projection and adding academic-task-oriented VQA data with response formatting prompts, we establish stronger baselines that achieve state-of-the-art across 11 benchmarks. Our final 13B checkpoint uses merely 1.2M publicly available data, and finishes full training in ~ 1 day on a single 8-AI00 node. Furthermore, we present some early exploration of open problems in LMMs, including scaling to higher resolution inputs, compositional capabilities, and model hallucination, etc. We hope this makes state-of-the-art LMM research more accessible. Code and model will be publicly available."} | ||
| 161 | −{"work_id": 1797268635, "title": "Caltech-UCSD Birds-200-2011 Dataset", "abstract": "CUB-200-2011 is an extended version of CUB-200 [7], a challenging dataset of 200 bird species. The extended version roughly doubles the number of images per category and adds new part localization annotations. All images are annotated with bounding boxes, part locations, and at- tribute labels. Images and annotations were filtered by mul- tiple users of Mechanical Turk. We introduce benchmarks and baseline experiments for multi-class categorization and part localization."} | 179 | +{"work_id": 2911489562, "title": "BioBERT: a pre-trained biomedical language representation model for biomedical text mining", "abstract": "MOTIVATION: Biomedical text mining is becoming increasingly important as the number of biomedical documents rapidly grows. With the progress in natural language processing (NLP), extracting valuable information from biomedical literature has gained popularity among researchers, and deep learning has boosted the development of effective biomedical text mining models. However, directly applying the advancements in NLP to biomedical text mining often yields unsatisfactory results due to a word distribution shift from general domain corpora to biomedical corpora. In this article, we investigate how the recently introduced pre-trained language model BERT can be adapted for biomedical corpora. RESULTS: We introduce BioBERT (Bidirectional Encoder Representations from Transformers for Biomedical Text Mining), which is a domain-specific language representation model pre-trained on large-scale biomedical corpora. With almost the same architecture across tasks, BioBERT largely outperforms BERT and previous state-of-the-art models in a variety of biomedical text mining tasks when pre-trained on biomedical corpora. While BERT obtains performance comparable to that of previous state-of-the-art models, BioBERT significantly outperforms them on the following three representative biomedical text mining tasks: biomedical named entity recognition (0.62% F1 score improvement), biomedical relation extraction (2.80% F1 score improvement) and biomedical question answering (12.24% MRR improvement). Our analysis results show that pre-training BERT on biomedical corpora helps it to understand complex biomedical texts. AVAILABILITY AND IMPLEMENTATION: We make the pre-trained weights of BioBERT freely available at https://github.com/naver/biobert-pretrained, and the source code for fine-tuning BioBERT available at https://github.com/dmis-lab/biobert."} | ||
| 162 | −{"work_id": 1483393136, "title": "Advanced high dynamic range imaging : theory and practice", "abstract": "Imaging techniques seek to simulate the array of light that reaches our eyes to provide the illusion of sensing scenes directly. Both photography and computer graphics deal with the generation of images. Both disciplines have to cope with the high dynamic range in the energy of visible light that human eyes can sense. Traditionally photography and computer graphics took different approaches to the high dynamic range problem. Work over the last ten years though has unified these disciplines and created powerful new tools for the creation of complex, compelling and realistic images. This book provides a practical introduction to the emerging new discipline of high dynamic range imaging that combines photography and computer graphics. By providing detailed equations and code, the book gives the reader the tools needed to experiment with new techniques for creating compelling images. A supplemental website contains downloads and additional information."} | 180 | +{"work_id": 3016007010, "title": "State of the Art on Neural Rendering", "abstract": "Abstract Efficient rendering of photo\u2010realistic virtual worlds is a long standing effort of computer graphics. Modern graphics techniques have succeeded in synthesizing photo\u2010realistic images from hand\u2010crafted scene representations. However, the automatic generation of shape, materials, lighting, and other aspects of scenes remains a challenging problem that, if solved, would make photo\u2010realistic computer graphics more widely accessible. Concurrently, progress in computer vision and machine learning have given rise to a new approach to image synthesis and editing, namely deep generative models. Neural rendering is a new and rapidly emerging field that combines generative machine learning techniques with physical knowledge from computer graphics, e.g., by the integration of differentiable rendering into network training. With a plethora of applications in computer graphics and vision, neural rendering is poised to become a new area in the graphics community, yet no survey of this emerging field exists. This state\u2010of\u2010the\u2010art report summarizes the recent trends and applications of neural rendering. We focus on approaches that combine classic computer graphics techniques with deep generative models to obtain controllable and photorealistic outputs. Starting with an overview of the underlying computer graphics and machine learning concepts, we discuss critical aspects of neural rendering approaches. Specifically, our emphasis is on the type of control, i.e., how the control is provided, which parts of the pipeline are learned, explicit vs. implicit control, generalization, and stochastic vs. deterministic synthesis. The second half of this state\u2010of\u2010the\u2010art report is focused on the many important use cases for the described algorithms such as novel view synthesis, semantic photo manipulation, facial and body reenactment, relighting, free\u2010viewpoint video, and the creation of photo\u2010realistic avatars for virtual and augmented reality telepresence. Finally, we conclude with a discussion of the social implications of such technology and investigate open research problems."} | ||
| 163 | −{"work_id": 4287824654, "title": "Question Answering For Toxicological Information Extraction", "abstract": "Working with large amounts of text data has become hectic and time-consuming. In order to reduce human effort, costs, and make the process more efficient, companies and organizations resort to intelligent algorithms to automate and assist the manual work. This problem is also present in the field of toxicological analysis of chemical substances, where information needs to be searched from multiple documents. That said, we propose an approach that relies on Question Answering for acquiring information from unstructured data, in our case, English PDF documents containing information about physicochemical and toxicological properties of chemical substances. Experimental results confirm that our approach achieves promising results which can be applicable in the business scenario, especially if further revised by humans."} | 181 | +{"work_id": 3177052299, "title": "Coordinate Attention for Efficient Mobile Network Design", "abstract": "Recent studies on mobile network design have demonstrated the remarkable effectiveness of channel attention (e.g., the Squeeze-and-Excitation attention) for lifting model performance, but they generally neglect the positional information, which is important for generating spatially selective attention maps. In this paper, we propose a novel attention mechanism for mobile networks by embedding positional information into channel attention, which we call \"coordinate attention\". Unlike channel attention that transforms a feature tensor to a single feature vector via 2D global pooling, the coordinate attention factorizes channel attention into two 1D feature encoding processes that aggregate features along the two spatial directions, respectively. In this way, long-range dependencies can be captured along one spatial direction and meanwhile precise positional information can be preserved along the other spatial direction. The resulting feature maps are then encoded separately into a pair of direction-aware and position-sensitive attention maps that can be complementarily applied to the input feature map to augment the representations of the objects of interest. Our coordinate attention is simple and can be flexibly plugged into classic mobile networks, such as MobileNetV2, MobileNeXt, and EfficientNet with nearly no computational overhead. Extensive experiments demonstrate that our coordinate attention is not only beneficial to ImageNet classification but more interestingly, behaves better in down-stream tasks, such as object detection and semantic segmentation. Code is available at https://github.com/Andrew-Qibin/CoordAttention."} | ||
| 164 | −{"work_id": 3118608800, "title": "Learning Multiple Layers of Features from Tiny Images", "abstract": "April 8, 2009Groups at MIT and NYU have collected a dataset of millions of tiny colour images from the web. It is, in principle, an excellent dataset for unsupervised training of deep generative models, but previous researchers who have tried this have found it di cult to learn a good set of lters from the images. We show how to train a multi-layer generative model that learns to extract meaningful features which resemble those found in the human visual cortex. Using a novel parallelization algorithm to distribute the work among multiple machines connected on a network, we show how training such a model can be done in reasonable time. A second problematic aspect of the tiny images dataset is that there are no reliable class labels which makes it hard to use for object recognition experiments. We created two sets of reliable labels. The CIFAR-10 set has 6000 examples of each of 10 classes and the CIFAR-100 set has 600 examples of each of 100 non-overlapping classes. Using these labels, we show that object recognition is signi cantly"} | ||||
| 165 | −{"work_id": 4285585446, "title": "Metaverse beyond the hype: Multidisciplinary perspectives on emerging challenges, opportunities, and agenda for research, practice and policy", "abstract": "The metaverse has the potential to extend the physical world using augmented and virtual reality technologies allowing users to seamlessly interact within real and simulated environments using avatars and holograms. Virtual environments and immersive games (such as, Second Life, Fortnite, Roblox and VRChat) have been described as antecedents of the metaverse and offer some insight to the potential socio-economic impact of a fully functional persistent cross platform metaverse. Separating the hype and \u201cmeta\u2026\u201d rebranding from current reality is difficult, as \u201cbig tech\u201d paints a picture of the transformative nature of the metaverse and how it will positively impact people in their work, leisure, and social interaction. The potential impact on the way we conduct business, interact with brands and others, and develop shared experiences is likely to be transformational as the distinct lines between physical and digital are likely to be somewhat blurred from current perceptions. However, although the technology and infrastructure does not yet exist to allow the development of new immersive virtual worlds at scale - one that our avatars could transcend across platforms, researchers are increasingly examining the transformative impact of the metaverse. Impacted sectors include marketing, education, healthcare as well as societal effects relating to social interaction factors from widespread adoption, and issues relating to trust, privacy, bias, disinformation, application of law as well as psychological aspects linked to addiction and impact on vulnerable people. This study examines these topics in detail by combining the informed narrative and multi-perspective approach from experts with varied disciplinary backgrounds on many aspects of the metaverse and its transformational impact. The paper concludes by proposing a future research agenda that is valuable for researchers, professionals and policy makers alike."} | ||||
| 166 | −{"work_id": 3187418919, "title": "A Survey on Vision Transformer", "abstract": "Transformer, first applied to the field of natural language processing, is a type of deep neural network mainly based on the self-attention mechanism. Thanks to its strong representation capabilities, researchers are looking at ways to apply transformer to computer vision tasks. In a variety of visual benchmarks, transformer-based models perform similar to or better than other types of networks such as convolutional and recurrent neural networks. Given its high performance and less need for vision-specific inductive bias, transformer is receiving more and more attention from the computer vision community. In this paper, we review these vision transformer models by categorizing them in different tasks and analyzing their advantages and disadvantages. The main categories we explore include the backbone network, high/mid-level vision, low-level vision, and video processing. We also include efficient transformer methods for pushing transformer into real device-based applications. Furthermore, we also take a brief look at the self-attention mechanism in computer vision, as it is the base component in transformer. Toward the end of this paper, we discuss the challenges and provide several further research directions for vision transformers."} | ||||
| 167 | −{"work_id": 4408943584, "title": "Digital learning in the 21st century: trends, challenges, and innovations in technology integration", "abstract": "The integration of digital technologies into education represents a significant evolution in the pedagogical landscape, with the potential to enhance accessibility, engagement, and personalization in learning. This review synthesizes current trends, challenges, and innovations within digital learning, emphasizing the impact of artificial intelligence (AI), virtual reality (VR), and online platforms on student achievement. It highlights the importance of addressing technical, pedagogical, and socioeconomic challenges to ensure equitable access to technology. Successful initiatives like the Open University illustrate digital learning's potential to improve educational outcomes. The review also anticipates future directions, including the expanding role of AI, VR, mobile learning, and blockchain in education. It concludes with strategic recommendations for educators and policymakers to adopt best practices, prioritize infrastructure development, and focus on continuous professional development to leverage the benefits of digital learning. As education enters an era of digital transformation, a collaborative approach among stakeholders will be essential in creating an inclusive and effective learning environment for the future."} | ||||
| 168 | −{"work_id": 3128261063, "title": "seaborn: statistical data visualization", "abstract": "seaborn is a library for making statistical graphics in Python.It provides a high-level interface to matplotlib and integrates closely with pandas data structures.Functions in the seaborn library expose a declarative, dataset-oriented API that makes it easy to translate questions about data into graphics that can answer them.When given a dataset and a specification of the plot to make, seaborn automatically maps the data values to visual attributes such as color, size, or style, internally computes statistical transformations, and decorates the plot with informative axis labels and a legend.Many seaborn functions can generate figures with multiple panels that elicit comparisons between conditional subsets of data or across different pairings of variables in a dataset.seaborn is designed to be useful throughout the lifecycle of a scientific project.By producing complete graphics from a single function call with minimal arguments, seaborn facilitates rapid prototyping and exploratory data analysis.And by offering extensive options for customization, along with exposing the underlying matplotlib objects, it can be used to create polished, publication-quality figures."} | ||||
| 169 | −{"work_id": 2736941579, "title": "Learning Transferable Architectures for Scalable Image Recognition", "abstract": "Developing neural network image classification models often requires significant architecture engineering. In this paper, we study a method to learn the model architectures directly on the dataset of interest. As this approach is expensive when the dataset is large, we propose to search for an architectural building block on a small dataset and then transfer the block to a larger dataset. The key contribution of this work is the design of a new search space (which we call the \"NASNet search space\") which enables transferability. In our experiments, we search for the best convolutional layer (or \"cell\") on the CIFAR-10 dataset and then apply this cell to the ImageNet dataset by stacking together more copies of this cell, each with their own parameters to design a convolutional architecture, which we name a \"NASNet architecture\". We also introduce a new regularization technique called ScheduledDropPath that significantly improves generalization in the NASNet models. On CIFAR-10 itself, a NASNet found by our method achieves 2.4% error rate, which is state-of-the-art. Although the cell is not searched for directly on ImageNet, a NASNet constructed from the best cell achieves, among the published works, state-of-the-art accuracy of 82.7% top-1 and 96.2% top-5 on ImageNet. Our model is 1.2% better in top-1 accuracy than the best human-invented architectures while having 9 billion fewer FLOPS - a reduction of 28% in computational demand from the previous state-of-the-art model. When evaluated at different levels of computational cost, accuracies of NASNets exceed those of the state-of-the-art human-designed models. For instance, a small version of NASNet also achieves 74% top-1 accuracy, which is 3.1% better than equivalently-sized, state-of-the-art models for mobile platforms. Finally, the image features learned from image classification are generically useful and can be transferred to other computer vision problems. On the task of object detection, the learned features by NASNet used with the Faster-RCNN framework surpass state-of-the-art by 4.0% achieving 43.1% mAP on the COCO dataset."} | ||||
| 170 | −{"work_id": 7124433690, "title": "RaDe-GS: Rasterizing Depth in Gaussian Splatting", "abstract": "Gaussian Splatting (GS) has proven to be highly effective in novel view synthesis, achieving high-quality and real-time rendering. However, its potential for reconstructing detailed 3D shapes has not been fully explored. Existing methods often suffer from limited shape accuracy due to the discrete and unstructured nature of Gaussian primitives, which complicates the shape extraction. While recent techniques like 2D GS have attempted to improve shape reconstruction, they often reformulate the Gaussian primitives in ways that reduce both rendering quality and computational efficiency. To address these problems, our work introduces a rasterized approach to render the depth maps and surface normal maps of general 3D Gaussian primitives. Our method not only significantly enhances shape reconstruction accuracy but also maintains the computational efficiency intrinsic to Gaussian Splatting. It achieves a Chamfer distance error comparable to Neuralangelo Li et al. [ 2023 ] on the DTU dataset and maintains similar computational efficiency as the original 3D GS methods. Our method is a significant advancement in Gaussian Splatting and can be directly integrated into existing Gaussian Splatting-based methods."} | ||||
| 171 | −{"work_id": 3169483174, "title": "mT5: A Massively Multilingual Pre-trained Text-to-Text Transformer", "abstract": "Linting Xue, Noah Constant, Adam Roberts, Mihir Kale, Rami Al-Rfou, Aditya Siddhant, Aditya Barua, Colin Raffel. Proceedings of the 2021 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies. 2021."} | ||||
| 172 | −{"work_id": 3171007011, "title": "Exploring Simple Siamese Representation Learning", "abstract": "Siamese networks have become a common structure in various recent models for unsupervised visual representation learning. These models maximize the similarity between two augmentations of one image, subject to certain conditions for avoiding collapsing solutions. In this paper, we report surprising empirical results that simple Siamese networks can learn meaningful representations even using none of the following: (i) negative sample pairs, (ii) large batches, (iii) momentum encoders. Our experiments show that collapsing solutions do exist for the loss and structure, but a stop-gradient operation plays an essential role in preventing collapsing. We provide a hypothesis on the implication of stop-gradient, and further show proof-of-concept experiments verifying it. Our \"SimSiam\" method achieves competitive results on ImageNet and downstream tasks. We hope this simple baseline will motivate people to rethink the roles of Siamese architectures for unsupervised representation learning. Code is made available.1"} | ||||
| 173 | −{"work_id": 7151814497, "title": "Designing tools for 3D content authoring based on 3D sketching", "abstract": "Conception d'outils de cr\u00e9ation de contenu 3D bas\u00e9s sur le dessin 3D L'accessibilit\u00e9 croissante du rendu 3D en temps r\u00e9el a fait de la cr\u00e9ation de contenu 3D un moyen majeur d'expression et de communication. Mais la cr\u00e9ation de contenu 3D n\u00e9cessite d'interagir avec des repr\u00e9sentations num\u00e9riques de la forme et de l'apparence qui sont compatibles avec les algorithmes de rendu et d'animation. Les maillages triangulaires, les mod\u00e8les de mat\u00e9riaux param\u00e9triques et les courbes d'animation sont bien adapt\u00e9s aux op\u00e9rations de rendu mais obligent les artistes \u00e0 exprimer leurs id\u00e9es en terme de commandes bas niveau qui doivent \u00eatre apprises et m\u00e9moris\u00e9es.Dans cette th\u00e8se, nous explorons l'utilisation de coups de crayon 3D ou courbes 3D comme moyen pour les artistes d'exprimer leurs id\u00e9es. Inspir\u00e9s par la fa\u00e7on dont les artistes travaillent avec un pinceau et une toile, nous consid\u00e9rons ce geste de coup de crayon de l'artiste comme la principale commande d'entr\u00e9e du syst\u00e8me de cr\u00e9ation. Les courbes 3D sont des primitives flexibles qui peuvent \u00eatre cr\u00e9\u00e9es dans des interfaces utilisateur 2D ou dans des interfaces de r\u00e9alit\u00e9 virtuelle (RV), et elles peuvent encoder une forme 3D ou l'apparence finale d'une peinture 3D. La conception d'outils qui consid\u00e8rent les courbes 3D comme une repr\u00e9sentation de la forme ou de l'apparence ouvre un espace vaste et passionnant \u00e0 explorer.Les designers peuvent utiliser les courbes 3D comme une repr\u00e9sentation partielle de la forme 3D. Nous \u00e9tudions comment convertir un croquis 3D clairsem\u00e9 en un mod\u00e8le de surface 3D.\u00c9tant donn\u00e9 que les courbes caract\u00e9ristiques de l'objet sont un \u00e9l\u00e9ment important de la forme design\u00e9e et qu'elles sont repr\u00e9sent\u00e9es avec soin dans l'esquisse, nous reconstruisons une surface lisse par morceaux qui pr\u00e9serve ces courbes caract\u00e9ristiques. En obtenant une surface \u00e0 partir des courbes 3D, notre algorithme permet le rendu 3D de la forme d\u00e9crite par l'esquisse.Pour mieux comprendre comment les courbes 3D peuvent repr\u00e9senter non seulement la forme mais aussi l'apparence des objets, nous \u00e9tudions la pratique de la peinture en RV au sein d'une communaut\u00e9 d'artistes qui travaillent avec un logiciel commercial de peinture en RV. Sur la base de cette \u00e9tude, nous proposons une conception et une impl\u00e9mentation pour les \"calques 3D\", une nouvelle primitive d'interaction pour la peinture RV qui consid\u00e8re les courbes 3D comme repr\u00e9sentation \u00e0 la fois de la forme et de l'apparence 3D, tout en d\u00e9couplant l'\u00e9dition de ces deux \u00e9l\u00e9ments. Inspir\u00e9s par l'utilisation de la composition de calques en peinture num\u00e9rique 2D, nous proposons un processus non destructif pour modifier l'apparence d'une peinture RV.L'animation dessin\u00e9e \u00e0 la main est un moyen expressif de cr\u00e9er une animation avec des coups de crayons. Dans les animations de type \"video doodles\", les artistes cr\u00e9ent un dessin anim\u00e9 qui semble bouger dans le m\u00eame espace 3D qu'une vid\u00e9o film\u00e9e. Prendre en compte les effets de perspective et les occlusions tout en dessinant des courbes 2D n'est pas une t\u00e2che facile, c'est pourquoi nous utilisons des techniques de vision par ordinateur pour placer les courbes dans l'espace 3D et les rendre en respectant le contexte de la vid\u00e9o. Nous concevons une interface utilisateur en 2D qui ressemble aux outils traditionnels d'animation en 2D, afin de permettre aux utilisateurs qui ne sont pas familiers avec les outils 3D de cr\u00e9er de telles animations.Globalement, nous montrons que les courbes 3D sont une repr\u00e9sentation puissante pour la cr\u00e9ation de contenu 3D en proposant trois syst\u00e8mes qui exploitent les courbes 3D ou les dessins 3D en tant que primitives d'interaction pour des applications cr\u00e9atives allant de la cr\u00e9ation de forme \u00e0 celle d'apparence et d'animation. Nous abordons la conception de ces syst\u00e8mes sous deux angles compl\u00e9mentaires ; nous d\u00e9veloppons de nouveaux algorithmes pour interpr\u00e9ter les dessins et les commandes de bas niveau de l'utilisateur, et nous concevons des interactions qui permettent aux utilisateurs d'exprimer leurs intentions haut niveau."} | ||||
| 174 | −{"work_id": 3100507239, "title": "Illumination-Adaptive Person Re-identification", "abstract": "UTokyo Repository\u306f\u672c\u5b66\u3067\u751f\u7523\u3055\u308c\u305f\u3055\u307e\u3056\u307e\u306a\u5b66\u8853\u6210\u679c\u3092\u96fb\u5b50\u7684\u5f62\u614b\u3067\u96c6\u4e2d\u7684\u306b\u84c4\u7a4d\u30fb\u4fdd\u5b58\u3057\u3001\u4e16\u754c\u306b\u767a\u4fe1\u3059\u308b\u3053\u3068\u3092\u76ee\u7684\u3068\u3057\u305f\u30a4\u30f3\u30bf\u30fc\u30cd\u30c3\u30c8\u4e0a\u306e\u767a\u4fe1\u62e0\u70b9\u3067\u3059\u3002 The UTokyo Repository is the system to store and provide digital resources created by members of the University of Tokyo. Its main purpose is to develop digital collections, make them available online, and preserve them for long-term access."} | ||||
| 175 | −{"work_id": 3170841864, "title": "Rethinking Semantic Segmentation from a Sequence-to-Sequence Perspective with Transformers", "abstract": "Most recent semantic segmentation methods adopt a fully-convolutional network (FCN) with an encoder-decoder architecture. The encoder progressively reduces the spatial resolution and learns more abstract/semantic visual concepts with larger receptive fields. Since context modeling is critical for segmentation, the latest efforts have been focused on increasing the receptive field, through either dilated/atrous convolutions or inserting attention modules. However, the encoder-decoder based FCN architecture remains unchanged. In this paper, we aim to provide an alternative perspective by treating semantic segmentation as a sequence-to-sequence prediction task. Specifically, we deploy a pure transformer (i.e., without convolution and resolution reduction) to encode an image as a sequence of patches. With the global context modeled in every layer of the transformer, this encoder can be combined with a simple decoder to provide a powerful segmentation model, termed SEgmentation TRansformer (SETR). Extensive experiments show that SETR achieves new state of the art on ADE20K (50.28% mIoU), Pascal Context (55.83% mIoU) and competitive results on Cityscapes. Particularly, we achieve the first position in the highly competitive ADE20K test server leaderboard on the day of submission."} | ||||
| 176 | −{"work_id": 3209984917, "title": "WavLM: Large-Scale Self-Supervised Pre-Training for Full Stack Speech Processing", "abstract": "Self-supervised learning (SSL) achieves great success in speech recognition, while limited exploration has been attempted for other speech processing tasks. As speech signal contains multi-faceted information including speaker identity, paralinguistics, spoken content, etc., learning universal representations for all speech tasks is challenging. To tackle the problem, we propose a new pre-trained model, WavLM, to solve full-stack downstream speech tasks. WavLM jointly learns masked speech prediction and denoising in pre-training. By this means, WavLM does not only keep the speech content modeling capability by the masked speech prediction, but also improves the potential to non-ASR tasks by the speech denoising. In addition, WavLM employs gated relative position bias for the Transformer structure to better capture the sequence ordering of input speech. We also scale up the training dataset from 60 k hours to 94 k hours. WavLM Large achieves state-of-the-art performance on the SUPERB benchmark, and brings significant improvements for various speech processing tasks on their representative benchmarks."} | ||||
| 177 | −{"work_id": 4402754006, "title": "DETRs Beat YOLOs on Real-time Object Detection", "abstract": "The YOLO series has become the most popular frame-work for real-time object detection due to its reasonable trade-off between speed and accuracy. However, we observe that the speed and accuracy of YOLOs are negatively affected by the NMS. Recently, end-to-end Transformer-based detectors (DETRs) have provided an alternative to eliminating NMS. Nevertheless, the high computational cost limits their practicality and hinders them from fully exploiting the advantage of excluding NMS. In this paper, we propose the Real-Time DEtection TRansformer (RT-DETR), the first real-time end-to-end object detector to our best knowledge that addresses the above dilemma. We build RT-DETR in two steps, drawing on the advanced DETR: first we focus on maintaining accuracy while improving speed, followed by maintaining speed while improving accuracy. Specifically, we design an efficient hybrid encoder to expeditiously process multi-scale features by decoupling intra-scale interaction and cross-scale fusion to improve speed. Then, we propose the uncertainty-minimal query selection to provide high-quality initial queries to the decoder, thereby improving accuracy. In addition, RT-DETR supports flexible speed tuning by adjusting the number of decoder layers to adapt to various scenarios without retraining. Our RT-DETR-R50 /R101 achieves 53.1% 154.3% AP on COCO and 108 /74 FPS on T4 GPU, outperforming previously advanced YOLOs in both speed and accuracy. Furthermore, RT-DETR-R50 outperforms DINO-R50 by 2.2% AP in accuracy and about 21 times in FPS. After pre-training with Objects365, RT-DETR-R50 / R101 achieves 55.3% 156.2% AP. The project page: https://zhao-yian.github.io/RTDEtr."} | ||||
| 178 | −{"work_id": 2963091558, "title": "Non-local Neural Networks", "abstract": "Both convolutional and recurrent operations are building blocks that process one local neighborhood at a time. In this paper, we present non-local operations as a generic family of building blocks for capturing long-range dependencies. Inspired by the classical non-local means method in computer vision, our non-local operation computes the response at a position as a weighted sum of the features at all positions. This building block can be plugged into many computer vision architectures. On the task of video classification, even without any bells and whistles, our non-local models can compete or outperform current competition winners on both Kinetics and Charades datasets. In static image recognition, our non-local models improve object detection/segmentation and pose estimation on the COCO suite of tasks. Code is available at https://github.com/facebookresearch/video-nonlocal-net ."} | ||||
| 179 | −{"work_id": 3119997354, "title": "Transformers in Vision: A Survey", "abstract": "Astounding results from Transformer models on natural language tasks have intrigued the vision community to study their application to computer vision problems. Among their salient benefits, Transformers enable modeling long dependencies between input sequence elements and support parallel processing of sequence as compared to recurrent networks, e.g., Long short-term memory. Different from convolutional networks, Transformers require minimal inductive biases for their design and are naturally suited as set-functions. Furthermore, the straightforward design of Transformers allows processing multiple modalities (e.g., images, videos, text, and speech) using similar processing blocks and demonstrates excellent scalability to very large capacity networks and huge datasets. These strengths have led to exciting progress on a number of vision tasks using Transformer networks. This survey aims to provide a comprehensive overview of the Transformer models in the computer vision discipline. We start with an introduction to fundamental concepts behind the success of Transformers, i.e., self-attention, large-scale pre-training, and bidirectional feature encoding. We then cover extensive applications of transformers in vision including popular recognition tasks (e.g., image classification, object detection, action recognition, and segmentation), generative modeling, multi-modal tasks (e.g., visual-question answering, visual reasoning, and visual grounding), video processing (e.g., activity recognition, video forecasting), low-level vision (e.g., image super-resolution, image enhancement, and colorization), and three-dimensional analysis (e.g., point cloud classification and segmentation). We compare the respective advantages and limitations of popular techniques both in terms of architectural design and their experimental value. Finally, we provide an analysis on open research directions and possible future works. We hope this effort will ignite further interest in the community to solve current challenges toward the application of transformer models in computer vision."} | ||||
| 180 | {"work_id": 3043971245, "title": "ORB-SLAM3: An Accurate Open-Source Library for Visual, Visual\u2013Inertial, and Multimap SLAM", "abstract": "This article presents ORB-SLAM3, the first system able to perform visual, visual-inertial and multimap SLAM with monocular, stereo and RGB-D cameras, using pin-hole and fisheye lens models. The first main novelty is a tightly integrated visual-inertial SLAM system that fully relies on maximuma posteriori(MAP) estimation, even during IMU initialization, resulting in real-time robust operation in small and large, indoor and outdoor environments, being two to ten times more accurate than previous approaches. The second main novelty is a multiple map system relying on a new place recognition method with improved recall that lets ORB-SLAM3 survive to long periods of poor visual information: when it gets lost, it starts a new map that will be seamlessly merged with previous maps when revisiting them. Compared with visual odometry systems that only use information from the last few seconds, ORB-SLAM3 is the first system able to reuse in all the algorithm stages all previous information from high parallax co-visible keyframes, even if they are widely separated in time or come from previous mapping sessions, boosting accuracy. Our experiments show that, in all sensor configurations, ORB-SLAM3 is as robust as the best systems available in the literature and significantly more accurate. Notably, our stereo-inertial SLAM achieves an average accuracy of 3.5 cm in the EuRoC drone and 9 mm under quick hand-held motions in the room of TUM-VI dataset, representative of AR/VR scenarios. For the benefit of the community we make public the source code."} | 182 | {"work_id": 3043971245, "title": "ORB-SLAM3: An Accurate Open-Source Library for Visual, Visual\u2013Inertial, and Multimap SLAM", "abstract": "This article presents ORB-SLAM3, the first system able to perform visual, visual-inertial and multimap SLAM with monocular, stereo and RGB-D cameras, using pin-hole and fisheye lens models. The first main novelty is a tightly integrated visual-inertial SLAM system that fully relies on maximuma posteriori(MAP) estimation, even during IMU initialization, resulting in real-time robust operation in small and large, indoor and outdoor environments, being two to ten times more accurate than previous approaches. The second main novelty is a multiple map system relying on a new place recognition method with improved recall that lets ORB-SLAM3 survive to long periods of poor visual information: when it gets lost, it starts a new map that will be seamlessly merged with previous maps when revisiting them. Compared with visual odometry systems that only use information from the last few seconds, ORB-SLAM3 is the first system able to reuse in all the algorithm stages all previous information from high parallax co-visible keyframes, even if they are widely separated in time or come from previous mapping sessions, boosting accuracy. Our experiments show that, in all sensor configurations, ORB-SLAM3 is as robust as the best systems available in the literature and significantly more accurate. Notably, our stereo-inertial SLAM achieves an average accuracy of 3.5 cm in the EuRoC drone and 9 mm under quick hand-held motions in the room of TUM-VI dataset, representative of AR/VR scenarios. For the benefit of the community we make public the source code."} | ||
| 181 | −{"work_id": 7123353670, "title": "Trajectory Planning Method for Fracture Reduction of Parallel Robots Based on DMP and APF", "abstract": "The operation of tibial fracture reduction is complex and may involve risks of iatrogenic injuries due to fatigue or insufficient experience of the surgeon. Therefore, this paper proposes a tibial fracture reduction trajectory planning method based on dynamic movement primitives (DMP) and artificial potential fields (APF) to avoid the collision between the distal and proximal fracture fragments during the reduction process and to achieve safe tibial fracture reduction. First, DMP is used to learn the motion characteristics from the orientation demonstration trajectory, generating a new orientation trajectory for the distal fracture fragment. Second, DMP with an obstacle avoidance mechanism based on APF is used to learn the motion characteristics from the position demonstration trajectory, generating a position trajectory for the distal fracture fragment with obstacle avoidance capability. Then, the position trajectory and the orientation trajectory are combined synchronously to form the reduction trajectory. Finally the aforementioned trajectory is optimized to minimize both the the sum of squared velocities and the the sum of squared accelerations of all branch chains under specific constraints, enabling the robot to perform a smooth fracture reduction. Simulations and experiments are conducted, and the results demonstrate that the proposed method can effectively perform trajectory planning for tibial fracture reduction. The proposed method can provide technical references for the trajectory planning and obstacle avoidance problems of orthopedic robots in unstructured environments."} | ||||
| 182 | {"work_id": 7130402520, "title": "How NeRFs and 3-D Gaussian Splatting Are Reshaping SLAM: A Survey", "abstract": "Over the past two decades, research in the field of Simultaneous Localization and Mapping (SLAM) has undergone a significant evolution, highlighting its critical role in enabling autonomous exploration of unknown environments. This evo-lution ranges from hand-crafted methods, through the era of deep learning, to more recent developments focused on Neural Radiance Fields (NeRFs) and 3D Gaussian Splatting (3DGS) rep-resentations. Recognizing the growing body of research and the absence of a comprehensive survey on the topic, this paper aims to provide the first comprehensive overview of SLAM progress through the lens of the latest advancements in radiance fields. It sheds light on the background, evolutionary path, inherent strengths and limitations, and serves as a fundamental reference to highlight the dynamic progress and specific challenges."} | 183 | {"work_id": 7130402520, "title": "How NeRFs and 3-D Gaussian Splatting Are Reshaping SLAM: A Survey", "abstract": "Over the past two decades, research in the field of Simultaneous Localization and Mapping (SLAM) has undergone a significant evolution, highlighting its critical role in enabling autonomous exploration of unknown environments. This evo-lution ranges from hand-crafted methods, through the era of deep learning, to more recent developments focused on Neural Radiance Fields (NeRFs) and 3D Gaussian Splatting (3DGS) rep-resentations. Recognizing the growing body of research and the absence of a comprehensive survey on the topic, this paper aims to provide the first comprehensive overview of SLAM progress through the lens of the latest advancements in radiance fields. It sheds light on the background, evolutionary path, inherent strengths and limitations, and serves as a fundamental reference to highlight the dynamic progress and specific challenges."} | ||
| 184 | +{"work_id": 3129245057, "title": "LIO-SAM: Tightly-coupled Lidar Inertial Odometry via Smoothing and Mapping", "abstract": "We propose a framework for tightly-coupled lidar inertial odometry via smoothing and mapping, LIO-SAM, that achieves highly accurate, real-time mobile robot trajectory estimation and map-building. LIO-SAM formulates lidar-inertial odometry atop a factor graph, allowing a multitude of relative and absolute measurements, including loop closures, to be incorporated from different sources as factors into the system. The estimated motion from inertial measurement unit (IMU) pre-integration de-skews point clouds and produces an initial guess for lidar odometry optimization. The obtained lidar odometry solution is used to estimate the bias of the IMU. To ensure high performance in real-time, we marginalize old lidar scans for pose optimization, rather than matching lidar scans to a global map. Scan-matching at a local scale instead of a global scale significantly improves the real-time performance of the system, as does the selective introduction of keyframes, and an efficient sliding window approach that registers a new keyframe to a fixed-size set of prior \"sub-keyframes.\" The proposed method is extensively evaluated on datasets gathered from three platforms over various scales and environments."} | ||||
| 183 | {"work_id": 4403637324, "title": "Promises and challenges of generative artificial intelligence for human learning", "abstract": null} | 185 | {"work_id": 4403637324, "title": "Promises and challenges of generative artificial intelligence for human learning", "abstract": null} | ||
| 184 | {"work_id": 4386506836, "title": "5.7 The WORDNET lexical database of English", "abstract": null} | 186 | {"work_id": 4386506836, "title": "5.7 The WORDNET lexical database of English", "abstract": null} | ||
| 185 | {"work_id": 7126053009, "title": "Information-theoretic graph fusion with vision-language-action model for policy reasoning and dual robotic control", "abstract": null} | 187 | {"work_id": 7126053009, "title": "Information-theoretic graph fusion with vision-language-action model for policy reasoning and dual robotic control", "abstract": null} | ||
| 186 | {"work_id": 2910064571, "title": "A Practical Guide to Usability Testing", "abstract": null} | 188 | {"work_id": 2910064571, "title": "A Practical Guide to Usability Testing", "abstract": null} | ||
| 187 | −{"work_id": 4252097634, "title": "Statistical Shape Analysis", "abstract": null} | ||||
| 188 | −{"work_id": 232012359, "title": "IEEE Computer Graphics and Applications", "abstract": null} | ||||
| 189 | {"work_id": 3044864684, "title": "Leveraging orthographic information to improve machine translation of under-resourced languages", "abstract": null} | 189 | {"work_id": 3044864684, "title": "Leveraging orthographic information to improve machine translation of under-resourced languages", "abstract": null} | ||
| 190 | {"work_id": 4231645407, "title": "The Fastest Texture Mapping in Town:", "abstract": null} | 190 | {"work_id": 4231645407, "title": "The Fastest Texture Mapping in Town:", "abstract": null} | ||
| 191 | {"work_id": 3017855299, "title": "Automated detection of COVID-19 cases using deep neural networks with X-ray images", "abstract": null} | 191 | {"work_id": 3017855299, "title": "Automated detection of COVID-19 cases using deep neural networks with X-ray images", "abstract": null} | ||
@@ -199,9 +199,10 @@ | |||||
| 199 | {"work_id": 2478400128, "title": "Raster scan computer graphics and incremental computing systems", "abstract": null} | 199 | {"work_id": 2478400128, "title": "Raster scan computer graphics and incremental computing systems", "abstract": null} | ||
| 200 | {"work_id": 4321232185, "title": "Swin-Unet: Unet-Like Pure Transformer for Medical Image Segmentation", "abstract": null} | 200 | {"work_id": 4321232185, "title": "Swin-Unet: Unet-Like Pure Transformer for Medical Image Segmentation", "abstract": null} | ||
| 201 | {"work_id": 2219249508, "title": "Perceptual Signal Analysis and Eigenvalue-Weighted Metrics for Musical Audio Quality Assessment", "abstract": null} | 201 | {"work_id": 2219249508, "title": "Perceptual Signal Analysis and Eigenvalue-Weighted Metrics for Musical Audio Quality Assessment", "abstract": null} | ||
| 202 | −{"work_id": 4320013936, "title": "Generative Adversarial Nets", "abstract": null} | ||||
| 203 | {"work_id": 4403770406, "title": "YOLOv9: Learning What You Want to Learn Using Programmable Gradient Information", "abstract": null} | 202 | {"work_id": 4403770406, "title": "YOLOv9: Learning What You Want to Learn Using Programmable Gradient Information", "abstract": null} | ||
| 204 | {"work_id": 4293774946, "title": "Employing Adaptive Learning and Intelligent Tutoring Robots for Virtual Classrooms and Smart Campuses: Reforming Education in the Age of Artificial Intelligence", "abstract": null} | 203 | {"work_id": 4293774946, "title": "Employing Adaptive Learning and Intelligent Tutoring Robots for Virtual Classrooms and Smart Campuses: Reforming Education in the Age of Artificial Intelligence", "abstract": null} | ||
| 205 | {"work_id": 4414820664, "title": "How AI and Human Behaviors Shape Psychosocial Effects of Extended Chatbot Use: A Longitudinal Randomized Controlled Study", "abstract": null} | 204 | {"work_id": 4414820664, "title": "How AI and Human Behaviors Shape Psychosocial Effects of Extended Chatbot Use: A Longitudinal Randomized Controlled Study", "abstract": null} | ||
| 206 | {"work_id": 4404612908, "title": "Grounding DINO: Marrying DINO with Grounded Pre-training for Open-Set Object Detection", "abstract": null} | 205 | {"work_id": 4404612908, "title": "Grounding DINO: Marrying DINO with Grounded Pre-training for Open-Set Object Detection", "abstract": null} | ||
| 206 | +{"work_id": 4396833408, "title": "Integration of artificial intelligence technology and visual communication design in metaverse e-commerce and its potential opportunities", "abstract": null} | ||||
| 207 | +{"work_id": 3135538239, "title": "HexDom: Polycube-Based Hexahedral-Dominant Mesh Generation", "abstract": null} | ||||
| 207 | {"work_id": 3013601031, "title": "Covid-19: automatic detection from X-ray images utilizing transfer learning with convolutional neural networks", "abstract": null} | 208 | {"work_id": 3013601031, "title": "Covid-19: automatic detection from X-ray images utilizing transfer learning with convolutional neural networks", "abstract": null} | ||
modified
literature_synthesis/landmarks/perception_interaction_landmarks.csv
+209 −208
@@ -1,208 +1,209 @@ | |||||
| 1 | −work_id,doi,arxiv_id,title,source_name,year,type,primary_category,n_categories,c12,c36,ncs36,cited_by_count,fwci,has_abstract,is_oa,period,score,set,pi_review | 1 | +work_id,doi,arxiv_id,title,source_name,year,type,primary_category,n_categories,c12,c36,ncs36,cited_by_count,fwci,has_abstract,is_oa,period,ntitle,score,set,pi_review | ||
| 2 | −2949117887,10.57702/o9raffed,,Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shift,arXiv (Cornell University),2024,preprint,computer_vision,3,14211.0,14214.0,5890.544305226324,14214,,True,True,post,5890.544305226324,landmark,True | 2 | +2949117887,10.57702/o9raffed,,Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shift,arXiv (Cornell University),2024,preprint,computer_vision,3,14211.0,14214.0,5890.544305226324,14214,,True,True,post,batchnormalizationacceleratingdeepnetworktrainingbyreducinginternalcovariateshift,5890.544305226324,landmark,True | ||
| 3 | −3118608800,10.57702/zp44cu3g,,Learning Multiple Layers of Features from Tiny Images,,2024,article,computer_vision,3,23325.0,23341.0,2765.184913506997,23395,559.7906,True,True,post,2765.184913506997,landmark,True | 3 | +3118608800,10.57702/zp44cu3g,,Learning Multiple Layers of Features from Tiny Images,,2024,article,computer_vision,3,23325.0,23341.0,2765.184913506997,23395,559.7906,True,True,post,learningmultiplelayersoffeaturesfromtinyimages,2765.184913506997,landmark,True | ||
| 4 | −4320013936,10.1007/978-3-658-40442-0_9,,Generative Adversarial Nets,Springer eBooks,2023,book-chapter,computer_vision,3,17934.0,19230.0,2673.891459493373,19272,1769.2415,False,False,post,2673.891459493373,landmark,True | 4 | +4386076325,10.1109/cvpr52729.2023.00721,2207.02696,YOLOv7: Trainable Bag-of-Freebies Sets New State-of-the-Art for Real-Time Object Detectors,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2023,conference-paper,computer_vision,5,6781.0,10586.0,1477.2917574868547,12390,1387.4265,True,True,baseline,yolov7trainablebagoffreebiessetsnewstateoftheartforrealtimeobjectdetectors,1477.2917574868547,landmark,True | ||
| 5 | −4386076325,10.1109/cvpr52729.2023.00721,2207.02696,YOLOv7: Trainable Bag-of-Freebies Sets New State-of-the-Art for Real-Time Object Detectors,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2023,conference-paper,computer_vision,5,6781.0,10586.0,1477.2917574868547,12390,1387.4265,True,True,baseline,1477.2917574868547,landmark,True | 5 | +3119786062,,,An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale,International Conference on Learning Representations,2021,conference-paper,computer_vision,5,4071.0,9465.0,1181.820775699879,449,38.1179,True,False,baseline,animageisworth16x16wordstransformersforimagerecognitionatscale,1181.820775699879,landmark,True | ||
| 6 | −3119786062,,,An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale,International Conference on Learning Representations,2021,conference-paper,computer_vision,5,4071.0,9465.0,1181.820775699879,449,38.1179,True,False,baseline,1181.820775699879,landmark,True | 6 | +3138516171,10.1109/iccv48922.2021.00986,2103.14030,Swin Transformer: Hierarchical Vision Transformer using Shifted Windows,IEEE/CVF International Conference on Computer Vision (ICCV),2021,conference-paper,computer_vision,6,3057.0,9391.0,1172.5809724878566,33262,1556.4216,True,True,baseline,swintransformerhierarchicalvisiontransformerusingshiftedwindows,1172.5809724878566,landmark,True | ||
| 7 | −3138516171,10.1109/iccv48922.2021.00986,2103.14030,Swin Transformer: Hierarchical Vision Transformer using Shifted Windows,IEEE/CVF International Conference on Computer Vision (ICCV),2021,conference-paper,computer_vision,6,3057.0,9391.0,1172.5809724878566,33262,1556.4216,True,True,baseline,1172.5809724878566,landmark,True | 7 | +4402754006,10.1109/cvpr52733.2024.01605,,DETRs Beat YOLOs on Real-time Object Detection,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2024,conference-paper,computer_vision,4,2662.0,4773.0,1001.7389274520061,4548,991.256,True,False,post,detrsbeatyolosonrealtimeobjectdetection,1001.7389274520061,landmark,True | ||
| 8 | −4390874575,10.1109/iccv51070.2023.00371,,Segment Anything,IEEE/CVF International Conference on Computer Vision (ICCV),2023,conference-paper,computer_vision,5,3127.0,7864.0,1097.4326828713986,10910,1240.4061,True,False,post,1097.4326828713986,landmark,True | 8 | +4403770406,10.1007/978-3-031-72751-1_1,2402.13616,YOLOv9: Learning What You Want to Learn Using Programmable Gradient Information,Lecture notes in computer science,2024,conference-paper,computer_vision,3,3072.0,4486.0,941.504468583637,4486,979.4658,False,True,post,yolov9learningwhatyouwanttolearnusingprogrammablegradientinformation,941.504468583637,landmark,True | ||
| 9 | −4402754006,10.1109/cvpr52733.2024.01605,,DETRs Beat YOLOs on Real-time Object Detection,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2024,conference-paper,computer_vision,4,2662.0,4773.0,1001.7389274520061,4548,991.256,True,False,post,1001.7389274520061,landmark,True | 9 | +4312933868,10.1109/cvpr52688.2022.01042,,High-Resolution Image Synthesis with Latent Diffusion Models,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2022,conference-paper,computer_vision,3,1866.0,6719.0,907.833780459159,16051,1184.1165,True,False,baseline,highresolutionimagesynthesiswithlatentdiffusionmodels,907.833780459159,landmark,True | ||
| 10 | −4403770406,10.1007/978-3-031-72751-1_1,2402.13616,YOLOv9: Learning What You Want to Learn Using Programmable Gradient Information,Lecture notes in computer science,2024,conference-paper,computer_vision,3,3072.0,4486.0,941.504468583637,4486,979.4658,False,True,post,941.504468583637,landmark,True | 10 | +4226002507,10.1109/cvpr52688.2022.01553,,Masked Autoencoders Are Scalable Vision Learners,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2022,conference-paper,computer_vision,4,1906.0,4278.0,849.9419256281733,7977,974.4316,True,True,baseline,maskedautoencodersarescalablevisionlearners,849.9419256281733,landmark,True | ||
| 11 | −4312933868,10.1109/cvpr52688.2022.01042,,High-Resolution Image Synthesis with Latent Diffusion Models,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2022,conference-paper,computer_vision,3,1866.0,6719.0,907.833780459159,16051,1184.1165,True,False,baseline,907.833780459159,landmark,True | 11 | +4399300671,10.1002/mp.17191,1912.01703,The effects of back‐projection variants in BPF‐like TOF PET reconstruction using CNN filtration – Based on simulated and clinical brain data,Medical Physics,2024,article,computer_vision,5,14860.0,14915.0,822.2465127032651,0,0.0,True,True,baseline,theeffectsofbackprojectionvariantsinbpfliketofpetreconstructionusingcnnfiltrationbasedonsimulatedandclinicalbraindata,822.2465127032651,landmark,True | ||
| 12 | −2963420686,10.1109/tpami.2019.2913372,,Squeeze-and-Excitation Networks,IEEE Transactions on Pattern Analysis and Machine Intelligence,2019,article,computer_vision,3,2975.0,5976.0,905.785826797903,12104,843.0736,True,False,baseline,905.785826797903,landmark,True | 12 | +7106270182,10.82419/203,,Bridging the Gap between Object and Image-level Representations for Open-Vocabulary Detection,MBZUAI iRep,2022,dissertation,computer_vision,4,24.0,53.0,720.1328671328672,0,,True,True,baseline,bridgingthegapbetweenobjectandimagelevelrepresentationsforopenvocabularydetection,720.1328671328672,landmark,True | ||
| 13 | −4226002507,10.1109/cvpr52688.2022.01553,,Masked Autoencoders Are Scalable Vision Learners,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2022,conference-paper,computer_vision,4,1906.0,4278.0,849.9419256281733,7977,974.4316,True,True,baseline,849.9419256281733,landmark,True | 13 | +4415795831,10.52202/079017-3429,2405.14458,YOLOv10: Real-Time End-to-End Object Detection,neural information processing systems,2024,conference-paper,computer_vision,4,1157.0,2788.0,585.1347432927286,2788,608.7273,True,True,post,yolov10realtimeendtoendobjectdetection,585.1347432927286,landmark,True | ||
| 14 | −4399300671,10.1002/mp.17191,1912.01703,The effects of back‐projection variants in BPF‐like TOF PET reconstruction using CNN filtration – Based on simulated and clinical brain data,Medical Physics,2024,article,computer_vision,5,14860.0,14915.0,822.2465127032651,0,0.0,True,True,baseline,822.2465127032651,landmark,True | 14 | +3035524453,10.1109/cvpr42600.2020.00975,1911.05722,Momentum Contrast for Unsupervised Visual Representation Learning,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2020,conference-paper,computer_vision,4,1903.0,3802.0,538.8557516528527,12652,650.908,True,True,baseline,momentumcontrastforunsupervisedvisualrepresentationlearning,538.8557516528527,landmark,True | ||
| 15 | −7106270182,10.82419/203,,Bridging the Gap between Object and Image-level Representations for Open-Vocabulary Detection,MBZUAI iRep,2022,dissertation,computer_vision,4,24.0,53.0,720.1328671328672,0,,True,True,baseline,720.1328671328672,landmark,True | 15 | +4321232185,10.1007/978-3-031-25066-8_9,2105.05537,Swin-Unet: Unet-Like Pure Transformer for Medical Image Segmentation,Lecture notes in computer science,2023,conference-paper,computer_vision,3,2204.0,3841.0,536.0171585591356,4853,526.4534,False,True,baseline,swinunetunetlikepuretransformerformedicalimagesegmentation,536.0171585591356,landmark,True | ||
| 16 | −4415795831,10.52202/079017-3429,2405.14458,YOLOv10: Real-Time End-to-End Object Detection,neural information processing systems,2024,conference-paper,computer_vision,4,1157.0,2788.0,585.1347432927286,2788,608.7273,True,True,post,585.1347432927286,landmark,True | 16 | +3005680577,10.48550/arxiv.2002.05709,2002.05709,A Simple Framework for Contrastive Learning of Visual Representations,arXiv (Cornell University),2020,preprint,computer_vision,5,1836.0,3360.0,523.1590380139643,6894,,True,True,baseline,asimpleframeworkforcontrastivelearningofvisualrepresentations,523.1590380139643,landmark,True | ||
| 17 | −3035524453,10.1109/cvpr42600.2020.00975,1911.05722,Momentum Contrast for Unsupervised Visual Representation Learning,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2020,conference-paper,computer_vision,4,1903.0,3802.0,538.8557516528527,12652,650.908,True,True,baseline,538.8557516528527,landmark,True | 17 | +3182555022,,,Generative Adversarial Networks for Semantic Image Synthesis and Unconditional Synthesis with Limited Data,bonndoc (University of Bonn),2024,dissertation,computer_vision,3,45.0,47.0,515.6,47,,True,True,post,generativeadversarialnetworksforsemanticimagesynthesisandunconditionalsynthesiswithlimiteddata,515.6,landmark,True | ||
| 18 | −4321232185,10.1007/978-3-031-25066-8_9,2105.05537,Swin-Unet: Unet-Like Pure Transformer for Medical Image Segmentation,Lecture notes in computer science,2023,conference-paper,computer_vision,3,2204.0,3841.0,536.0171585591356,4853,526.4534,False,True,baseline,536.0171585591356,landmark,True | 18 | +3152382703,,,EVOLUTION OF YOLO ALGORITHM AND YOLOV5: THE STATE-OF-THE-ART OBJECT DETECTION ALGORITHM,,2021,dissertation,computer_vision,2,51.0,80.0,513.8375350140057,97,,False,False,baseline,evolutionofyoloalgorithmandyolov5thestateoftheartobjectdetectionalgorithm,513.8375350140057,landmark,True | ||
| 19 | −3005680577,10.48550/arxiv.2002.05709,2002.05709,A Simple Framework for Contrastive Learning of Visual Representations,arXiv (Cornell University),2020,preprint,computer_vision,5,1836.0,3360.0,523.1590380139643,6894,,True,True,baseline,523.1590380139643,landmark,True | 19 | +4312443924,10.1109/cvpr52688.2022.01167,,A ConvNet for the 2020s,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2022,conference-paper,computer_vision,3,1653.0,3671.0,496.0050317109053,8300,604.8545,True,False,baseline,aconvnetforthe2020s,496.0050317109053,landmark,True | ||
| 20 | −3182555022,,,Generative Adversarial Networks for Semantic Image Synthesis and Unconditional Synthesis with Limited Data,bonndoc (University of Bonn),2024,dissertation,computer_vision,3,45.0,47.0,515.6,47,,True,True,post,515.6,landmark,True | 20 | +2335728318,10.57702/e7wwo0zk,,Reading digits in natural images with unsupervised feature learning,,2024,article,computer_vision,1,4147.0,4149.0,491.5278782460276,4149,55.5129,True,True,post,readingdigitsinnaturalimageswithunsupervisedfeaturelearning,491.5278782460276,landmark,True | ||
| 21 | −3152382703,,,EVOLUTION OF YOLO ALGORITHM AND YOLOV5: THE STATE-OF-THE-ART OBJECT DETECTION ALGORITHM,,2021,dissertation,computer_vision,2,51.0,80.0,513.8375350140057,97,,False,False,baseline,513.8375350140057,landmark,True | 21 | +4390873054,10.1109/iccv51070.2023.00355,,Adding Conditional Control to Text-to-Image Diffusion Models,IEEE/CVF International Conference on Computer Vision (ICCV),2023,conference-paper,computer_vision,6,1511.0,3376.0,471.1257295744967,4408,501.2109,True,False,post,addingconditionalcontroltotexttoimagediffusionmodels,471.1257295744967,landmark,True | ||
| 22 | −4312443924,10.1109/cvpr52688.2022.01167,,A ConvNet for the 2020s,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2022,conference-paper,computer_vision,3,1653.0,3671.0,496.0050317109053,8300,604.8545,True,False,baseline,496.0050317109053,landmark,True | 22 | +2963163009,10.1109/cvpr.2018.00474,1801.04381,MobileNetV2: Inverted Residuals and Linear Bottlenecks,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2018,conference-paper,computer_vision,3,1242.0,3514.0,430.50535987748856,27247,513.8505,True,True,baseline,mobilenetv2invertedresidualsandlinearbottlenecks,430.50535987748856,landmark,True | ||
| 23 | −4300424419,10.4230/lipics.giscience.2025.18,,U-Prithvi: Integrating a Foundation Model and U-Net for Enhanced Flood Inundation Mapping,Leibniz international proceedings in informatics,2025,conference-paper,computer_vision,3,977.0,977.0,144.34954954954955,977,1317.4998,True,True,post,494.61490121304024,landmark,True | 23 | +4300424419,10.4230/lipics.giscience.2025.18,,U-Prithvi: Integrating a Foundation Model and U-Net for Enhanced Flood Inundation Mapping,Leibniz international proceedings in informatics,2025,conference-paper,computer_vision,3,977.0,977.0,144.34954954954955,977,1317.4998,True,True,post,uprithviintegratingafoundationmodelandunetforenhancedfloodinundationmapping,426.921221602615,landmark,True | ||
| 24 | −2335728318,10.57702/e7wwo0zk,,Reading digits in natural images with unsupervised feature learning,,2024,article,computer_vision,1,4147.0,4149.0,491.5278782460276,4149,55.5129,True,True,post,491.5278782460276,landmark,True | 24 | +4224035735,10.48550/arxiv.2204.06125,2204.06125,Hierarchical Text-Conditional Image Generation with CLIP Latents,arXiv (Cornell University),2022,preprint,computer_vision,5,904.0,1882.0,408.5254913442887,2203,,True,True,baseline,hierarchicaltextconditionalimagegenerationwithcliplatents,408.5254913442887,landmark,True | ||
| 25 | −4390873054,10.1109/iccv51070.2023.00355,,Adding Conditional Control to Text-to-Image Diffusion Models,IEEE/CVF International Conference on Computer Vision (ICCV),2023,conference-paper,computer_vision,6,1511.0,3376.0,471.1257295744967,4408,501.2109,True,False,post,471.1257295744967,landmark,True | 25 | +4200503948,10.7735/ksmte.2021.30.6.513,2004.10934,Comparative Analysis of Defect Detection Using YOLO of Deep Learning,Journal of the korean society of manufacturing technology engineers,2021,article,computer_vision,3,4221.0,6845.0,406.01302821116474,8,0.9035,True,True,baseline,comparativeanalysisofdefectdetectionusingyoloofdeeplearning,406.01302821116474,landmark,True | ||
| 26 | −3100507239,,,Illumination-Adaptive Person Re-identification,Institutional Repositories DataBase (IRDB),2020,dissertation,computer_vision,1,44.0,66.0,447.55516014234877,97,,True,True,baseline,447.55516014234877,landmark,True | 26 | +4398756379,10.1109/adics58448.2024.10533619,,YOLOv8: A Novel Object Detection Algorithm with Enhanced Performance and Robustness,,2024,conference-paper,computer_vision,2,1232.0,1876.0,393.72768235909564,1876,409.6027,True,False,post,yolov8anovelobjectdetectionalgorithmwithenhancedperformanceandrobustness,393.72768235909564,landmark,True | ||
| 27 | −2626778328,10.65215/2q58a426,1706.03762,Attention Is All You Need,,2025,preprint,nlp,5,24486.0,24486.0,29646.72006980803,24487,,True,True,post,12396.254320473392,landmark,True | 27 | +2626778328,10.65215/2q58a426,1706.03762,Attention Is All You Need,,2025,preprint,nlp,5,24486.0,24486.0,29646.72006980803,24487,,True,True,post,attentionisallyouneed,10699.68580569256,landmark,True | ||
| 28 | −2963341956,10.18653/v1/n19-1423,,BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding,Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (NAACL-HLT),2019,conference-paper,nlp,3,9645.0,19296.0,2566.536785186562,31944,2211.5894,True,True,baseline,2566.536785186562,landmark,True | 28 | +2963341956,10.18653/v1/n19-1423,,BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding,Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (NAACL-HLT),2019,conference-paper,nlp,3,9645.0,19296.0,2566.536785186562,31944,2211.5894,True,True,baseline,bertpretrainingofdeepbidirectionaltransformersforlanguageunderstanding,2566.536785186562,landmark,True | ||
| 29 | −3098044990,,,Traduction Non Supervisée de Langages de Programmation,theses.fr (ABES),2022,dissertation,nlp,4,121.0,143.0,1240.408521303258,162,,True,True,baseline,1240.408521303258,landmark,True | 29 | +3098044990,,,Traduction Non Supervisée de Langages de Programmation,theses.fr (ABES),2022,dissertation,nlp,4,121.0,143.0,1240.408521303258,162,,True,True,baseline,traductionnonsupervisedelangagesdeprogrammation,1240.408521303258,landmark,True | ||
| 30 | −2896457183,10.4230/lipics.cosit.2022.18,1810.04805,AI-Assisted Pipeline for Dynamic Generation of Trustworthy Health Supplement Content at Scale,arXiv (Cornell University),2018,preprint,nlp,2,1630.0,5855.0,902.4576906598114,44705,,True,True,baseline,902.4576906598114,landmark,True | 30 | +2896457183,10.4230/lipics.cosit.2022.18,1810.04805,AI-Assisted Pipeline for Dynamic Generation of Trustworthy Health Supplement Content at Scale,arXiv (Cornell University),2018,preprint,nlp,2,1630.0,5855.0,902.4576906598114,44705,,True,True,baseline,aiassistedpipelinefordynamicgenerationoftrustworthyhealthsupplementcontentatscale,902.4576906598114,landmark,True | ||
| 31 | −2787560479,10.18653/v1/n18-1202,1802.05365,Deep Contextualized Word Representations,Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (NAACL-HLT),2018,conference-paper,nlp,2,2252.0,4791.0,741.8627823725466,11541,762.8608,True,True,baseline,741.8627823725466,landmark,True | 31 | +2787560479,10.18653/v1/n18-1202,1802.05365,Deep Contextualized Word Representations,Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (NAACL-HLT),2018,conference-paper,nlp,2,2252.0,4791.0,741.8627823725466,11541,762.8608,True,True,baseline,deepcontextualizedwordrepresentations,741.8627823725466,landmark,True | ||
| 32 | −4411403346,10.1145/3744746,2307.06435,A Comprehensive Overview of Large Language Models,ACM Transactions on Intelligent Systems and Technology,2025,article,nlp,5,1097.0,1097.0,373.692295245369,1097,382.0017,True,True,post,555.3659637980605,landmark,True | 32 | +4224308101,10.48550/arxiv.2204.02311,2204.02311,PaLM: Scaling Language Modeling with Pathways,arXiv (Cornell University),2022,preprint,nlp,7,950.0,1657.0,481.54051809067556,2051,,True,True,baseline,palmscalinglanguagemodelingwithpathways,481.54051809067556,landmark,True | ||
| 33 | −4224308101,10.48550/arxiv.2204.02311,2204.02311,PaLM: Scaling Language Modeling with Pathways,arXiv (Cornell University),2022,preprint,nlp,7,950.0,1657.0,481.54051809067556,2051,,True,True,baseline,481.54051809067556,landmark,True | 33 | +4411403346,10.1145/3744746,2307.06435,A Comprehensive Overview of Large Language Models,ACM Transactions on Intelligent Systems and Technology,2025,article,nlp,5,1097.0,1097.0,373.692295245369,1097,382.0017,True,True,post,acomprehensiveoverviewoflargelanguagemodels,479.357809721667,landmark,True | ||
| 34 | −2979736514,10.13025/17598,,Neural transfer learning for natural language processing,Arrow@dit (Dublin Institute of Technology),2019,dissertation,nlp,5,62.0,116.0,422.42293906810033,177,,True,True,baseline,422.42293906810033,landmark,True | 34 | +2979736514,10.13025/17598,,Neural transfer learning for natural language processing,Arrow@dit (Dublin Institute of Technology),2019,dissertation,nlp,5,62.0,116.0,422.42293906810033,177,,True,True,baseline,neuraltransferlearningfornaturallanguageprocessing,422.42293906810033,landmark,True | ||
| 35 | −4386506836,10.1515/9781474471459-050,,5.7 The WORDNET lexical database of English,Edinburgh University Press eBooks,2019,book-chapter,nlp,1,1138.0,1337.0,415.89661853577525,1865,230.3576,False,False,baseline,415.89661853577525,landmark,True | 35 | +4386506836,10.1515/9781474471459-050,,5.7 The WORDNET lexical database of English,Edinburgh University Press eBooks,2019,book-chapter,nlp,1,1138.0,1337.0,415.89661853577525,1865,230.3576,False,False,baseline,57thewordnetlexicaldatabaseofenglish,415.89661853577525,landmark,True | ||
| 36 | −2982399380,10.18653/v1/2020.acl-main.703,1910.13461,"BART: Denoising Sequence-to-Sequence Pre-training for Natural Language Generation, Translation, and Comprehension",Annual Meeting of the Association for Computational Linguistics (ACL),2020,conference-paper,nlp,5,1454.0,2915.0,413.1416402072767,8244,528.5478,True,True,baseline,413.1416402072767,landmark,True | 36 | +2982399380,10.18653/v1/2020.acl-main.703,1910.13461,"BART: Denoising Sequence-to-Sequence Pre-training for Natural Language Generation, Translation, and Comprehension",Annual Meeting of the Association for Computational Linguistics (ACL),2020,conference-paper,nlp,5,1454.0,2915.0,413.1416402072767,8244,528.5478,True,True,baseline,bartdenoisingsequencetosequencepretrainingfornaturallanguagegenerationtranslationandcomprehension,413.1416402072767,landmark,True | ||
| 37 | −7125799258,10.1109/tpami.2026.3657354,2312.12148,Parameter-Efficient Fine-Tuning Methods for Pretrained Language Models: A Critical Review and Assessment,IEEE Transactions on Pattern Analysis and Machine Intelligence,2026,article,nlp,4,115.0,115.0,127.97217616701306,115,191.4688,True,True,post,408.85036662226526,landmark,True | 37 | +4391136507,10.1145/3641289,2307.03109,A Survey on Evaluation of Large Language Models,ACM Transactions on Intelligent Systems and Technology,2024,article,nlp,5,2160.0,3004.0,373.1207027772732,3004,440.36,True,True,post,asurveyonevaluationoflargelanguagemodels,373.1207027772732,landmark,True | ||
| 38 | −4391136507,10.1145/3641289,2307.03109,A Survey on Evaluation of Large Language Models,ACM Transactions on Intelligent Systems and Technology,2024,article,nlp,5,2160.0,3004.0,373.1207027772732,3004,440.36,True,True,post,373.1207027772732,landmark,True | 38 | +2979826702,10.18653/v1/2020.emnlp-demos.6,,Transformers: State-of-the-Art Natural Language Processing,Conference on Empirical Methods in Natural Language Processing: System Demonstrations (EMNLP),2020,conference-paper,nlp,3,965.0,2605.0,369.2054794991272,8292,488.3322,True,True,baseline,transformersstateoftheartnaturallanguageprocessing,369.2054794991272,landmark,True | ||
| 39 | −2979826702,10.18653/v1/2020.emnlp-demos.6,,Transformers: State-of-the-Art Natural Language Processing,Conference on Empirical Methods in Natural Language Processing: System Demonstrations (EMNLP),2020,conference-paper,nlp,3,965.0,2605.0,369.2054794991272,8292,488.3322,True,True,baseline,369.2054794991272,landmark,True | 39 | +4404534210,10.1145/3703155,2311.05232,"A Survey on Hallucination in Large Language Models: Principles, Taxonomy, Challenges, and Open Questions",ACM Transactions on Information Systems,2024,article,nlp,4,1138.0,2379.0,295.4907296628272,2379,354.0441,True,True,post,asurveyonhallucinationinlargelanguagemodelsprinciplestaxonomychallengesandopenquestions,295.4907296628272,landmark,True | ||
| 40 | −4404534210,10.1145/3703155,2311.05232,"A Survey on Hallucination in Large Language Models: Principles, Taxonomy, Challenges, and Open Questions",ACM Transactions on Information Systems,2024,article,nlp,4,1138.0,2379.0,295.4907296628272,2379,354.0441,True,True,post,295.4907296628272,landmark,True | 40 | +7125799258,10.1109/tpami.2026.3657354,2312.12148,Parameter-Efficient Fine-Tuning Methods for Pretrained Language Models: A Critical Review and Assessment,IEEE Transactions on Pattern Analysis and Machine Intelligence,2026,article,nlp,4,115.0,115.0,127.97217616701306,115,191.4688,True,True,post,parameterefficientfinetuningmethodsforpretrainedlanguagemodelsacriticalreviewandassessment,291.5790974019528,landmark,True | ||
| 41 | −2983040767,10.18653/v1/2020.acl-main.747,1911.02116,Unsupervised Cross-lingual Representation Learning at Scale,Annual Meeting of the Association for Computational Linguistics (ACL),2020,conference-paper,nlp,3,1179.0,2047.0,290.1203902244581,5335,332.4086,True,True,baseline,290.1203902244581,landmark,True | 41 | +2983040767,10.18653/v1/2020.acl-main.747,1911.02116,Unsupervised Cross-lingual Representation Learning at Scale,Annual Meeting of the Association for Computational Linguistics (ACL),2020,conference-paper,nlp,3,1179.0,2047.0,290.1203902244581,5335,332.4086,True,True,baseline,unsupervisedcrosslingualrepresentationlearningatscale,290.1203902244581,landmark,True | ||
| 42 | −2948223045,10.18653/v1/p19-1355,1906.02243,Energy and Policy Considerations for Deep Learning in NLP,Annual Meeting of the Association for Computational Linguistics (ACL),2019,conference-paper,nlp,4,368.0,863.0,257.5756075430014,3453,514.1231,True,True,baseline,257.5756075430014,landmark,True | 42 | +2948223045,10.18653/v1/p19-1355,1906.02243,Energy and Policy Considerations for Deep Learning in NLP,Annual Meeting of the Association for Computational Linguistics (ACL),2019,conference-paper,nlp,4,368.0,863.0,257.5756075430014,3453,514.1231,True,True,baseline,energyandpolicyconsiderationsfordeeplearninginnlp,257.5756075430014,landmark,True | ||
| 43 | −3044864684,,,Leveraging orthographic information to improve machine translation of under-resourced languages,,2020,dissertation,nlp,3,52.0,53.0,244.74101247248717,58,,False,False,baseline,244.74101247248717,landmark,True | 43 | +3044864684,,,Leveraging orthographic information to improve machine translation of under-resourced languages,,2020,dissertation,nlp,3,52.0,53.0,244.74101247248717,58,,False,False,baseline,leveragingorthographicinformationtoimprovemachinetranslationofunderresourcedlanguages,244.74101247248717,landmark,True | ||
| 44 | −4404782964,10.18653/v1/2024.emnlp-main.64,,A Survey on In-context Learning,Conference on Empirical Methods in Natural Language Processing (EMNLP),2024,conference-paper,nlp,3,646.0,879.0,244.3285362084626,632,188.3078,True,True,post,244.3285362084626,landmark,True | 44 | +4404782964,10.18653/v1/2024.emnlp-main.64,,A Survey on In-context Learning,Conference on Empirical Methods in Natural Language Processing (EMNLP),2024,conference-paper,nlp,3,646.0,879.0,244.3285362084626,632,188.3078,True,True,post,asurveyonincontextlearning,244.3285362084626,landmark,True | ||
| 45 | −4221142221,10.48550/arxiv.2203.05794,2203.05794,BERTopic: Neural topic modeling with a class-based TF-IDF procedure,arXiv (Cornell University),2022,preprint,nlp,3,416.0,812.0,235.9751965537891,1342,,True,True,baseline,235.9751965537891,landmark,True | 45 | +4221142221,10.48550/arxiv.2203.05794,2203.05794,BERTopic: Neural topic modeling with a class-based TF-IDF procedure,arXiv (Cornell University),2022,preprint,nlp,3,416.0,812.0,235.9751965537891,1342,,True,True,baseline,bertopicneuraltopicmodelingwithaclassbasedtfidfprocedure,235.9751965537891,landmark,True | ||
| 46 | −3169483174,10.18653/v1/2021.naacl-main.41,,mT5: A Massively Multilingual Pre-trained Text-to-Text Transformer,Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (NAACL-HLT),2021,conference-paper,nlp,4,642.0,1458.0,231.16193233956648,1621,144.7472,True,True,baseline,231.16193233956648,landmark,True | 46 | +3169483174,10.18653/v1/2021.naacl-main.41,,mT5: A Massively Multilingual Pre-trained Text-to-Text Transformer,Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (NAACL-HLT),2021,conference-paper,nlp,4,642.0,1458.0,231.16193233956648,1621,144.7472,True,True,baseline,mt5amassivelymultilingualpretrainedtexttotexttransformer,231.16193233956648,landmark,True | ||
| 47 | −3196350727,10.4230/oasics.ldk.2021.34,,"HISTORIAE, History of Socio-Cultural Transformation as Linguistic Data Science. A Humanities Use Case",DROPS (Schloss Dagstuhl – Leibniz Center for Informatics),2021,article,nlp,1,8042.0,12201.0,226.99110878661088,0,0.0,True,True,baseline,226.99110878661088,landmark,True | 47 | +3196350727,10.4230/oasics.ldk.2021.34,,"HISTORIAE, History of Socio-Cultural Transformation as Linguistic Data Science. A Humanities Use Case",DROPS (Schloss Dagstuhl – Leibniz Center for Informatics),2021,article,nlp,1,8042.0,12201.0,226.99110878661088,0,0.0,True,True,baseline,historiaehistoryofsocioculturaltransformationaslinguisticdatascienceahumanitiesusecase,226.99110878661088,landmark,True | ||
| 48 | −4229005866,10.4230/oasics.slate.2022.19,2205.01068,Analysing Off-The-Shelf Options for Question Answering with Portuguese FAQs,arXiv (Cornell University),2022,preprint,nlp,5,473.0,740.0,215.05128749975853,879,,True,True,baseline,215.05128749975853,landmark,True | 48 | +4229005866,10.4230/oasics.slate.2022.19,2205.01068,Analysing Off-The-Shelf Options for Question Answering with Portuguese FAQs,arXiv (Cornell University),2022,preprint,nlp,5,473.0,740.0,215.05128749975853,879,,True,True,baseline,analysingofftheshelfoptionsforquestionansweringwithportuguesefaqs,215.05128749975853,landmark,True | ||
| 49 | −7130436101,10.1038/s41586-025-10097-9,2506.20430,An agentic system for rare disease diagnosis with traceable reasoning,Nature,2026,article,nlp,7,59.0,59.0,26.859760394644116,59,109.0609,True,True,post,209.7580141801187,landmark,True | 49 | +2798812533,10.18653/v1/p18-1031,1801.06146,Universal Language Model Fine-tuning for Text Classification,Annual Meeting of the Association for Computational Linguistics (ACL),2018,conference-paper,nlp,6,617.0,1344.0,208.11178866806569,3882,191.3134,True,True,baseline,universallanguagemodelfinetuningfortextclassification,208.11178866806569,landmark,True | ||
| 50 | −2798812533,10.18653/v1/p18-1031,1801.06146,Universal Language Model Fine-tuning for Text Classification,Annual Meeting of the Association for Computational Linguistics (ACL),2018,conference-paper,nlp,6,617.0,1344.0,208.11178866806569,3882,191.3134,True,True,baseline,208.11178866806569,landmark,True | 50 | +3156636935,10.18653/v1/2021.emnlp-main.552,2104.08821,SimCSE: Simple Contrastive Learning of Sentence Embeddings,Conference on Empirical Methods in Natural Language Processing (EMNLP),2021,conference-paper,nlp,5,480.0,1288.0,204.20889496115336,2686,230.7564,True,True,baseline,simcsesimplecontrastivelearningofsentenceembeddings,204.20889496115336,landmark,True | ||
| 51 | −3156636935,10.18653/v1/2021.emnlp-main.552,2104.08821,SimCSE: Simple Contrastive Learning of Sentence Embeddings,Conference on Empirical Methods in Natural Language Processing (EMNLP),2021,conference-paper,nlp,5,480.0,1288.0,204.20889496115336,2686,230.7564,True,True,baseline,204.20889496115336,landmark,True | 51 | +4402670856,10.18653/v1/2024.findings-acl.137,2402.03216,"M3-Embedding: Multi-Linguality, Multi-Functionality, Multi-Granularity Text Embeddings Through Self-Knowledge Distillation",,2024,conference-paper,nlp,6,315.0,700.0,194.5733507917222,700,212.9491,True,True,post,m3embeddingmultilingualitymultifunctionalitymultigranularitytextembeddingsthroughselfknowledgedistillation,194.5733507917222,landmark,True | ||
| 52 | −2219249508,10.1007/978-3-032-27827-2_35,,Perceptual Signal Analysis and Eigenvalue-Weighted Metrics for Musical Audio Quality Assessment,Lecture notes in computer science,2026,conference-paper,speech_audio,2,844.0,844.0,3046.350724637681,845,0.0,False,True,post,3000.6061689494945,landmark,True | 52 | +2219249508,10.1007/978-3-032-27827-2_35,,Perceptual Signal Analysis and Eigenvalue-Weighted Metrics for Musical Audio Quality Assessment,Lecture notes in computer science,2026,conference-paper,speech_audio,2,844.0,844.0,3046.350724637681,845,0.0,False,True,post,perceptualsignalanalysisandeigenvalueweightedmetricsformusicalaudioqualityassessment,2139.9370278891147,landmark,True | ||
| 53 | −1524333225,10.57702/jb3fvbn9,,Kaldi Speech Recognition Toolkit,Infoscience (Ecole Polytechnique Fédérale de Lausanne),2024,article,speech_audio,1,4597.0,4599.0,571.2323941653393,4609,5.5064,True,True,post,571.2323941653393,landmark,True | 53 | +1524333225,10.57702/jb3fvbn9,,Kaldi Speech Recognition Toolkit,Infoscience (Ecole Polytechnique Fédérale de Lausanne),2024,article,speech_audio,1,4597.0,4599.0,571.2323941653393,4609,5.5064,True,True,post,kaldispeechrecognitiontoolkit,571.2323941653393,landmark,True | ||
| 54 | −4392233542,10.3390/s24051546,,A Review of Machine Learning Approaches for the Personalization of Amplification in Hearing Aids,Sensors,2024,dissertation,speech_audio,1,7.0,19.0,327.9259259259259,19,,True,True,post,327.9259259259259,landmark,True | 54 | +4392233542,10.3390/s24051546,,A Review of Machine Learning Approaches for the Personalization of Amplification in Hearing Aids,Sensors,2024,dissertation,speech_audio,1,7.0,19.0,327.9259259259259,19,,True,True,post,areviewofmachinelearningapproachesforthepersonalizationofamplificationinhearingaids,327.9259259259259,landmark,True | ||
| 55 | −4311000453,10.48550/arxiv.2212.04356,2212.04356,Robust Speech Recognition via Large-Scale Weak Supervision,arXiv (Cornell University),2022,preprint,speech_audio,5,337.0,759.0,220.57287461123883,1134,,True,True,post,220.57287461123883,landmark,True | 55 | +4311000453,10.48550/arxiv.2212.04356,2212.04356,Robust Speech Recognition via Large-Scale Weak Supervision,arXiv (Cornell University),2022,preprint,speech_audio,5,337.0,759.0,220.57287461123883,1134,,True,True,post,robustspeechrecognitionvialargescaleweaksupervision,220.57287461123883,landmark,True | ||
| 56 | −2936774411,10.21437/interspeech.2019-2680,1904.08779,SpecAugment: A Simple Data Augmentation Method for Automatic Speech Recognition,Interspeech (USB),2019,conference-paper,speech_audio,5,465.0,1205.0,160.2755403270008,3499,180.2006,True,True,baseline,160.2755403270008,landmark,True | 56 | +2936774411,10.21437/interspeech.2019-2680,1904.08779,SpecAugment: A Simple Data Augmentation Method for Automatic Speech Recognition,Interspeech (USB),2019,conference-paper,speech_audio,5,465.0,1205.0,160.2755403270008,3499,180.2006,True,True,baseline,specaugmentasimpledataaugmentationmethodforautomaticspeechrecognition,160.2755403270008,landmark,True | ||
| 57 | −4406417959,10.1109/taslpro.2025.3530270,,Neural Codec Language Models are Zero-Shot Text to Speech Synthesizers,IEEE Transactions on Audio Speech and Language Processing,2025,article,speech_audio,2,281.0,281.0,95.7224566672276,122,50.7671,True,False,post,142.25873821992252,landmark,True | 57 | +2952218014,10.1109/taslp.2019.2915167,1809.07454,Conv-TasNet: Surpassing Ideal Time–Frequency Magnitude Masking for Speech Separation,IEEE/ACM Transactions on Audio Speech and Language Processing,2019,article,speech_audio,2,273.0,598.0,126.90333200584095,2042,137.8473,True,True,baseline,convtasnetsurpassingidealtimefrequencymagnitudemaskingforspeechseparation,126.90333200584095,landmark,True | ||
| 58 | −2952218014,10.1109/taslp.2019.2915167,1809.07454,Conv-TasNet: Surpassing Ideal Time–Frequency Magnitude Masking for Speech Separation,IEEE/ACM Transactions on Audio Speech and Language Processing,2019,article,speech_audio,2,273.0,598.0,126.90333200584095,2042,137.8473,True,True,baseline,126.90333200584095,landmark,True | 58 | +4406417959,10.1109/taslpro.2025.3530270,,Neural Codec Language Models are Zero-Shot Text to Speech Synthesizers,IEEE Transactions on Audio Speech and Language Processing,2025,article,speech_audio,2,281.0,281.0,95.7224566672276,122,50.7671,True,False,post,neuralcodeclanguagemodelsarezeroshottexttospeechsynthesizers,122.78901051211342,landmark,True | ||
| 59 | −2890964092,10.1109/icassp.2018.8461375,,X-Vectors: Robust DNN Embeddings for Speaker Recognition,IEEE International Conference on Acoustics Speech and Signal Processing,2018,conference-paper,speech_audio,4,274.0,698.0,108.08186643624245,2620,119.8439,True,False,baseline,108.08186643624245,landmark,True | 59 | +2890964092,10.1109/icassp.2018.8461375,,X-Vectors: Robust DNN Embeddings for Speaker Recognition,IEEE International Conference on Acoustics Speech and Signal Processing,2018,conference-paper,speech_audio,4,274.0,698.0,108.08186643624245,2620,119.8439,True,False,baseline,xvectorsrobustdnnembeddingsforspeakerrecognition,108.08186643624245,landmark,True | ||
| 60 | −3097777922,10.21437/interspeech.2020-3015,2005.08100,Conformer: Convolution-augmented Transformer for Speech Recognition,Interspeech (USB),2020,conference-paper,speech_audio,4,335.0,755.0,107.00581075694473,3070,145.6429,True,True,baseline,107.00581075694473,landmark,True | 60 | +3097777922,10.21437/interspeech.2020-3015,2005.08100,Conformer: Convolution-augmented Transformer for Speech Recognition,Interspeech (USB),2020,conference-paper,speech_audio,4,335.0,755.0,107.00581075694473,3070,145.6429,True,True,baseline,conformerconvolutionaugmentedtransformerforspeechrecognition,107.00581075694473,landmark,True | ||
| 61 | −2962866211,10.1109/taslp.2018.2842159,1708.07524,Supervised Speech Separation Based on Deep Learning: An Overview,IEEE/ACM Transactions on Audio Speech and Language Processing,2018,article,speech_audio,3,206.0,429.0,106.2474690299835,1524,120.6683,True,True,baseline,106.2474690299835,landmark,True | 61 | +2962866211,10.1109/taslp.2018.2842159,1708.07524,Supervised Speech Separation Based on Deep Learning: An Overview,IEEE/ACM Transactions on Audio Speech and Language Processing,2018,article,speech_audio,3,206.0,429.0,106.2474690299835,1524,120.6683,True,True,baseline,supervisedspeechseparationbasedondeeplearninganoverview,106.2474690299835,landmark,True | ||
| 62 | −1530164934,10.7275/a01b-fx07,,A Probabilistic Model of Hierarchical Music Analysis,Scholarworks (University of Massachusetts Amherst),2020,dissertation,speech_audio,1,15.0,15.0,105.97222222222223,36,,True,True,baseline,105.97222222222223,landmark,True | 62 | +1530164934,10.7275/a01b-fx07,,A Probabilistic Model of Hierarchical Music Analysis,Scholarworks (University of Massachusetts Amherst),2020,dissertation,speech_audio,1,15.0,15.0,105.97222222222223,36,,True,True,baseline,aprobabilisticmodelofhierarchicalmusicanalysis,105.97222222222223,landmark,True | ||
| 63 | −2964243274,10.1109/icassp.2018.8461368,1712.05884,Natural TTS Synthesis by Conditioning Wavenet on MEL Spectrogram Predictions,IEEE International Conference on Acoustics Speech and Signal Processing,2018,conference-paper,speech_audio,3,299.0,662.0,102.50744352549069,2692,119.0117,True,True,baseline,102.50744352549069,landmark,True | 63 | +2964243274,10.1109/icassp.2018.8461368,1712.05884,Natural TTS Synthesis by Conditioning Wavenet on MEL Spectrogram Predictions,IEEE International Conference on Acoustics Speech and Signal Processing,2018,conference-paper,speech_audio,3,299.0,662.0,102.50744352549069,2692,119.0117,True,True,baseline,naturalttssynthesisbyconditioningwavenetonmelspectrogrampredictions,102.50744352549069,landmark,True | ||
| 64 | −3167533889,10.48550/arxiv.2106.04624,2106.04624,SpeechBrain: A General-Purpose Speech Toolkit,arXiv (Cornell University),2021,preprint,speech_audio,1,129.0,288.0,96.44297133944238,504,,True,True,baseline,96.44297133944238,landmark,True | 64 | +3167533889,10.48550/arxiv.2106.04624,2106.04624,SpeechBrain: A General-Purpose Speech Toolkit,arXiv (Cornell University),2021,preprint,speech_audio,1,129.0,288.0,96.44297133944238,504,,True,True,baseline,speechbrainageneralpurposespeechtoolkit,96.44297133944238,landmark,True | ||
| 65 | −3169320628,10.1109/taslp.2021.3122291,2106.07447,HuBERT: Self-Supervised Speech Representation Learning by Masked Prediction of Hidden Units,IEEE/ACM Transactions on Audio Speech and Language Processing,2021,article,speech_audio,5,222.0,765.0,89.15495130101968,2919,124.2084,True,True,baseline,89.15495130101968,landmark,True | 65 | +3169320628,10.1109/taslp.2021.3122291,2106.07447,HuBERT: Self-Supervised Speech Representation Learning by Masked Prediction of Hidden Units,IEEE/ACM Transactions on Audio Speech and Language Processing,2021,article,speech_audio,5,222.0,765.0,89.15495130101968,2919,124.2084,True,True,baseline,hubertselfsupervisedspeechrepresentationlearningbymaskedpredictionofhiddenunits,89.15495130101968,landmark,True | ||
| 66 | −2975281968,,,"Modeling Music : Studies of Music Transcription, Music Perception and Music Production",KTH Publication Database DiVA (KTH Royal Institute of Technology),2018,dissertation,speech_audio,6,1.0,13.0,87.36363636363636,15,,True,True,baseline,87.36363636363636,landmark,True | 66 | +2975281968,,,"Modeling Music : Studies of Music Transcription, Music Perception and Music Production",KTH Publication Database DiVA (KTH Royal Institute of Technology),2018,dissertation,speech_audio,6,1.0,13.0,87.36363636363636,15,,True,True,baseline,modelingmusicstudiesofmusictranscriptionmusicperceptionandmusicproduction,87.36363636363636,landmark,True | ||
| 67 | −4372260310,10.1109/icassp49357.2023.10095969,2211.06687,Large-Scale Contrastive Language-Audio Pretraining with Feature Fusion and Keyword-to-Caption Augmentation,IEEE International Conference on Acoustics Speech and Signal Processing,2023,conference-paper,speech_audio,5,124.0,320.0,87.23607346034898,439,97.1083,True,True,post,87.23607346034898,landmark,True | 67 | +4372260310,10.1109/icassp49357.2023.10095969,2211.06687,Large-Scale Contrastive Language-Audio Pretraining with Feature Fusion and Keyword-to-Caption Augmentation,IEEE International Conference on Acoustics Speech and Signal Processing,2023,conference-paper,speech_audio,5,124.0,320.0,87.23607346034898,439,97.1083,True,True,post,largescalecontrastivelanguageaudiopretrainingwithfeaturefusionandkeywordtocaptionaugmentation,87.23607346034898,landmark,True | ||
| 68 | −4372266552,10.1109/icassp49357.2023.10095889,2206.04769,CLAP Learning Audio Concepts from Natural Language Supervision,IEEE International Conference on Acoustics Speech and Signal Processing,2023,conference-paper,speech_audio,4,134.0,318.0,86.6908480012218,438,96.4447,True,True,baseline,86.6908480012218,landmark,True | 68 | +4372266552,10.1109/icassp49357.2023.10095889,2206.04769,CLAP Learning Audio Concepts from Natural Language Supervision,IEEE International Conference on Acoustics Speech and Signal Processing,2023,conference-paper,speech_audio,4,134.0,318.0,86.6908480012218,438,96.4447,True,True,baseline,claplearningaudioconceptsfromnaturallanguagesupervision,86.6908480012218,landmark,True | ||
| 69 | −2900368655,10.1109/icassp.2019.8683855,1811.02508,SDR – Half-baked or Well Done?,IEEE International Conference on Acoustics Speech and Signal Processing,2019,conference-paper,speech_audio,1,151.0,313.0,85.71885565669702,1146,88.5281,True,True,baseline,85.71885565669702,landmark,True | 69 | +3209984917,10.1109/jstsp.2022.3188113,2110.13900,WavLM: Large-Scale Self-Supervised Pre-Training for Full Stack Speech Processing,IEEE Journal of Selected Topics in Signal Processing,2022,article,speech_audio,5,388.0,800.0,82.43168975381538,1897,117.1333,True,True,baseline,wavlmlargescaleselfsupervisedpretrainingforfullstackspeechprocessing,82.43168975381538,landmark,True | ||
| 70 | −3209984917,10.1109/jstsp.2022.3188113,2110.13900,WavLM: Large-Scale Self-Supervised Pre-Training for Full Stack Speech Processing,IEEE Journal of Selected Topics in Signal Processing,2022,article,speech_audio,5,388.0,800.0,82.43168975381538,1897,117.1333,True,True,baseline,82.43168975381538,landmark,True | 70 | +3196974791,10.21437/interspeech.2021-698,,AST: Audio Spectrogram Transformer,Interspeech (USB),2021,conference-paper,speech_audio,2,119.0,308.0,72.25665452507705,1086,83.5514,True,False,baseline,astaudiospectrogramtransformer,72.25665452507705,landmark,True | ||
| 71 | −4318351475,10.48550/arxiv.2301.11325,2301.11325,MuChoMusic dataset,arXiv (Cornell University),2023,preprint,speech_audio,4,126.0,164.0,77.2652719665272,182,,True,True,post,77.2652719665272,landmark,True | 71 | +2775304348,10.1109/icassp.2018.8462105,1712.01769,State-of-the-Art Speech Recognition with Sequence-to-Sequence Models,IEEE International Conference on Acoustics Speech and Signal Processing,2018,conference-paper,speech_audio,6,240.0,455.0,70.45451178866807,1009,71.1573,True,True,baseline,stateoftheartspeechrecognitionwithsequencetosequencemodels,70.45451178866807,landmark,True | ||
| 72 | −3196974791,10.21437/interspeech.2021-698,,AST: Audio Spectrogram Transformer,Interspeech (USB),2021,conference-paper,speech_audio,2,119.0,308.0,72.25665452507705,1086,83.5514,True,False,baseline,72.25665452507705,landmark,True | 72 | +3015199127,10.1109/icassp40776.2020.9054266,,Dual-Path RNN: Efficient Long Sequence Modeling for Time-Domain Single-Channel Speech Separation,IEEE International Conference on Acoustics Speech and Signal Processing,2020,conference-paper,speech_audio,2,151.0,293.0,68.6972461420411,780,69.2189,True,False,baseline,dualpathrnnefficientlongsequencemodelingfortimedomainsinglechannelspeechseparation,68.6972461420411,landmark,True | ||
| 73 | −7135186946,10.1109/jstsp.2026.3673981,,Scalable Fluid Antenna Systems: A New Paradigm for Array Signal Processing,IEEE Journal of Selected Topics in Signal Processing,2026,article,speech_audio,1,20.0,20.0,66.31436314363144,20,82.3333,True,False,post,71.10441158648091,landmark,True | 73 | +2808631503,10.21437/interspeech.2018-1929,1806.05622,VoxCeleb2: Deep Speaker Recognition,Interspeech (USB),2018,conference-paper,speech_audio,4,149.0,442.0,68.44152573756327,2246,81.0403,True,True,baseline,voxceleb2deepspeakerrecognition,68.44152573756327,landmark,True | ||
| 74 | −2775304348,10.1109/icassp.2018.8462105,1712.01769,State-of-the-Art Speech Recognition with Sequence-to-Sequence Models,IEEE International Conference on Acoustics Speech and Signal Processing,2018,conference-paper,speech_audio,6,240.0,455.0,70.45451178866807,1009,71.1573,True,True,baseline,70.45451178866807,landmark,True | 74 | +2972333964,10.21437/interspeech.2019-2008,,GELP: GAN-Excited Liner Prediction for Speech Synthesis from Mel-Spectrogram,Aaltodoc (Aalto University),2019,dissertation,speech_audio,3,8.0,17.0,61.90681003584229,34,,True,True,baseline,gelpganexcitedlinerpredictionforspeechsynthesisfrommelspectrogram,61.90681003584229,landmark,True | ||
| 75 | −3015199127,10.1109/icassp40776.2020.9054266,,Dual-Path RNN: Efficient Long Sequence Modeling for Time-Domain Single-Channel Speech Separation,IEEE International Conference on Acoustics Speech and Signal Processing,2020,conference-paper,speech_audio,2,151.0,293.0,68.6972461420411,780,69.2189,True,False,baseline,68.6972461420411,landmark,True | 75 | +4221145109,10.48550/arxiv.2202.03555,2202.03555,"data2vec: A General Framework for Self-supervised Learning in Speech, Vision and Language",arXiv (Cornell University),2022,preprint,speech_audio,8,152.0,208.0,60.446848378310506,231,,True,True,baseline,data2vecageneralframeworkforselfsupervisedlearninginspeechvisionandlanguage,60.446848378310506,landmark,True | ||
| 76 | −2808631503,10.21437/interspeech.2018-1929,1806.05622,VoxCeleb2: Deep Speaker Recognition,Interspeech (USB),2018,conference-paper,speech_audio,4,149.0,442.0,68.44152573756327,2246,81.0403,True,True,baseline,68.44152573756327,landmark,True | 76 | +2898847420,10.1109/icassp.2019.8683143,1811.00002,Waveglow: A Flow-based Generative Network for Speech Synthesis,IEEE International Conference on Acoustics Speech and Signal Processing,2019,conference-paper,speech_audio,4,233.0,453.0,60.25296246317956,972,60.7013,True,True,baseline,waveglowaflowbasedgenerativenetworkforspeechsynthesis,60.25296246317956,landmark,True | ||
| 77 | −7205708264,10.1146/annurev,,Relationship between educational robotics and executive functions in children with neurodevelopmental disorders,HAL (Le Centre pour la Communication Scientifique Directe),2026,conference-paper,robotics,1,117.0,117.0,897.9818032562595,123,157.1634,True,True,post,415.96080778091334,landmark,True | 77 | +7205708264,10.1146/annurev,,Relationship between educational robotics and executive functions in children with neurodevelopmental disorders,HAL (Le Centre pour la Communication Scientifique Directe),2026,conference-paper,robotics,1,117.0,117.0,897.9818032562595,123,157.1634,True,True,post,relationshipbetweeneducationalroboticsandexecutivefunctionsinchildrenwithneurodevelopmentaldisorders,296.6500382263346,landmark,True | ||
| 78 | −4385473486,10.48550/arxiv.2307.15818,2307.15818,RT-2: Vision-Language-Action Models Transfer Web Knowledge to Robotic Control,arXiv (Cornell University),2023,preprint,robotics,7,157.0,252.0,151.2,274,,True,True,post,151.2,landmark,True | 78 | +4385473486,10.48550/arxiv.2307.15818,2307.15818,RT-2: Vision-Language-Action Models Transfer Web Knowledge to Robotic Control,arXiv (Cornell University),2023,preprint,robotics,7,157.0,252.0,151.2,274,,True,True,post,rt2visionlanguageactionmodelstransferwebknowledgetoroboticcontrol,151.2,landmark,True | ||
| 79 | −7126053009,10.1016/j.inffus.2026.104193,2508.05342,Information-theoretic graph fusion with vision-language-action model for policy reasoning and dual robotic control,Information Fusion,2026,article,robotics,3,41.0,41.0,45.41643153526971,41,97.2957,False,True,post,145.7640437522859,landmark,True | 79 | +4293774946,10.1007/978-981-19-2980-9_32,,Employing Adaptive Learning and Intelligent Tutoring Robots for Virtual Classrooms and Smart Campuses: Reforming Education in the Age of Artificial Intelligence,Lecture notes in electrical engineering,2022,book-chapter,robotics,1,91.0,175.0,135.97268806899856,262,161.0471,False,False,baseline,employingadaptivelearningandintelligenttutoringrobotsforvirtualclassroomsandsmartcampusesreformingeducationintheageofartificialintelligence,135.97268806899856,landmark,True | ||
| 80 | −4414079054,10.15607/rss.2025.xxi.010,,π₀: A Vision-Language-Action Flow Model for General Robot Control,,2025,conference-paper,robotics,2,274.0,274.0,243.52116128619693,274,276.3475,True,True,post,138.71492623579633,landmark,True | 80 | +2963188159,10.15607/rss.2018.xiv.019,1711.00199,PoseCNN: A Convolutional Neural Network for 6D Object Pose Estimation in Cluttered Scenes,,2018,conference-paper,robotics,4,201.0,451.0,129.2718583898181,2127,284.4153,True,True,baseline,posecnnaconvolutionalneuralnetworkfor6dobjectposeestimationinclutteredscenes,129.2718583898181,landmark,True | ||
| 81 | −4293774946,10.1007/978-981-19-2980-9_32,,Employing Adaptive Learning and Intelligent Tutoring Robots for Virtual Classrooms and Smart Campuses: Reforming Education in the Age of Artificial Intelligence,Lecture notes in electrical engineering,2022,book-chapter,robotics,1,91.0,175.0,135.97268806899856,262,161.0471,False,False,baseline,135.97268806899856,landmark,True | 81 | +4383097638,10.1109/icra48891.2023.10160591,2209.07753,Code as Policies: Language Model Programs for Embodied Control,Proceedings - IEEE International Conference on Robotics and Automation/Proceedings,2023,conference-paper,robotics,3,237.0,511.0,125.95880564003319,722,324.1052,True,True,post,codeaspolicieslanguagemodelprogramsforembodiedcontrol,125.95880564003319,landmark,True | ||
| 82 | −7130402520,10.1109/tro.2026.3666139,2402.13255,How NeRFs and 3-D Gaussian Splatting Are Reshaping SLAM: A Survey,IEEE Transactions on Robotics,2026,article,robotics,3,38.0,38.0,49.59542857142858,38,48.5016,True,True,post,135.09838201431373,landmark,True | 82 | +4385430679,10.15607/rss.2023.xix.025,2212.06817,RT-1: Robotics Transformer for Real-World Control at Scale,,2023,conference-paper,robotics,10,195.0,488.0,120.28942691259529,689,309.7205,True,True,post,rt1roboticstransformerforrealworldcontrolatscale,120.28942691259529,landmark,True | ||
| 83 | −2963188159,10.15607/rss.2018.xiv.019,1711.00199,PoseCNN: A Convolutional Neural Network for 6D Object Pose Estimation in Cluttered Scenes,,2018,conference-paper,robotics,4,201.0,451.0,129.2718583898181,2127,284.4153,True,True,baseline,129.2718583898181,landmark,True | 83 | +4414079054,10.15607/rss.2025.xxi.010,,π₀: A Vision-Language-Action Flow Model for General Robot Control,,2025,conference-paper,robotics,2,274.0,274.0,243.52116128619693,274,276.3475,True,True,post,avisionlanguageactionflowmodelforgeneralrobotcontrol,119.73020953850207,landmark,True | ||
| 84 | −4398796510,10.1109/tnnls.2025.3650584,2405.14093,A Survey on Vision--Language--Action Models for Embodied AI,IEEE Transactions on Neural Networks and Learning Systems,2026,article,robotics,10,36.0,36.0,96.49320091673033,36,77.9076,True,True,post,127.98794085566564,landmark,True | 84 | +2990747716,10.1177/0278364919887447,,Learning dexterous in-hand manipulation,The International Journal of Robotics Research,2019,article,robotics,2,490.0,777.0,118.1470865906983,1585,89.792,True,True,baseline,learningdexterousinhandmanipulation,118.1470865906983,landmark,True | ||
| 85 | −4383097638,10.1109/icra48891.2023.10160591,2209.07753,Code as Policies: Language Model Programs for Embodied Control,Proceedings - IEEE International Conference on Robotics and Automation/Proceedings,2023,conference-paper,robotics,3,237.0,511.0,125.95880564003319,722,324.1052,True,True,post,125.95880564003319,landmark,True | 85 | +4383108457,10.1109/icra48891.2023.10161317,2209.11302,ProgPrompt: Generating Situated Robot Task Plans using Large Language Models,Proceedings - IEEE International Conference on Robotics and Automation/Proceedings,2023,conference-paper,robotics,7,245.0,492.0,113.46421800672258,583,109.6395,True,True,baseline,progpromptgeneratingsituatedrobottaskplansusinglargelanguagemodels,113.46421800672258,landmark,True | ||
| 86 | −4385430679,10.15607/rss.2023.xix.025,2212.06817,RT-1: Robotics Transformer for Real-World Control at Scale,,2023,conference-paper,robotics,10,195.0,488.0,120.28942691259529,689,309.7205,True,True,post,120.28942691259529,landmark,True | 86 | +1581527321,10.7907/2e18-0e29,,Collision Detection and Avoidance in Computer Controlled Manipulators,CaltechTHESIS (California Institute of Technology),2018,dissertation,robotics,1,14.0,16.0,110.6320610687023,276,,True,True,baseline,collisiondetectionandavoidanceincomputercontrolledmanipulators,110.6320610687023,landmark,True | ||
| 87 | −2990747716,10.1177/0278364919887447,,Learning dexterous in-hand manipulation,The International Journal of Robotics Research,2019,article,robotics,2,490.0,777.0,118.1470865906983,1585,89.792,True,True,baseline,118.1470865906983,landmark,True | 87 | +3043971245,10.1109/tro.2021.3075644,2007.11898,"ORB-SLAM3: An Accurate Open-Source Library for Visual, Visual–Inertial, and Multimap SLAM",IEEE Transactions on Robotics,2021,article,robotics,2,542.0,1312.0,104.21312513733956,4274,299.5553,True,True,baseline,orbslam3anaccurateopensourcelibraryforvisualvisualinertialandmultimapslam,104.21312513733956,landmark,True | ||
| 88 | −4383108457,10.1109/icra48891.2023.10161317,2209.11302,ProgPrompt: Generating Situated Robot Task Plans using Large Language Models,Proceedings - IEEE International Conference on Robotics and Automation/Proceedings,2023,conference-paper,robotics,7,245.0,492.0,113.46421800672258,583,109.6395,True,True,baseline,113.46421800672258,landmark,True | 88 | +7126053009,10.1016/j.inffus.2026.104193,2508.05342,Information-theoretic graph fusion with vision-language-action model for policy reasoning and dual robotic control,Information Fusion,2026,article,robotics,3,41.0,41.0,45.41643153526971,41,97.2957,False,True,post,informationtheoreticgraphfusionwithvisionlanguageactionmodelforpolicyreasoninganddualroboticcontrol,103.95428689982666,landmark,True | ||
| 89 | −1581527321,10.7907/2e18-0e29,,Collision Detection and Avoidance in Computer Controlled Manipulators,CaltechTHESIS (California Institute of Technology),2018,dissertation,robotics,1,14.0,16.0,110.6320610687023,276,,True,True,baseline,110.6320610687023,landmark,True | 89 | +4323572061,10.48550/arxiv.2303.03378,2303.03378,PaLM-E: An Embodied Multimodal Language Model,arXiv (Cornell University),2023,preprint,robotics,7,263.0,330.0,103.01438010104935,346,,True,True,post,palmeanembodiedmultimodallanguagemodel,103.01438010104935,landmark,True | ||
| 90 | −3043971245,10.1109/tro.2021.3075644,2007.11898,"ORB-SLAM3: An Accurate Open-Source Library for Visual, Visual–Inertial, and Multimap SLAM",IEEE Transactions on Robotics,2021,article,robotics,2,542.0,1312.0,104.21312513733956,4274,299.5553,True,True,baseline,104.21312513733956,landmark,True | 90 | +3003533476,10.1109/tits.2021.3054625,2002.00444,Deep Reinforcement Learning for Autonomous Driving: A Survey,IEEE Transactions on Intelligent Transportation Systems,2021,article,robotics,3,436.0,870.0,101.39190540115963,2313,122.2676,True,True,baseline,deepreinforcementlearningforautonomousdrivingasurvey,101.39190540115963,landmark,True | ||
| 91 | −4323572061,10.48550/arxiv.2303.03378,2303.03378,PaLM-E: An Embodied Multimodal Language Model,arXiv (Cornell University),2023,preprint,robotics,7,263.0,330.0,103.01438010104935,346,,True,True,post,103.01438010104935,landmark,True | 91 | +4385430674,10.15607/rss.2023.xix.016,2304.13705,Learning Fine-Grained Bimanual Manipulation with Low-Cost Hardware,,2023,conference-paper,robotics,6,86.0,395.0,97.36541727556381,649,291.7396,True,True,post,learningfinegrainedbimanualmanipulationwithlowcosthardware,97.36541727556381,landmark,True | ||
| 92 | −3003533476,10.1109/tits.2021.3054625,2002.00444,Deep Reinforcement Learning for Autonomous Driving: A Survey,IEEE Transactions on Intelligent Transportation Systems,2021,article,robotics,3,436.0,870.0,101.39190540115963,2313,122.2676,True,True,baseline,101.39190540115963,landmark,True | 92 | +7130402520,10.1109/tro.2026.3666139,2402.13255,How NeRFs and 3-D Gaussian Splatting Are Reshaping SLAM: A Survey,IEEE Transactions on Robotics,2026,article,robotics,3,38.0,38.0,49.59542857142858,38,48.5016,True,True,post,hownerfsand3dgaussiansplattingarereshapingslamasurvey,96.34787566325397,landmark,True | ||
| 93 | −7140452175,10.1109/tmech.2025.3579247,2501.02116,"Humanoid Locomotion and Manipulation: Current Progress and Challenges in Control, Planning, and Learning",IEEE/ASME Transactions on Mechatronics,2026,article,robotics,3,28.0,28.0,50.20033955857386,28,41.6958,True,True,post,99.54617622107328,landmark,True | 93 | +4398796510,10.1109/tnnls.2025.3650584,2405.14093,A Survey on Vision--Language--Action Models for Embodied AI,IEEE Transactions on Neural Networks and Learning Systems,2026,article,robotics,10,36.0,36.0,96.49320091673033,36,77.9076,True,True,post,asurveyonvisionlanguageactionmodelsforembodiedai,91.27693483887218,landmark,True | ||
| 94 | −4385430674,10.15607/rss.2023.xix.016,2304.13705,Learning Fine-Grained Bimanual Manipulation with Low-Cost Hardware,,2023,conference-paper,robotics,6,86.0,395.0,97.36541727556381,649,291.7396,True,True,post,97.36541727556381,landmark,True | 94 | +4385403811,10.15607/rss.2023.xix.026,,Diffusion Policy: Visuomotor Policy Learning via Action Diffusion,,2023,conference-paper,robotics,2,113.0,387.0,89.24929343211716,522,98.6756,False,True,post,diffusionpolicyvisuomotorpolicylearningviaactiondiffusion,89.24929343211716,landmark,True | ||
| 95 | −4406918931,10.1186/s44147-025-00582-3,,"UAV swarms: research, challenges, and future directions",Journal of Engineering and Applied Science,2025,article,robotics,1,182.0,182.0,69.22742920177257,182,80.227,True,True,post,92.13911158728078,landmark,True | 95 | +2925329277,10.23919/ecc.2019.8796030,1903.11199,Control Barrier Functions: Theory and Applications,European Control Conference (ECC),2019,conference-paper,robotics,2,90.0,265.0,87.20226791818132,1936,124.0197,True,True,baseline,controlbarrierfunctionstheoryandapplications,87.20226791818132,landmark,True | ||
| 96 | −2923943538,10.14711/thesis-991012769067103412,,FIESTA : fast incremental euclidean distance fields for online motion planning of aerial robots,,2019,dissertation,robotics,3,5.0,12.0,91.15966386554621,15,,True,False,baseline,91.15966386554621,landmark,True | 96 | +4388761637,10.17760/d20592696,2308.13972,Towards autonomous multi-modal mobility morphobot (M4) robot: traversability estimation and 3D path planning,,2023,dissertation,robotics,4,1.0,4.0,86.35051546391752,4,,True,True,post,towardsautonomousmultimodalmobilitymorphobotm4robottraversabilityestimationand3dpathplanning,86.35051546391752,landmark,True | ||
| 97 | −4385403811,10.15607/rss.2023.xix.026,,Diffusion Policy: Visuomotor Policy Learning via Action Diffusion,,2023,conference-paper,robotics,2,113.0,387.0,89.24929343211716,522,98.6756,False,True,post,89.24929343211716,landmark,True | 97 | +3129245057,10.1109/iros45743.2020.9341176,2007.00258,LIO-SAM: Tightly-coupled Lidar Inertial Odometry via Smoothing and Mapping,IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS),2020,conference-paper,robotics,4,136.0,357.0,83.05667731629394,2199,295.3223,True,True,baseline,liosamtightlycoupledlidarinertialodometryviasmoothingandmapping,83.05667731629394,landmark,True | ||
| 98 | −7152514513,10.1016/j.asoc.2026.115169,,Cooperative 4D trajectory planning for multi aerial vehicles combining receding horizon optimization and differential evolution algorithm in dynamic battlefield environment,Applied Soft Computing,2026,article,robotics,3,25.0,25.0,27.82003829717675,25,90.3155,True,True,post,88.88051448310114,landmark,True | 98 | +4390874280,10.1109/iccv51070.2023.00280,2212.04088,LLM-Planner: Few-Shot Grounded Planning for Embodied Agents with Large Language Models,IEEE/CVF International Conference on Computer Vision (ICCV),2023,conference-paper,robotics,9,133.0,329.0,81.09676527508987,420,188.7991,True,True,post,llmplannerfewshotgroundedplanningforembodiedagentswithlargelanguagemodels,81.09676527508987,landmark,True | ||
| 99 | −7123353670,10.1109/tase.2026.3653476,,Trajectory Planning Method for Fracture Reduction of Parallel Robots Based on DMP and APF,IEEE Transactions on Automation Science and Engineering,2026,article,robotics,1,25.0,25.0,27.692946058091287,25,69.497,True,False,post,88.88051448310114,landmark,True | 99 | +4406918931,10.1186/s44147-025-00582-3,,"UAV swarms: research, challenges, and future directions",Journal of Engineering and Applied Science,2025,article,robotics,1,182.0,182.0,69.22742920177257,182,80.227,True,True,post,uavswarmsresearchchallengesandfuturedirections,79.52882531389552,landmark,True | ||
| 100 | −2925329277,10.23919/ecc.2019.8796030,1903.11199,Control Barrier Functions: Theory and Applications,European Control Conference (ECC),2019,conference-paper,robotics,2,90.0,265.0,87.20226791818132,1936,124.0197,True,True,baseline,87.20226791818132,landmark,True | 100 | +2758237641,10.1109/icra.2018.8460875,,Using Simulation and Domain Adaptation to Improve Efficiency of Deep Robotic Grasping,Proceedings - IEEE International Conference on Robotics and Automation/Proceedings,2018,conference-paper,robotics,3,152.0,260.0,74.52479641098161,609,130.2781,True,True,baseline,usingsimulationanddomainadaptationtoimproveefficiencyofdeeproboticgrasping,74.52479641098161,landmark,True | ||
| 101 | −4388761637,10.17760/d20592696,2308.13972,Towards autonomous multi-modal mobility morphobot (M4) robot: traversability estimation and 3D path planning,,2023,dissertation,robotics,4,1.0,4.0,86.35051546391752,4,,True,True,post,86.35051546391752,landmark,True | 101 | +7140452175,10.1109/tmech.2025.3579247,2501.02116,"Humanoid Locomotion and Manipulation: Current Progress and Challenges in Control, Planning, and Learning",IEEE/ASME Transactions on Mechatronics,2026,article,robotics,3,28.0,28.0,50.20033955857386,28,41.6958,True,True,post,humanoidlocomotionandmanipulationcurrentprogressandchallengesincontrolplanningandlearning,70.99317154134503,landmark,True | ||
| 102 | −4399978538,10.3390/diagnostics14131333,,Exploring Augmented Reality Integration in Diagnostic Imaging: Myth or Reality?,Diagnostics,2024,dissertation,hci,3,35.0,60.0,658.2127659574469,60,,True,True,post,658.2127659574469,landmark,True | 102 | +4399978538,10.3390/diagnostics14131333,,Exploring Augmented Reality Integration in Diagnostic Imaging: Myth or Reality?,Diagnostics,2024,dissertation,hci,3,35.0,60.0,658.2127659574469,60,,True,True,post,exploringaugmentedrealityintegrationindiagnosticimagingmythorreality,658.2127659574469,landmark,True | ||
| 103 | −4414820664,10.21203/rs.3.rs-8148142/v1,2503.17473,How AI and Human Behaviors Shape Psychosocial Effects of Extended Chatbot Use: A Longitudinal Randomized Controlled Study,Research Square,2026,preprint,hci,2,97.0,97.0,632.2017543859649,97,,False,True,post,344.8563961944324,landmark,True | 103 | +2518959197,10.25335/nw4q-va87,,Cybersickness prioritization and modeling,Michigan State University Libraries,2024,dissertation,hci,2,23.0,23.0,291.2096774193549,23,,False,True,post,cybersicknessprioritizationandmodeling,291.2096774193549,landmark,True | ||
| 104 | −2518959197,10.25335/nw4q-va87,,Cybersickness prioritization and modeling,Michigan State University Libraries,2024,dissertation,hci,2,23.0,23.0,291.2096774193549,23,,False,True,post,291.2096774193549,landmark,True | 104 | +4387835442,10.1145/3586183.3606763,2304.03442,Generative Agents: Interactive Simulacra of Human Behavior,ACM Symposium on User Interface Software and Technology (UIST),2023,conference-paper,hci,6,466.0,1188.0,273.9745751869643,2048,387.1409,True,True,post,generativeagentsinteractivesimulacraofhumanbehavior,273.9745751869643,landmark,True | ||
| 105 | −4387835442,10.1145/3586183.3606763,2304.03442,Generative Agents: Interactive Simulacra of Human Behavior,ACM Symposium on User Interface Software and Technology (UIST),2023,conference-paper,hci,6,466.0,1188.0,273.9745751869643,2048,387.1409,True,True,post,273.9745751869643,landmark,True | 105 | +4404112583,10.1561/1100000095,2110.05352,"All One Needs to Know about Metaverse: A Complete Survey on Technological Singularity, Virtual Ecosystem, and Research Agenda",Foundations and Trends® in Human–Computer Interaction,2024,article,hci,7,1016.0,1085.0,265.27941176470586,1082,154.4433,True,True,baseline,alloneneedstoknowaboutmetaverseacompletesurveyontechnologicalsingularityvirtualecosystemandresearchagenda,265.27941176470586,landmark,True | ||
| 106 | −4286221734,10.17918/00001117,,Human-computer interaction,,2022,dissertation,hci,2,3.0,3.0,267.6,8,,True,True,baseline,267.6,landmark,True | 106 | +4294891500,10.1109/comst.2022.3202047,2203.02662,"A Survey on Metaverse: Fundamentals, Security, and Privacy",IEEE Communications Surveys & Tutorials,2022,article,hci,7,568.0,1062.0,261.00875052618636,1575,347.0709,True,True,baseline,asurveyonmetaversefundamentalssecurityandprivacy,261.00875052618636,landmark,True | ||
| 107 | −4404112583,10.1561/1100000095,2110.05352,"All One Needs to Know about Metaverse: A Complete Survey on Technological Singularity, Virtual Ecosystem, and Research Agenda",Foundations and Trends® in Human–Computer Interaction,2024,article,hci,7,1016.0,1085.0,265.27941176470586,1082,154.4433,True,True,baseline,265.27941176470586,landmark,True | 107 | +2910064571,10.1007/978-3-319-96906-0_6,,A Practical Guide to Usability Testing,Springer eBooks,2019,book-chapter,hci,1,301.0,354.0,258.125,659,109.4298,False,False,baseline,apracticalguidetousabilitytesting,258.125,landmark,True | ||
| 108 | −4294891500,10.1109/comst.2022.3202047,2203.02662,"A Survey on Metaverse: Fundamentals, Security, and Privacy",IEEE Communications Surveys & Tutorials,2022,article,hci,7,568.0,1062.0,261.00875052618636,1575,347.0709,True,True,baseline,261.00875052618636,landmark,True | 108 | +2915602850,,,"Memes, Communities and Continuous Change: Chinese Internet Vernacular Explained",Data Archiving and Networked Services (DANS),2021,dissertation,hci,1,37.0,38.0,249.76068376068378,39,,False,True,baseline,memescommunitiesandcontinuouschangechineseinternetvernacularexplained,249.76068376068378,landmark,True | ||
| 109 | −2910064571,10.1007/978-3-319-96906-0_6,,A Practical Guide to Usability Testing,Springer eBooks,2019,book-chapter,hci,1,301.0,354.0,258.125,659,109.4298,False,False,baseline,258.125,landmark,True | 109 | +4414820664,10.21203/rs.3.rs-8148142/v1,2503.17473,How AI and Human Behaviors Shape Psychosocial Effects of Extended Chatbot Use: A Longitudinal Randomized Controlled Study,Research Square,2026,preprint,hci,2,97.0,97.0,632.2017543859649,97,,False,True,post,howaiandhumanbehaviorsshapepsychosocialeffectsofextendedchatbotusealongitudinalrandomizedcontrolledstudy,245.94062998251673,landmark,True | ||
| 110 | −4409885395,10.1145/3706598.3713778,,The Impact of Generative AI on Critical Thinking: Self-Reported Reductions in Cognitive Effort and Confidence Effects From a Survey of Knowledge Workers,CHI Conference on Human Factors in Computing Systems,2025,conference-paper,hci,3,502.0,502.0,162.5548189699133,502,530.8542,True,True,post,254.1419451473349,landmark,True | 110 | +4285585446,10.1016/j.ijinfomgt.2022.102542,,"Metaverse beyond the hype: Multidisciplinary perspectives on emerging challenges, opportunities, and agenda for research, practice and policy",International Journal of Information Management,2022,article,hci,2,787.0,1634.0,245.39307870858832,2732,283.5672,True,True,baseline,metaversebeyondthehypemultidisciplinaryperspectivesonemergingchallengesopportunitiesandagendaforresearchpracticeandpolicy,245.39307870858832,landmark,True | ||
| 111 | −2915602850,,,"Memes, Communities and Continuous Change: Chinese Internet Vernacular Explained",Data Archiving and Networked Services (DANS),2021,dissertation,hci,1,37.0,38.0,249.76068376068378,39,,False,True,baseline,249.76068376068378,landmark,True | 111 | +4409885395,10.1145/3706598.3713778,,The Impact of Generative AI on Critical Thinking: Self-Reported Reductions in Cognitive Effort and Confidence Effects From a Survey of Knowledge Workers,CHI Conference on Human Factors in Computing Systems,2025,conference-paper,hci,3,502.0,502.0,162.5548189699133,502,530.8542,True,True,post,theimpactofgenerativeaioncriticalthinkingselfreportedreductionsincognitiveeffortandconfidenceeffectsfromasurveyofknowledgeworkers,219.35972696470085,landmark,True | ||
| 112 | −4285585446,10.1016/j.ijinfomgt.2022.102542,,"Metaverse beyond the hype: Multidisciplinary perspectives on emerging challenges, opportunities, and agenda for research, practice and policy",International Journal of Information Management,2022,article,hci,2,787.0,1634.0,245.39307870858832,2732,283.5672,True,True,baseline,245.39307870858832,landmark,True | 112 | +2308543850,10.17615/cd1t-9y62,,Scene-motion- and latency-perception thresholds for head-mounted displays,Carolina Digital Repository (University of North Carolina at Chapel Hill),2019,dissertation,hci,2,25.0,26.0,195.9915254237288,30,,True,True,baseline,scenemotionandlatencyperceptionthresholdsforheadmounteddisplays,195.9915254237288,landmark,True | ||
| 113 | −2308543850,10.17615/cd1t-9y62,,Scene-motion- and latency-perception thresholds for head-mounted displays,Carolina Digital Repository (University of North Carolina at Chapel Hill),2019,dissertation,hci,2,25.0,26.0,195.9915254237288,30,,True,True,baseline,195.9915254237288,landmark,True | 113 | +4206484811,10.1109/access.2021.3140175,,"A Metaverse: Taxonomy, Components, Applications, and Open Challenges",IEEE Access,2022,article,hci,1,791.0,1282.0,192.52994302595485,1824,197.5614,True,True,baseline,ametaversetaxonomycomponentsapplicationsandopenchallenges,192.52994302595485,landmark,True | ||
| 114 | −4206484811,10.1109/access.2021.3140175,,"A Metaverse: Taxonomy, Components, Applications, and Open Challenges",IEEE Access,2022,article,hci,1,791.0,1282.0,192.52994302595485,1824,197.5614,True,True,baseline,192.52994302595485,landmark,True | 114 | +4404301029,10.32604/cmc.2024.055575,,The Metaverse Review: Exploring the Boundless Ream of Digital Reality,"Computers, materials & continua/Computers, materials & continua (Print)",2024,dissertation,hci,2,11.0,15.0,189.9193548387097,15,,True,True,post,themetaversereviewexploringtheboundlessreamofdigitalreality,189.9193548387097,landmark,True | ||
| 115 | −4404301029,10.32604/cmc.2024.055575,,The Metaverse Review: Exploring the Boundless Ream of Digital Reality,"Computers, materials & continua/Computers, materials & continua (Print)",2024,dissertation,hci,2,11.0,15.0,189.9193548387097,15,,True,True,post,189.9193548387097,landmark,True | 115 | +4402988539,10.3390/info15100596,2309.10892,Artificial Intelligence-Enabled Intelligent Assistant for Personalized and Adaptive Learning in Higher Education,Information,2024,article,hci,3,379.0,597.0,179.74180185270544,597,226.9308,True,True,post,artificialintelligenceenabledintelligentassistantforpersonalizedandadaptivelearninginhighereducation,179.74180185270544,landmark,True | ||
| 116 | −4402988539,10.3390/info15100596,2309.10892,Artificial Intelligence-Enabled Intelligent Assistant for Personalized and Adaptive Learning in Higher Education,Information,2024,article,hci,3,379.0,597.0,179.74180185270544,597,226.9308,True,True,post,179.74180185270544,landmark,True | 116 | +4404826297,10.1080/10447318.2024.2431761,2303.13534,Prompting AI Art: An Investigation into the Creative Skill of Prompt Engineering,International Journal of Human-Computer Interaction,2024,article,hci,4,134.0,237.0,169.09230306674684,237,201.8338,True,True,post,promptingaiartaninvestigationintothecreativeskillofpromptengineering,169.09230306674684,landmark,True | ||
| 117 | −4404826297,10.1080/10447318.2024.2431761,2303.13534,Prompting AI Art: An Investigation into the Creative Skill of Prompt Engineering,International Journal of Human-Computer Interaction,2024,article,hci,4,134.0,237.0,169.09230306674684,237,201.8338,True,True,post,169.09230306674684,landmark,True | 117 | +4402128637,10.1080/0144929x.2024.2394886,,The promise and challenges of generative AI in education,Behaviour and Information Technology,2024,article,hci,3,193.0,515.0,155.05364816439413,515,197.0815,True,True,post,thepromiseandchallengesofgenerativeaiineducation,155.05364816439413,landmark,True | ||
| 118 | −4402128637,10.1080/0144929x.2024.2394886,,The promise and challenges of generative AI in education,Behaviour and Information Technology,2024,article,hci,3,193.0,515.0,155.05364816439413,515,197.0815,True,True,post,155.05364816439413,landmark,True | 118 | +4366548330,10.1145/3544548.3581388,,Why Johnny Can’t Prompt: How Non-AI Experts Try (and Fail) to Design LLM Prompts,CHI Conference on Human Factors in Computing Systems,2023,conference-paper,hci,4,330.0,657.0,151.5162423382454,902,170.5083,True,True,post,whyjohnnycantprompthownonaiexpertstryandfailtodesignllmprompts,151.5162423382454,landmark,True | ||
| 119 | −4366548330,10.1145/3544548.3581388,,Why Johnny Can’t Prompt: How Non-AI Experts Try (and Fail) to Design LLM Prompts,CHI Conference on Human Factors in Computing Systems,2023,conference-paper,hci,4,330.0,657.0,151.5162423382454,902,170.5083,True,True,post,151.5162423382454,landmark,True | 119 | +4403637324,10.1038/s41562-024-02004-5,2408.12143,Promises and challenges of generative artificial intelligence for human learning,Nature Human Behaviour,2024,article,hci,2,213.0,483.0,145.41924672505314,483,184.453,False,True,post,promisesandchallengesofgenerativeartificialintelligenceforhumanlearning,145.41924672505314,landmark,True | ||
| 120 | −4403637324,10.1038/s41562-024-02004-5,2408.12143,Promises and challenges of generative artificial intelligence for human learning,Nature Human Behaviour,2024,article,hci,2,213.0,483.0,145.41924672505314,483,184.453,False,True,post,145.41924672505314,landmark,True | 120 | +4392772072,10.30574/gscarr.2024.18.2.0062,,AI in education: A review of personalized learning and educational technology,GSC Advanced Research and Reviews,2024,article,hci,4,285.0,425.0,127.9568941162476,425,162.6401,True,True,post,aiineducationareviewofpersonalizedlearningandeducationaltechnology,127.9568941162476,landmark,True | ||
| 121 | −4408943584,10.3389/feduc.2025.1562391,,"Digital learning in the 21st century: trends, challenges, and innovations in technology integration",Frontiers in Education,2025,article,hci,2,274.0,274.0,237.88706394470083,274,299.3436,True,True,post,138.71492623579633,landmark,True | 121 | +4392239564,10.1080/03075079.2024.2323593,,Human-AI collaboration patterns in AI-assisted academic writing,Studies in Higher Education,2024,article,hci,3,198.0,423.0,127.35474402628878,423,161.8747,True,True,post,humanaicollaborationpatternsinaiassistedacademicwriting,127.35474402628878,landmark,True | ||
| 122 | −4392772072,10.30574/gscarr.2024.18.2.0062,,AI in education: A review of personalized learning and educational technology,GSC Advanced Research and Reviews,2024,article,hci,4,285.0,425.0,127.9568941162476,425,162.6401,True,True,post,127.9568941162476,landmark,True | 122 | +3102008235,10.17863/cam.56608,,"Addressing Injustices through MOOCs: A study among peri-urban, marginalised, South African youth",Apollo (University of Cambridge),2020,dissertation,hci,2,0.0,22.0,125.7948717948718,29,,True,True,baseline,addressinginjusticesthroughmoocsastudyamongperiurbanmarginalisedsouthafricanyouth,125.7948717948718,landmark,True | ||
| 123 | −4392239564,10.1080/03075079.2024.2323593,,Human-AI collaboration patterns in AI-assisted academic writing,Studies in Higher Education,2024,article,hci,3,198.0,423.0,127.35474402628878,423,161.8747,True,True,post,127.35474402628878,landmark,True | 123 | +4405586205,10.1016/j.caeai.2024.100348,2405.11800,Generative AI in higher education: A global perspective of institutional adoption policies and guidelines,Computers and Education Artificial Intelligence,2024,article,hci,3,149.0,415.0,124.94614366645354,415,158.8133,True,True,post,generativeaiinhighereducationaglobalperspectiveofinstitutionaladoptionpoliciesandguidelines,124.94614366645354,landmark,True | ||
| 124 | −3102008235,10.17863/cam.56608,,"Addressing Injustices through MOOCs: A study among peri-urban, marginalised, South African youth",Apollo (University of Cambridge),2020,dissertation,hci,2,0.0,22.0,125.7948717948718,29,,True,True,baseline,125.7948717948718,landmark,True | 124 | +3207138404,10.1145/3474085.3479238,2108.08985,Metaverse for Social Good,ACM International Conference on Multimedia (ACM MM),2021,conference-paper,hci,4,174.0,468.0,123.76423282498897,832,125.6356,True,True,baseline,metaverseforsocialgood,123.76423282498897,landmark,True | ||
| 125 | −4405586205,10.1016/j.caeai.2024.100348,2405.11800,Generative AI in higher education: A global perspective of institutional adoption policies and guidelines,Computers and Education Artificial Intelligence,2024,article,hci,3,149.0,415.0,124.94614366645354,415,158.8133,True,True,post,124.94614366645354,landmark,True | 125 | +4408943584,10.3389/feduc.2025.1562391,,"Digital learning in the 21st century: trends, challenges, and innovations in technology integration",Frontiers in Education,2025,article,hci,2,274.0,274.0,237.88706394470083,274,299.3436,True,True,post,digitallearninginthe21stcenturytrendschallengesandinnovationsintechnologyintegration,119.73020953850207,landmark,True | ||
| 126 | −3207138404,10.1145/3474085.3479238,2108.08985,Metaverse for Social Good,ACM International Conference on Multimedia (ACM MM),2021,conference-paper,hci,4,174.0,468.0,123.76423282498897,832,125.6356,True,True,baseline,123.76423282498897,landmark,True | 126 | +4377235537,10.1109/jiot.2023.3278329,,"A Survey on the Metaverse: The State-of-the-Art, Technologies, Applications, and Challenges",IEEE Internet of Things Journal,2023,article,hci,1,393.0,633.0,119.44364807995791,716,119.1015,True,False,post,asurveyonthemetaversethestateofthearttechnologiesapplicationsandchallenges,119.44364807995791,landmark,True | ||
| 127 | −4221151978,10.1145/3528223.3530127,2201.05989,Instant neural graphics primitives with a multiresolution hash encoding,ACM Transactions on Graphics,2022,article,computer_graphics,6,704.0,2033.0,763.1175545066307,4114,1035.1766,True,True,baseline,763.1175545066307,landmark,True | 127 | +4221151978,10.1145/3528223.3530127,2201.05989,Instant neural graphics primitives with a multiresolution hash encoding,ACM Transactions on Graphics,2022,article,computer_graphics,6,704.0,2033.0,763.1175545066307,4114,1035.1766,True,True,baseline,instantneuralgraphicsprimitiveswithamultiresolutionhashencoding,763.1175545066307,landmark,True | ||
| 128 | −1483393136,10.82444/warw.33661294,,Advanced high dynamic range imaging : theory and practice,CERN Document Server (European Organization for Nuclear Research),2026,article,computer_graphics,2,214.0,214.0,573.5984721161192,216,3.1163,True,True,post,760.8172039753458,landmark,True | 128 | +1483393136,10.82444/warw.33661294,,Advanced high dynamic range imaging : theory and practice,CERN Document Server (European Organization for Nuclear Research),2026,article,computer_graphics,2,214.0,214.0,573.5984721161192,216,3.1163,True,True,post,advancedhighdynamicrangeimagingtheoryandpractice,542.5906682088513,landmark,True | ||
| 129 | −2910683382,,,Real-Time Simulation and Rendering of 3D Fluids,,2018,dissertation,computer_graphics,2,26.0,26.0,526.90625,62,,False,False,baseline,526.90625,landmark,True | 129 | +2910683382,,,Real-Time Simulation and Rendering of 3D Fluids,,2018,dissertation,computer_graphics,2,26.0,26.0,526.90625,62,,False,False,baseline,realtimesimulationandrenderingof3dfluids,526.90625,landmark,True | ||
| 130 | −4385318467,10.1145/3592433,2308.04079,3D Gaussian Splatting for Real-Time Radiance Field Rendering,ACM Transactions on Graphics,2023,article,computer_graphics,2,1016.0,3644.0,395.070873513716,5862,825.8872,True,True,post,395.070873513716,landmark,True | 130 | +4385318467,10.1145/3592433,2308.04079,3D Gaussian Splatting for Real-Time Radiance Field Rendering,ACM Transactions on Graphics,2023,article,computer_graphics,2,1016.0,3644.0,395.070873513716,5862,825.8872,True,True,post,3dgaussiansplattingforrealtimeradiancefieldrendering,395.070873513716,landmark,True | ||
| 131 | −3128261063,10.21105/joss.03021,,seaborn: statistical data visualization,The Journal of Open Source Software,2021,article,computer_graphics,3,1232.0,2401.0,279.8183504232003,7190,347.307,True,True,baseline,279.8183504232003,landmark,True | 131 | +3128261063,10.21105/joss.03021,,seaborn: statistical data visualization,The Journal of Open Source Software,2021,article,computer_graphics,3,1232.0,2401.0,279.8183504232003,7190,347.307,True,True,baseline,seabornstatisticaldatavisualization,279.8183504232003,landmark,True | ||
| 132 | −4390723081,10.1145/3807511,2401.03890,A Survey on 3D Gaussian Splatting,ACM Computing Surveys,2026,article,computer_graphics,3,67.0,67.0,121.09388038942977,67,72.919,True,True,post,238.19977881471107,landmark,True | 132 | +1506965148,10.2312/14803,,Mastering the Information Age Solving Problems with Visual Analytics,University of Groningen research database (University of Groningen / Centre for Information Technology),2022,book-chapter,computer_graphics,2,513.0,517.0,220.7091108671789,552,15.8992,True,True,post,masteringtheinformationagesolvingproblemswithvisualanalytics,220.7091108671789,landmark,True | ||
| 133 | −1506965148,10.2312/14803,,Mastering the Information Age Solving Problems with Visual Analytics,University of Groningen research database (University of Groningen / Centre for Information Technology),2022,book-chapter,computer_graphics,2,513.0,517.0,220.7091108671789,552,15.8992,True,True,post,220.7091108671789,landmark,True | 133 | +4231645407,10.2307/j.ctv65sx8p.8,,The Fastest Texture Mapping in Town:,University of Michigan Press eBooks,2018,book-chapter,computer_graphics,2,62.0,66.0,186.86419753086417,107,78.4444,False,False,baseline,thefastesttexturemappingintown,186.86419753086417,landmark,True | ||
| 134 | −4231645407,10.2307/j.ctv65sx8p.8,,The Fastest Texture Mapping in Town:,University of Michigan Press eBooks,2018,book-chapter,computer_graphics,2,62.0,66.0,186.86419753086417,107,78.4444,False,False,baseline,186.86419753086417,landmark,True | 134 | +4390723081,10.1145/3807511,2401.03890,A Survey on 3D Gaussian Splatting,ACM Computing Surveys,2026,article,computer_graphics,3,67.0,67.0,121.09388038942977,67,72.919,True,True,post,asurveyon3dgaussiansplatting,169.8765176167899,landmark,True | ||
| 135 | −4252097634,10.1007/978-3-030-63416-2_778,,Statistical Shape Analysis,Springer eBooks,2021,book-chapter,computer_graphics,2,221.0,229.0,149.26305916305915,416,20.1122,False,False,baseline,149.26305916305915,landmark,True | 135 | +3016007010,10.1111/cgf.14022,2004.03805,State of the Art on Neural Rendering,Computer Graphics Forum,2020,article,computer_graphics,3,129.0,213.0,133.21172638436482,430,143.0402,True,True,baseline,stateoftheartonneuralrendering,133.21172638436482,landmark,True | ||
| 136 | −3016007010,10.1111/cgf.14022,2004.03805,State of the Art on Neural Rendering,Computer Graphics Forum,2020,article,computer_graphics,3,129.0,213.0,133.21172638436482,430,143.0402,True,True,baseline,133.21172638436482,landmark,True | 136 | +3163641770,10.2172/1782521,,Metric Type in the Target-matrix Mesh Optimization Paradigm,,2020,report,computer_graphics,3,2.0,6.0,112.49999999999999,9,,True,True,baseline,metrictypeinthetargetmatrixmeshoptimizationparadigm,112.49999999999999,landmark,True | ||
| 137 | −232012359,10.1109/mm.2020.2996321,,IEEE Computer Graphics and Applications,IEEE Micro,2020,article,computer_graphics,2,181.0,195.0,121.95439739413682,397,51.1209,False,True,baseline,121.95439739413682,landmark,True | 137 | +4385289063,10.1145/3592426,2302.12249,MERF: Memory-Efficient Radiance Fields for Real-time View Synthesis in Unbounded Scenes,ACM Transactions on Graphics,2023,article,computer_graphics,2,114.0,172.0,102.18535708938464,199,115.9383,True,True,post,merfmemoryefficientradiancefieldsforrealtimeviewsynthesisinunboundedscenes,102.18535708938464,landmark,True | ||
| 138 | −4200150166,10.1145/3503250,,NeRF,Communications of the ACM,2021,article,computer_graphics,2,145.0,900.0,113.85132582911535,6744,366.1947,True,True,baseline,113.85132582911535,landmark,True | 138 | +7151814497,10.70675/339cd785z4790z4c97zb09dze298711dbccf,,Designing tools for 3D content authoring based on 3D sketching,,2023,dissertation,computer_graphics,2,0.0,2.0,98.75,2,,True,True,post,designingtoolsfor3dcontentauthoringbasedon3dsketching,98.75,landmark,True | ||
| 139 | −3163641770,10.2172/1782521,,Metric Type in the Target-matrix Mesh Optimization Paradigm,,2020,report,computer_graphics,3,2.0,6.0,112.49999999999999,9,,True,True,baseline,112.49999999999999,landmark,True | 139 | +4385482704,10.1145/3596711.3596766,,Photo tourism: exploring photo collections in 3D,ACM eBooks,2023,book-chapter,computer_graphics,2,184.0,195.0,93.00658376005852,222,25.2247,True,False,post,phototourismexploringphotocollectionsin3d,93.00658376005852,landmark,True | ||
| 140 | −4385289063,10.1145/3592426,2302.12249,MERF: Memory-Efficient Radiance Fields for Real-time View Synthesis in Unbounded Scenes,ACM Transactions on Graphics,2023,article,computer_graphics,2,114.0,172.0,102.18535708938464,199,115.9383,True,True,post,102.18535708938464,landmark,True | 140 | +2478400128,10.26190/unsworks/9223,,Raster scan computer graphics and incremental computing systems,"UNSWorks (University of New South Wales, Sydney, Australia)",2022,dissertation,computer_graphics,3,1.0,1.0,89.2,3,,False,True,baseline,rasterscancomputergraphicsandincrementalcomputingsystems,89.2,landmark,True | ||
| 141 | −7151814497,10.70675/339cd785z4790z4c97zb09dze298711dbccf,,Designing tools for 3D content authoring based on 3D sketching,,2023,dissertation,computer_graphics,2,0.0,2.0,98.75,2,,True,True,post,98.75,landmark,True | 141 | +3113347918,10.1109/iccv48922.2021.01245,2012.03918,NeRD: Neural Reflectance Decomposition from Image Collections,IEEE/CVF International Conference on Computer Vision (ICCV),2021,conference-paper,computer_graphics,2,90.0,203.0,84.667495854063,438,99.214,True,True,baseline,nerdneuralreflectancedecompositionfromimagecollections,84.667495854063,landmark,True | ||
| 142 | −4385482704,10.1145/3596711.3596766,,Photo tourism: exploring photo collections in 3D,ACM eBooks,2023,book-chapter,computer_graphics,2,184.0,195.0,93.00658376005852,222,25.2247,True,False,post,93.00658376005852,landmark,True | 142 | +2978950353,10.33153/citrawira.v1i1.3299,,PERANCANGAN POP UP BOOK AND SOUND TEMBANG DOLANAN SEBAGAI MEDIA PENGENALAN ALAT MUSIK GAMELAN,Institutional Repository ISI Surakarta (Institut Seni Indonesia Surakarta),2020,dissertation,computer_graphics,1,1.0,3.0,81.7,4,,True,False,baseline,perancanganpopupbookandsoundtembangdolanansebagaimediapengenalanalatmusikgamelan,81.7,landmark,True | ||
| 143 | −2478400128,10.26190/unsworks/9223,,Raster scan computer graphics and incremental computing systems,"UNSWorks (University of New South Wales, Sydney, Australia)",2022,dissertation,computer_graphics,3,1.0,1.0,89.2,3,,False,True,baseline,89.2,landmark,True | 143 | +4402660132,10.1109/cvpr52733.2024.00813,2312.16812,Spacetime Gaussian Feature Splatting for Real-Time Dynamic View Synthesis,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2024,conference-paper,computer_graphics,2,110.0,208.0,77.27933949282485,208,83.0854,True,True,post,spacetimegaussianfeaturesplattingforrealtimedynamicviewsynthesis,77.27933949282485,landmark,True | ||
| 144 | −7124433690,10.1145/3789201,2406.01467,RaDe-GS: Rasterizing Depth in Gaussian Splatting,ACM Transactions on Graphics,2026,article,computer_graphics,2,25.0,25.0,45.18428372739917,25,36.4595,True,True,post,88.88051448310114,landmark,True | 144 | +2902812770,10.1145/3272127.3275109,,Differentiable Monte Carlo ray tracing through edge sampling,ACM Transactions on Graphics,2018,article,computer_graphics,5,38.0,105.0,75.6115107913669,428,97.9479,True,True,baseline,differentiablemontecarloraytracingthroughedgesampling,75.6115107913669,landmark,True | ||
| 145 | −3144501610,,,Differentiable visual computing,DSpace@MIT (Massachusetts Institute of Technology),2019,dissertation,computer_graphics,2,2.0,4.0,88.8135593220339,3,,True,True,baseline,88.8135593220339,landmark,True | 145 | +4396833408,10.1007/s10660-024-09855-0,,Integration of artificial intelligence technology and visual communication design in metaverse e-commerce and its potential opportunities,Electronic Commerce Research,2024,book-chapter,computer_graphics,2,10.0,17.0,73.82191780821917,17,84.1119,False,False,post,integrationofartificialintelligencetechnologyandvisualcommunicationdesigninmetaverseecommerceanditspotentialopportunities,73.82191780821917,landmark,True | ||
| 146 | −3113347918,10.1109/iccv48922.2021.01245,2012.03918,NeRD: Neural Reflectance Decomposition from Image Collections,IEEE/CVF International Conference on Computer Vision (ICCV),2021,conference-paper,computer_graphics,2,90.0,203.0,84.667495854063,438,99.214,True,True,baseline,84.667495854063,landmark,True | 146 | +2942551262,10.1145/3306346.3323008,1905.00824,Single image portrait relighting,ACM Transactions on Graphics,2019,article,computer_graphics,2,41.0,103.0,72.34294926183607,259,80.372,True,True,baseline,singleimageportraitrelighting,72.34294926183607,landmark,True | ||
| 147 | −2986023562,10.1145/3355089.3356498,,Mitsuba 2,ACM Transactions on Graphics,2019,article,computer_graphics,7,41.0,120.0,84.28304768369252,404,109.5482,True,True,baseline,84.28304768369252,landmark,True | 147 | +3135538239,10.1007/978-3-030-92540-6_7,2103.04183,HexDom: Polycube-Based Hexahedral-Dominant Mesh Generation,SEMA SIMAI Springer series,2022,book-chapter,computer_graphics,3,17.0,21.0,69.5427135678392,25,60.724,False,True,baseline,hexdompolycubebasedhexahedraldominantmeshgeneration,69.5427135678392,landmark,True | ||
| 148 | −2978950353,10.33153/citrawira.v1i1.3299,,PERANCANGAN POP UP BOOK AND SOUND TEMBANG DOLANAN SEBAGAI MEDIA PENGENALAN ALAT MUSIK GAMELAN,Institutional Repository ISI Surakarta (Institut Seni Indonesia Surakarta),2020,dissertation,computer_graphics,1,1.0,3.0,81.7,4,,True,False,baseline,81.7,landmark,True | 148 | +2972175553,10.1029/2019gc008515,,The Generic Mapping Tools Version 6,Geochemistry Geophysics Geosystems,2019,article,computer_graphics,3,99.0,447.0,67.9687872664635,3192,104.5271,True,True,baseline,thegenericmappingtoolsversion6,67.9687872664635,landmark,True | ||
| 149 | −3115857147,10.2312/pg.20201223,,Illumination Space: A Feature Space for Radiance Maps,ResearchArchive–Te Puna Rangahau (Victoria University of Wellington),2020,dissertation,computer_graphics,1,1.0,3.0,81.7,3,,True,True,baseline,81.7,landmark,True | 149 | +2202024431,10.1201/9781003059325-5,,Signed Distance Fields for Polygon Soup Meshes,A K Peters/CRC Press eBooks,2020,book-chapter,computer_graphics,3,34.0,35.0,67.15547703180212,39,32.903,True,False,baseline,signeddistancefieldsforpolygonsoupmeshes,67.15547703180212,landmark,True | ||
| 150 | −4402660132,10.1109/cvpr52733.2024.00813,2312.16812,Spacetime Gaussian Feature Splatting for Real-Time Dynamic View Synthesis,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2024,conference-paper,computer_graphics,2,110.0,208.0,77.27933949282485,208,83.0854,True,True,post,77.27933949282485,landmark,True | 150 | +2521773018,10.17615/3myy-vc96,,Efficient computation of discrete Voronoi diagram and homotopy-preserving simplified medial axis of a 3d polyhedron,Carolina Digital Repository (University of North Carolina at Chapel Hill),2019,dissertation,computer_graphics,4,3.0,3.0,66.61016949152543,3,,True,True,baseline,efficientcomputationofdiscretevoronoidiagramandhomotopypreservingsimplifiedmedialaxisofa3dpolyhedron,66.61016949152543,landmark,True | ||
| 151 | −2885324189,10.1145/3341156,,Neural Importance Sampling,ACM Transactions on Graphics,2019,article,computer_graphics,3,52.0,110.0,77.25946037671814,321,80.9225,True,True,baseline,77.25946037671814,landmark,True | 151 | +3045012476,10.70675/aa144e03zf76fz490bzab50ze72464fe07f4,,Kinetic data structures for the geometric modeling of urban environments,,2019,dissertation,computer_graphics,3,2.0,3.0,66.61016949152543,3,,True,True,baseline,kineticdatastructuresforthegeometricmodelingofurbanenvironments,66.61016949152543,landmark,True | ||
| 152 | −4200503948,10.7735/ksmte.2021.30.6.513,2004.10934,Comparative Analysis of Defect Detection Using YOLO of Deep Learning,Journal of the korean society of manufacturing technology engineers,2021,article,computer_vision,3,4221.0,6845.0,406.01302821116474,8,0.9035,True,True,baseline,406.01302821116474,landmark,True | 152 | +2796347433,10.48550/arxiv.1804.02767,1804.02767,YOLOv3: An Incremental Improvement,arXiv (Cornell University),2018,preprint,computer_vision,5,1204.0,3187.0,289.4544999852894,5512,,True,True,baseline,yolov3anincrementalimprovement,289.4544999852894,landmark,True | ||
| 153 | −1797268635,10.57702/i9oeewf6,,Caltech-UCSD Birds-200-2011 Dataset,CaltechAUTHORS (California Institute of Technology),2024,article,computer_vision,2,3520.0,3523.0,417.3662846615462,3525,69.4971,True,True,post,417.3662846615462,landmark,True | 153 | +4320002812,10.1109/jproc.2023.3238524,1905.05055,Object Detection in 20 Years: A Survey,Proceedings of the IEEE,2023,article,computer_vision,2,2067.0,3080.0,320.84963557411936,3650,278.5821,True,True,post,objectdetectionin20yearsasurvey,320.84963557411936,landmark,True | ||
| 154 | −2963163009,10.1109/cvpr.2018.00474,1801.04381,MobileNetV2: Inverted Residuals and Linear Bottlenecks,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2018,conference-paper,computer_vision,3,1242.0,3514.0,430.50535987748856,27247,513.8505,True,True,baseline,430.50535987748856,landmark,True | 154 | +4391109864,10.1038/s41467-024-44824-z,,Segment anything in medical images,Nature Communications,2024,article,computer_vision,3,1944.0,3007.0,356.2362810040504,2941,409.3548,True,True,post,segmentanythinginmedicalimages,356.2362810040504,landmark,True | ||
| 155 | −2796347433,10.48550/arxiv.1804.02767,1804.02767,YOLOv3: An Incremental Improvement,arXiv (Cornell University),2018,preprint,computer_vision,5,1204.0,3187.0,289.4544999852894,5512,,True,True,baseline,289.4544999852894,landmark,True | 155 | +3030520226,10.1007/978-3-030-58452-8_13,2005.12872,End-to-End Object Detection with Transformers,Lecture notes in computer science,2020,conference-paper,computer_vision,3,864.0,2877.0,348.31327045713607,16417,486.7957,False,True,baseline,endtoendobjectdetectionwithtransformers,348.31327045713607,landmark,True | ||
| 156 | −2752782242,10.1109/cvpr.2018.00745,,Squeeze-and-Excitation Networks,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2018,conference-paper,computer_vision,4,1289.0,3107.0,380.64318529862175,30519,447.0037,True,False,baseline,380.64318529862175,landmark,True | 156 | +2904367110,10.1109/cvpr.2019.00453,1812.04948,A Style-Based Generator Architecture for Generative Adversarial Networks,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2019,conference-paper,computer_vision,4,1224.0,2727.0,332.8687255628226,11051,354.5442,True,True,baseline,astylebasedgeneratorarchitectureforgenerativeadversarialnetworks,332.8687255628226,landmark,True | ||
| 157 | −4320002812,10.1109/jproc.2023.3238524,1905.05055,Object Detection in 20 Years: A Survey,Proceedings of the IEEE,2023,article,computer_vision,2,2067.0,3080.0,320.84963557411936,3650,278.5821,True,True,post,320.84963557411936,landmark,True | 157 | +2964309882,10.1007/978-3-030-01234-2_49,1802.02611,Encoder-Decoder with Atrous Separable Convolution for Semantic Image Segmentation,Lecture notes in computer science,2018,conference-paper,computer_vision,3,954.0,2432.0,297.947932618683,18734,350.6183,False,True,baseline,encoderdecoderwithatrousseparableconvolutionforsemanticimagesegmentation,297.947932618683,landmark,True | ||
| 158 | −4391109864,10.1038/s41467-024-44824-z,,Segment anything in medical images,Nature Communications,2024,article,computer_vision,3,1944.0,3007.0,356.2362810040504,2941,409.3548,True,True,post,356.2362810040504,landmark,True | 158 | +3034971973,10.1109/cvpr42600.2020.01079,1911.09070,EfficientDet: Scalable and Efficient Object Detection,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2020,conference-paper,computer_vision,4,1099.0,2290.0,277.2462250075918,9258,321.5836,True,True,baseline,efficientdetscalableandefficientobjectdetection,277.2462250075918,landmark,True | ||
| 159 | −3030520226,10.1007/978-3-030-58452-8_13,2005.12872,End-to-End Object Detection with Transformers,Lecture notes in computer science,2020,conference-paper,computer_vision,3,864.0,2877.0,348.31327045713607,16417,486.7957,False,True,baseline,348.31327045713607,landmark,True | 159 | +4388823657,10.3390/make5040083,2304.00501,A Comprehensive Review of YOLO Architectures in Computer Vision: From YOLOv1 to YOLOv8 and YOLO-NAS,Machine Learning and Knowledge Extraction,2023,article,computer_vision,4,907.0,2277.0,237.19955201372395,3052,277.6729,True,True,post,acomprehensivereviewofyoloarchitecturesincomputervisionfromyolov1toyolov8andyolonas,237.19955201372395,landmark,True | ||
| 160 | −2904367110,10.1109/cvpr.2019.00453,1812.04948,A Style-Based Generator Architecture for Generative Adversarial Networks,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2019,conference-paper,computer_vision,4,1224.0,2727.0,332.8687255628226,11051,354.5442,True,True,baseline,332.8687255628226,landmark,True | 160 | +2954996726,10.1186/s40537-019-0197-0,,A survey on Image Data Augmentation for Deep Learning,Journal Of Big Data,2019,article,computer_vision,3,636.0,2134.0,323.4516322601615,13005,461.5342,True,True,baseline,asurveyonimagedataaugmentationfordeeplearning,323.4516322601615,landmark,True | ||
| 161 | −2964309882,10.1007/978-3-030-01234-2_49,1802.02611,Encoder-Decoder with Atrous Separable Convolution for Semantic Image Segmentation,Lecture notes in computer science,2018,conference-paper,computer_vision,3,954.0,2432.0,297.947932618683,18734,350.6183,False,True,baseline,297.947932618683,landmark,True | 161 | +3187418919,10.1109/tpami.2022.3152247,2012.12556,A Survey on Vision Transformer,IEEE Transactions on Pattern Analysis and Machine Intelligence,2022,article,computer_vision,6,982.0,2110.0,226.46590993554688,4585,293.5626,True,True,baseline,asurveyonvisiontransformer,226.46590993554688,landmark,True | ||
| 162 | −3034971973,10.1109/cvpr42600.2020.01079,1911.09070,EfficientDet: Scalable and Efficient Object Detection,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2020,conference-paper,computer_vision,4,1099.0,2290.0,277.2462250075918,9258,321.5836,True,True,baseline,277.2462250075918,landmark,True | 162 | +2995327724,10.1109/cvpr42600.2020.00813,1912.04958,Analyzing and Improving the Image Quality of StyleGAN,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2020,conference-paper,computer_vision,5,1027.0,1989.0,240.80469062886468,6002,265.6208,True,True,baseline,analyzingandimprovingtheimagequalityofstylegan,240.80469062886468,landmark,True | ||
| 163 | −4388823657,10.3390/make5040083,2304.00501,A Comprehensive Review of YOLO Architectures in Computer Vision: From YOLOv1 to YOLOv8 and YOLO-NAS,Machine Learning and Knowledge Extraction,2023,article,computer_vision,4,907.0,2277.0,237.19955201372395,3052,277.6729,True,True,post,237.19955201372395,landmark,True | 163 | +2784874046,10.1109/cvpr.2019.00482,1801.07698,ArcFace: Additive Angular Margin Loss for Deep Face Recognition,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2019,conference-paper,computer_vision,3,955.0,1970.0,240.46622272048424,7537,250.3062,True,True,baseline,arcfaceadditiveangularmarginlossfordeepfacerecognition,240.46622272048424,landmark,True | ||
| 164 | −2954996726,10.1186/s40537-019-0197-0,,A survey on Image Data Augmentation for Deep Learning,Journal Of Big Data,2019,article,computer_vision,3,636.0,2134.0,323.4516322601615,13005,461.5342,True,True,baseline,323.4516322601615,landmark,True | 164 | +3177052299,10.1109/cvpr46437.2021.01350,2103.02907,Coordinate Attention for Efficient Mobile Network Design,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2021,conference-paper,computer_vision,5,672.0,1959.0,244.60506070745512,6447,314.9922,True,True,baseline,coordinateattentionforefficientmobilenetworkdesign,244.60506070745512,landmark,True | ||
| 165 | −3187418919,10.1109/tpami.2022.3152247,2012.12556,A Survey on Vision Transformer,IEEE Transactions on Pattern Analysis and Machine Intelligence,2022,article,computer_vision,6,982.0,2110.0,226.46590993554688,4585,293.5626,True,True,baseline,226.46590993554688,landmark,True | 165 | +4386072096,10.1109/cvpr52729.2023.02155,,DreamBooth: Fine Tuning Text-to-Image Diffusion Models for Subject-Driven Generation,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2023,conference-paper,computer_vision,6,1113.0,1918.0,267.65970062911276,2234,253.5618,True,False,baseline,dreamboothfinetuningtexttoimagediffusionmodelsforsubjectdrivengeneration,267.65970062911276,landmark,True | ||
| 166 | −2995327724,10.1109/cvpr42600.2020.00813,1912.04958,Analyzing and Improving the Image Quality of StyleGAN,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2020,conference-paper,computer_vision,5,1027.0,1989.0,240.80469062886468,6002,265.6208,True,True,baseline,240.80469062886468,landmark,True | 166 | +3119997354,10.1145/3505244,2101.01169,Transformers in Vision: A Survey,ACM Computing Surveys,2022,article,computer_vision,9,1080.0,1899.0,203.8193189419922,3536,224.1986,True,True,baseline,transformersinvisionasurvey,203.8193189419922,landmark,True | ||
| 167 | −2784874046,10.1109/cvpr.2019.00482,1801.07698,ArcFace: Additive Angular Margin Loss for Deep Face Recognition,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2019,conference-paper,computer_vision,3,955.0,1970.0,240.46622272048424,7537,250.3062,True,True,baseline,240.46622272048424,landmark,True | 167 | +4386047745,10.1109/cvpr52729.2023.01157,2303.03667,"Run, Don't Walk: Chasing Higher FLOPS for Faster Neural Networks",IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2023,conference-paper,computer_vision,7,879.0,1888.0,263.4731568236522,2343,266.4104,True,True,post,rundontwalkchasinghigherflopsforfasterneuralnetworks,263.4731568236522,landmark,True | ||
| 168 | −3177052299,10.1109/cvpr46437.2021.01350,2103.02907,Coordinate Attention for Efficient Mobile Network Design,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2021,conference-paper,computer_vision,5,672.0,1959.0,244.60506070745512,6447,314.9922,True,True,baseline,244.60506070745512,landmark,True | 168 | +3171007011,10.1109/cvpr46437.2021.01549,,Exploring Simple Siamese Representation Learning,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2021,conference-paper,computer_vision,3,954.0,1869.0,296.32486388384757,3498,304.7959,True,False,baseline,exploringsimplesiameserepresentationlearning,296.32486388384757,landmark,True | ||
| 169 | −4386072096,10.1109/cvpr52729.2023.02155,,DreamBooth: Fine Tuning Text-to-Image Diffusion Models for Subject-Driven Generation,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2023,conference-paper,computer_vision,6,1113.0,1918.0,267.65970062911276,2234,253.5618,True,False,baseline,267.65970062911276,landmark,True | 169 | +2955058313,10.1109/cvpr.2019.00326,1809.02983,Dual Attention Network for Scene Segmentation,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2019,conference-paper,computer_vision,3,709.0,1862.0,227.28330289621402,6834,261.5228,True,True,baseline,dualattentionnetworkforscenesegmentation,227.28330289621402,landmark,True | ||
| 170 | −3119997354,10.1145/3505244,2101.01169,Transformers in Vision: A Survey,ACM Computing Surveys,2022,article,computer_vision,9,1080.0,1899.0,203.8193189419922,3536,224.1986,True,True,baseline,203.8193189419922,landmark,True | 170 | +2736941579,10.1109/cvpr.2018.00907,1707.07012,Learning Transferable Architectures for Scalable Image Recognition,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2018,conference-paper,computer_vision,4,845.0,1862.0,228.11638591117918,6249,236.7712,True,True,baseline,learningtransferablearchitecturesforscalableimagerecognition,228.11638591117918,landmark,True | ||
| 171 | −4386047745,10.1109/cvpr52729.2023.01157,2303.03667,"Run, Don't Walk: Chasing Higher FLOPS for Faster Neural Networks",IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2023,conference-paper,computer_vision,7,879.0,1888.0,263.4731568236522,2343,266.4104,True,True,post,263.4731568236522,landmark,True | 171 | +3131500599,10.1109/iccv48922.2021.00061,,Pyramid Vision Transformer: A Versatile Backbone for Dense Prediction without Convolutions,IEEE/CVF International Conference on Computer Vision (ICCV),2021,conference-paper,computer_vision,4,730.0,1844.0,230.24590706715023,4926,273.2358,True,False,baseline,pyramidvisiontransformeraversatilebackbonefordensepredictionwithoutconvolutions,230.24590706715023,landmark,True | ||
| 172 | −4224035735,10.48550/arxiv.2204.06125,2204.06125,Hierarchical Text-Conditional Image Generation with CLIP Latents,arXiv (Cornell University),2022,preprint,computer_vision,5,904.0,1882.0,408.5254913442887,2203,,True,True,baseline,408.5254913442887,landmark,True | 172 | +2999607073,10.1109/tpami.2021.3059968,2001.05566,Image Segmentation Using Deep Learning: A Survey,IEEE Transactions on Pattern Analysis and Machine Intelligence,2021,article,computer_vision,5,1058.0,1837.0,219.61025275964155,3634,227.7791,True,True,baseline,imagesegmentationusingdeeplearningasurvey,219.61025275964155,landmark,True | ||
| 173 | −2963091558,10.1109/cvpr.2018.00813,1711.07971,Non-local Neural Networks,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2018,conference-paper,computer_vision,4,654.0,1881.0,230.44410413476265,10954,299.8487,True,True,baseline,230.44410413476265,landmark,True | 173 | +4404612908,10.1007/978-3-031-72970-6_3,,Grounding DINO: Marrying DINO with Grounded Pre-training for Open-Set Object Detection,Lecture notes in computer science,2024,conference-paper,computer_vision,4,1177.0,1834.0,384.91288350030993,1834,395.6291,False,False,post,groundingdinomarryingdinowithgroundedpretrainingforopensetobjectdetection,384.91288350030993,landmark,True | ||
| 174 | −4398756379,10.1109/adics58448.2024.10533619,,YOLOv8: A Novel Object Detection Algorithm with Enhanced Performance and Robustness,,2024,conference-paper,computer_vision,2,1232.0,1876.0,393.72768235909564,1876,409.6027,True,False,post,393.72768235909564,landmark,True | 174 | +2963125010,10.1109/cvpr.2018.00716,,ShuffleNet: An Extremely Efficient Convolutional Neural Network for Mobile Devices,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2018,conference-paper,computer_vision,3,843.0,1788.0,219.05053598774887,9452,225.5404,True,True,baseline,shufflenetanextremelyefficientconvolutionalneuralnetworkformobiledevices,219.05053598774887,landmark,True | ||
| 175 | −3171007011,10.1109/cvpr46437.2021.01549,,Exploring Simple Siamese Representation Learning,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2021,conference-paper,computer_vision,3,954.0,1869.0,296.32486388384757,3498,304.7959,True,False,baseline,296.32486388384757,landmark,True | 175 | +4225672218,10.1109/cvpr52688.2022.00564,2111.09881,Restormer: Efficient Transformer for High-Resolution Image Restoration,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2022,conference-paper,computer_vision,6,674.0,1779.0,240.36855118869533,4143,303.731,True,True,baseline,restormerefficienttransformerforhighresolutionimagerestoration,240.36855118869533,landmark,True | ||
| 176 | −2955058313,10.1109/cvpr.2019.00326,1809.02983,Dual Attention Network for Scene Segmentation,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2019,conference-paper,computer_vision,3,709.0,1862.0,227.28330289621402,6834,261.5228,True,True,baseline,227.28330289621402,landmark,True | 176 | +3170841864,10.1109/cvpr46437.2021.00681,2012.15840,Rethinking Semantic Segmentation from a Sequence-to-Sequence Perspective with Transformers,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2021,conference-paper,computer_vision,4,814.0,1733.0,216.38620224911676,3695,231.1329,True,True,baseline,rethinkingsemanticsegmentationfromasequencetosequenceperspectivewithtransformers,216.38620224911676,landmark,True | ||
| 177 | −2736941579,10.1109/cvpr.2018.00907,1707.07012,Learning Transferable Architectures for Scalable Image Recognition,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2018,conference-paper,computer_vision,4,845.0,1862.0,228.11638591117918,6249,236.7712,True,True,baseline,228.11638591117918,landmark,True | 177 | +3017855299,10.1016/j.compbiomed.2020.103792,,Automated detection of COVID-19 cases using deep neural networks with X-ray images,Computers in Biology and Medicine,2020,article,computer_vision,2,1049.0,1675.0,53.07790388996886,2594,236.7839,False,True,baseline,automateddetectionofcovid19casesusingdeepneuralnetworkswithxrayimages,53.07790388996886,landmark,True | ||
| 178 | −3131500599,10.1109/iccv48922.2021.00061,,Pyramid Vision Transformer: A Versatile Backbone for Dense Prediction without Convolutions,IEEE/CVF International Conference on Computer Vision (ICCV),2021,conference-paper,computer_vision,4,730.0,1844.0,230.24590706715023,4926,273.2358,True,False,baseline,230.24590706715023,landmark,True | 178 | +2979750740,10.1145/3326362,1801.07829,Dynamic Graph CNN for Learning on Point Clouds,ACM Transactions on Graphics,2019,article,computer_vision,4,815.0,1673.0,204.21997406985423,7010,434.8669,True,True,baseline,dynamicgraphcnnforlearningonpointclouds,204.21997406985423,landmark,True | ||
| 179 | −2999607073,10.1109/tpami.2021.3059968,2001.05566,Image Segmentation Using Deep Learning: A Survey,IEEE Transactions on Pattern Analysis and Machine Intelligence,2021,article,computer_vision,5,1058.0,1837.0,219.61025275964155,3634,227.7791,True,True,baseline,219.61025275964155,landmark,True | 179 | +2925148167,10.1109/cvpr42600.2020.01164,1903.11027,nuScenes: A Multimodal Dataset for Autonomous Driving,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2020,conference-paper,computer_vision,6,935.0,1637.0,189.37948256099557,6888,578.0759,True,True,baseline,nuscenesamultimodaldatasetforautonomousdriving,189.37948256099557,landmark,True | ||
| 180 | −4404612908,10.1007/978-3-031-72970-6_3,,Grounding DINO: Marrying DINO with Grounded Pre-training for Open-Set Object Detection,Lecture notes in computer science,2024,conference-paper,computer_vision,4,1177.0,1834.0,384.91288350030993,1834,395.6291,False,False,post,384.91288350030993,landmark,True | 180 | +4402727764,10.1109/cvpr52733.2024.02484,2310.03744,Improved Baselines with Visual Instruction Tuning,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2024,conference-paper,computer_vision,8,1070.0,1637.0,343.5672793293388,1637,356.7648,True,True,post,improvedbaselineswithvisualinstructiontuning,343.5672793293388,landmark,True | ||
| 181 | −2963125010,10.1109/cvpr.2018.00716,,ShuffleNet: An Extremely Efficient Convolutional Neural Network for Mobile Devices,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2018,conference-paper,computer_vision,3,843.0,1788.0,219.05053598774887,9452,225.5404,True,True,baseline,219.05053598774887,landmark,True | 181 | +2998508940,10.1609/aaai.v34i07.7000,,Random Erasing Data Augmentation,Proceedings of the AAAI Conference on Artificial Intelligence,2020,conference-paper,computer_vision,3,1114.0,1602.0,193.95128928478692,3303,157.9126,True,True,baseline,randomerasingdataaugmentation,193.95128928478692,landmark,True | ||
| 182 | −4225672218,10.1109/cvpr52688.2022.00564,2111.09881,Restormer: Efficient Transformer for High-Resolution Image Restoration,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2022,conference-paper,computer_vision,6,674.0,1779.0,240.36855118869533,4143,303.731,True,True,baseline,240.36855118869533,landmark,True | 182 | +2962730651,10.1109/tpami.2019.2929257,1812.08008,OpenPose: Realtime Multi-Person 2D Pose Estimation Using Part Affinity Fields,IEEE Transactions on Pattern Analysis and Machine Intelligence,2019,article,computer_vision,1,634.0,1600.0,242.51293890171436,5491,280.2052,True,True,baseline,openposerealtimemultiperson2dposeestimationusingpartaffinityfields,242.51293890171436,landmark,True | ||
| 183 | −3170841864,10.1109/cvpr46437.2021.00681,2012.15840,Rethinking Semantic Segmentation from a Sequence-to-Sequence Perspective with Transformers,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2021,conference-paper,computer_vision,4,814.0,1733.0,216.38620224911676,3695,231.1329,True,True,baseline,216.38620224911676,landmark,True | 183 | +2884367402,10.1109/tnnls.2018.2876865,1807.05511,Object Detection With Deep Learning: A Review,IEEE Transactions on Neural Networks and Learning Systems,2019,article,computer_vision,2,699.0,1580.0,239.4815271654429,5487,286.797,True,True,baseline,objectdetectionwithdeeplearningareview,239.4815271654429,landmark,True | ||
| 184 | −3017855299,10.1016/j.compbiomed.2020.103792,,Automated detection of COVID-19 cases using deep neural networks with X-ray images,Computers in Biology and Medicine,2020,article,computer_vision,2,1049.0,1675.0,53.07790388996886,2594,236.7839,False,True,baseline,53.07790388996886,landmark,True | 184 | +3013601031,10.1007/s13246-020-00865-4,2003.11617,Covid-19: automatic detection from X-ray images utilizing transfer learning with convolutional neural networks,Physical and Engineering Sciences in Medicine,2020,article,computer_vision,3,1035.0,1579.0,50.03582701030497,2336,215.8286,False,True,baseline,covid19automaticdetectionfromxrayimagesutilizingtransferlearningwithconvolutionalneuralnetworks,50.03582701030497,landmark,True | ||
| 185 | −2979750740,10.1145/3326362,1801.07829,Dynamic Graph CNN for Learning on Point Clouds,ACM Transactions on Graphics,2019,article,computer_vision,4,815.0,1673.0,204.21997406985423,7010,434.8669,True,True,baseline,204.21997406985423,landmark,True | 185 | +2911489562,10.1093/bioinformatics/btz682,1901.08746,BioBERT: a pre-trained biomedical language representation model for biomedical text mining,Bioinformatics,2019,article,nlp,8,666.0,1526.0,84.91295842716947,7155,176.5991,True,True,baseline,biobertapretrainedbiomedicallanguagerepresentationmodelforbiomedicaltextmining,84.91295842716947,landmark,True | ||
| 186 | −2925148167,10.1109/cvpr42600.2020.01164,1903.11027,nuScenes: A Multimodal Dataset for Autonomous Driving,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2020,conference-paper,computer_vision,6,935.0,1637.0,189.37948256099557,6888,578.0759,True,True,baseline,189.37948256099557,landmark,True | 186 | +4212875960,10.1109/wacv51458.2022.00181,2103.10504,UNETR: Transformers for 3D Medical Image Segmentation,IEEE/CVF Winter Conference on Applications of Computer Vision (WACV),2022,conference-paper,computer_vision,4,698.0,1509.0,203.88765809091694,3313,245.4958,True,True,baseline,unetrtransformersfor3dmedicalimagesegmentation,203.88765809091694,landmark,True | ||
| 187 | −4402727764,10.1109/cvpr52733.2024.02484,2310.03744,Improved Baselines with Visual Instruction Tuning,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2024,conference-paper,computer_vision,8,1070.0,1637.0,343.5672793293388,1637,356.7648,True,True,post,343.5672793293388,landmark,True | 187 | +4391876619,10.1162/tacl_a_00638,2307.03172,Lost in the Middle: How Language Models Use Long Contexts,Transactions of the Association for Computational Linguistics,2024,article,nlp,4,688.0,1484.0,184.32460816294056,1484,217.8733,True,True,post,lostinthemiddlehowlanguagemodelsuselongcontexts,184.32460816294056,landmark,True | ||
| 188 | −2998508940,10.1609/aaai.v34i07.7000,,Random Erasing Data Augmentation,Proceedings of the AAAI Conference on Artificial Intelligence,2020,conference-paper,computer_vision,3,1114.0,1602.0,193.95128928478692,3303,157.9126,True,True,baseline,193.95128928478692,landmark,True | 188 | +3184439416,10.48550/arxiv.2107.08430,2107.08430,YOLOX: Exceeding YOLO Series in 2021,arXiv (Cornell University),2021,preprint,computer_vision,6,470.0,1483.0,235.02214532871972,2962,,True,True,baseline,yoloxexceedingyoloseriesin2021,235.02214532871972,landmark,True | ||
| 189 | −2962730651,10.1109/tpami.2019.2929257,1812.08008,OpenPose: Realtime Multi-Person 2D Pose Estimation Using Part Affinity Fields,IEEE Transactions on Pattern Analysis and Machine Intelligence,2019,article,computer_vision,1,634.0,1600.0,242.51293890171436,5491,280.2052,True,True,baseline,242.51293890171436,landmark,True | 189 | +3127751679,10.48550/arxiv.2102.04306,2102.04306,TransUNet: Transformers Make Strong Encoders for Medical Image Segmentation,arXiv (Cornell University),2021,preprint,computer_vision,4,489.0,1465.0,232.16955017301038,3859,,True,True,baseline,transunettransformersmakestrongencodersformedicalimagesegmentation,232.16955017301038,landmark,True | ||
| 190 | −2884367402,10.1109/tnnls.2018.2876865,1807.05511,Object Detection With Deep Learning: A Review,IEEE Transactions on Neural Networks and Learning Systems,2019,article,computer_vision,2,699.0,1580.0,239.4815271654429,5487,286.797,True,True,baseline,239.4815271654429,landmark,True | 190 | +2978017171,10.4230/tgdk.3.3.5,1910.01108,"DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lighter",arXiv (Cornell University),2019,preprint,nlp,5,502.0,1462.0,165.6218897479667,4347,,True,True,baseline,distilbertadistilledversionofbertsmallerfastercheaperandlighter,165.6218897479667,landmark,True | ||
| 191 | −3013601031,10.1007/s13246-020-00865-4,2003.11617,Covid-19: automatic detection from X-ray images utilizing transfer learning with convolutional neural networks,Physical and Engineering Sciences in Medicine,2020,article,computer_vision,3,1035.0,1579.0,50.03582701030497,2336,215.8286,False,True,baseline,50.03582701030497,landmark,True | 191 | +3212386989,10.1007/s41095-022-0271-y,2111.07624,Attention mechanisms in computer vision: A survey,Computational Visual Media,2022,article,computer_vision,4,714.0,1442.0,154.76959342514627,2500,171.4269,True,True,baseline,attentionmechanismsincomputervisionasurvey,154.76959342514627,landmark,True | ||
| 192 | −2911489562,10.1093/bioinformatics/btz682,1901.08746,BioBERT: a pre-trained biomedical language representation model for biomedical text mining,Bioinformatics,2019,article,nlp,8,666.0,1526.0,84.91295842716947,7155,176.5991,True,True,baseline,84.91295842716947,landmark,True | 192 | +3159481202,10.1109/iccv48922.2021.00951,2104.14294,Emerging Properties in Self-Supervised Vision Transformers,IEEE/CVF International Conference on Computer Vision (ICCV),2021,conference-paper,computer_vision,5,497.0,1438.0,227.9909867656355,5690,363.2871,True,True,baseline,emergingpropertiesinselfsupervisedvisiontransformers,227.9909867656355,landmark,True | ||
| 193 | −4212875960,10.1109/wacv51458.2022.00181,2103.10504,UNETR: Transformers for 3D Medical Image Segmentation,IEEE/CVF Winter Conference on Applications of Computer Vision (WACV),2022,conference-paper,computer_vision,4,698.0,1509.0,203.88765809091694,3313,245.4958,True,True,baseline,203.88765809091694,landmark,True | 193 | +2980282514,10.48550/arxiv.1910.03771,1910.03771,HuggingFace's Transformers: State-of-the-art Natural Language Processing,arXiv (Cornell University),2019,preprint,nlp,5,692.0,1434.0,162.44992469123406,2972,,True,True,baseline,huggingfacestransformersstateoftheartnaturallanguageprocessing,162.44992469123406,landmark,True | ||
| 194 | −4391876619,10.1162/tacl_a_00638,2307.03172,Lost in the Middle: How Language Models Use Long Contexts,Transactions of the Association for Computational Linguistics,2024,article,nlp,4,688.0,1484.0,184.32460816294056,1484,217.8733,True,True,post,184.32460816294056,landmark,True | 194 | +4287824654,10.4230/oasics.slate.2022.3,,Question Answering For Toxicological Information Extraction,DROPS (Schloss Dagstuhl – Leibniz Center for Informatics),2022,article,nlp,3,1238.0,1430.0,147.34664543494497,1520,94.4336,True,True,baseline,questionansweringfortoxicologicalinformationextraction,147.34664543494497,landmark,True | ||
| 195 | −3184439416,10.48550/arxiv.2107.08430,2107.08430,YOLOX: Exceeding YOLO Series in 2021,arXiv (Cornell University),2021,preprint,computer_vision,6,470.0,1483.0,235.02214532871972,2962,,True,True,baseline,235.02214532871972,landmark,True | 195 | +4226069476,10.1109/cvpr52688.2022.00135,2112.01527,Masked-attention Mask Transformer for Universal Image Segmentation,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2022,conference-paper,computer_vision,3,497.0,1420.0,191.86247481053815,3362,243.9506,True,True,baseline,maskedattentionmasktransformerforuniversalimagesegmentation,191.86247481053815,landmark,True | ||
| 196 | −3127751679,10.48550/arxiv.2102.04306,2102.04306,TransUNet: Transformers Make Strong Encoders for Medical Image Segmentation,arXiv (Cornell University),2021,preprint,computer_vision,4,489.0,1465.0,232.16955017301038,3859,,True,True,baseline,232.16955017301038,landmark,True | 196 | +4210598935,10.1016/j.procs.2022.01.135,,A Review of Yolo Algorithm Developments,Procedia Computer Science,2022,conference-paper,computer_vision,2,544.0,1406.0,189.9708729462089,2733,219.8066,True,True,baseline,areviewofyoloalgorithmdevelopments,189.9708729462089,landmark,True | ||
| 197 | −2978017171,10.4230/tgdk.3.3.5,1910.01108,"DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lighter",arXiv (Cornell University),2019,preprint,nlp,5,502.0,1462.0,165.6218897479667,4347,,True,True,baseline,165.6218897479667,landmark,True | 197 | +3135367836,10.48550/arxiv.2103.00020,2103.00020,Learning Transferable Visual Models From Natural Language Supervision,arXiv (Cornell University),2021,preprint,computer_vision,6,625.0,1405.0,222.66089965397924,5217,,True,True,baseline,learningtransferablevisualmodelsfromnaturallanguagesupervision,222.66089965397924,landmark,True | ||
| 198 | −3212386989,10.1007/s41095-022-0271-y,2111.07624,Attention mechanisms in computer vision: A survey,Computational Visual Media,2022,article,computer_vision,4,714.0,1442.0,154.76959342514627,2500,171.4269,True,True,baseline,154.76959342514627,landmark,True | 198 | +3042011474,10.1109/cvprw50498.2020.00203,1911.11929,CSPNet: A New Backbone that can Enhance Learning Capability of CNN,IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW),2020,conference-paper,computer_vision,3,534.0,1403.0,169.85871339984772,4922,202.034,True,True,baseline,cspnetanewbackbonethatcanenhancelearningcapabilityofcnn,169.85871339984772,landmark,True | ||
| 199 | −3159481202,10.1109/iccv48922.2021.00951,2104.14294,Emerging Properties in Self-Supervised Vision Transformers,IEEE/CVF International Conference on Computer Vision (ICCV),2021,conference-paper,computer_vision,5,497.0,1438.0,227.9909867656355,5690,363.2871,True,True,baseline,227.9909867656355,landmark,True | 199 | +4360884927,10.1109/tpami.2023.3261988,2209.04747,Diffusion Models in Vision: A Survey,IEEE Transactions on Pattern Analysis and Machine Intelligence,2023,article,computer_vision,5,632.0,1386.0,144.38233600835372,1859,168.9313,True,True,post,diffusionmodelsinvisionasurvey,144.38233600835372,landmark,True | ||
| 200 | −2980282514,10.48550/arxiv.1910.03771,1910.03771,HuggingFace's Transformers: State-of-the-art Natural Language Processing,arXiv (Cornell University),2019,preprint,nlp,5,692.0,1434.0,162.44992469123406,2972,,True,True,baseline,162.44992469123406,landmark,True | 200 | +4400881081,10.1016/j.media.2024.103280,,TransUNet: Rethinking the U-Net architecture design for medical image segmentation through the lens of transformers,Medical Image Analysis,2024,article,computer_vision,3,646.0,1365.0,161.71018409395703,1365,192.8121,True,True,post,transunetrethinkingtheunetarchitecturedesignformedicalimagesegmentationthroughthelensoftransformers,161.71018409395703,landmark,True | ||
| 201 | −4287824654,10.4230/oasics.slate.2022.3,,Question Answering For Toxicological Information Extraction,DROPS (Schloss Dagstuhl – Leibniz Center for Informatics),2022,article,nlp,3,1238.0,1430.0,147.34664543494497,1520,94.4336,True,True,baseline,147.34664543494497,landmark,True | 201 | +3014641072,10.1109/tpami.2020.2983686,,Deep High-Resolution Representation Learning for Visual Recognition,IEEE Transactions on Pattern Analysis and Machine Intelligence,2020,article,computer_vision,4,639.0,1362.0,183.6448855499229,4785,201.7077,True,False,baseline,deephighresolutionrepresentationlearningforvisualrecognition,183.6448855499229,landmark,True | ||
| 202 | −4226069476,10.1109/cvpr52688.2022.00135,2112.01527,Masked-attention Mask Transformer for Universal Image Segmentation,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2022,conference-paper,computer_vision,3,497.0,1420.0,191.86247481053815,3362,243.9506,True,True,baseline,191.86247481053815,landmark,True | 202 | +2982770724,10.1109/iccv.2019.00972,1904.01355,FCOS: Fully Convolutional One-Stage Object Detection,IEEE/CVF International Conference on Computer Vision (ICCV),2019,conference-paper,computer_vision,4,431.0,1335.0,162.95553671667332,6648,207.8857,True,True,baseline,fcosfullyconvolutionalonestageobjectdetection,162.95553671667332,landmark,True | ||
| 203 | −4210598935,10.1016/j.procs.2022.01.135,,A Review of Yolo Algorithm Developments,Procedia Computer Science,2022,conference-paper,computer_vision,2,544.0,1406.0,189.9708729462089,2733,219.8066,True,True,baseline,189.9708729462089,landmark,True | 203 | +2998789541,10.1148/radiol.2020191145,1612.07003,The Image Biomarker Standardization Initiative: Standardized Quantitative Radiomics for High-Throughput Image-based Phenotyping,Radiology,2020,article,computer_vision,2,724.0,1331.0,42.1771284045066,4094,214.4839,True,True,baseline,theimagebiomarkerstandardizationinitiativestandardizedquantitativeradiomicsforhighthroughputimagebasedphenotyping,42.1771284045066,landmark,True | ||
| 204 | −3135367836,10.48550/arxiv.2103.00020,2103.00020,Learning Transferable Visual Models From Natural Language Supervision,arXiv (Cornell University),2021,preprint,computer_vision,6,625.0,1405.0,222.66089965397924,5217,,True,True,baseline,222.66089965397924,landmark,True | 204 | +4390692489,10.1109/tkde.2024.3352100,2306.08302,Unifying Large Language Models and Knowledge Graphs: A Roadmap,IEEE Transactions on Knowledge and Data Engineering,2024,article,nlp,5,799.0,1324.0,164.45133504564237,1324,191.8297,True,True,post,unifyinglargelanguagemodelsandknowledgegraphsaroadmap,164.45133504564237,landmark,True | ||
| 205 | −3042011474,10.1109/cvprw50498.2020.00203,1911.11929,CSPNet: A New Backbone that can Enhance Learning Capability of CNN,IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW),2020,conference-paper,computer_vision,3,534.0,1403.0,169.85871339984772,4922,202.034,True,True,baseline,169.85871339984772,landmark,True | 205 | +2886953980,10.1109/cvpr.2019.00293,1807.11626,MnasNet: Platform-Aware Neural Architecture Search for Mobile,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2019,conference-paper,computer_vision,6,640.0,1322.0,161.368703774863,3231,147.9235,True,True,baseline,mnasnetplatformawareneuralarchitecturesearchformobile,161.368703774863,landmark,True | ||
| 206 | −4360884927,10.1109/tpami.2023.3261988,2209.04747,Diffusion Models in Vision: A Survey,IEEE Transactions on Pattern Analysis and Machine Intelligence,2023,article,computer_vision,5,632.0,1386.0,144.38233600835372,1859,168.9313,True,True,post,144.38233600835372,landmark,True | 206 | +4372347372,10.1109/icassp49357.2023.10096516,2305.13563,Efficient Multi-Scale Attention Module with Cross-Spatial Learning,IEEE International Conference on Acoustics Speech and Signal Processing,2023,conference-paper,computer_vision,3,505.0,1322.0,184.48703036062932,1788,203.3043,True,True,post,efficientmultiscaleattentionmodulewithcrossspatiallearning,184.48703036062932,landmark,True | ||
| 207 | −4400881081,10.1016/j.media.2024.103280,,TransUNet: Rethinking the U-Net architecture design for medical image segmentation through the lens of transformers,Medical Image Analysis,2024,article,computer_vision,3,646.0,1365.0,161.71018409395703,1365,192.8121,True,True,post,161.71018409395703,landmark,True | 207 | +4415796023,10.52202/079017-3273,2401.10166,VMamba: Visual State Space Model,neural information processing systems,2024,conference-paper,computer_vision,6,427.0,1295.0,271.7896314792265,1295,282.7481,True,True,post,vmambavisualstatespacemodel,271.7896314792265,landmark,True | ||
| 208 | −3014641072,10.1109/tpami.2020.2983686,,Deep High-Resolution Representation Learning for Visual Recognition,IEEE Transactions on Pattern Analysis and Machine Intelligence,2020,article,computer_vision,4,639.0,1362.0,183.6448855499229,4785,201.7077,True,False,baseline,183.6448855499229,landmark,True | 208 | +4387195417,10.1145/3626235,2209.00796,Diffusion Models: A Comprehensive Survey of Methods and Applications,ACM Computing Surveys,2023,article,computer_vision,7,621.0,1294.0,134.7985157249709,1666,151.1108,True,True,post,diffusionmodelsacomprehensivesurveyofmethodsandapplications,134.7985157249709,landmark,True | ||
| 209 | +4392741075,10.1038/s41598-024-56706-x,,Evaluation metrics and statistical tests for machine learning,Scientific Reports,2024,article,computer_vision,4,741.0,1288.0,159.97984859425029,1288,191.6809,True,True,post,evaluationmetricsandstatisticaltestsformachinelearning,159.97984859425029,landmark,True | ||||
modified
literature_synthesis/landmarks/security_privacy_abstracts.jsonl
+58 −58
@@ -1,96 +1,100 @@ | |||||
| 1 | −{"work_id": 2795085730, "title": "Blockchain: A Panacea for Healthcare Cloud-Based Data Security and Privacy?", "abstract": "One particular trend observed in healthcare is the progressive shift of data and services to the cloud, partly due to convenience (e.g. availability of complete patient medical history in real-time) and savings (e.g. economics of healthcare data management). There are, however, limitations to using conventional cryptographic primitives and access control models to address security and privacy concerns in an increasingly cloud-based environment. In this paper, we study the potential to use the Blockchain technology to protect healthcare data hosted within the cloud. We also describe the practical challenges of such a proposition and further research that is required."} | 1 | +{"work_id": 4415878254, "title": "DFCA: Decentralized Federated Clustering Algorithm", "abstract": "Clustered Federated Learning has emerged as an effective approach for handling heterogeneous data across clients by partitioning them into clusters with similar or identical data distributions. However, most existing methods, including the Iterative Federated Clustering Algorithm (IFCA), rely on a central server to coordinate model updates, typically requiring stable connectivity, synchronous communication rounds, and global aggregation of client models. These assumptions are difficult to satisfy in decentralized and heterogeneous environments, where clients may only have limited, local communication with a small subset of peers. As a result, such methods create a bottleneck and a single point of failure, limiting their applicability in realistic decentralized learning settings. This limitation is particularly severe in Internet of Things settings, where large numbers of resource-constrained devices, intermittent or sparse connectivity, and dynamic participation make reliance on a central server impractical. In this work, we introduce the Decentralized Federated Clustering Algorithm (DFCA), a fully decentralized clustered federated learning algorithm that enables clients to collaboratively train cluster-specific models without central coordination. DFCA uses a sequential running average to aggregate models from neighbors as updates arrive, providing a communication-efficient alternative to batch aggregation while maintaining clustering performance. Our experiments on various datasets demonstrate that DFCA outperforms other decentralized algorithms and performs comparably to centralized IFCA, even under sparse connectivity, highlighting its robustness and practicality for dynamic real-world decentralized networks."} | ||
| 2 | −{"work_id": 4408302972, "title": "The Impact of Artificial Intelligence (AI) on Students\u2019 Academic Development", "abstract": "The integration of Artificial Intelligence (AI) in education has transformed academic learning, offering both opportunities and challenges for students\u2019 development. This study investigates the impact of AI technologies on students\u2019 learning processes and academic performance, with a focus on their perceptions and the challenges associated with AI adoption. Conducted at the National University of Science and Technology POLITEHNICA Bucharest, this research involved second-year students who had direct experience with AI-enhanced learning environments. Using purposive sampling, 85 participants were selected to ensure relevance. Data were collected through a structured questionnaire comprising 11 items as follows: seven closed-ended questions assessing perceptions, usage, and the effectiveness of AI tools; and four open-ended questions exploring experiences, expectations, and concerns. Quantitative data were analyzed using frequency and percentage calculations, while qualitative responses were subjected to thematic analysis, incorporating both vertical (individual responses) and horizontal (cross-dataset) approaches to ensure comprehensive theme identification. The findings reveal that AI offers significant benefits, including personalized learning, improved academic outcomes, and enhanced student engagement. However, challenges such as over-reliance on AI, diminished critical thinking skills, data privacy risks, and academic dishonesty were also identified. The study underscores the necessity of a structured framework for AI integration, supported by ethical guidelines, to maximize benefits while mitigating risks. In conclusion, while AI holds immense potential to enhance learning efficiency and academic performance, its successful implementation requires addressing concerns related to accuracy, cognitive disengagement, and ethical implications. A balanced approach is essential to ensure equitable, effective, and responsible learning experiences in AI-enhanced educational environments."} | 2 | +{"work_id": 3123868249, "title": "Sex, Drugs, and Bitcoin: How Much Illegal Activity Is Financed through Cryptocurrencies?", "abstract": "Cryptocurrencies are among the largest unregulated markets in the world. We find that approximately one-quarter of bitcoin users are involved in illegal activity. We estimate that around $76 billion of illegal activity per year involve bitcoin (46% of bitcoin transactions), which is close to the scale of the U.S. and European markets for illegal drugs. The illegal share of bitcoin activity declines with mainstream interest in bitcoin and with the emergence of more opaque cryptocurrencies. The techniques developed in this paper have applications in cryptocurrency surveillance. Our findings suggest that cryptocurrencies are transforming the black markets by enabling \u201cblack e-commerce.\u201d Received June 1, 2017; editorial decision December 8, 2018 by Editor Andrew Karolyi. Authors have furnished an Internet Appendix, which is available on the Oxford University Press Web site next to the link to the final published paper online."} | ||
| 3 | −{"work_id": 3133814152, "title": "Towards Personalized Federated Learning", "abstract": "In parallel with the rapid adoption of artificial intelligence (AI) empowered by advances in AI research, there has been growing awareness and concerns of data privacy. Recent significant developments in the data regulation landscape have prompted a seismic shift in interest toward privacy-preserving AI. This has contributed to the popularity of Federated Learning (FL), the leading paradigm for the training of machine learning models on data silos in a privacy-preserving manner. In this survey, we explore the domain of personalized FL (PFL) to address the fundamental challenges of FL on heterogeneous data, a universal characteristic inherent in all real-world datasets. We analyze the key motivations for PFL and present a unique taxonomy of PFL techniques categorized according to the key challenges and personalization strategies in PFL. We highlight their key ideas, challenges, opportunities, and envision promising future trajectories of research toward a new PFL architectural design, realistic PFL benchmarking, and trustworthy PFL approaches."} | 3 | +{"work_id": 7155564432, "title": "Privacy-Preserving Anomaly Detection in Cloud Services using Hierarchical Federated Learning with Differential Privacy", "abstract": "Identifying abnormal behaviors plays a vital role in ensuring cloud infrastructure remains secure and operationally stable. Conventional methods that aggregate data at a single location create substantial privacy concerns, especially within shared cloud platforms hosting multiple organizations with confidential operational information. This paper proposes HierFedDP, a hierarchical federated learning framework integrated with a two-stage differential privacy mechanism for privacy-preserving anomaly detection in cloud services. Our approach employs a three-tier architecture consisting of local clients, edge servers, and a central cloud server, where clients apply local differential privacy to their updates before transmission. We introduce an edge aggregation frequency parameter that enables edge servers to perform multiple local aggregation rounds before communicating with the central cloud. Experiments on the CICIDS2017 dataset demonstrate that HierFedDP achieves detection performance comparable to standard local differential privacy approaches while reducing wide-area network (WAN) communication overhead by 49%. This significant communication reduction, achieved without sacrificing privacy guarantees or detection accuracy, makes HierFedDP particularly suitable for bandwidth-constrained, geo-distributed cloud deployments."} | ||
| 4 | −{"work_id": 2231944250, "title": "Enigma: Decentralized Computation Platform with Guaranteed Privacy", "abstract": "A peer-to-peer network, enabling different parties to jointly store and run computations on data while keeping the data completely private. Enigma's computational model is based on a highly optimized version of secure multi-party computation, guaranteed by a verifiable secret-sharing scheme. For storage, we use a modified distributed hashtable for holding secret-shared data. An external blockchain is utilized as the controller of the network, manages access control, identities and serves as a tamper-proof log of events. Security deposits and fees incentivize operation, correctness and fairness of the system. Similar to Bitcoin, Enigma removes the need for a trusted third party, enabling autonomous control of personal data. For the first time, users are able to share their data with cryptographic guarantees regarding their privacy."} | ||||
| 5 | {"work_id": 7104465905, "title": "Re-weighted softmax cross-entropy to control forgetting in federated learning", "abstract": "Dans l\u2019apprentissage f\u00e9d\u00e9r\u00e9, un mod\u00e8le global est appris en agr\u00e9geant les mises \u00e0 jour du mod\u00e8le calcul\u00e9es \u00e0 partir d\u2019un ensemble de n\u0153uds clients, un d\u00e9fi cl\u00e9 dans ce domaine est l\u2019h\u00e9t\u00e9rog\u00e9n\u00e9it\u00e9 des donn\u00e9es entre les clients qui d\u00e9grade les performances du mod\u00e8le. Les algorithmes d\u2019apprentissage f\u00e9d\u00e9r\u00e9 standard effectuent plusieurs \u00e9tapes de gradient avant de synchroniser le mod\u00e8le, ce qui peut amener les clients \u00e0 minimiser exag\u00e9r\u00e9ment leur propre objectif local et \u00e0 s\u2019\u00e9carter de la solution globale. Nous d\u00e9montrons que dans un tel contexte, les mod\u00e8les de clients individuels subissent un oubli catastrophique par rapport aux donn\u00e9es d\u2019autres clients et nous proposons une approche simple mais efficace qui modifie l\u2019objectif d\u2019entropie crois\u00e9e sur une base par client en repond\u00e9rant le softmax de les logits avant de calculer la perte. Cette approche prot\u00e8ge les classes en dehors de l\u2019ensemble d\u2019\u00e9tiquettes d\u2019un client d\u2019un changement de repr\u00e9sentation brutal. Gr\u00e2ce \u00e0 une \u00e9valuation empirique approfondie, nous d\u00e9montrons que notre approche peut att\u00e9nuer ce probl\u00e8me, en apportant une am\u00e9lioration continue aux algorithmes d\u2019apprentissage f\u00e9d\u00e9r\u00e9 standard. Cette approche est particuli\u00e8rement avantageux dans les contextes d\u2019apprentissage f\u00e9d\u00e9r\u00e9 difficiles les plus \u00e9troitement align\u00e9s sur les sc\u00e9narios du monde r\u00e9el o\u00f9 l\u2019h\u00e9t\u00e9rog\u00e9n\u00e9it\u00e9 des donn\u00e9es est \u00e9lev\u00e9e et la participation des clients \u00e0 chaque cycle est faible. Nous \u00e9tudions \u00e9galement les effets de l\u2019utilisation de la normalisation par lots et de la normalisation de groupe avec notre m\u00e9thode et constatons que la normalisation par lots, qui \u00e9tait auparavant consid\u00e9r\u00e9e comme pr\u00e9judiciable \u00e0 l\u2019apprentissage f\u00e9d\u00e9r\u00e9, fonctionne exceptionnellement bien avec notre softmax repond\u00e9r\u00e9, remettant en question certaines hypoth\u00e8ses ant\u00e9rieures sur la normalisation dans un syst\u00e8me f\u00e9d\u00e9r\u00e9"} | 4 | {"work_id": 7104465905, "title": "Re-weighted softmax cross-entropy to control forgetting in federated learning", "abstract": "Dans l\u2019apprentissage f\u00e9d\u00e9r\u00e9, un mod\u00e8le global est appris en agr\u00e9geant les mises \u00e0 jour du mod\u00e8le calcul\u00e9es \u00e0 partir d\u2019un ensemble de n\u0153uds clients, un d\u00e9fi cl\u00e9 dans ce domaine est l\u2019h\u00e9t\u00e9rog\u00e9n\u00e9it\u00e9 des donn\u00e9es entre les clients qui d\u00e9grade les performances du mod\u00e8le. Les algorithmes d\u2019apprentissage f\u00e9d\u00e9r\u00e9 standard effectuent plusieurs \u00e9tapes de gradient avant de synchroniser le mod\u00e8le, ce qui peut amener les clients \u00e0 minimiser exag\u00e9r\u00e9ment leur propre objectif local et \u00e0 s\u2019\u00e9carter de la solution globale. Nous d\u00e9montrons que dans un tel contexte, les mod\u00e8les de clients individuels subissent un oubli catastrophique par rapport aux donn\u00e9es d\u2019autres clients et nous proposons une approche simple mais efficace qui modifie l\u2019objectif d\u2019entropie crois\u00e9e sur une base par client en repond\u00e9rant le softmax de les logits avant de calculer la perte. Cette approche prot\u00e8ge les classes en dehors de l\u2019ensemble d\u2019\u00e9tiquettes d\u2019un client d\u2019un changement de repr\u00e9sentation brutal. Gr\u00e2ce \u00e0 une \u00e9valuation empirique approfondie, nous d\u00e9montrons que notre approche peut att\u00e9nuer ce probl\u00e8me, en apportant une am\u00e9lioration continue aux algorithmes d\u2019apprentissage f\u00e9d\u00e9r\u00e9 standard. Cette approche est particuli\u00e8rement avantageux dans les contextes d\u2019apprentissage f\u00e9d\u00e9r\u00e9 difficiles les plus \u00e9troitement align\u00e9s sur les sc\u00e9narios du monde r\u00e9el o\u00f9 l\u2019h\u00e9t\u00e9rog\u00e9n\u00e9it\u00e9 des donn\u00e9es est \u00e9lev\u00e9e et la participation des clients \u00e0 chaque cycle est faible. Nous \u00e9tudions \u00e9galement les effets de l\u2019utilisation de la normalisation par lots et de la normalisation de groupe avec notre m\u00e9thode et constatons que la normalisation par lots, qui \u00e9tait auparavant consid\u00e9r\u00e9e comme pr\u00e9judiciable \u00e0 l\u2019apprentissage f\u00e9d\u00e9r\u00e9, fonctionne exceptionnellement bien avec notre softmax repond\u00e9r\u00e9, remettant en question certaines hypoth\u00e8ses ant\u00e9rieures sur la normalisation dans un syst\u00e8me f\u00e9d\u00e9r\u00e9"} | ||
| 6 | {"work_id": 4392771733, "title": "S\u00e9curisation des Algorithmes d'Apprentissage Automatique", "abstract": "Deep Neural Networks (DNNs) have seen significant advances in recent years and are nowadays widely used in a variety of applications. When it comes to safety-critical systems, developing methods and tools to make these algorithms reliable, particularly for non-specialists who may treat them as \u201cblack boxes\u201d with no further checks, constitutes a core challenge. This thesis aims to investigate various methods that can enable the safe use of these technologies.In the first part, we tackle the problem of identifying whether the prediction of a DNN classifier should (or should not) be trusted so that, consequently, it would be possible to accept or reject it. In this regard, we propose a new detector whichapproximates the most powerful (Oracle) discriminator based on the probability of classification error with respect to the true class posterior probability.Two scenarios are investigated: Totally Black Box (TBB), where only the soft-predictionsare available, and Partially Black Box (PBB) where gradient-propagation to perform input pre-processing is allowed. The proposed detector can be applied to any pre-trained model. It does not require prior information about the underlying dataset and is as simple as the simplest available methods in the literature.We address in the second part the problem of simultaneous adversarial example detection. The detection methods are generally validated by assuming a single implicitly known attack strategy, which does not necessarily account for real-life threats. Indeed, this can lead to an overoptimistic assessment of the detectors\u2019 performance andmay induce some bias in comparing competing detection schemes. We propose a novel multi-armed framework for evaluating detectors based on several attack strategies to overcome this limitation. Among them, we make use of three new objectives to generate attacks. The proposed performance metric is based on the worst-case scenario: detection is successful if and only if all different attacks are correctly recognized. Moreover, following this setting, we formally derive a simple yet effective method to aggregate the decisions of multiple trained detectors, possibly provided by a third party. While every single detector tends to underperform or fail at detecting types of attack that it has never seen at training time, our framework successfully aggregates the knowledge of the available detectors to guarantee a robust detection algorithm. The proposed method has many advantages: it is simple as it does not require further training of the given detectors; it is modular, allowing existing (and future) methods to be merged into a single one; it is general since it can simultaneously recognize adversarial examples created according to different algorithms and training (loss) objectives."} | 5 | {"work_id": 4392771733, "title": "S\u00e9curisation des Algorithmes d'Apprentissage Automatique", "abstract": "Deep Neural Networks (DNNs) have seen significant advances in recent years and are nowadays widely used in a variety of applications. When it comes to safety-critical systems, developing methods and tools to make these algorithms reliable, particularly for non-specialists who may treat them as \u201cblack boxes\u201d with no further checks, constitutes a core challenge. This thesis aims to investigate various methods that can enable the safe use of these technologies.In the first part, we tackle the problem of identifying whether the prediction of a DNN classifier should (or should not) be trusted so that, consequently, it would be possible to accept or reject it. In this regard, we propose a new detector whichapproximates the most powerful (Oracle) discriminator based on the probability of classification error with respect to the true class posterior probability.Two scenarios are investigated: Totally Black Box (TBB), where only the soft-predictionsare available, and Partially Black Box (PBB) where gradient-propagation to perform input pre-processing is allowed. The proposed detector can be applied to any pre-trained model. It does not require prior information about the underlying dataset and is as simple as the simplest available methods in the literature.We address in the second part the problem of simultaneous adversarial example detection. The detection methods are generally validated by assuming a single implicitly known attack strategy, which does not necessarily account for real-life threats. Indeed, this can lead to an overoptimistic assessment of the detectors\u2019 performance andmay induce some bias in comparing competing detection schemes. We propose a novel multi-armed framework for evaluating detectors based on several attack strategies to overcome this limitation. Among them, we make use of three new objectives to generate attacks. The proposed performance metric is based on the worst-case scenario: detection is successful if and only if all different attacks are correctly recognized. Moreover, following this setting, we formally derive a simple yet effective method to aggregate the decisions of multiple trained detectors, possibly provided by a third party. While every single detector tends to underperform or fail at detecting types of attack that it has never seen at training time, our framework successfully aggregates the knowledge of the available detectors to guarantee a robust detection algorithm. The proposed method has many advantages: it is simple as it does not require further training of the given detectors; it is modular, allowing existing (and future) methods to be merged into a single one; it is general since it can simultaneously recognize adversarial examples created according to different algorithms and training (loss) objectives."} | ||
| 6 | +{"work_id": 4386476569, "title": "Blockchain-based data governance for privacy-preserving in multi-stakeholder settings", "abstract": "Em sistemas envolvendo m\u00faltiplas partes interessadas, como o setor da sa\u00fade, internet das coisas e o gerenciamento da cadeia de suprimentos, h\u00e1 uma gera\u00e7\u00e3o, troca e compartilhamento frequente de dados.Como resultado, os propriet\u00e1rios dos dados geralmente precisam controlar e preservar a privacidade de suas informa\u00e7\u00f5es, enquanto os consumidores dos dados exigem m\u00e9todos para determinar as origens e os criadores dos registros.Esses conflitos exigem solu\u00e7\u00f5es de governan\u00e7a que garantam a proveni\u00eancia dos dados, prote\u00e7\u00e3o da privacidade,"} | ||||
| 7 | {"work_id": 4214667959, "title": "A survey on blockchain technology and its security", "abstract": "Blockchain is a technology that has desirable features of decentralization, autonomy, integrity, immutability, verification, fault-tolerance, anonymity, auditability, and transparency. In this paper, we first carry out a deeper survey about blockchain technology, especially its history, consensus algorithms' quantitative comparisons, details of cryptography in terms of public key cryptography, Zero-Knowledge Proofs, and hash functions used in the blockchain, and the comprehensive list of blockchain applications. Further, the security of blockchain itself is a focus in this paper. In particular, we assess the blockchain security from risk analysis to derive comprehensive blockchain security risk categories, analyze the real attacks and bugs against blockchain, and summarize the recently developed security measures on blockchain. Finally, the challenges and research trends are presented to achieve more scalable and securer blockchain systems for the massive deployments."} | 7 | {"work_id": 4214667959, "title": "A survey on blockchain technology and its security", "abstract": "Blockchain is a technology that has desirable features of decentralization, autonomy, integrity, immutability, verification, fault-tolerance, anonymity, auditability, and transparency. In this paper, we first carry out a deeper survey about blockchain technology, especially its history, consensus algorithms' quantitative comparisons, details of cryptography in terms of public key cryptography, Zero-Knowledge Proofs, and hash functions used in the blockchain, and the comprehensive list of blockchain applications. Further, the security of blockchain itself is a focus in this paper. In particular, we assess the blockchain security from risk analysis to derive comprehensive blockchain security risk categories, analyze the real attacks and bugs against blockchain, and summarize the recently developed security measures on blockchain. Finally, the challenges and research trends are presented to achieve more scalable and securer blockchain systems for the massive deployments."} | ||
| 8 | {"work_id": 2624307925, "title": "A Survey on Security and Privacy Issues of Bitcoin", "abstract": "Bitcoin is a popular cryptocurrency that records all transactions in a distributed append-only public ledger called blockchain. The security of Bitcoin heavily relies on the incentive-compatible proof-of-work (PoW) based distributed consensus protocol, which is run by the network nodes called miners. In exchange for the incentive, the miners are expected to maintain the blockchain honestly. Since its launch in 2009, Bitcoin economy has grown at an enormous rate, and it is now worth about 150 billions of dollars. This exponential growth in the market value of bitcoins motivate adversaries to exploit weaknesses for profit, and researchers to discover new vulnerabilities in the system, propose countermeasures, and predict upcoming trends. In this paper, we present a systematic survey that covers the security and privacy aspects of Bitcoin. We start by giving an overview of the Bitcoin system and its major components along with their functionality and interactions within the system. We review the existing vulnerabilities in Bitcoin and its major underlying technologies such as blockchain and PoW-based consensus protocol. These vulnerabilities lead to the execution of various security threats to the standard functionality of Bitcoin. We then investigate the feasibility and robustness of the state-of-the-art security solutions. Additionally, we discuss the current anonymity considerations in Bitcoin and the privacy-related threats to Bitcoin users along with the analysis of the existing privacy-preserving solutions. Finally, we summarize the critical open challenges, and we suggest directions for future research towards provisioning stringent security and privacy solutions for Bitcoin."} | 8 | {"work_id": 2624307925, "title": "A Survey on Security and Privacy Issues of Bitcoin", "abstract": "Bitcoin is a popular cryptocurrency that records all transactions in a distributed append-only public ledger called blockchain. The security of Bitcoin heavily relies on the incentive-compatible proof-of-work (PoW) based distributed consensus protocol, which is run by the network nodes called miners. In exchange for the incentive, the miners are expected to maintain the blockchain honestly. Since its launch in 2009, Bitcoin economy has grown at an enormous rate, and it is now worth about 150 billions of dollars. This exponential growth in the market value of bitcoins motivate adversaries to exploit weaknesses for profit, and researchers to discover new vulnerabilities in the system, propose countermeasures, and predict upcoming trends. In this paper, we present a systematic survey that covers the security and privacy aspects of Bitcoin. We start by giving an overview of the Bitcoin system and its major components along with their functionality and interactions within the system. We review the existing vulnerabilities in Bitcoin and its major underlying technologies such as blockchain and PoW-based consensus protocol. These vulnerabilities lead to the execution of various security threats to the standard functionality of Bitcoin. We then investigate the feasibility and robustness of the state-of-the-art security solutions. Additionally, we discuss the current anonymity considerations in Bitcoin and the privacy-related threats to Bitcoin users along with the analysis of the existing privacy-preserving solutions. Finally, we summarize the critical open challenges, and we suggest directions for future research towards provisioning stringent security and privacy solutions for Bitcoin."} | ||
| 9 | {"work_id": 2898069736, "title": "Blockchain technology and its relationships to sustainable supply chain management", "abstract": "Globalisation of supply chains makes their management and control more difficult. Blockchain technology, as a distributed digital ledger technology which ensures transparency, traceability, and security, is showing promise for easing some global supply chain management problems. In this paper, blockchain technology and smart contracts are critically examined with potential application to supply chain management. Local and global government, community, and consumer pressures to meet sustainability goals prompt us to further investigate how blockchain can address and aid supply chain sustainability. Part of this critical examination is how blockchains, a potentially disruptive technology that is early in its evolution, can overcome many potential barriers. Four blockchain technology adoption barriers categories are introduced; inter-organisational, intra-organisational, technical, and external barriers. True blockchain-led transformation of business and supply chain is still in progress and in its early stages; we propose future research propositions and directions that can provide insights into overcoming barriers and adoption of blockchain technology for supply chain management."} | 9 | {"work_id": 2898069736, "title": "Blockchain technology and its relationships to sustainable supply chain management", "abstract": "Globalisation of supply chains makes their management and control more difficult. Blockchain technology, as a distributed digital ledger technology which ensures transparency, traceability, and security, is showing promise for easing some global supply chain management problems. In this paper, blockchain technology and smart contracts are critically examined with potential application to supply chain management. Local and global government, community, and consumer pressures to meet sustainability goals prompt us to further investigate how blockchain can address and aid supply chain sustainability. Part of this critical examination is how blockchains, a potentially disruptive technology that is early in its evolution, can overcome many potential barriers. Four blockchain technology adoption barriers categories are introduced; inter-organisational, intra-organisational, technical, and external barriers. True blockchain-led transformation of business and supply chain is still in progress and in its early stages; we propose future research propositions and directions that can provide insights into overcoming barriers and adoption of blockchain technology for supply chain management."} | ||
| 10 | −{"work_id": 7130652904, "title": "vul-rag : Enhancing LLM-based Vulnerability Detection via Knowledge-level RAG", "abstract": "Although LLMs have shown promising potential in vulnerability detection, this study reveals their limitations in distinguishing between vulnerable and similar-but-benign patched code (only 0.06\u20130.14 accuracy). It shows that LLMs struggle to capture the root causes of vulnerabilities during vulnerability detection. To address this challenge, we propose enhancing LLMs with multi-dimensional vulnerability knowledge distilled from historical vulnerabilities and fixes. We design a novel knowledge-level Retrieval-Augmented Generation framework Vul-RAG , which improves LLMs with an accuracy increase of 16\u201324% in identifying vulnerable and patched code. Additionally, vulnerability knowledge generated by Vul-RAG can further (1) serve as high-quality explanations to improve manual detection accuracy (from 60% to 77%), and (2) detect 10 previously-unknown bugs in the recent Linux kernel release with six assigned CVEs."} | ||||
| 11 | {"work_id": 7129030749, "title": "Model Context Protocol (MCP): Landscape, Security Threats, and Future Research Directions", "abstract": "The Model Context Protocol (MCP) is an emerging open standard that defines a unified, bi-directional communication and dynamic discovery protocol between AI models and external tools or resources, aiming to enhance interoperability and reduce fragmentation across diverse systems. This paper conducts a systematic study of MCP from both architectural and security perspectives. We first define the full lifecycle of an MCP server, comprising four phases (creation, deployment, operation, and maintenance), further decomposed into 16 key activities that capture its functional evolution. Building on this lifecycle analysis, we construct a comprehensive threat taxonomy that categorizes security and privacy risks across four major attacker types: malicious developers, external attackers, malicious users, and security flaws, encompassing 16 distinct threat scenarios. To validate these risks, we develop and analyze real-world case studies that demonstrate concrete attack surfaces and vulnerability manifestations within MCP implementations. Based on these findings, the paper proposes a set of fine-grained, actionable security safeguards tailored to each lifecycle phase and threat category, offering practical guidance for secure MCP adoption. We also analyze the current MCP landscape, covering industry adoption, integration patterns, and supporting tools, to identify its technological strengths as well as existing limitations that constrain broader deployment. Finally, we outline future research and development directions aimed at strengthening MCP\u2019s standardization, trust boundaries, and sustainable growth within the evolving ecosystem of tool-augmented AI systems. All collected data and implementation examples are publicly available at https://github.com/security-pride/MCP_Landscape ."} | 10 | {"work_id": 7129030749, "title": "Model Context Protocol (MCP): Landscape, Security Threats, and Future Research Directions", "abstract": "The Model Context Protocol (MCP) is an emerging open standard that defines a unified, bi-directional communication and dynamic discovery protocol between AI models and external tools or resources, aiming to enhance interoperability and reduce fragmentation across diverse systems. This paper conducts a systematic study of MCP from both architectural and security perspectives. We first define the full lifecycle of an MCP server, comprising four phases (creation, deployment, operation, and maintenance), further decomposed into 16 key activities that capture its functional evolution. Building on this lifecycle analysis, we construct a comprehensive threat taxonomy that categorizes security and privacy risks across four major attacker types: malicious developers, external attackers, malicious users, and security flaws, encompassing 16 distinct threat scenarios. To validate these risks, we develop and analyze real-world case studies that demonstrate concrete attack surfaces and vulnerability manifestations within MCP implementations. Based on these findings, the paper proposes a set of fine-grained, actionable security safeguards tailored to each lifecycle phase and threat category, offering practical guidance for secure MCP adoption. We also analyze the current MCP landscape, covering industry adoption, integration patterns, and supporting tools, to identify its technological strengths as well as existing limitations that constrain broader deployment. Finally, we outline future research and development directions aimed at strengthening MCP\u2019s standardization, trust boundaries, and sustainable growth within the evolving ecosystem of tool-augmented AI systems. All collected data and implementation examples are publicly available at https://github.com/security-pride/MCP_Landscape ."} | ||
| 12 | {"work_id": 1516024962, "title": "Energy Efficient Adaptive Reed-Solomon Decoding System", "abstract": "This work presents an energy efficient adaptive error correction system utilizing the Reed-Solomon errors-and-erasures algorithm, targeted to an Altera Stratix FPGA device. The system adapts to changing channel conditions by reconfiguring the system with different decoders to allow for the lowest possible energy consumption rate that the current channel conditions will allow.\\nA series of energy saving optimizations were applied to a set of previous designs, resulting in a reduction in the energy required to decode a megabit of data of more than 70%. In addition, a new channel model was used to assess the effects of differing reconfiguration rates on codeword error rate, energy consumption, and decoding speed."} | 11 | {"work_id": 1516024962, "title": "Energy Efficient Adaptive Reed-Solomon Decoding System", "abstract": "This work presents an energy efficient adaptive error correction system utilizing the Reed-Solomon errors-and-erasures algorithm, targeted to an Altera Stratix FPGA device. The system adapts to changing channel conditions by reconfiguring the system with different decoders to allow for the lowest possible energy consumption rate that the current channel conditions will allow.\\nA series of energy saving optimizations were applied to a set of previous designs, resulting in a reduction in the energy required to decode a megabit of data of more than 70%. In addition, a new channel model was used to assess the effects of differing reconfiguration rates on codeword error rate, energy consumption, and decoding speed."} | ||
| 13 | {"work_id": 7134847443, "title": "3D Non-Degenerate Hyperchaos: Design, Analysis, and Application in Image Encryption", "abstract": "The widespread adoption of consumer electronics (CE), particularly in smart home ecosystems, has led to the proliferation of intelligent devices such as smart cameras, video doorbells, and smart door locks. While these devices enhance convenience and automation, they generate massive amounts of visual data containing sensitive personal information, thereby increasing the risk of privacy leakage and challenging traditional encryption methods in consumer IoT networks. To address this issue, a cryptanalysis-driven image encryption scheme via a chaos-based 3D S-box and genetic code is proposed, specifically designed to safeguard visual privacy in consumer applications. First, a novel dynamical architecture, formally termed 3D Non-degenerate Hyperchaos (3D-NDHC), is constructed to serve as a robust entropy source. Explicitly defined as a globally bounded volume-expanding hyperchaotic system, 3D-NDHC distinguishes itself from traditional dissipative maps by exhibiting global robust hyperchaos and scalable complexity, where the Lyapunov exponents grow logarithmically with control parameters, ensuring high unpredictability. Next, a dynamically generated three-dimensional S-box driven by these chaotic sequences is introduced to perform efficient image permutation. Subsequently, a genetic code method enhanced by cryptanalysis is applied to confuse the permuted image matrix, specifically addressing the security vulnerabilities often inherent in lightweight encryption algorithms. Finally, under the control of pseudo-chaotic sequences, a lightweight wave diffusion process is employed to spread the pixel values and produce the final ciphertext image. In contrast to conventional algorithms that rely on standard encryption techniques, the proposed approach integrates a chaos-driven 3D S-box with a cryptanalysis-enhanced genetic code scheme. This combination introduces a high level of confusion and diffusion, significantly increasing the difficulty for attackers attempting to illegally decrypt sensitive images from smart devices. Experimental results and security analyses demonstrate that the scheme effectively resists various cryptographic attacks and outperforms several recently proposed image encryption algorithms, offering a robust solution for protecting digital image privacy in smart home environments."} | 12 | {"work_id": 7134847443, "title": "3D Non-Degenerate Hyperchaos: Design, Analysis, and Application in Image Encryption", "abstract": "The widespread adoption of consumer electronics (CE), particularly in smart home ecosystems, has led to the proliferation of intelligent devices such as smart cameras, video doorbells, and smart door locks. While these devices enhance convenience and automation, they generate massive amounts of visual data containing sensitive personal information, thereby increasing the risk of privacy leakage and challenging traditional encryption methods in consumer IoT networks. To address this issue, a cryptanalysis-driven image encryption scheme via a chaos-based 3D S-box and genetic code is proposed, specifically designed to safeguard visual privacy in consumer applications. First, a novel dynamical architecture, formally termed 3D Non-degenerate Hyperchaos (3D-NDHC), is constructed to serve as a robust entropy source. Explicitly defined as a globally bounded volume-expanding hyperchaotic system, 3D-NDHC distinguishes itself from traditional dissipative maps by exhibiting global robust hyperchaos and scalable complexity, where the Lyapunov exponents grow logarithmically with control parameters, ensuring high unpredictability. Next, a dynamically generated three-dimensional S-box driven by these chaotic sequences is introduced to perform efficient image permutation. Subsequently, a genetic code method enhanced by cryptanalysis is applied to confuse the permuted image matrix, specifically addressing the security vulnerabilities often inherent in lightweight encryption algorithms. Finally, under the control of pseudo-chaotic sequences, a lightweight wave diffusion process is employed to spread the pixel values and produce the final ciphertext image. In contrast to conventional algorithms that rely on standard encryption techniques, the proposed approach integrates a chaos-driven 3D S-box with a cryptanalysis-enhanced genetic code scheme. This combination introduces a high level of confusion and diffusion, significantly increasing the difficulty for attackers attempting to illegally decrypt sensitive images from smart devices. Experimental results and security analyses demonstrate that the scheme effectively resists various cryptographic attacks and outperforms several recently proposed image encryption algorithms, offering a robust solution for protecting digital image privacy in smart home environments."} | ||
| 14 | {"work_id": 3041344359, "title": "Machine Learning for anomaly detection in IoT networks :Malware analysis on the IoT-23 data set", "abstract": "The Internet of Things is one of the newer developments\r\nin the domain of the Internet. It is defined as a network\r\nof connected devices and sensors, both physical and digital, that generate and exchange large amounts of data\r\nwithout the need for human intervention. As a result\r\nof eliminating the need for human operators, the IoT\r\n(Internet of Things) can process more data than ever\r\nbefore faster and more efficient.\r\nThis paper focuses on the security aspect of IoT networks by investigating the usability of machine learning\r\nalgorithms in the detection of anomalies found within\r\nthe data of such networks. It examines ML algorithms\r\nthat are successfully utilized in relatively similar situations and compares using a number of parameters and\r\nmethods.\r\nThis paper implements the following algorithms: Random Forest (RF), Naive Bayes (NB), Multi Layer\r\nPerceptron (MLP), a variant of the Artificial Neural\r\nNetwork class of algorithms, Support Vector Machine\r\n(SVM) and AdaBoost (ADA). The best results were\r\nachieved by the Random Forest algorithm, with a accuracy or 99.5%."} | 13 | {"work_id": 3041344359, "title": "Machine Learning for anomaly detection in IoT networks :Malware analysis on the IoT-23 data set", "abstract": "The Internet of Things is one of the newer developments\r\nin the domain of the Internet. It is defined as a network\r\nof connected devices and sensors, both physical and digital, that generate and exchange large amounts of data\r\nwithout the need for human intervention. As a result\r\nof eliminating the need for human operators, the IoT\r\n(Internet of Things) can process more data than ever\r\nbefore faster and more efficient.\r\nThis paper focuses on the security aspect of IoT networks by investigating the usability of machine learning\r\nalgorithms in the detection of anomalies found within\r\nthe data of such networks. It examines ML algorithms\r\nthat are successfully utilized in relatively similar situations and compares using a number of parameters and\r\nmethods.\r\nThis paper implements the following algorithms: Random Forest (RF), Naive Bayes (NB), Multi Layer\r\nPerceptron (MLP), a variant of the Artificial Neural\r\nNetwork class of algorithms, Support Vector Machine\r\n(SVM) and AdaBoost (ADA). The best results were\r\nachieved by the Random Forest algorithm, with a accuracy or 99.5%."} | ||
| 15 | {"work_id": 4407111324, "title": "Exploring the effects of artificial intelligence on student and academic well-being in higher education: a mini-review", "abstract": "The increasing use of artificial intelligence (AI) in higher education is reshaping how students engage with their academic and personal lives. However, the impact of AI on students' well-being remains underexplored. This mini-review synthesizes current literature to assess how AI affects student well-being, focusing on mental health, social interactions, and academic experiences. While AI offers benefits such as personalized learning, mental health support, and improved communication efficiency, it also raises concerns regarding digital fatigue, loneliness, technostress, and reduced face-to-face interactions. Over-reliance on AI may diminish interpersonal skills and emotional intelligence, leading to social isolation and anxiety. Furthermore, issues such as data privacy and job displacement emerge as AI technologies permeate educational environments. The review highlights the need for balanced AI integration that supports both academic success and student well-being, advocating for further empirical studies to comprehensively understand these dynamics. As AI becomes more embedded in education, it is crucial to develop strategies that mitigate its negative effects while promoting holistic well-being among students."} | 14 | {"work_id": 4407111324, "title": "Exploring the effects of artificial intelligence on student and academic well-being in higher education: a mini-review", "abstract": "The increasing use of artificial intelligence (AI) in higher education is reshaping how students engage with their academic and personal lives. However, the impact of AI on students' well-being remains underexplored. This mini-review synthesizes current literature to assess how AI affects student well-being, focusing on mental health, social interactions, and academic experiences. While AI offers benefits such as personalized learning, mental health support, and improved communication efficiency, it also raises concerns regarding digital fatigue, loneliness, technostress, and reduced face-to-face interactions. Over-reliance on AI may diminish interpersonal skills and emotional intelligence, leading to social isolation and anxiety. Furthermore, issues such as data privacy and job displacement emerge as AI technologies permeate educational environments. The review highlights the need for balanced AI integration that supports both academic success and student well-being, advocating for further empirical studies to comprehensively understand these dynamics. As AI becomes more embedded in education, it is crucial to develop strategies that mitigate its negative effects while promoting holistic well-being among students."} | ||
| 16 | −{"work_id": 4401442713, "title": "Module-lattice-based digital signature standard", "abstract": "Digital signatures are used to detect unauthorized modifications to data and to authenticate the identity of the signatory. In addition, the recipient of signed data can use a digital signature as evidence in demonstrating to a third party that the signature was, in fact, generated by the claimed signatory. This is known as non-repudiation since the signatory cannot easily repudiate the signature at a later time. This standard specifies ML-DSA, a set of algorithms that can be used to generate and verify digital signatures. ML-DSA is believed to be secure, even against adversaries in possession of a large-scale quantum computer."} | 15 | +{"work_id": 4254706618, "title": "Status report on the second round of the NIST post-quantum cryptography standardization process", "abstract": "The Information Technology Laboratory (ITL) at the National Institute of Standards and Technology (NIST) promotes the U.S. economy and public welfare by providing technical leadership for the Nation's measurement and standards infrastructure.ITL develops tests, test methods, reference data, proof of concept implementations, and technical analyses to advance the development and productive use of information technology.ITL's responsibilities include the development of management, administrative, technical, and physical standards and guidelines for the cost-effective security and privacy of other than national security-related information in federal information systems."} | ||
| 17 | −{"work_id": 3201596224, "title": "ELLIPTIC CURVE DIGITAL SIGNATURE ALGORITHM", "abstract": "Elliptic curve cryptography has been a remarkable development in the history of cryptography thanks to the properties provided by the implementation of elliptic curve cryptography. Elliptic curve cryptography has proven to be adaptable given its broad presence across various electronics of diering sizes and capabilities. Elliptic curve cryptography is known for utilizing the discrete logarithm problem, modern algebra, and elliptic curves that have encouraged continued research into elliptic curve cryptography in its advantages and restrictions. The current comprehension of elliptic curves as well as continuing advancements and employments of elliptic curve cryptography have yielded the elliptic curve digital signature algorithm (ECDSA) which has become an alternative to the primary Digital Signature Algorithm. TheECDSA provides advantages of elliptic curve cryptography to the function of the digital signature algorithm to authenticate and protect transmissions between involved parties. Such can be explored in the securing of bitcoinrelated transactions where the completely electronic, decentralized currencywould face a multitude of cyber threats and require safeguards to remaintrustworthy."} | 16 | +{"work_id": 3041977451, "title": "Analyzing adoption of contact tracing apps using UTAUT", "abstract": "Contact tracing apps have been a highly debated topic during the COVID-19 epidemic. Recently released COVID-19 contact tracing apps have been lagging behind in terms of user adoption. As user adoption is crucial to the effectiveness of contact tracing apps, there needs to be a deeper investigation into possible influences on the user adoption of such apps. Therefore, this research will propose a modified version of the Unified Theory of Acceptance and Use of Technology (UTAUT) founded on a systematic literature review. A survey has been conducted with 134 participants based on this modified model. Performance expectancy and perceived credibility have been determined to have a significant impact on the intention to use a contract tracing app. Apart from providing receiving notifications about possible infections, current contract tracing apps appear to not provide a clear benefit to the user and are perceived as somewhat unsafe and privacy-invading. Furthermore, contact tracing apps might turn out to be a failure, as this research finds a low intention to use such apps. This research contributes to understanding user adoption of contract tracing apps and gives insights into possible improvements regarding the development and approach of such apps."} | ||
| 18 | −{"work_id": 2913851998, "title": "Status report on the first round of the NIST post-quantum cryptography standardization process", "abstract": "The Information Technology Laboratory (ITL) at the National Institute of Standards and Technology (NIST) promotes the U.S. economy and public welfare by providing technical leadership for the Nation's measurement and standards infrastructure.ITL develops tests, test methods, reference data, proof of concept implementations, and technical analyses to advance the development and productive use of information technology.ITL's responsibilities include the development of management, administrative, technical, and physical standards and guidelines for the cost-effective security and privacy of other than national security-related information in federal information systems."} | 17 | +{"work_id": 4406028284, "title": "A Novel Dynamic Hill Cipher and Its Applications on Medical IoT", "abstract": "Cryptography is one of the most important areas in information security. Cryptography ensures secure communication and data privacy, and it is increasingly being applied in healthcare and related fields. As an important classical cryptographic method, the Hill cipher has always been closely studied by experts and scholars. In order to enhance the security of the conventional Hill cipher (CHC), a novel dynamic Hill cipher (NDHC) is proposed in this work. The proposed NDHC not only replaces the static key matrix of the CHC with a time-varying dynamic key matrix (TVDKM) to change the image pixel values over time t, but also uses the Logistic chaos sequence scrambling the image pixel positions, which greatly enhances the security of the CHC. However, how to effectively obtain the dynamic inversion key matrix (DIKM) of the TVDKM becomes an urgent issue in the NDHC decryption. In order to quickly find the DIKM, a fixed-time convergence fuzzy Zeroing neural network (FTCF-ZNN) model is constructed, and the convergence and robustness of the FTCF-ZNN model for solving the DIKM are verified through theoretical analysis and comparative experimental results. Moreover, the effectiveness and security of the proposed NDHC for medical images encryption and decryption are also validated by experiments."} | ||
| 19 | −{"work_id": 3021970994, "title": "Acceptability of App-Based Contact Tracing for COVID-19: Cross-Country Survey Study", "abstract": "BACKGROUND: The COVID-19 pandemic is the greatest public health crisis of the last 100 years. Countries have responded with various levels of lockdown to save lives and stop health systems from being overwhelmed. At the same time, lockdowns entail large socioeconomic costs. One exit strategy under consideration is a mobile phone app that traces the close contacts of those infected with COVID-19. Recent research has demonstrated the theoretical effectiveness of this solution in different disease settings. However, concerns have been raised about such apps because of the potential privacy implications. This could limit the acceptability of app-based contact tracing in the general population. As the effectiveness of this approach increases strongly with app uptake, it is crucial to understand public support for this intervention. OBJECTIVE: The objective of this study is to investigate the user acceptability of a contact-tracing app in five countries hit by the pandemic. METHODS: We conducted a largescale, multicountry study (N=5995) to measure public support for the digital contact tracing of COVID-19 infections. We ran anonymous online surveys in France, Germany, Italy, the United Kingdom, and the United States. We measured intentions to use a contact-tracing app across different installation regimes (voluntary installation vs automatic installation by mobile phone providers) and studied how these intentions vary across individuals and countries. RESULTS: We found strong support for the app under both regimes, in all countries, across all subgroups of the population, and irrespective of regional-level COVID-19 mortality rates. We investigated the main factors that may hinder or facilitate uptake and found that concerns about cybersecurity and privacy, together with a lack of trust in the government, are the main barriers to adoption. CONCLUSIONS: Epidemiological evidence shows that app-based contact tracing can suppress the spread of COVID-19 if a high enough proportion of the population uses the app and that it can still reduce the number of infections if uptake is moderate. Our findings show that the willingness to install the app is very high. The available evidence suggests that app-based contact tracing may be a viable approach to control the diffusion of COVID-19."} | 18 | +{"work_id": 3162358200, "title": "Non-Fungible Token (NFT): Overview, Evaluation, Opportunities and Challenges", "abstract": "The Non-Fungible Token (NFT) market is mushrooming in recent years. The concept of NFT originally comes from a token standard of Ethereum, aiming to distinguish each token with distinguishable signs. This type of token can be bound with virtual/digital properties as their unique identifications. With NFTs, all marked properties can be freely traded with customized values according to their ages, rarity, liquidity, etc. It has greatly stimulated the prosperity of the decentralized application (DApp) market. At the time of writing (May 2021), the total money used on completed NFT sales has reached $34,530,649.86$ USD. The thousandfold return on its increasing market draws huge attention worldwide. However, the development of the NFT ecosystem is still in its early stage, and the technologies of NFTs are pre-mature. Newcomers may get lost in their frenetic evolution due to the lack of systematic summaries. In this technical report, we explore the NFT ecosystems in several aspects. We start with an overview of state-of-the-art NFT solutions, then provide their technical components, protocols, standards, and desired proprieties. Afterward, we give a security evolution, with discussions on the perspectives of their design models, opportunities, and challenges. To the best of our knowledge, this is the first systematic study on the current NFT ecosystems."} | ||
| 20 | −{"work_id": 3018102029, "title": "SplitFed: When Federated Learning Meets Split Learning", "abstract": "Federated learning (FL) and split learning (SL) are two popular distributed machine learning approaches. Both follow a model-to-data scenario; clients train and test machine learning models without sharing raw data. SL provides better model privacy than FL due to the machine learning model architecture split between clients and the server. Moreover, the split model makes SL a better option for resource-constrained environments. However, SL performs slower than FL due to the relay-based training across multiple clients. In this regard, this paper presents a novel approach, named splitfed learning (SFL), that amalgamates the two approaches eliminating their inherent drawbacks, along with a refined architectural configuration incorporating differential privacy and PixelDP to enhance data privacy and model robustness. Our analysis and empirical results demonstrate that (pure) SFL provides similar test accuracy and communication efficiency as SL while significantly decreasing its computation time per global epoch than in SL for multiple clients. Furthermore, as in SL, its communication efficiency over FL improves with the number of clients. Besides, the performance of SFL with privacy and robustness measures is further evaluated under extended experimental settings."} | 19 | +{"work_id": 2795085730, "title": "Blockchain: A Panacea for Healthcare Cloud-Based Data Security and Privacy?", "abstract": "One particular trend observed in healthcare is the progressive shift of data and services to the cloud, partly due to convenience (e.g. availability of complete patient medical history in real-time) and savings (e.g. economics of healthcare data management). There are, however, limitations to using conventional cryptographic primitives and access control models to address security and privacy concerns in an increasingly cloud-based environment. In this paper, we study the potential to use the Blockchain technology to protect healthcare data hosted within the cloud. We also describe the practical challenges of such a proposition and further research that is required."} | ||
| 21 | −{"work_id": 7127055292, "title": "Artificial intelligence in higher education: a systematic review of its impact on student engagement and the mediating role of teaching methods", "abstract": "Introduction Artificial Intelligence (AI) is increasingly integrated into higher education to personalize instruction and support student engagement. However, the mediating role of teaching methods in this process remains underexplored. Methods This systematic review analyzed 73 peer-reviewed articles published between 2015 and early 2025, retrieved from Scopus and Web of Science, following PRISMA guidelines. Studies were screened based on predefined inclusion criteria and coded using a structured framework that examined AI types, engagement outcomes, and instructional strategies. Results Findings reveal that AI tools\u2014such as chatbots, adaptive systems, and predictive analytics\u2014enhance engagement most effectively when embedded within interactive pedagogies like flipped classrooms, project-based learning, and scaffolded feedback loops. To conceptualize this relationship, we introduce the PMAISE model (Pedagogical Mediation of AI for Student Engagement), which maps the alignment between AI technologies, pedagogical strategies, and the affective, behavioral, and cognitive dimensions of engagement. Concrete examples from recent studies demonstrate how teaching methods amplify or inhibit the effects of AI tools. The review also critically examines emerging concerns related to ethics, data privacy, and structural barriers to equitable AI adoption. Discussion This study offers a conceptual and practical framework for integrating AI into higher education in a context-sensitive, evidence-based, and pedagogically meaningful manner, highlighting the crucial role of thoughtful pedagogical mediation in maximizing AI\u2019s educational benefits."} | 20 | +{"work_id": 4408302972, "title": "The Impact of Artificial Intelligence (AI) on Students\u2019 Academic Development", "abstract": "The integration of Artificial Intelligence (AI) in education has transformed academic learning, offering both opportunities and challenges for students\u2019 development. This study investigates the impact of AI technologies on students\u2019 learning processes and academic performance, with a focus on their perceptions and the challenges associated with AI adoption. Conducted at the National University of Science and Technology POLITEHNICA Bucharest, this research involved second-year students who had direct experience with AI-enhanced learning environments. Using purposive sampling, 85 participants were selected to ensure relevance. Data were collected through a structured questionnaire comprising 11 items as follows: seven closed-ended questions assessing perceptions, usage, and the effectiveness of AI tools; and four open-ended questions exploring experiences, expectations, and concerns. Quantitative data were analyzed using frequency and percentage calculations, while qualitative responses were subjected to thematic analysis, incorporating both vertical (individual responses) and horizontal (cross-dataset) approaches to ensure comprehensive theme identification. The findings reveal that AI offers significant benefits, including personalized learning, improved academic outcomes, and enhanced student engagement. However, challenges such as over-reliance on AI, diminished critical thinking skills, data privacy risks, and academic dishonesty were also identified. The study underscores the necessity of a structured framework for AI integration, supported by ethical guidelines, to maximize benefits while mitigating risks. In conclusion, while AI holds immense potential to enhance learning efficiency and academic performance, its successful implementation requires addressing concerns related to accuracy, cognitive disengagement, and ethical implications. A balanced approach is essential to ensure equitable, effective, and responsible learning experiences in AI-enhanced educational environments."} | ||
| 22 | −{"work_id": 4382463479, "title": "FedALA: Adaptive Local Aggregation for Personalized Federated Learning", "abstract": "A key challenge in federated learning (FL) is the statistical heterogeneity that impairs the generalization of the global model on each client. To address this, we propose a method Federated learning with Adaptive Local Aggregation (FedALA) by capturing the desired information in the global model for client models in personalized FL. The key component of FedALA is an Adaptive Local Aggregation (ALA) module, which can adaptively aggregate the downloaded global model and local model towards the local objective on each client to initialize the local model before training in each iteration. To evaluate the effectiveness of FedALA, we conduct extensive experiments with five benchmark datasets in computer vision and natural language processing domains. FedALA outperforms eleven state-of-the-art baselines by up to 3.27% in test accuracy. Furthermore, we also apply ALA module to other federated learning methods and achieve up to 24.19% improvement in test accuracy. Code is available at https://github.com/TsingZ0/FedALA."} | 21 | +{"work_id": 3133814152, "title": "Towards Personalized Federated Learning", "abstract": "In parallel with the rapid adoption of artificial intelligence (AI) empowered by advances in AI research, there has been growing awareness and concerns of data privacy. Recent significant developments in the data regulation landscape have prompted a seismic shift in interest toward privacy-preserving AI. This has contributed to the popularity of Federated Learning (FL), the leading paradigm for the training of machine learning models on data silos in a privacy-preserving manner. In this survey, we explore the domain of personalized FL (PFL) to address the fundamental challenges of FL on heterogeneous data, a universal characteristic inherent in all real-world datasets. We analyze the key motivations for PFL and present a unique taxonomy of PFL techniques categorized according to the key challenges and personalization strategies in PFL. We highlight their key ideas, challenges, opportunities, and envision promising future trajectories of research toward a new PFL architectural design, realistic PFL benchmarking, and trustworthy PFL approaches."} | ||
| 23 | −{"work_id": 652269645, "title": "A Design and Analysis of Graphical Password", "abstract": "The most common computer authentication method is to use alphanumerical usernames and passwords. This method has been shown to have significant drawbacks. For example, users tend to pick passwords that can be easily guessed. On the other hand, if a password is hard to guess, then it is often hard to remember. To address this problem, some researchers have developed authentication methods that use pictures as passwords. In this paper, I conduct a comprehensive survey of the existing graphical password techniques. I classify these techniques into two categories: recognition-based and recall-based approaches. I discuss the strengths and limitations of each method and point out the future research directions in this area. I also developed three new techniques against the common problem exists in the present graphical password techniques. In this thesis, the scheme of each new technique will be proposed; the advantages of each technique will be discussed; and the future work will be anticipated."} | 22 | +{"work_id": 4220990555, "title": "Robust federated learning with attack-adaptive aggregation", "abstract": "HKUST Electronic Theses Robust federated learning with attack-adaptive aggregation by Wan Ching Pui thesis 2021 1 online resource (x, 50 pages) : illustrations (chiefly color) In this thesis, we discuss a data-driven approach to defend adversarial attacks in federated learning.\u2026Read more \u203a"} | ||
| 24 | −{"work_id": 4400662300, "title": "Collaborative Networks: Integrating Blockchain for Enhanced Trust and Transparency", "abstract": "Blockchain technology has become a disruptive force in many different industries because it provides unparalleled security, transparency, and efficiency. In the context of cooperative networks, Blockchain's decentralized architecture provides a solid basis for enhancing trust, streamlining processes, and fostering innovation. This chapter examines how Blockchain can be used with cooperative networks and how it could fundamentally alter the way entities interact and communicate. Important areas of focus include Blockchain's technological foundations, applications in collaborative environments, and case studies that highlight its impacts. By examining the challenges and opportunities presented by this convergence, we intend to provide a comprehensive understanding of how Blockchain can revolutionize cooperative ecosystems. The field of scholarly communication is undergoing a significant transition due to technological advancements. This chapter looks at how blockchain technology and collaborative networks could alter contemporary living. We examine the basic shortcomings of the existing centralized model and discuss how the core concepts of immutability, transparency, and decentralization found in Blockchain technology can assist in resolving these problems. This paper explores the relationship between collaborative networks and blockchain technology. We start by outlining the fundamental ideas behind Blockchain technology and how it has developed. The use of Blockchain is then examined in a variety of cooperative settings, with its advantages and possible drawbacks discussed. We demonstrate the real-world effects of Blockchain-enabled collaborative networks across various industries with a number of case studies."} | 23 | +{"work_id": 4414891672, "title": "Differential privacy for medical deep learning: methods, tradeoffs, and deployment implications", "abstract": "Differential privacy (DP) is a prominent technique for protecting sensitive patient data in medical deep learning (DL), yet deploying it without compromising clinical utility or equity remains challenging. This scoping review synthesizes applications of DP in medical DL across centralized and federated settings. A structured search identified 74 eligible studies published through March 2025. Across modalities and tasks, DP, especially via DP-SGD, can maintain clinically acceptable performance under moderate privacy budgets (\u03f5 \u2248 10), particularly in imaging. However, strict privacy (\u03f5 \u2248 1) often leads to substantial accuracy loss, with amplified degradation in smaller or heterogeneous datasets. Only a minority of studies evaluate fairness, and several report that DP can widen subgroup performance gaps. Beyond DP-SGD, alternative mechanisms, including generative modeling, local DP, and hybrid federated designs, are emerging, but reporting of privacy parameters remains inconsistent. We identify key gaps in fairness auditing and standardization, and outline priorities for equitable, clinically robust privacy-preserving DL."} | ||
| 25 | −{"work_id": 7154488736, "title": "Predicting Mental Health Challenges Among University Students Using a Federated CNN-BiLSTM-Attention Framework", "abstract": "Early detection and effective management of rising mental health issues among university students is a major challenge. This work proposes Fed-CBA, a novel deep learning framework combining CNN, BiLSTM, and Attention to predict future mental health risks. Fed-CBA integrates multiple data sources (LMS, EMA surveys, wearables, lifestyle data) and operates in a decentralized, privacy-preserving manner using FedAvg and differential privacy. It also provides explainable predictions through SHAP and LIME. Experimental results show that Fed-CBA outperforms DNN, CNN, and LSTM models, while also improving fairness (EOR) and interpretability. Overall, the framework enables early detection and supports personalized, equitable student mental health services."} | 24 | +{"work_id": 3016632787, "title": "Federated Learning With Differential Privacy: Algorithms and Performance Analysis", "abstract": "Federated learning (FL), as a type of distributed machine learning, is capable of significantly preserving clients\u2019 private data from being exposed to adversaries. Nevertheless, private information can still be divulged by analyzing uploaded parameters from clients, e.g., weights trained in deep neural networks. In this paper, to effectively prevent information leakage, we propose a novel framework based on the concept of differential privacy (DP), in which artificial noise is added to parameters at the clients\u2019 side before aggregating, namely, noising before model aggregation FL (NbAFL). First, we prove that the NbAFL can satisfy DP under distinct protection levels by properly adapting different variances of artificial noise. Then we develop a theoretical convergence bound on the loss function of the trained FL model in the NbAFL. Specifically, the theoretical bound reveals the following three key properties: 1) there is a tradeoff between convergence performance and privacy protection levels, i.e., better convergence performance leads to a lower protection level; 2) given a fixed privacy protection level, increasing the number$N$of overall clients participating in FL can improve the convergence performance; and 3) there is an optimal number aggregation times (communication rounds) in terms of convergence performance for a given protection level. Furthermore, we propose a$K$-client random scheduling strategy, where$K$($1\\leq K< N$) clients are randomly selected from the$N$overall clients to participate in each aggregation. We also develop a corresponding convergence bound for the loss function in this case and the$K$-client random scheduling strategy also retains the above three properties. Moreover, we find that there is an optimal$K$that achieves the best convergence performance at a fixed privacy level. Evaluations demonstrate that our theoretical results are consistent with simulations, thereby facilitating the design of various privacy-preserving FL algorithms with different tradeoff requirements on convergence performance and privacy levels."} | ||
| 26 | −{"work_id": 4380356557, "title": "Blockchain Technology in Renovating Healthcare", "abstract": "The positive effect of technology on health care is known as digital transformation. Wearable fitness technology, telemedicine, and AI-enabled medical devices are just a few examples of how health care is undergoing a digital transformation. These are intended to revolutionize the health-care industry by improving patient care, streamlining operations, and lowering costs. They are still facing significant challenges in patient data security and privacy, invoicing and payment processing, medical supply chain, and drug integrity. Blockchain technology can absolve the healthcare industry from facing these challenges; it can establish a blockchain of medical records. Blockchain is considered highly secure, transparent, and immune to hackers due to its digital encryption. This article examined the potential of blockchain technology to improve the security, privacy, and interoperability of healthcare data, and it suggested a few advanced uses of blockchain in the health care domain after a thorough analysis of the existing major challenges in the sector."} | 25 | +{"work_id": 7135198685, "title": "Breaking interprovincial data silos: how federated learning can unlock Canada's public health potential", "abstract": "Abstract This study introduces the first dual-enabler framework that jointly integrates federated learning (FL) with artificial intelligence (AI) governance to enable privacy-preserving, interoperable collaboration across jurisdictions. Unlike traditional FL approaches, the proposed framework embeds governance mechanisms such as differential privacy (DP), consent enforcement and fairness auditing into the model lifecycle, ensuring secure, compliant and equitable deployment. These conditions result in siloed datasets, impeding national-level advancements in diagnostics, public health and personalized medicine. The framework\u2019s novelty lies in its co-evolutionary design, where technical and governance layers iteratively inform one another to align with Canada\u2019s federated healthcare architecture. We evaluate this framework via three simulations: cancer detection, pandemic prediction, and rare disease analytics and a real-world test using the PathMNIST dataset. Each case incorporates embedded governance mechanisms such as DP, consent enforcement and fairness auditing. Results show that FL combined with governance structures improves equity, deployment speed and compliance. For instance, in synthetic-data simulations, FL improved recall for underrepresented phenotypes by 18%, reduced compliance-violation flags by 35% and accelerated deployment. In the PathMNIST benchmark with 107 000 labelled medical images, our federated model achieved 91.3% accuracy under a strict privacy budget. Together, these results demonstrate a clear and scalable pathway towards ethical, privacy-preserving and governance-aligned AI for Canada\u2019s healthcare ecosystem."} | ||
| 27 | −{"work_id": 3014084098, "title": "Contact Tracing Mobile Apps for COVID-19: Privacy Considerations and Related Trade-offs", "abstract": "Contact tracing is an essential tool for public health officials and local communities to fight the spread of novel diseases, such as for the COVID-19 pandemic. The Singaporean government just released a mobile phone app, TraceTogether, that is designed to assist health officials in tracking down exposures after an infected individual is identified. However, there are important privacy implications of the existence of such tracking apps. Here, we analyze some of those implications and discuss ways of ameliorating the privacy concerns without decreasing usefulness to public health. We hope in writing this document to ensure that privacy is a central feature of conversations surrounding mobile contact tracing apps and to encourage community efforts to develop alternative effective solutions with stronger privacy protection for the users. Importantly, though we discuss potential modifications, this document is not meant as a formal research paper, but instead is a response to some of the privacy characteristics of direct contact tracing apps like TraceTogether and an early-stage Request for Comments to the community. Date written: 2020-03-24 Minor correction: 2020-03-30"} | 26 | +{"work_id": 2781723315, "title": "Spectre Attacks: Exploiting Speculative Execution", "abstract": "Modern processors use branch prediction and speculative execution to maximize performance. For example, if the destination of a branch depends on a memory value that is in the process of being read, CPUs will try to guess the destination and attempt to execute ahead. When the memory value finally arrives, the CPU either discards or commits the speculative computation. Speculative logic is unfaithful in how it executes, can access the victim's memory and registers, and can perform operations with measurable side effects. Spectre attacks involve inducing a victim to speculatively perform operations that would not occur during correct program execution and which leak the victim's confidential information via a side channel to the adversary. This paper describes practical attacks that combine methodology from side channel attacks, fault attacks, and return-oriented programming that can read arbitrary memory from the victim's process. More broadly, the paper shows that speculative execution implementations violate the security assumptions underpinning numerous software security mechanisms, including operating system process separation, containerization, just-in-time (JIT) compilation, and countermeasures to cache timing and side-channel attacks. These attacks represent a serious threat to actual systems since vulnerable speculative execution capabilities are found in microprocessors from Intel, AMD, and ARM that are used in billions of devices. While makeshift processor-specific countermeasures are possible in some cases, sound solutions will require fixes to processor designs as well as updates to instruction set architectures (ISAs) to give hardware architects and software developers a common understanding as to what computation state CPU implementations are (and are not) permitted to leak."} | ||
| 28 | −{"work_id": 4412565294, "title": "A Survey of Machine Unlearning", "abstract": "Today, computer systems hold large amounts of personal data. Yet while such an abundance of data allows breakthroughs in AI, and especially machine learning, its existence can be a threat to user privacy, and it can weaken the bonds of trust between humans and AI. Recent regulations now require that, on request, private information about a user must be removed both from computer systems and from machine learning models\u2014this legislation is more colloquially called \u201cthe right to be forgotten.\u201d While removing data from back-end databases should be straightforward, it is not sufficient in the AI context as machine learning models often \u201cremember\u201d the old data. Contemporary adversarial attacks on trained models have proven that we can learn whether an instance or an attribute belonged to the training data. This phenomenon calls for a new paradigm, namely machine unlearning , to make machine learning models forget about particular data. It turns out that recent works on machine unlearning have not been able to completely solve the problem due to the lack of common frameworks and resources. Therefore, this article aspires to present a comprehensive examination of machine unlearning\u2019s concepts, designs, methods, and applications. Specifically, as a category collection of cutting-edge studies, the intention behind this article is to serve as a comprehensive resource for researchers and practitioners seeking an introduction to machine unlearning and its formulations, design criteria, removal requests, algorithms, and applications. In addition, we aim to highlight the key findings, current trends, and new research areas that have not yet featured the use of machine unlearning but could benefit greatly from it. We hope that this survey serves as a valuable resource for machine learning researchers and those seeking to innovate privacy technologies. Our resources are publicly available at https://github.com/tamlhp/awesome-machine-unlearning ."} | 27 | +{"work_id": 4392353733, "title": "A survey on large language model (LLM) security and privacy: The Good, The Bad, and The Ugly", "abstract": "Large Language Models (LLMs), such as ChatGPT and Bard, have revolutionized natural language understanding and generation. They possess deep language comprehension, human-like text generation capabilities, contextual awareness, and robust problem-solving skills, making them invaluable in various domains (e.g., search engines, customer support, translation). In the meantime, LLMs have also gained traction in the security community, revealing security vulnerabilities and showcasing their potential in security-related tasks. This paper explores the intersection of LLMs with security and privacy. Specifically, we investigate how LLMs positively impact security and privacy, potential risks and threats associated with their use, and inherent vulnerabilities within LLMs. Through a comprehensive literature review, the paper categorizes the papers into \u201cThe Good\u201d (beneficial LLM applications), \u201cThe Bad\u201d (offensive applications), and \u201cThe Ugly\u201d (vulnerabilities of LLMs and their defenses). We have some interesting findings. For example, LLMs have proven to enhance code security (code vulnerability detection) and data privacy (data confidentiality protection), outperforming traditional methods. However, they can also be harnessed for various attacks (particularly user-level attacks) due to their human-like reasoning abilities. We have identified areas that require further research efforts. For example, Research on model and parameter extraction attacks is limited and often theoretical, hindered by LLM parameter scale and confidentiality. Safe instruction tuning, a recent development, requires more exploration. We hope that our work can shed light on the LLMs\u2019 potential to both bolster and jeopardize cybersecurity."} | ||
| 29 | −{"work_id": 4320717855, "title": "Blockchain for the metaverse: A Review", "abstract": "Since Facebook officially changed its name to Meta in Oct. 2021, the metaverse has become a new norm of social networks and three-dimensional (3D) virtual worlds. The metaverse aims to bring 3D immersive and personalized experiences to users by leveraging many pertinent technologies. Despite great attention and benefits, a natural question in the metaverse is how to secure its users' digital content and data. In this regard, blockchain is a promising solution owing to its distinct features of decentralization, immutability, and transparency. To better understand the role of blockchain in the metaverse, we aim to provide an extensive survey on the applications of blockchain for the metaverse. We first present a preliminary to blockchain and the metaverse and highlight the motivations behind the use of blockchain for the metaverse. Next, we extensively discuss blockchain-based methods for the metaverse from technical perspectives, such as data acquisition, data storage, data sharing, data interoperability, and data privacy preservation. For each perspective, we first discuss the technical challenges of the metaverse and then highlight how blockchain can help. Moreover, we investigate the impact of blockchain on key-enabling technologies in the metaverse, including Internet-of-Things, digital twins, multi-sensory and immersive applications, artificial intelligence, and big data. We also present some major projects to showcase the role of blockchain in metaverse applications and services. Finally, we present some promising directions to drive further research innovations and developments toward the use of blockchain in the metaverse in the future."} | ||||
| 30 | −{"work_id": 7124450903, "title": "On the security and privacy of federated learning: A survey with attacks, defenses, frameworks, applications, and future directions", "abstract": "Federated Learning (FL) is an emerging distributed machine learning paradigm enabling multiple clients to train a global model collaboratively without sharing their raw data. While FL enhances data privacy by design, it remains vulnerable to various security and privacy threats. This survey provides a comprehensive overview of 203 papers regarding the state-of-the-art attacks and defense mechanisms developed to address these challenges, categorizing them into security-enhancing and privacy-preserving techniques. Security-enhancing methods aim to improve FL robustness against malicious behaviors such as byzantine attacks, poisoning, and Sybil attacks. At the same time, privacy-preserving techniques focus on protecting sensitive data through cryptographic approaches, differential privacy, and secure aggregation. We critically analyze the strengths and limitations of existing methods, highlight the trade-offs between privacy, security, and model performance, and discuss the implications of non-IID data distributions on the effectiveness of these defenses. Furthermore, we identify open research challenges and future directions, including the need for scalable, adaptive, and energy-efficient solutions operating in dynamic and heterogeneous FL environments. Our survey aims to guide researchers and practitioners in developing robust and privacy-preserving FL systems, fostering advancements safeguarding collaborative learning frameworks\u2019 integrity and confidentiality."} | ||||
| 31 | −{"work_id": 7154469464, "title": "Cryptanalysis and Improvement of a Video Cryptosystem via Chaos and S-Box", "abstract": "In recent years, chaos-based multimedia cryptosystems have gained prominence due to their nonlinear properties, such as sensitivity to initial conditions and long-term unpredictability, which parallel the cryptographic requirements of confusion and diffusion. However, many such systems lack standardization and deviate from secure design principles, resulting in practical vulnerabilities. This article presents a comprehensive cryptanalysis of a widely cited video cryptosystem. The target system combines S-box substitution\u2014derived from either a 12D chaotic map or the Ikeda delay differential equation (DDE)\u2014with a Cipher Block Chaining (CBC) diffusion scheme. Through an analysis of the encryption structure, fundamental design defects are identified. Specifically, the CBC diffusion mechanism lacks key dependence, and the system exhibits an excessive reliance on fixed, publicly exposed S-boxes. These vulnerabilities are demonstrated through chosen-plaintext attacks, known-plaintext attacks, and chosen-ciphertext attacks. Experimental results confirm that the S-box can be fully reconstructed, thereby facilitating the complete decryption of video content in the absence of the secret key. Beyond exposing vulnerabilities, this study offers constructive contributions by proposing six concrete improvement strategies, including dynamic key generation, structural enhancement, and dynamic S-box indexing. This work provides practical suggestions for designing secure chaos-based multimedia cryptosystems, offering valuable references for future research and promoting the development of efficient encryption systems."} | ||||
| 32 | {"work_id": 2309315845, "title": "Human-centric training and assessment for cyber situation awareness", "abstract": "\"Cyber attacks have been increasing significantly in both number and complexity, prompting the need for better training of cyber defense analysts. One issue with existing cyber security training is that it relies mostly on lecture-style instructions without much hand- on experience. Thus, need a training solution that provides a realistic, human-in-the-loop environment for cyber analysts to explore, collaborate, and interact for effective learning. Situation Awareness (SA) means the comprehension and perception of environmental elements with respect to time and space. Cyber Situation Awareness (CSA) is SA extended to the cyber domain. During CSA, the cyber analysts need to understand the meaning of the observations and be able to project the impact of the observations to the system. In this proposal, we describe a Cyber Situation Awareness training and assessment system with the purpose of teaching and measuring individual and team cyber situation awareness within the cyber defense context, as well as incorporating various technologies to enhance the cyber analysts\u2019 learning process. To conduct effective cyber security training, it becomes essential to design realistic exercise lesson plans. Accurate identification of experts\u2019 cognitive processes through Cognitive Task Analysis can be adapted into training materials to teach novice cyber analysts (or trainees in this proposal) how to think and act like an expert during defense. In order to solve the information overload challenge faced by trainees, we identify and design watch list statistics, which allows trainees to tailor their own watch list statistics and triggering thresh- old conditions in order to recognize cyber attacks faster. The speed with which a trainee can recognize, analyze, and respond to attacks is critical as it will limit the damage and lower the cost of recovery. Therefore, we evaluate trainees\u2019 performance based on their response time comparing with estimated attack ground truth timeline. We also devise scoring algorithms to calculate trainees\u2019 performance scores according to the weighted functions combing all performance metrics. Then, as training is an iterative process, the assessment component not only assesses the knowledge gained by the cyber analysts, but also adjusts the difficulty of training lessons accordingly based on trainees\u2019 performance. Nevertheless, quantifying difficulty level of training lesson scenario is an important but difficult task. While standard techniques exist for measuring the relative difficulty to exploit individual vulnerability, it is challenging to answer the fundamental question whether one scenario containing several vulnerabilities is more difficult than another one. Based on causal relationships between vulnerabilities in attack graph, we apply Bayesian Reasoning to aggregate individual vulnerabilities into a probabilistic value representing the attackers\u2019 success likelihood to achieve the attack goal. Based on the quantified probability of achieving attack goal, the lesson\u2019s difficulty-level is categorized accordingly. Furthermore, complex and dynamically changing task such as cyber defense often requires the effective coordination of a team of cyber analysts. Cyber analysts need to work collaboratively as a team at different levels and different parts of system. Each team member collects data, generates its own awareness for the cyber situation, and shares with other team members to get the comprehensive understanding of the overall situation for the decision making purpose. Since each team member may have his/her own personal expertise knowledge, experience, and opinions, it is hard for the entire team to make consensus decision when having conflicting judgments. Considering human cyber analysts tend to use ambiguous linguistic language to express their own cyber situation awareness during the team discussion process, we design a fuzzy set based method to facilitate cyber analysts to quantify their thoughts and make consensus decision that is most acceptable by the entire team. Finally, we investigate real-time purpose sensors based information fusion for Advanced Persistent Threats (APTs) detection. As human cyber analysts have to examine huge amount of data such as system logs, configuration files, traffic logs, IDS log, and audit logs in order to identify potential threats. Thus, they would be soon overwhelmed by tremendous xvi data and forced to ignore potentially significant evidences introducing errors in the detection process. Furthermore, cyber security attack and anomaly detection techniques suffer from their reliance on known malicious signatures or unusual conditions that warrant further investigation. The use of signature-based detection cannot effectively eliminate false negatives when dealing with Advanced Persistent Threats, since the financial resources and time available to APTs allows the use of previously unknown \u2018zero-day\u2019 attack vectors. The designed information fusion system reduces an operator burden to handle false positives and reduces time to detection while using noisy/high false positive inputs. We design and develop hostand network- based purpose sensors and places them within the network and individual hosts to provide real-time purpose and correlation inputs and then use this information combined with network-specific knowledge to create a dynamic set of event threads that, when touched by a given alert received from traditional intrusion detection systems (IDSs) such as Snort and OSSEC, allows the immediate identification of the context surrounding the alert and thus the automatic calculation of the alert\u2019s legitimacy and severity.\""} | 28 | {"work_id": 2309315845, "title": "Human-centric training and assessment for cyber situation awareness", "abstract": "\"Cyber attacks have been increasing significantly in both number and complexity, prompting the need for better training of cyber defense analysts. One issue with existing cyber security training is that it relies mostly on lecture-style instructions without much hand- on experience. Thus, need a training solution that provides a realistic, human-in-the-loop environment for cyber analysts to explore, collaborate, and interact for effective learning. Situation Awareness (SA) means the comprehension and perception of environmental elements with respect to time and space. Cyber Situation Awareness (CSA) is SA extended to the cyber domain. During CSA, the cyber analysts need to understand the meaning of the observations and be able to project the impact of the observations to the system. In this proposal, we describe a Cyber Situation Awareness training and assessment system with the purpose of teaching and measuring individual and team cyber situation awareness within the cyber defense context, as well as incorporating various technologies to enhance the cyber analysts\u2019 learning process. To conduct effective cyber security training, it becomes essential to design realistic exercise lesson plans. Accurate identification of experts\u2019 cognitive processes through Cognitive Task Analysis can be adapted into training materials to teach novice cyber analysts (or trainees in this proposal) how to think and act like an expert during defense. In order to solve the information overload challenge faced by trainees, we identify and design watch list statistics, which allows trainees to tailor their own watch list statistics and triggering thresh- old conditions in order to recognize cyber attacks faster. The speed with which a trainee can recognize, analyze, and respond to attacks is critical as it will limit the damage and lower the cost of recovery. Therefore, we evaluate trainees\u2019 performance based on their response time comparing with estimated attack ground truth timeline. We also devise scoring algorithms to calculate trainees\u2019 performance scores according to the weighted functions combing all performance metrics. Then, as training is an iterative process, the assessment component not only assesses the knowledge gained by the cyber analysts, but also adjusts the difficulty of training lessons accordingly based on trainees\u2019 performance. Nevertheless, quantifying difficulty level of training lesson scenario is an important but difficult task. While standard techniques exist for measuring the relative difficulty to exploit individual vulnerability, it is challenging to answer the fundamental question whether one scenario containing several vulnerabilities is more difficult than another one. Based on causal relationships between vulnerabilities in attack graph, we apply Bayesian Reasoning to aggregate individual vulnerabilities into a probabilistic value representing the attackers\u2019 success likelihood to achieve the attack goal. Based on the quantified probability of achieving attack goal, the lesson\u2019s difficulty-level is categorized accordingly. Furthermore, complex and dynamically changing task such as cyber defense often requires the effective coordination of a team of cyber analysts. Cyber analysts need to work collaboratively as a team at different levels and different parts of system. Each team member collects data, generates its own awareness for the cyber situation, and shares with other team members to get the comprehensive understanding of the overall situation for the decision making purpose. Since each team member may have his/her own personal expertise knowledge, experience, and opinions, it is hard for the entire team to make consensus decision when having conflicting judgments. Considering human cyber analysts tend to use ambiguous linguistic language to express their own cyber situation awareness during the team discussion process, we design a fuzzy set based method to facilitate cyber analysts to quantify their thoughts and make consensus decision that is most acceptable by the entire team. Finally, we investigate real-time purpose sensors based information fusion for Advanced Persistent Threats (APTs) detection. As human cyber analysts have to examine huge amount of data such as system logs, configuration files, traffic logs, IDS log, and audit logs in order to identify potential threats. Thus, they would be soon overwhelmed by tremendous xvi data and forced to ignore potentially significant evidences introducing errors in the detection process. Furthermore, cyber security attack and anomaly detection techniques suffer from their reliance on known malicious signatures or unusual conditions that warrant further investigation. The use of signature-based detection cannot effectively eliminate false negatives when dealing with Advanced Persistent Threats, since the financial resources and time available to APTs allows the use of previously unknown \u2018zero-day\u2019 attack vectors. The designed information fusion system reduces an operator burden to handle false positives and reduces time to detection while using noisy/high false positive inputs. We design and develop hostand network- based purpose sensors and places them within the network and individual hosts to provide real-time purpose and correlation inputs and then use this information combined with network-specific knowledge to create a dynamic set of event threads that, when touched by a given alert received from traditional intrusion detection systems (IDSs) such as Snort and OSSEC, allows the immediate identification of the context surrounding the alert and thus the automatic calculation of the alert\u2019s legitimacy and severity.\""} | ||
| 29 | +{"work_id": 1550000763, "title": "Crying Wolf: An Empirical Study of SSL Warning Effectiveness", "abstract": "Web users are shown an invalid certificate warning when their browser cannot validate the identity of the websites they are visiting. While these warnings often appear in benign situations, they can also signal a man-in-the-middle attack. We conducted a survey of over 400 Internet users to examine their reactions to and understanding of current SSL warnings. We then designed two new warnings using warnings science principles and lessons learned from the survey. We evaluated warnings used in three popular web browsers and our two warnings in a 100- participant, between-subjects laboratory study. Our warnings performed significantly better than existing warnings, but far too many participants exhibited dangerous behavior in all warning conditions. Our results suggest that, while warnings can be improved, a better approach may be to minimize the use of SSL warnings altogether by blocking users from making unsafe connections and eliminating warnings in benign situations."} | ||||
| 33 | {"work_id": 2606010969, "title": "Blockchains for Business Process Management - Challenges and Opportunities", "abstract": "Blockchain technology offers a sizable promise to rethink the way interorganizational business processes are managed because of its potential to realize execution without a central party serving as a single point of trust (and failure). To stimulate research on this promise and the limits thereof, in this article, we outline the challenges and opportunities of blockchain for business process management (BPM). We first reflect how blockchains could be used in the context of the established BPM lifecycle and second how they might become relevant beyond. We conclude our discourse with a summary of seven research directions for investigating the application of blockchain technology in the context of BPM."} | 30 | {"work_id": 2606010969, "title": "Blockchains for Business Process Management - Challenges and Opportunities", "abstract": "Blockchain technology offers a sizable promise to rethink the way interorganizational business processes are managed because of its potential to realize execution without a central party serving as a single point of trust (and failure). To stimulate research on this promise and the limits thereof, in this article, we outline the challenges and opportunities of blockchain for business process management (BPM). We first reflect how blockchains could be used in the context of the established BPM lifecycle and second how they might become relevant beyond. We conclude our discourse with a summary of seven research directions for investigating the application of blockchain technology in the context of BPM."} | ||
| 34 | −{"work_id": 3122636688, "title": "Blockchain Disruption and Smart Contracts", "abstract": "Blockchain technology provides decentralized consensus and potentially enlarges the contracting space through smart contracts. Meanwhile, generating decentralized consensus entails distributing information that necessarily alters the informational environment. We analyze how decentralization relates to consensus quality and how the quintessential features of blockchain remold the landscape of competition. Smart contracts can mitigate informational asymmetry and improve welfare and consumer surplus through enhanced entry and competition, yet distributing information during consensus generation may encourage greater collusion. In general, blockchains sustain market equilibria with a wider range of economic outcomes. We further discuss the implications for antitrust policies targeted at blockchain applications. Received May 31, 2017; editorial decision May 29, 2018 by Editor Itay Goldstein."} | 31 | +{"work_id": 44936433, "title": "How to play any mental game, or a completeness theorem for protocols with honest majority", "abstract": "research-article Share on How to play any mental game, or a completeness theorem for protocols with honest majority Authors: Oded Goldreich Technion TechnionView Profile , Silvio Micali MIT MITView Profile , Avi Wigderson Hebrew University Hebrew UniversityView Profile Authors Info & Claims Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio MicaliOctober 2019 Pages 307\u2013328https://doi.org/10.1145/3335741.3335755Published:04 October 2019Publication History 57citation435DownloadsMetricsTotal Citations57Total Downloads435Last 12 Months42Last 6 weeks11 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access"} | ||
| 35 | −{"work_id": 2912213068, "title": "Federated Machine Learning", "abstract": "Today\u2019s artificial intelligence still faces two major challenges. One is that, in most industries, data exists in the form of isolated islands. The other is the strengthening of data privacy and security. We propose a possible solution to these challenges: secure federated learning. Beyond the federated-learning framework first proposed by Google in 2016, we introduce a comprehensive secure federated-learning framework, which includes horizontal federated learning, vertical federated learning, and federated transfer learning. We provide definitions, architectures, and applications for the federated-learning framework, and provide a comprehensive survey of existing works on this subject. In addition, we propose building data networks among organizations based on federated mechanisms as an effective solution to allowing knowledge to be shared without compromising user privacy."} | ||||
| 36 | {"work_id": 3188417193, "title": "Machine learning for offensive cyber operations", "abstract": "Cybersecurity with machine learning has received widespread attention in education, research, and innovation in both the private and public sectors. Unfortunately, while essential for strong cyber security, offensive cyber operations with machine learning have seen significantly less innovation, at least in open academic literature. This thesis's contribution to the field of offensive cyber operations with machine learning can naturally be divided into the following: 1. Algorithmic cryptanalysis with machine learning 2. SQL injection with machine learning The historical cipher Enigma's plugboard is shown to be susceptible to an attack powered by the machine learning technique Genetic Algorithms, being broken far faster than any earlier attack. Modern ciphers are naturally more robust than historical ciphers. The cryptographic algorithm ASCON is still secure, but the novel machine learning technique, The Phantom Gradient Attack, is shown to attack many of its subfunctions successfully. OWASP's top 10 had SQL injections as the number one web vulnerability in 2017; in 2021, it was number three. This thesis highlights the possibility of automated SQL injection exploitation and identification with reinforcement learning for accelerated penetration testing. The reinforcement learning agent can exploit all 5 SQL injection archetypes, distinguish between them, and determine whether or not the website is vulnerable."} | 32 | {"work_id": 3188417193, "title": "Machine learning for offensive cyber operations", "abstract": "Cybersecurity with machine learning has received widespread attention in education, research, and innovation in both the private and public sectors. Unfortunately, while essential for strong cyber security, offensive cyber operations with machine learning have seen significantly less innovation, at least in open academic literature. This thesis's contribution to the field of offensive cyber operations with machine learning can naturally be divided into the following: 1. Algorithmic cryptanalysis with machine learning 2. SQL injection with machine learning The historical cipher Enigma's plugboard is shown to be susceptible to an attack powered by the machine learning technique Genetic Algorithms, being broken far faster than any earlier attack. Modern ciphers are naturally more robust than historical ciphers. The cryptographic algorithm ASCON is still secure, but the novel machine learning technique, The Phantom Gradient Attack, is shown to attack many of its subfunctions successfully. OWASP's top 10 had SQL injections as the number one web vulnerability in 2017; in 2021, it was number three. This thesis highlights the possibility of automated SQL injection exploitation and identification with reinforcement learning for accelerated penetration testing. The reinforcement learning agent can exploit all 5 SQL injection archetypes, distinguish between them, and determine whether or not the website is vulnerable."} | ||
| 37 | {"work_id": 4396670109, "title": "Advanced Digital Data Processing Using Cloud Cryptography", "abstract": "Cloud computing uses the internet instead of discs or memory. Computing services include servers, databases, networks, and programmes. The primary benefit of cloud computing is easy and cheap data backup and access from anywhere. Cloud storage doesn't store consumer data, raising safety concerns. Cloud backup and storage users may not know how data is transported. The user is unaware a third party is secretly accessing their data. For safety, we offer numerous encryption algorithms. This book chapter covered cryptography and cloud computing."} | 33 | {"work_id": 4396670109, "title": "Advanced Digital Data Processing Using Cloud Cryptography", "abstract": "Cloud computing uses the internet instead of discs or memory. Computing services include servers, databases, networks, and programmes. The primary benefit of cloud computing is easy and cheap data backup and access from anywhere. Cloud storage doesn't store consumer data, raising safety concerns. Cloud backup and storage users may not know how data is transported. The user is unaware a third party is secretly accessing their data. For safety, we offer numerous encryption algorithms. This book chapter covered cryptography and cloud computing."} | ||
| 38 | {"work_id": 4286110439, "title": "\u00bbOhne die geht\u2019s nicht\u00ab Zur Rolle von Apple und Google bei der Corona-Warn-App", "abstract": "Die COVID-19-Pandemie ist eine gesellschaftliche Gesundheitskrise, in der erstmals weltweit in gro\u00dfem Stil populationsbasierte Technologien der Kontaktnachverfolgung (sog.Contact-Tracing-bzw. Pandemie-Apps) zur Pandemiebek\u00e4mpfung eingesetzt werden.Mit ihnen ist das Ziel verbunden, die Ausbreitung des Virus zu verhindern, indem Begegnungen aufgezeichnet und Warnungen \u00fcber m\u00f6gliche Risikokontakte verschickt werden.Hierzu \u00fcbersetzen Apps wie die von der Bundesregierung gemeinsam mit dem Robert-Koch-Institut (RKI) herausgegebene \u00bbCorona-Warn-App\u00ab (CWA) mithilfe des Smartphones Kontakte \u00fcber Bluetooth-Signale in Daten und berechnen mit diesen einen Score f\u00fcr das Risiko einer \u00dcbertragung (sog.\u00bbRisk-Score\u00ab).Dabei ist zu beachten, dass die Contact-Tracing-Apps aus jeweils nationalen Apps als \u00bbClients\u00ab auf dem jeweiligen mobilen Endger\u00e4t und den zentralen Servern bestehen.Diese interagieren \u00fcber die von Google und Apple bereitgestellte Schnittstelle, das Google Apple Exposure Notification Framework (GA-ENF), und erm\u00f6glichen so die bluetoothbasierte Kontaktnachverfolgung (Dix 2020, S. 780).Die gemeinsame Arbeit f\u00fcr die digitale Pandemiebek\u00e4mpfung der beiden Konkurrenzunternehmen Apple und Google stie\u00df weltweit auf Begeisterung und Verwunderung (Sharon 2020, S. 4).Zugleich lassen sich Google und Apple mit Philipp Staab (2019) als zwei Leitunternehmen des digitalen Kapitalismus begreifen, die sich durch ihr gro\u00dfes \u00f6konomisches Kapital auszeichnen und sich als Kontrolleure bzw.Betreiber der Smartphonebetriebssysteme Android und iOS als Metaplattformen etablieren konnten.In einer Stellungnahme zum Contact-Tracing betont Apple die Motivation f\u00fcr die Zusammenarbeit mit Google wie folgt:"} | 34 | {"work_id": 4286110439, "title": "\u00bbOhne die geht\u2019s nicht\u00ab Zur Rolle von Apple und Google bei der Corona-Warn-App", "abstract": "Die COVID-19-Pandemie ist eine gesellschaftliche Gesundheitskrise, in der erstmals weltweit in gro\u00dfem Stil populationsbasierte Technologien der Kontaktnachverfolgung (sog.Contact-Tracing-bzw. Pandemie-Apps) zur Pandemiebek\u00e4mpfung eingesetzt werden.Mit ihnen ist das Ziel verbunden, die Ausbreitung des Virus zu verhindern, indem Begegnungen aufgezeichnet und Warnungen \u00fcber m\u00f6gliche Risikokontakte verschickt werden.Hierzu \u00fcbersetzen Apps wie die von der Bundesregierung gemeinsam mit dem Robert-Koch-Institut (RKI) herausgegebene \u00bbCorona-Warn-App\u00ab (CWA) mithilfe des Smartphones Kontakte \u00fcber Bluetooth-Signale in Daten und berechnen mit diesen einen Score f\u00fcr das Risiko einer \u00dcbertragung (sog.\u00bbRisk-Score\u00ab).Dabei ist zu beachten, dass die Contact-Tracing-Apps aus jeweils nationalen Apps als \u00bbClients\u00ab auf dem jeweiligen mobilen Endger\u00e4t und den zentralen Servern bestehen.Diese interagieren \u00fcber die von Google und Apple bereitgestellte Schnittstelle, das Google Apple Exposure Notification Framework (GA-ENF), und erm\u00f6glichen so die bluetoothbasierte Kontaktnachverfolgung (Dix 2020, S. 780).Die gemeinsame Arbeit f\u00fcr die digitale Pandemiebek\u00e4mpfung der beiden Konkurrenzunternehmen Apple und Google stie\u00df weltweit auf Begeisterung und Verwunderung (Sharon 2020, S. 4).Zugleich lassen sich Google und Apple mit Philipp Staab (2019) als zwei Leitunternehmen des digitalen Kapitalismus begreifen, die sich durch ihr gro\u00dfes \u00f6konomisches Kapital auszeichnen und sich als Kontrolleure bzw.Betreiber der Smartphonebetriebssysteme Android und iOS als Metaplattformen etablieren konnten.In einer Stellungnahme zum Contact-Tracing betont Apple die Motivation f\u00fcr die Zusammenarbeit mit Google wie folgt:"} | ||
| 39 | {"work_id": 3018464563, "title": "FedHealth: A Federated Transfer Learning Framework for Wearable Healthcare", "abstract": "With the rapid development of computing technology, wearable devices make it easy to get access to people's health information. Smart healthcare achieves great success by training machine learning models on a large quantity of user personal data. However, there are two critical challenges. First, user data often exist in the form of isolated islands, making it difficult to perform aggregation without compromising privacy security. Second, the models trained on the cloud fail on personalization. In this article, we propose FedHealth, the first federated transfer learning framework for wearable healthcare to tackle these challenges. FedHealth performs data aggregation through federated learning, and then builds relatively personalized models by transfer learning. Wearable activity recognition experiments and real Parkinson's disease auxiliary diagnosis application have evaluated that FedHealth is able to achieve accurate and personalized healthcare without compromising privacy and security. FedHealth is general and extensible in many healthcare applications."} | 35 | {"work_id": 3018464563, "title": "FedHealth: A Federated Transfer Learning Framework for Wearable Healthcare", "abstract": "With the rapid development of computing technology, wearable devices make it easy to get access to people's health information. Smart healthcare achieves great success by training machine learning models on a large quantity of user personal data. However, there are two critical challenges. First, user data often exist in the form of isolated islands, making it difficult to perform aggregation without compromising privacy security. Second, the models trained on the cloud fail on personalization. In this article, we propose FedHealth, the first federated transfer learning framework for wearable healthcare to tackle these challenges. FedHealth performs data aggregation through federated learning, and then builds relatively personalized models by transfer learning. Wearable activity recognition experiments and real Parkinson's disease auxiliary diagnosis application have evaluated that FedHealth is able to achieve accurate and personalized healthcare without compromising privacy and security. FedHealth is general and extensible in many healthcare applications."} | ||
| 36 | +{"work_id": 2946416612, "title": "Inadvertently Making Cyber Criminals Rich: A Comprehensive Study of Cryptojacking Campaigns at Internet Scale", "abstract": "Cryptojacking, a phenomenon also known as drive-by cryptomining, involves stealing computing power from others to be used in illicit cryptomining. While first observed as host-based infections with low activity, the release of an efficient browser-based cryptomining application -- as introduced by Coinhive in 2017 -- has skyrocketed cryptojacking activity in recent years. This novel method of monetizing Web activity attracted both website owners and cybercriminals seeking new methods to profit from. Website owners installed a cryptominer on their domains, while cybercriminals deployed cryptominers in large campaigns spread over numerous domains. Several studies developed detection methods to identify these browser-based cryptominers on websites, but none of these studies focused on the extent and coordination of campaigns deployed by adversaries. Furthermore, the prevalence of cryptojacking on websites is not well estimated yet and the potentially largest attack vector -- a man-in-the-middle attack -- has never been researched before. In this thesis, we perform multiple large studies on cryptojacking to fill these gaps. After crawling a random sample of 49M domains, 20% of the Internet, we conclude that cryptojacking is present on 0.011% of all domains and that adult content is the most prevalent category of websites affected. We show that this percentage is significantly larger in the popular part of the Internet. This led to the conclusion that surveying solely domains listed in the Alexa Top 1M to estimate cryptojacking prevalence results in an overestimation of the problem. Furthermore, we show that infection rates on different Top Level Domains (TLDs) differ widely, as the Russian zone is home to a disproportionate number of cryptojacking domains, while other large TLDs -- such as .com -- show a significantly lower number of infections. In another crawl, we have identified 204 cryptojacking campaigns on websites, an order of magnitude more than previous work, which indicates that the extent of these campaigns is heavily underestimated. The results of the two crawls combined reveal that 48% of all cryptojacking activity on websites is organized. The identified campaigns ranged in sizes from only 5 to 987 websites and we discovered that cybercriminals have chosen third-party software -- such as WordPress and Drupal -- as their method of choice for spreading cryptojacking infections efficiently. With a novel method of using NetFlow data recorded in a Tier 1 network, we estimated the popularity of mining applications, which showed that while Coinhive has a larger installed base, CoinImp WebSocket proxies were digesting significantly more traffic in the second half of 2018. We have reported about a new attack vector that drastically overshadows all other cryptojacking activity. Through a firmware vulnerability in MikroTik routers, cybercriminals are able to rewrite outgoing user traffic and embed cryptomining code in every outgoing Web connection. Thus, every Web page visited by any user behind an infected router would mine to profit the adversaries. Based on the aforementioned NetFlow data, weekly third-party crawls and network telescope traffic, we were able to follow their activities over a period of 10 months. We report on the modus operandi and coordinating infrastructure of the perpetrators, which were during this period in control of up to 1.4M routers, which is approximately 70% of all MikroTik devices deployed in the world. During the peak of this attack, more than 440K routers were infected concurrently. We have discovered that half of the infected routers are patched within 18 days after compromise, but 30% of the infections last longer than 50 days. Additionally, we observed different levels of sophistication among adversaries, ranging from individual installations to campaigns involving large numbers of routers. The combination of datasets allowed us to link tens of seemingly different infections to one actor. Our analysis of cryptojacking with a focus on organized campaigns has shown that cybercriminals have successfully discovered a new method for monetary gain. With the discontinuation of Coinhive due to decreased Monero prices in March 2019, the cryptojacking landscape has changed enormously, and we are curious who will fill this power vacuum. As browser-based mining is not anywhere near as profitable as it was in early 2018, we believe that singular cryptojacking activity -- by individual website owners -- will decrease. However, we expect adversaries to find possibilities of deploying cryptojacking at an even larger scale to still be profitable. This stresses the importance of researching campaigns, as the reuse of techniques, tactics and procedures in deploying them provides an effective angle to detect and mitigate these malicious activities. With prices decreasing throughout 2018, one would expect that this problem will eventually solve itself. Apart from the discontinuation of Coinhive, there is no clear indication that this is the case, as Monero prices have started to recover in the first months of 2019. If this trend continues, we expect to experience another outbreak of large cryptojacking campaigns, as robust defenses are still not widely implemented."} | ||||
| 40 | {"work_id": 2799796316, "title": "Privacy\u2010Aware Multidimensional Mobile Service Quality Prediction and Recommendation in Distributed Fog Environment", "abstract": "With the ever\u2010increasing popularity of mobile computing technology, a wide range of computational resources or services (e.g., movies, food, and places of interest) are migrating to the mobile infrastructure or devices (e.g., mobile phones, PDA, and smart watches), imposing heavy burdens on the service selection decisions of users. In this situation, service recommendation has become one of the promising ways to alleviate such burdens. In general, the service usage data used to make service recommendation are produced by various mobile devices and collected by distributed edge platforms, which leads to potential leakage of user privacy during the subsequent cross\u2010platform data collaboration and service recommendation process. Locality\u2010Sensitive Hashing (LSH) technique has recently been introduced to realize the privacy\u2010preserving distributed service recommendation. However, existing LSH\u2010based recommendation approaches often consider only one quality dimension of services, without considering the multidimensional recommendation scenarios that are more complex but more common. In view of this drawback, we improve the traditional LSH and put forward a novel LSH\u2010based service recommendation approach named SerRecmulti-qos, to protect users\u2019 privacy over multiple quality dimensions during the distributed mobile service recommendation process."} | 37 | {"work_id": 2799796316, "title": "Privacy\u2010Aware Multidimensional Mobile Service Quality Prediction and Recommendation in Distributed Fog Environment", "abstract": "With the ever\u2010increasing popularity of mobile computing technology, a wide range of computational resources or services (e.g., movies, food, and places of interest) are migrating to the mobile infrastructure or devices (e.g., mobile phones, PDA, and smart watches), imposing heavy burdens on the service selection decisions of users. In this situation, service recommendation has become one of the promising ways to alleviate such burdens. In general, the service usage data used to make service recommendation are produced by various mobile devices and collected by distributed edge platforms, which leads to potential leakage of user privacy during the subsequent cross\u2010platform data collaboration and service recommendation process. Locality\u2010Sensitive Hashing (LSH) technique has recently been introduced to realize the privacy\u2010preserving distributed service recommendation. However, existing LSH\u2010based recommendation approaches often consider only one quality dimension of services, without considering the multidimensional recommendation scenarios that are more complex but more common. In view of this drawback, we improve the traditional LSH and put forward a novel LSH\u2010based service recommendation approach named SerRecmulti-qos, to protect users\u2019 privacy over multiple quality dimensions during the distributed mobile service recommendation process."} | ||
| 41 | {"work_id": 2965761488, "title": "The rise of blockchain technology in agriculture and food supply chains", "abstract": "Blockchain is an emerging digital technology allowing ubiquitous financial transactions among distributed untrusted parties, without the need of intermediaries such as banks. This article examines the impact of blockchain technology in agriculture and food supply chain, presents existing ongoing projects and initiatives, and discusses overall implications, challenges and potential, with a critical view over the maturity of these projects. Our findings indicate that blockchain is a promising technology towards a transparent supply chain of food, with many ongoing initiatives in various food products and food-related issues, but many barriers and challenges still exist, which hinder its wider popularity among farmers and systems. These challenges involve technical aspects, education, policies and regulatory frameworks."} | 38 | {"work_id": 2965761488, "title": "The rise of blockchain technology in agriculture and food supply chains", "abstract": "Blockchain is an emerging digital technology allowing ubiquitous financial transactions among distributed untrusted parties, without the need of intermediaries such as banks. This article examines the impact of blockchain technology in agriculture and food supply chain, presents existing ongoing projects and initiatives, and discusses overall implications, challenges and potential, with a critical view over the maturity of these projects. Our findings indicate that blockchain is a promising technology towards a transparent supply chain of food, with many ongoing initiatives in various food products and food-related issues, but many barriers and challenges still exist, which hinder its wider popularity among farmers and systems. These challenges involve technical aspects, education, policies and regulatory frameworks."} | ||
| 42 | {"work_id": 4412162472, "title": "A scoping review of the governance of federated learning in healthcare", "abstract": "In healthcare, federated learning (FL) is emerging as a methodology to enable the analysis of large and disparate datasets while allowing custodians to retain sovereignty. While FL minimises data-sharing challenges, concerns surrounding ethics, privacy, maleficent use, and harm remain. These concerns can be managed by effective data governance. Data governance specifies procedural, relational, and structural mechanisms governing how data is captured, shared, and analysed, the resultant models and their use. However, limited insights exist on the optimal governance of this emerging technology. This study aims to develop a consolidated framework of the data governance mechanisms for FL in healthcare. A scoping review was performed, using deductive and inductive analysis of 39 articles. The framework includes twelve procedural, ten relational, and twelve structural mechanisms. The framework directs researchers to examine how to enact each mechanism and provides practitioners with insights into the mechanism to consider when governing FL."} | 39 | {"work_id": 4412162472, "title": "A scoping review of the governance of federated learning in healthcare", "abstract": "In healthcare, federated learning (FL) is emerging as a methodology to enable the analysis of large and disparate datasets while allowing custodians to retain sovereignty. While FL minimises data-sharing challenges, concerns surrounding ethics, privacy, maleficent use, and harm remain. These concerns can be managed by effective data governance. Data governance specifies procedural, relational, and structural mechanisms governing how data is captured, shared, and analysed, the resultant models and their use. However, limited insights exist on the optimal governance of this emerging technology. This study aims to develop a consolidated framework of the data governance mechanisms for FL in healthcare. A scoping review was performed, using deductive and inductive analysis of 39 articles. The framework includes twelve procedural, ten relational, and twelve structural mechanisms. The framework directs researchers to examine how to enact each mechanism and provides practitioners with insights into the mechanism to consider when governing FL."} | ||
| 43 | {"work_id": 4406636601, "title": "Challenges and opportunities for artificial intelligence in auditing: Evidence from the field", "abstract": "In this study we research the adoption of artificial intelligence (AI) in auditing by large public accounting firms, with emphasis on its challenges and opportunities. Some previous studies point to delayed adoption of AI in auditing due to regulations and the need for additional safeguards while others document extensive AI implementation. To address this dissensus, we conducted 22 interviews with experienced audit professionals. We find that \u201csimple AI\u201d technologies such as key data extraction from documents and optical character recognition are used widely in audits while \u201ccomplex AI\u201d tools are only being developed. We find RPA is used to automate repetitive administrative processes while the use of RPA for audit tasks is not as common. We also find that the main AI adoption challenges are related to transparency and explainability, AI bias, data privacy, robustness and reliability, fear of auditor overreliance on AI, and the need for AI guidance. We present ideas for addressing these challenges based on our research and lessons from other fields."} | 40 | {"work_id": 4406636601, "title": "Challenges and opportunities for artificial intelligence in auditing: Evidence from the field", "abstract": "In this study we research the adoption of artificial intelligence (AI) in auditing by large public accounting firms, with emphasis on its challenges and opportunities. Some previous studies point to delayed adoption of AI in auditing due to regulations and the need for additional safeguards while others document extensive AI implementation. To address this dissensus, we conducted 22 interviews with experienced audit professionals. We find that \u201csimple AI\u201d technologies such as key data extraction from documents and optical character recognition are used widely in audits while \u201ccomplex AI\u201d tools are only being developed. We find RPA is used to automate repetitive administrative processes while the use of RPA for audit tasks is not as common. We also find that the main AI adoption challenges are related to transparency and explainability, AI bias, data privacy, robustness and reliability, fear of auditor overreliance on AI, and the need for AI guidance. We present ideas for addressing these challenges based on our research and lessons from other fields."} | ||
| 44 | {"work_id": 2914735843, "title": "Blockchain-Enabled Smart Contracts: Architecture, Applications, and Future Trends", "abstract": "In recent years, the rapid development of cryptocurrencies and their underlying blockchain technology has revived Szabo\u2019s original idea of smart contracts, i.e., computer protocols that are designed to automatically facilitate, verify, and enforce the negotiation and implementation of digital contracts without central authorities. Smart contracts can find a wide spectrum of potential application scenarios in the digital economy and intelligent industries, including financial services, management, healthcare, and Internet of Things, among others, and also have been integrated into the mainstream blockchain-based development platforms, such as Ethereum and Hyperledger. However, smart contracts are still far from mature, and major technical challenges such as security and privacy issues are still awaiting further research efforts. For instance, the most notorious case might be \u201cThe DAO Attack\u201d in June 2016, which led to more than $50 million Ether transferred into an adversary\u2019s account. In this paper, we strive to present a systematic and comprehensive overview of blockchain-enabled smart contracts, aiming at stimulating further research toward this emerging research area. We first introduced the operating mechanism and mainstream platforms of blockchain-enabled smart contracts, and proposed a research framework for smart contracts based on a novel six-layer architecture. Second, both the technical and legal challenges, as well as the recent research progresses, are listed. Third, we presented several typical application scenarios. Toward the end, we discussed the future development trends of smart contracts. This paper is aimed at providing helpful guidance and reference for future research efforts."} | 41 | {"work_id": 2914735843, "title": "Blockchain-Enabled Smart Contracts: Architecture, Applications, and Future Trends", "abstract": "In recent years, the rapid development of cryptocurrencies and their underlying blockchain technology has revived Szabo\u2019s original idea of smart contracts, i.e., computer protocols that are designed to automatically facilitate, verify, and enforce the negotiation and implementation of digital contracts without central authorities. Smart contracts can find a wide spectrum of potential application scenarios in the digital economy and intelligent industries, including financial services, management, healthcare, and Internet of Things, among others, and also have been integrated into the mainstream blockchain-based development platforms, such as Ethereum and Hyperledger. However, smart contracts are still far from mature, and major technical challenges such as security and privacy issues are still awaiting further research efforts. For instance, the most notorious case might be \u201cThe DAO Attack\u201d in June 2016, which led to more than $50 million Ether transferred into an adversary\u2019s account. In this paper, we strive to present a systematic and comprehensive overview of blockchain-enabled smart contracts, aiming at stimulating further research toward this emerging research area. We first introduced the operating mechanism and mainstream platforms of blockchain-enabled smart contracts, and proposed a research framework for smart contracts based on a novel six-layer architecture. Second, both the technical and legal challenges, as well as the recent research progresses, are listed. Third, we presented several typical application scenarios. Toward the end, we discussed the future development trends of smart contracts. This paper is aimed at providing helpful guidance and reference for future research efforts."} | ||
| 45 | {"work_id": 3123722958, "title": "Toward an ontology\u2010driven blockchain design for supply\u2010chain provenance", "abstract": "Summary An interesting research problem in our age of Big Data is that of determining provenance. Granular evaluation of provenance of physical goods (e.g., tracking ingredients of a pharmaceutical or demonstrating authenticity of luxury goods) has often not been possible with today's items that are produced and transported in complex, interorganizational, often internationally spanning supply chains. Recent adoptions of the Internet of Things and blockchain technologies give promise at better supply\u2010chain provenance. We are particularly interested in the blockchain, as many favored use cases of blockchain are for provenance tracking. We are also interested in applying ontologies, as there has been some work done on knowledge provenance, traceability, and food provenance using ontologies. In this paper, we make a case for why ontologies can contribute to blockchain design. To support this case, we analyze a traceability ontology and translate some of its representations to smart contracts that execute a provenance trace and enforce traceability constraints on the Ethereum blockchain platform."} | 42 | {"work_id": 3123722958, "title": "Toward an ontology\u2010driven blockchain design for supply\u2010chain provenance", "abstract": "Summary An interesting research problem in our age of Big Data is that of determining provenance. Granular evaluation of provenance of physical goods (e.g., tracking ingredients of a pharmaceutical or demonstrating authenticity of luxury goods) has often not been possible with today's items that are produced and transported in complex, interorganizational, often internationally spanning supply chains. Recent adoptions of the Internet of Things and blockchain technologies give promise at better supply\u2010chain provenance. We are particularly interested in the blockchain, as many favored use cases of blockchain are for provenance tracking. We are also interested in applying ontologies, as there has been some work done on knowledge provenance, traceability, and food provenance using ontologies. In this paper, we make a case for why ontologies can contribute to blockchain design. To support this case, we analyze a traceability ontology and translate some of its representations to smart contracts that execute a provenance trace and enforce traceability constraints on the Ethereum blockchain platform."} | ||
| 46 | −{"work_id": 3015692940, "title": "Performance evaluation measurement of image steganography techniques with analysis of LSB based on variation image formats", "abstract": "Recently, Steganography is an outstanding research area which used for data protection from unauthorized access. Steganography is defined as the art and science of covert information in plain sight in various media sources such as text, images, audio, video, network channel etc. so, as to not stimulate any suspicion; while steganalysis is the science of attacking the steganographic system to reveal the secret message. This research clarifies the diverse showing the evaluation factors based on image steganographic algorithms. The effectiveness of a ste-ganographic is rated to three main parameters, payload capacity, image quality measure and security measure. This study is focused on im-age steganographic which is most popular in in steganographic branches. Generally, the Least significant bit is major efficient approach utilized to embed the secret message. In addition, this paper has more detail knowledge based on Least significant bit LSB within various Images formats. All metrics are illustrated in this study with arithmetical equations while some important trends are discussed also at the end of the paper."} | 43 | +{"work_id": 2984937325, "title": "Trusted Execution Environments in Cloud Computing", "abstract": "Cloud technologies have become ubiquitous, being widely used by a variety of users: from individuals to large corporations. Without a doubt, clouds offer major benefits that make them attractive, such as elasticity, scalability, availability, and reliability. However, users' data privacy and security are two main concerns when data is processed in the cloud. Currently, users have to trust cloud providers for processing their data securely, not disclosing it to third parties maliciously or by mistake, and applying best security practices. Largely this trust is based on the cloud provider's reputation: it is in the interest of cloud providers to take security seriously; otherwise, they may lose customers. However this trust model does not provide the technical means of security assurance. \\n \\nTrusted Execution Environments (TEEs) can be used to change the situation. It is a very promising technology that enables secure computation on a remote host. Applying TEEs to cloud environments changes the trust model: customers no longer need to rely on the reputation of the cloud provider. The main reason is that a TEE provides the ability to execute arbitrary code in isolation from the underlying operating system or the hypervisor. Additionally, it is possible to remotely verify what code is running inside a TEE. The trust is based on the hardware and technically it is moved from the cloud provider to the hardware manufacturer. \\n \\nThis work addresses the following challenges when developing TEE applications and deploying TEEs in the cloud. First, how to build scalable applications while maintaining TEE security guarantees? Second, how to reconcile hardware-based TEEs with existing cloud practices? Third, how to utilize TEEs to provide trustworthy resource measurements in the cloud? \\n \\nThe contributions of this dissertation are developing two scalable Trusted Applications for cloud environments, a TEE migration framework to support Virtual Machine migration in the cloud, and a secure resource measurement framework based on TEEs. The contributions form an important step forward towards a wider deployment of TEEs in the cloud that opens opportunities for cloud providers and their clients to benefit from assurance based on hardware and stronger security guarantees."} | ||
| 47 | {"work_id": 3045674654, "title": "Federated learning in medicine: facilitating multi-institutional collaborations without sharing patient data", "abstract": "Several studies underscore the potential of deep learning in identifying complex patterns, leading to diagnostic and prognostic biomarkers. Identifying sufficiently large and diverse datasets, required for training, is a significant challenge in medicine and can rarely be found in individual institutions. Multi-institutional collaborations based on centrally-shared patient data face privacy and ownership challenges. Federated learning is a novel paradigm for data-private multi-institutional collaborations, where model-learning leverages all available data without sharing data between institutions, by distributing the model-training to the data-owners and aggregating their results. We show that federated learning among 10 institutions results in models reaching 99% of the model quality achieved with centralized data, and evaluate generalizability on data from institutions outside the federation. We further investigate the effects of data distribution across collaborating institutions on model quality and learning patterns, indicating that increased access to data through data private multi-institutional collaborations can benefit model quality more than the errors introduced by the collaborative method. Finally, we compare with other collaborative-learning approaches demonstrating the superiority of federated learning, and discuss practical implementation considerations. Clinical adoption of federated learning is expected to lead to models trained on datasets of unprecedented size, hence have a catalytic impact towards precision/personalized medicine."} | 44 | {"work_id": 3045674654, "title": "Federated learning in medicine: facilitating multi-institutional collaborations without sharing patient data", "abstract": "Several studies underscore the potential of deep learning in identifying complex patterns, leading to diagnostic and prognostic biomarkers. Identifying sufficiently large and diverse datasets, required for training, is a significant challenge in medicine and can rarely be found in individual institutions. Multi-institutional collaborations based on centrally-shared patient data face privacy and ownership challenges. Federated learning is a novel paradigm for data-private multi-institutional collaborations, where model-learning leverages all available data without sharing data between institutions, by distributing the model-training to the data-owners and aggregating their results. We show that federated learning among 10 institutions results in models reaching 99% of the model quality achieved with centralized data, and evaluate generalizability on data from institutions outside the federation. We further investigate the effects of data distribution across collaborating institutions on model quality and learning patterns, indicating that increased access to data through data private multi-institutional collaborations can benefit model quality more than the errors introduced by the collaborative method. Finally, we compare with other collaborative-learning approaches demonstrating the superiority of federated learning, and discuss practical implementation considerations. Clinical adoption of federated learning is expected to lead to models trained on datasets of unprecedented size, hence have a catalytic impact towards precision/personalized medicine."} | ||
| 48 | {"work_id": 3159080474, "title": "Federated Learning for Internet of Things: A Comprehensive Survey", "abstract": "Federated Learning for Internet of Things: A Comprehensive Survey"} | 45 | {"work_id": 3159080474, "title": "Federated Learning for Internet of Things: A Comprehensive Survey", "abstract": "Federated Learning for Internet of Things: A Comprehensive Survey"} | ||
| 49 | {"work_id": 2973816953, "title": "How Blockchain Will Change Organizations", "abstract": "For the last century, academics and business leaders have been shaping the practice of modern management. The main theories, tenets, and behaviors have enabled managers to build corporations, which have largely been hierarchical, insular, and vertically integrated. However, we believe that the technology underlying digital currencies such as bitcoin\u2014technology commonly known as blockchain\u2014will have profound effects on the nature of companies: how they are funded and managed, how they create value, and how they perform basic functions such as marketing, accounting, and incentivizing people. In some cases, software will eliminate the need for many management functions."} | 46 | {"work_id": 2973816953, "title": "How Blockchain Will Change Organizations", "abstract": "For the last century, academics and business leaders have been shaping the practice of modern management. The main theories, tenets, and behaviors have enabled managers to build corporations, which have largely been hierarchical, insular, and vertically integrated. However, we believe that the technology underlying digital currencies such as bitcoin\u2014technology commonly known as blockchain\u2014will have profound effects on the nature of companies: how they are funded and managed, how they create value, and how they perform basic functions such as marketing, accounting, and incentivizing people. In some cases, software will eliminate the need for many management functions."} | ||
| 50 | {"work_id": 4293168393, "title": "New Directions in Cryptography", "abstract": "chapter Share on New Directions in Cryptography Authors: Whitfield Diffie View Profile , Martin E. Hellman View Profile Authors Info & Claims Democratizing Cryptography: The Work of Whitfield Diffie and Martin HellmanAugust 2022 Pages 365\u2013390https://doi.org/10.1145/3549993.3550007Published:26 August 2022Publication History 0citation45DownloadsMetricsTotal Citations0Total Downloads45Last 12 Months45Last 6 weeks4 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access"} | 47 | {"work_id": 4293168393, "title": "New Directions in Cryptography", "abstract": "chapter Share on New Directions in Cryptography Authors: Whitfield Diffie View Profile , Martin E. Hellman View Profile Authors Info & Claims Democratizing Cryptography: The Work of Whitfield Diffie and Martin HellmanAugust 2022 Pages 365\u2013390https://doi.org/10.1145/3549993.3550007Published:26 August 2022Publication History 0citation45DownloadsMetricsTotal Citations0Total Downloads45Last 12 Months45Last 6 weeks4 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access"} | ||
| 48 | +{"work_id": 3163490558, "title": "Assessment of the Blockchain Technology Adoption for the Management of the Electronic Health Record Systems", "abstract": "Blockchain is an emerging technology that holds great promises in healthcare despite slow adoption and previous unsuccessful implementation projects. Blockchain adoption in healthcare has been slow, partly because healthcare is a heavily regulated and complex industry. Blockchain applications span various areas of healthcare such as patient data management, health information exchange, health supply chain management, financial and insurance claims, clinical trial, biomedical devices tracking, and pharmaceutical counterfeit. The main challenges with blockchain technology in healthcare are: scarcity of real applications, the high level of failing projects, and the need for various parties to function together. There is, however, a lack of research on how to assess the adoption and help healthcare organizations use blockchain for the management of the electronic healthcare records (EHR) systems in a comprehensive way incorporating multiple perspectives. The objective of this research is to develop a scoring model to evaluate healthcare organization's readiness to adopt blockchain for the management of the EHR systems. In this research, a literature review and expert feedback were used to identify the most important factors influencing blockchain adoption. The focus is on the application of the blockchain technology adoption for the management of the EHR systems. The Hierarchical Decision Modeling (HDM) methodology was used to elicit multiple expert's judgment to identify the relative importance of those factors influencing blockchain adoption. In addition, experts' feedback was used to identify the possible statuses an organization might have regarding each factor and the dynamic aspects of these factors was analyzed. Finally, two case studies of the blockchain adoption, Oregon Health and Science University (OHSU) hospital and a Medical City in Saudi Arabia, were conducted to demonstrate the practicality and value the research model brings to the research objective. The outcomes of the research present an identification of blockchain adoption impacting factors and their resultant rankings. The research identifies 17 factors as the most important factors influencing blockchain adoption and a healthcare organization's readiness for adoption. The factors are grouped into five perspective: financial, social, technical, organizational, and regulations & legal. The case studies are used to demonstrate how the model could be used to identify areas of deficiencies and propose corrective actions in the healthcare organization's capabilities. The goal is to prevent any possible issues, before the project starts, in order to increase chances of a successful blockchain adoption."} | ||||
| 51 | {"work_id": 3036422000, "title": "A Survey of COVID-19 Contact Tracing Apps", "abstract": "The recent outbreak of COVID-19 has taken the world by surprise, forcing lockdowns and straining public health care systems. COVID-19 is known to be a highly infectious virus, and infected individuals do not initially exhibit symptoms, while some remain asymptomatic. Thus, a non-negligible fraction of the population can, at any given time, be a hidden source of transmissions. In response, many governments have shown great interest in smartphone contact tracing apps that help automate the difficult task of tracing all recent contacts of newly identified infected individuals. However, tracing apps have generated much discussion around their key attributes, including system architecture, data management, privacy, security, proximity estimation, and attack vulnerability. In this article, we provide the first comprehensive review of these much-discussed tracing app attributes. We also present an overview of many proposed tracing app examples, some of which have been deployed countrywide, and discuss the concerns users have reported regarding their usage. We close by outlining potential research directions for next-generation app design, which would facilitate improved tracing and security performance, as well as wide adoption by the population at large."} | 49 | {"work_id": 3036422000, "title": "A Survey of COVID-19 Contact Tracing Apps", "abstract": "The recent outbreak of COVID-19 has taken the world by surprise, forcing lockdowns and straining public health care systems. COVID-19 is known to be a highly infectious virus, and infected individuals do not initially exhibit symptoms, while some remain asymptomatic. Thus, a non-negligible fraction of the population can, at any given time, be a hidden source of transmissions. In response, many governments have shown great interest in smartphone contact tracing apps that help automate the difficult task of tracing all recent contacts of newly identified infected individuals. However, tracing apps have generated much discussion around their key attributes, including system architecture, data management, privacy, security, proximity estimation, and attack vulnerability. In this article, we provide the first comprehensive review of these much-discussed tracing app attributes. We also present an overview of many proposed tracing app examples, some of which have been deployed countrywide, and discuss the concerns users have reported regarding their usage. We close by outlining potential research directions for next-generation app design, which would facilitate improved tracing and security performance, as well as wide adoption by the population at large."} | ||
| 52 | {"work_id": 2460937040, "title": "Adversarial Examples in the Physical World", "abstract": "Most existing machine learning classifiers are highly vulnerable to adversarial examples. An adversarial example is a sample of input data which has been modified very slightly in a way that is intended to cause a machine learning classifier to misclassify it. In many cases, these modifications can be so subtle that a human observer does not even notice the modification at all, yet the classifier still makes a mistake. Adversarial examples pose security concerns because they could be used to perform an attack on machine learning systems, even if the adversary has no access to the underlying model. Up to now, all previous work has assumed a threat model in which the adversary can feed data directly into the machine learning classifier. This is not always the case for systems operating in the physical world, for example those which are using signals from cameras and other sensors as input. This paper shows that even in such physical world scenarios, machine learning systems are vulnerable to adversarial examples. We demonstrate this by feeding adversarial images obtained from a cell-phone camera to an ImageNet Inception classifier and measuring the classification accuracy of the system. We find that a large fraction of adversarial examples are classified incorrectly even when perceived through the camera."} | 50 | {"work_id": 2460937040, "title": "Adversarial Examples in the Physical World", "abstract": "Most existing machine learning classifiers are highly vulnerable to adversarial examples. An adversarial example is a sample of input data which has been modified very slightly in a way that is intended to cause a machine learning classifier to misclassify it. In many cases, these modifications can be so subtle that a human observer does not even notice the modification at all, yet the classifier still makes a mistake. Adversarial examples pose security concerns because they could be used to perform an attack on machine learning systems, even if the adversary has no access to the underlying model. Up to now, all previous work has assumed a threat model in which the adversary can feed data directly into the machine learning classifier. This is not always the case for systems operating in the physical world, for example those which are using signals from cameras and other sensors as input. This paper shows that even in such physical world scenarios, machine learning systems are vulnerable to adversarial examples. We demonstrate this by feeding adversarial images obtained from a cell-phone camera to an ImageNet Inception classifier and measuring the classification accuracy of the system. We find that a large fraction of adversarial examples are classified incorrectly even when perceived through the camera."} | ||
| 53 | −{"work_id": 4220990555, "title": "Robust federated learning with attack-adaptive aggregation", "abstract": "HKUST Electronic Theses Robust federated learning with attack-adaptive aggregation by Wan Ching Pui thesis 2021 1 online resource (x, 50 pages) : illustrations (chiefly color) In this thesis, we discuss a data-driven approach to defend adversarial attacks in federated learning.\u2026Read more \u203a"} | 51 | +{"work_id": 3201596224, "title": "ELLIPTIC CURVE DIGITAL SIGNATURE ALGORITHM", "abstract": "Elliptic curve cryptography has been a remarkable development in the history of cryptography thanks to the properties provided by the implementation of elliptic curve cryptography. Elliptic curve cryptography has proven to be adaptable given its broad presence across various electronics of diering sizes and capabilities. Elliptic curve cryptography is known for utilizing the discrete logarithm problem, modern algebra, and elliptic curves that have encouraged continued research into elliptic curve cryptography in its advantages and restrictions. The current comprehension of elliptic curves as well as continuing advancements and employments of elliptic curve cryptography have yielded the elliptic curve digital signature algorithm (ECDSA) which has become an alternative to the primary Digital Signature Algorithm. TheECDSA provides advantages of elliptic curve cryptography to the function of the digital signature algorithm to authenticate and protect transmissions between involved parties. Such can be explored in the securing of bitcoinrelated transactions where the completely electronic, decentralized currencywould face a multitude of cyber threats and require safeguards to remaintrustworthy."} | ||
| 54 | −{"work_id": 4414891672, "title": "Differential privacy for medical deep learning: methods, tradeoffs, and deployment implications", "abstract": "Differential privacy (DP) is a prominent technique for protecting sensitive patient data in medical deep learning (DL), yet deploying it without compromising clinical utility or equity remains challenging. This scoping review synthesizes applications of DP in medical DL across centralized and federated settings. A structured search identified 74 eligible studies published through March 2025. Across modalities and tasks, DP, especially via DP-SGD, can maintain clinically acceptable performance under moderate privacy budgets (\u03f5 \u2248 10), particularly in imaging. However, strict privacy (\u03f5 \u2248 1) often leads to substantial accuracy loss, with amplified degradation in smaller or heterogeneous datasets. Only a minority of studies evaluate fairness, and several report that DP can widen subgroup performance gaps. Beyond DP-SGD, alternative mechanisms, including generative modeling, local DP, and hybrid federated designs, are emerging, but reporting of privacy parameters remains inconsistent. We identify key gaps in fairness auditing and standardization, and outline priorities for equitable, clinically robust privacy-preserving DL."} | 52 | +{"work_id": 2913851998, "title": "Status report on the first round of the NIST post-quantum cryptography standardization process", "abstract": "The Information Technology Laboratory (ITL) at the National Institute of Standards and Technology (NIST) promotes the U.S. economy and public welfare by providing technical leadership for the Nation's measurement and standards infrastructure.ITL develops tests, test methods, reference data, proof of concept implementations, and technical analyses to advance the development and productive use of information technology.ITL's responsibilities include the development of management, administrative, technical, and physical standards and guidelines for the cost-effective security and privacy of other than national security-related information in federal information systems."} | ||
| 55 | −{"work_id": 7135198685, "title": "Breaking interprovincial data silos: how federated learning can unlock Canada's public health potential", "abstract": "Abstract This study introduces the first dual-enabler framework that jointly integrates federated learning (FL) with artificial intelligence (AI) governance to enable privacy-preserving, interoperable collaboration across jurisdictions. Unlike traditional FL approaches, the proposed framework embeds governance mechanisms such as differential privacy (DP), consent enforcement and fairness auditing into the model lifecycle, ensuring secure, compliant and equitable deployment. These conditions result in siloed datasets, impeding national-level advancements in diagnostics, public health and personalized medicine. The framework\u2019s novelty lies in its co-evolutionary design, where technical and governance layers iteratively inform one another to align with Canada\u2019s federated healthcare architecture. We evaluate this framework via three simulations: cancer detection, pandemic prediction, and rare disease analytics and a real-world test using the PathMNIST dataset. Each case incorporates embedded governance mechanisms such as DP, consent enforcement and fairness auditing. Results show that FL combined with governance structures improves equity, deployment speed and compliance. For instance, in synthetic-data simulations, FL improved recall for underrepresented phenotypes by 18%, reduced compliance-violation flags by 35% and accelerated deployment. In the PathMNIST benchmark with 107 000 labelled medical images, our federated model achieved 91.3% accuracy under a strict privacy budget. Together, these results demonstrate a clear and scalable pathway towards ethical, privacy-preserving and governance-aligned AI for Canada\u2019s healthcare ecosystem."} | 53 | +{"work_id": 3021970994, "title": "Acceptability of App-Based Contact Tracing for COVID-19: Cross-Country Survey Study", "abstract": "BACKGROUND: The COVID-19 pandemic is the greatest public health crisis of the last 100 years. Countries have responded with various levels of lockdown to save lives and stop health systems from being overwhelmed. At the same time, lockdowns entail large socioeconomic costs. One exit strategy under consideration is a mobile phone app that traces the close contacts of those infected with COVID-19. Recent research has demonstrated the theoretical effectiveness of this solution in different disease settings. However, concerns have been raised about such apps because of the potential privacy implications. This could limit the acceptability of app-based contact tracing in the general population. As the effectiveness of this approach increases strongly with app uptake, it is crucial to understand public support for this intervention. OBJECTIVE: The objective of this study is to investigate the user acceptability of a contact-tracing app in five countries hit by the pandemic. METHODS: We conducted a largescale, multicountry study (N=5995) to measure public support for the digital contact tracing of COVID-19 infections. We ran anonymous online surveys in France, Germany, Italy, the United Kingdom, and the United States. We measured intentions to use a contact-tracing app across different installation regimes (voluntary installation vs automatic installation by mobile phone providers) and studied how these intentions vary across individuals and countries. RESULTS: We found strong support for the app under both regimes, in all countries, across all subgroups of the population, and irrespective of regional-level COVID-19 mortality rates. We investigated the main factors that may hinder or facilitate uptake and found that concerns about cybersecurity and privacy, together with a lack of trust in the government, are the main barriers to adoption. CONCLUSIONS: Epidemiological evidence shows that app-based contact tracing can suppress the spread of COVID-19 if a high enough proportion of the population uses the app and that it can still reduce the number of infections if uptake is moderate. Our findings show that the willingness to install the app is very high. The available evidence suggests that app-based contact tracing may be a viable approach to control the diffusion of COVID-19."} | ||
| 56 | −{"work_id": 4300127641, "title": "Hyperledger fabric", "abstract": "Fabric is a modular and extensible open-source system for deploying and operating permissioned blockchains and one of the Hyperledger projects hosted by the Linux Foundation (www.hyperledger.org)."} | 54 | +{"work_id": 3018102029, "title": "SplitFed: When Federated Learning Meets Split Learning", "abstract": "Federated learning (FL) and split learning (SL) are two popular distributed machine learning approaches. Both follow a model-to-data scenario; clients train and test machine learning models without sharing raw data. SL provides better model privacy than FL due to the machine learning model architecture split between clients and the server. Moreover, the split model makes SL a better option for resource-constrained environments. However, SL performs slower than FL due to the relay-based training across multiple clients. In this regard, this paper presents a novel approach, named splitfed learning (SFL), that amalgamates the two approaches eliminating their inherent drawbacks, along with a refined architectural configuration incorporating differential privacy and PixelDP to enhance data privacy and model robustness. Our analysis and empirical results demonstrate that (pure) SFL provides similar test accuracy and communication efficiency as SL while significantly decreasing its computation time per global epoch than in SL for multiple clients. Furthermore, as in SL, its communication efficiency over FL improves with the number of clients. Besides, the performance of SFL with privacy and robustness measures is further evaluated under extended experimental settings."} | ||
| 57 | −{"work_id": 4415878254, "title": "DFCA: Decentralized Federated Clustering Algorithm", "abstract": "Clustered Federated Learning has emerged as an effective approach for handling heterogeneous data across clients by partitioning them into clusters with similar or identical data distributions. However, most existing methods, including the Iterative Federated Clustering Algorithm (IFCA), rely on a central server to coordinate model updates, typically requiring stable connectivity, synchronous communication rounds, and global aggregation of client models. These assumptions are difficult to satisfy in decentralized and heterogeneous environments, where clients may only have limited, local communication with a small subset of peers. As a result, such methods create a bottleneck and a single point of failure, limiting their applicability in realistic decentralized learning settings. This limitation is particularly severe in Internet of Things settings, where large numbers of resource-constrained devices, intermittent or sparse connectivity, and dynamic participation make reliance on a central server impractical. In this work, we introduce the Decentralized Federated Clustering Algorithm (DFCA), a fully decentralized clustered federated learning algorithm that enables clients to collaboratively train cluster-specific models without central coordination. DFCA uses a sequential running average to aggregate models from neighbors as updates arrive, providing a communication-efficient alternative to batch aggregation while maintaining clustering performance. Our experiments on various datasets demonstrate that DFCA outperforms other decentralized algorithms and performs comparably to centralized IFCA, even under sparse connectivity, highlighting its robustness and practicality for dynamic real-world decentralized networks."} | 55 | +{"work_id": 7127055292, "title": "Artificial intelligence in higher education: a systematic review of its impact on student engagement and the mediating role of teaching methods", "abstract": "Introduction Artificial Intelligence (AI) is increasingly integrated into higher education to personalize instruction and support student engagement. However, the mediating role of teaching methods in this process remains underexplored. Methods This systematic review analyzed 73 peer-reviewed articles published between 2015 and early 2025, retrieved from Scopus and Web of Science, following PRISMA guidelines. Studies were screened based on predefined inclusion criteria and coded using a structured framework that examined AI types, engagement outcomes, and instructional strategies. Results Findings reveal that AI tools\u2014such as chatbots, adaptive systems, and predictive analytics\u2014enhance engagement most effectively when embedded within interactive pedagogies like flipped classrooms, project-based learning, and scaffolded feedback loops. To conceptualize this relationship, we introduce the PMAISE model (Pedagogical Mediation of AI for Student Engagement), which maps the alignment between AI technologies, pedagogical strategies, and the affective, behavioral, and cognitive dimensions of engagement. Concrete examples from recent studies demonstrate how teaching methods amplify or inhibit the effects of AI tools. The review also critically examines emerging concerns related to ethics, data privacy, and structural barriers to equitable AI adoption. Discussion This study offers a conceptual and practical framework for integrating AI into higher education in a context-sensitive, evidence-based, and pedagogically meaningful manner, highlighting the crucial role of thoughtful pedagogical mediation in maximizing AI\u2019s educational benefits."} | ||
| 58 | −{"work_id": 3123868249, "title": "Sex, Drugs, and Bitcoin: How Much Illegal Activity Is Financed through Cryptocurrencies?", "abstract": "Cryptocurrencies are among the largest unregulated markets in the world. We find that approximately one-quarter of bitcoin users are involved in illegal activity. We estimate that around $76 billion of illegal activity per year involve bitcoin (46% of bitcoin transactions), which is close to the scale of the U.S. and European markets for illegal drugs. The illegal share of bitcoin activity declines with mainstream interest in bitcoin and with the emergence of more opaque cryptocurrencies. The techniques developed in this paper have applications in cryptocurrency surveillance. Our findings suggest that cryptocurrencies are transforming the black markets by enabling \u201cblack e-commerce.\u201d Received June 1, 2017; editorial decision December 8, 2018 by Editor Andrew Karolyi. Authors have furnished an Internet Appendix, which is available on the Oxford University Press Web site next to the link to the final published paper online."} | 56 | +{"work_id": 4382463479, "title": "FedALA: Adaptive Local Aggregation for Personalized Federated Learning", "abstract": "A key challenge in federated learning (FL) is the statistical heterogeneity that impairs the generalization of the global model on each client. To address this, we propose a method Federated learning with Adaptive Local Aggregation (FedALA) by capturing the desired information in the global model for client models in personalized FL. The key component of FedALA is an Adaptive Local Aggregation (ALA) module, which can adaptively aggregate the downloaded global model and local model towards the local objective on each client to initialize the local model before training in each iteration. To evaluate the effectiveness of FedALA, we conduct extensive experiments with five benchmark datasets in computer vision and natural language processing domains. FedALA outperforms eleven state-of-the-art baselines by up to 3.27% in test accuracy. Furthermore, we also apply ALA module to other federated learning methods and achieve up to 24.19% improvement in test accuracy. Code is available at https://github.com/TsingZ0/FedALA."} | ||
| 59 | −{"work_id": 7155564432, "title": "Privacy-Preserving Anomaly Detection in Cloud Services using Hierarchical Federated Learning with Differential Privacy", "abstract": "Identifying abnormal behaviors plays a vital role in ensuring cloud infrastructure remains secure and operationally stable. Conventional methods that aggregate data at a single location create substantial privacy concerns, especially within shared cloud platforms hosting multiple organizations with confidential operational information. This paper proposes HierFedDP, a hierarchical federated learning framework integrated with a two-stage differential privacy mechanism for privacy-preserving anomaly detection in cloud services. Our approach employs a three-tier architecture consisting of local clients, edge servers, and a central cloud server, where clients apply local differential privacy to their updates before transmission. We introduce an edge aggregation frequency parameter that enables edge servers to perform multiple local aggregation rounds before communicating with the central cloud. Experiments on the CICIDS2017 dataset demonstrate that HierFedDP achieves detection performance comparable to standard local differential privacy approaches while reducing wide-area network (WAN) communication overhead by 49%. This significant communication reduction, achieved without sacrificing privacy guarantees or detection accuracy, makes HierFedDP particularly suitable for bandwidth-constrained, geo-distributed cloud deployments."} | 57 | +{"work_id": 652269645, "title": "A Design and Analysis of Graphical Password", "abstract": "The most common computer authentication method is to use alphanumerical usernames and passwords. This method has been shown to have significant drawbacks. For example, users tend to pick passwords that can be easily guessed. On the other hand, if a password is hard to guess, then it is often hard to remember. To address this problem, some researchers have developed authentication methods that use pictures as passwords. In this paper, I conduct a comprehensive survey of the existing graphical password techniques. I classify these techniques into two categories: recognition-based and recall-based approaches. I discuss the strengths and limitations of each method and point out the future research directions in this area. I also developed three new techniques against the common problem exists in the present graphical password techniques. In this thesis, the scheme of each new technique will be proposed; the advantages of each technique will be discussed; and the future work will be anticipated."} | ||
| 60 | −{"work_id": 7147711523, "title": "Open-Circuit Fault Diagnosis for Power Converters Under Variable Operational Conditions: From a Source-Free Domain Adaptation Perspective", "abstract": "As the core component of modern power electronic systems, power converters have widespread applications in renewable energy generation, smart grids, and aerospace. The open-circuit fault of power converters is highly concealed and easily derived from secondary faults, whose diagnosis technology has become a key research direction to ensure safe operation. Considering that power converters usually need to operate under different load conditions and complex environments, it is of great significance to achieve efficient open-circuit fault diagnosis while protecting data privacy. Therefore, this article proposes an open-circuit fault diagnosis approach for power converters from the perspective of source-free domain adaptation. In detail, this article proposes an attention-guided power converter fault diagnosis model to enhance the ability to capture key features. Without the need for source domain data to participate in joint training, this article proposes a dynamic clustering loss to achieve pseudolabel generation and iterative self-training, so that the model can make full use of target domain data. Furthermore, this article proposes uncertainty entropy loss and diversity entropy loss to decrease the uncertainty of fault diagnosis output while preventing the model from being over-confident. To demonstrate the reliability of the open-circuit fault diagnosis methodology, this research implements a functional power conversion system."} | 58 | +{"work_id": 4400662300, "title": "Collaborative Networks: Integrating Blockchain for Enhanced Trust and Transparency", "abstract": "Blockchain technology has become a disruptive force in many different industries because it provides unparalleled security, transparency, and efficiency. In the context of cooperative networks, Blockchain's decentralized architecture provides a solid basis for enhancing trust, streamlining processes, and fostering innovation. This chapter examines how Blockchain can be used with cooperative networks and how it could fundamentally alter the way entities interact and communicate. Important areas of focus include Blockchain's technological foundations, applications in collaborative environments, and case studies that highlight its impacts. By examining the challenges and opportunities presented by this convergence, we intend to provide a comprehensive understanding of how Blockchain can revolutionize cooperative ecosystems. The field of scholarly communication is undergoing a significant transition due to technological advancements. This chapter looks at how blockchain technology and collaborative networks could alter contemporary living. We examine the basic shortcomings of the existing centralized model and discuss how the core concepts of immutability, transparency, and decentralization found in Blockchain technology can assist in resolving these problems. This paper explores the relationship between collaborative networks and blockchain technology. We start by outlining the fundamental ideas behind Blockchain technology and how it has developed. The use of Blockchain is then examined in a variety of cooperative settings, with its advantages and possible drawbacks discussed. We demonstrate the real-world effects of Blockchain-enabled collaborative networks across various industries with a number of case studies."} | ||
| 61 | −{"work_id": 4401666902, "title": "Cyberfraud in the Nigerian Banking Sector: The Techniques and Preventive Measures", "abstract": "The cyberfraud techniques emerged as a significant threat to the banking sector in Nigeria. Bank customers have been losing their hard-earned funds to these measures due to a lack of sufficient awareness of the cyberfraud tactics and preventive measures. There has been an increased rate of loss recorded annually in the banking sector due to fraud. The banking sector in Nigeria recorded a loss to a tune amount of \u20a617.6bn in 2023 amount higher than the budget allocation for education in most states of the country. Social engineering remains the persistent and predominant technique fraudsters employ to defraud bank customers in Nigeria. Phishing, identity theft, login credential theft, ATM card swap, and skimming are other techniques cybercriminals employ. This research paper aims to examine and analyze the modus operandi of these techniques and explore the strategic preventive measures that can be implemented by customers to mitigate these risks, such as using advanced cybersecurity technologies, multi-factor authentication systems, employee training, as well as regulatory controls. The paper highlights the significance of a proactive and adaptive cybersecurity posture, continuous monitoring, and collaboration with regulatory bodies to enhance the resilience of the banking sector against cyber threats. The research focuses more on cyberfrauds targeting bank customers, and secondary data will be used for research purposes."} | 59 | +{"work_id": 7154488736, "title": "Predicting Mental Health Challenges Among University Students Using a Federated CNN-BiLSTM-Attention Framework", "abstract": "Early detection and effective management of rising mental health issues among university students is a major challenge. This work proposes Fed-CBA, a novel deep learning framework combining CNN, BiLSTM, and Attention to predict future mental health risks. Fed-CBA integrates multiple data sources (LMS, EMA surveys, wearables, lifestyle data) and operates in a decentralized, privacy-preserving manner using FedAvg and differential privacy. It also provides explainable predictions through SHAP and LIME. Experimental results show that Fed-CBA outperforms DNN, CNN, and LSTM models, while also improving fairness (EOR) and interpretability. Overall, the framework enables early detection and supports personalized, equitable student mental health services."} | ||
| 62 | −{"work_id": 4387210439, "title": "HuntGPT: Integrating Machine Learning-Based Anomaly Detection and Explainable AI with Large Language Models (LLMs)", "abstract": "Machine learning (ML) methods for network anomaly detection are emerging as effective proactive strategies in threat hunting, substantially reducing the time required for threat detection and response. However, the challenges in training and maintaining ML models, coupled with frequent false positives, diminish their acceptance and trustworthiness. In response, Explainable AI (XAI) techniques have been introduced to enable cybersecurity operations teams to assess alerts generated by AI systems more confidently. Despite these advancements, XAI tools have encountered limited acceptance from incident responders and have struggled to meet the decision-making needs of both analysts and model maintainers. Large Language Models (LLMs) offer a unique approach to tackling these challenges. Through tuning, LLMs have the ability to discern patterns across vast amounts of information and meet varying functional requirements. In this research, we introduce the development of HuntGPT, a specialized intrusion detection dashboard created to implement a Random Forest classifier trained utilizing the KDD99 dataset. The tool incorporates XAI frameworks like SHAP and Lime, enhancing user-friendliness and intuitiveness of the model. When combined with a GPT-3.5 Turbo conversational agent, HuntGPT aims to deliver detected threats in an easily explainable format, emphasizing user understanding and offering a smooth interactive experience. We investigate the system\u2019s comprehensive architecture and its diverse components, assess the prototype\u2019s technical accuracy using the Certified Information Security Manager (CISM) Practice Exams, and analyze the quality of response readability across six unique metrics. Our results indicate that conversational agents, underpinned by LLM technology and integrated with XAI, can enable a robust mechanism for generating explainable and actionable AI solutions, especially within the realm of intrusion detection systems."} | 60 | +{"work_id": 4380356557, "title": "Blockchain Technology in Renovating Healthcare", "abstract": "The positive effect of technology on health care is known as digital transformation. Wearable fitness technology, telemedicine, and AI-enabled medical devices are just a few examples of how health care is undergoing a digital transformation. These are intended to revolutionize the health-care industry by improving patient care, streamlining operations, and lowering costs. They are still facing significant challenges in patient data security and privacy, invoicing and payment processing, medical supply chain, and drug integrity. Blockchain technology can absolve the healthcare industry from facing these challenges; it can establish a blockchain of medical records. Blockchain is considered highly secure, transparent, and immune to hackers due to its digital encryption. This article examined the potential of blockchain technology to improve the security, privacy, and interoperability of healthcare data, and it suggested a few advanced uses of blockchain in the health care domain after a thorough analysis of the existing major challenges in the sector."} | ||
| 63 | −{"work_id": 4401459825, "title": "Module-lattice-based key-encapsulation mechanism standard", "abstract": "A key-encapsulation mechanism (KEM) is a set of algorithms that, under certain conditions, can be used by two parties to establish a shared secret key over a public channel. A shared secret key that is securely established using a KEM can then be used with symmetric-key cryptographic algorithms to perform basic tasks in secure communications, such as encryption and authentication. This standard specifies a key-encapsulation mechanism called ML-KEM. The security of ML-KEM is related to the computational difficulty of the Module Learning with Errors problem. At present,ML-KEM is believed to be secure, even against adversaries who possess a quantum computer. This standard specifies three parameter sets for ML-KEM. In order of increasing security strength and decreasing performance, these are ML-KEM-512, ML-KEM-768, and ML-KEM-1024."} | 61 | +{"work_id": 4322207773, "title": "Automating Behavior-based Ransomware Analysis, Detection, and Classification Using Machine Learning", "abstract": "Ransomware is malware that hijacks a victim's data using encryption and demands a ransom in exchange for the decryption key. Ransomware has gained prominence due to its attack vector and the irreversible nature of damage to data. Ransomware has indiscriminately attacked individuals and organizations worldwide, disrupting their businesses and services. The number of successful ransomware attacks across the globe highlights the inadequacy of existing ransomware defense. Static and dynamic analysis are two popular approaches to malware analysis. The former does not require execution of the malware binary, whereas the latter requires executing the binary in a controlled environment. Static analysis-based detection, e.g., signature-matching, is widely adopted by commercial antivirus solutions but can be thwarted by evasion techniques, e.g., polymorphism and code obfuscation, utilized in modern malware. Consequently, dynamic analysis-based or behavior-based detection approaches have gained popularity because malware behavior cannot be changed entirely across its variants. Both signature and behavior-based detection complement each other. Behavior-based ransomware detection comes with certain challenges and problems, such as data high-dimensionality that occurs because a process may execute thousands of API calls per second. Manual inspection of these API calls for feature engineering requires an expert and is a time-intensive task. Another problem with some existing ransomware detection models is the reliance on handcrafted malice scoring functions that assign scores to the processes describing their threat levels. Other challenges to ransomware detection research include the limited availability of ransomware data sets that can be used with Machine Learning (ML) methods and their reuse scope. The scope of reuse of available data sets is limited because of their format, e.g., sequential data may be used with recurrent neural networks but not with commonly used ML-based classification algorithms, and focus, e.g., network activity and filesystem activity. For the above-mentioned reasons, ransomware detection research is generally followed by ransomware analysis. However, to the best of our knowledge, not many of the existing ransomware behavior analysis studies discuss the challenges involved in the process. This thesis aims to automate the solutions to the problems related to ransomware behavior detection and classification using evolutionary computation methods, i.e., particle swarm optimization and genetic programming, and deep neural networks, i.e., long short-term memory. This thesis proposes a wrapper feature selection method to address the high dimensionality in ransomware behavior data. The proposed method utilizes particle swarm optimization to automatically select a suitable number of features from each feature group and therefore does not require expert input. This thesis further proposes an automated method of evolving malice scoring models for ransomware detection. The proposed method formulates the problem as a symbolic regression problem and solves it using genetic programming. Unlike existing methods, the proposed method does not require expert knowledge to design the model. Furthermore, this thesis proposes an automated behavior analysis framework for highlighting challenges associated with ransomware behavior analysis and solutions to these challenges. Finally, this thesis proposes a new representation of the API call sequences that combines the API call names and important call arguments. The proposed representation of the API call sequences helped improve ransomware early detection performance. All the methods proposed in this thesis either automate the existing manual solutions or achieve comparable or better performance compared to existing methods."} | ||
| 64 | −{"work_id": 4302383326, "title": "Private Information Retrieval with Side Information", "abstract": "The objective of the classical Private Information Retrieval (PIR) problem is to enable a user to\\ndownload a message from a database that is replicated across a collection of non-colluding servers\\nwithout revealing the identity of the demanded message to the servers. In the classical PIR problem\\nthe user has no prior information about the content of messages in the database. It is easy to verify\\nin the special case of the PIR problem when there is only one server in the system, the user must\\ndownload all messages from the database in order keep information about the message they want\\nprivate.\\nIn a real environment the user may have other sources to download and obtain messages from\\nsuch as trusted peer-to-peer communication. In this way, the user has the potential to obtain some\\nof the messages that are contained in the database to use as side information in a PIR scheme with\\nthe servers. Accordingly, we introduce the Private Information Retrieval with Side Information\\n(PIR-SI) problem that focuses on settings in which the user has side information about some messages\\nin the database. To capture the different levels of privacy a user may want to enforce in\\nPIR-SI schemes two metrics of privacy, W-privacy and (W,S)-privacy, are introduced. W-privacy\\nonly protects information about the identity of the message that the user wants and is most similar\\nto the measure of privacy in the original PIR problem. (W, S)-privacy protects the identity of the\\nwanted message as well as the identities of the messages they have as side information and is a\\nstronger sense of privacy than W-privacy. When enforcing either measure of privacy the user no\\nlonger has to download all the messages in the database, even if there is only one server in the\\nsystem; side information reduces the amount of data that one has to download in a PIR scheme.\\nThe first case of the PIR-SI problem that we consider is when the user has M messages for side\\ninformation and wants a different message from the database of K messages. When there is only\\none server in the system, we show that the optimal download rate for a W-private scheme is k^-1/M+1\\nand the optimal download rate for a (W, S)-private scheme is 1/K-M.\\nWhen there is more than one\\nserver in the system a W-private scheme is presented that has a larger rate than the classical PIR\\nscheme, but its optimality is not shown.\\nThe second case of the PIR-SI problem that is considered is when the user has M messages as\\nside information, the user wants D > 1 distinct messages from the database, and there is only one\\nserver in the system. In the case when M = 1 a (W, S)-private optimal scheme is presented and\\nshown to be optimal. In the case when M \u2265 D and D = 2 a W-private scheme that can increase\\nthe rate from the (W, S)-private scheme with the same parameters is presented. This scheme\u2019s\\noptimality reminds an open problem. We highlight the difficulty of finding an optimal scheme and\\ndetermining the capacity of the multi-message PIR-SI problem."} | 62 | +{"work_id": 3014084098, "title": "Contact Tracing Mobile Apps for COVID-19: Privacy Considerations and Related Trade-offs", "abstract": "Contact tracing is an essential tool for public health officials and local communities to fight the spread of novel diseases, such as for the COVID-19 pandemic. The Singaporean government just released a mobile phone app, TraceTogether, that is designed to assist health officials in tracking down exposures after an infected individual is identified. However, there are important privacy implications of the existence of such tracking apps. Here, we analyze some of those implications and discuss ways of ameliorating the privacy concerns without decreasing usefulness to public health. We hope in writing this document to ensure that privacy is a central feature of conversations surrounding mobile contact tracing apps and to encourage community efforts to develop alternative effective solutions with stronger privacy protection for the users. Importantly, though we discuss potential modifications, this document is not meant as a formal research paper, but instead is a response to some of the privacy characteristics of direct contact tracing apps like TraceTogether and an early-stage Request for Comments to the community. Date written: 2020-03-24 Minor correction: 2020-03-30"} | ||
| 65 | −{"work_id": 4399027046, "title": "Secure and Privacy-preserving Federated Learning with Explainable Artificial Intelligence for Smart Healthcare System", "abstract": "The growing population around the globe has a significant impact on various sectors including the labor force, healthcare, and the global economy. The healthcare sector is among the most affected sectors by the growing population due to the increasing demand for resources including doctors, nurses, equipment, and healthcare facilities. Intelligent systems have been incorporated to enhance decision-making, management, prognosis, and diagnosis in order to tackle such issues and offer improved healthcare to patients. Among such systems, those based on deep learning (DL), a subclass of machine learning (ML) have outperformed many traditional statistical and ML systems owing to their capability of automatically discovering and learning related features for a given task and robustness. Therefore, the use of DL has seen a steady increase in many applications. Nevertheless, usually, the training of DL models relies on a single centralized server, which brings many challenges: (1) except for some big enterprises most of the small enterprises have limited quality data, which is insufficient to support the training of data-hungry DL models, (2) access to data, which is vital for these systems, often raises privacy concerns. The collection and analysis of sensitive patient information must be done in a secure and ethical manner to ensure the protection of individual privacy rights, (3) high communication cost and computation resources required, (4) a large number of trainable parameters make the outcome of DL hard to explain, which is required in some applications, such as healthcare. Compared to centralized ML, federated learning (FL) improves both privacy and communication costs, where clients collaboratively train a joint model without sharing the raw data directly. FL minimizes privacy breaches and safeguards sensitive data by keeping it distributed locally. This enables collaborative model training while reducing the risk of unauthorized access and data breaches. Additionally, it promotes data diversity and scalability by involving multiple sources in joint model training and decreases communication costs by sharing only model updates instead of the entire dataset. However, FL brings its own challenges. For example, heterogeneous local data among the clients makes it challenging to train a high-performing and robust global model. Sharing updates (hundreds of thousands of parameters) still has high communication costs. Additionally, the distributed nature and access control of local data in FL make it more vulnerable to malicious attacks. Moreover, the challenge of explaining the results of DL still remains challenging, and methods are needed to be developed to bring trust accountability, and transparency in sensitive applications, such as healthcare. Therefore, the aim of this thesis is to create robust frameworks that are secure, high-performing, and privacy-friendly within federated settings. These frameworks will be specifically designed for end-to-end (we train our frameworks using raw data without any manual feature extraction) healthcare applications, considering the presence of non-identically distributed data among clients in FL to bring robustness. By addressing these challenges, the objective is to enhance the overall system's resilience and effectiveness. We also propose a methodology for detecting anomalies within federated settings, particularly in applications with limited available data for the abnormal class. Furthermore, clients in FL are usually resource-constrained with limited computation and communication resources available. Therefore, to support efficient computation and communication in a federated setting we propose a lightweight framework (in terms of the trainable number of parameters). Additionally, to provide explanations of the DL models' outcomes, which are usually hard to explain because of the large number of parameters, we propose model-agnostic explainable AI modules to help explain the results of DL models. Moreover, in order to protect the proposed frameworks against cyber attacks, such as poisoning attacks, we propose a framework in federated settings, which makes the proposed healthcare frameworks more secure and trustworthy. Finally, with experimental analysis using baseline datasets for one of the most common health conditions i.e., cardiovascular diseases (arrhythmia detection, ECG anomaly detection) and human activity recognition (used for supplementing cardiovascular diseases detection), we show the superiority of the proposed frameworks over state-of-the-art work."} | 63 | +{"work_id": 4412565294, "title": "A Survey of Machine Unlearning", "abstract": "Today, computer systems hold large amounts of personal data. Yet while such an abundance of data allows breakthroughs in AI, and especially machine learning, its existence can be a threat to user privacy, and it can weaken the bonds of trust between humans and AI. Recent regulations now require that, on request, private information about a user must be removed both from computer systems and from machine learning models\u2014this legislation is more colloquially called \u201cthe right to be forgotten.\u201d While removing data from back-end databases should be straightforward, it is not sufficient in the AI context as machine learning models often \u201cremember\u201d the old data. Contemporary adversarial attacks on trained models have proven that we can learn whether an instance or an attribute belonged to the training data. This phenomenon calls for a new paradigm, namely machine unlearning , to make machine learning models forget about particular data. It turns out that recent works on machine unlearning have not been able to completely solve the problem due to the lack of common frameworks and resources. Therefore, this article aspires to present a comprehensive examination of machine unlearning\u2019s concepts, designs, methods, and applications. Specifically, as a category collection of cutting-edge studies, the intention behind this article is to serve as a comprehensive resource for researchers and practitioners seeking an introduction to machine unlearning and its formulations, design criteria, removal requests, algorithms, and applications. In addition, we aim to highlight the key findings, current trends, and new research areas that have not yet featured the use of machine unlearning but could benefit greatly from it. We hope that this survey serves as a valuable resource for machine learning researchers and those seeking to innovate privacy technologies. Our resources are publicly available at https://github.com/tamlhp/awesome-machine-unlearning ."} | ||
| 64 | +{"work_id": 4320717855, "title": "Blockchain for the metaverse: A Review", "abstract": "Since Facebook officially changed its name to Meta in Oct. 2021, the metaverse has become a new norm of social networks and three-dimensional (3D) virtual worlds. The metaverse aims to bring 3D immersive and personalized experiences to users by leveraging many pertinent technologies. Despite great attention and benefits, a natural question in the metaverse is how to secure its users' digital content and data. In this regard, blockchain is a promising solution owing to its distinct features of decentralization, immutability, and transparency. To better understand the role of blockchain in the metaverse, we aim to provide an extensive survey on the applications of blockchain for the metaverse. We first present a preliminary to blockchain and the metaverse and highlight the motivations behind the use of blockchain for the metaverse. Next, we extensively discuss blockchain-based methods for the metaverse from technical perspectives, such as data acquisition, data storage, data sharing, data interoperability, and data privacy preservation. For each perspective, we first discuss the technical challenges of the metaverse and then highlight how blockchain can help. Moreover, we investigate the impact of blockchain on key-enabling technologies in the metaverse, including Internet-of-Things, digital twins, multi-sensory and immersive applications, artificial intelligence, and big data. We also present some major projects to showcase the role of blockchain in metaverse applications and services. Finally, we present some promising directions to drive further research innovations and developments toward the use of blockchain in the metaverse in the future."} | ||||
| 65 | +{"work_id": 7154469464, "title": "Cryptanalysis and Improvement of a Video Cryptosystem via Chaos and S-Box", "abstract": "In recent years, chaos-based multimedia cryptosystems have gained prominence due to their nonlinear properties, such as sensitivity to initial conditions and long-term unpredictability, which parallel the cryptographic requirements of confusion and diffusion. However, many such systems lack standardization and deviate from secure design principles, resulting in practical vulnerabilities. This article presents a comprehensive cryptanalysis of a widely cited video cryptosystem. The target system combines S-box substitution\u2014derived from either a 12D chaotic map or the Ikeda delay differential equation (DDE)\u2014with a Cipher Block Chaining (CBC) diffusion scheme. Through an analysis of the encryption structure, fundamental design defects are identified. Specifically, the CBC diffusion mechanism lacks key dependence, and the system exhibits an excessive reliance on fixed, publicly exposed S-boxes. These vulnerabilities are demonstrated through chosen-plaintext attacks, known-plaintext attacks, and chosen-ciphertext attacks. Experimental results confirm that the S-box can be fully reconstructed, thereby facilitating the complete decryption of video content in the absence of the secret key. Beyond exposing vulnerabilities, this study offers constructive contributions by proposing six concrete improvement strategies, including dynamic key generation, structural enhancement, and dynamic S-box indexing. This work provides practical suggestions for designing secure chaos-based multimedia cryptosystems, offering valuable references for future research and promoting the development of efficient encryption systems."} | ||||
| 66 | +{"work_id": 4389365236, "title": "Adaptive Learning Using Artificial Intelligence in e-Learning: A Literature Review", "abstract": "The rapid evolution of e-learning platforms, propelled by advancements in artificial intelligence (AI) and machine learning (ML), presents a transformative potential in education. This dynamic landscape necessitates an exploration of AI/ML integration in adaptive learning systems to enhance educational outcomes. This study aims to map the current utilization of AI/ML in e-learning for adaptive learning, elucidating the benefits and challenges of such integration and assessing its impact on student engagement, retention, and performance. A comprehensive literature review was conducted, focusing on articles published from 2010 onwards, to document the integration of AI/ML in e-learning. The review analyzed 63 articles, employing a systematic approach to evaluate the deployment of adaptive learning algorithms and their educational implications. Findings reveal that AI/ML algorithms are instrumental in personalizing learning experiences. These technologies have been shown to optimize learning paths, enhance engagement, and improve academic performance, with some studies reporting increased test scores. The integration of AI/ML in e-learning platforms significantly contributes to the personalization and effectiveness of the educational process. Despite challenges like data privacy and the complexity of AI/ML systems, the results underscore the potential of adaptive learning to revolutionize education by catering to individual learner needs."} | ||||
| 67 | +{"work_id": 4402275599, "title": "Implementing Blockchain Technology for Optimized Supply Chain and Enhanced Sustainability", "abstract": "Supply chain efficiency, transparency, and sustainability can be enhanced using blockchain technology. Blockchain enables a company to accurately track raw material origin to finished products, which ensures standard quality and sustainability. Furthermore, blockchain improves partnerships between supply chain stakeholders by providing a confident, common platform for sharing data. The influence of implementing blockchain technology on supply chain sustainability includes reduced wastage, increased resource transparency, monitoring of social standards, and reduced operational costs. The challenges of blockchain implementation include scalability, incorporation with present systems, lack of expertise, safety and confidentiality, and regulatory uncertainty. Companies can tackle these challenges through collaborative approaches and technical improvements. In general, blockchain technology significantly enhances supply chain sustainability and efficiency, which provides opportunities for creative business solutions."} | ||||
| 68 | +{"work_id": 7133255133, "title": "Federated Learning: A Survey of Core Challenges, Current Methods, and Opportunities", "abstract": "Federated Learning (FL) has emerged as a transformative distributed learning paradigm that enables collaborative model training without sharing raw data, thereby preserving privacy across large, diverse, and geographically dispersed clients. Despite its rapid adoption in mobile networks, IoT systems, healthcare, finance, and edge intelligence, FL continues to face several persistent and interdependent challenges that hinder its scalability, efficiency, and real-world deployment. In this survey, we present a systematic examination of six core challenges in federated learning: heterogeneity, computation overhead, communication bottlenecks, client selection, aggregation and optimization, and privacy preservation. We analyze how these challenges manifest across the full FL pipeline, from local training and client participation to global model aggregation and distribution, and examine their impact on model performance, convergence behavior, fairness, and system reliability. Furthermore, we synthesize representative state-of-the-art approaches proposed to address each challenge and discuss their underlying assumptions, trade-offs, and limitations in practical deployments. Finally, we identify open research problems and outline promising directions for developing more robust, scalable, and efficient federated learning systems. This survey aims to serve as a comprehensive reference for researchers and practitioners seeking a unified understanding of the fundamental challenges shaping modern federated learning."} | ||||
| 69 | +{"work_id": 2784387076, "title": "Blockchains and the economic institutions of capitalism", "abstract": "Abstract Blockchains are a new digital technology that combines peer-to-peer network computing and cryptography to create an immutable decentralised public ledger. Where the ledger records money, a blockchain is a cryptocurrency, such as Bitcoin; but ledger entries can record any data structure, including property titles, identity and certification, contracts, and so on. We argue that the economics of blockchains extend beyond analysis of a new general purpose technology and its disruptive Schumpeterian consequences to the broader idea that blockchains are an institutional technology. We consider several examples of blockchain-based economic coordination and governance. We claim that blockchains are an instance of institutional evolution."} | ||||
| 70 | +{"work_id": 4393156671, "title": "FedTGP: Trainable Global Prototypes with Adaptive-Margin-Enhanced Contrastive Learning for Data and Model Heterogeneity in Federated Learning", "abstract": "Recently, Heterogeneous Federated Learning (HtFL) has attracted attention due to its ability to support heterogeneous models and data. To reduce the high communication cost of transmitting model parameters, a major challenge in HtFL, prototype-based HtFL methods are proposed to solely share class representatives, a.k.a, prototypes, among heterogeneous clients while maintaining the privacy of clients\u2019 models. However, these prototypes are naively aggregated into global prototypes on the server using weighted averaging, resulting in suboptimal global knowledge which negatively impacts the performance of clients. To overcome this challenge, we introduce a novel HtFL approach called FedTGP, which leverages our Adaptive-margin-enhanced Contrastive Learning (ACL) to learn Trainable Global Prototypes (TGP) on the server. By incorporating ACL, our approach enhances prototype separability while preserving semantic meaning. Extensive experiments with twelve heterogeneous models demonstrate that our FedTGP surpasses state-of-the-art methods by up to 9.08% in accuracy while maintaining the communication and privacy advantages of prototype-based HtFL. Our code is available at https://github.com/TsingZ0/FedTGP."} | ||||
| 71 | +{"work_id": 2783535300, "title": "The Supply Chain Has No Clothes: Technology Adoption of Blockchain for Supply Chain Transparency", "abstract": "Blockchain technology, popularized by Bitcoin cryptocurrency, is characterized as an open-source, decentralized, distributed database for storing transaction information. Rather than relying on centralized intermediaries (e.g., banks) this technology allows two parties to transact directly using duplicate, linked ledgers called blockchains. This makes transactions considerably more transparent than those provided by centralized systems. As a result, transactions are executed without relying on explicit trust [of a third party], but on the distributed trust based on the consensus of the network (i.e., other blockchain users). Applying this technology to improve supply chain transparency has many possibilities. Every product has a long and storied history. However, much of this history is presently obscured. Often, when negative practices are exposed, they quickly escalate to scandalous, and financially crippling proportions. There are many recent examples, such as the exposure of child labor upstream in the manufacturing process and the unethical use of rainforest resources. Blockchain may bring supply chain transparency to a new level, but presently academic and managerial adoption of blockchain technologies is limited by our understanding. To address this issue, this research uses the Unified Theory of Acceptance and Use of Technology (UTAUT) and the concept of technology innovation adoption as a foundational framework for supply chain traceability. A conceptual model is developed and the research culminates with supply chain implications of blockchain that are inspired by theory and literature review."} | ||||
| 66 | {"work_id": 4220942018, "title": "Public and private blockchains", "abstract": "In the previous section we discussed cryptocurrencies, but not all blockchains are used for this, many are used for more restricted access purposes, like supply chain management. We look at these private blockchains and what the differences are, discussing Certificates and Certificate Authorities, Membership Service Providers, Channels and the World State."} | 72 | {"work_id": 4220942018, "title": "Public and private blockchains", "abstract": "In the previous section we discussed cryptocurrencies, but not all blockchains are used for this, many are used for more restricted access purposes, like supply chain management. We look at these private blockchains and what the differences are, discussing Certificates and Certificate Authorities, Membership Service Providers, Channels and the World State."} | ||
| 67 | {"work_id": 4289548059, "title": "Detecting Cross-Function Reentrancy from EVM Traces", "abstract": "Reentrancy remains one of the most critical vulnerabilities affecting Ethereum smart contracts. While many existing analysis tools focus on detecting classical single-function reentrancy, more complex forms such as cross-function reentrancy are harder to identify because they depend on execution semantics and interactions between multiple functions. In this work, we study reentrancy at the level of Ethereum Virtual Machine (EVM) execution traces. We extend the TxSpector framework with new Datalog-based detection rules designed to capture cross-function reentrancy patterns. To support this analysis, we also modernize the trace extraction component by adapting it to recent versions of the Ethereum client and updated EVM instructions. The proposed approach is evaluated on real Ethereum on-chain transaction traces. The results show that our method is able to detect cross-function reentrancy behaviors that are not captured by the original TxSpector rules, demonstrating the effectiveness of pattern-based logic detection at the EVM execution level."} | 73 | {"work_id": 4289548059, "title": "Detecting Cross-Function Reentrancy from EVM Traces", "abstract": "Reentrancy remains one of the most critical vulnerabilities affecting Ethereum smart contracts. While many existing analysis tools focus on detecting classical single-function reentrancy, more complex forms such as cross-function reentrancy are harder to identify because they depend on execution semantics and interactions between multiple functions. In this work, we study reentrancy at the level of Ethereum Virtual Machine (EVM) execution traces. We extend the TxSpector framework with new Datalog-based detection rules designed to capture cross-function reentrancy patterns. To support this analysis, we also modernize the trace extraction component by adapting it to recent versions of the Ethereum client and updated EVM instructions. The proposed approach is evaluated on real Ethereum on-chain transaction traces. The results show that our method is able to detect cross-function reentrancy behaviors that are not captured by the original TxSpector rules, demonstrating the effectiveness of pattern-based logic detection at the EVM execution level."} | ||
| 68 | {"work_id": 4226075590, "title": "Status report on the third round of the NIST Post-Quantum Cryptography Standardization process", "abstract": "The National Institute of Standards and Technology is in the process of selecting public-key cryptographic algorithms through a public, competition-like process. The new public-key cryptography standards will specify additional digital signature, public-key encryption, and key-establishment algorithms to augment Federal Information Processing Standard (FIPS) 186-4, Digital Signature Standard (DSS), as well as NIST Special Publication (SP) 800-56A Revision 3, Recommendation for Pair-Wise Key-Establishment Schemes Using Discrete Logarithm Cryptography, and SP 800-56B Revision 2, Recommendation for Pair-Wise Key Establishment Using Integer Factorization Cryptography. It is intended that these algorithms will be capable of protecting sensitive information well into the foreseeable future, including after the advent of quantum computers. The first round of the NIST Post-Quantum Cryptography Standardization Process began in December 2017 with 69 candidate algorithms that met both the minimum acceptance criteria and submission requirements. The first round lasted until January 2019, during which candidate algorithms were evaluated based on their security, performance, and other characteristics. NIST selected 26 algorithms to advance to the second round for more analysis. The second round continued until July 2020, after which seven 'finalist' and eight 'alternate' candidate algorithms were selected to move into the third round. This report describes the evaluation and selection process, based on public feedback and internal review, of the third-round candidates. The report summarizes each of the 15 third-round candidate algorithms and identifies those selected for standardization, as well as those that will continue to be evaluated in a fourth round of analysis. The public-key encryption and key-establishment algorithm that will be standardized is CRYSTALS-Kyber. The digital signatures that will be standardized are CRYSTALS-Dilithium, Falcon, and SPHINCS+. While there are multiple signature algorithms selected, NIST recommends CRYSTALS-Dilithium as the primary algorithm to be implemented. In addition, four of the alternate key-establishment candidate algorithms will advance to a fourth round of evaluation: BIKE, Classic McEliece, HQC, and SIKE. These candidates are still being considered for future standardization. NIST will also issue a new Call for Proposals for public-key digital signature algorithms to augment and diversify its signature portfolio."} | 74 | {"work_id": 4226075590, "title": "Status report on the third round of the NIST Post-Quantum Cryptography Standardization process", "abstract": "The National Institute of Standards and Technology is in the process of selecting public-key cryptographic algorithms through a public, competition-like process. The new public-key cryptography standards will specify additional digital signature, public-key encryption, and key-establishment algorithms to augment Federal Information Processing Standard (FIPS) 186-4, Digital Signature Standard (DSS), as well as NIST Special Publication (SP) 800-56A Revision 3, Recommendation for Pair-Wise Key-Establishment Schemes Using Discrete Logarithm Cryptography, and SP 800-56B Revision 2, Recommendation for Pair-Wise Key Establishment Using Integer Factorization Cryptography. It is intended that these algorithms will be capable of protecting sensitive information well into the foreseeable future, including after the advent of quantum computers. The first round of the NIST Post-Quantum Cryptography Standardization Process began in December 2017 with 69 candidate algorithms that met both the minimum acceptance criteria and submission requirements. The first round lasted until January 2019, during which candidate algorithms were evaluated based on their security, performance, and other characteristics. NIST selected 26 algorithms to advance to the second round for more analysis. The second round continued until July 2020, after which seven 'finalist' and eight 'alternate' candidate algorithms were selected to move into the third round. This report describes the evaluation and selection process, based on public feedback and internal review, of the third-round candidates. The report summarizes each of the 15 third-round candidate algorithms and identifies those selected for standardization, as well as those that will continue to be evaluated in a fourth round of analysis. The public-key encryption and key-establishment algorithm that will be standardized is CRYSTALS-Kyber. The digital signatures that will be standardized are CRYSTALS-Dilithium, Falcon, and SPHINCS+. While there are multiple signature algorithms selected, NIST recommends CRYSTALS-Dilithium as the primary algorithm to be implemented. In addition, four of the alternate key-establishment candidate algorithms will advance to a fourth round of evaluation: BIKE, Classic McEliece, HQC, and SIKE. These candidates are still being considered for future standardization. NIST will also issue a new Call for Proposals for public-key digital signature algorithms to augment and diversify its signature portfolio."} | ||
| 69 | {"work_id": 7137155252, "title": "Differentially Private Federated Learning: A Systematic Review", "abstract": "In recent years, privacy and security concerns in machine learning have promoted trusted federated learning to the forefront of research. Differential privacy has emerged as the de facto standard for privacy protection in federated learning due to its rigorous mathematical foundation and provable guarantee. Despite extensive research on algorithms that incorporate differential privacy within federated learning, there remains an evident deficiency in systematic reviews that categorize and synthesize these studies. Our work presents a systematic overview of the differentially private federated learning. Existing taxonomies have not adequately considered objects and level of privacy protection provided by various differential privacy models in federated learning. To rectify this gap, we propose a new taxonomy of differentially private federated learning based on definition and guarantee of various differential privacy models and federated scenarios. Our classification allows for a clear delineation of the protected objects across various differential privacy models and their respective neighborhood levels within federated learning environments. Furthermore, we explore the applications of differential privacy in federated learning scenarios. Our work provide valuable insights into privacy-preserving federated learning and suggest practical directions for future research."} | 75 | {"work_id": 7137155252, "title": "Differentially Private Federated Learning: A Systematic Review", "abstract": "In recent years, privacy and security concerns in machine learning have promoted trusted federated learning to the forefront of research. Differential privacy has emerged as the de facto standard for privacy protection in federated learning due to its rigorous mathematical foundation and provable guarantee. Despite extensive research on algorithms that incorporate differential privacy within federated learning, there remains an evident deficiency in systematic reviews that categorize and synthesize these studies. Our work presents a systematic overview of the differentially private federated learning. Existing taxonomies have not adequately considered objects and level of privacy protection provided by various differential privacy models in federated learning. To rectify this gap, we propose a new taxonomy of differentially private federated learning based on definition and guarantee of various differential privacy models and federated scenarios. Our classification allows for a clear delineation of the protected objects across various differential privacy models and their respective neighborhood levels within federated learning environments. Furthermore, we explore the applications of differential privacy in federated learning scenarios. Our work provide valuable insights into privacy-preserving federated learning and suggest practical directions for future research."} | ||
| 70 | {"work_id": 2907683311, "title": "Blockchain for AI: Review and Open Research Challenges", "abstract": "Recently, artificial intelligence (AI) and blockchain have become two of the most trending and disruptive technologies. Blockchain technology has the ability to automate payment in cryptocurrency and to provide access to a shared ledger of data, transactions, and logs in a decentralized, secure, and trusted manner. Also with smart contracts, blockchain has the ability to govern interactions among participants with no intermediary or a trusted third party. AI, on the other hand, offers intelligence and decision-making capabilities for machines similar to humans. In this paper, we present a detailed survey on blockchain applications for AI. We review the literature, tabulate, and summarize the emerging blockchain applications, platforms, and protocols specifically targeting AI area. We also identify and discuss open research challenges of utilizing blockchain technologies for AI."} | 76 | {"work_id": 2907683311, "title": "Blockchain for AI: Review and Open Research Challenges", "abstract": "Recently, artificial intelligence (AI) and blockchain have become two of the most trending and disruptive technologies. Blockchain technology has the ability to automate payment in cryptocurrency and to provide access to a shared ledger of data, transactions, and logs in a decentralized, secure, and trusted manner. Also with smart contracts, blockchain has the ability to govern interactions among participants with no intermediary or a trusted third party. AI, on the other hand, offers intelligence and decision-making capabilities for machines similar to humans. In this paper, we present a detailed survey on blockchain applications for AI. We review the literature, tabulate, and summarize the emerging blockchain applications, platforms, and protocols specifically targeting AI area. We also identify and discuss open research challenges of utilizing blockchain technologies for AI."} | ||
| 77 | +{"work_id": 4312634912, "title": "Layer-wised Model Aggregation for Personalized Federated Learning", "abstract": "Personalized Federated Learning (pFL) not only can capture the common priors from broad range of distributed data, but also support customized models for heterogeneous clients. Researches over the past few years have applied the weighted aggregation manner to produce personalized models, where the weights are determined by calibrating the distance of the entire model parameters or loss values, and have yet to consider the layer-level impacts to the aggregation process, leading to lagged model convergence and inadequate personalization over non-IID datasets. In this paper, we propose a novel pFL training framework dubbed Layer-wised Personalized Federated learning (pFedLA) that can discern the importance of each layer from different clients, and thus is able to optimize the personalized model aggregation for clients with heterogeneous data. Specifically, we employ a dedicated hyper-network per client on the server side, which is trained to identify the mutual contribution factors at layer granularity. Meanwhile, a parameterized mechanism is introduced to update the layer-wised aggregation weights to progressively exploit the inter-user similarity and realize accurate model personalization. Extensive experiments are conducted over different models and learning tasks, and we show that the proposed methods achieve significantly higher performance than state-of-the-art pFL methods."} | ||||
| 71 | {"work_id": 4402716118, "title": "FedAS: Bridging Inconsistency in Personalized Federated Learning", "abstract": "Personalized Federated Learning (PFL) is primarily de-signed to provide customized models for each client to better fit the non-iid distributed client data, which is a inherent challenge in Federated Learning. However, current PFL methods suffer from inconsistencies in both intra-client and inter-client levels: 1) The intra-client inconsistency stems from the asynchronous update strategy for personalized and shared parameters. In PFL, clients update their shared parameters to communicate and learn from others, while keeping personalized parts unchanged, leading to poor coordination between these two components. 2) The Inter-client inconsistency arises from \u201cstragglers\u201d - inactive clients that communicate and train with the server less frequently. This results in their under-trained personalized models and impedes the collaborative training stage for other clients. In this paper, we present a novel PFL framework named FedAS, which uses Federated Parameter-Alignment and Client-Synchronization to overcome above challenges. Initially, we enhance the localization of global parameters by infusing them with local insights. We make the shared parts learn from previous model, thereby increasing their local relevance and reducing the impact of parameter inconsistency. Furthermore, we design a robust aggregation method to mitigate the impact of stragglers by preventing the incorporation of their under-trained knowledge into aggregated model. Experimental results on CifarlO and CifarlOO validate the effectiveness of our FedAS in achieving better performance and robustness against data heterogeneity."} | 78 | {"work_id": 4402716118, "title": "FedAS: Bridging Inconsistency in Personalized Federated Learning", "abstract": "Personalized Federated Learning (PFL) is primarily de-signed to provide customized models for each client to better fit the non-iid distributed client data, which is a inherent challenge in Federated Learning. However, current PFL methods suffer from inconsistencies in both intra-client and inter-client levels: 1) The intra-client inconsistency stems from the asynchronous update strategy for personalized and shared parameters. In PFL, clients update their shared parameters to communicate and learn from others, while keeping personalized parts unchanged, leading to poor coordination between these two components. 2) The Inter-client inconsistency arises from \u201cstragglers\u201d - inactive clients that communicate and train with the server less frequently. This results in their under-trained personalized models and impedes the collaborative training stage for other clients. In this paper, we present a novel PFL framework named FedAS, which uses Federated Parameter-Alignment and Client-Synchronization to overcome above challenges. Initially, we enhance the localization of global parameters by infusing them with local insights. We make the shared parts learn from previous model, thereby increasing their local relevance and reducing the impact of parameter inconsistency. Furthermore, we design a robust aggregation method to mitigate the impact of stragglers by preventing the incorporation of their under-trained knowledge into aggregated model. Experimental results on CifarlO and CifarlOO validate the effectiveness of our FedAS in achieving better performance and robustness against data heterogeneity."} | ||
| 79 | +{"work_id": 6906013109, "title": "Blockchain Adoption in Organizations : Technical Barriers and Potential Solutions", "abstract": "Blockchain technology is considered a potential solution to many challenges businesses and public institutions face within the digital transformation. Specifically, blockchain-based IT solutions can enable cross-organizational digital interactions for which no universally trusted intermediary exists for economic, political, or social reasons. Related work suggests that the technical properties of blockchain networks align very well with the requirements of many applications and emphasizes management-related adoption challenges, for instance, identifying business models or developing effective governance approaches for decentralized systems. However, when taking a closer look at blockchain projects in organizations in practice, several technical issues appear significantly more relevant than anticipated. This doctoral thesis focuses on three essential representatives of these technical adoption barriers: (1) high electricity demand, (2) low performance accompanied by high operating costs, and (3) excessive transparency. I discuss to which extent these issues are problematic when implementing blockchain technology in organizations and survey solutions already being explored in academia and practice. Furthermore, I design and evaluate novel approaches for blockchain-based IT systems. I find that sustainability issues are not problematic in general but rather an undue extrapolation from Bitcoin's high electricity needs. In contrast, performance and data visibility aspects are more fundamental and difficult to solve for organizations. According to my analysis, permissioned blockchains that have been developed to address these issues often do not provide a sufficient solution. Serverless blockchains may be useful in specific scenarios in which high performance, favorable cost stuctures, seamless integration with cloud applications, as well as fine-granular access control are crucial aspects while a high degree of centralization is acceptable. In general, blockchain-based solutions in organizations that address performance and data visibility requirements will involve complex combinations of different cryptographic components and communication layers, with verifiable computation techniques such as zk-SNARKs and the bilateral exchange of verifiable attestations according to the self-sovereign identity paradigm playing a key role."} | ||||
| 72 | {"work_id": 1598516026, "title": "Scantegrity II Municipal Election at Takoma Park: The First E2E Binding Governmental Election with Ballot Privacy", "abstract": "On November 3, 2009, voters in Takoma Park, Maryland, cast ballots for the mayor and city council members using the Scantegrity II voting system-the first time any end-to-end (E2E) voting system with ballot privacy has been used in a binding governmental election.This case study describes the various efforts that went into the election-including the improved design and implementation of the voting system, streamlined procedures, agreements with the city, and assessments of the experiences of voters and poll workers.The election, with 1728 voters from six wards, involved paper ballots with invisible-ink confirmation codes, instant-runoff voting with write-ins, early and absentee (mail-in) voting, dual-language ballots, provisional ballots, privacy sleeves, any-which-way scanning with parallel conventional desktop scanners, end-to-end verifiability based on optional web-based voter verification of votes cast, a full hand recount, thresholded authorities, three independent outside auditors, fully-disclosed software, and exit surveys for voters and pollworkers.Despite some glitches, the use of Scantegrity II was a success, demonstrating that E2E cryptographic voting systems can be effectively used and accepted by the general public."} | 80 | {"work_id": 1598516026, "title": "Scantegrity II Municipal Election at Takoma Park: The First E2E Binding Governmental Election with Ballot Privacy", "abstract": "On November 3, 2009, voters in Takoma Park, Maryland, cast ballots for the mayor and city council members using the Scantegrity II voting system-the first time any end-to-end (E2E) voting system with ballot privacy has been used in a binding governmental election.This case study describes the various efforts that went into the election-including the improved design and implementation of the voting system, streamlined procedures, agreements with the city, and assessments of the experiences of voters and poll workers.The election, with 1728 voters from six wards, involved paper ballots with invisible-ink confirmation codes, instant-runoff voting with write-ins, early and absentee (mail-in) voting, dual-language ballots, provisional ballots, privacy sleeves, any-which-way scanning with parallel conventional desktop scanners, end-to-end verifiability based on optional web-based voter verification of votes cast, a full hand recount, thresholded authorities, three independent outside auditors, fully-disclosed software, and exit surveys for voters and pollworkers.Despite some glitches, the use of Scantegrity II was a success, demonstrating that E2E cryptographic voting systems can be effectively used and accepted by the general public."} | ||
| 81 | +{"work_id": 2909202584, "title": "Privacy-Preserving Energy Trading Using Consortium Blockchain in Smart Grid", "abstract": "Implementing blockchain techniques has enabled secure smart trading in many realms, e.g. neighboring energy trading. However, trading information recorded on the blockchain also brings privacy concerns. Attackers can utilize data mining algorithms to obtain users' privacy, specially, when the user group is located in nearby geographic positions. In this paper, we present a consortium blockchain-oriented approach to solve the problem of privacy leakage without restricting trading functions. The proposed approach mainly addresses energy trading users' privacy in smart grid and screens the distribution of energy sale of sellers deriving from the fact that various energy trading volumes can be mined to detect its relationships with other information, such as physical location and energy usage. Experiment evaluations have demonstrated the effectiveness of the proposed approach."} | ||||
| 73 | {"work_id": 4413785573, "title": "Encrypt a Story: A Video Segment Encryption Method Based on the Discrete Sinusoidal Memristive Rulkov Neuron", "abstract": "Traditional video encryption methods protect video content by encrypting each frame individually. However, in resource-constrained environments, this approach consumes significant computational resources. To overcome this challenge, this paper proposes a novel method called \u201cEncrypt a story (EAS)\u201d, which aims to enhance encryption efficiency by focusing on encrypting specific segments of the video rather than encrypting each frame. The EAS refers to selecting segments in the time dimension of the video that contain important information or key events for encryption. This method leverages video segmentation techniques to focus encryption efforts on continuous key frames, significantly reducing the consumption of computational resources. To address the need for a large number of key streams during the encryption process, this paper proposes a discrete sinusoidal memristive Rulkov neuron map (DSM-RNM). Through attractor analysis, complexity comparison, Lyapunov exponent, and NIST tests, we validated its ability to generate high-performance pseudorandom sequences, which significantly enhances the security of the encryption algorithm. Notably, the DSM-RNM is shown to exhibit a phenomenon of infinitely coexisting attractors. Furthermore, by constructing a digital circuit to capture the attractors of the DSM-RNM, its potential for industrial applications is demonstrated. Evaluation results show that the EAS saves approximately 90% of the time while ensuring security, exhibiting strong practicality and efficiency"} | 82 | {"work_id": 4413785573, "title": "Encrypt a Story: A Video Segment Encryption Method Based on the Discrete Sinusoidal Memristive Rulkov Neuron", "abstract": "Traditional video encryption methods protect video content by encrypting each frame individually. However, in resource-constrained environments, this approach consumes significant computational resources. To overcome this challenge, this paper proposes a novel method called \u201cEncrypt a story (EAS)\u201d, which aims to enhance encryption efficiency by focusing on encrypting specific segments of the video rather than encrypting each frame. The EAS refers to selecting segments in the time dimension of the video that contain important information or key events for encryption. This method leverages video segmentation techniques to focus encryption efforts on continuous key frames, significantly reducing the consumption of computational resources. To address the need for a large number of key streams during the encryption process, this paper proposes a discrete sinusoidal memristive Rulkov neuron map (DSM-RNM). Through attractor analysis, complexity comparison, Lyapunov exponent, and NIST tests, we validated its ability to generate high-performance pseudorandom sequences, which significantly enhances the security of the encryption algorithm. Notably, the DSM-RNM is shown to exhibit a phenomenon of infinitely coexisting attractors. Furthermore, by constructing a digital circuit to capture the attractors of the DSM-RNM, its potential for industrial applications is demonstrated. Evaluation results show that the EAS saves approximately 90% of the time while ensuring security, exhibiting strong practicality and efficiency"} | ||
| 74 | {"work_id": 2995735216, "title": "Fair Resource Allocation in Federated Learning", "abstract": "Federated learning involves training statistical models in massive, heterogeneous networks. Naively minimizing an aggregate loss function in such a network may disproportionately advantage or disadvantage some of the devices. In this work, we propose q-Fair Federated Learning (q-FFL), a novel optimization objective inspired by fair resource allocation in wireless networks that encourages a more fair (i.e., more uniform) accuracy distribution across devices in federated networks. To solve q-FFL, we devise a communication-efficient method, q-FedAvg, that is suited to federated networks. We validate both the effectiveness of q-FFL and the efficiency of q-FedAvg on a suite of federated datasets with both convex and non-convex models, and show that q-FFL (along with q-FedAvg) outperforms existing baselines in terms of the resulting fairness, flexibility, and efficiency."} | 83 | {"work_id": 2995735216, "title": "Fair Resource Allocation in Federated Learning", "abstract": "Federated learning involves training statistical models in massive, heterogeneous networks. Naively minimizing an aggregate loss function in such a network may disproportionately advantage or disadvantage some of the devices. In this work, we propose q-Fair Federated Learning (q-FFL), a novel optimization objective inspired by fair resource allocation in wireless networks that encourages a more fair (i.e., more uniform) accuracy distribution across devices in federated networks. To solve q-FFL, we devise a communication-efficient method, q-FedAvg, that is suited to federated networks. We validate both the effectiveness of q-FFL and the efficiency of q-FedAvg on a suite of federated datasets with both convex and non-convex models, and show that q-FFL (along with q-FedAvg) outperforms existing baselines in terms of the resulting fairness, flexibility, and efficiency."} | ||
| 75 | {"work_id": 2805930283, "title": "A Review on the Use of Blockchain for the Internet of Things", "abstract": "The paradigm of Internet of Things (IoT) is paving the way for a world, where many of our daily objects will be interconnected and will interact with their environment in order to collect information and automate certain tasks. Such a vision requires, among other things, seamless authentication, data privacy, security, robustness against attacks, easy deployment, and self-maintenance. Such features can be brought by blockchain, a technology born with a cryptocurrency called Bitcoin. In this paper, a thorough review on how to adapt blockchain to the specific needs of IoT in order to develop Blockchain-based IoT (BIoT) applications is presented. After describing the basics of blockchain, the most relevant BIoT applications are described with the objective of emphasizing how blockchain can impact traditional cloud-centered IoT applications. Then, the current challenges and possible optimizations are detailed regarding many aspects that affect the design, development, and deployment of a BIoT application. Finally, some recommendations are enumerated with the aim of guiding future BIoT researchers and developers on some of the issues that will have to be tackled before deploying the next generation of BIoT applications."} | 84 | {"work_id": 2805930283, "title": "A Review on the Use of Blockchain for the Internet of Things", "abstract": "The paradigm of Internet of Things (IoT) is paving the way for a world, where many of our daily objects will be interconnected and will interact with their environment in order to collect information and automate certain tasks. Such a vision requires, among other things, seamless authentication, data privacy, security, robustness against attacks, easy deployment, and self-maintenance. Such features can be brought by blockchain, a technology born with a cryptocurrency called Bitcoin. In this paper, a thorough review on how to adapt blockchain to the specific needs of IoT in order to develop Blockchain-based IoT (BIoT) applications is presented. After describing the basics of blockchain, the most relevant BIoT applications are described with the objective of emphasizing how blockchain can impact traditional cloud-centered IoT applications. Then, the current challenges and possible optimizations are detailed regarding many aspects that affect the design, development, and deployment of a BIoT application. Finally, some recommendations are enumerated with the aim of guiding future BIoT researchers and developers on some of the issues that will have to be tackled before deploying the next generation of BIoT applications."} | ||
| 76 | −{"work_id": 7125967353, "title": "An explainable transformer-based model for phishing email detection: A large language model approach", "abstract": "Phishing email is a serious cyber threat that tries to deceive users by sending false emails with the intention of stealing confidential information or causing financial harm. Attackers, often posing as trustworthy entities, exploit technological advancements and sophistication to make the detection and prevention of phishing more challenging. Despite extensive academic research, phishing detection remains an ongoing and formidable challenge in the cybersecurity landscape. In this research paper, we present a fine-tuned transformer-based masked language model, RoBERTa (Robustly Optimized BERT Pretraining Approach), for phishing email detection. In the detection process, we employ a phishing email dataset and apply the preprocessing techniques to clean and address the class imbalance issues, thereby enhancing model performance. The results of the experiment demonstrate that our fine-tuned model outperforms traditional machine learning models with an accuracy of 98.45%. To ensure model transparency and user trust, we propose a hybrid explanation approach, LITA (LIME-Transformer Attribution), which integrates the potential of Local Interpretable Model-Agnostic Explanations (LIME) and Transformers Interpret methods. The proposed method provides more consistent and user-friendly insights, mitigating local attribution inconsistencies between the two explanation approaches. Moreover, the study highlights the model\u2019s ability to generate its predictions by presenting positive and negative contribution scores using LIME, Transformers Interpret, and LITA."} | 85 | +{"work_id": 4401666902, "title": "Cyberfraud in the Nigerian Banking Sector: The Techniques and Preventive Measures", "abstract": "The cyberfraud techniques emerged as a significant threat to the banking sector in Nigeria. Bank customers have been losing their hard-earned funds to these measures due to a lack of sufficient awareness of the cyberfraud tactics and preventive measures. There has been an increased rate of loss recorded annually in the banking sector due to fraud. The banking sector in Nigeria recorded a loss to a tune amount of \u20a617.6bn in 2023 amount higher than the budget allocation for education in most states of the country. Social engineering remains the persistent and predominant technique fraudsters employ to defraud bank customers in Nigeria. Phishing, identity theft, login credential theft, ATM card swap, and skimming are other techniques cybercriminals employ. This research paper aims to examine and analyze the modus operandi of these techniques and explore the strategic preventive measures that can be implemented by customers to mitigate these risks, such as using advanced cybersecurity technologies, multi-factor authentication systems, employee training, as well as regulatory controls. The paper highlights the significance of a proactive and adaptive cybersecurity posture, continuous monitoring, and collaboration with regulatory bodies to enhance the resilience of the banking sector against cyber threats. The research focuses more on cyberfrauds targeting bank customers, and secondary data will be used for research purposes."} | ||
| 77 | −{"work_id": 4406028284, "title": "A Novel Dynamic Hill Cipher and Its Applications on Medical IoT", "abstract": "Cryptography is one of the most important areas in information security. Cryptography ensures secure communication and data privacy, and it is increasingly being applied in healthcare and related fields. As an important classical cryptographic method, the Hill cipher has always been closely studied by experts and scholars. In order to enhance the security of the conventional Hill cipher (CHC), a novel dynamic Hill cipher (NDHC) is proposed in this work. The proposed NDHC not only replaces the static key matrix of the CHC with a time-varying dynamic key matrix (TVDKM) to change the image pixel values over time t, but also uses the Logistic chaos sequence scrambling the image pixel positions, which greatly enhances the security of the CHC. However, how to effectively obtain the dynamic inversion key matrix (DIKM) of the TVDKM becomes an urgent issue in the NDHC decryption. In order to quickly find the DIKM, a fixed-time convergence fuzzy Zeroing neural network (FTCF-ZNN) model is constructed, and the convergence and robustness of the FTCF-ZNN model for solving the DIKM are verified through theoretical analysis and comparative experimental results. Moreover, the effectiveness and security of the proposed NDHC for medical images encryption and decryption are also validated by experiments."} | 86 | +{"work_id": 2790400697, "title": "A Survey on Big Data Market: Pricing, Trading and Protection", "abstract": "Big data is considered to be the key to unlocking the next great waves of growth in productivity. The amount of collected data in our world has been exploding due to a number of new applications and technologies that permeate our daily lives, including mobile and social networking applications, and Internet of Thing-based smart-world systems (smart grid, smart transportation, smart cities, and so on). With the exponential growth of data, how to efficiently utilize the data becomes a critical issue. This calls for the development of a big data market that enables efficient data trading. Via pushing data as a kind of commodity into a digital market, the data owners and consumers are able to connect with each other, sharing and further increasing the utility of data. Nonetheless, to enable such an effective market for data trading, several challenges need to be addressed, such as determining proper pricing for the data to be sold or purchased, designing a trading platform and schemes to enable the maximization of social welfare of trading participants with efficiency and privacy preservation, and protecting the traded data from being resold to maintain the value of the data. In this paper, we conduct a comprehensive survey on the lifecycle of data and data trading. To be specific, we first study a variety of data pricing models, categorize them into different groups, and conduct a comprehensive comparison of the pros and cons of these models. Then, we focus on the design of data trading platforms and schemes, supporting efficient, secure, and privacy-preserving data trading. Finally, we review digital copyright protection mechanisms, including digital copyright identifier, digital rights management, digital encryption, watermarking, and others, and outline challenges in data protection in the data trading lifecycle."} | ||
| 78 | −{"work_id": 2916447643, "title": "The Transport Layer Security (TLS) Protocol Version 1.3", "abstract": "This document specifies Version 1.1 of the Transport Layer Security\n(TLS) protocol. The TLS protocol provides communications security over\nthe Internet. The protocol allows client/server applications to\ncommunicate in a way that is designed to prevent eavesdropping,\ntampering, or message forgery. [STANDARDS-TRACK]"} | 87 | +{"work_id": 4302383326, "title": "Private Information Retrieval with Side Information", "abstract": "The objective of the classical Private Information Retrieval (PIR) problem is to enable a user to\\ndownload a message from a database that is replicated across a collection of non-colluding servers\\nwithout revealing the identity of the demanded message to the servers. In the classical PIR problem\\nthe user has no prior information about the content of messages in the database. It is easy to verify\\nin the special case of the PIR problem when there is only one server in the system, the user must\\ndownload all messages from the database in order keep information about the message they want\\nprivate.\\nIn a real environment the user may have other sources to download and obtain messages from\\nsuch as trusted peer-to-peer communication. In this way, the user has the potential to obtain some\\nof the messages that are contained in the database to use as side information in a PIR scheme with\\nthe servers. Accordingly, we introduce the Private Information Retrieval with Side Information\\n(PIR-SI) problem that focuses on settings in which the user has side information about some messages\\nin the database. To capture the different levels of privacy a user may want to enforce in\\nPIR-SI schemes two metrics of privacy, W-privacy and (W,S)-privacy, are introduced. W-privacy\\nonly protects information about the identity of the message that the user wants and is most similar\\nto the measure of privacy in the original PIR problem. (W, S)-privacy protects the identity of the\\nwanted message as well as the identities of the messages they have as side information and is a\\nstronger sense of privacy than W-privacy. When enforcing either measure of privacy the user no\\nlonger has to download all the messages in the database, even if there is only one server in the\\nsystem; side information reduces the amount of data that one has to download in a PIR scheme.\\nThe first case of the PIR-SI problem that we consider is when the user has M messages for side\\ninformation and wants a different message from the database of K messages. When there is only\\none server in the system, we show that the optimal download rate for a W-private scheme is k^-1/M+1\\nand the optimal download rate for a (W, S)-private scheme is 1/K-M.\\nWhen there is more than one\\nserver in the system a W-private scheme is presented that has a larger rate than the classical PIR\\nscheme, but its optimality is not shown.\\nThe second case of the PIR-SI problem that is considered is when the user has M messages as\\nside information, the user wants D > 1 distinct messages from the database, and there is only one\\nserver in the system. In the case when M = 1 a (W, S)-private optimal scheme is presented and\\nshown to be optimal. In the case when M \u2265 D and D = 2 a W-private scheme that can increase\\nthe rate from the (W, S)-private scheme with the same parameters is presented. This scheme\u2019s\\noptimality reminds an open problem. We highlight the difficulty of finding an optimal scheme and\\ndetermining the capacity of the multi-message PIR-SI problem."} | ||
| 79 | −{"work_id": 3162358200, "title": "Non-Fungible Token (NFT): Overview, Evaluation, Opportunities and Challenges", "abstract": "The Non-Fungible Token (NFT) market is mushrooming in recent years. The concept of NFT originally comes from a token standard of Ethereum, aiming to distinguish each token with distinguishable signs. This type of token can be bound with virtual/digital properties as their unique identifications. With NFTs, all marked properties can be freely traded with customized values according to their ages, rarity, liquidity, etc. It has greatly stimulated the prosperity of the decentralized application (DApp) market. At the time of writing (May 2021), the total money used on completed NFT sales has reached $34,530,649.86$ USD. The thousandfold return on its increasing market draws huge attention worldwide. However, the development of the NFT ecosystem is still in its early stage, and the technologies of NFTs are pre-mature. Newcomers may get lost in their frenetic evolution due to the lack of systematic summaries. In this technical report, we explore the NFT ecosystems in several aspects. We start with an overview of state-of-the-art NFT solutions, then provide their technical components, protocols, standards, and desired proprieties. Afterward, we give a security evolution, with discussions on the perspectives of their design models, opportunities, and challenges. To the best of our knowledge, this is the first systematic study on the current NFT ecosystems."} | 88 | +{"work_id": 4399027046, "title": "Secure and Privacy-preserving Federated Learning with Explainable Artificial Intelligence for Smart Healthcare System", "abstract": "The growing population around the globe has a significant impact on various sectors including the labor force, healthcare, and the global economy. The healthcare sector is among the most affected sectors by the growing population due to the increasing demand for resources including doctors, nurses, equipment, and healthcare facilities. Intelligent systems have been incorporated to enhance decision-making, management, prognosis, and diagnosis in order to tackle such issues and offer improved healthcare to patients. Among such systems, those based on deep learning (DL), a subclass of machine learning (ML) have outperformed many traditional statistical and ML systems owing to their capability of automatically discovering and learning related features for a given task and robustness. Therefore, the use of DL has seen a steady increase in many applications. Nevertheless, usually, the training of DL models relies on a single centralized server, which brings many challenges: (1) except for some big enterprises most of the small enterprises have limited quality data, which is insufficient to support the training of data-hungry DL models, (2) access to data, which is vital for these systems, often raises privacy concerns. The collection and analysis of sensitive patient information must be done in a secure and ethical manner to ensure the protection of individual privacy rights, (3) high communication cost and computation resources required, (4) a large number of trainable parameters make the outcome of DL hard to explain, which is required in some applications, such as healthcare. Compared to centralized ML, federated learning (FL) improves both privacy and communication costs, where clients collaboratively train a joint model without sharing the raw data directly. FL minimizes privacy breaches and safeguards sensitive data by keeping it distributed locally. This enables collaborative model training while reducing the risk of unauthorized access and data breaches. Additionally, it promotes data diversity and scalability by involving multiple sources in joint model training and decreases communication costs by sharing only model updates instead of the entire dataset. However, FL brings its own challenges. For example, heterogeneous local data among the clients makes it challenging to train a high-performing and robust global model. Sharing updates (hundreds of thousands of parameters) still has high communication costs. Additionally, the distributed nature and access control of local data in FL make it more vulnerable to malicious attacks. Moreover, the challenge of explaining the results of DL still remains challenging, and methods are needed to be developed to bring trust accountability, and transparency in sensitive applications, such as healthcare. Therefore, the aim of this thesis is to create robust frameworks that are secure, high-performing, and privacy-friendly within federated settings. These frameworks will be specifically designed for end-to-end (we train our frameworks using raw data without any manual feature extraction) healthcare applications, considering the presence of non-identically distributed data among clients in FL to bring robustness. By addressing these challenges, the objective is to enhance the overall system's resilience and effectiveness. We also propose a methodology for detecting anomalies within federated settings, particularly in applications with limited available data for the abnormal class. Furthermore, clients in FL are usually resource-constrained with limited computation and communication resources available. Therefore, to support efficient computation and communication in a federated setting we propose a lightweight framework (in terms of the trainable number of parameters). Additionally, to provide explanations of the DL models' outcomes, which are usually hard to explain because of the large number of parameters, we propose model-agnostic explainable AI modules to help explain the results of DL models. Moreover, in order to protect the proposed frameworks against cyber attacks, such as poisoning attacks, we propose a framework in federated settings, which makes the proposed healthcare frameworks more secure and trustworthy. Finally, with experimental analysis using baseline datasets for one of the most common health conditions i.e., cardiovascular diseases (arrhythmia detection, ECG anomaly detection) and human activity recognition (used for supplementing cardiovascular diseases detection), we show the superiority of the proposed frameworks over state-of-the-art work."} | ||
| 80 | −{"work_id": 4402275599, "title": "Implementing Blockchain Technology for Optimized Supply Chain and Enhanced Sustainability", "abstract": "Supply chain efficiency, transparency, and sustainability can be enhanced using blockchain technology. Blockchain enables a company to accurately track raw material origin to finished products, which ensures standard quality and sustainability. Furthermore, blockchain improves partnerships between supply chain stakeholders by providing a confident, common platform for sharing data. The influence of implementing blockchain technology on supply chain sustainability includes reduced wastage, increased resource transparency, monitoring of social standards, and reduced operational costs. The challenges of blockchain implementation include scalability, incorporation with present systems, lack of expertise, safety and confidentiality, and regulatory uncertainty. Companies can tackle these challenges through collaborative approaches and technical improvements. In general, blockchain technology significantly enhances supply chain sustainability and efficiency, which provides opportunities for creative business solutions."} | ||||
| 81 | −{"work_id": 7133255133, "title": "Federated Learning: A Survey of Core Challenges, Current Methods, and Opportunities", "abstract": "Federated Learning (FL) has emerged as a transformative distributed learning paradigm that enables collaborative model training without sharing raw data, thereby preserving privacy across large, diverse, and geographically dispersed clients. Despite its rapid adoption in mobile networks, IoT systems, healthcare, finance, and edge intelligence, FL continues to face several persistent and interdependent challenges that hinder its scalability, efficiency, and real-world deployment. In this survey, we present a systematic examination of six core challenges in federated learning: heterogeneity, computation overhead, communication bottlenecks, client selection, aggregation and optimization, and privacy preservation. We analyze how these challenges manifest across the full FL pipeline, from local training and client participation to global model aggregation and distribution, and examine their impact on model performance, convergence behavior, fairness, and system reliability. Furthermore, we synthesize representative state-of-the-art approaches proposed to address each challenge and discuss their underlying assumptions, trade-offs, and limitations in practical deployments. Finally, we identify open research problems and outline promising directions for developing more robust, scalable, and efficient federated learning systems. This survey aims to serve as a comprehensive reference for researchers and practitioners seeking a unified understanding of the fundamental challenges shaping modern federated learning."} | ||||
| 82 | −{"work_id": 2784387076, "title": "Blockchains and the economic institutions of capitalism", "abstract": "Abstract Blockchains are a new digital technology that combines peer-to-peer network computing and cryptography to create an immutable decentralised public ledger. Where the ledger records money, a blockchain is a cryptocurrency, such as Bitcoin; but ledger entries can record any data structure, including property titles, identity and certification, contracts, and so on. We argue that the economics of blockchains extend beyond analysis of a new general purpose technology and its disruptive Schumpeterian consequences to the broader idea that blockchains are an institutional technology. We consider several examples of blockchain-based economic coordination and governance. We claim that blockchains are an instance of institutional evolution."} | ||||
| 83 | −{"work_id": 4393156671, "title": "FedTGP: Trainable Global Prototypes with Adaptive-Margin-Enhanced Contrastive Learning for Data and Model Heterogeneity in Federated Learning", "abstract": "Recently, Heterogeneous Federated Learning (HtFL) has attracted attention due to its ability to support heterogeneous models and data. To reduce the high communication cost of transmitting model parameters, a major challenge in HtFL, prototype-based HtFL methods are proposed to solely share class representatives, a.k.a, prototypes, among heterogeneous clients while maintaining the privacy of clients\u2019 models. However, these prototypes are naively aggregated into global prototypes on the server using weighted averaging, resulting in suboptimal global knowledge which negatively impacts the performance of clients. To overcome this challenge, we introduce a novel HtFL approach called FedTGP, which leverages our Adaptive-margin-enhanced Contrastive Learning (ACL) to learn Trainable Global Prototypes (TGP) on the server. By incorporating ACL, our approach enhances prototype separability while preserving semantic meaning. Extensive experiments with twelve heterogeneous models demonstrate that our FedTGP surpasses state-of-the-art methods by up to 9.08% in accuracy while maintaining the communication and privacy advantages of prototype-based HtFL. Our code is available at https://github.com/TsingZ0/FedTGP."} | ||||
| 84 | {"work_id": 1497727960, "title": "FLINT : Fast library for number theory", "abstract": "Alternative version: Published as: Hart, W. B. (2010). Fast library for number theory : an introduction. Presented at: 3rd International Congress on Mathematical Software, Kobe, Japan, 13-17 September 2010. http://wrap.warwick.ac.uk/id/eprint/41629"} | 89 | {"work_id": 1497727960, "title": "FLINT : Fast library for number theory", "abstract": "Alternative version: Published as: Hart, W. B. (2010). Fast library for number theory : an introduction. Presented at: 3rd International Congress on Mathematical Software, Kobe, Japan, 13-17 September 2010. http://wrap.warwick.ac.uk/id/eprint/41629"} | ||
| 85 | −{"work_id": 7160824505, "title": "Evaluation of Artificial Intelligence and Blockchain Integration Utilizing the DEM ATEL Method to Improve Privacy and Transparent in the Financial Sector", "abstract": "d IoT security perspective. It makes use of three essential Blockchain features\u2014 transparency, immutability, and decentralization\u2014 to build environment that are reliable and impenetrable. This application is realized through the utilization of features such as AI-driven fraud detection, Blockchain security, data privacy, the reliability of Smart Contracts, transaction speed, and system scalability. The result is, Blockchain-IoT Security Perspective, the first rank is System Scalability, the lowest rank is AI-based Fraud Detection, Blockchain Security is the fourth rank, Data Privacy is the fifth rank, Smart Contract Reliability is the third rank, and Transaction Speed is the first rank."} | ||||
| 86 | {"work_id": 2915352631, "title": "The Transport Layer Security (TLS) Protocol Version 1.3", "abstract": "This document specifies version 1.3 of the Transport Layer Security\n(TLS) protocol. TLS allows client/server applications to communicate\nover the Internet in a way that is designed to prevent eavesdropping,\ntampering, and message forgery. This document updates RFCs 4492, 5705,\nand 6066 and it obsoletes RFCs 5077, 5246, and 6961. This document\nalso specifies new requirements for TLS 1.2 implementations."} | 90 | {"work_id": 2915352631, "title": "The Transport Layer Security (TLS) Protocol Version 1.3", "abstract": "This document specifies version 1.3 of the Transport Layer Security\n(TLS) protocol. TLS allows client/server applications to communicate\nover the Internet in a way that is designed to prevent eavesdropping,\ntampering, and message forgery. This document updates RFCs 4492, 5705,\nand 6066 and it obsoletes RFCs 5077, 5246, and 6961. This document\nalso specifies new requirements for TLS 1.2 implementations."} | ||
| 87 | {"work_id": 4387105517, "title": "Heterogeneous Federated Learning: State-of-the-art and Research Challenges", "abstract": "Federated learning (FL) has drawn increasing attention owing to its potential use in large-scale industrial applications. Existing FL works mainly focus on model homogeneous settings. However, practical FL typically faces the heterogeneity of data distributions, model architectures, network environments, and hardware devices among participant clients. Heterogeneous Federated Learning (HFL) is much more challenging, and corresponding solutions are diverse and complex. Therefore, a systematic survey on this topic about the research challenges and state-of-the-art is essential. In this survey, we firstly summarize the various research challenges in HFL from five aspects: statistical heterogeneity, model heterogeneity, communication heterogeneity, device heterogeneity, and additional challenges. In addition, recent advances in HFL are reviewed and a new taxonomy of existing HFL methods is proposed with an in-depth analysis of their pros and cons. We classify existing methods from three different levels according to the HFL procedure: data-level, model-level, and server-level. Finally, several critical and promising future research directions in HFL are discussed, which may facilitate further developments in this field. A periodically updated collection on HFL is available at https://github.com/marswhu/HFL_Survey."} | 91 | {"work_id": 4387105517, "title": "Heterogeneous Federated Learning: State-of-the-art and Research Challenges", "abstract": "Federated learning (FL) has drawn increasing attention owing to its potential use in large-scale industrial applications. Existing FL works mainly focus on model homogeneous settings. However, practical FL typically faces the heterogeneity of data distributions, model architectures, network environments, and hardware devices among participant clients. Heterogeneous Federated Learning (HFL) is much more challenging, and corresponding solutions are diverse and complex. Therefore, a systematic survey on this topic about the research challenges and state-of-the-art is essential. In this survey, we firstly summarize the various research challenges in HFL from five aspects: statistical heterogeneity, model heterogeneity, communication heterogeneity, device heterogeneity, and additional challenges. In addition, recent advances in HFL are reviewed and a new taxonomy of existing HFL methods is proposed with an in-depth analysis of their pros and cons. We classify existing methods from three different levels according to the HFL procedure: data-level, model-level, and server-level. Finally, several critical and promising future research directions in HFL are discussed, which may facilitate further developments in this field. A periodically updated collection on HFL is available at https://github.com/marswhu/HFL_Survey."} | ||
| 88 | {"work_id": 4406302454, "title": "Security and Privacy Challenges of Large Language Models: A Survey", "abstract": "Large language models (LLMs) have demonstrated extraordinary capabilities and contributed to multiple fields, such as generating and summarizing text, language translation, and question-answering. Today, LLMs have become quite popular tools in natural language processing tasks, with the capability to analyze complicated linguistic patterns and provide relevant responses depending on the context. While offering significant advantages, these models are also vulnerable to security and privacy attacks, such as jailbreaking attacks, data poisoning attacks, and personally identifiable information leakage attacks. This survey provides a thorough review of the security and privacy challenges of LLMs, along with the application-based risks in various domains, such as transportation, education, and healthcare. We assess the extent of LLM vulnerabilities, investigate emerging security and privacy attacks against LLMs, and review potential defense mechanisms. Additionally, the survey outlines existing research gaps and highlights future research directions."} | 92 | {"work_id": 4406302454, "title": "Security and Privacy Challenges of Large Language Models: A Survey", "abstract": "Large language models (LLMs) have demonstrated extraordinary capabilities and contributed to multiple fields, such as generating and summarizing text, language translation, and question-answering. Today, LLMs have become quite popular tools in natural language processing tasks, with the capability to analyze complicated linguistic patterns and provide relevant responses depending on the context. While offering significant advantages, these models are also vulnerable to security and privacy attacks, such as jailbreaking attacks, data poisoning attacks, and personally identifiable information leakage attacks. This survey provides a thorough review of the security and privacy challenges of LLMs, along with the application-based risks in various domains, such as transportation, education, and healthcare. We assess the extent of LLM vulnerabilities, investigate emerging security and privacy attacks against LLMs, and review potential defense mechanisms. Additionally, the survey outlines existing research gaps and highlights future research directions."} | ||
| 89 | −{"work_id": 2384897939, "title": "Big Data Security and Privacy Protection", "abstract": "Nowadays big data has become a hot topic in both the academic and the industrial research.It is regarded as a revolution that will transform how we live,work and think.However, there are many security risks in the field of data security and privacy protection when collecting, storing and utilizing big data.Privacy issues related with big data analysis spell trouble for individuals.And deceptive or fake information within big data may lead to incorrect analysis results. This paper summarizes and analyzes the security challenges brought by big data,and then describes the key technologies which can be exploited to deal with these challenges.Finally,this paper argues that big data brings not only challenges,but also technical revolution in the field of information security."} | 93 | +{"work_id": 3156129242, "title": "A Survey on Blockchain Technology: Evolution, Architecture and Security", "abstract": "Blockchain is a revolutionary technology that is making a great impact on modern society due to its transparency, decentralization, and security properties. Blockchain gained considerable attention due to its very first application of Cryptocurrencies e.g., Bitcoin. In the near future, Blockchain technology is determined to transform the way we live, interact, and perform businesses. Recently, academics, industrialists, and researchers are aggressively investigating different aspects of Blockchain as an emerging technology. Unlike other Blockchain surveys focusing on either its applications, challenges, characteristics, or security, we present a comprehensive survey of Blockchain technology\u2019s evolution, architecture, development frameworks, and security issues. We also present a comparative analysis of frameworks, classification of consensus algorithms, and analysis of security risks & cryptographic primitives that have been used in the Blockchain so far. Finally, this paper elaborates on key future directions, novel use cases and open research challenges, which could be explored by researchers to make further advances in this field."} | ||
| 90 | −{"work_id": 2892520153, "title": "Blockchain technology overview", "abstract": "Reports on Computer Systems TechnologyThe Information Technology Laboratory (ITL) at the National Institute of Standards and Technology (NIST) promotes the U.S. economy and public welfare by providing technical leadership for the Nation's measurement and standards infrastructure.ITL develops tests, test methods, reference data, proof of concept implementations, and technical analyses to advance the development and productive use of information technology.ITL's responsibilities include the development of management, administrative, technical, and physical standards and guidelines for the cost-effective security and privacy of other than national security-related information in federal information systems."} | 94 | +{"work_id": 2912977751, "title": "A Blockchain-Based Nonrepudiation Network Computing Service Scheme for Industrial IoT", "abstract": "Emerging network computing technologies extend the functionalities of industrial IoT (IIoT) terminals. However, this promising service-provisioning scheme encounters problems in untrusted and distributed IIoT scenarios because malicious service providers or clients may deny service provisions or usage for their own interests. Traditional nonrepudiation solutions fade in IIoT environments due to requirements of trusted third parties or unacceptable overheads. Fortunately, the blockchain revolution facilitates innovative solutions. In this paper, we propose a blockchain-based fair nonrepudiation service provisioning scheme for IIoT scenarios in which the blockchain is used as a service publisher and an evidence recorder. Each service is separately delivered via on-chain and off-chain channels with mandatory evidence submissions for nonrepudiation purpose. Moreover, a homomorphic-hash-based service verification method is designed that can function with mere on-chain evidence. And an impartial smart contract is implemented to resolve disputes. The security analysis demonstrates the dependability, and the evaluations reveal the effectiveness and efficiency."} | ||
| 91 | −{"work_id": 7139094415, "title": "Fedformer: Frequency Enhanced Decomposed Transformer for Long-term Series Forecasting", "abstract": "Recent Transformer-based approaches have greatly advanced long-term time series forecasting, yet they suffer from two major limitations: high computational cost and difficulty in modeling the overall global structure (such as long-term trends). To overcome these issues, we introduce a framework that integrates Transformer architectures with seasonal\u2013trend decomposition. The decomposition component extracts the global profile of the sequence, while the Transformer focuses on capturing finer local patterns. Moreover, recognizing that time series often have sparse representations in classical bases like the Fourier transform, we design a frequency-enhanced Transformer that exploits this property to strengthen long-horizon predictions. The resulting model, named Frequency Enhanced Decomposed Transformer (FEDformer), achieves both improved accuracy and linear complexity with respect to sequence length, making it more efficient than conventional Transformers. Experiments on six widely used benchmarks demonstrate that FEDformer lowers forecasting errors by 14.8% for multivariate series and 22.6% for univariate series compared with state-of-the-art baselines."} | 95 | +{"work_id": 4317737920, "title": "Blockchain Technology: Security Issues, Healthcare Applications, Challenges and Future Trends", "abstract": "Blockchain technology provides a data structure with inherent security properties that include cryptography, decentralization, and consensus, which ensure trust in transactions. It covers widely applicable usages, such as in intelligent manufacturing, finance, the Internet of things (IoT), medicine and health, and many different areas, especially in medical health data security and privacy protection areas. Its natural attributes, such as contracts and consensus mechanisms, have leading-edge advantages in protecting data confidentiality, integrity, and availability. The security issues are gradually revealed with in-depth research and vigorous development. Unlike traditional paper storage methods, modern medical records are stored electronically. Blockchain technology provided a decentralized solution to the trust-less issues between distrusting parties without third-party guarantees, but the \u201ctrust-less\u201d security through technology was easily misunderstood and hindered the security differences between public and private blockchains appropriately. The mentioned advantages and disadvantages motivated us to provide an advancement and comprehensive study regarding the applicability of blockchain technology. This paper focuses on the healthcare security issues in blockchain and sorts out the security risks in six layers of blockchain technology by comparing and analyzing existing security measures. It also explores and defines the different security attacks and challenges when applying blockchain technology, which promotes theoretical research and robust security protocol development in the current and future distributed work environment."} | ||
| 92 | {"work_id": 2905867785, "title": "A Survey on Consensus Mechanisms and Mining Strategy Management in Blockchain Networks", "abstract": "The past decade has witnessed the rapid evolution in blockchain technologies, which has attracted tremendous interests from both the research communities and industries. The blockchain network was originated from the Internet financial sector as a decentralized, immutable ledger system for transactional data ordering. Nowadays, it is envisioned as a powerful backbone/framework for decentralized data processing and data-driven self-organization in flat, open-access networks. In particular, the plausible characteristics of decentralization, immutability, and self-organization are primarily owing to the unique decentralized consensus mechanisms introduced by blockchain networks. This survey is motivated by the lack of a comprehensive literature review on the development of decentralized consensus mechanisms in blockchain networks. In this paper, we provide a systematic vision of the organization of blockchain networks. By emphasizing the unique characteristics of decentralized consensus in blockchain networks, our in-depth review of the state-of-the-art consensus protocols is focused on both the perspective of distributed consensus system design and the perspective of incentive mechanism design. From a game-theoretic point of view, we also provide a thorough review of the strategy adopted for self-organization by the individual nodes in the blockchain backbone networks. Consequently, we provide a comprehensive survey of the emerging applications of blockchain networks in a broad area of telecommunication. We highlight our special interest in how the consensus mechanisms impact these applications. Finally, we discuss several open issues in the protocol design for blockchain consensus and the related potential research directions."} | 96 | {"work_id": 2905867785, "title": "A Survey on Consensus Mechanisms and Mining Strategy Management in Blockchain Networks", "abstract": "The past decade has witnessed the rapid evolution in blockchain technologies, which has attracted tremendous interests from both the research communities and industries. The blockchain network was originated from the Internet financial sector as a decentralized, immutable ledger system for transactional data ordering. Nowadays, it is envisioned as a powerful backbone/framework for decentralized data processing and data-driven self-organization in flat, open-access networks. In particular, the plausible characteristics of decentralization, immutability, and self-organization are primarily owing to the unique decentralized consensus mechanisms introduced by blockchain networks. This survey is motivated by the lack of a comprehensive literature review on the development of decentralized consensus mechanisms in blockchain networks. In this paper, we provide a systematic vision of the organization of blockchain networks. By emphasizing the unique characteristics of decentralized consensus in blockchain networks, our in-depth review of the state-of-the-art consensus protocols is focused on both the perspective of distributed consensus system design and the perspective of incentive mechanism design. From a game-theoretic point of view, we also provide a thorough review of the strategy adopted for self-organization by the individual nodes in the blockchain backbone networks. Consequently, we provide a comprehensive survey of the emerging applications of blockchain networks in a broad area of telecommunication. We highlight our special interest in how the consensus mechanisms impact these applications. Finally, we discuss several open issues in the protocol design for blockchain consensus and the related potential research directions."} | ||
| 93 | −{"work_id": 2970408908, "title": "Deep Leakage from Gradients", "abstract": null} | 97 | +{"work_id": 2231944250, "title": "Enigma: Decentralized Computation Platform with Guaranteed Privacy", "abstract": "A peer-to-peer network, enabling different parties to jointly store and run computations on data while keeping the data completely private. Enigma's computational model is based on a highly optimized version of secure multi-party computation, guaranteed by a verifiable secret-sharing scheme. For storage, we use a modified distributed hashtable for holding secret-shared data. An external blockchain is utilized as the controller of the network, manages access control, identities and serves as a tamper-proof log of events. Security deposits and fees incentivize operation, correctness and fairness of the system. Similar to Bitcoin, Enigma removes the need for a trusted third party, enabling autonomous control of personal data. For the first time, users are able to share their data with cryptographic guarantees regarding their privacy."} | ||
| 94 | {"work_id": 2927344969, "title": "Global Blockchain Benchmarking Study", "abstract": null} | 98 | {"work_id": 2927344969, "title": "Global Blockchain Benchmarking Study", "abstract": null} | ||
| 95 | {"work_id": 7159977201, "title": "AsyncFed-SAR: Toward Communication-Efficient Asynchronous Federated Learning for SAR Image Target Recognition", "abstract": null} | 99 | {"work_id": 7159977201, "title": "AsyncFed-SAR: Toward Communication-Efficient Asynchronous Federated Learning for SAR Image Target Recognition", "abstract": null} | ||
| 96 | {"work_id": 7125492275, "title": "Source-free domain adaptation for cross-domain remaining useful life prediction: A distributed federated learning perspective", "abstract": null} | 100 | {"work_id": 7125492275, "title": "Source-free domain adaptation for cross-domain remaining useful life prediction: A distributed federated learning perspective", "abstract": null} | ||
@@ -101,25 +105,21 @@ | |||||
| 101 | {"work_id": 4408476406, "title": "CBRFL: A framework for Committee-based Byzantine-Resilient Federated Learning", "abstract": null} | 105 | {"work_id": 4408476406, "title": "CBRFL: A framework for Committee-based Byzantine-Resilient Federated Learning", "abstract": null} | ||
| 102 | {"work_id": 4353004773, "title": "IEEE Symposium on Security and Privacy", "abstract": null} | 106 | {"work_id": 4353004773, "title": "IEEE Symposium on Security and Privacy", "abstract": null} | ||
| 103 | {"work_id": 3196371845, "title": "Federated learning on non-IID data: A survey", "abstract": null} | 107 | {"work_id": 3196371845, "title": "Federated learning on non-IID data: A survey", "abstract": null} | ||
| 104 | −{"work_id": 4226376129, "title": "Federated Learning: Challenges, Methods, and Future Directions", "abstract": null} | 108 | +{"work_id": 4293155325, "title": "Federated learning review: Fundamentals, enabling technologies, and future applications", "abstract": null} | ||
| 105 | {"work_id": 2910044495, "title": "Key Agreement with Physical Unclonable Functions and Biometric Identifiers", "abstract": null} | 109 | {"work_id": 2910044495, "title": "Key Agreement with Physical Unclonable Functions and Biometric Identifiers", "abstract": null} | ||
| 106 | {"work_id": 2961501274, "title": "Aleksander Berentsen Recommends \u201cBitcoin: A Peer-to-Peer Electronic Cash System\u201d by Satoshi Nakamoto", "abstract": null} | 110 | {"work_id": 2961501274, "title": "Aleksander Berentsen Recommends \u201cBitcoin: A Peer-to-Peer Electronic Cash System\u201d by Satoshi Nakamoto", "abstract": null} | ||
| 107 | −{"work_id": 7118779462, "title": "Federated learning in healthcare: Recent progress and challenges", "abstract": null} | ||||
| 108 | {"work_id": 4407318675, "title": "Federated learning-empowered smart manufacturing and product lifecycle management: A review", "abstract": null} | 111 | {"work_id": 4407318675, "title": "Federated learning-empowered smart manufacturing and product lifecycle management: A review", "abstract": null} | ||
| 112 | +{"work_id": 7118779462, "title": "Federated learning in healthcare: Recent progress and challenges", "abstract": null} | ||||
| 109 | {"work_id": 2800028583, "title": "Blockchain Technology Use Cases in Healthcare", "abstract": null} | 113 | {"work_id": 2800028583, "title": "Blockchain Technology Use Cases in Healthcare", "abstract": null} | ||
| 110 | {"work_id": 2797770018, "title": "A two-stage locality-sensitive hashing based approach for privacy-preserving mobile service recommendation in cross-platform edge environment", "abstract": null} | 114 | {"work_id": 2797770018, "title": "A two-stage locality-sensitive hashing based approach for privacy-preserving mobile service recommendation in cross-platform edge environment", "abstract": null} | ||
| 111 | {"work_id": 4406269727, "title": "Federated learning framework based on trimmed mean aggregation rules", "abstract": null} | 115 | {"work_id": 4406269727, "title": "Federated learning framework based on trimmed mean aggregation rules", "abstract": null} | ||
| 112 | {"work_id": 4248175462, "title": "Bitcoin: A Peer-to-Peer Electronic Cash System", "abstract": null} | 116 | {"work_id": 4248175462, "title": "Bitcoin: A Peer-to-Peer Electronic Cash System", "abstract": null} | ||
| 113 | −{"work_id": 4405432346, "title": "Bitcoin: A Peer-to-Peer Electronic Cash System", "abstract": null} | 117 | +{"work_id": 2803836845, "title": "Bitcoin's Growing Energy Problem", "abstract": null} | ||
| 114 | −{"work_id": 7124456577, "title": "AF-SGS: Blockchain-assisted secure authentication framework for smart grid systems", "abstract": null} | ||||
| 115 | {"work_id": 2789828921, "title": "Toward Generating a New Intrusion Detection Dataset and Intrusion Traffic Characterization", "abstract": null} | 118 | {"work_id": 2789828921, "title": "Toward Generating a New Intrusion Detection Dataset and Intrusion Traffic Characterization", "abstract": null} | ||
| 116 | −{"work_id": 7135072016, "title": "A novel heterogeneous coupled neuron model and its application in medical image encryption", "abstract": null} | ||||
| 117 | {"work_id": 3013489453, "title": "On the responsible use of digital data to tackle the COVID-19 pandemic", "abstract": null} | 119 | {"work_id": 3013489453, "title": "On the responsible use of digital data to tackle the COVID-19 pandemic", "abstract": null} | ||
| 118 | {"work_id": 4301785137, "title": "The Illusion of Topological Compression: Why Persistent Homology Fails as a Real-Time Prompt-Injection Defense", "abstract": null} | 120 | {"work_id": 4301785137, "title": "The Illusion of Topological Compression: Why Persistent Homology Fails as a Real-Time Prompt-Injection Defense", "abstract": null} | ||
| 119 | −{"work_id": 7125591879, "title": "Privacy Protection-Enhanced Vertical-Horizontal Federated Learning Secure Sharing for Multisource Heterogeneous Data", "abstract": null} | 121 | +{"work_id": 3022665000, "title": "COVID-19 immunity passports and vaccination certificates: scientific, equitable, and legal challenges", "abstract": null} | ||
| 120 | {"work_id": 3100779497, "title": "Federated Learning for Healthcare Informatics", "abstract": null} | 122 | {"work_id": 3100779497, "title": "Federated Learning for Healthcare Informatics", "abstract": null} | ||
| 121 | {"work_id": 2905514290, "title": "An information security risk management gap analysis tool based on ISO/IEC 27005:2011 compliance for SMEs in Kenya", "abstract": null} | 123 | {"work_id": 2905514290, "title": "An information security risk management gap analysis tool based on ISO/IEC 27005:2011 compliance for SMEs in Kenya", "abstract": null} | ||
| 122 | {"work_id": 2910369831, "title": "Blockchain based searchable encryption for electronic health record sharing", "abstract": null} | 124 | {"work_id": 2910369831, "title": "Blockchain based searchable encryption for electronic health record sharing", "abstract": null} | ||
| 123 | −{"work_id": 3123459983, "title": "A survey on federated learning", "abstract": null} | ||||
| 124 | {"work_id": 7160693558, "title": "Passivity-based synchronization of Markovian jump inertial neural networks via adaptive event-driven protocol and its application to image encryption", "abstract": null} | 125 | {"work_id": 7160693558, "title": "Passivity-based synchronization of Markovian jump inertial neural networks via adaptive event-driven protocol and its application to image encryption", "abstract": null} | ||
| 125 | −{"work_id": 4211068006, "title": "Bitcoin: A Peer-to-Peer Electronic Cash System", "abstract": null} | ||||
modified
literature_synthesis/landmarks/security_privacy_landmarks.csv
+126 −126
@@ -1,126 +1,126 @@ | |||||
| 1 | −work_id,doi,arxiv_id,title,source_name,year,type,primary_category,n_categories,c12,c36,ncs36,cited_by_count,fwci,has_abstract,is_oa,period,score,set,pi_review | 1 | +work_id,doi,arxiv_id,title,source_name,year,type,primary_category,n_categories,c12,c36,ncs36,cited_by_count,fwci,has_abstract,is_oa,period,ntitle,score,set,pi_review | ||
| 2 | −4301785137,10.2139/ssrn.7475259,,The Illusion of Topological Compression: Why Persistent Homology Fails as a Real-Time Prompt-Injection Defense,SSRN Electronic Journal,2026,preprint,cybersecurity,2,252.0,252.0,9805.894736842105,252,,False,True,post,895.9155859896595,landmark,True | 2 | +2905514290,,,An information security risk management gap analysis tool based on ISO/IEC 27005:2011 compliance for SMEs in Kenya,,2018,dissertation,cybersecurity,1,63.0,83.0,849.0759849906191,95,,False,False,baseline,aninformationsecurityriskmanagementgapanalysistoolbasedonisoiec270052011complianceforsmesinkenya,849.0759849906191,landmark,True | ||
| 3 | −2905514290,,,An information security risk management gap analysis tool based on ISO/IEC 27005:2011 compliance for SMEs in Kenya,,2018,dissertation,cybersecurity,1,63.0,83.0,849.0759849906191,95,,False,False,baseline,849.0759849906191,landmark,True | 3 | +2460937040,10.1201/9781351251389-8,,Adversarial Examples in the Physical World,Chapman & Hall/CRC eBooks,2018,book-chapter,cybersecurity,4,805.0,1507.0,699.9376680212566,4388,809.1968,True,True,baseline,adversarialexamplesinthephysicalworld,699.9376680212566,landmark,True | ||
| 4 | −7139094415,10.1201/9781003612742-2,,Fedformer: Frequency Enhanced Decomposed Transformer for Long-term Series Forecasting,CRC Press eBooks,2026,book-chapter,cybersecurity,1,226.0,226.0,216.38297872340425,226,303.4225,True,False,post,803.4798509272343,landmark,True | 4 | +4301785137,10.2139/ssrn.7475259,,The Illusion of Topological Compression: Why Persistent Homology Fails as a Real-Time Prompt-Injection Defense,SSRN Electronic Journal,2026,preprint,cybersecurity,2,252.0,252.0,9805.894736842105,252,,False,True,post,theillusionoftopologicalcompressionwhypersistenthomologyfailsasarealtimepromptinjectiondefense,638.9385438721052,landmark,True | ||
| 5 | −2460937040,10.1201/9781351251389-8,,Adversarial Examples in the Physical World,Chapman & Hall/CRC eBooks,2018,book-chapter,cybersecurity,4,805.0,1507.0,699.9376680212566,4388,809.1968,True,True,baseline,699.9376680212566,landmark,True | 5 | +7129030749,10.1145/3796519,,"Model Context Protocol (MCP): Landscape, Security Threats, and Future Research Directions",ACM Transactions on Software Engineering and Methodology,2026,article,cybersecurity,4,178.0,178.0,198.07867267589847,149,498.5414,True,True,post,modelcontextprotocolmcplandscapesecuritythreatsandfutureresearchdirections,451.31373336997916,landmark,True | ||
| 6 | −7129030749,10.1145/3796519,,"Model Context Protocol (MCP): Landscape, Security Threats, and Future Research Directions",ACM Transactions on Software Engineering and Methodology,2026,article,cybersecurity,4,178.0,178.0,198.07867267589847,149,498.5414,True,True,post,632.8292631196801,landmark,True | 6 | +3188417193,,,Machine learning for offensive cyber operations,NORA - Norwegian Open Research Archives,2023,dissertation,cybersecurity,6,43.0,51.0,424.2320328542094,58,,True,True,post,machinelearningforoffensivecyberoperations,424.2320328542094,landmark,True | ||
| 7 | −4289548059,10.4230/oasics.fmbc.2026.8,,Detecting Cross-Function Reentrancy from EVM Traces,DROPS (Schloss Dagstuhl – Leibniz Center for Informatics),2026,article,cybersecurity,5,148.0,148.0,1051.4722907203115,148,9.1528,True,True,post,526.1726457399587,landmark,True | 7 | +4289548059,10.4230/oasics.fmbc.2026.8,,Detecting Cross-Function Reentrancy from EVM Traces,DROPS (Schloss Dagstuhl – Leibniz Center for Informatics),2026,article,cybersecurity,5,148.0,148.0,1051.4722907203115,148,9.1528,True,True,post,detectingcrossfunctionreentrancyfromevmtraces,375.24962100425233,landmark,True | ||
| 8 | −3188417193,,,Machine learning for offensive cyber operations,NORA - Norwegian Open Research Archives,2023,dissertation,cybersecurity,6,43.0,51.0,424.2320328542094,58,,True,True,post,424.2320328542094,landmark,True | 8 | +3201596224,,,ELLIPTIC CURVE DIGITAL SIGNATURE ALGORITHM,NC Digital Online Collection of Knowledge and Scholarship (The University of North Carolina at Greensboro),2021,dissertation,cybersecurity,2,27.0,28.0,308.9145728643216,35,,True,False,baseline,ellipticcurvedigitalsignaturealgorithm,308.9145728643216,landmark,True | ||
| 9 | −3201596224,,,ELLIPTIC CURVE DIGITAL SIGNATURE ALGORITHM,NC Digital Online Collection of Knowledge and Scholarship (The University of North Carolina at Greensboro),2021,dissertation,cybersecurity,2,27.0,28.0,308.9145728643216,35,,True,False,baseline,308.9145728643216,landmark,True | 9 | +652269645,10.57709/1059372,,A Design and Analysis of Graphical Password,Digital Archive @ GSU,2022,dissertation,cybersecurity,1,35.0,35.0,303.5964912280702,43,,True,True,baseline,adesignandanalysisofgraphicalpassword,303.5964912280702,landmark,True | ||
| 10 | −652269645,10.57709/1059372,,A Design and Analysis of Graphical Password,Digital Archive @ GSU,2022,dissertation,cybersecurity,1,35.0,35.0,303.5964912280702,43,,True,True,baseline,303.5964912280702,landmark,True | 10 | +2231944250,10.7551/mitpress/11636.003.0018,,Enigma: Decentralized Computation Platform with Guaranteed Privacy,The MIT Press eBooks,2018,book-chapter,cybersecurity,6,169.0,230.0,270.2898179020262,368,204.4551,True,True,baseline,enigmadecentralizedcomputationplatformwithguaranteedprivacy,270.2898179020262,landmark,True | ||
| 11 | −2231944250,10.7551/mitpress/11636.003.0018,,Enigma: Decentralized Computation Platform with Guaranteed Privacy,The MIT Press eBooks,2018,book-chapter,cybersecurity,6,169.0,230.0,270.2898179020262,368,204.4551,True,True,baseline,270.2898179020262,landmark,True | 11 | +3041344359,,,Machine Learning for anomaly detection in IoT networks :Malware analysis on the IoT-23 data set,,2020,dissertation,cybersecurity,4,8.0,31.0,265.4812030075188,64,,True,False,baseline,machinelearningforanomalydetectioniniotnetworksmalwareanalysisontheiot23dataset,265.4812030075188,landmark,True | ||
| 12 | −3041344359,,,Machine Learning for anomaly detection in IoT networks :Malware analysis on the IoT-23 data set,,2020,dissertation,cybersecurity,4,8.0,31.0,265.4812030075188,64,,True,False,baseline,265.4812030075188,landmark,True | 12 | +4401666902,10.38124/ijisrt/ijisrt24aug395,,Cyberfraud in the Nigerian Banking Sector: The Techniques and Preventive Measures,International Journal of Innovative Science and Research Technology (IJISRT),2024,article,cybersecurity,1,739.0,739.0,222.49445823978112,739,282.4198,True,True,post,cyberfraudinthenigerianbankingsectorthetechniquesandpreventivemeasures,222.49445823978112,landmark,True | ||
| 13 | −4401666902,10.38124/ijisrt/ijisrt24aug395,,Cyberfraud in the Nigerian Banking Sector: The Techniques and Preventive Measures,International Journal of Innovative Science and Research Technology (IJISRT),2024,article,cybersecurity,1,739.0,739.0,222.49445823978112,739,282.4198,True,True,post,222.49445823978112,landmark,True | 13 | +4353004773,10.1109/mitp.2023.3246667,,IEEE Symposium on Security and Privacy,IT Professional,2023,article,cybersecurity,2,671.0,853.0,199.92253679509537,1167,130.8885,False,True,post,ieeesymposiumonsecurityandprivacy,199.92253679509537,landmark,True | ||
| 14 | −7125967353,10.1016/j.comnet.2026.112061,,An explainable transformer-based model for phishing email detection: A large language model approach,Computer Networks,2026,article,cybersecurity,6,60.0,60.0,426.27255029201814,23,173.9038,True,True,post,213.31323475944274,landmark,True | 14 | +2805930283,10.1109/access.2018.2842685,2402.00687,A Review on the Use of Blockchain for the Internet of Things,IEEE Access,2018,article,cybersecurity,5,184.0,370.0,196.1729236493096,1078,221.3514,True,True,post,areviewontheuseofblockchainfortheinternetofthings,196.1729236493096,landmark,True | ||
| 15 | −4353004773,10.1109/mitp.2023.3246667,,IEEE Symposium on Security and Privacy,IT Professional,2023,article,cybersecurity,2,671.0,853.0,199.92253679509537,1167,130.8885,False,True,post,199.92253679509537,landmark,True | 15 | +2624307925,10.1109/comst.2018.2842460,1706.00916,A Survey on Security and Privacy Issues of Bitcoin,IEEE Communications Surveys & Tutorials,2018,article,cybersecurity,6,207.0,367.0,194.58233237647738,1103,211.3082,True,True,pre,asurveyonsecurityandprivacyissuesofbitcoin,194.58233237647738,landmark,True | ||
| 16 | −2805930283,10.1109/access.2018.2842685,2402.00687,A Review on the Use of Blockchain for the Internet of Things,IEEE Access,2018,article,cybersecurity,5,184.0,370.0,196.1729236493096,1078,221.3514,True,True,post,196.1729236493096,landmark,True | 16 | +4392771733,,,Sécurisation des Algorithmes d'Apprentissage Automatique,theses.fr (ABES),2023,dissertation,cybersecurity,5,17.0,21.0,174.68377823408625,21,,True,True,post,scurisationdesalgorithmesdapprentissageautomatique,174.68377823408625,landmark,True | ||
| 17 | −2624307925,10.1109/comst.2018.2842460,1706.00916,A Survey on Security and Privacy Issues of Bitcoin,IEEE Communications Surveys & Tutorials,2018,article,cybersecurity,6,207.0,367.0,194.58233237647738,1103,211.3082,True,True,pre,194.58233237647738,landmark,True | 17 | +2789828921,10.5220/0006639801080116,,Toward Generating a New Intrusion Detection Dataset and Intrusion Traffic Characterization,International Conference on Information Systems Security and Privacy (ICISSP),2018,conference-paper,cybersecurity,2,200.0,534.0,162.76665116819714,4757,217.8381,False,True,baseline,towardgeneratinganewintrusiondetectiondatasetandintrusiontrafficcharacterization,162.76665116819714,landmark,True | ||
| 18 | −7130652904,10.1145/3797277,,vul-rag : Enhancing LLM-based Vulnerability Detection via Knowledge-level RAG,ACM Transactions on Software Engineering and Methodology,2026,article,cybersecurity,5,51.0,51.0,362.3316677482154,30,247.1264,True,True,post,181.31624954552632,landmark,True | 18 | +4406302454,10.1145/3712001,2402.00888,Security and Privacy Challenges of Large Language Models: A Survey,ACM Computing Surveys,2025,article,cybersecurity,5,357.0,357.0,121.61180437793685,357,141.8982,True,True,post,securityandprivacychallengesoflargelanguagemodelsasurvey,155.99884965417968,landmark,True | ||
| 19 | −4406302454,10.1145/3712001,2402.00888,Security and Privacy Challenges of Large Language Models: A Survey,ACM Computing Surveys,2025,article,cybersecurity,5,357.0,357.0,121.61180437793685,357,141.8982,True,True,post,180.73441119043537,landmark,True | 19 | +2309315845,10.58088/javg-d166,,Human-centric training and assessment for cyber situation awareness,"Library, Museums and Press - UDSpace (University of Delaware)",2024,dissertation,cybersecurity,4,4.0,4.0,155.76296296296297,4,,True,True,post,humancentrictrainingandassessmentforcybersituationawareness,155.76296296296297,landmark,True | ||
| 20 | −4392771733,,,Sécurisation des Algorithmes d'Apprentissage Automatique,theses.fr (ABES),2023,dissertation,cybersecurity,5,17.0,21.0,174.68377823408625,21,,True,True,post,174.68377823408625,landmark,True | 20 | +2795085730,10.1109/mcc.2018.011791712,,Blockchain: A Panacea for Healthcare Cloud-Based Data Security and Privacy?,IEEE Cloud Computing,2018,article,cybersecurity,6,130.0,270.0,143.1532145549016,855,159.8872,True,False,baseline,blockchainapanaceaforhealthcarecloudbaseddatasecurityandprivacy,143.1532145549016,landmark,True | ||
| 21 | −7124456577,10.1007/s41870-025-03069-9,,AF-SGS: Blockchain-assisted secure authentication framework for smart grid systems,International Journal of Information Technology,2026,article,cybersecurity,2,46.0,46.0,161.49184840143977,46,192.7628,False,False,post,163.5401466489061,landmark,True | 21 | +2984937325,,,Trusted Execution Environments in Cloud Computing,Aaltodoc (Aalto University),2021,dissertation,cybersecurity,5,22.0,31.0,140.99890109890111,42,,True,False,baseline,trustedexecutionenvironmentsincloudcomputing,140.99890109890111,landmark,True | ||
| 22 | −2789828921,10.5220/0006639801080116,,Toward Generating a New Intrusion Detection Dataset and Intrusion Traffic Characterization,International Conference on Information Systems Security and Privacy (ICISSP),2018,conference-paper,cybersecurity,2,200.0,534.0,162.76665116819714,4757,217.8381,False,True,baseline,162.76665116819714,landmark,True | 22 | +2946416612,,,Inadvertently Making Cyber Criminals Rich: A Comprehensive Study of Cryptojacking Campaigns at Internet Scale,Research Repository (Delft University of Technology),2019,dissertation,cybersecurity,2,9.0,14.0,140.31616982836496,19,,True,True,baseline,inadvertentlymakingcybercriminalsrichacomprehensivestudyofcryptojackingcampaignsatinternetscale,140.31616982836496,landmark,True | ||
| 23 | −2309315845,10.58088/javg-d166,,Human-centric training and assessment for cyber situation awareness,"Library, Museums and Press - UDSpace (University of Delaware)",2024,dissertation,cybersecurity,4,4.0,4.0,155.76296296296297,4,,True,True,post,155.76296296296297,landmark,True | 23 | +1550000763,10.1184/r1/6621806,,Crying Wolf: An Empirical Study of SSL Warning Effectiveness,KiltHub Repository,2018,article,cybersecurity,3,245.0,262.0,138.91163782734898,331,29.7278,True,True,baseline,cryingwolfanempiricalstudyofsslwarningeffectiveness,138.91163782734898,landmark,True | ||
| 24 | −4387210439,10.3390/telecom7030073,2309.16021,HuntGPT: Integrating Machine Learning-Based Anomaly Detection and Explainable AI with Large Language Models (LLMs),Telecom,2026,article,cybersecurity,7,41.0,41.0,143.93838661867457,41,16.762,True,True,post,145.7640437522859,landmark,True | 24 | +2781723315,10.1109/sp.2019.00002,1801.01203,Spectre Attacks: Exploiting Speculative Execution,Proceedings - IEEE Symposium on Security and Privacy/Proceedings of the ... IEEE Symposium on Security and Privacy,2019,conference-paper,cybersecurity,7,693.0,1001.0,133.14175590649612,1780,109.082,True,True,baseline,spectreattacksexploitingspeculativeexecution,133.14175590649612,landmark,True | ||
| 25 | −3015692940,10.14419/ijet.v7i4.21726,,Performance evaluation measurement of image steganography techniques with analysis of LSB based on variation image formats,International Journal of Engineering & Technology,2026,article,cybersecurity,2,41.0,41.0,109.89503437738733,41,0.0,True,True,post,145.7640437522859,landmark,True | 25 | +4322207773,10.26686/wgtn.22180858,,"Automating Behavior-based Ransomware Analysis, Detection, and Classification Using Machine Learning",,2023,dissertation,cybersecurity,7,9.0,10.0,132.5,11,,True,True,post,automatingbehaviorbasedransomwareanalysisdetectionandclassificationusingmachinelearning,132.5,landmark,True | ||
| 26 | −2795085730,10.1109/mcc.2018.011791712,,Blockchain: A Panacea for Healthcare Cloud-Based Data Security and Privacy?,IEEE Cloud Computing,2018,article,cybersecurity,6,130.0,270.0,143.1532145549016,855,159.8872,True,False,baseline,143.1532145549016,landmark,True | 26 | +4392353733,10.1016/j.hcc.2024.100211,2312.02003,"A survey on large language model (LLM) security and privacy: The Good, The Bad, and The Ugly",High-Confidence Computing,2024,article,cybersecurity,7,728.0,1059.0,131.53622644511728,1059,157.601,True,True,post,asurveyonlargelanguagemodelllmsecurityandprivacythegoodthebadandtheugly,131.53622644511728,landmark,True | ||
| 27 | −2916447643,10.17487/rfc9846,,The Transport Layer Security (TLS) Protocol Version 1.3,,2026,report,applied_cryptography,2,111.0,111.0,1533.1874999999998,301,,True,False,post,394.6294843049691,landmark,True | 27 | +1598516026,10.55277/researchhub.8k9hq1lf.1,,Scantegrity II Municipal Election at Takoma Park: The First E2E Binding Governmental Election with Ballot Privacy,,2026,report,applied_cryptography,2,97.0,97.0,914.8011049723757,107,,True,True,post,scantegrityiimunicipalelectionattakomaparkthefirste2ebindinggovernmentalelectionwithballotprivacy,245.94062998251673,landmark,True | ||
| 28 | −1598516026,10.55277/researchhub.8k9hq1lf.1,,Scantegrity II Municipal Election at Takoma Park: The First E2E Binding Governmental Election with Ballot Privacy,,2026,report,applied_cryptography,2,97.0,97.0,914.8011049723757,107,,True,True,post,344.8563961944324,landmark,True | 28 | +4293168393,10.1145/3549993.3550007,,New Directions in Cryptography,ACM eBooks,2022,book-chapter,applied_cryptography,1,316.0,402.0,215.4337868090236,668,135.2339,True,False,baseline,newdirectionsincryptography,215.4337868090236,landmark,True | ||
| 29 | −4293168393,10.1145/3549993.3550007,,New Directions in Cryptography,ACM eBooks,2022,book-chapter,applied_cryptography,1,316.0,402.0,215.4337868090236,668,135.2339,True,False,baseline,215.4337868090236,landmark,True | 29 | +1497727960,10.82444/warw.33628720,,FLINT : Fast library for number theory,Warwick Research Archive Portal (University of Warwick),2026,article,applied_cryptography,1,59.0,59.0,166.59291493012995,60,0.0,True,True,post,flintfastlibraryfornumbertheory,149.59275431926275,landmark,True | ||
| 30 | −1497727960,10.82444/warw.33628720,,FLINT : Fast library for number theory,Warwick Research Archive Portal (University of Warwick),2026,article,applied_cryptography,1,59.0,59.0,166.59291493012995,60,0.0,True,True,post,209.7580141801187,landmark,True | 30 | +7134847443,10.1109/tce.2026.3672135,,"3D Non-Degenerate Hyperchaos: Design, Analysis, and Application in Image Encryption",IEEE Transactions on Consumer Electronics,2026,article,applied_cryptography,4,59.0,59.0,158.14163483575248,59,183.8619,True,False,post,3dnondegeneratehyperchaosdesignanalysisandapplicationinimageencryption,149.59275431926275,landmark,True | ||
| 31 | −7134847443,10.1109/tce.2026.3672135,,"3D Non-Degenerate Hyperchaos: Design, Analysis, and Application in Image Encryption",IEEE Transactions on Consumer Electronics,2026,article,applied_cryptography,4,59.0,59.0,158.14163483575248,59,183.8619,True,False,post,209.7580141801187,landmark,True | 31 | +1516024962,10.7275/409838,,Energy Efficient Adaptive Reed-Solomon Decoding System,Scholarworks (University of Massachusetts Amherst),2023,dissertation,applied_cryptography,3,8.0,8.0,146.84444444444443,9,,True,True,post,energyefficientadaptivereedsolomondecodingsystem,146.84444444444443,landmark,True | ||
| 32 | −7154469464,10.1145/3808699,,Cryptanalysis and Improvement of a Video Cryptosystem via Chaos and S-Box,ACM Transactions on Multimedia Computing Communications and Applications,2026,article,applied_cryptography,3,57.0,57.0,152.78090145148968,57,177.6293,True,True,post,202.6475730214706,landmark,True | 32 | +7154469464,10.1145/3808699,,Cryptanalysis and Improvement of a Video Cryptosystem via Chaos and S-Box,ACM Transactions on Multimedia Computing Communications and Applications,2026,article,applied_cryptography,3,57.0,57.0,152.78090145148968,57,177.6293,True,True,post,cryptanalysisandimprovementofavideocryptosystemviachaosandsbox,144.52181349488094,landmark,True | ||
| 33 | −1516024962,10.7275/409838,,Energy Efficient Adaptive Reed-Solomon Decoding System,Scholarworks (University of Massachusetts Amherst),2023,dissertation,applied_cryptography,3,8.0,8.0,146.84444444444443,9,,True,True,post,146.84444444444443,landmark,True | 33 | +4220942018,10.1201/9781003187165-10,,Public and private blockchains,CRC Press eBooks,2022,book-chapter,applied_cryptography,2,166.0,175.0,135.97268806899856,179,35.3352,True,False,baseline,publicandprivateblockchains,135.97268806899856,landmark,True | ||
| 34 | −4220942018,10.1201/9781003187165-10,,Public and private blockchains,CRC Press eBooks,2022,book-chapter,applied_cryptography,2,166.0,175.0,135.97268806899856,179,35.3352,True,False,baseline,135.97268806899856,landmark,True | 34 | +2910044495,,,Key Agreement with Physical Unclonable Functions and Biometric Identifiers,mediaTUM – the media and publications repository of the Technical University Munich (Technical University Munich),2019,dissertation,applied_cryptography,3,6.0,17.0,116.57142857142857,21,,False,False,baseline,keyagreementwithphysicalunclonablefunctionsandbiometricidentifiers,116.57142857142857,landmark,True | ||
| 35 | −2910044495,,,Key Agreement with Physical Unclonable Functions and Biometric Identifiers,mediaTUM – the media and publications repository of the Technical University Munich (Technical University Munich),2019,dissertation,applied_cryptography,3,6.0,17.0,116.57142857142857,21,,False,False,baseline,116.57142857142857,landmark,True | 35 | +2915352631,10.17487/rfc8446,,The Transport Layer Security (TLS) Protocol Version 1.3,,2018,report,applied_cryptography,3,316.0,486.0,110.30219435736677,1851,,True,False,baseline,thetransportlayersecuritytlsprotocolversion13,110.30219435736677,landmark,True | ||
| 36 | −2915352631,10.17487/rfc8446,,The Transport Layer Security (TLS) Protocol Version 1.3,,2018,report,applied_cryptography,3,316.0,486.0,110.30219435736677,1851,,True,False,baseline,110.30219435736677,landmark,True | 36 | +4396670109,10.4018/979-8-3693-1335-0.ch012,,Advanced Digital Data Processing Using Cloud Cryptography,Advances in civil and industrial engineering book series,2024,book-chapter,applied_cryptography,4,133.0,133.0,86.71235909822867,133,97.3697,True,False,post,advanceddigitaldataprocessingusingcloudcryptography,86.71235909822867,landmark,True | ||
| 37 | −4413785573,10.1109/tdsc.2025.3603570,,Encrypt a Story: A Video Segment Encryption Method Based on the Discrete Sinusoidal Memristive Rulkov Neuron,IEEE Transactions on Dependable and Secure Computing,2025,article,applied_cryptography,4,176.0,176.0,57.549674211696974,176,64.4002,True,False,post,89.10155845802977,landmark,True | 37 | +4214667959,10.1016/j.bcra.2022.100067,,A survey on blockchain technology and its security,Blockchain Research and Applications,2022,article,applied_cryptography,4,164.0,337.0,82.8248106660309,571,120.3925,True,True,baseline,asurveyonblockchaintechnologyanditssecurity,82.8248106660309,landmark,True | ||
| 38 | −4396670109,10.4018/979-8-3693-1335-0.ch012,,Advanced Digital Data Processing Using Cloud Cryptography,Advances in civil and industrial engineering book series,2024,book-chapter,applied_cryptography,4,133.0,133.0,86.71235909822867,133,97.3697,True,False,post,86.71235909822867,landmark,True | 38 | +4226075590,10.6028/nist.ir.8413,,Status report on the third round of the NIST Post-Quantum Cryptography Standardization process,,2022,report,applied_cryptography,3,144.0,242.0,79.32594644506003,395,,True,True,baseline,statusreportonthethirdroundofthenistpostquantumcryptographystandardizationprocess,79.32594644506003,landmark,True | ||
| 39 | −4401459825,10.6028/nist.fips.203,,Module-lattice-based key-encapsulation mechanism standard,,2024,report,applied_cryptography,3,84.0,236.0,85.45305164319248,236,,True,True,post,85.45305164319248,landmark,True | 39 | +4413785573,10.1109/tdsc.2025.3603570,,Encrypt a Story: A Video Segment Encryption Method Based on the Discrete Sinusoidal Memristive Rulkov Neuron,IEEE Transactions on Dependable and Secure Computing,2025,article,applied_cryptography,4,176.0,176.0,57.549674211696974,176,64.4002,True,False,post,encryptastoryavideosegmentencryptionmethodbasedonthediscretesinusoidalmemristiverulkovneuron,76.90699590794293,landmark,True | ||
| 40 | −4214667959,10.1016/j.bcra.2022.100067,,A survey on blockchain technology and its security,Blockchain Research and Applications,2022,article,applied_cryptography,4,164.0,337.0,82.8248106660309,571,120.3925,True,True,baseline,82.8248106660309,landmark,True | 40 | +2910369831,10.1016/j.future.2019.01.018,,Blockchain based searchable encryption for electronic health record sharing,Future Generation Computer Systems,2019,article,applied_cryptography,5,84.0,167.0,68.16664743486187,482,87.1622,False,False,baseline,blockchainbasedsearchableencryptionforelectronichealthrecordsharing,68.16664743486187,landmark,True | ||
| 41 | −4226075590,10.6028/nist.ir.8413,,Status report on the third round of the NIST Post-Quantum Cryptography Standardization process,,2022,report,applied_cryptography,3,144.0,242.0,79.32594644506003,395,,True,True,baseline,79.32594644506003,landmark,True | 41 | +4365934498,10.1007/978-3-031-30589-4_15,,An Efficient Key Recovery Attack on SIDH,Lecture notes in computer science,2023,conference-paper,applied_cryptography,1,145.0,223.0,67.25882266726688,281,73.5527,False,True,post,anefficientkeyrecoveryattackonsidh,67.25882266726688,landmark,True | ||
| 42 | −7124450903,10.1016/j.inffus.2026.104155,,"On the security and privacy of federated learning: A survey with attacks, defenses, frameworks, applications, and future directions",Information Fusion,2026,article,applied_cryptography,6,22.0,22.0,24.48163370151554,16,57.8019,True,True,post,78.21485274512901,landmark,True | 42 | +2913851998,10.6028/nist.ir.8240,,Status report on the first round of the NIST post-quantum cryptography standardization process,,2019,report,applied_cryptography,2,70.0,153.0,65.49329758713137,363,,True,True,baseline,statusreportonthefirstroundofthenistpostquantumcryptographystandardizationprocess,65.49329758713137,landmark,True | ||
| 43 | −7160693558,10.1007/s10473-026-0325-9,,Passivity-based synchronization of Markovian jump inertial neural networks via adaptive event-driven protocol and its application to image encryption,Acta Mathematica Scientia,2026,article,applied_cryptography,1,21.0,21.0,73.7245394876138,21,88.0004,False,False,post,74.65963216580496,landmark,True | 43 | +3209866323,10.18063/wct.v0i0.407,,Separable Reversible Data Hiding in an Encrypted Image,Wireless Communication Technology,2018,article,applied_cryptography,3,323.0,372.0,65.312839313152,427,26.419,False,False,baseline,separablereversibledatahidinginanencryptedimage,65.312839313152,landmark,True | ||
| 44 | −4406028284,10.1109/jiot.2025.3525623,,A Novel Dynamic Hill Cipher and Its Applications on Medical IoT,IEEE Internet of Things Journal,2025,article,applied_cryptography,4,147.0,147.0,48.06705743817872,147,53.7888,True,False,post,74.42005166664985,landmark,True | 44 | +4406028284,10.1109/jiot.2025.3525623,,A Novel Dynamic Hill Cipher and Its Applications on Medical IoT,IEEE Internet of Things Journal,2025,article,applied_cryptography,4,147.0,147.0,48.06705743817872,147,53.7888,True,False,post,anoveldynamichillcipheranditsapplicationsonmedicaliot,64.2348204458387,landmark,True | ||
| 45 | −2970408908,10.1007/978-3-030-63076-8_2,,Deep Leakage from Gradients,Lecture notes in computer science,2020,conference-paper,applied_cryptography,2,294.0,511.0,72.42380039311094,1489,84.6644,False,False,baseline,72.42380039311094,landmark,True | 45 | +3022665000,10.1016/s0140-6736(20)31034-5,,"COVID-19 immunity passports and vaccination certificates: scientific, equitable, and legal challenges",The Lancet,2020,article,applied_cryptography,1,158.0,218.0,63.47984296349881,291,61.3673,False,True,baseline,covid19immunitypassportsandvaccinationcertificatesscientificequitableandlegalchallenges,63.47984296349881,landmark,True | ||
| 46 | −4401442713,10.6028/nist.fips.204,,Module-lattice-based digital signature standard,,2024,report,applied_cryptography,2,64.0,193.0,69.88321596244131,193,,True,True,post,69.88321596244131,landmark,True | 46 | +3156129242,10.1109/access.2021.3072849,,"A Survey on Blockchain Technology: Evolution, Architecture and Security",IEEE Access,2021,article,applied_cryptography,4,87.0,226.0,59.84604799688895,522,84.4336,True,True,baseline,asurveyonblockchaintechnologyevolutionarchitectureandsecurity,59.84604799688895,landmark,True | ||
| 47 | −2910369831,10.1016/j.future.2019.01.018,,Blockchain based searchable encryption for electronic health record sharing,Future Generation Computer Systems,2019,article,applied_cryptography,5,84.0,167.0,68.16664743486187,482,87.1622,False,False,baseline,68.16664743486187,landmark,True | 47 | +44936433,10.1145/3335741.3335755,,"How to play any mental game, or a completeness theorem for protocols with honest majority",ACM eBooks,2019,book-chapter,applied_cryptography,2,143.0,189.0,58.79166858882687,403,47.6938,True,False,baseline,howtoplayanymentalgameoracompletenesstheoremforprotocolswithhonestmajority,58.79166858882687,landmark,True | ||
| 48 | −4365934498,10.1007/978-3-031-30589-4_15,,An Efficient Key Recovery Attack on SIDH,Lecture notes in computer science,2023,conference-paper,applied_cryptography,1,145.0,223.0,67.25882266726688,281,73.5527,False,True,post,67.25882266726688,landmark,True | 48 | +4317737920,10.3390/electronics12030546,,"Blockchain Technology: Security Issues, Healthcare Applications, Challenges and Future Trends",Electronics,2023,article,applied_cryptography,7,136.0,241.0,56.48456197845015,282,66.2667,True,True,post,blockchaintechnologysecurityissueshealthcareapplicationschallengesandfuturetrends,56.48456197845015,landmark,True | ||
| 49 | −2913851998,10.6028/nist.ir.8240,,Status report on the first round of the NIST post-quantum cryptography standardization process,,2019,report,applied_cryptography,2,70.0,153.0,65.49329758713137,363,,True,True,baseline,65.49329758713137,landmark,True | 49 | +2912977751,10.1109/tii.2019.2897133,,A Blockchain-Based Nonrepudiation Network Computing Service Scheme for Industrial IoT,IEEE Transactions on Industrial Informatics,2019,article,applied_cryptography,4,85.0,138.0,56.3293254252152,230,55.2964,True,False,baseline,ablockchainbasednonrepudiationnetworkcomputingserviceschemeforindustrialiot,56.3293254252152,landmark,True | ||
| 50 | −3209866323,10.18063/wct.v0i0.407,,Separable Reversible Data Hiding in an Encrypted Image,Wireless Communication Technology,2018,article,applied_cryptography,3,323.0,372.0,65.312839313152,427,26.419,False,False,baseline,65.312839313152,landmark,True | 50 | +7160693558,10.1007/s10473-026-0325-9,,Passivity-based synchronization of Markovian jump inertial neural networks via adaptive event-driven protocol and its application to image encryption,Acta Mathematica Scientia,2026,article,applied_cryptography,1,21.0,21.0,73.7245394876138,21,88.0004,False,False,post,passivitybasedsynchronizationofmarkovianjumpinertialneuralnetworksviaadaptiveeventdrivenprotocolanditsapplicationtoimageencryption,53.24487865600877,landmark,True | ||
| 51 | −7135072016,10.1007/s11071-026-12263-8,,A novel heterogeneous coupled neuron model and its application in medical image encryption,Nonlinear Dynamics,2026,article,applied_cryptography,2,18.0,18.0,48.246600458365165,18,56.0935,False,False,post,63.99397042783282,landmark,True | 51 | +4254706618,10.6028/nist.ir.8309,,Status report on the second round of the NIST post-quantum cryptography standardization process,,2020,report,applied_cryptography,2,68.0,152.0,52.898263027295286,296,,True,True,baseline,statusreportonthesecondroundofthenistpostquantumcryptographystandardizationprocess,52.898263027295286,landmark,True | ||
| 52 | −4211068006,10.2139/ssrn.3977007,,Bitcoin: A Peer-to-Peer Electronic Cash System,SSRN Electronic Journal,2022,preprint,blockchain,3,8639.0,10307.0,2271.7939326239048,11148,,False,True,baseline,2271.7939326239048,landmark,True | 52 | +4248175462,10.2139/ssrn.3440802,,Bitcoin: A Peer-to-Peer Electronic Cash System,SSRN Electronic Journal,2019,preprint,blockchain,3,5543.0,7534.0,1699.155537022696,13922,,False,True,baseline,bitcoinapeertopeerelectroniccashsystem,1699.155537022696,landmark,True | ||
| 53 | −4248175462,10.2139/ssrn.3440802,,Bitcoin: A Peer-to-Peer Electronic Cash System,SSRN Electronic Journal,2019,preprint,blockchain,3,5543.0,7534.0,1699.155537022696,13922,,False,True,baseline,1699.155537022696,landmark,True | 53 | +2961501274,10.1007/978-3-030-17740-9_3,,Aleksander Berentsen Recommends “Bitcoin: A Peer-to-Peer Electronic Cash System” by Satoshi Nakamoto,Springer eBooks,2019,book-chapter,blockchain,2,144.0,226.0,220.05819391042294,259,176.7032,False,False,baseline,aleksanderberentsenrecommendsbitcoinapeertopeerelectroniccashsystembysatoshinakamoto,220.05819391042294,landmark,True | ||
| 54 | −2961501274,10.1007/978-3-030-17740-9_3,,Aleksander Berentsen Recommends “Bitcoin: A Peer-to-Peer Electronic Cash System” by Satoshi Nakamoto,Springer eBooks,2019,book-chapter,blockchain,2,144.0,226.0,220.05819391042294,259,176.7032,False,False,baseline,220.05819391042294,landmark,True | 54 | +2898069736,10.1080/00207543.2018.1533261,,Blockchain technology and its relationships to sustainable supply chain management,International Journal of Production Research,2018,article,blockchain,2,100.0,389.0,206.24666837724715,4083,331.4245,True,False,baseline,blockchaintechnologyanditsrelationshipstosustainablesupplychainmanagement,206.24666837724715,landmark,True | ||
| 55 | −4300127641,10.1145/3190508.3190538,,Hyperledger fabric,,2018,conference-paper,blockchain,3,298.0,703.0,208.44083650190112,3605,247.1511,True,False,baseline,208.44083650190112,landmark,True | 55 | +2905867785,10.1109/access.2019.2896108,1805.02707,A Survey on Consensus Mechanisms and Mining Strategy Management in Blockchain Networks,IEEE Access,2019,article,blockchain,4,279.0,493.0,201.23447416399344,995,178.3857,True,True,baseline,asurveyonconsensusmechanismsandminingstrategymanagementinblockchainnetworks,201.23447416399344,landmark,True | ||
| 56 | −2898069736,10.1080/00207543.2018.1533261,,Blockchain technology and its relationships to sustainable supply chain management,International Journal of Production Research,2018,article,blockchain,2,100.0,389.0,206.24666837724715,4083,331.4245,True,False,baseline,206.24666837724715,landmark,True | 56 | +4320717855,10.1016/j.future.2023.02.008,,Blockchain for the metaverse: A Review,Future Generation Computer Systems,2023,article,blockchain,4,569.0,763.0,178.82871696911812,771,171.5415,True,True,baseline,blockchainforthemetaverseareview,178.82871696911812,landmark,True | ||
| 57 | −2905867785,10.1109/access.2019.2896108,1805.02707,A Survey on Consensus Mechanisms and Mining Strategy Management in Blockchain Networks,IEEE Access,2019,article,blockchain,4,279.0,493.0,201.23447416399344,995,178.3857,True,True,baseline,201.23447416399344,landmark,True | 57 | +3162358200,10.48550/arxiv.2105.07447,2105.07447,"Non-Fungible Token (NFT): Overview, Evaluation, Opportunities and Challenges",arXiv (Cornell University),2021,preprint,blockchain,3,157.0,387.0,157.1901226597805,577,,True,True,baseline,nonfungibletokennftoverviewevaluationopportunitiesandchallenges,157.1901226597805,landmark,True | ||
| 58 | −4320717855,10.1016/j.future.2023.02.008,,Blockchain for the metaverse: A Review,Future Generation Computer Systems,2023,article,blockchain,4,569.0,763.0,178.82871696911812,771,171.5415,True,True,baseline,178.82871696911812,landmark,True | 58 | +3123868249,10.1093/rfs/hhz015,,"Sex, Drugs, and Bitcoin: How Much Illegal Activity Is Financed through Cryptocurrencies?",Review of Financial Studies,2019,article,blockchain,2,246.0,368.0,150.21153446724054,1051,145.8951,True,True,baseline,sexdrugsandbitcoinhowmuchillegalactivityisfinancedthroughcryptocurrencies,150.21153446724054,landmark,True | ||
| 59 | −4405432346,10.2139/ssrn.4993270,,Bitcoin: A Peer-to-Peer Electronic Cash System,SSRN Electronic Journal,2024,preprint,blockchain,3,199.0,200.0,176.00641968704025,200,,False,True,post,176.00641968704025,landmark,True | 59 | +2907683311,10.1109/access.2018.2890507,,Blockchain for AI: Review and Open Research Challenges,IEEE Access,2019,article,blockchain,1,200.0,342.0,139.59876301031593,997,153.0805,True,True,baseline,blockchainforaireviewandopenresearchchallenges,139.59876301031593,landmark,True | ||
| 60 | −2927344969,10.2139/ssrn.6433340,,Global Blockchain Benchmarking Study,SSRN Electronic Journal,2026,preprint,blockchain,1,45.0,45.0,1480.9248554913295,45,,False,True,post,159.98492606958206,landmark,True | 60 | +4400662300,10.38124/ijisrt/ijisrt24jul180,,Collaborative Networks: Integrating Blockchain for Enhanced Trust and Transparency,International Journal of Innovative Science and Research Technology (IJISRT),2024,article,blockchain,1,449.0,449.0,135.18269519575335,449,171.8245,True,True,post,collaborativenetworksintegratingblockchainforenhancedtrustandtransparency,135.18269519575335,landmark,True | ||
| 61 | −3162358200,10.48550/arxiv.2105.07447,2105.07447,"Non-Fungible Token (NFT): Overview, Evaluation, Opportunities and Challenges",arXiv (Cornell University),2021,preprint,blockchain,3,157.0,387.0,157.1901226597805,577,,True,True,baseline,157.1901226597805,landmark,True | 61 | +4402275599,10.38124/ijisrt/ijisrt24aug1218,,Implementing Blockchain Technology for Optimized Supply Chain and Enhanced Sustainability,International Journal of Innovative Science and Research Technology (IJISRT),2024,article,blockchain,1,447.0,449.0,135.18269519575335,449,171.8245,True,True,post,implementingblockchaintechnologyforoptimizedsupplychainandenhancedsustainability,135.18269519575335,landmark,True | ||
| 62 | −3123868249,10.1093/rfs/hhz015,,"Sex, Drugs, and Bitcoin: How Much Illegal Activity Is Financed through Cryptocurrencies?",Review of Financial Studies,2019,article,blockchain,2,246.0,368.0,150.21153446724054,1051,145.8951,True,True,baseline,150.21153446724054,landmark,True | 62 | +2606010969,10.1145/3183367,1704.03610,Blockchains for Business Process Management - Challenges and Opportunities,ACM Transactions on Management Information Systems,2018,article,blockchain,3,145.0,253.0,134.13986400885224,704,145.0233,True,True,baseline,blockchainsforbusinessprocessmanagementchallengesandopportunities,134.13986400885224,landmark,True | ||
| 63 | −2907683311,10.1109/access.2018.2890507,,Blockchain for AI: Review and Open Research Challenges,IEEE Access,2019,article,blockchain,1,200.0,342.0,139.59876301031593,997,153.0805,True,True,baseline,139.59876301031593,landmark,True | 63 | +2914735843,10.1109/tsmc.2019.2895123,,"Blockchain-Enabled Smart Contracts: Architecture, Applications, and Future Trends",IEEE Transactions on Systems Man and Cybernetics Systems,2019,article,blockchain,2,136.0,314.0,128.1696245182433,1157,157.1419,True,False,baseline,blockchainenabledsmartcontractsarchitectureapplicationsandfuturetrends,128.1696245182433,landmark,True | ||
| 64 | −2892520153,10.6028/nist.ir.8202,1906.11078,Blockchain technology overview,,2018,report,blockchain,5,103.0,273.0,137.2692548528491,1551,,True,True,baseline,137.2692548528491,landmark,True | 64 | +2973816953,10.7551/mitpress/11645.003.0010,,How Blockchain Will Change Organizations,The MIT Press eBooks,2018,book-chapter,blockchain,1,55.0,109.0,128.09387022313413,375,138.4143,True,False,baseline,howblockchainwillchangeorganizations,128.09387022313413,landmark,True | ||
| 65 | −3122636688,10.1093/rfs/hhz007,,Blockchain Disruption and Smart Contracts,Review of Financial Studies,2019,article,blockchain,1,189.0,332.0,135.5169278345757,1089,145.8951,True,False,baseline,135.5169278345757,landmark,True | 65 | +3123722958,10.1002/isaf.1424,,Toward an ontology‐driven blockchain design for supply‐chain provenance,"Intelligent systems in accounting, finance and management/Intelligent systems in accounting, finance & management",2018,article,blockchain,2,122.0,233.0,123.53592218997065,651,132.5698,True,False,baseline,towardanontologydrivenblockchaindesignforsupplychainprovenance,123.53592218997065,landmark,True | ||
| 66 | −4400662300,10.38124/ijisrt/ijisrt24jul180,,Collaborative Networks: Integrating Blockchain for Enhanced Trust and Transparency,International Journal of Innovative Science and Research Technology (IJISRT),2024,article,blockchain,1,449.0,449.0,135.18269519575335,449,171.8245,True,True,post,135.18269519575335,landmark,True | 66 | +2800028583,10.1016/bs.adcom.2018.03.006,,Blockchain Technology Use Cases in Healthcare,Advances in computers,2018,book-chapter,blockchain,1,42.0,100.0,117.51731213131572,434,154.6983,False,False,baseline,blockchaintechnologyusecasesinhealthcare,117.51731213131572,landmark,True | ||
| 67 | −4402275599,10.38124/ijisrt/ijisrt24aug1218,,Implementing Blockchain Technology for Optimized Supply Chain and Enhanced Sustainability,International Journal of Innovative Science and Research Technology (IJISRT),2024,article,blockchain,1,447.0,449.0,135.18269519575335,449,171.8245,True,True,post,135.18269519575335,landmark,True | 67 | +2784387076,10.1017/s1744137417000200,,Blockchains and the economic institutions of capitalism,Journal of Institutional Economics,2018,article,blockchain,4,143.0,220.0,116.64336000769761,577,110.4748,True,True,baseline,blockchainsandtheeconomicinstitutionsofcapitalism,116.64336000769761,landmark,True | ||
| 68 | −2606010969,10.1145/3183367,1704.03610,Blockchains for Business Process Management - Challenges and Opportunities,ACM Transactions on Management Information Systems,2018,article,blockchain,3,145.0,253.0,134.13986400885224,704,145.0233,True,True,baseline,134.13986400885224,landmark,True | 68 | +4380356557,10.4018/978-1-6684-5422-0.ch012,,Blockchain Technology in Renovating Healthcare,Advances in healthcare information systems and administration book series,2023,book-chapter,blockchain,2,139.0,169.0,116.33373815885354,171,116.723,True,False,post,blockchaintechnologyinrenovatinghealthcare,116.33373815885354,landmark,True | ||
| 69 | −2914735843,10.1109/tsmc.2019.2895123,,"Blockchain-Enabled Smart Contracts: Architecture, Applications, and Future Trends",IEEE Transactions on Systems Man and Cybernetics Systems,2019,article,blockchain,2,136.0,314.0,128.1696245182433,1157,157.1419,True,False,baseline,128.1696245182433,landmark,True | 69 | +2965761488,10.1016/j.tifs.2019.07.034,1908.07391,The rise of blockchain technology in agriculture and food supply chains,Trends in Food Science & Technology,2019,article,blockchain,2,102.0,285.0,116.33230250859661,1261,154.3302,True,True,baseline,theriseofblockchaintechnologyinagricultureandfoodsupplychains,116.33230250859661,landmark,True | ||
| 70 | −2973816953,10.7551/mitpress/11645.003.0010,,How Blockchain Will Change Organizations,The MIT Press eBooks,2018,book-chapter,blockchain,1,55.0,109.0,128.09387022313413,375,138.4143,True,False,baseline,128.09387022313413,landmark,True | 70 | +6906013109,10.15495/epub_ubt_00007183,,Blockchain Adoption in Organizations : Technical Barriers and Potential Solutions,EPub Bayreuth (University of Bayreuth),2023,dissertation,blockchain,5,3.0,4.0,115.45945945945945,5,,True,True,post,blockchainadoptioninorganizationstechnicalbarriersandpotentialsolutions,115.45945945945945,landmark,True | ||
| 71 | −3123722958,10.1002/isaf.1424,,Toward an ontology‐driven blockchain design for supply‐chain provenance,"Intelligent systems in accounting, finance and management/Intelligent systems in accounting, finance & management",2018,article,blockchain,2,122.0,233.0,123.53592218997065,651,132.5698,True,False,baseline,123.53592218997065,landmark,True | 71 | +4386476569,10.11606/d.55.2023.tde-06092023-102200,,Blockchain-based data governance for privacy-preserving in multi-stakeholder settings,,2023,dissertation,blockchain,3,3.0,4.0,115.45945945945945,4,,True,False,post,blockchainbaseddatagovernanceforprivacypreservinginmultistakeholdersettings,115.45945945945945,landmark,True | ||
| 72 | −2800028583,10.1016/bs.adcom.2018.03.006,,Blockchain Technology Use Cases in Healthcare,Advances in computers,2018,book-chapter,blockchain,1,42.0,100.0,117.51731213131572,434,154.6983,False,False,baseline,117.51731213131572,landmark,True | 72 | +2803836845,10.1016/j.joule.2018.04.016,,Bitcoin's Growing Energy Problem,Joule,2018,article,blockchain,1,119.0,217.0,115.05276873486537,687,112.4835,False,True,baseline,bitcoinsgrowingenergyproblem,115.05276873486537,landmark,True | ||
| 73 | −7160824505,10.55124/ijbs.v1i1.103,,Evaluation of Artificial Intelligence and Blockchain Integration Utilizing the DEM ATEL Method to Improve Privacy and Transparent in the Financial Sector,International Journal of Blockchain and Secure Systems,2026,article,blockchain,3,33.0,33.0,234.44990266060998,33,302.0434,True,True,post,117.32227911769351,landmark,True | 73 | +2927344969,10.2139/ssrn.6433340,,Global Blockchain Benchmarking Study,SSRN Electronic Journal,2026,preprint,blockchain,1,45.0,45.0,1480.9248554913295,45,,False,True,post,globalblockchainbenchmarkingstudy,114.09616854859023,landmark,True | ||
| 74 | −2784387076,10.1017/s1744137417000200,,Blockchains and the economic institutions of capitalism,Journal of Institutional Economics,2018,article,blockchain,4,143.0,220.0,116.64336000769761,577,110.4748,True,True,baseline,116.64336000769761,landmark,True | 74 | +2909202584,10.1109/tii.2019.2893433,,Privacy-Preserving Energy Trading Using Consortium Blockchain in Smart Grid,IEEE Transactions on Industrial Informatics,2019,article,blockchain,3,163.0,274.0,111.84228381528236,573,115.279,True,False,baseline,privacypreservingenergytradingusingconsortiumblockchaininsmartgrid,111.84228381528236,landmark,True | ||
| 75 | −4380356557,10.4018/978-1-6684-5422-0.ch012,,Blockchain Technology in Renovating Healthcare,Advances in healthcare information systems and administration book series,2023,book-chapter,blockchain,2,139.0,169.0,116.33373815885354,171,116.723,True,False,post,116.33373815885354,landmark,True | 75 | +3163490558,10.15760/etd.7527,,Assessment of the Blockchain Technology Adoption for the Management of the Electronic Health Record Systems,,2021,dissertation,blockchain,3,4.0,10.0,110.32663316582915,20,,True,True,baseline,assessmentoftheblockchaintechnologyadoptionforthemanagementoftheelectronichealthrecordsystems,110.32663316582915,landmark,True | ||
| 76 | −2965761488,10.1016/j.tifs.2019.07.034,1908.07391,The rise of blockchain technology in agriculture and food supply chains,Trends in Food Science & Technology,2019,article,blockchain,2,102.0,285.0,116.33230250859661,1261,154.3302,True,True,baseline,116.33230250859661,landmark,True | 76 | +2783535300,10.3390/logistics2010002,,The Supply Chain Has No Clothes: Technology Adoption of Blockchain for Supply Chain Transparency,Logistics,2018,article,blockchain,2,82.0,208.0,110.28099491636864,951,138.9974,True,True,baseline,thesupplychainhasnoclothestechnologyadoptionofblockchainforsupplychaintransparency,110.28099491636864,landmark,True | ||
| 77 | −4408302972,10.3390/educsci15030343,,The Impact of Artificial Intelligence (AI) on Students’ Academic Development,Education Sciences,2025,article,privacy_preserving_computation,1,469.0,469.0,407.18625178855723,469,511.2876,True,True,post,237.43540293645432,landmark,True | 77 | +4408302972,10.3390/educsci15030343,,The Impact of Artificial Intelligence (AI) on Students’ Academic Development,Education Sciences,2025,article,privacy_preserving_computation,1,469.0,469.0,407.18625178855723,469,511.2876,True,True,post,theimpactofartificialintelligenceaionstudentsacademicdevelopment,204.93966523196156,landmark,True | ||
| 78 | −2912213068,10.1145/3298981,,Federated Machine Learning,ACM Transactions on Intelligent Systems and Technology,2019,article,privacy_preserving_computation,5,504.0,1382.0,210.14063535179542,6223,251.7631,True,False,baseline,210.14063535179542,landmark,True | 78 | +7127055292,10.3389/feduc.2025.1648661,,Artificial intelligence in higher education: a systematic review of its impact on student engagement and the mediating role of teaching methods,Frontiers in Education,2026,review,privacy_preserving_computation,1,54.0,54.0,102.8810408921933,54,112.4196,True,True,post,artificialintelligenceinhighereducationasystematicreviewofitsimpactonstudentengagementandthemediatingroleofteachingmethods,136.9154022583083,landmark,True | ||
| 79 | −7127055292,10.3389/feduc.2025.1648661,,Artificial intelligence in higher education: a systematic review of its impact on student engagement and the mediating role of teaching methods,Frontiers in Education,2026,review,privacy_preserving_computation,1,54.0,54.0,102.8810408921933,54,112.4196,True,True,post,191.98191128349848,landmark,True | 79 | +3036422000,10.1109/access.2020.3010226,2006.10306,A Survey of COVID-19 Contact Tracing Apps,IEEE Access,2020,article,privacy_preserving_computation,4,302.0,443.0,128.99802950839438,582,117.8531,True,True,baseline,asurveyofcovid19contacttracingapps,128.99802950839438,landmark,True | ||
| 80 | −3036422000,10.1109/access.2020.3010226,2006.10306,A Survey of COVID-19 Contact Tracing Apps,IEEE Access,2020,article,privacy_preserving_computation,4,302.0,443.0,128.99802950839438,582,117.8531,True,True,baseline,128.99802950839438,landmark,True | 80 | +4302383326,,,Private Information Retrieval with Side Information,OakTrust (Texas A&M University Libraries),2018,dissertation,privacy_preserving_computation,5,24.0,28.0,124.06412825651303,28,,True,True,baseline,privateinformationretrievalwithsideinformation,124.06412825651303,landmark,True | ||
| 81 | −4302383326,,,Private Information Retrieval with Side Information,OakTrust (Texas A&M University Libraries),2018,dissertation,privacy_preserving_computation,5,24.0,28.0,124.06412825651303,28,,True,True,baseline,124.06412825651303,landmark,True | 81 | +3014084098,10.48550/arxiv.2003.11511,2003.11511,Contact Tracing Mobile Apps for COVID-19: Privacy Considerations and Related Trade-offs,arXiv (Cornell University),2020,preprint,privacy_preserving_computation,2,247.0,307.0,112.68777120315582,350,,True,True,baseline,contacttracingmobileappsforcovid19privacyconsiderationsandrelatedtradeoffs,112.68777120315582,landmark,True | ||
| 82 | −7137155252,10.1145/3801079,,Differentially Private Federated Learning: A Systematic Review,ACM Computing Surveys,2026,review,privacy_preserving_computation,4,33.0,33.0,37.86734693877551,21,27.926,True,True,post,117.32227911769351,landmark,True | 82 | +3013489453,10.1038/s41591-020-0832-5,,On the responsible use of digital data to tackle the COVID-19 pandemic,Nature Medicine,2020,article,privacy_preserving_computation,1,284.0,368.0,107.15863399342919,488,96.9324,False,True,baseline,ontheresponsibleuseofdigitaldatatotacklethecovid19pandemic,107.15863399342919,landmark,True | ||
| 83 | −3014084098,10.48550/arxiv.2003.11511,2003.11511,Contact Tracing Mobile Apps for COVID-19: Privacy Considerations and Related Trade-offs,arXiv (Cornell University),2020,preprint,privacy_preserving_computation,2,247.0,307.0,112.68777120315582,350,,True,True,baseline,112.68777120315582,landmark,True | 83 | +3021970994,10.2196/19857,,Acceptability of App-Based Contact Tracing for COVID-19: Cross-Country Survey Study,JMIR mhealth and uhealth,2020,article,privacy_preserving_computation,2,171.0,290.0,84.4456626578654,402,81.5906,True,True,baseline,acceptabilityofappbasedcontacttracingforcovid19crosscountrysurveystudy,84.4456626578654,landmark,True | ||
| 84 | −3013489453,10.1038/s41591-020-0832-5,,On the responsible use of digital data to tackle the COVID-19 pandemic,Nature Medicine,2020,article,privacy_preserving_computation,1,284.0,368.0,107.15863399342919,488,96.9324,False,True,baseline,107.15863399342919,landmark,True | 84 | +7137155252,10.1145/3801079,,Differentially Private Federated Learning: A Systematic Review,ACM Computing Surveys,2026,review,privacy_preserving_computation,4,33.0,33.0,37.86734693877551,21,27.926,True,True,post,differentiallyprivatefederatedlearningasystematicreview,83.6705236022995,landmark,True | ||
| 85 | −4414891672,10.1038/s41746-025-02280-z,2506.00660,"Differential privacy for medical deep learning: methods, tradeoffs, and deployment implications",npj Digital Medicine,2026,article,privacy_preserving_computation,5,29.0,29.0,32.27124442472503,29,104.7659,True,True,post,103.10139680039732,landmark,True | 85 | +4407111324,10.3389/fpsyg.2025.1498132,,Exploring the effects of artificial intelligence on student and academic well-being in higher education: a mini-review,Frontiers in Psychology,2025,review,privacy_preserving_computation,1,190.0,190.0,29.307559598494354,190,32.5824,True,True,post,exploringtheeffectsofartificialintelligenceonstudentandacademicwellbeinginhighereducationaminireview,83.02459785516567,landmark,True | ||
| 86 | −4407111324,10.3389/fpsyg.2025.1498132,,Exploring the effects of artificial intelligence on student and academic well-being in higher education: a mini-review,Frontiers in Psychology,2025,review,privacy_preserving_computation,1,190.0,190.0,29.307559598494354,190,32.5824,True,True,post,96.18918242628213,landmark,True | 86 | +4406636601,10.1016/j.accinf.2025.100734,,Challenges and opportunities for artificial intelligence in auditing: Evidence from the field,International Journal of Accounting Information Systems,2025,article,privacy_preserving_computation,2,183.0,183.0,31.465784036766877,183,92.2647,True,True,post,challengesandopportunitiesforartificialintelligenceinauditingevidencefromthefield,79.9657968815543,landmark,True | ||
| 87 | −7135198685,10.1098/rsos.250959,,Breaking interprovincial data silos: how federated learning can unlock Canada's public health potential,Royal Society Open Science,2026,article,privacy_preserving_computation,3,27.0,27.0,30.045641360950892,27,46.964,True,True,post,95.99095564174924,landmark,True | 87 | +4286110439,10.1515/9783839459249-009,,»Ohne die geht’s nicht« Zur Rolle von Apple und Google bei der Corona-Warn-App,transcript Verlag eBooks,2022,book-chapter,privacy_preserving_computation,1,100.0,100.0,77.6986788965706,100,67.9524,True,True,baseline,ohnediegehtsnichtzurrollevonappleundgooglebeidercoronawarnapp,77.6986788965706,landmark,True | ||
| 88 | −4406636601,10.1016/j.accinf.2025.100734,,Challenges and opportunities for artificial intelligence in auditing: Evidence from the field,International Journal of Accounting Information Systems,2025,article,privacy_preserving_computation,2,183.0,183.0,31.465784036766877,183,92.2647,True,True,post,92.64537044215595,landmark,True | 88 | +4399027046,10.22024/unikent/01.02.102717,,Secure and Privacy-preserving Federated Learning with Explainable Artificial Intelligence for Smart Healthcare System,theses.fr (ABES),2023,dissertation,privacy_preserving_computation,5,8.0,9.0,74.86447638603696,9,,True,True,post,secureandprivacypreservingfederatedlearningwithexplainableartificialintelligenceforsmarthealthcaresystem,74.86447638603696,landmark,True | ||
| 89 | −2384897939,10.38007/978-1-80053-622-7,,Big Data Security and Privacy Protection,,2025,book,privacy_preserving_computation,2,171.0,171.0,127.25255832992222,171,0.0,True,False,post,86.57026418365392,landmark,True | 89 | +3018102029,10.1609/aaai.v36i8.20825,2004.12088,SplitFed: When Federated Learning Meets Split Learning,Proceedings of the AAAI Conference on Artificial Intelligence,2022,conference-paper,privacy_preserving_computation,7,202.0,373.0,74.10667093485475,720,85.2216,True,True,baseline,splitfedwhenfederatedlearningmeetssplitlearning,74.10667093485475,landmark,True | ||
| 90 | −7155564432,10.1109/isbdas69350.2026.11484374,,Privacy-Preserving Anomaly Detection in Cloud Services using Hierarchical Federated Learning with Differential Privacy,,2026,conference-paper,privacy_preserving_computation,6,24.0,24.0,184.20139553974553,24,221.8777,True,True,post,85.3252939037771,landmark,True | 90 | +4414891672,10.1038/s41746-025-02280-z,2506.00660,"Differential privacy for medical deep learning: methods, tradeoffs, and deployment implications",npj Digital Medicine,2026,article,privacy_preserving_computation,5,29.0,29.0,32.27124442472503,29,104.7659,True,True,post,differentialprivacyformedicaldeeplearningmethodstradeoffsanddeploymentimplications,73.52864195353592,landmark,True | ||
| 91 | −3021970994,10.2196/19857,,Acceptability of App-Based Contact Tracing for COVID-19: Cross-Country Survey Study,JMIR mhealth and uhealth,2020,article,privacy_preserving_computation,2,171.0,290.0,84.4456626578654,402,81.5906,True,True,baseline,84.4456626578654,landmark,True | 91 | +4205766150,10.1787/8f394636-en,,Tracking and tracing COVID: Protecting privacy and data while using apps and biometrics,OECD policy responses to coronavirus (Covid-19),2020,report,privacy_preserving_computation,2,124.0,130.0,72.61058109280138,139,,False,False,baseline,trackingandtracingcovidprotectingprivacyanddatawhileusingappsandbiometrics,72.61058109280138,landmark,True | ||
| 92 | −4412565294,10.1145/3749987,2209.02299,A Survey of Machine Unlearning,ACM Transactions on Intelligent Systems and Technology,2025,article,privacy_preserving_computation,7,164.0,164.0,55.86648716521469,164,47.4381,True,True,post,83.02645219952774,landmark,True | 92 | +4412565294,10.1145/3749987,2209.02299,A Survey of Machine Unlearning,ACM Transactions on Intelligent Systems and Technology,2025,article,privacy_preserving_computation,7,164.0,164.0,55.86648716521469,164,47.4381,True,True,post,asurveyofmachineunlearning,71.66333709603774,landmark,True | ||
| 93 | −7154488736,10.1109/iccsc67078.2026.11468534,,Predicting Mental Health Challenges Among University Students Using a Federated CNN-BiLSTM-Attention Framework,"International Conference on Computing, Sciences and Communications (ICCSC)",2026,conference-paper,privacy_preserving_computation,3,22.0,22.0,289.37333333333333,22,365.288,True,False,post,78.21485274512901,landmark,True | 93 | +2797770018,10.1016/j.future.2018.02.050,,A two-stage locality-sensitive hashing based approach for privacy-preserving mobile service recommendation in cross-platform edge environment,Future Generation Computer Systems,2018,article,privacy_preserving_computation,3,55.0,132.0,69.98601600461856,192,60.259,False,False,baseline,atwostagelocalitysensitivehashingbasedapproachforprivacypreservingmobileservicerecommendationincrossplatformedgeenvironment,69.98601600461856,landmark,True | ||
| 94 | −4286110439,10.1515/9783839459249-009,,»Ohne die geht’s nicht« Zur Rolle von Apple und Google bei der Corona-Warn-App,transcript Verlag eBooks,2022,book-chapter,privacy_preserving_computation,1,100.0,100.0,77.6986788965706,100,67.9524,True,True,baseline,77.6986788965706,landmark,True | 94 | +7135198685,10.1098/rsos.250959,,Breaking interprovincial data silos: how federated learning can unlock Canada's public health potential,Royal Society Open Science,2026,article,privacy_preserving_computation,3,27.0,27.0,30.045641360950892,27,46.964,True,True,post,breakinginterprovincialdatasiloshowfederatedlearningcanunlockcanadaspublichealthpotential,68.45770112915415,landmark,True | ||
| 95 | −4399027046,10.22024/unikent/01.02.102717,,Secure and Privacy-preserving Federated Learning with Explainable Artificial Intelligence for Smart Healthcare System,theses.fr (ABES),2023,dissertation,privacy_preserving_computation,5,8.0,9.0,74.86447638603696,9,,True,True,post,74.86447638603696,landmark,True | 95 | +2799796316,10.1155/2018/3075849,,Privacy‐Aware Multidimensional Mobile Service Quality Prediction and Recommendation in Distributed Fog Environment,Wireless Communications and Mobile Computing,2018,article,privacy_preserving_computation,5,58.0,129.0,68.39542473178632,166,58.2504,True,True,baseline,privacyawaremultidimensionalmobileservicequalitypredictionandrecommendationindistributedfogenvironment,68.39542473178632,landmark,True | ||
| 96 | −3018102029,10.1609/aaai.v36i8.20825,2004.12088,SplitFed: When Federated Learning Meets Split Learning,Proceedings of the AAAI Conference on Artificial Intelligence,2022,conference-paper,privacy_preserving_computation,7,202.0,373.0,74.10667093485475,720,85.2216,True,True,baseline,74.10667093485475,landmark,True | 96 | +3016632787,10.1109/tifs.2020.2988575,1911.00222,Federated Learning With Differential Privacy: Algorithms and Performance Analysis,IEEE Transactions on Information Forensics and Security,2020,article,privacy_preserving_computation,8,206.0,490.0,61.28715445275716,2379,83.9132,True,True,baseline,federatedlearningwithdifferentialprivacyalgorithmsandperformanceanalysis,61.28715445275716,landmark,True | ||
| 97 | −4205766150,10.1787/8f394636-en,,Tracking and tracing COVID: Protecting privacy and data while using apps and biometrics,OECD policy responses to coronavirus (Covid-19),2020,report,privacy_preserving_computation,2,124.0,130.0,72.61058109280138,139,,False,False,baseline,72.61058109280138,landmark,True | 97 | +7155564432,10.1109/isbdas69350.2026.11484374,,Privacy-Preserving Anomaly Detection in Cloud Services using Hierarchical Federated Learning with Differential Privacy,,2026,conference-paper,privacy_preserving_computation,6,24.0,24.0,184.20139553974553,24,221.8777,True,True,post,privacypreservinganomalydetectionincloudservicesusinghierarchicalfederatedlearningwithdifferentialprivacy,60.851289892581455,landmark,True | ||
| 98 | −7125591879,10.1109/tii.2025.3649540,,Privacy Protection-Enhanced Vertical-Horizontal Federated Learning Secure Sharing for Multisource Heterogeneous Data,IEEE Transactions on Industrial Informatics,2026,article,privacy_preserving_computation,4,20.0,20.0,22.2560306377414,20,72.2524,False,False,post,71.10441158648091,landmark,True | 98 | +4389365236,10.3390/educsci13121216,,Adaptive Learning Using Artificial Intelligence in e-Learning: A Literature Review,Education Sciences,2023,article,privacy_preserving_computation,1,200.0,642.0,58.93867484628822,957,83.985,True,True,post,adaptivelearningusingartificialintelligenceinelearningaliteraturereview,58.93867484628822,landmark,True | ||
| 99 | −2797770018,10.1016/j.future.2018.02.050,,A two-stage locality-sensitive hashing based approach for privacy-preserving mobile service recommendation in cross-platform edge environment,Future Generation Computer Systems,2018,article,privacy_preserving_computation,3,55.0,132.0,69.98601600461856,192,60.259,False,False,baseline,69.98601600461856,landmark,True | 99 | +3041977451,,,Analyzing adoption of contact tracing apps using UTAUT,,2020,dissertation,privacy_preserving_computation,1,1.0,6.0,56.4292343387471,7,,True,False,baseline,analyzingadoptionofcontacttracingappsusingutaut,56.4292343387471,landmark,True | ||
| 100 | −2799796316,10.1155/2018/3075849,,Privacy‐Aware Multidimensional Mobile Service Quality Prediction and Recommendation in Distributed Fog Environment,Wireless Communications and Mobile Computing,2018,article,privacy_preserving_computation,5,58.0,129.0,68.39542473178632,166,58.2504,True,True,baseline,68.39542473178632,landmark,True | 100 | +7154488736,10.1109/iccsc67078.2026.11468534,,Predicting Mental Health Challenges Among University Students Using a Federated CNN-BiLSTM-Attention Framework,"International Conference on Computing, Sciences and Communications (ICCSC)",2026,conference-paper,privacy_preserving_computation,3,22.0,22.0,289.37333333333333,22,365.288,True,False,post,predictingmentalhealthchallengesamonguniversitystudentsusingafederatedcnnbilstmattentionframework,55.78034906819967,landmark,True | ||
| 101 | −7147711523,10.1109/tie.2026.3672787,,Open-Circuit Fault Diagnosis for Power Converters Under Variable Operational Conditions: From a Source-Free Domain Adaptation Perspective,IEEE Transactions on Industrial Electronics,2026,article,privacy_preserving_computation,1,18.0,18.0,19.938921161825725,18,50.0378,True,False,post,63.99397042783282,landmark,True | 101 | +2790400697,10.1109/access.2018.2806881,,"A Survey on Big Data Market: Pricing, Trading and Protection",IEEE Access,2018,article,privacy_preserving_computation,5,60.0,105.0,55.670694549128406,356,61.4642,True,True,baseline,asurveyonbigdatamarketpricingtradingandprotection,55.670694549128406,landmark,True | ||
| 102 | −7125492275,10.1016/j.ress.2026.112271,,Source-free domain adaptation for cross-domain remaining useful life prediction: A distributed federated learning perspective,Reliability Engineering & System Safety,2026,article,federated_learning,1,34.0,34.0,37.662406639004146,34,94.5159,False,False,post,120.87749969701756,landmark,True | 102 | +7125492275,10.1016/j.ress.2026.112271,,Source-free domain adaptation for cross-domain remaining useful life prediction: A distributed federated learning perspective,Reliability Engineering & System Safety,2026,article,federated_learning,1,34.0,34.0,37.662406639004146,34,94.5159,False,False,post,sourcefreedomainadaptationforcrossdomainremainingusefullifepredictionadistributedfederatedlearningperspective,86.2059940144904,landmark,True | ||
| 103 | −4382463479,10.1609/aaai.v37i9.26330,2212.01197,FedALA: Adaptive Local Aggregation for Personalized Federated Learning,Proceedings of the AAAI Conference on Artificial Intelligence,2023,conference-paper,federated_learning,9,131.0,320.0,73.79786537022606,420,79.3941,True,True,post,73.79786537022606,landmark,True | 103 | +4382463479,10.1609/aaai.v37i9.26330,2212.01197,FedALA: Adaptive Local Aggregation for Personalized Federated Learning,Proceedings of the AAAI Conference on Artificial Intelligence,2023,conference-paper,federated_learning,9,131.0,320.0,73.79786537022606,420,79.3941,True,True,post,fedalaadaptivelocalaggregationforpersonalizedfederatedlearning,73.79786537022606,landmark,True | ||
| 104 | −4220990555,10.14711/thesis-991012994506603412,,Robust federated learning with attack-adaptive aggregation,,2021,dissertation,federated_learning,5,9.0,14.0,63.67692307692308,24,,True,False,baseline,63.67692307692308,landmark,True | 104 | +4220990555,10.14711/thesis-991012994506603412,,Robust federated learning with attack-adaptive aggregation,,2021,dissertation,federated_learning,5,9.0,14.0,63.67692307692308,24,,True,False,baseline,robustfederatedlearningwithattackadaptiveaggregation,63.67692307692308,landmark,True | ||
| 105 | −3133814152,10.1109/tnnls.2022.3160699,2103.00710,Towards Personalized Federated Learning,IEEE Transactions on Neural Networks and Learning Systems,2022,article,federated_learning,7,231.0,554.0,57.083945154517146,1182,74.5614,True,True,baseline,57.083945154517146,landmark,True | 105 | +3133814152,10.1109/tnnls.2022.3160699,2103.00710,Towards Personalized Federated Learning,IEEE Transactions on Neural Networks and Learning Systems,2022,article,federated_learning,7,231.0,554.0,57.083945154517146,1182,74.5614,True,True,baseline,towardspersonalizedfederatedlearning,57.083945154517146,landmark,True | ||
| 106 | −7159977201,10.1109/tmc.2026.3688489,,AsyncFed-SAR: Toward Communication-Efficient Asynchronous Federated Learning for SAR Image Target Recognition,IEEE Transactions on Mobile Computing,2026,article,federated_learning,3,16.0,16.0,17.80482451019312,16,57.8019,False,False,post,56.883529269184734,landmark,True | 106 | +3159080474,,,Federated Learning for Internet of Things: A Comprehensive Survey,Deakin Research Online (Deakin University),2021,article,federated_learning,4,142.0,416.0,48.48164672055449,894,61.8395,True,True,baseline,federatedlearningforinternetofthingsacomprehensivesurvey,48.48164672055449,landmark,True | ||
| 107 | −3123459983,10.1016/j.knosys.2021.106775,,A survey on federated learning,Knowledge-Based Systems,2021,article,federated_learning,3,153.0,433.0,50.46286786057715,1861,83.6289,False,False,baseline,50.46286786057715,landmark,True | 107 | +3100779497,10.1007/s41666-020-00082-4,1911.06270,Federated Learning for Healthcare Informatics,Journal of Healthcare Informatics Research,2020,article,federated_learning,2,140.0,343.0,42.90100811693001,1515,58.5309,False,True,baseline,federatedlearningforhealthcareinformatics,42.90100811693001,landmark,True | ||
| 108 | −3159080474,,,Federated Learning for Internet of Things: A Comprehensive Survey,Deakin Research Online (Deakin University),2021,article,federated_learning,4,142.0,416.0,48.48164672055449,894,61.8395,True,True,baseline,48.48164672055449,landmark,True | 108 | +2995735216,,,Fair Resource Allocation in Federated Learning,International Conference on Learning Representations,2020,conference-paper,federated_learning,4,225.0,300.0,42.51886520143499,120,11.8933,True,False,baseline,fairresourceallocationinfederatedlearning,42.51886520143499,landmark,True | ||
| 109 | −7118779462,10.1016/j.compeleceng.2025.110924,,Federated learning in healthcare: Recent progress and challenges,Computers & Electrical Engineering,2026,article,federated_learning,2,13.0,13.0,14.466419914531912,13,46.964,False,False,post,46.2178675312126,landmark,True | 109 | +7159977201,10.1109/tmc.2026.3688489,,AsyncFed-SAR: Toward Communication-Efficient Asynchronous Federated Learning for SAR Image Target Recognition,IEEE Transactions on Mobile Computing,2026,article,federated_learning,3,16.0,16.0,17.80482451019312,16,57.8019,False,False,post,asyncfedsartowardcommunicationefficientasynchronousfederatedlearningforsarimagetargetrecognition,40.567526595054304,landmark,True | ||
| 110 | −3100779497,10.1007/s41666-020-00082-4,1911.06270,Federated Learning for Healthcare Informatics,Journal of Healthcare Informatics Research,2020,article,federated_learning,2,140.0,343.0,42.90100811693001,1515,58.5309,False,True,baseline,42.90100811693001,landmark,True | 110 | +3045674654,10.1038/s41598-020-69250-1,,Federated learning in medicine: facilitating multi-institutional collaborations without sharing patient data,Scientific Reports,2020,article,federated_learning,4,122.0,323.0,40.39949160865421,1607,50.8594,True,True,baseline,federatedlearninginmedicinefacilitatingmultiinstitutionalcollaborationswithoutsharingpatientdata,40.39949160865421,landmark,True | ||
| 111 | −7133255133,10.3390/computers15030155,,"Federated Learning: A Survey of Core Challenges, Current Methods, and Opportunities",Computers,2026,article,federated_learning,5,12.0,12.0,13.353618382644841,12,43.3514,True,True,post,42.66264695188855,landmark,True | 111 | +3018464563,10.1109/mis.2020.2988604,1907.09173,FedHealth: A Federated Transfer Learning Framework for Wearable Healthcare,IEEE Intelligent Systems,2020,article,federated_learning,7,141.0,309.0,38.648430052861144,999,49.6281,True,True,baseline,fedhealthafederatedtransferlearningframeworkforwearablehealthcare,38.648430052861144,landmark,True | ||
| 112 | −2995735216,,,Fair Resource Allocation in Federated Learning,International Conference on Learning Representations,2020,conference-paper,federated_learning,4,225.0,300.0,42.51886520143499,120,11.8933,True,False,baseline,42.51886520143499,landmark,True | 112 | +4387105517,10.1145/3625558,2307.10616,Heterogeneous Federated Learning: State-of-the-art and Research Challenges,ACM Computing Surveys,2023,article,federated_learning,7,133.0,417.0,38.282597213243285,608,53.4131,True,True,post,heterogeneousfederatedlearningstateoftheartandresearchchallenges,38.282597213243285,landmark,True | ||
| 113 | −4408476406,10.1016/j.jnca.2025.104165,,CBRFL: A framework for Committee-based Byzantine-Resilient Federated Learning,Journal of Network and Computer Applications,2025,article,federated_learning,4,83.0,83.0,28.27389289459036,83,34.5383,False,False,post,42.01948495463904,landmark,True | 113 | +4408476406,10.1016/j.jnca.2025.104165,,CBRFL: A framework for Committee-based Byzantine-Resilient Federated Learning,Journal of Network and Computer Applications,2025,article,federated_learning,4,83.0,83.0,28.27389289459036,83,34.5383,False,False,post,cbrflaframeworkforcommitteebasedbyzantineresilientfederatedlearning,36.268640115677634,landmark,True | ||
| 114 | −4407318675,10.1016/j.aei.2025.103179,,Federated learning-empowered smart manufacturing and product lifecycle management: A review,Advanced Engineering Informatics,2025,article,federated_learning,2,82.0,82.0,27.933243582607346,82,34.1222,False,False,post,41.51322609976387,landmark,True | 114 | +4407318675,10.1016/j.aei.2025.103179,,Federated learning-empowered smart manufacturing and product lifecycle management: A review,Advanced Engineering Informatics,2025,article,federated_learning,2,82.0,82.0,27.933243582607346,82,34.1222,False,False,post,federatedlearningempoweredsmartmanufacturingandproductlifecyclemanagementareview,35.83166854801887,landmark,True | ||
| 115 | −3045674654,10.1038/s41598-020-69250-1,,Federated learning in medicine: facilitating multi-institutional collaborations without sharing patient data,Scientific Reports,2020,article,federated_learning,4,122.0,323.0,40.39949160865421,1607,50.8594,True,True,baseline,40.39949160865421,landmark,True | 115 | +4393156671,10.1609/aaai.v38i15.29617,2401.03230,FedTGP: Trainable Global Prototypes with Adaptive-Margin-Enhanced Contrastive Learning for Data and Model Heterogeneity in Federated Learning,Proceedings of the AAAI Conference on Artificial Intelligence,2024,conference-paper,federated_learning,8,66.0,121.0,33.633393493997694,121,36.8098,True,True,post,fedtgptrainableglobalprototypeswithadaptivemarginenhancedcontrastivelearningfordataandmodelheterogeneityinfederatedlearning,33.633393493997694,landmark,True | ||
| 116 | −7121318593,10.1007/s10115-025-02673-2,,A comprehensive survey on federated learning for privacy preservation in digital healthcare applications,Knowledge and Information Systems,2026,article,federated_learning,3,11.0,11.0,12.24081685075777,11,39.7388,False,False,post,39.107426372564504,landmark,True | 116 | +7118779462,10.1016/j.compeleceng.2025.110924,,Federated learning in healthcare: Recent progress and challenges,Computers & Electrical Engineering,2026,article,federated_learning,2,13.0,13.0,14.466419914531912,13,46.964,False,False,post,federatedlearninginhealthcarerecentprogressandchallenges,32.96111535848162,landmark,True | ||
| 117 | −3018464563,10.1109/mis.2020.2988604,1907.09173,FedHealth: A Federated Transfer Learning Framework for Wearable Healthcare,IEEE Intelligent Systems,2020,article,federated_learning,7,141.0,309.0,38.648430052861144,999,49.6281,True,True,baseline,38.648430052861144,landmark,True | 117 | +3196371845,10.1016/j.neucom.2021.07.098,2106.06843,Federated learning on non-IID data: A survey,Neurocomputing,2021,article,federated_learning,6,75.0,277.0,32.28225034036922,1043,48.3425,False,True,baseline,federatedlearningonnoniiddataasurvey,32.28225034036922,landmark,True | ||
| 118 | −4387105517,10.1145/3625558,2307.10616,Heterogeneous Federated Learning: State-of-the-art and Research Challenges,ACM Computing Surveys,2023,article,federated_learning,7,133.0,417.0,38.282597213243285,608,53.4131,True,True,post,38.282597213243285,landmark,True | 118 | +7133255133,10.3390/computers15030155,,"Federated Learning: A Survey of Core Challenges, Current Methods, and Opportunities",Computers,2026,article,federated_learning,5,12.0,12.0,13.353618382644841,12,43.3514,True,True,post,federatedlearningasurveyofcorechallengescurrentmethodsandopportunities,30.425644946290728,landmark,True | ||
| 119 | −4415878254,10.1109/jiot.2026.3669440,2510.15300,DFCA: Decentralized Federated Clustering Algorithm,IEEE Internet of Things Journal,2026,article,federated_learning,6,10.0,10.0,11.1280153188707,10,36.1262,True,True,post,35.552205793240454,landmark,True | 119 | +7104465905,10.71781/10873,,Re-weighted softmax cross-entropy to control forgetting in federated learning,Papyrus : Institutional Repository (Université de Montréal),2022,dissertation,federated_learning,3,1.0,4.0,29.956140350877195,0,,True,True,post,reweightedsoftmaxcrossentropytocontrolforgettinginfederatedlearning,29.956140350877195,landmark,True | ||
| 120 | −4406269727,10.1016/j.eswa.2024.126354,,Federated learning framework based on trimmed mean aggregation rules,Expert Systems with Applications,2025,article,federated_learning,3,67.0,67.0,22.8235039028621,67,22.0546,False,True,post,33.91934327663633,landmark,True | 120 | +4406269727,10.1016/j.eswa.2024.126354,,Federated learning framework based on trimmed mean aggregation rules,Expert Systems with Applications,2025,article,federated_learning,3,67.0,67.0,22.8235039028621,67,22.0546,False,True,post,federatedlearningframeworkbasedontrimmedmeanaggregationrules,29.277095033137364,landmark,True | ||
| 121 | −4393156671,10.1609/aaai.v38i15.29617,2401.03230,FedTGP: Trainable Global Prototypes with Adaptive-Margin-Enhanced Contrastive Learning for Data and Model Heterogeneity in Federated Learning,Proceedings of the AAAI Conference on Artificial Intelligence,2024,conference-paper,federated_learning,8,66.0,121.0,33.633393493997694,121,36.8098,True,True,post,33.633393493997694,landmark,True | 121 | +4402716118,10.1109/cvpr52733.2024.01139,,FedAS: Bridging Inconsistency in Personalized Federated Learning,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2024,conference-paper,federated_learning,5,56.0,104.0,28.90804068905587,104,31.6381,True,False,post,fedasbridginginconsistencyinpersonalizedfederatedlearning,28.90804068905587,landmark,True | ||
| 122 | −4412162472,10.1038/s41746-025-01836-3,,A scoping review of the governance of federated learning in healthcare,npj Digital Medicine,2025,article,federated_learning,2,65.0,65.0,22.142205278896068,65,27.048,True,True,post,32.90682556688599,landmark,True | 122 | +4412162472,10.1038/s41746-025-01836-3,,A scoping review of the governance of federated learning in healthcare,npj Digital Medicine,2025,article,federated_learning,2,65.0,65.0,22.142205278896068,65,27.048,True,True,post,ascopingreviewofthegovernanceoffederatedlearninginhealthcare,28.403151897819832,landmark,True | ||
| 123 | −3196371845,10.1016/j.neucom.2021.07.098,2106.06843,Federated learning on non-IID data: A survey,Neurocomputing,2021,article,federated_learning,6,75.0,277.0,32.28225034036922,1043,48.3425,False,True,baseline,32.28225034036922,landmark,True | 123 | +4293155325,10.1016/j.ipm.2022.103061,,"Federated learning review: Fundamentals, enabling technologies, and future applications",Information Processing & Management,2022,article,federated_learning,3,116.0,274.0,28.232853740681765,550,37.8866,False,False,baseline,federatedlearningreviewfundamentalsenablingtechnologiesandfutureapplications,28.232853740681765,landmark,True | ||
| 124 | −4226376129,10.1007/978-3-030-85559-8_13,,"Federated Learning: Challenges, Methods, and Future Directions",EAI/Springer Innovations in Communication and Computing,2022,book-chapter,federated_learning,3,37.0,57.0,30.546581711727224,99,39.2282,False,False,baseline,30.546581711727224,landmark,True | 124 | +7121318593,10.1007/s10115-025-02673-2,,A comprehensive survey on federated learning for privacy preservation in digital healthcare applications,Knowledge and Information Systems,2026,article,federated_learning,3,11.0,11.0,12.24081685075777,11,39.7388,False,False,post,acomprehensivesurveyonfederatedlearningforprivacypreservationindigitalhealthcareapplications,27.890174534099835,landmark,True | ||
| 125 | −7104465905,10.71781/10873,,Re-weighted softmax cross-entropy to control forgetting in federated learning,Papyrus : Institutional Repository (Université de Montréal),2022,dissertation,federated_learning,3,1.0,4.0,29.956140350877195,0,,True,True,post,29.956140350877195,landmark,True | 125 | +4415878254,10.1109/jiot.2026.3669440,2510.15300,DFCA: Decentralized Federated Clustering Algorithm,IEEE Internet of Things Journal,2026,article,federated_learning,6,10.0,10.0,11.1280153188707,10,36.1262,True,True,post,dfcadecentralizedfederatedclusteringalgorithm,25.35470412190894,landmark,True | ||
| 126 | −4402716118,10.1109/cvpr52733.2024.01139,,FedAS: Bridging Inconsistency in Personalized Federated Learning,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2024,conference-paper,federated_learning,5,56.0,104.0,28.90804068905587,104,31.6381,True,False,post,28.90804068905587,landmark,True | 126 | +4312634912,10.1109/cvpr52688.2022.00985,2205.03993,Layer-wised Model Aggregation for Personalized Federated Learning,IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings,2022,conference-paper,federated_learning,6,48.0,126.0,25.033352648235116,240,30.554,True,True,baseline,layerwisedmodelaggregationforpersonalizedfederatedlearning,25.033352648235116,landmark,True | ||
modified
literature_synthesis/landmarks/selection_report.json
+16 −16
@@ -1,27 +1,27 @@ | |||||
| 1 | { | 1 | { | ||
| 2 | − "high_priority": 13414, | 2 | + "high_priority": 13484, | ||
| 3 | − "landmarks": 1093, | 3 | + "landmarks": 1089, | ||
| 4 | "by_area": { | 4 | "by_area": { | ||
| 5 | − "ai_ml": 234, | 5 | + "ai_ml": 233, | ||
| 6 | − "perception_interaction": 207, | 6 | + "perception_interaction": 208, | ||
| 7 | − "data_distributed": 152, | 7 | + "data_distributed": 151, | ||
| 8 | "security_privacy": 125, | 8 | "security_privacy": 125, | ||
| 9 | "hardware_emerging": 125, | 9 | "hardware_emerging": 125, | ||
| 10 | "software_pl": 100, | 10 | "software_pl": 100, | ||
| 11 | − "computational_science": 100, | 11 | + "computational_science": 97, | ||
| 12 | "theory": 50 | 12 | "theory": 50 | ||
| 13 | }, | 13 | }, | ||
| 14 | "by_year_landmarks": { | 14 | "by_year_landmarks": { | ||
| 15 | − "2018": 108, | 15 | + "2018": 121, | ||
| 16 | − "2019": 107, | 16 | + "2019": 115, | ||
| 17 | "2020": 106, | 17 | "2020": 106, | ||
| 18 | − "2021": 87, | 18 | + "2021": 93, | ||
| 19 | − "2022": 92, | 19 | + "2022": 102, | ||
| 20 | − "2023": 128, | 20 | + "2023": 146, | ||
| 21 | − "2024": 135, | 21 | + "2024": 150, | ||
| 22 | − "2025": 111, | 22 | + "2025": 106, | ||
| 23 | − "2026": 219 | 23 | + "2026": 150 | ||
| 24 | }, | 24 | }, | ||
| 25 | − "share_with_abstract_landmarks": 0.8261665141811528, | 25 | + "share_with_abstract_landmarks": 0.8292011019283747, | ||
| 26 | − "share_oa_landmarks": 0.7401646843549863 | 26 | + "share_oa_landmarks": 0.7731864095500459 | ||
| 27 | } | 27 | } | ||
| \ No newline at end of file | |||||
modified
literature_synthesis/landmarks/software_pl_abstracts.jsonl
+41 −41
@@ -1,25 +1,29 @@ | |||||
| 1 | −{"work_id": 4297781990, "title": "Leveraging Answer Set Programming for Continuous Monitoring, Fault Detection, and Explanation of Automated and Autonomous Driving Systems", "abstract": "Recent advancements in automated and autonomous driving systems have facilitated their integration into modern vehicles, enabling them to accurately perceive their surroundings and support or even fully undertake complex driving tasks. Given the complexity and unpredictable nature of driving environments and traffic situations, ensuring the correct behavior of such systems is essential to prevent hazardous situations, increase user acceptance, and avoid human harm. However, the increased complexity of these systems and the extensive search space of possible scenarios introduce significant challenges to testing and real-time fault management. Hence, besides rigorous testing during the development phase, there is a need for additional validation and verification during operation. This paper proposes utilizing Answer Set Programming (ASP), a form of declarative programming, for continuous real-time monitoring, fault detection, and explanation to ensure the correct functioning of automated and autonomous driving systems. Our approach aims to enhance the reliability and safety of such systems by detecting violations and providing explanations that can support fault-adaptive control or mitigation strategies. We demonstrate the effectiveness of our methodology across diverse scenarios executed within a simulation environment, discuss the main challenges encountered, and outline future research directions."} | 1 | +{"work_id": 2400988715, "title": "Functional Stable Model Semantics and Answer Set Programming Modulo Theories", "abstract": "Recently there has been an increasing interest in incorporating ``intensional'' functions in answer set programming. Intensional functions are those whose values can be described by other functions and predicates, rather than being pre-defined as in the standard answer set programming. We demonstrate that the functional stable model semantics plays an important role in the framework of ``Answer Set Programming Modulo Theories (ASPMT)'' -- a tight integration of answer set programming and satisfiability modulo theories, under which existing integration approaches can be viewed as special cases where the role of functions is limited. We show that ``tight'' ASPMT programs can be translated into SMT instances, which is similar to the known relationship between ASP and SAT."} | ||
| 2 | −{"work_id": 3103225940, "title": "An LLVM backend for the Open Modelica Compiler", "abstract": "This thesis presents the construction and evaluation of an LLVM based codegenerator, an LLVM backend. The introduction of an LLVM based backend into the OpenModelica compiler was done to examine the advantages and disadvantages of compiling Modelica and MetaModelica to LLVM IR instead of C. To answer this question, the LLVM backend was compared against the existing interpreter and C code generator using four different schemes with corresponding cases. This comparison was made both for both optimised and unoptimised code. From the experiments, it was concluded that an LLVM backend can be used to improve runtime and compile time performance in the OpenModelica Interactive environment."} | 2 | +{"work_id": 4391974543, "title": "Software Testing With Large Language Models: Survey, Landscape, and Vision", "abstract": "Pre-trained large language models (LLMs) have recently emerged as a breakthrough technology in natural language processing and artificial intelligence, with the ability to handle large-scale datasets and exhibit remarkable performance across a wide range of tasks. Meanwhile, software testing is a crucial undertaking that serves as a cornerstone for ensuring the quality and reliability of software products. As the scope and complexity of software systems continue to grow, the need for more effective software testing techniques becomes increasingly urgent, making it an area ripe for innovative approaches such as the use of LLMs. This paper provides a comprehensive review of the utilization of LLMs in software testing. It analyzes 102 relevant studies that have used LLMs for software testing, from both the software testing and LLMs perspectives. The paper presents a detailed discussion of the software testing tasks for which LLMs are commonly used, among which test case preparation and program repair are the most representative. It also analyzes the commonly used LLMs, the types of prompt engineering that are employed, as well as the accompanied techniques with these LLMs. It also summarizes the key challenges and potential opportunities in this direction. This work can serve as a roadmap for future research in this area, highlighting potential avenues for exploration, and identifying gaps in our current understanding of the use of LLMs in software testing."} | ||
| 3 | −{"work_id": 7151510318, "title": "Unsupervised Translation of Programming Languages", "abstract": "Traduction Non Supervis\u00e9e de Langages de Programmation Un transcompilateur est un syst\u00e8me qui convertit le code source d'un langage de programmation de haut niveau (tel que C++ ou Python) vers un autre. Les transcompilateurs sont principalement utilis\u00e9s pour l'interop\u00e9rabilit\u00e9 et pour transf\u00e9rer des bases de code \u00e9crites dans un langage obsol\u00e8te (par exemple COBOL ou Python2) vers un langage plus moderne. Ils reposent g\u00e9n\u00e9ralement sur des r\u00e8gles de r\u00e9\u00e9criture manuelles, appliqu\u00e9es \u00e0 l'arbre de syntaxe abstraite du code source. Malheureusement, les traductions qui en r\u00e9sultent manquent souvent de lisibilit\u00e9, ne respectent pas les conventions du langage cible et n\u00e9cessitent des modifications manuelles pour fonctionner correctement. Le processus global de traduction prend du temps et n\u00e9cessite une expertise \u00e0 la fois dans les langages source et cible, ce qui rend les projets de traduction de code co\u00fbteux. Bien que les mod\u00e8les neuronaux surpassent consid\u00e9rablement leurs homologues bas\u00e9s sur des r\u00e8gles dans le cadre de la traduction en langues naturelles, leurs applications \u00e0 la transcompilation ont \u00e9t\u00e9 limit\u00e9es en raison de la raret\u00e9 des donn\u00e9es parall\u00e8les dans ce domaine. Nous proposons des m\u00e9thodes pour entra\u00eener des transcompilateurs neuronaux efficaces sans donn\u00e9es supervis\u00e9es. Les traducteurs de langues naturelles sont \u00e9valu\u00e9s avec des m\u00e9triques bas\u00e9es sur la cooccurrence de tokens entre la traduction et la r\u00e9f\u00e9rence. Nous remarquons que ces m\u00e9triques ne capturent pas la s\u00e9mantique des langages de programmation. Nous construisons et publions donc une base de donn\u00e9es de tests compos\u00e9e de 852 fonctions parall\u00e8les, ainsi que de tests unitaires pour v\u00e9rifier l'exactitude s\u00e9mantique des traductions. Nous exploitons d'abord les objectifs con\u00e7us pour les langues naturelles afin d'apprendre des repr\u00e9sentations multilingues du code source, et entra\u00eenons un mod\u00e8le \u00e0 traduire, en utilisant seulement le code monolingue de projets open source GitHub. Ce mod\u00e8le surpasse les m\u00e9thodes bas\u00e9es sur des r\u00e8gles pour la traduction de fonctions entre C++, Java et Python. Ensuite, nous d\u00e9veloppons une m\u00e9thode de pr\u00e9-entra\u00eenement, amenant le mod\u00e8le \u00e0 apprendre des repr\u00e9sentations s\u00e9mantiques du code. Cela conduit \u00e0 des performances am\u00e9lior\u00e9es sur plusieurs t\u00e2ches, y compris la traduction de code non supervis\u00e9e. Enfin, nous utilisons des tests unitaires automatis\u00e9s pour cr\u00e9er des exemples de traductions de programmes. Entra\u00eener un mod\u00e8le sur ces exemples conduit \u00e0 des am\u00e9liorations significatives des performances de nos transcompilateurs neuronaux. Nos m\u00e9thodes reposent exclusivement sur du code source monolingue, ne n\u00e9cessitent aucune expertise dans les langues source ou cible, et peuvent facilement \u00eatre g\u00e9n\u00e9ralis\u00e9es \u00e0 d'autres langages."} | 3 | +{"work_id": 2964015378, "title": "Detecting Functionality-Specific Vulnerabilities via Retrieving Individual Functionality-Equivalent APIs in Open-Source Repositories", "abstract": "Functionality-specific vulnerabilities, which mainly occur in Application Programming Interfaces (APIs) with specific functionalities, are crucial for software developers to detect and avoid. When detecting individual functionality-specific vulnerabilities, the existing two categories of approaches are ineffective because they consider only the API bodies and are unable to handle diverse implementations of functionality-equivalent APIs. To effectively detect functionality-specific vulnerabilities, we propose APISS, the first approach to utilize API doc strings and signatures instead of API bodies. APISS first retrieves functionality-equivalent APIs for APIs with existing vulnerabilities and then migrates Proof-of-Concepts (PoCs) of the existing vulnerabilities for newly detected vulnerable APIs. To retrieve functionality-equivalent APIs, we leverage a Large Language Model for API embedding to improve the accuracy and address the effectiveness and scalability issues suffered by the existing approaches. To migrate PoCs of the existing vulnerabilities for newly detected vulnerable APIs, we design a semi-automatic schema to substantially reduce manual costs. We conduct a comprehensive evaluation to empirically compare APISS with four state-of-the-art approaches of detecting vulnerabilities and two state-of-the-art approaches of retrieving functionality-equivalent APIs. The evaluation subjects include 180 widely used Java repositories using 10 existing vulnerabilities, along with their PoCs. The results show that APISS effectively retrieves functionality-equivalent APIs, achieving a Top-1 Accuracy of 0.81 while the best of the baselines under comparison achieves only 0.55. APISS is highly efficient: the manual costs are within 10 minutes per vulnerability and the end-to-end runtime overhead of testing one candidate API is less than 2 hours. APISS detects 179 new vulnerabilities and receives 60 new CVE IDs, bringing high value to security practice."} | ||
| 4 | −{"work_id": 1586677474, "title": "Handbook of Satisfiability", "abstract": "'Satisfiability (SAT) related topics have attracted researchers from various disciplines: logic, applied areas such as planning, scheduling, operations research and combinatorial optimization, but also theoretical issues on the theme of complexity and much more, they all are connected through SAT. My personal interest in SAT stems from actual solving: The increase in power of modern SAT solvers over the past 15 years has been phenomenal. It has become the key enabling technology in automated verification of both computer hardware and software' - Edmund M. Clarke (FORE Systems University Professor of Computer Science and Professor of Electrical and Computer Engineering at Carnegie Mellon University). 'Bounded Model Checking (BMC) of computer hardware is now probably the most widely used model checking technique. The counterexamples that it finds are just satisfying instances of a Boolean formula obtained by unwinding to some fixed depth a sequential circuit and its specification in linear temporal logic. Extending model checking to software verification is a much more difficult problem on the frontier of current research. One promising approach for languages like C with finite word-length integers is to use the same idea as in BMC but with a decision procedure for the theory of bit-vectors instead of SAT. All decision procedures for bit-vectors that I am familiar with ultimately make use of a fast SAT solver to handle complex formulas' - Edmund M. Clarke (FORE Systems University Professor of Computer Science and Professor of Electrical and Computer Engineering at Carnegie Mellon University). 'Decision procedures for more complicated theories, like linear real and integer arithmetic, are also used in program verification. Most of them use powerful SAT solvers in an essential way. Clearly, efficient SAT solving is a key technology for 21st century computer science. I expect this collection of papers on all theoretical and practical aspects of SAT solving will be extremely useful to both students and researchers and will lead to many further advances in the field' - Edmund M. Clarke (FORE Systems University Professor of Computer Science and Professor of Electrical and Computer Engineering at Carnegie Mellon University)."} | 4 | +{"work_id": 2783614532, "title": "A Survey on Compiler Autotuning using Machine Learning", "abstract": "Since the mid-1990s, researchers have been trying to use machine-learning-based approaches to solve a number of different compiler optimization problems. These techniques primarily enhance the quality of the obtained results and, more importantly, make it feasible to tackle two main compiler optimization problems: optimization selection (choosing which optimizations to apply) and phase-ordering (choosing the order of applying optimizations). The compiler optimization space continues to grow due to the advancement of applications, increasing number of compiler optimizations, and new target architectures. Generic optimization passes in compilers cannot fully leverage newly introduced optimizations and, therefore, cannot keep up with the pace of increasing options. This survey summarizes and classifies the recent advances in using machine learning for the compiler optimization field, particularly on the two major problems of (1) selecting the best optimizations, and (2) the phase-ordering of optimizations. The survey highlights the approaches taken so far, the obtained results, the fine-grain classification among different approaches, and finally, the influential papers of the field."} | ||
| 5 | −{"work_id": 3115704172, "title": "Lineage-driven Fault Injection for Actor-based Programs", "abstract": "Lineage-driven fault injection (LDFI) is an approach for finding bugs or faults in distributed systems. Its current state-of-the-art implementation, Molly, takes programs written in the logic programming language Dedalus as its input. The problem is that Dedalus is a small and obscure language, used to serve as a proof of concept for Molly. Thus, the objective of this thesis is to extend and adapt Molly to a general-purpose, object-oriented language where distributed programs are written using the actor-based framework Akka. This thesis presents a novel concept for employing lineage-driven fault injection for actor-based programs in addition to implementing said concept to analyze existing Akka programs. The results show that the lineage-driven fault injector for Akka programs, ldfi-akka, is capable of successfully pinpointing the weaknesses of the programs that can be analyzed in a feasible amount of time. However, ldfi-akka struggles to analyze larger and complex programs as the underlying SAT-solver used is overwhelmed. The correctness of the analysis made by ldfi-akka is partially based on the subject programs\u2019 ability to a) be rewritten in such a way that logging can be added and b) exhibit deterministic behavior across multiple runs. Conclusively, this study presents a novel approach to employ lineage-driven fault injection on actor-based programs and ldfi-akka, an implementation of LDFI on Akka programs."} | ||||
| 6 | −{"work_id": 2890660842, "title": "Efficient Formal Safety Analysis of Neural Networks", "abstract": "Neural networks are increasingly deployed in real-world safety-critical domains such as autonomous driving, aircraft collision avoidance, and malware detection. However, these networks have been shown to often mispredict on inputs with minor adversarial or even accidental perturbations. Consequences of such errors can be disastrous and even potentially fatal as shown by the recent Tesla autopilot crash. Thus, there is an urgent need for formal analysis systems that can rigorously check neural networks for violations of different safety properties such as robustness against adversarial perturbations within a certain $L$-norm of a given image. An effective safety analysis system for a neural network must be able to either ensure that a safety property is satisfied by the network or find a counterexample, i.e., an input for which the network will violate the property. Unfortunately, most existing techniques for performing such analysis struggle to scale beyond very small networks and the ones that can scale to larger networks suffer from high false positives and cannot produce concrete counterexamples in case of a property violation. In this paper, we present a new efficient approach for rigorously checking different safety properties of neural networks that significantly outperforms existing approaches by multiple orders of magnitude. Our approach can check different safety properties and find concrete counterexamples for networks that are 10$\\times$ larger than the ones supported by existing analysis techniques. We believe that our approach to estimating tight output bounds of a network for a given input range can also help improve the explainability of neural networks and guide the training process of more robust neural networks."} | ||||
| 7 | {"work_id": 3139485201, "title": "Towards automated construction of compiler optimizations", "abstract": "Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, September, 2020"} | 5 | {"work_id": 3139485201, "title": "Towards automated construction of compiler optimizations", "abstract": "Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, September, 2020"} | ||
| 8 | {"work_id": 3214427835, "title": "Sparse tensor algebra compilation", "abstract": "Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2020"} | 6 | {"work_id": 3214427835, "title": "Sparse tensor algebra compilation", "abstract": "Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2020"} | ||
| 9 | {"work_id": 3188948186, "title": "Speed Control of DC Motor Using Fuzzy PID Controller", "abstract": "In this project, we designed a DC motor whose speed can be controlled by a PID controller. The proportional, integral and derivative gains (KP, KI, KD) of the PID controller are adjusted according to Fuzzy logic. First of all, the fuzzy logic controller is designed according to rules so that the systems is basically robust. There are 25 rules for the auto-tuning of each parameter of the PID controller. The FLC (fuzzy logic controller) has two inputs. The first is the motor speed error between the reference (setpoint) and the actual speed. The second is the variation of the speed error (derivative of the speed error). Secondly the output of the FLC is the parameters of the PID controller which are used to control the speed of the DC motor. The study shows that both the precise characters of PID controllers and the flexible characters of fuzzy controllers are present in the fuzzy self-tuning PID controller. The fuzzy auto-tuning approach implemented on a conventional PID structure was able to control the speed of the DC motor. It also improved the dynamic and static response of the system. The comparison between the conventional response and the fuzzy self-tuning response was performed based on the simulation result obtained by MATLAB/SIMULINK. The simulation results show that the designed self-adaptive PID controller achieves good dynamic behavior of the DC motor, perfect speed tracking with short rise and settling times, zero overshoot and steady state error and thus gives better performance compared to the conventional PID controller. We then model the fuzzy PID using simple code on Arduino IDE and perform a practical experiment, to confirm our theorical results."} | 7 | {"work_id": 3188948186, "title": "Speed Control of DC Motor Using Fuzzy PID Controller", "abstract": "In this project, we designed a DC motor whose speed can be controlled by a PID controller. The proportional, integral and derivative gains (KP, KI, KD) of the PID controller are adjusted according to Fuzzy logic. First of all, the fuzzy logic controller is designed according to rules so that the systems is basically robust. There are 25 rules for the auto-tuning of each parameter of the PID controller. The FLC (fuzzy logic controller) has two inputs. The first is the motor speed error between the reference (setpoint) and the actual speed. The second is the variation of the speed error (derivative of the speed error). Secondly the output of the FLC is the parameters of the PID controller which are used to control the speed of the DC motor. The study shows that both the precise characters of PID controllers and the flexible characters of fuzzy controllers are present in the fuzzy self-tuning PID controller. The fuzzy auto-tuning approach implemented on a conventional PID structure was able to control the speed of the DC motor. It also improved the dynamic and static response of the system. The comparison between the conventional response and the fuzzy self-tuning response was performed based on the simulation result obtained by MATLAB/SIMULINK. The simulation results show that the designed self-adaptive PID controller achieves good dynamic behavior of the DC motor, perfect speed tracking with short rise and settling times, zero overshoot and steady state error and thus gives better performance compared to the conventional PID controller. We then model the fuzzy PID using simple code on Arduino IDE and perform a practical experiment, to confirm our theorical results."} | ||
| 10 | {"work_id": 630549275, "title": "The clustered multikernel: an approach to formal verification of multiprocessor operating-system kernels", "abstract": "The key software component of a computer system is the operating-system kernel. It always needs to be trusted because it runs in the CPU\u2019s privileged mode and therefore has access to all system components. Consequently, kernel correctness is crucial for secure, safe and reliable computer systems. Correctness can be improved by careful design, development and testing. However, this is not enough for kernels of high-assurance computer systems used in defence, aviation and the like. Much stronger correctness guarantees can be obtained by formal verification of a kernel\u2019s implementation. In order to keep verification complexity at a manageable level, prior kernel verification research only targeted uniprocessor kernels. In other words, the current state of research restricts computer systems that require a verified kernel to running on one CPU/core. This is a problem because manufacturers are increasing computing power of their systems by adding more CPUs and cores. In this thesis, we demonstrate that it is possible to extend a verified uniprocessor kernel to utilise multiple CPUs/cores and leverage the existing proofs to obtain a verified multiprocessor version of that kernel (under certain assumptions). To this end, we introduce the clustered multikernel, a point in the design space of multiprocessor kernels. The main feature of this design is that it reduces concurrent data access to a minimum while offering a configurable trade-off between scalability and flexibility. Furthermore, we present a conversion scheme to convert a uniprocessor kernel into a clustered multikernel. Based on this design, we contribute a refinement lifting framework, which lifts the converted kernel\u2019s functional-correctness proof such that it applies to the clusteredmultikernel version. The support for handling the introduced concurrency is added to the existing verification framework in a non-intrusive way and accounts for total-store-order weak memory ordering. We demonstrate the practicability of our approach by successfully applying it to seL4, a formally verified general-purpose microkernel. We show that this requires relatively low effort, compared to the kernel\u2019s initial verification. All formal specifications and proofs are machine-checked in the theorem prover Isabelle/ HOL."} | 8 | {"work_id": 630549275, "title": "The clustered multikernel: an approach to formal verification of multiprocessor operating-system kernels", "abstract": "The key software component of a computer system is the operating-system kernel. It always needs to be trusted because it runs in the CPU\u2019s privileged mode and therefore has access to all system components. Consequently, kernel correctness is crucial for secure, safe and reliable computer systems. Correctness can be improved by careful design, development and testing. However, this is not enough for kernels of high-assurance computer systems used in defence, aviation and the like. Much stronger correctness guarantees can be obtained by formal verification of a kernel\u2019s implementation. In order to keep verification complexity at a manageable level, prior kernel verification research only targeted uniprocessor kernels. In other words, the current state of research restricts computer systems that require a verified kernel to running on one CPU/core. This is a problem because manufacturers are increasing computing power of their systems by adding more CPUs and cores. In this thesis, we demonstrate that it is possible to extend a verified uniprocessor kernel to utilise multiple CPUs/cores and leverage the existing proofs to obtain a verified multiprocessor version of that kernel (under certain assumptions). To this end, we introduce the clustered multikernel, a point in the design space of multiprocessor kernels. The main feature of this design is that it reduces concurrent data access to a minimum while offering a configurable trade-off between scalability and flexibility. Furthermore, we present a conversion scheme to convert a uniprocessor kernel into a clustered multikernel. Based on this design, we contribute a refinement lifting framework, which lifts the converted kernel\u2019s functional-correctness proof such that it applies to the clusteredmultikernel version. The support for handling the introduced concurrency is added to the existing verification framework in a non-intrusive way and accounts for total-store-order weak memory ordering. We demonstrate the practicability of our approach by successfully applying it to seL4, a formally verified general-purpose microkernel. We show that this requires relatively low effort, compared to the kernel\u2019s initial verification. All formal specifications and proofs are machine-checked in the theorem prover Isabelle/ HOL."} | ||
| 11 | {"work_id": 2962724414, "title": "Machine Learning in Compiler Optimization", "abstract": "In the last decade, machine-learning-based compilation has moved from an obscure research niche to a mainstream activity. In this paper, we describe the relationship between machine learning and compiler optimization and introduce the main concepts of features, models, training, and deployment. We then provide a comprehensive survey and provide a road map for the wide variety of different research areas. We conclude with a discussion on open issues in the area and potential research directions. This paper provides both an accessible introduction to the fast moving area of machine-learning-based compilation and a detailed bibliography of its main achievements."} | 9 | {"work_id": 2962724414, "title": "Machine Learning in Compiler Optimization", "abstract": "In the last decade, machine-learning-based compilation has moved from an obscure research niche to a mainstream activity. In this paper, we describe the relationship between machine learning and compiler optimization and introduce the main concepts of features, models, training, and deployment. We then provide a comprehensive survey and provide a road map for the wide variety of different research areas. We conclude with a discussion on open issues in the area and potential research directions. This paper provides both an accessible introduction to the fast moving area of machine-learning-based compilation and a detailed bibliography of its main achievements."} | ||
| 12 | {"work_id": 4205342885, "title": "The Futures of Europe: Society 5.0 and Industry 5.0 as Driving Forces of Future Universities", "abstract": "The concept of Society 5.0 and Industry 5.0 is not a simple chronological continuation or alternative to Industry 4.0 paradigm. Society 5.0 aims to place human beings at the midpoint of innovation, exploiting the impact of technology and Industry 4.0 results with the technological integration to improve quality of life, social responsibility and sustainability. This ground-breaking perspective has common points with the objectives of the United Nations Sustainable Development Goals. It also has major implication for universities transformations. Universities are called upon producing knowledge for new technologies and social innovation. In our paper, we argue that digitalisation opens new perspectives for universities and can become one of the main drivers of their change. Incorporating the assumptions of Society 5.0 and Industry 5.0 into the universities practices and policies will allow both universities and societies to fully benefit from digital transformation. Making the human-oriented innovation as the universities trademark and developing new cooperative models will also help to achieve sustainable priorities. The use of the Quintuple Helix Model (QHM) might foster the process of necessary transformations capacities as it integrates different perspectives and sets the stage for sustainability priorities and considerations. As far as the practical goal is concerned, the paper proposes a set of recommendations for universities aiming at developing new forms and channels of distribution of education, research and innovation within in the context of QHM and Society 5.0. We call them socially and digitally engaged model."} | 10 | {"work_id": 4205342885, "title": "The Futures of Europe: Society 5.0 and Industry 5.0 as Driving Forces of Future Universities", "abstract": "The concept of Society 5.0 and Industry 5.0 is not a simple chronological continuation or alternative to Industry 4.0 paradigm. Society 5.0 aims to place human beings at the midpoint of innovation, exploiting the impact of technology and Industry 4.0 results with the technological integration to improve quality of life, social responsibility and sustainability. This ground-breaking perspective has common points with the objectives of the United Nations Sustainable Development Goals. It also has major implication for universities transformations. Universities are called upon producing knowledge for new technologies and social innovation. In our paper, we argue that digitalisation opens new perspectives for universities and can become one of the main drivers of their change. Incorporating the assumptions of Society 5.0 and Industry 5.0 into the universities practices and policies will allow both universities and societies to fully benefit from digital transformation. Making the human-oriented innovation as the universities trademark and developing new cooperative models will also help to achieve sustainable priorities. The use of the Quintuple Helix Model (QHM) might foster the process of necessary transformations capacities as it integrates different perspectives and sets the stage for sustainability priorities and considerations. As far as the practical goal is concerned, the paper proposes a set of recommendations for universities aiming at developing new forms and channels of distribution of education, research and innovation within in the context of QHM and Society 5.0. We call them socially and digitally engaged model."} | ||
| 11 | +{"work_id": 4384521943, "title": "nl2spec: Interactively Translating Unstructured Natural Language to Temporal Logics with Large Language Models", "abstract": "Abstract A rigorous formalization of desired system requirements is indispensable when performing any verification task. This often limits the application of verification techniques, as writing formal specifications is an error-prone and time-consuming manual task. To facilitate this, we present , a framework for applying Large Language Models (LLMs) to derive formal specifications (in temporal logics) from unstructured natural language. In particular, we introduce a new methodology to detect and resolve the inherent ambiguity of system requirements in natural language: we utilize LLMs to map subformulas of the formalization back to the corresponding natural language fragments of the input. Users iteratively add, delete, and edit these sub-translations to amend erroneous formalizations, which is easier than manually redrafting the entire formalization. The framework is agnostic to specific application domains and can be extended to similar specification languages and new neural models. We perform a user study to obtain a challenging dataset, which we use to run experiments on the quality of translations. We provide an open-source implementation, including a web-based frontend."} | ||||
| 12 | +{"work_id": 4415797413, "title": "SGLang: Efficient Execution of Structured Language Model Programs", "abstract": "Large language models (LLMs) are increasingly used for complex tasks that require multiple generation calls, advanced prompting techniques, control flow, and structured inputs/outputs. However, efficient systems are lacking for programming and executing these applications. We introduce SGLang, a system for efficient execution of complex language model programs. SGLang consists of a frontend language and a runtime. The frontend simplifies programming with primitives for generation and parallelism control. The runtime accelerates execution with novel optimizations like RadixAttention for KV cache reuse and compressed finite state machines for faster structured output decoding. Experiments show that SGLang achieves up to 6.4x higher throughput compared to state-of-the-art inference systems on various large language and multi-modal models on tasks including agent control, logical reasoning, few-shot learning benchmarks, JSON decoding, retrieval-augmented generation pipelines, and multi-turn chat. The code is publicly available at https://github.com/sgl-project/sglang"} | ||||
| 13 | {"work_id": 7110046239, "title": "Can Open Large Language Models Catch Vulnerabilities?", "abstract": "As Large Language Models (LLMs) become increasingly integrated into secure software development workflows, a critical question remains unanswered: can these models not only detect insecure code but also reliably classify vulnerabilities according to standardized taxonomies? In this work, we conduct a systematic evaluation of three state-of-the-art LLMs - Llama3, Codestral, and Deepseek R1 - using a carefully filtered subset of the Big-Vul dataset annotated with eight representative Common Weakness Enumeration categories. Adopting a closed-world classification setup, we assess each model's performance in both identifying the presence of vulnerabilities and mapping them to the correct CWE label. Our findings reveal a sharp contrast between high detection rates and markedly poor classification accuracy, with frequent overgeneralization and misclassification. Moreover, we analyze model-specific biases and common failure modes, shedding light on the limitations of current LLMs in performing fine-grained security reasoning.These insights are especially relevant in educational contexts, where LLMs are being adopted as learning aids despite their limitations. A nuanced understanding of their behaviour is essential to prevent the propagation of misconceptions among students. Our results expose key challenges that must be addressed before LLMs can be reliably deployed in security-sensitive environments."} | 13 | {"work_id": 7110046239, "title": "Can Open Large Language Models Catch Vulnerabilities?", "abstract": "As Large Language Models (LLMs) become increasingly integrated into secure software development workflows, a critical question remains unanswered: can these models not only detect insecure code but also reliably classify vulnerabilities according to standardized taxonomies? In this work, we conduct a systematic evaluation of three state-of-the-art LLMs - Llama3, Codestral, and Deepseek R1 - using a carefully filtered subset of the Big-Vul dataset annotated with eight representative Common Weakness Enumeration categories. Adopting a closed-world classification setup, we assess each model's performance in both identifying the presence of vulnerabilities and mapping them to the correct CWE label. Our findings reveal a sharp contrast between high detection rates and markedly poor classification accuracy, with frequent overgeneralization and misclassification. Moreover, we analyze model-specific biases and common failure modes, shedding light on the limitations of current LLMs in performing fine-grained security reasoning.These insights are especially relevant in educational contexts, where LLMs are being adopted as learning aids despite their limitations. A nuanced understanding of their behaviour is essential to prevent the propagation of misconceptions among students. Our results expose key challenges that must be addressed before LLMs can be reliably deployed in security-sensitive environments."} | ||
| 14 | {"work_id": 3008797115, "title": "Metamorphic Testing: A New Approach for Generating Next Test Cases", "abstract": "In software testing, a set of test cases is constructed according to some predefined selection criteria. The software is then examined against these test cases. Three interesting observations have been made on the current artifacts of software testing. Firstly, an error-revealing test case is considered useful while a successful test case which does not reveal software errors is usually not further investigated. Whether these successful test cases still contain useful information for revealing software errors has not been properly studied. Secondly, no matter how extensive the testing has been conducted in the development phase, errors may still exist in the software [5]. These errors, if left undetected, may eventually cause damage to the production system. The study of techniques for uncovering software errors in the production phase is seldom addressed in the literature. Thirdly, as indicated by Weyuker in [6], the availability of test oracles is pragmatically unattainable in most situations. However, the availability of test oracles is generally assumed in conventional software testing techniques. In this paper, we propose a novel test case selection technique that derives new test cases from the successful ones. The selection aims at revealing software errors that are possibly left undetected in successful test cases which may be generated using some existing strategies. As such, the proposed technique augments the effectiveness of existing test selection strategies. The technique also helps uncover software errors in the production phase and can be used in the absence of test oracles."} | 14 | {"work_id": 3008797115, "title": "Metamorphic Testing: A New Approach for Generating Next Test Cases", "abstract": "In software testing, a set of test cases is constructed according to some predefined selection criteria. The software is then examined against these test cases. Three interesting observations have been made on the current artifacts of software testing. Firstly, an error-revealing test case is considered useful while a successful test case which does not reveal software errors is usually not further investigated. Whether these successful test cases still contain useful information for revealing software errors has not been properly studied. Secondly, no matter how extensive the testing has been conducted in the development phase, errors may still exist in the software [5]. These errors, if left undetected, may eventually cause damage to the production system. The study of techniques for uncovering software errors in the production phase is seldom addressed in the literature. Thirdly, as indicated by Weyuker in [6], the availability of test oracles is pragmatically unattainable in most situations. However, the availability of test oracles is generally assumed in conventional software testing techniques. In this paper, we propose a novel test case selection technique that derives new test cases from the successful ones. The selection aims at revealing software errors that are possibly left undetected in successful test cases which may be generated using some existing strategies. As such, the proposed technique augments the effectiveness of existing test selection strategies. The technique also helps uncover software errors in the production phase and can be used in the absence of test oracles."} | ||
| 15 | −{"work_id": 4399452770, "title": "Engenharia de Software", "abstract": "Este artigo resume a hist\u00f3ria e as caracter\u00edsticas dos cursos de Engenharia de Software no Brasil."} | 15 | +{"work_id": 4297781990, "title": "Leveraging Answer Set Programming for Continuous Monitoring, Fault Detection, and Explanation of Automated and Autonomous Driving Systems", "abstract": "Recent advancements in automated and autonomous driving systems have facilitated their integration into modern vehicles, enabling them to accurately perceive their surroundings and support or even fully undertake complex driving tasks. Given the complexity and unpredictable nature of driving environments and traffic situations, ensuring the correct behavior of such systems is essential to prevent hazardous situations, increase user acceptance, and avoid human harm. However, the increased complexity of these systems and the extensive search space of possible scenarios introduce significant challenges to testing and real-time fault management. Hence, besides rigorous testing during the development phase, there is a need for additional validation and verification during operation. This paper proposes utilizing Answer Set Programming (ASP), a form of declarative programming, for continuous real-time monitoring, fault detection, and explanation to ensure the correct functioning of automated and autonomous driving systems. Our approach aims to enhance the reliability and safety of such systems by detecting violations and providing explanations that can support fault-adaptive control or mitigation strategies. We demonstrate the effectiveness of our methodology across diverse scenarios executed within a simulation environment, discuss the main challenges encountered, and outline future research directions."} | ||
| 16 | {"work_id": 2957311447, "title": "The Marabou Framework for Verification and Analysis of Deep Neural Networks", "abstract": "Deep neural networks are revolutionizing the way complex systems are designed. Consequently, there is a pressing need for tools and techniques for network analysis and certification. To help in addressing that need, we present Marabou, a framework for verifying deep neural networks. Marabou is an SMT-based tool that can answer queries about a network\u2019s properties by transforming these queries into constraint satisfaction problems. It can accommodate networks with different activation functions and topologies, and it performs high-level reasoning on the network that can curtail the search space and improve performance. It also supports parallel execution to further enhance scalability. Marabou accepts multiple input formats, including protocol buffer files generated by the popular TensorFlow framework for neural networks. We describe the system architecture and main components, evaluate the technique and discuss ongoing work."} | 16 | {"work_id": 2957311447, "title": "The Marabou Framework for Verification and Analysis of Deep Neural Networks", "abstract": "Deep neural networks are revolutionizing the way complex systems are designed. Consequently, there is a pressing need for tools and techniques for network analysis and certification. To help in addressing that need, we present Marabou, a framework for verifying deep neural networks. Marabou is an SMT-based tool that can answer queries about a network\u2019s properties by transforming these queries into constraint satisfaction problems. It can accommodate networks with different activation functions and topologies, and it performs high-level reasoning on the network that can curtail the search space and improve performance. It also supports parallel execution to further enhance scalability. Marabou accepts multiple input formats, including protocol buffer files generated by the popular TensorFlow framework for neural networks. We describe the system architecture and main components, evaluate the technique and discuss ongoing work."} | ||
| 17 | {"work_id": 6944541633, "title": "Verification of multi-objective Markov models", "abstract": "Probabilistic systems evolve based on environmental events that occur with a certain probability. For such systems to perform well, we are often interested in multiple objectives, i.e., quantitative performance measures like the probability of a failure or the expected time until task completion. Sometimes, these objectives conflict with each other: minimizing the failure probability possibly means completing the task takes longer. Compromises need to be found. We consider Markov models---particularly Markov decision processes (MDPs) and Markov Automata (MAs). These state-based modeling formalisms describe a system in its random environment. Starting from an initial state, the transitioning behavior in MDPs is determined by probabilistic and nondeterministic choices. MAs further extend MDPs by exponentially distributed continuous time delays. Rewards can be attached to states or transitions to model system quantities such as energy consumption, productivity, or monetary costs. Objectives are formally specified by a mapping from (infinite) system executions to the value of interest, e.g., the total accumulated costs or the average energy consumption. The expected value of an objective is defined once the nondeterminism is resolved using a strategy---intuitively reflecting the choices of a system controller. Different strategies induce different expected objective values. Multi-objective verification of MDPs and MAs analyzes the interplay between the considered objectives and identifies which trade-offs between expected objective values are possible, i.e., achievable by some strategy. We study practically efficient methods to compute the set of achievable solutions. For this, we establish a general framework and its instantiation for (undiscounted) total reachability reward objectives, long-run average reward objectives, and reward-bounded objectives. We propagate the errors made by approximative methods, yielding sound under- and over-approximations. We further consider multi-dimensional quantiles that ask under which reward constraints a given objective value is achievable. Finally, we investigate a setting in which the strategies must be simple, i.e., non-randomized and with limited memory access. All presented approaches are integrated into the state-of-the-art probabilistic model checker Storm. An extensive evaluation of this implementation on a broad set of multi-objective benchmarks shows that our approaches scale to large models with millions of states."} | 17 | {"work_id": 6944541633, "title": "Verification of multi-objective Markov models", "abstract": "Probabilistic systems evolve based on environmental events that occur with a certain probability. For such systems to perform well, we are often interested in multiple objectives, i.e., quantitative performance measures like the probability of a failure or the expected time until task completion. Sometimes, these objectives conflict with each other: minimizing the failure probability possibly means completing the task takes longer. Compromises need to be found. We consider Markov models---particularly Markov decision processes (MDPs) and Markov Automata (MAs). These state-based modeling formalisms describe a system in its random environment. Starting from an initial state, the transitioning behavior in MDPs is determined by probabilistic and nondeterministic choices. MAs further extend MDPs by exponentially distributed continuous time delays. Rewards can be attached to states or transitions to model system quantities such as energy consumption, productivity, or monetary costs. Objectives are formally specified by a mapping from (infinite) system executions to the value of interest, e.g., the total accumulated costs or the average energy consumption. The expected value of an objective is defined once the nondeterminism is resolved using a strategy---intuitively reflecting the choices of a system controller. Different strategies induce different expected objective values. Multi-objective verification of MDPs and MAs analyzes the interplay between the considered objectives and identifies which trade-offs between expected objective values are possible, i.e., achievable by some strategy. We study practically efficient methods to compute the set of achievable solutions. For this, we establish a general framework and its instantiation for (undiscounted) total reachability reward objectives, long-run average reward objectives, and reward-bounded objectives. We propagate the errors made by approximative methods, yielding sound under- and over-approximations. We further consider multi-dimensional quantiles that ask under which reward constraints a given objective value is achievable. Finally, we investigate a setting in which the strategies must be simple, i.e., non-randomized and with limited memory access. All presented approaches are integrated into the state-of-the-art probabilistic model checker Storm. An extensive evaluation of this implementation on a broad set of multi-objective benchmarks shows that our approaches scale to large models with millions of states."} | ||
| 18 | {"work_id": 7127344046, "title": "Artificial intelligence policy challenges and institutional readiness in Omani higher education", "abstract": "The rapid integration of artificial intelligence (AI) into higher education presents transformative opportunities alongside complex governance challenges, particularly in emerging economies. This mixed-methods study examines AI policy adoption, implementation barriers, and stakeholder priorities across 28 higher education institutions (HEIs) in Oman, a Gulf Cooperation Council (GCC) nation actively pursuing AI-driven economic diversification under Vision 2040. Combining quantitative surveys ( n = 39 institutional leaders) and qualitative focus groups ( n = 15 students), the research reveals a critical governance gap: only 5.1% of higher education institutions (HEIs) have formal AI policies, while 74.4% lack frameworks. Key challenges include academic integrity violations (e.g., undetectable AI-generated plagiarism), student over-reliance on generative tools (reported by 59% of faculty), and systemic deficiencies in training, infrastructure, and regulatory clarity. The thematic analysis identifies faculty-driven pedagogical innovations and institutional unpreparedness, with 69% of respondents citing \u201cregulatory uncertainty\u201d as the primary barrier. Applying DiMaggio and Powell\u2019s (1983) institutional isomorphism framework, we expose how coercive (top-down policy enforcement gaps), mimetic (ad-hoc replication of regional models), and normative (training deficits) pressures perpetuate fragmentation. Findings underscore the urgency of context-sensitive strategies, proposing three actionable recommendations: (1) national ethical guidelines aligned with UNESCO\u2019s AI Competency Framework, (2) mandatory faculty certification programs targeting 80% compliance by 2026, and (3) equitable resource allocation through Oman\u2019s National AI Observatory. The study positions Oman as a GCC policy laboratory, offering transferable insights for mid-sized economies balancing AI innovation with cultural preservation. Limitations include sample size constraints ( n = 28 HEIs) and the rapid evolution of AI, necessitating longitudinal research. This work contributes to global debates on AI governance by empirically linking institutional theory to policy implementation in Arab higher education contexts."} | 18 | {"work_id": 7127344046, "title": "Artificial intelligence policy challenges and institutional readiness in Omani higher education", "abstract": "The rapid integration of artificial intelligence (AI) into higher education presents transformative opportunities alongside complex governance challenges, particularly in emerging economies. This mixed-methods study examines AI policy adoption, implementation barriers, and stakeholder priorities across 28 higher education institutions (HEIs) in Oman, a Gulf Cooperation Council (GCC) nation actively pursuing AI-driven economic diversification under Vision 2040. Combining quantitative surveys ( n = 39 institutional leaders) and qualitative focus groups ( n = 15 students), the research reveals a critical governance gap: only 5.1% of higher education institutions (HEIs) have formal AI policies, while 74.4% lack frameworks. Key challenges include academic integrity violations (e.g., undetectable AI-generated plagiarism), student over-reliance on generative tools (reported by 59% of faculty), and systemic deficiencies in training, infrastructure, and regulatory clarity. The thematic analysis identifies faculty-driven pedagogical innovations and institutional unpreparedness, with 69% of respondents citing \u201cregulatory uncertainty\u201d as the primary barrier. Applying DiMaggio and Powell\u2019s (1983) institutional isomorphism framework, we expose how coercive (top-down policy enforcement gaps), mimetic (ad-hoc replication of regional models), and normative (training deficits) pressures perpetuate fragmentation. Findings underscore the urgency of context-sensitive strategies, proposing three actionable recommendations: (1) national ethical guidelines aligned with UNESCO\u2019s AI Competency Framework, (2) mandatory faculty certification programs targeting 80% compliance by 2026, and (3) equitable resource allocation through Oman\u2019s National AI Observatory. The study positions Oman as a GCC policy laboratory, offering transferable insights for mid-sized economies balancing AI innovation with cultural preservation. Limitations include sample size constraints ( n = 28 HEIs) and the rapid evolution of AI, necessitating longitudinal research. This work contributes to global debates on AI governance by empirically linking institutional theory to policy implementation in Arab higher education contexts."} | ||
| 19 | {"work_id": 3122286897, "title": "MLIR: Scaling Compiler Infrastructure for Domain Specific Computation", "abstract": "This work presents MLIR, a novel approach to building reusable and extensible compiler infrastructure. MLIR addresses software fragmentation, compilation for heterogeneous hardware, significantly reducing the cost of building domain specific compilers, and connecting existing compilers together. MLIR facilitates the design and implementation of code generators, translators and optimizers at different levels of abstraction and across application domains, hardware targets and execution environments. The contribution of this work includes (1) discussion of MLIR as a research artifact, built for extension and evolution, while identifying the challenges and opportunities posed by this novel design, semantics, optimization specification, system, and engineering. (2) evaluation of MLIR as a generalized infrastructure that reduces the cost of building compilers-describing diverse use-cases to show research and educational opportunities for future programming languages, compilers, execution environments, and computer architecture. The paper also presents the rationale for MLIR, its original design principles, structures and semantics."} | 19 | {"work_id": 3122286897, "title": "MLIR: Scaling Compiler Infrastructure for Domain Specific Computation", "abstract": "This work presents MLIR, a novel approach to building reusable and extensible compiler infrastructure. MLIR addresses software fragmentation, compilation for heterogeneous hardware, significantly reducing the cost of building domain specific compilers, and connecting existing compilers together. MLIR facilitates the design and implementation of code generators, translators and optimizers at different levels of abstraction and across application domains, hardware targets and execution environments. The contribution of this work includes (1) discussion of MLIR as a research artifact, built for extension and evolution, while identifying the challenges and opportunities posed by this novel design, semantics, optimization specification, system, and engineering. (2) evaluation of MLIR as a generalized infrastructure that reduces the cost of building compilers-describing diverse use-cases to show research and educational opportunities for future programming languages, compilers, execution environments, and computer architecture. The paper also presents the rationale for MLIR, its original design principles, structures and semantics."} | ||
| 20 | {"work_id": 4407942537, "title": "LLM Compiler: Foundation Language Models for Compiler Optimization", "abstract": "Large Language Models (LLMs) have demonstrated remarkable capabilities across a variety of software engineering and coding tasks. However, their application in the domain of code and compiler optimization remains underexplored. Training LLMs is resource-intensive, requiring substantial GPU hours and extensive data collection, which can be prohibitive. To address this gap, we introduce LLM Compiler, a suite of robust, openly available, pre-trained models specifically designed for compiler tasks. Built on the foundation of Code Llama, LLM Compiler enhances the understanding of compiler intermediate representations (IRs), assembly language, and optimization techniques. The models have been trained on a vast corpus of 546 billion tokens of LLVM-IR and assembly code and have undergone instruction fine-tuning to interpret compiler behavior. To demonstrate the utility of these research tools, we also present fine-tuned versions of the models with enhanced capabilities in optimizing code size and disassembling from x86_64 and ARM assembly back into LLVM-IR. These achieve 77% of the optimising potential of an autotuning search, and 45% disassembly round trip (14% exact match). LLM Compiler is released under a bespoke commercial license to allow wide reuse and is available in two sizes: 7 billion and 13 billion parameters. Our aim is to provide scalable, cost-effective foundational models for further research and development in compiler optimization by both academic researchers and industry practitioners. Since we released LLM Compiler the community has quantized, repackaged, and downloaded the models over 250k times."} | 20 | {"work_id": 4407942537, "title": "LLM Compiler: Foundation Language Models for Compiler Optimization", "abstract": "Large Language Models (LLMs) have demonstrated remarkable capabilities across a variety of software engineering and coding tasks. However, their application in the domain of code and compiler optimization remains underexplored. Training LLMs is resource-intensive, requiring substantial GPU hours and extensive data collection, which can be prohibitive. To address this gap, we introduce LLM Compiler, a suite of robust, openly available, pre-trained models specifically designed for compiler tasks. Built on the foundation of Code Llama, LLM Compiler enhances the understanding of compiler intermediate representations (IRs), assembly language, and optimization techniques. The models have been trained on a vast corpus of 546 billion tokens of LLVM-IR and assembly code and have undergone instruction fine-tuning to interpret compiler behavior. To demonstrate the utility of these research tools, we also present fine-tuned versions of the models with enhanced capabilities in optimizing code size and disassembling from x86_64 and ARM assembly back into LLVM-IR. These achieve 77% of the optimising potential of an autotuning search, and 45% disassembly round trip (14% exact match). LLM Compiler is released under a bespoke commercial license to allow wide reuse and is available in two sizes: 7 billion and 13 billion parameters. Our aim is to provide scalable, cost-effective foundational models for further research and development in compiler optimization by both academic researchers and industry practitioners. Since we released LLM Compiler the community has quantized, repackaged, and downloaded the models over 250k times."} | ||
| 21 | −{"work_id": 2400988715, "title": "Functional Stable Model Semantics and Answer Set Programming Modulo Theories", "abstract": "Recently there has been an increasing interest in incorporating ``intensional'' functions in answer set programming. Intensional functions are those whose values can be described by other functions and predicates, rather than being pre-defined as in the standard answer set programming. We demonstrate that the functional stable model semantics plays an important role in the framework of ``Answer Set Programming Modulo Theories (ASPMT)'' -- a tight integration of answer set programming and satisfiability modulo theories, under which existing integration approaches can be viewed as special cases where the role of functions is limited. We show that ``tight'' ASPMT programs can be translated into SMT instances, which is similar to the known relationship between ASP and SAT."} | 21 | +{"work_id": 2095152777, "title": "Managing the Development of Large Software Systems (1970)", "abstract": "INTRODUCTION l am going to describe my pe,-.~onal views about managing large software developments. I have had various assignments during the past nit,.: years, mostly concerned with the development of software packages for spacecraft mission planning, commanding and post-flight analysis. In these assignments I have experienced different degrees of successwith respect to arriving at an operational state, on-time, and wi th in costs. I have become prejudiced by my experiences and I am going to relate some of these prejudices in this presentation."} | ||
| 22 | −{"work_id": 4391974543, "title": "Software Testing With Large Language Models: Survey, Landscape, and Vision", "abstract": "Pre-trained large language models (LLMs) have recently emerged as a breakthrough technology in natural language processing and artificial intelligence, with the ability to handle large-scale datasets and exhibit remarkable performance across a wide range of tasks. Meanwhile, software testing is a crucial undertaking that serves as a cornerstone for ensuring the quality and reliability of software products. As the scope and complexity of software systems continue to grow, the need for more effective software testing techniques becomes increasingly urgent, making it an area ripe for innovative approaches such as the use of LLMs. This paper provides a comprehensive review of the utilization of LLMs in software testing. It analyzes 102 relevant studies that have used LLMs for software testing, from both the software testing and LLMs perspectives. The paper presents a detailed discussion of the software testing tasks for which LLMs are commonly used, among which test case preparation and program repair are the most representative. It also analyzes the commonly used LLMs, the types of prompt engineering that are employed, as well as the accompanied techniques with these LLMs. It also summarizes the key challenges and potential opportunities in this direction. This work can serve as a roadmap for future research in this area, highlighting potential avenues for exploration, and identifying gaps in our current understanding of the use of LLMs in software testing."} | 22 | +{"work_id": 4289665848, "title": "Reward Interfaces with Best-Effort Implementations", "abstract": "Interface theories, notably interface automata, serve as expressive frameworks for component-based design, specifying component behavior and interaction in concurrent systems. Traditional interface formalisms specify assumptions that a component\u2019s environment must satisfy and the guarantees that each component provides. This qualitative view of component interaction based on imposing strict assumptions and Boolean guarantees may, however, not be expressive enough to capture the system\u2019s allowed or desired behaviors under different environments. In this paper, we introduce reward interfaces to support component-based design while accommodating multi-valued correctness requirements and adaptive best-effort satisfaction of component\u2019s guarantees. Building upon interface automata, our framework enables modeling a rich class of quantitative component specifications. We propose formal notions of implementation, refinement and compatibility for reward interfaces. We study a class of reward interfaces with automata-based representations, for which we provide algorithms for checking compatibility and refinement, and existence of best-effort implementations. Our framework offers a comprehensive approach to reward interface specification and design."} | ||
| 23 | +{"work_id": 4318573502, "title": "Semantically informed methods in structural proof theory", "abstract": "This thesis is part of a line of research aimed at investigating how insights and results from the algebraic and relational semantics of given families of logics can contribute to the design of \u2018good\u2019 proof calculi for these logics. It focuses on the intersection between syntax and semantics in structural proof theory. The results of the present thesis develop the interface between syntax and semantics for proof-theoretic purposes in very specific ways: on the semantic side, these results build on and further develop the link between relational and algebraic semantics of logics given by discrete dualities and their associated unified correspondence results; on the syntactic side, these results further develop the theory of proper multi-type display calculi. The results of this thesis include: a systematic connection between the syntactic shape of analytic inductive axioms and the generation of cut-free derivations of these axioms from their associated analytic structural rules; the introduction of proper display calculi for monotone modal logic and conditional logic and a large family of their axiomatic extensions, thanks to a reformulation of their neighbourhood semantics in a suitable multitype relational environment; extending the semantic analysis for monotone modal logic and conditional logic to graded modal logic and proposing a new definition of graded bisimulation."} | ||||
| 24 | +{"work_id": 2803355841, "title": "Soteria: Automated IoT Safety and Security Analysis", "abstract": "Broadly defined as the Internet of Things (IoT), the growth of commodity devices that integrate physical processes with digital systems have changed the way we live, play and work. Yet existing IoT platforms cannot evaluate whether an IoT app or environment is safe, secure, and operates correctly. In this paper, we present Soteria, a static analysis system for validating whether an IoT app or IoT environment (collection of apps working in concert) adheres to identified safety, security, and functional properties. Soteria operates in three phases; (a) translation of platform-specific IoT source code into an intermediate representation (IR), (b) extracting a state model from the IR, (c) applying model checking to verify desired properties. We evaluate Soteria on 65 SmartThings market apps through 35 properties and find nine (14%) individual apps violate ten (29%) properties. Further, our study of combined app environments uncovered eleven property violations not exhibited in the isolated apps. Lastly, we demonstrate Soteria on MalIoT, a novel open-source test suite containing 17 apps with 20 unique violations."} | ||||
| 25 | +{"work_id": 4389109635, "title": "A Unifying Theory for Graph Transformation", "abstract": "The field of graph transformation studies the rule-based transformation of graphs. An important branch is the algebraic graph transformation tradition, in which approaches are defined and studied using the language of category theory. Most algebraic graph transformation approaches (such as DPO, SPO, SqPO, and AGREE) are opinionated about the local contexts that are allowed around matches for rules, and about how replacement in context should work exactly. The approaches also differ considerably in their underlying formal theories and their general expressiveness (e.g., not all frameworks allow duplication). This dissertation proposes an expressive algebraic graph transformation approach, called PBPO+, which is an adaptation of PBPO by Corradini et al. The central contribution is a proof that PBPO+ subsumes (under mild restrictions) DPO, SqPO, AGREE, and PBPO in the important categorical setting of quasitoposes. This result allows for a more unified study of graph transformation metatheory, methods, and tools. A concrete example of this is found in the second major contribution of this dissertation: a graph transformation termination method for PBPO+, based on decreasing interpretations, and defined for general categories. By applying the proposed encodings into PBPO+, this method can also be applied for DPO, SqPO, AGREE, and PBPO."} | ||||
| 26 | +{"work_id": 3016155638, "title": "VerX: Safety Verification of Smart Contracts", "abstract": "We present VerX, the first automated verifier able to prove functional properties of Ethereum smart contracts. VerX addresses an important problem as all real-world contracts must satisfy custom functional specifications.VerX is based on a careful combination of three techniques, enabling it to automatically verify temporal properties of infinite- state smart contracts: (i) reduction of temporal property verification to reachability checking, (ii) a new symbolic execution engine for the Ethereum Virtual Machine that is precise and efficient for a practical fragment of Ethereum contracts, and (iii) delayed predicate abstraction which uses symbolic execution during transactions and abstraction at transaction boundaries.Our extensive experimental evaluation on 83 temporal properties and 12 real-world projects, including popular crowdsales and libraries, demonstrates that VerX is practically effective."} | ||||
| 23 | {"work_id": 2254118105, "title": "Solving QBF by Clause Selection", "abstract": "Algorithms based on the enumeration of implicit hitting sets find a growing number of applications, which include maximum satisfiability and model based diagnosis, among others. This paper exploits enumeration of implicit hitting sets in the context of Quantified Boolean Formulas (QBF). The paper starts by developing a simple algorithm for QBF with two levels of quantification, which is shown to relate with existing work on enumeration of implicit hitting sets, but also with recent work on QBF based on abstraction refinement. The paper then extends these ideas and develops a novel QBF algorithm, which generalizes the concept of enumeration of implicit hitting sets. Experimental results, obtained on representative problem instances, show that the novel algorithm is competitive with, and often outperforms, the state of the art in QBF solving."} | 27 | {"work_id": 2254118105, "title": "Solving QBF by Clause Selection", "abstract": "Algorithms based on the enumeration of implicit hitting sets find a growing number of applications, which include maximum satisfiability and model based diagnosis, among others. This paper exploits enumeration of implicit hitting sets in the context of Quantified Boolean Formulas (QBF). The paper starts by developing a simple algorithm for QBF with two levels of quantification, which is shown to relate with existing work on enumeration of implicit hitting sets, but also with recent work on QBF based on abstraction refinement. The paper then extends these ideas and develops a novel QBF algorithm, which generalizes the concept of enumeration of implicit hitting sets. Experimental results, obtained on representative problem instances, show that the novel algorithm is competitive with, and often outperforms, the state of the art in QBF solving."} | ||
| 24 | {"work_id": 4297611890, "title": "Subsystems of Second-Order Arithmetic", "abstract": "This new book on mathematical logic by Jeremy Avigad gives a thorough introduction to the fundamental results and methods of the subject from the syntactic point of view, emphasizing logic as the study of formal languages and systems and their proper use. Topics include proof theory, model theory, the theory of computability, and axiomatic foundations, with special emphasis given to aspects of mathematical logic that are fundamental to computer science, including deductive systems, constructive logic, the simply typed lambda calculus, and type-theoretic foundations. Clear and engaging, with plentiful examples and exercises, it is an excellent introduction to the subject for graduate students and advanced undergraduates who are interested in logic in mathematics, computer science, and philosophy, and an invaluable reference for any practicing logician\u2019s bookshelf."} | 28 | {"work_id": 4297611890, "title": "Subsystems of Second-Order Arithmetic", "abstract": "This new book on mathematical logic by Jeremy Avigad gives a thorough introduction to the fundamental results and methods of the subject from the syntactic point of view, emphasizing logic as the study of formal languages and systems and their proper use. Topics include proof theory, model theory, the theory of computability, and axiomatic foundations, with special emphasis given to aspects of mathematical logic that are fundamental to computer science, including deductive systems, constructive logic, the simply typed lambda calculus, and type-theoretic foundations. Clear and engaging, with plentiful examples and exercises, it is an excellent introduction to the subject for graduate students and advanced undergraduates who are interested in logic in mathematics, computer science, and philosophy, and an invaluable reference for any practicing logician\u2019s bookshelf."} | ||
| 25 | {"work_id": 4396242417, "title": "Enhancing Static Analysis for Practical Bug Detection: An LLM-Integrated Approach", "abstract": "While static analysis is instrumental in uncovering software bugs, its precision in analyzing large and intricate codebases remains challenging. The emerging prowess of Large Language Models (LLMs) offers a promising avenue to address these complexities. In this paper, we present LLift, a pioneering framework that synergizes static analysis and LLMs, with a spotlight on identifying use-before-initialization (UBI) bugs within the Linux kernel. Drawing from our insights into variable usage conventions in Linux, we enhance path analysis using post-constraint guidance. This approach, combined with our methodically crafted procedures, empowers LLift to adeptly handle the challenges of bug-specific modeling, extensive codebases, and the unpredictable nature of LLMs. Our real-world evaluations identified four previously undiscovered UBI bugs in the mainstream Linux kernel, which the Linux community has acknowledged. This study reaffirms the potential of marrying static analysis with LLMs, setting a compelling direction for future research in this area."} | 29 | {"work_id": 4396242417, "title": "Enhancing Static Analysis for Practical Bug Detection: An LLM-Integrated Approach", "abstract": "While static analysis is instrumental in uncovering software bugs, its precision in analyzing large and intricate codebases remains challenging. The emerging prowess of Large Language Models (LLMs) offers a promising avenue to address these complexities. In this paper, we present LLift, a pioneering framework that synergizes static analysis and LLMs, with a spotlight on identifying use-before-initialization (UBI) bugs within the Linux kernel. Drawing from our insights into variable usage conventions in Linux, we enhance path analysis using post-constraint guidance. This approach, combined with our methodically crafted procedures, empowers LLift to adeptly handle the challenges of bug-specific modeling, extensive codebases, and the unpredictable nature of LLMs. Our real-world evaluations identified four previously undiscovered UBI bugs in the mainstream Linux kernel, which the Linux community has acknowledged. This study reaffirms the potential of marrying static analysis with LLMs, setting a compelling direction for future research in this area."} | ||
@@ -27,66 +31,65 @@ | |||||
| 27 | {"work_id": 3177813494, "title": "A Direction-Aware Study of LLM-Based Code Translation Across Eight Programming Languages", "abstract": "Background. Large Language Models (LLMs) are increasingly used in software engineering tasks such as code generation, bug detection, and program repair. However, their use introduces inference-time costs that are rarely considered together with functional performance, especially in debugging and repair workflows where models may be invoked repeatedly. Aim. This study evaluates the correctness-energy trade-offs of LLMs across model scales in Python bug-fixing tasks. We examine how model size relates to code correctness, inference time, and GPU energy consumption. Method. We conduct a controlled empirical evaluation of six open-source code-oriented LLMs, ranging from 1.5B to 15B parameters, on 40 real-world Python bugs from the BugsInPy benchmark. Each model is executed multiple times per task under a consistent hardware and prompting setup. Repair performance is measured using Pass@k and test-suite outcomes, while computational cost is measured using inference time and GPU energy consumption. We also analyze generated outputs to identify recurring failure patterns. Results. Increasing model size substantially raised computational cost without consistently improving correctness. The smallest model, Qwen 1.5B, achieved the best overall performance, with a Pass@1 score of 43% and an average runtime of 38.7 seconds. In contrast, StarCoder 15B achieved a Pass@1 score of 23%, required 96.7 seconds, and consumed approximately 7 times more energy per inference while solving fewer tasks. Higher success rates were also observed in web-related projects, suggesting that structurally localized bugs are more effectively handled by current models. Conclusion. On the evaluated localized Python bug-fixing tasks, smaller LLMs offered a more favorable trade-off between correctness, inference time, and energy consumption. These results suggest that scaling model size does not automatically lead to more efficient LLM-based repair, and that inference cost should be considered alongside functional correctness when comparing models."} | 31 | {"work_id": 3177813494, "title": "A Direction-Aware Study of LLM-Based Code Translation Across Eight Programming Languages", "abstract": "Background. Large Language Models (LLMs) are increasingly used in software engineering tasks such as code generation, bug detection, and program repair. However, their use introduces inference-time costs that are rarely considered together with functional performance, especially in debugging and repair workflows where models may be invoked repeatedly. Aim. This study evaluates the correctness-energy trade-offs of LLMs across model scales in Python bug-fixing tasks. We examine how model size relates to code correctness, inference time, and GPU energy consumption. Method. We conduct a controlled empirical evaluation of six open-source code-oriented LLMs, ranging from 1.5B to 15B parameters, on 40 real-world Python bugs from the BugsInPy benchmark. Each model is executed multiple times per task under a consistent hardware and prompting setup. Repair performance is measured using Pass@k and test-suite outcomes, while computational cost is measured using inference time and GPU energy consumption. We also analyze generated outputs to identify recurring failure patterns. Results. Increasing model size substantially raised computational cost without consistently improving correctness. The smallest model, Qwen 1.5B, achieved the best overall performance, with a Pass@1 score of 43% and an average runtime of 38.7 seconds. In contrast, StarCoder 15B achieved a Pass@1 score of 23%, required 96.7 seconds, and consumed approximately 7 times more energy per inference while solving fewer tasks. Higher success rates were also observed in web-related projects, suggesting that structurally localized bugs are more effectively handled by current models. Conclusion. On the evaluated localized Python bug-fixing tasks, smaller LLMs offered a more favorable trade-off between correctness, inference time, and energy consumption. These results suggest that scaling model size does not automatically lead to more efficient LLM-based repair, and that inference cost should be considered alongside functional correctness when comparing models."} | ||
| 28 | {"work_id": 159920301, "title": "On intuitionistic linear logic", "abstract": "In this thesis we carry out a detailed study of the (propositional) intuitionistic fragment of Girard\u2019s linear logic (ILL). Firstly we give sequent calculus, natural deduction and axiomatic formulations of ILL. In particular our natural deduction is different from others and has important properties, such as closure under substitution, which others lack. We also study the process of reduction in all three local formulations, including a detailed proof of cut elimination. Finally, we consider translations between Instuitionistic Logic (IL) and ILL. We then consider the linear term calculus, which arises from applying the Curry-Howard correspondence to the natural deduction formulation. We show how the various proof theoretic formulations suggest reductions at the level of terms. The properties of strong normalization and confluence are proved for these reduction rules. We also consider mappings between the extended \u03bb-calculus and the linear term calculus. Next we consider a categorical model for ILL. We show how by considering the linear term calculus as an equational logic, we can derive a model: a linear category. We consider two alternative models: firstly, one due to Seely and then one due to Lafont. Surprisingly, we find that Seely\u2019s model is not sound, in that equal terms are not modelled with equal morphisms. We show how after adapting Seely\u2019s model (by viewing it in a more abstract setting) it becomes a particular instance of a linear category. We show how Lafont\u2019s model can also be seen as another particular instance of a linear category. Finally we consider various categories of coalgebras, whose construction can be seen as a categorical equivalent of the translation of IL into ILL."} | 32 | {"work_id": 159920301, "title": "On intuitionistic linear logic", "abstract": "In this thesis we carry out a detailed study of the (propositional) intuitionistic fragment of Girard\u2019s linear logic (ILL). Firstly we give sequent calculus, natural deduction and axiomatic formulations of ILL. In particular our natural deduction is different from others and has important properties, such as closure under substitution, which others lack. We also study the process of reduction in all three local formulations, including a detailed proof of cut elimination. Finally, we consider translations between Instuitionistic Logic (IL) and ILL. We then consider the linear term calculus, which arises from applying the Curry-Howard correspondence to the natural deduction formulation. We show how the various proof theoretic formulations suggest reductions at the level of terms. The properties of strong normalization and confluence are proved for these reduction rules. We also consider mappings between the extended \u03bb-calculus and the linear term calculus. Next we consider a categorical model for ILL. We show how by considering the linear term calculus as an equational logic, we can derive a model: a linear category. We consider two alternative models: firstly, one due to Seely and then one due to Lafont. Surprisingly, we find that Seely\u2019s model is not sound, in that equal terms are not modelled with equal morphisms. We show how after adapting Seely\u2019s model (by viewing it in a more abstract setting) it becomes a particular instance of a linear category. We show how Lafont\u2019s model can also be seen as another particular instance of a linear category. Finally we consider various categories of coalgebras, whose construction can be seen as a categorical equivalent of the translation of IL into ILL."} | ||
| 29 | {"work_id": 4402442491, "title": "From Smallest Software Particle to System Specification", "abstract": "Software development can be seen as a process in which the knowledge and decisions of a wide variety of people are integrated to produce a machine-readable specification. The majority of today's specification and programming languages are based on computer-oriented and mathematical concepts. Those languages are difficult for people that are not a software professional. Domain models and domain-specific languages are a way to capture knowledge from people who have no software expertise, while also resulting in specifications that can be used as software. This thesis reports on the creation of a domain-oriented method to systematically transform knowledge and decisions of all people involved in a development process, into unambiguous specifications. A systematic literature review revealed that existing domain-oriented techniques have a low engineering maturity, are barely connected to human communication and thinking, and lack methodical support for applying domain models and domain-specific languages to create system specifications. This thesis describes how these three problems are addressed by a method called MuDForM. 25 years of modeling and specification experience was captured in a method definition and gradually improved, driven by the outcome of case studies and shortcomings of existing methods. A reflection on the method from the perspective of cognitive science and linguistics concludes this thesis, demonstrating the feasibility of cognition-based specifications. The result is a method with a uniform metamodel with precise modeling concepts, a process that guides the path from knowledge elicitation to engineered model, and a set of principles that enable implementation and improvement of the method. The method can be seen as a step in transforming a computer-centered and mathematics-oriented discipline, into one that facilitates knowledge and decision specification for all people involved in software development."} | 33 | {"work_id": 4402442491, "title": "From Smallest Software Particle to System Specification", "abstract": "Software development can be seen as a process in which the knowledge and decisions of a wide variety of people are integrated to produce a machine-readable specification. The majority of today's specification and programming languages are based on computer-oriented and mathematical concepts. Those languages are difficult for people that are not a software professional. Domain models and domain-specific languages are a way to capture knowledge from people who have no software expertise, while also resulting in specifications that can be used as software. This thesis reports on the creation of a domain-oriented method to systematically transform knowledge and decisions of all people involved in a development process, into unambiguous specifications. A systematic literature review revealed that existing domain-oriented techniques have a low engineering maturity, are barely connected to human communication and thinking, and lack methodical support for applying domain models and domain-specific languages to create system specifications. This thesis describes how these three problems are addressed by a method called MuDForM. 25 years of modeling and specification experience was captured in a method definition and gradually improved, driven by the outcome of case studies and shortcomings of existing methods. A reflection on the method from the perspective of cognitive science and linguistics concludes this thesis, demonstrating the feasibility of cognition-based specifications. The result is a method with a uniform metamodel with precise modeling concepts, a process that guides the path from knowledge elicitation to engineered model, and a set of principles that enable implementation and improvement of the method. The method can be seen as a step in transforming a computer-centered and mathematics-oriented discipline, into one that facilitates knowledge and decision specification for all people involved in software development."} | ||
| 30 | −{"work_id": 4225922019, "title": "cvc5: A Versatile and Industrial-Strength SMT Solver", "abstract": "Abstract cvc5 is the latest SMT solver in the cooperating validity checker series and builds on the successful code base of CVC4. This paper serves as a comprehensive system description of cvc5 \u2019s architectural design and highlights the major features and components introduced since CVC4 1.8. We evaluate cvc5 \u2019s performance on all benchmarks in SMT-LIB and provide a comparison against CVC4 and Z3."} | ||||
| 31 | −{"work_id": 4293212596, "title": "The Astropy Project : Sustaining and Growing a Community-oriented Open-source Project and the Latest Major Release (v5.0) of the Core Package*", "abstract": "Full list of authors: Price-Whelan, Adrian M.; Lim, Pey Lian; Earl, Nicholas; Starkman, Nathaniel; Bradley, Larry; Shupe, David L.; Patil, Aarya A.; Corrales, Lia; Brasseur, C. E.; Noethe, Maximilian; Donath, Axel; Tollerud, Erik; Morris, Brett M.; Ginsburg, Adam; Vaher, Eero; Weaver, Benjamin A.; Tocknell, James; Jamieson, William; van Kerkwijk, Marten H.; Robitaille, Thomas P.; Merry, Bruce; Bachetti, Matteo; Gunther, H. Moritz; Aldcroft, Thomas L.; Alvarado-Montes, Jaime A.; Archibald, Anne M.; Bodi, Attila; Bapat, Shreyas; Barentsen, Geert; Bazan, Juanjo; Biswas, Manish; Boquien, Mederic; Burke, D. J.; Cara, Daria; Cara, Mihai; Conroy, Kyle E.; Conseil, Simon; Craig, Matthew W.; Cross, Robert M.; Cruz, Kelle L.; D'Eugenio, Francesco; Dencheva, Nadia; Devillepoix, Hadrien A. R.; Dietrich, Jorg P.; Eigenbrot, Arthur Davis; Erben, Thomas; Ferreira, Leonardo; Foreman-Mackey, Daniel; Fox, Ryan; Freij, Nabil; Garg, Suyog; Geda, Robel; Glattly, Lauren; Gondhalekar, Yash; Gordon, Karl D.; Grant, David; Greenfield, Perry; Groener, Austen M.; Guest, Steve; Gurovich, Sebastian; Handberg, Rasmus; Hart, Akeem; Hatfield-Dodds, Zac; Homeier, Derek; Hosseinzadeh, Griffin; Jenness, Tim; Jones, Craig K.; Joseph, Prajwel; Kalmbach, J. Bryce; Karamehmetoglu, Emir; Kaluszynski, Mikolaj; Kelley, Michael S. P.; Kern, Nicholas; Kerzendorf, Wolfgang E.; Koch, Eric W.; Kulumani, Shankar; Lee, Antony; Ly, Chun; Ma, Zhiyuan; MacBride, Conor; Maljaars, Jakob M.; Muna, Demitri; Murphy, N. A.; Norman, Henrik; O'Steen, Richard; Oman, Kyle A.; Pacifici, Camilla; Pascual, Sergio; Pascual-Granado, J.; Patil, Rohit R.; Perren, Gabriel, I; Pickering, Timothy E.; Rastogi, Tanuj; Roulston, Benjamin R.; Ryan, Daniel F.; Rykoff, Eli S.; Sabater, Jose; Sakurikar, Parikshit; Salgado, Jesus; Sanghi, Aniket; Saunders, Nicholas; Savchenko, Volodymyr; Schwardt, Ludwig; Seifert-Eckert, Michael; Shih, Albert Y.; Jain, Anany Shrey; Shukla, Gyanendra; Sick, Jonathan; Simpson, Chris; Singanamalla, Sudheesh; Singer, Leo P.; Singhal, Jaladh; Sinha, Manodeep; Sipocz, Brigitta M.; Spitler, Lee R.; Stansby, David; Streicher, Ole; Sumak, Jani; Swinbank, John D.; Taranu, Dan S.; Tewary, Nikita; Tremblay, Grant R.; De Val-Borro, Miguel; Vasovic, Zlatan; Van Kooten, Samuel J.; Verma, Shresth; Cardoso, Jose Vinicius de Miranda; Williams, Peter K. G.; Wilson, Tom J.; Winkel, Benjamin; Wood-Vasey, W. M.; Xue, Rui; Yoachim, Peter; Zhang, Chen; Zonca, Andrea; Astropy Project Contributors; TARDIS Collaboration; Astropy Coordination Comm.--This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted reuse, distribution, and reproduction in any medium, provided the original work is properly cited."} | ||||
| 32 | −{"work_id": 2114444139, "title": "Innovation and Change in the Information Systems Curriculum of an Australian University:a Socio-Technical Perspective", "abstract": "Information Systems is a relatively new curriculum area and one that is still growing in size and importance. It involves applied studies that are concerned with the ways people build and use computer -based systems in their organisations to produce useful information. Information Systems is, of necessity, a socio-technical discipline that has to deal with issues involving both people and machines; with the multitude of human and non -human entities that comprise an information system.This thesis reports an investigation of how Information Systems curriculum is made and how the choices of individual lecturers or groups of lecturers to adopt or ignore a new concept or technology are formed. It addresses this issue by describing a study into how the programming language Visual Basic entered the Information Systems curriculum of an Australian university, and how it has retained its place there despite challenges from other programming languages. It is a study of curriculum innovation that involves an important but small change in the curriculum of a single department in a particular university.Little of the literature on innovation deals with university curriculum and most reported work is focussed on research, development and diffusion studies of the adoption, or otherwise, of centrally developed curriculum innovations in primary and secondary schools. The innovation described here is of a different order being developed initially by a single university lecturer in one of the subjects for which he had responsibility. It is important primarily because it examines something that does not appear to have been reported on before: the negotiations and alliances that allow new material, in this case the programming language Visual Basic, to enter individual subjects of a university curriculum, and to obtain a durable place there.The research investigates a single instance of innovation, and traces the associations between various human and non -human entities including Visual Basic, the university, the student laboratories, the Course Advisory Committee and the academic staff that made this happen. It follows the formation of alliances and complex networks of association, and how their interplay resulted in the curriculum change that allowed Visual Basic to enter the Information Systems curriculum, and to fend off challenges from other programming languages in order to retain its place there.I argue that in this curriculum innovation no pre -planned path was followed, and that representations of events like this as straightforward or well planned hide the complexity of what took place. The study reveals the complex set of negotiations and compromises made by both human and non -human actors in allowing Visual Basic to enter the curriculum.The study draws on the sociology of translations, more commonly known as actor-network theory (ANT) as a framework for its analysis. I show that innovation translation can be used to advantage to trace the progress of technological innovations such as this. My analysis maps the progress of Visual Basic from novelty to 'obvious choice' in this university's Information Systems curriculum."} | ||||
| 33 | −{"work_id": 2171139698, "title": "Test data generation: two evolutionary approaches to mutation testing", "abstract": "To my friends and supervisors,"} | ||||
| 34 | −{"work_id": 7131867455, "title": "The Effects of Generative AI on High-Skilled Work: Evidence from Three Field Experiments with Software Developers", "abstract": "This study evaluates the effect of generative artificial intelligence (AI) on software developer productivity via randomized controlled trials at Microsoft, Accenture, and an anonymous Fortune 100 company. These field experiments, run by the companies as part of their ordinary course of business, provided a random subset of developers with access to an AI-based coding assistant suggesting intelligent code completions. Although each experiment is noisy and results vary across experiments, when data are combined across three experiments and 4,867 developers, our analysis reveals a 26.08% increase (standard error: 10.3%) in completed tasks among developers using the AI tool. Notably, less experienced developers had higher adoption rates and greater productivity gains. This paper was accepted by Jean-Pierre Dube, marketing. Funding: M. Demirer and T. Salz thank the MIT GenAI Initiative for funding. Supplemental Material: The online appendices and data files are available at https://doi.org/10.1287/mnsc.2025.00535 ."} | ||||
| 35 | −{"work_id": 3046781014, "title": "ExaStencils: Advanced Multigrid Solver Generation", "abstract": "Present-day stencil codes are implemented in general-purpose programming languages, such as Fortran, C, or Java, Python or derivates thereof, and harnesses for parallelism, such as OpenMP, OpenCL or MPI. Project ExaStencils pursued a domain-specific approach with a language, called ExaSlang, that is stratified into four layers of abstraction, the most abstract being the formulation in continuous mathematics and the most concrete a full, automatically generated implementation. At every layer, the corresponding language expresses not only computational directives but also domain knowledge of the problem and platform to be leveraged for optimization. We describe the approach, the software technology behind it and several case studies that demonstrate its feasibility and versatility: high-performance stencil codes can be engineered, ported and optimized more easily and effectively."} | ||||
| 36 | −{"work_id": 1932627192, "title": "Model checking quantum protocols", "abstract": "This thesis describes model checking techniques for protocols arising in quantum information theory and quantum cryptography. We discuss the theory and implementation of a practical model checker, QMC, for quantum protocols. In our framework, we assume that the quantum operations performed in a protocol are restricted to those within the stabilizer formalism; while this particular set of operations is not universal for quantum computation, it allows us to develop models of several useful protocols as well as of systems involving both classical and quantum information processing. We detail the syntax, semantics and type system of QMC\u2019s modelling language, the logic QCTL which is used for verification, and the verification algorithms that have been implemented in the tool. We demonstrate our techniques with applications to a number of case studies."} | ||||
| 37 | −{"work_id": 7124592699, "title": "MSTDP: a multi-scale temporal deep learning framework for just-in-time software defect prediction with cross-attention fusion", "abstract": "Just-In-Time Defect Prediction (JITDP), as an important means to improve software quality and reduce maintenance costs, has received widespread attention in recent years. However, existing methods generally neglect multi-scale temporal features during the development process, lack dynamic modeling of developer behavior and project lifecycle, and have limited robustness when facing concept drift. To address these limitations, this paper proposes a novel Multi-Scale Temporal Defect Prediction framework (MSTDP) that integrates commit behavior patterns at temporal granularities of hours, days, and weeks, combining code semantic information, developer behavioral features, and lifecycle-aware mechanisms to comprehensively characterize the dynamic evolution patterns of defect introduction. MSTDP achieves deep feature fusion through cross-attention mechanisms and constructs a concept drift analysis module to enhance the model\u2019s adaptability across different evolutionary stages. Empirical results on 9 large-scale open-source projects demonstrate that MSTDP achieves optimal performance across all evaluation metrics: average accuracy of 76.89% (0.56% improvement), precision of 61.02% (0.53% improvement), recall of 67.82% (0.64% improvement), F1-score of 60.93% (0.46% improvement), and AUC of 81.88% (0.52% improvement), significantly outperforming 7 mainstream baseline methods including JITBoost, FENSE, and JIT-CF. Wilcoxon signed-rank tests confirm the statistical significance of these improvements ( \\(\\varvec{p < 0.05}\\) ). The research results validate the effectiveness of this method for efficient and accurate defect prediction in dynamic software engineering environments, demonstrating stronger generalization capability and robustness against concept drift."} | ||||
| 38 | −{"work_id": 4396905794, "title": "Predicting typeScript type annotations and definitions with machine learning", "abstract": "Type information is useful for developing large-scale software systems. Types help prevent bugs, but may be inflexible and hamper quick iteration on early prototypes. TypeScript, a syntactic superset of JavaScript, brings the best of both worlds, allowing programmers to freely mix statically and dynamically typed code, and choose the level of type safety they wish to opt into. However, type migration, the process of migrating an untyped program to a typed version, has remained a labour-intensive manual effort in practice. As a first step towards automated effective type migration, there has been interest in applying machine learning to the narrower problem of type prediction. In this dissertation, I propose to use machine learning to partially migrate JavaScript programs to TypeScript, by predicting type annotations and generating type definitions. To support this thesis, I make three contributions. First, I propose evaluating type prediction by type checking the generated annotations instead of computing accuracy. Second, I fine-tune a large language model with fill-in-the-middle capability to fill in the type and predict type annotations. Finally, I use a similar approach to fine-tune a large language model to generate missing type definitions.--Author's abstract"} | ||||
| 39 | −{"work_id": 3146286581, "title": "Probabilistic Grammatical Evolution", "abstract": "Grammatical Evolution (GE) is one of the most popular Genetic Programming (GP) variants, and it has been used with success in several problem domains. Since the original proposal, many enhancements have been proposed to GE in order to address some of its main issues and improve its performance. In this paper we propose Probabilistic Grammatical Evolution (PGE), which introduces a new genotypic representation and new mapping mechanism for GE. Specifically, we resort to a Probabilistic Context-Free Grammar (PCFG) where its probabilities are adapted during the evolutionary process, taking into account the productions chosen to construct the fittest individual. The genotype is a list of real values, where each value represents the likelihood of selecting a derivation rule. We evaluate the performance of PGE in two regression problems and compare it with GE and Structured Grammatical Evolution (SGE). The results show that PGE has a better performance than GE, with statistically significant differences, and achieved similar performance when comparing with SGE."} | ||||
| 40 | −{"work_id": 2949967139, "title": "Tiramisu: A Polyhedral Compiler for Expressing Fast and Portable Code", "abstract": "This paper introduces Tiramisu, a polyhedral framework designed to generate high performance code for multiple platforms including multicores, GPUs, and distributed machines. Tiramisu introduces a scheduling language with novel commands to explicitly manage the complexities that arise when targeting these systems. The framework is designed for the areas of image processing, stencils, linear algebra and deep learning. Tiramisu has two main features: it relies on a flexible representation based on the polyhedral model and it has a rich scheduling language allowing fine-grained control of optimizations. Tiramisu uses a four-level intermediate representation that allows full separation between the algorithms, loop transformations, data layouts, and communication. This separation simplifies targeting multiple hardware architectures with the same algorithm. We evaluate Tiramisu by writing a set of image processing, deep learning, and linear algebra benchmarks and compare them with state-of-the-art compilers and hand-tuned libraries. We show that Tiramisu matches or outperforms existing compilers and libraries on different hardware architectures, including multicore CPUs, GPUs, and distributed machines."} | ||||
| 41 | −{"work_id": 2095152777, "title": "Managing the Development of Large Software Systems (1970)", "abstract": "INTRODUCTION l am going to describe my pe,-.~onal views about managing large software developments. I have had various assignments during the past nit,.: years, mostly concerned with the development of software packages for spacecraft mission planning, commanding and post-flight analysis. In these assignments I have experienced different degrees of successwith respect to arriving at an operational state, on-time, and wi th in costs. I have become prejudiced by my experiences and I am going to relate some of these prejudices in this presentation."} | ||||
| 42 | −{"work_id": 4289665848, "title": "Reward Interfaces with Best-Effort Implementations", "abstract": "Interface theories, notably interface automata, serve as expressive frameworks for component-based design, specifying component behavior and interaction in concurrent systems. Traditional interface formalisms specify assumptions that a component\u2019s environment must satisfy and the guarantees that each component provides. This qualitative view of component interaction based on imposing strict assumptions and Boolean guarantees may, however, not be expressive enough to capture the system\u2019s allowed or desired behaviors under different environments. In this paper, we introduce reward interfaces to support component-based design while accommodating multi-valued correctness requirements and adaptive best-effort satisfaction of component\u2019s guarantees. Building upon interface automata, our framework enables modeling a rich class of quantitative component specifications. We propose formal notions of implementation, refinement and compatibility for reward interfaces. We study a class of reward interfaces with automata-based representations, for which we provide algorithms for checking compatibility and refinement, and existence of best-effort implementations. Our framework offers a comprehensive approach to reward interface specification and design."} | ||||
| 43 | −{"work_id": 4318573502, "title": "Semantically informed methods in structural proof theory", "abstract": "This thesis is part of a line of research aimed at investigating how insights and results from the algebraic and relational semantics of given families of logics can contribute to the design of \u2018good\u2019 proof calculi for these logics. It focuses on the intersection between syntax and semantics in structural proof theory. The results of the present thesis develop the interface between syntax and semantics for proof-theoretic purposes in very specific ways: on the semantic side, these results build on and further develop the link between relational and algebraic semantics of logics given by discrete dualities and their associated unified correspondence results; on the syntactic side, these results further develop the theory of proper multi-type display calculi. The results of this thesis include: a systematic connection between the syntactic shape of analytic inductive axioms and the generation of cut-free derivations of these axioms from their associated analytic structural rules; the introduction of proper display calculi for monotone modal logic and conditional logic and a large family of their axiomatic extensions, thanks to a reformulation of their neighbourhood semantics in a suitable multitype relational environment; extending the semantic analysis for monotone modal logic and conditional logic to graded modal logic and proposing a new definition of graded bisimulation."} | ||||
| 44 | −{"work_id": 4389109635, "title": "A Unifying Theory for Graph Transformation", "abstract": "The field of graph transformation studies the rule-based transformation of graphs. An important branch is the algebraic graph transformation tradition, in which approaches are defined and studied using the language of category theory. Most algebraic graph transformation approaches (such as DPO, SPO, SqPO, and AGREE) are opinionated about the local contexts that are allowed around matches for rules, and about how replacement in context should work exactly. The approaches also differ considerably in their underlying formal theories and their general expressiveness (e.g., not all frameworks allow duplication). This dissertation proposes an expressive algebraic graph transformation approach, called PBPO+, which is an adaptation of PBPO by Corradini et al. The central contribution is a proof that PBPO+ subsumes (under mild restrictions) DPO, SqPO, AGREE, and PBPO in the important categorical setting of quasitoposes. This result allows for a more unified study of graph transformation metatheory, methods, and tools. A concrete example of this is found in the second major contribution of this dissertation: a graph transformation termination method for PBPO+, based on decreasing interpretations, and defined for general categories. By applying the proposed encodings into PBPO+, this method can also be applied for DPO, SqPO, AGREE, and PBPO."} | ||||
| 45 | −{"work_id": 3016155638, "title": "VerX: Safety Verification of Smart Contracts", "abstract": "We present VerX, the first automated verifier able to prove functional properties of Ethereum smart contracts. VerX addresses an important problem as all real-world contracts must satisfy custom functional specifications.VerX is based on a careful combination of three techniques, enabling it to automatically verify temporal properties of infinite- state smart contracts: (i) reduction of temporal property verification to reachability checking, (ii) a new symbolic execution engine for the Ethereum Virtual Machine that is precise and efficient for a practical fragment of Ethereum contracts, and (iii) delayed predicate abstraction which uses symbolic execution during transactions and abstraction at transaction boundaries.Our extensive experimental evaluation on 83 temporal properties and 12 real-world projects, including popular crowdsales and libraries, demonstrates that VerX is practically effective."} | ||||
| 46 | −{"work_id": 4403223258, "title": "WhiteFox: White-Box Compiler Fuzzing Empowered by Large Language Models", "abstract": "Compiler correctness is crucial, as miscompilation can falsify program behaviors, leading to serious consequences over the software supply chain. In the literature, fuzzing has been extensively studied to uncover compiler defects. However, compiler fuzzing remains challenging: Existing arts focus on black- and grey-box fuzzing, which generates test programs without sufficient understanding of internal compiler behaviors. As such, they often fail to construct test programs to exercise intricate optimizations. Meanwhile, traditional white-box techniques, such as symbolic execution, are computationally inapplicable to the giant codebase of compiler systems. Recent advances demonstrate that Large Language Models (LLMs) excel in code generation/understanding tasks and even have achieved state-of-the-art performance in black-box fuzzing. Nonetheless, guiding LLMs with compiler source-code information remains a missing piece of research in compiler testing. To this end, we propose W hite F ox , the first white-box compiler fuzzer using LLMs with source-code information to test compiler optimization, with a spotlight on detecting deep logic bugs in the emerging deep learning (DL) compilers. W hite F ox adopts a multi-agent framework: (i) an LLM-based analysis agent examines the low-level optimization source code and produces requirements on the high-level test programs that can trigger the optimization; (ii) an LLM-based generation agent produces test programs based on the summarized requirements. Additionally, optimization-triggering tests are also used as feedback to further enhance the test generation prompt on the fly. Our evaluation on the three most popular DL compilers ( i.e ., PyTorch Inductor, TensorFlow-XLA, and TensorFlow Lite) shows that W hite F ox can generate high-quality test programs to exercise deep optimizations requiring intricate conditions, practicing up to 8 times more optimizations than state-of-the-art fuzzers. To date, W hite F ox has found in total 101 bugs for the compilers under test, with 92 confirmed as previously unknown and 70 already fixed. Notably, W hite F ox has been recently acknowledged by the PyTorch team, and is in the process of being incorporated into its development workflow. Finally, beyond DL compilers, W hite F ox can also be adapted for compilers in different domains, such as LLVM, where WHiteFox has already found multiple bugs."} | ||||
| 47 | −{"work_id": 2921681895, "title": "Parameter synthesis in Markov models", "abstract": "Markov models comprise states with probabilistic transitions. The analysis of these models is ubiquitous and studied in, among others, reliability engineering, artificial intelligence, systems biology, and formal methods. Naturally, their analysis crucially depends on the transition probabilities. Often, these probabilities are approximations based on data or reflect configurable parts of a modelled system. To represent the uncertainty about the probabilities, we study parametric Markov models, in which the probabilities are symbolic expressions rather than concrete values. More precisely, we consider parametric Markov decision processes (pMDPs) and parametric Markov chains (pMCs) as special case. Substitution of the parameters yields classical, parameter-free Markov decision processes (MDPs) and Markov chains (MCs).A pMDP thus induces uncountably many MDPs. Each MDP may satisfy reachability and reward properties, such as \"the maximal probability that the system reaches an `offline' state is less than 0.01%\", or \"the maximal expected energy consumption is less than 20 kWh. \"Lifting these properties to pMDPs yields fundamental problems asking: - \"Is there an induced MDP satisfying the property?\" (feasibility), its dual - \"Do all induced MDPs satisfy the property?\" (validity), and advanced problems such as \"What is a concise representation for all induced MCs satisfying the property?\" We study these problems on a conceptual level, and design and implement both improved and novel algorithms. On the conceptual side, a thorough discussion of the feasibility problem yields new results, such as: (1) that answering various variants of the feasibility problem is \u2014 in terms of complexity \u2014 as hard as finding roots of a multivariate polynomial, and (2) that these problems are tightly connected to the analysis of memoryless strategies in partially observable MDPs, a famous model in artificial intelligence. Additionally, we introduce family MCs (fMCs), a subclass of pMCs with finitely many induced MCs. Among others, fMCs define fundamental problems underlying the quantitative analysis of software product lines and sketching of probabilistic programs. On the algorithmic side, (1) we present and analyse improved but previously known approaches, and combine them to meet practical needs. Their analysis inspired (2) three new and orthogonal approaches, utilising advances in convex optimisation, as well as adapting prominent ideas such as inductive synthesis and abstraction-refinement to the particular setting. All methods efficiently exploit advances in the off-the-shelf analysis of MDPs. On the empirical side, the new methods improve the state-of-the-art considerably, handling hundreds of parameters and millions of states. All the approaches we present have been implemented in open-source tools."} | ||||
| 48 | −{"work_id": 1498342204, "title": "An Introduction to Input/Output Automata", "abstract": "We describe the input/output automaton model, a model for concurrent and distributed discrete event systems. We define the model, illustrate the model with several examples concerning vending machines and a leader election algorithm, and survey the ways in which the model has been used. 1 , 2"} | ||||
| 49 | −{"work_id": 2962772482, "title": "A survey of methods for explaining black box models", "abstract": "In recent years, many accurate decision support systems have been constructed as black boxes, that is as systems that hide their internal logic to the user. This lack of explanation constitutes both a practical and an ethical issue. The literature reports many approaches aimed at overcoming this crucial weakness, sometimes at the cost of sacrificing accuracy for interpretability. The applications in which black box decision systems can be used are various, and each approach is typically developed to provide a solution for a specific problem and, as a consequence, it explicitly or implicitly delineates its own definition of interpretability and explanation. The aim of this article is to provide a classification of the main problems addressed in the literature with respect to the notion of explanation and the type of black box system. Given a problem definition, a black box type, and a desired explanation, this survey should help the researcher to find the proposals more useful for his own work. The proposed classification of approaches to open black box models should also be useful for putting the many research open questions in perspective."} | ||||
| 50 | −{"work_id": 2884622219, "title": "The value of universally available raw NMR data for transparency, reproducibility, and integrity in natural product research", "abstract": "Covering: up to 2018With contributions from the global natural product (NP) research community, and continuing the Raw Data Initiative, this review collects a comprehensive demonstration of the immense scientific value of disseminating raw nuclear magnetic resonance (NMR) data, independently of, and in parallel with, classical publishing outlets. A comprehensive compilation of historic to present-day cases as well as contemporary and future applications show that addressing the urgent need for a repository of publicly accessible raw NMR data has the potential to transform natural products (NPs) and associated fields of chemical and biomedical research. The call for advancing open sharing mechanisms for raw data is intended to enhance the transparency of experimental protocols, augment the reproducibility of reported outcomes, including biological studies, become a regular component of responsible research, and thereby enrich the integrity of NP research and related fields."} | ||||
| 51 | −{"work_id": 3023977240, "title": "From constraint programming to heterogeneous parallelism", "abstract": "The scaling limitations of multi-core processor development have led to a diversification of the processor cores used within individual computers. Heterogeneous computing has become widespread, involving the cooperation of several structurally different processor cores. Central processor (CPU) cores are most frequently complemented with graphics processors (GPUs), which despite their name are suitable for many highly parallel computations besides computer graphics. Furthermore, deep learning accelerators are rapidly gaining relevance. Many applications could profit from heterogeneous computing but are held back by the surrounding software ecosystems. Heterogeneous systems are a challenge for compilers in particular, which usually target only the increasingly marginalised homogeneous CPU cores. Therefore, heterogeneous acceleration is primarily accessible via libraries and domain-specific languages (DSLs), requiring application rewrites and resulting in vendor lock-in. This thesis presents a compiler method for automatically targeting heterogeneous hardware from existing sequential C/C++ source code. A new constraint programming method enables the declarative specification and automatic detection of computational idioms within compiler intermediate representation code. Examples of computational idioms are stencils, reductions, and linear algebra. Computational idioms denote algorithmic structures that commonly occur in performance-critical loops. Consequently, well-designed accelerator DSLs and libraries support computational idioms with their programming models and function interfaces. The detection of computational idioms in their middle end enables compilers to incorporate DSL and library backends for code generation. These backends leverage domain knowledge for the efficient utilisation of heterogeneous hardware. The constraint programming methodology is first derived on an abstract model and then implemented as an extension to LLVM. Two constraint programming languages are designed to target this implementation: the Compiler Analysis Description Language (CAnDL), and the extended Idiom Detection Language (IDL). These languages are evaluated on a range of different compiler problems, culminating in a complete heterogeneous acceleration pipeline integrated with the Clang C/C++ compiler. This pipeline was evaluated on the established benchmark collections NPB and Parboil. The approach was applicable to 10 of the benchmark programs, resulting in significant speedups from 1.26\u00d7 on \u201chisto\u201d to 275\u00d7 on \u201csgemm\u201d when starting from sequential baseline versions. In summary, this thesis shows that the automatic recognition of computational idioms during compilation enables the heterogeneous acceleration of sequential C/C++ programs. Moreover, the declarative specification of computational idioms is derived in novel declarative programming languages, and it is demonstrated that constraint programming on Single Static Assignment intermediate code is a suitable method for their automatic detection."} | ||||
| 52 | −{"work_id": 149631060, "title": "Decidability Issues for Petri Nets -- a survey", "abstract": "We survey 25 years of research on decidability issues for Petri nets. We collect results on the decidability of important properties, equivalence notions, and temporal logics."} | ||||
| 53 | −{"work_id": 2790202156, "title": "ZEUS: Analyzing Safety of Smart Contracts", "abstract": "A smart contract is hard to patch for bugs once it is deployed, irrespective of the money it holds.A recent bug caused losses worth around $50 million of cryptocurrency.We present ZEUS-a framework to verify the correctness and validate the fairness of smart contracts.We consider correctness as adherence to safe programming practices, while fairness is adherence to agreed upon higher-level business logic.ZEUS leverages both abstract interpretation and symbolic model checking, along with the power of constrained horn clauses to quickly verify contracts for safety.We have built a prototype of ZEUS for Ethereum and Fabric blockchain platforms, and evaluated it with over 22.4K smart contracts.Our evaluation indicates that about 94.6% of contracts (containing cryptocurrency worth more than $0.5 billion) are vulnerable.ZEUS is sound with zero false negatives and has a low false positive rate, with an order of magnitude improvement in analysis time as compared to prior art.1 Oyente is under active development and future releases could add more features and reduce the false alarms."} | ||||
| 54 | −{"work_id": 4381982883, "title": "ChatGPT for Education and Research: Opportunities, Threats, and Strategies", "abstract": "In recent years, the rise of advanced artificial intelligence technologies has had a profound impact on many fields, including education and research. One such technology is ChatGPT, a powerful large language model developed by OpenAI. This technology offers exciting opportunities for students and educators, including personalized feedback, increased accessibility, interactive conversations, lesson preparation, evaluation, and new ways to teach complex concepts. However, ChatGPT poses different threats to the traditional education and research system, including the possibility of cheating on online exams, human-like text generation, diminished critical thinking skills, and difficulties in evaluating information generated by ChatGPT. This study explores the potential opportunities and threats that ChatGPT poses to overall education from the perspective of students and educators. Furthermore, for programming learning, we explore how ChatGPT helps students improve their programming skills. To demonstrate this, we conducted different coding-related experiments with ChatGPT, including code generation from problem descriptions, pseudocode generation of algorithms from texts, and code correction. The generated codes are validated with an online judge system to evaluate their accuracy. In addition, we conducted several surveys with students and teachers to find out how ChatGPT supports programming learning and teaching. Finally, we present the survey results and analysis."} | ||||
| 55 | {"work_id": 3207822760, "title": "Computer programming skills: A cognitive perspective", "abstract": "The studies in the current thesis examine programming skills from a broad cognitive perspective. Study 1 aims to validate two short versions of an existing programming test. Studies 2 and 3 ask whether cognitive skills and autistic traits predict programming performance in an undergraduate course. The results show that logical reasoning is the most reliable predictor of programming skill and that autistic traits do not predict programming performance. In the final study, brain activity is measured in an EEG experiment. The results show that a programming language may be processed similarly in the brain to natural languages."} | 34 | {"work_id": 3207822760, "title": "Computer programming skills: A cognitive perspective", "abstract": "The studies in the current thesis examine programming skills from a broad cognitive perspective. Study 1 aims to validate two short versions of an existing programming test. Studies 2 and 3 ask whether cognitive skills and autistic traits predict programming performance in an undergraduate course. The results show that logical reasoning is the most reliable predictor of programming skill and that autistic traits do not predict programming performance. In the final study, brain activity is measured in an EEG experiment. The results show that a programming language may be processed similarly in the brain to natural languages."} | ||
| 56 | {"work_id": 2249134499, "title": "Improving compiler optimizations using machine learning", "abstract": "\"The number of optimizations that are available in modern day compilers are in their hundreds, and would only grow in number in the future. This increase in the number of optimizations available to the compiler is primarily due to the fact that each optimization would try and target specific code constructs and increase their efficiency by applying specific templates. As the optimizations target increasingly specific code constructs, increasing number of optimizations that are being applied to a specific code may have never been intended for the code that is presently being compiled. At present all compilers apply a given set of optimizations blindly to all the code being compiled by the compiler, with the assumption that the optimization would either increase the performance of the code or make no changes. This assumption would mean that either the optimizations are not aggressive enough to reach their full potential for fear of having unintended consequences, or mean that in certain cases even degrade code performance. Knowing which optimizations to apply from the hundreds available in modern day compilers becomes difficult and important at the same time. Our research in improving compiler optimization planning aims to solve this impasse. Selective application of the optimizations from the vast number of available optimizations to the compilers is the key to increasing performance of the code being compiled. This selective application of the optimizations either involves extensive human involvement that would be (and probably already is) too complex and unsustainable or involve the use of intelligence embedded in the compiler itself. Performance improvement achieved using compiler optimizations without any input from an application developer provides this crucial boost to the application with no recurring associated cost. Another advantage of such techniques is that it can provide performance improvement over and above an already optimized code design. The process of providing the compiler with such intelligence is the primary focus of this dissertation. The optimization plan of the compiler can be primarily divided into three different logical parts, Optimization Selection , Optimization Ordering , and Optimization Tuning ; we would present our research and specific solutions to improving all three of these steps involved in optimization planning. Optimization Selection is the processing of selecting the beneficial optimizations from a given set of optimizations. We present an optimization selection solution on the widely used GCC compiler used to compile a financial library. The financial library is used by one of the largest commercial financial firms to model their risk exposure, and the computational needs of this financial library are a significant chunk of the total computation needs of the firm. We achieve a speedup of 2% to 4% compared to the baseline, which could (if implemented) directly impact their extremely large annual computational budget. Optimization Ordering is the process of arranging the order in which a set of optimizations are applied to a given piece of code. The application of multiple optimizations modify and transform the codes that they are applied to, and thus indirectly interact with each other, some of the optimizations are clean up optimizations and others could be enabling optimizations for another set of optimizations. Such interdependence of optimizations makes it more and more difficult to understand intuitively the right order to apply these optimizations, and generates the need for a method to generate good optimization orderings . This problem is usually referred to as phase ordering, and has been considered to be a difficult problem to solve in the past. In this dissertation we show that using source feature analysis in combination with machine learning algorithms can provide us with a robust heuristic in solving phase ordering. We use the Jikes RVM (Jikes Research Virtual Machine developed by IBM) to present our results and achieve a 4% to 8% improvement in the final performance of a given set of benchmarks. Finally Optimization Tuning is the process of tuning a single optimization to improve its efficacy. The example of optimization tuning that we study in this dissertation is method inlining, We use the Java HotSpot Virtual Machine (the most commonly used Java VM developed by Sun Microsystems and now actively developed and maintained by Oracle) and Maxine VM (A Java Research VM developed by Oracle) to present our results in improving the performance of method inlining, and achieve a 10% to 14% improvement in performance. We also show an interesting twist to presenting the final machine learning heuristic in the form of a decision tree, and discuss the advantages of using this over an artificial neural network.\""} | 35 | {"work_id": 2249134499, "title": "Improving compiler optimizations using machine learning", "abstract": "\"The number of optimizations that are available in modern day compilers are in their hundreds, and would only grow in number in the future. This increase in the number of optimizations available to the compiler is primarily due to the fact that each optimization would try and target specific code constructs and increase their efficiency by applying specific templates. As the optimizations target increasingly specific code constructs, increasing number of optimizations that are being applied to a specific code may have never been intended for the code that is presently being compiled. At present all compilers apply a given set of optimizations blindly to all the code being compiled by the compiler, with the assumption that the optimization would either increase the performance of the code or make no changes. This assumption would mean that either the optimizations are not aggressive enough to reach their full potential for fear of having unintended consequences, or mean that in certain cases even degrade code performance. Knowing which optimizations to apply from the hundreds available in modern day compilers becomes difficult and important at the same time. Our research in improving compiler optimization planning aims to solve this impasse. Selective application of the optimizations from the vast number of available optimizations to the compilers is the key to increasing performance of the code being compiled. This selective application of the optimizations either involves extensive human involvement that would be (and probably already is) too complex and unsustainable or involve the use of intelligence embedded in the compiler itself. Performance improvement achieved using compiler optimizations without any input from an application developer provides this crucial boost to the application with no recurring associated cost. Another advantage of such techniques is that it can provide performance improvement over and above an already optimized code design. The process of providing the compiler with such intelligence is the primary focus of this dissertation. The optimization plan of the compiler can be primarily divided into three different logical parts, Optimization Selection , Optimization Ordering , and Optimization Tuning ; we would present our research and specific solutions to improving all three of these steps involved in optimization planning. Optimization Selection is the processing of selecting the beneficial optimizations from a given set of optimizations. We present an optimization selection solution on the widely used GCC compiler used to compile a financial library. The financial library is used by one of the largest commercial financial firms to model their risk exposure, and the computational needs of this financial library are a significant chunk of the total computation needs of the firm. We achieve a speedup of 2% to 4% compared to the baseline, which could (if implemented) directly impact their extremely large annual computational budget. Optimization Ordering is the process of arranging the order in which a set of optimizations are applied to a given piece of code. The application of multiple optimizations modify and transform the codes that they are applied to, and thus indirectly interact with each other, some of the optimizations are clean up optimizations and others could be enabling optimizations for another set of optimizations. Such interdependence of optimizations makes it more and more difficult to understand intuitively the right order to apply these optimizations, and generates the need for a method to generate good optimization orderings . This problem is usually referred to as phase ordering, and has been considered to be a difficult problem to solve in the past. In this dissertation we show that using source feature analysis in combination with machine learning algorithms can provide us with a robust heuristic in solving phase ordering. We use the Jikes RVM (Jikes Research Virtual Machine developed by IBM) to present our results and achieve a 4% to 8% improvement in the final performance of a given set of benchmarks. Finally Optimization Tuning is the process of tuning a single optimization to improve its efficacy. The example of optimization tuning that we study in this dissertation is method inlining, We use the Java HotSpot Virtual Machine (the most commonly used Java VM developed by Sun Microsystems and now actively developed and maintained by Oracle) and Maxine VM (A Java Research VM developed by Oracle) to present our results in improving the performance of method inlining, and achieve a 10% to 14% improvement in performance. We also show an interesting twist to presenting the final machine learning heuristic in the form of a decision tree, and discuss the advantages of using this over an artificial neural network.\""} | ||
| 57 | {"work_id": 1844775953, "title": "Metric domains for completeness", "abstract": "Completeness is a semantic non-operational notion of program correctness suggested (but not pursued) by W.W.Wadge. Program verification can be simplified using completeness, firstly by removing the approximation relation from proofs, and secondly by removing partial objects from proofs. The dissertation proves the validity of this approach by demonstrating how it can work in the class of metric domains. We show how the use of Tarski's least fixed point theorem can be replaced by a non-operational unique fixed point theorem for many well behaved Programs. The proof of this theorem is also non-operational. After this we consider the problem of deciding what it means f or a function to be \"complete\". It is shown that combinators such as function composition are not complete, although they are traditionally assumed to be so. Complete versions for these combinators are given. Absolute functions are proposed as a general model for the notion of a complete function. The theory of mategories is introduced as a vehicle for studying absolute functions."} | 36 | {"work_id": 1844775953, "title": "Metric domains for completeness", "abstract": "Completeness is a semantic non-operational notion of program correctness suggested (but not pursued) by W.W.Wadge. Program verification can be simplified using completeness, firstly by removing the approximation relation from proofs, and secondly by removing partial objects from proofs. The dissertation proves the validity of this approach by demonstrating how it can work in the class of metric domains. We show how the use of Tarski's least fixed point theorem can be replaced by a non-operational unique fixed point theorem for many well behaved Programs. The proof of this theorem is also non-operational. After this we consider the problem of deciding what it means f or a function to be \"complete\". It is shown that combinators such as function composition are not complete, although they are traditionally assumed to be so. Complete versions for these combinators are given. Absolute functions are proposed as a general model for the notion of a complete function. The theory of mategories is introduced as a vehicle for studying absolute functions."} | ||
| 58 | {"work_id": 2540354435, "title": "Weighted Rules under the Stable Model Semantics", "abstract": "We introduce the concept of weighted rules under the stable model semantics following the log-linear models of Markov Logic. This provides versatile methods to overcome the deterministic nature of the stable model semantics, such as resolving inconsistencies in answer set programs, ranking stable models, associating probability to stable models, and applying statistical inference to computing weighted stable models. We also present formal comparisons with related formalisms, such as answer set programs, Markov Logic, ProbLog, and P-log."} | 37 | {"work_id": 2540354435, "title": "Weighted Rules under the Stable Model Semantics", "abstract": "We introduce the concept of weighted rules under the stable model semantics following the log-linear models of Markov Logic. This provides versatile methods to overcome the deterministic nature of the stable model semantics, such as resolving inconsistencies in answer set programs, ranking stable models, associating probability to stable models, and applying statistical inference to computing weighted stable models. We also present formal comparisons with related formalisms, such as answer set programs, Markov Logic, ProbLog, and P-log."} | ||
| 59 | {"work_id": 2797025890, "title": "Openness and praxis: A situated study of academic staff meaning-making and decision-making with respect to openness and use of open educational practices in higher education", "abstract": "Open education seeks to improve educational access, effectiveness, and equality. The term \u2018open educational practices\u2019 (OEP) describes practices that include the creation, use and reuse of open educational resources (OER) as well as open pedagogies and open sharing of teaching practices. While open education at a macro level is regarded by many as a positive goal, complexity resides in determining and negotiating the value of open practice at an individual level, and structural and cultural barriers to openness persist within higher education. The goal of this research study was to understand whether, why, how, and to what extent individual educators used OEP, specifically with respect to teaching, and also to identify any shared characteristics among those who used OEP (i.e. \u2018open educators\u2019). The study was conducted at a medium-sized, research-focused university in Ireland, without explicit policies on OER or OEP. The empirical study used a qualitative, interpretive, and critical approach in order to focus on participants\u2019 meaning-making and decision-making with respect to openness. Data was gathered from academic staff across a broad range of disciplines and all employment categories (i.e. permanent, non-permanent, full-time and part-time). Using constructivist grounded theory, a model of the concept \u2018Using OEP for teaching\u2019 was constructed to describe open educators\u2019 digital identities and digital practices, and the values and motives associated with decisions about whether to use OEP. The results of the study indicated little intentional use of OER and relatively low use of OEP. The four dimensions shared by open educators were: (i) balancing privacy and openness, (ii) developing digital literacies, (iii) valuing social learning, and (iv) challenging traditional teaching role expectations. The use of OEP by academic staff was found to be complex, personal, contextual, and continually negotiated. The study adds to a growing body of work on open educational practices and also provides evidence for policy makers and practitioners arguing for critical and context-specific approaches to open education."} | 38 | {"work_id": 2797025890, "title": "Openness and praxis: A situated study of academic staff meaning-making and decision-making with respect to openness and use of open educational practices in higher education", "abstract": "Open education seeks to improve educational access, effectiveness, and equality. The term \u2018open educational practices\u2019 (OEP) describes practices that include the creation, use and reuse of open educational resources (OER) as well as open pedagogies and open sharing of teaching practices. While open education at a macro level is regarded by many as a positive goal, complexity resides in determining and negotiating the value of open practice at an individual level, and structural and cultural barriers to openness persist within higher education. The goal of this research study was to understand whether, why, how, and to what extent individual educators used OEP, specifically with respect to teaching, and also to identify any shared characteristics among those who used OEP (i.e. \u2018open educators\u2019). The study was conducted at a medium-sized, research-focused university in Ireland, without explicit policies on OER or OEP. The empirical study used a qualitative, interpretive, and critical approach in order to focus on participants\u2019 meaning-making and decision-making with respect to openness. Data was gathered from academic staff across a broad range of disciplines and all employment categories (i.e. permanent, non-permanent, full-time and part-time). Using constructivist grounded theory, a model of the concept \u2018Using OEP for teaching\u2019 was constructed to describe open educators\u2019 digital identities and digital practices, and the values and motives associated with decisions about whether to use OEP. The results of the study indicated little intentional use of OER and relatively low use of OEP. The four dimensions shared by open educators were: (i) balancing privacy and openness, (ii) developing digital literacies, (iii) valuing social learning, and (iv) challenging traditional teaching role expectations. The use of OEP by academic staff was found to be complex, personal, contextual, and continually negotiated. The study adds to a growing body of work on open educational practices and also provides evidence for policy makers and practitioners arguing for critical and context-specific approaches to open education."} | ||
| 39 | +{"work_id": 4391175874, "title": "VCAT: an automatic assessment model for visual programming languages", "abstract": "Learning how to code is becoming a crucial aspect of modern society. The presence of digital technologies in everyday life requires some basic understanding on how software works in order to be aware of how this affects everyones life. Moreover, concerns on privacy and digital security also raises the relevance of understanding computer science concepts. These aspects are not only related to programming and can be referred in the literature as Computational Thinking. Computational Thinking is understood as the application of computer science concepts in different contexts of day-to-day life. As an answer to this, governments worldwide are implementing new school curricula that incorporate programming as a key skill. However, the literature shows that learning how to program is a complex and difficult task. In some cases, the dropout and failure rates can be very alarming. So, in order to mitigate these learning problems some researchers employed the visual programming paradigm. This paradigm consists in using visual elements to code algorithms. In this context, the experiments reported in the literature claim improvements in the learning process, such as better grades and motivation to learn. Another technology employed to support teaching and learning programming is the automatic assessment of programs. These tools can automatically evaluate a program using different methods. They allow teachers to assess a large number of exercises and also provide quick feedback to students. Nonetheless, at the best of our knowledge, only two visual programming systems that provide automatic assessment were found: iVProg and Chentry. Both systems offer a limited method of assessment. Therefore, this research proposes VCAT, an automatic assessment model to support Visual Programming Systems on providing this functionality to diverse visual programming languages. In addition to providing such a functionality, it also introduces improvements to its output matching algorithms, in order to provide a better experience with the generated feedback. The model was successfully instantiated considering iVProg and Blockly, which indicates that it is independent of the underlying visual programming language of the system. An experiment with students of the summer program for introductory programming was designed to assess how the students perceived the feedback improvements and the use of visual programming systems. Data from the experiment shows that the changes implemented in the output matching feedback was well received by the students when compared to VPL, a similar tool using the same type of automatic assessment without improvements. Moreover, data also suggests benefits of using visual programming as a learning step toward text based programming."} | ||||
| 60 | {"work_id": 2491926874, "title": "Formal memory models for verifying C systems code", "abstract": "Systems code is almost universally written in the C programming language or a variant. C has a very low level of type and memory abstraction and formal reasoning about C systems code requires a memory model that is able to capture the semantics of C pointers and types. At the same time, proof-based verification demands abstraction, in particular from the aliasing and frame problems. In this thesis, we study the mechanisation of a series of models, from semantic to separation logic, for achieving this abstraction when performing interactive theorem-prover based verification of C systems code in higher- order logic. We do not commit common oversimplifications, but correctly deal with C's model of programming language values and the heap, while developing the ability to reason abstractly and efficiently. We validate our work by demonstrating that the models are applicable to real, security- and safety-critical code by formally verifying the memory allocator of the L4 microkernel. All formalisations and proofs have been developed and machine-checked in the Isabelle/HOL theorem prover."} | 40 | {"work_id": 2491926874, "title": "Formal memory models for verifying C systems code", "abstract": "Systems code is almost universally written in the C programming language or a variant. C has a very low level of type and memory abstraction and formal reasoning about C systems code requires a memory model that is able to capture the semantics of C pointers and types. At the same time, proof-based verification demands abstraction, in particular from the aliasing and frame problems. In this thesis, we study the mechanisation of a series of models, from semantic to separation logic, for achieving this abstraction when performing interactive theorem-prover based verification of C systems code in higher- order logic. We do not commit common oversimplifications, but correctly deal with C's model of programming language values and the heap, while developing the ability to reason abstractly and efficiently. We validate our work by demonstrating that the models are applicable to real, security- and safety-critical code by formally verifying the memory allocator of the L4 microkernel. All formalisations and proofs have been developed and machine-checked in the Isabelle/HOL theorem prover."} | ||
| 61 | {"work_id": 2486519520, "title": "Machine learning and automated theorem proving", "abstract": "Computer programs to find formal proofs of theorems have a history going back nearly half a century. Originally designed as tools for mathematicians, modern applications of automated theorem provers and proof assistants are much more diverse. In particular they are used in formal methods to verify software and hardware designs to prevent costly, or life threatening, errors being introduced into systems from microchips to controllers for medical equipment or space rockets. Despite this, the high level of human expertise required in their use means that theorem proving tools are not widely used by non specialists, in contrast to computer algebra packages which also deal with the manipulation of symbolic mathematics. The work described in this dissertation addresses one aspect of this problem, that of heuristic selection in automated theorem provers. In theory such theorem provers should be automatic and therefore easy to use; in practice the heuristics used in the proof search are not universally optimal for all problems so human expertise is required to determine heuristic choice and to set parameter values. Modern machine learning has been applied to the automation of heuristic selection in a first order logic theorem prover. One objective was to find if there are any features of a proof problem that are both easy to measure and provide useful information for determining heuristic choice. Another was to determine and demonstrate a practical approach to making theorem provers truly automatic. In the experimental work, heuristic selection based on features of the conjecture to be proved and the associated axioms is shown to do better than any single heuristic. Additionally a comparison has been made between static features, measured prior to the proof search process, and dynamic features that measure changes arising in the early stages of proof search. Further work was done on determining which features are important, demonstrating that good results are obtained with only a few features required."} | 41 | {"work_id": 2486519520, "title": "Machine learning and automated theorem proving", "abstract": "Computer programs to find formal proofs of theorems have a history going back nearly half a century. Originally designed as tools for mathematicians, modern applications of automated theorem provers and proof assistants are much more diverse. In particular they are used in formal methods to verify software and hardware designs to prevent costly, or life threatening, errors being introduced into systems from microchips to controllers for medical equipment or space rockets. Despite this, the high level of human expertise required in their use means that theorem proving tools are not widely used by non specialists, in contrast to computer algebra packages which also deal with the manipulation of symbolic mathematics. The work described in this dissertation addresses one aspect of this problem, that of heuristic selection in automated theorem provers. In theory such theorem provers should be automatic and therefore easy to use; in practice the heuristics used in the proof search are not universally optimal for all problems so human expertise is required to determine heuristic choice and to set parameter values. Modern machine learning has been applied to the automation of heuristic selection in a first order logic theorem prover. One objective was to find if there are any features of a proof problem that are both easy to measure and provide useful information for determining heuristic choice. Another was to determine and demonstrate a practical approach to making theorem provers truly automatic. In the experimental work, heuristic selection based on features of the conjecture to be proved and the associated axioms is shown to do better than any single heuristic. Additionally a comparison has been made between static features, measured prior to the proof search process, and dynamic features that measure changes arising in the early stages of proof search. Further work was done on determining which features are important, demonstrating that good results are obtained with only a few features required."} | ||
| 62 | {"work_id": 2206959660, "title": "Automatic selection of compiler optimizations using program characterization and machine learning", "abstract": "It has been shown that machine-learning driven optimizations often outperform bundled optimizations or human-constructed heuristics in selecting suitable optimizations for particular classes of applications. In this dissertation, we propose using new modeling and program characterization techniques to mitigate the current issues in selecting the proper compiler optimizations that improve the performance of a given program. First, we propose a new modeling technique, named tournament predictor, that outperforms two state-of-the-art modeling techniques, sequence predictor and speedup predictor. Second, we discuss two novel techniques for characterizing a given program with a prediction model. One is a graph-based program characterization that uses a graph-based program representation and another is a pattern-based program characterization, which allows user-level definitions of expressive features that cannot be easily constructed using current state-of-the-art techniques. These novel techniques were evaluated and compared to three previously state-of-the-art program characterization techniques: performance counters, reactions, and source code features. The techniques introduced in this dissertation that automatically select compiler optimizations are not only novel and practical, but also outperform state-of-the-art techniques in prediction capability. Our proposed techniques will assist users in understanding and optimizing applications, ultimately helping them to better take advantage of emerging architectures rather than hand tuning or standard compiler optimizations."} | 42 | {"work_id": 2206959660, "title": "Automatic selection of compiler optimizations using program characterization and machine learning", "abstract": "It has been shown that machine-learning driven optimizations often outperform bundled optimizations or human-constructed heuristics in selecting suitable optimizations for particular classes of applications. In this dissertation, we propose using new modeling and program characterization techniques to mitigate the current issues in selecting the proper compiler optimizations that improve the performance of a given program. First, we propose a new modeling technique, named tournament predictor, that outperforms two state-of-the-art modeling techniques, sequence predictor and speedup predictor. Second, we discuss two novel techniques for characterizing a given program with a prediction model. One is a graph-based program characterization that uses a graph-based program representation and another is a pattern-based program characterization, which allows user-level definitions of expressive features that cannot be easily constructed using current state-of-the-art techniques. These novel techniques were evaluated and compared to three previously state-of-the-art program characterization techniques: performance counters, reactions, and source code features. The techniques introduced in this dissertation that automatically select compiler optimizations are not only novel and practical, but also outperform state-of-the-art techniques in prediction capability. Our proposed techniques will assist users in understanding and optimizing applications, ultimately helping them to better take advantage of emerging architectures rather than hand tuning or standard compiler optimizations."} | ||
| 63 | {"work_id": 4293846201, "title": "On Assessing ML Model Robustness: A Methodological Framework (Academic Track)", "abstract": "Due to their uncertainty and vulnerability to adversarial attacks, machine learning (ML) models can lead to severe consequences, including the loss of human life, when embedded in safety-critical systems such as autonomous vehicles. Therefore, it is crucial to assess the empirical robustness of such models before integrating them into these systems. ML model robustness refers to the ability of an ML model to be insensitive to input perturbations and maintain its performance. Against this background, the Confiance.ai research program proposes a methodological framework for assessing the empirical robustness of ML models. The framework encompasses methodological processes (guidelines) captured in Capella models, along with a set of supporting tools. This paper aims to provide an overview of this framework and its application in an industrial setting."} | 43 | {"work_id": 4293846201, "title": "On Assessing ML Model Robustness: A Methodological Framework (Academic Track)", "abstract": "Due to their uncertainty and vulnerability to adversarial attacks, machine learning (ML) models can lead to severe consequences, including the loss of human life, when embedded in safety-critical systems such as autonomous vehicles. Therefore, it is crucial to assess the empirical robustness of such models before integrating them into these systems. ML model robustness refers to the ability of an ML model to be insensitive to input perturbations and maintain its performance. Against this background, the Confiance.ai research program proposes a methodological framework for assessing the empirical robustness of ML models. The framework encompasses methodological processes (guidelines) captured in Capella models, along with a set of supporting tools. This paper aims to provide an overview of this framework and its application in an industrial setting."} | ||
| 64 | {"work_id": 4408219312, "title": "Leveraging type annotations for effective fuzzing of python programs", "abstract": "Python is among the most popular programming languages, and it powers software systems across diverse domains. Ensuring Python-language systems can grow sustainably is a pressing challenge, complicated by Python's lack of static typing. Optional type annotations have been added to Python to address this, and static type checkers have emerged to offer some compile-time guarantees, but these tools often emit false positives, and there is evidence that developers have been slow to adopt them. To complement these existing Python code analysis tools, we propose and implement a novel approach, Type Hint Fuzzing. Type Hint Fuzzing leverages type annotations to automatically perform coverage-guided mutational fuzzing, an extremely successful software testing technique, in a target codebase. Because Type Hint Fuzzing executes the code, every issue found has an associated counterexample that triggers it, precluding false positives. Three key developments enable the Type Hint Fuzzing tool's implementation: 1) a model of Python's type system in the ACL2 Sedan theorem prover, with custom enumerators for primitive types 2) a type checker plugin that extracts type annotation information, and 3) a custom input encoding that is amenable to mutational fuzzing while preserving decodability. In this thesis, we elaborate on these developments and perform a rigorous evaluation to assess the performance of the tool. In our evaluation, we first compare the custom encoding to pickle, the de facto object serializer in Python, and find that the custom encoding is unequivocally better for fuzzing. Secondly, we explore various tool configurations to understand the effect of hyperparameters on fuzzing performance. We draw some conclusions, and find that more work is needed to fully understand these effects. Finally, we report issues that the tool found in the set of target repositories. Three bug reports have been accepted as legitimate by open-source maintainers, and two of them have been patched. We conclude with extensive discussion of the results and avenues of future work to build on this promising approach. --Author's abstract"} | 44 | {"work_id": 4408219312, "title": "Leveraging type annotations for effective fuzzing of python programs", "abstract": "Python is among the most popular programming languages, and it powers software systems across diverse domains. Ensuring Python-language systems can grow sustainably is a pressing challenge, complicated by Python's lack of static typing. Optional type annotations have been added to Python to address this, and static type checkers have emerged to offer some compile-time guarantees, but these tools often emit false positives, and there is evidence that developers have been slow to adopt them. To complement these existing Python code analysis tools, we propose and implement a novel approach, Type Hint Fuzzing. Type Hint Fuzzing leverages type annotations to automatically perform coverage-guided mutational fuzzing, an extremely successful software testing technique, in a target codebase. Because Type Hint Fuzzing executes the code, every issue found has an associated counterexample that triggers it, precluding false positives. Three key developments enable the Type Hint Fuzzing tool's implementation: 1) a model of Python's type system in the ACL2 Sedan theorem prover, with custom enumerators for primitive types 2) a type checker plugin that extracts type annotation information, and 3) a custom input encoding that is amenable to mutational fuzzing while preserving decodability. In this thesis, we elaborate on these developments and perform a rigorous evaluation to assess the performance of the tool. In our evaluation, we first compare the custom encoding to pickle, the de facto object serializer in Python, and find that the custom encoding is unequivocally better for fuzzing. Secondly, we explore various tool configurations to understand the effect of hyperparameters on fuzzing performance. We draw some conclusions, and find that more work is needed to fully understand these effects. Finally, we report issues that the tool found in the set of target repositories. Three bug reports have been accepted as legitimate by open-source maintainers, and two of them have been patched. We conclude with extensive discussion of the results and avenues of future work to build on this promising approach. --Author's abstract"} | ||
| 45 | +{"work_id": 1639950690, "title": "Checking Unsatisfiability for OCL Constraints", "abstract": "In this paper we propose a mapping from a subset of OCL into first-order logic (FOL) and use this mapping for checking the unsatisfiability of sets of OCL constraints. Although still preliminary work, we argue in this paper that our mapping is both simple, since the resulting FOL sentences closely mirror the original OCL constraints, and practical, since we can use automated reasoning tools, such as automated theorem provers and SMT solvers to automatically check the unsatisfiability of non-trivial sets of OCL constraints."} | ||||
| 65 | {"work_id": 2905489900, "title": "Machine Learning for SAT Solvers", "abstract": "Boolean SAT solvers are indispensable tools in a variety of domains in computer science and engineering where efficient search is required. Not only does this relieve the burden on the users of implementing their own search algorithm, they also leverage the surprising effectiveness of modern SAT solvers. Thanks to many decades of cumulative effort, researchers have made persistent improvements to SAT technology to the point where nowadays the best solvers are routinely used to solve extremely large instances with millions of variables. Even though our current paradigm of SAT solvers runs in worst-case exponential time, it appears that the techniques and heuristics embedded in these solvers avert the worst-case exponential time in practice. The implementations of these various solver heuristics and techniques are vital to the solvers effectiveness in practice. \\n \\nThe state-of-the-art heuristics and techniques gather data during the run of the solver to inform their choices like which variable to branch on next or when to invoke a restart. The goal of these choices is to minimize the solving time. The methods in which these heuristics and techniques process the data generally do not have theoretical underpinnings. Consequently, understanding why these heuristics and techniques perform so well in practice remains a challenge and systematically improving them is rather difficult. This goes to the heart of this thesis, that is to utilize machine learning to process the data as part of an optimization problem to minimize solving time. Research in machine learning exploded over the past decade due to its success in extracting useful information out of large volumes of data. Machine learning outclasses manual handcoding in a wide variety of complex tasks where data are plentiful. This is also the case in modern SAT solvers where propagations, conflict analysis, and clause learning produces plentiful of data to be analyzed, and exploiting this data to the fullest is naturally where machine learning comes in. Many machine learning techniques have a theoretical basis that makes them easy to analyze and understand why they perform well. \\n \\nThe branching heuristic is the first target for injecting machine learning. First we studied extant branching heuristics to understand what makes a branching heuristics good empirically. The fundamental observation is that good branching heuristics cause lots of clause learning by triggering conflicts as quickly as possible. This suggests that variables that cause conflicts are a valuable source of data. Another important observation is that the state-of-the-art VSIDS branching heuristic internally implements an exponential moving average. This highlights the importance of accounting for the temporal nature of the data when deciding to branch. These observations led to our proposal of a series of machine learning-based branching heuristics with the common goal of selecting the branching variables to increase probability of inducing conflicts. These branching heuristics are shown empirically to either be on par or outcompete the current state-of-the art. \\n \\nThe second area of interest for machine learning is the restart policy. Just like in the branching heuristic work, we first study restarts to observe why they are effective in practice. The important observation here is that restarts shrink the assignment stack as conjectured by other researchers. We show that this leads to better clause learning by lowering the LBD of learnt clauses. Machine learning is used to predict the LBD of the next clause, and a restart is triggered when the LBD is excessively high. This policy is shown to be on par with state-of-the-art. The success of incorporating machine learning into branching and restarts goes to show that machine learning has an important role in the future of heuristic and technique design for SAT solvers."} | 46 | {"work_id": 2905489900, "title": "Machine Learning for SAT Solvers", "abstract": "Boolean SAT solvers are indispensable tools in a variety of domains in computer science and engineering where efficient search is required. Not only does this relieve the burden on the users of implementing their own search algorithm, they also leverage the surprising effectiveness of modern SAT solvers. Thanks to many decades of cumulative effort, researchers have made persistent improvements to SAT technology to the point where nowadays the best solvers are routinely used to solve extremely large instances with millions of variables. Even though our current paradigm of SAT solvers runs in worst-case exponential time, it appears that the techniques and heuristics embedded in these solvers avert the worst-case exponential time in practice. The implementations of these various solver heuristics and techniques are vital to the solvers effectiveness in practice. \\n \\nThe state-of-the-art heuristics and techniques gather data during the run of the solver to inform their choices like which variable to branch on next or when to invoke a restart. The goal of these choices is to minimize the solving time. The methods in which these heuristics and techniques process the data generally do not have theoretical underpinnings. Consequently, understanding why these heuristics and techniques perform so well in practice remains a challenge and systematically improving them is rather difficult. This goes to the heart of this thesis, that is to utilize machine learning to process the data as part of an optimization problem to minimize solving time. Research in machine learning exploded over the past decade due to its success in extracting useful information out of large volumes of data. Machine learning outclasses manual handcoding in a wide variety of complex tasks where data are plentiful. This is also the case in modern SAT solvers where propagations, conflict analysis, and clause learning produces plentiful of data to be analyzed, and exploiting this data to the fullest is naturally where machine learning comes in. Many machine learning techniques have a theoretical basis that makes them easy to analyze and understand why they perform well. \\n \\nThe branching heuristic is the first target for injecting machine learning. First we studied extant branching heuristics to understand what makes a branching heuristics good empirically. The fundamental observation is that good branching heuristics cause lots of clause learning by triggering conflicts as quickly as possible. This suggests that variables that cause conflicts are a valuable source of data. Another important observation is that the state-of-the-art VSIDS branching heuristic internally implements an exponential moving average. This highlights the importance of accounting for the temporal nature of the data when deciding to branch. These observations led to our proposal of a series of machine learning-based branching heuristics with the common goal of selecting the branching variables to increase probability of inducing conflicts. These branching heuristics are shown empirically to either be on par or outcompete the current state-of-the art. \\n \\nThe second area of interest for machine learning is the restart policy. Just like in the branching heuristic work, we first study restarts to observe why they are effective in practice. The important observation here is that restarts shrink the assignment stack as conjectured by other researchers. We show that this leads to better clause learning by lowering the LBD of learnt clauses. Machine learning is used to predict the LBD of the next clause, and a restart is triggered when the LBD is excessively high. This policy is shown to be on par with state-of-the-art. The success of incorporating machine learning into branching and restarts goes to show that machine learning has an important role in the future of heuristic and technique design for SAT solvers."} | ||
| 66 | {"work_id": 58732440, "title": "An exploration of novice compilation behaviour in BlueJ", "abstract": "Our research explores the process by which beginning programmers go about writing programs. We have focused our explorations on what we call compilation behaviour: the programming behaviour a student engages in while repeatedly editing and compiling their programs in an attempt to make them syntactically, if not semantically, correct. The students whose behaviour we have observed were engaged in learning to program in an objects-first style using BlueJ, an environment designed for supporting novice programmers just starting out with the Java programming language. The significant results of our work are two-fold. First, we have developed tools for visualising the process by which students write their programs. Using these tools, we can quickly obtain valuable information about their process, and use that information to inform further research regarding their behaviour, or apply it immediately in a classroom context to better support the struggling learner. Second, we have proposed a quantification of novice compilation behavior which we call the error quotient. Using this metric, we can determine how well (or poorly) a student fares with syntax errors while learning to program. This quantity, like our tools for visualisation, provides a powerful indicator for how much or little a student is struggling with the language while programming, and correlates significantly with traditional indicators for academic progress."} | 47 | {"work_id": 58732440, "title": "An exploration of novice compilation behaviour in BlueJ", "abstract": "Our research explores the process by which beginning programmers go about writing programs. We have focused our explorations on what we call compilation behaviour: the programming behaviour a student engages in while repeatedly editing and compiling their programs in an attempt to make them syntactically, if not semantically, correct. The students whose behaviour we have observed were engaged in learning to program in an objects-first style using BlueJ, an environment designed for supporting novice programmers just starting out with the Java programming language. The significant results of our work are two-fold. First, we have developed tools for visualising the process by which students write their programs. Using these tools, we can quickly obtain valuable information about their process, and use that information to inform further research regarding their behaviour, or apply it immediately in a classroom context to better support the struggling learner. Second, we have proposed a quantification of novice compilation behavior which we call the error quotient. Using this metric, we can determine how well (or poorly) a student fares with syntax errors while learning to program. This quantity, like our tools for visualisation, provides a powerful indicator for how much or little a student is struggling with the language while programming, and correlates significantly with traditional indicators for academic progress."} | ||
| 67 | −{"work_id": 3117137355, "title": "egg: Fast and Extensible Equality Saturation", "abstract": "E-graphs, originally developed for use in automated theorem provers, are data structures that compactly represent a large number of expressions and the equalities between them. Recently, a technique called equality saturation adapted e-graphs for program optimization. Equality saturation can ameliorate issues with traditional, destructive term rewriting since e-graph rewriting only adds information to the e-graph. After rewriting, the e-graph represents a large space of equivalent terms (including the original term), and a final extraction procedure selects the best term according to a user-provided cost function. The egg library is a fast and flexible open-source implementation of e-graphs and equality saturation. Unlike solvers, egg is a white-box library for programmatic use. Users can easily define their own languages, rewrites, and analyses, and they can inspect and manipulate the e-graph directly. It incorporates novel techniques such as e-class analysis , a mechanism for integrating program analyses modulo equality; and rebuilding , a deferred invariant restoration algorithm. egg has been used in hundreds of academic and industrial projects for program optimization, synthesis, and verification in many domains; some are briefly highlighted in this article."} | ||||
| 68 | {"work_id": 2900153411, "title": "An abstract domain for certifying neural networks", "abstract": "We present a novel method for scalable and precise certification of deep neural networks. The key technical insight behind our approach is a new abstract domain which combines floating point polyhedra with intervals and is equipped with abstract transformers specifically tailored to the setting of neural networks. Concretely, we introduce new transformers for affine transforms, the rectified linear unit (ReLU), sigmoid, tanh, and maxpool functions. We implemented our method in a system called DeepPoly and evaluated it extensively on a range of datasets, neural architectures (including defended networks), and specifications. Our experimental results indicate that DeepPoly is more precise than prior work while scaling to large networks. We also show how to combine DeepPoly with a form of abstraction refinement based on trace partitioning. This enables us to prove, for the first time, the robustness of the network when the input image is subjected to complex perturbations such as rotations that employ linear interpolation."} | 48 | {"work_id": 2900153411, "title": "An abstract domain for certifying neural networks", "abstract": "We present a novel method for scalable and precise certification of deep neural networks. The key technical insight behind our approach is a new abstract domain which combines floating point polyhedra with intervals and is equipped with abstract transformers specifically tailored to the setting of neural networks. Concretely, we introduce new transformers for affine transforms, the rectified linear unit (ReLU), sigmoid, tanh, and maxpool functions. We implemented our method in a system called DeepPoly and evaluated it extensively on a range of datasets, neural architectures (including defended networks), and specifications. Our experimental results indicate that DeepPoly is more precise than prior work while scaling to large networks. We also show how to combine DeepPoly with a form of abstraction refinement based on trace partitioning. This enables us to prove, for the first time, the robustness of the network when the input image is subjected to complex perturbations such as rotations that employ linear interpolation."} | ||
| 69 | {"work_id": 4391677389, "title": "IDENTIFYING CONCERNS WHEN SPECIFYING MACHINE LEARNING-ENABLED SYSTEMS: A PERSPECTIVE-BASED APPROACH", "abstract": "I would like to express my sincere gratitude to those"} | 49 | {"work_id": 4391677389, "title": "IDENTIFYING CONCERNS WHEN SPECIFYING MACHINE LEARNING-ENABLED SYSTEMS: A PERSPECTIVE-BASED APPROACH", "abstract": "I would like to express my sincere gratitude to those"} | ||
| 50 | +{"work_id": 4385482927, "title": "Decoupling Algorithms from Schedules for Easy Optimization of Image Processing Pipelines", "abstract": "Using existing programming tools, writing high-performance image processing code requires sacrificing readability, portability, and modularity. We argue that this is a consequence of conflating what computations define the algorithm, with decisions about storage and the order of computation. We refer to these latter two concerns as the schedule, including choices of tiling, fusion, recomputation vs. storage, vectorization, and parallelism"} | ||||
| 51 | +{"work_id": 2100209048, "title": "Static And Dynamic Reverse Engineering Techniques for Java Software Systems", "abstract": "The main contributions of this dissertation are as follows: methods for using the dependencies between static and dynamic models for goal driven reverse engineering tasks, including merging dynamic information to a static Rigiview; using static information to guide the generation of dynamici nformation; slicing a Rigi view using SCED scenarios; and raising the level of abstraction of SCED scenarios using a high-level Rigigraph; algorithms for optimizing synthesized state diagrams using UMLnotation; application of the synthesis algorithm presented by Koskimies and M\u00e4kinen [54] to SCED; string matching algorithms for raising the level of abstraction of SCED scenario iagrams; the prototype reverse ngineering environment Shimba, which integrates two existing tools: Rigi for reverse engineering the static structure of Javasoftware; and SCED and its state diagram synthesis facility for reverse engineering the dynamic behavior of Java software; methods and tools for gathering information, including extraction of static information from Java byte code;and extraction of run-time information by running the target system under a customized jdk debugger; a case study to evaluate the facilities of Shimba."} | ||||
| 52 | +{"work_id": 7131867455, "title": "The Effects of Generative AI on High-Skilled Work: Evidence from Three Field Experiments with Software Developers", "abstract": "This study evaluates the effect of generative artificial intelligence (AI) on software developer productivity via randomized controlled trials at Microsoft, Accenture, and an anonymous Fortune 100 company. These field experiments, run by the companies as part of their ordinary course of business, provided a random subset of developers with access to an AI-based coding assistant suggesting intelligent code completions. Although each experiment is noisy and results vary across experiments, when data are combined across three experiments and 4,867 developers, our analysis reveals a 26.08% increase (standard error: 10.3%) in completed tasks among developers using the AI tool. Notably, less experienced developers had higher adoption rates and greater productivity gains. This paper was accepted by Jean-Pierre Dube, marketing. Funding: M. Demirer and T. Salz thank the MIT GenAI Initiative for funding. Supplemental Material: The online appendices and data files are available at https://doi.org/10.1287/mnsc.2025.00535 ."} | ||||
| 53 | +{"work_id": 3046781014, "title": "ExaStencils: Advanced Multigrid Solver Generation", "abstract": "Present-day stencil codes are implemented in general-purpose programming languages, such as Fortran, C, or Java, Python or derivates thereof, and harnesses for parallelism, such as OpenMP, OpenCL or MPI. Project ExaStencils pursued a domain-specific approach with a language, called ExaSlang, that is stratified into four layers of abstraction, the most abstract being the formulation in continuous mathematics and the most concrete a full, automatically generated implementation. At every layer, the corresponding language expresses not only computational directives but also domain knowledge of the problem and platform to be leveraged for optimization. We describe the approach, the software technology behind it and several case studies that demonstrate its feasibility and versatility: high-performance stencil codes can be engineered, ported and optimized more easily and effectively."} | ||||
| 54 | +{"work_id": 4396905794, "title": "Predicting typeScript type annotations and definitions with machine learning", "abstract": "Type information is useful for developing large-scale software systems. Types help prevent bugs, but may be inflexible and hamper quick iteration on early prototypes. TypeScript, a syntactic superset of JavaScript, brings the best of both worlds, allowing programmers to freely mix statically and dynamically typed code, and choose the level of type safety they wish to opt into. However, type migration, the process of migrating an untyped program to a typed version, has remained a labour-intensive manual effort in practice. As a first step towards automated effective type migration, there has been interest in applying machine learning to the narrower problem of type prediction. In this dissertation, I propose to use machine learning to partially migrate JavaScript programs to TypeScript, by predicting type annotations and generating type definitions. To support this thesis, I make three contributions. First, I propose evaluating type prediction by type checking the generated annotations instead of computing accuracy. Second, I fine-tune a large language model with fill-in-the-middle capability to fill in the type and predict type annotations. Finally, I use a similar approach to fine-tune a large language model to generate missing type definitions.--Author's abstract"} | ||||
| 70 | {"work_id": 2189687801, "title": "General Program Synthesis from Examples Using Genetic Programming with Parent Selection Based on Random Lexicographic Orderings of Test Cases", "abstract": "Massachusetts, U.S.A. is located along the southern boundary of the geographic range of moose (Alces alces) in North America. This is an atypical environment for moose, because of its extremely high levels of human development and high year-round temperatures, which are possibly at the limits of moose physiological tolerances. I investigated the role of these two factors on moose movements and habitat selection to determine how human development of the landscape and temperature influence moose occupation of this extreme environment. In addition, the response of moose to these factors provides insights into the influence of development and temperature on individual fitness and population persistence. Thermal conditions in Massachusetts were consistently higher than the reported physiological tolerances of moose, and higher than parts of the range where high temperatures have negatively affected moose reproduction and survival. Moose greatly reduced their selection of open foraging habitat and increased selection for thermal shelters as temperatures increased above upper critical limits; this same pattern was apparent when comparing day (warmer) to night (cooler) activities. A strong transition in the use of habitats occurred at dawn and dusk, which corresponded to peaks in hourly movement rates at these times, indicating a transition in state from foraging at night to bedding during the day. The ability of moose to adapt to this extreme thermal environment through thermoregulatory behaviors reveals the limitations of predicting species distributions based solely on theoretical temperature tolerances. Massachusetts has one of the highest rates of moose-vehicle collisions (MVCs) per-capita moose and resulting human fatalities. The majority (86%) of MVCs occurred on roads with high speed limits and traffic volumes, and occurred on these roads at much higher rates than would be predicted based on their availability on the landscape. The dense road network in Massachusetts had a strong negative effect on the movements and habitat selection patterns of moose. Moose avoided crossing roads and greatly reduced their use near roads. Road avoidance increased with increasing disturbance intensity associated with higher traffic volumes and busier times of day. Roadways reduced habitat availability and connectivity, were a major source of additive mortality for moose."} | 55 | {"work_id": 2189687801, "title": "General Program Synthesis from Examples Using Genetic Programming with Parent Selection Based on Random Lexicographic Orderings of Test Cases", "abstract": "Massachusetts, U.S.A. is located along the southern boundary of the geographic range of moose (Alces alces) in North America. This is an atypical environment for moose, because of its extremely high levels of human development and high year-round temperatures, which are possibly at the limits of moose physiological tolerances. I investigated the role of these two factors on moose movements and habitat selection to determine how human development of the landscape and temperature influence moose occupation of this extreme environment. In addition, the response of moose to these factors provides insights into the influence of development and temperature on individual fitness and population persistence. Thermal conditions in Massachusetts were consistently higher than the reported physiological tolerances of moose, and higher than parts of the range where high temperatures have negatively affected moose reproduction and survival. Moose greatly reduced their selection of open foraging habitat and increased selection for thermal shelters as temperatures increased above upper critical limits; this same pattern was apparent when comparing day (warmer) to night (cooler) activities. A strong transition in the use of habitats occurred at dawn and dusk, which corresponded to peaks in hourly movement rates at these times, indicating a transition in state from foraging at night to bedding during the day. The ability of moose to adapt to this extreme thermal environment through thermoregulatory behaviors reveals the limitations of predicting species distributions based solely on theoretical temperature tolerances. Massachusetts has one of the highest rates of moose-vehicle collisions (MVCs) per-capita moose and resulting human fatalities. The majority (86%) of MVCs occurred on roads with high speed limits and traffic volumes, and occurred on these roads at much higher rates than would be predicted based on their availability on the landscape. The dense road network in Massachusetts had a strong negative effect on the movements and habitat selection patterns of moose. Moose avoided crossing roads and greatly reduced their use near roads. Road avoidance increased with increasing disturbance intensity associated with higher traffic volumes and busier times of day. Roadways reduced habitat availability and connectivity, were a major source of additive mortality for moose."} | ||
| 71 | {"work_id": 1486172410, "title": "Introduction to Software Testing", "abstract": "Software testing can be regarded as an art, a craft, and a science. The practical, step-by-step approach presented in this book provides a bridge between these different viewpoints. A single worked example runs throughout, with consistent use of test automation. Each testing technique is introduced in the context of this example, helping students see its strengths and weaknesses. The technique is then explained in more detail, providing a deeper understanding of underlying principles. Finally the limitations of each technique are demonstrated by inserting faults, giving learners concrete examples of when each technique succeeds or fails in finding faults. Coverage includes black-box testing, white-box testing, random testing, unit testing, object-oriented testing, and application testing. The authors also emphasise the process of applying the techniques, covering the steps of analysis, test design, test implementation, and interpretation of results. The book's web site has programming exercises and Java source code for all examples."} | 56 | {"work_id": 1486172410, "title": "Introduction to Software Testing", "abstract": "Software testing can be regarded as an art, a craft, and a science. The practical, step-by-step approach presented in this book provides a bridge between these different viewpoints. A single worked example runs throughout, with consistent use of test automation. Each testing technique is introduced in the context of this example, helping students see its strengths and weaknesses. The technique is then explained in more detail, providing a deeper understanding of underlying principles. Finally the limitations of each technique are demonstrated by inserting faults, giving learners concrete examples of when each technique succeeds or fails in finding faults. Coverage includes black-box testing, white-box testing, random testing, unit testing, object-oriented testing, and application testing. The authors also emphasise the process of applying the techniques, covering the steps of analysis, test design, test implementation, and interpretation of results. The book's web site has programming exercises and Java source code for all examples."} | ||
| 72 | {"work_id": 4385245566, "title": "Exploiting Generative AI to Scale up Intelligent Tutoring Systems", "abstract": "As a present to Mizar on its 50th anniversary, we develop an AI/TP system that automatically proves about 60% of the Mizar theorems in the hammer setting. We also automatically prove 75% of the Mizar theorems when the automated provers are helped by using only the premises used in the human-written Mizar proofs. We describe the methods and large-scale experiments leading to these results. This includes in particular the E and Vampire provers, their ENIGMA and Deepire learning modifications, a number of learning-based premise selection methods, and the incremental loop that interleaves growing a corpus of millions of ATP proofs with training increasingly strong AI/TP systems on them. We also present a selection of Mizar problems that were proved automatically."} | 57 | {"work_id": 4385245566, "title": "Exploiting Generative AI to Scale up Intelligent Tutoring Systems", "abstract": "As a present to Mizar on its 50th anniversary, we develop an AI/TP system that automatically proves about 60% of the Mizar theorems in the hammer setting. We also automatically prove 75% of the Mizar theorems when the automated provers are helped by using only the premises used in the human-written Mizar proofs. We describe the methods and large-scale experiments leading to these results. This includes in particular the E and Vampire provers, their ENIGMA and Deepire learning modifications, a number of learning-based premise selection methods, and the incremental loop that interleaves growing a corpus of millions of ATP proofs with training increasingly strong AI/TP systems on them. We also present a selection of Mizar problems that were proved automatically."} | ||
| 73 | {"work_id": 4403110951, "title": "Semantics-aware human-computer interaction software testing", "abstract": "In an age where technology and human interaction are becoming ever more entwined, human-interactive systems\u2014encompassing web services and artificial intelligence\u2014are integral to daily life. From web applications to automated speech recognition (ASR) systems, these technologies are transforming human-machine communication and underpinning contemporary society's functionality. However, ensuring the reliability and robustness of these systems is challenging due to the vast and unpredictable input/output spaces they operate within, making traditional testing methods, such as fuzzing, insufficient. This thesis addresses four critical aspects of human-computer interaction (HCI) system reliability and robustness: test input generation, service behavior representation, automation of testing processes, and test oracle generation. These aspects are vital for developing robust and reliable HCI systems, each representing a key area where current methods fall short and require innovative approaches. The first aspect, test input generation, is explored through web applications, introducing a novel methodology that employs curiosity-driven reinforcement learning to create high-quality action sequences that adhere to temporal logical relationships. This enhances test input generation, demonstrating how conventional strategies can be adapted for complex systems. The second aspect, service behavior representation, is addressed in the context of RESTful API backend components in web services. This study presents a model-based testing approach using a RESTful-service Property Graph (RPG) to represent service behaviors, which improves the effectiveness of fuzzing tests by streamlining call sequence generation. The third aspect, automation of testing processes, focuses on RESTful API testing in industry, a critical need given RESTful APIs' prevalence in corporate cloud services. The research introduces an automated framework that identifies and helps fix new bugs, emphasizing the necessity of human involvement for improving automated processes and updating API specifications and test cases. The final aspect, test oracle generation, is advanced through accessibility testing for ASR systems, particularly for stuttered speech. It introduces ASTER, a tool that generates diverse stuttering test cases to identify ASR system failures effectively, underscoring the importance of robust test oracle generation for HCI software. Through these four interconnected studies, this thesis introduces a comprehensive approach to testing within HCI systems. It underscores the need for specialized methodologies to address the unique challenges of reliability and robustness. By integrating traditional testing techniques with the dynamic characteristics of these systems, this research advances the field of HCI system reliability and robustness, particularly within human-machine interaction."} | 58 | {"work_id": 4403110951, "title": "Semantics-aware human-computer interaction software testing", "abstract": "In an age where technology and human interaction are becoming ever more entwined, human-interactive systems\u2014encompassing web services and artificial intelligence\u2014are integral to daily life. From web applications to automated speech recognition (ASR) systems, these technologies are transforming human-machine communication and underpinning contemporary society's functionality. However, ensuring the reliability and robustness of these systems is challenging due to the vast and unpredictable input/output spaces they operate within, making traditional testing methods, such as fuzzing, insufficient. This thesis addresses four critical aspects of human-computer interaction (HCI) system reliability and robustness: test input generation, service behavior representation, automation of testing processes, and test oracle generation. These aspects are vital for developing robust and reliable HCI systems, each representing a key area where current methods fall short and require innovative approaches. The first aspect, test input generation, is explored through web applications, introducing a novel methodology that employs curiosity-driven reinforcement learning to create high-quality action sequences that adhere to temporal logical relationships. This enhances test input generation, demonstrating how conventional strategies can be adapted for complex systems. The second aspect, service behavior representation, is addressed in the context of RESTful API backend components in web services. This study presents a model-based testing approach using a RESTful-service Property Graph (RPG) to represent service behaviors, which improves the effectiveness of fuzzing tests by streamlining call sequence generation. The third aspect, automation of testing processes, focuses on RESTful API testing in industry, a critical need given RESTful APIs' prevalence in corporate cloud services. The research introduces an automated framework that identifies and helps fix new bugs, emphasizing the necessity of human involvement for improving automated processes and updating API specifications and test cases. The final aspect, test oracle generation, is advanced through accessibility testing for ASR systems, particularly for stuttered speech. It introduces ASTER, a tool that generates diverse stuttering test cases to identify ASR system failures effectively, underscoring the importance of robust test oracle generation for HCI software. Through these four interconnected studies, this thesis introduces a comprehensive approach to testing within HCI systems. It underscores the need for specialized methodologies to address the unique challenges of reliability and robustness. By integrating traditional testing techniques with the dynamic characteristics of these systems, this research advances the field of HCI system reliability and robustness, particularly within human-machine interaction."} | ||
| 74 | {"work_id": 2327217190, "title": "Verification of programs in virtual memory using separation logic", "abstract": "Formal reasoning about programs executing in virtual memory is a difficult problem, as it is an environment in which writing to memory can change its layout. At the same time, correctly reasoning about virtual memory is essential to operating system verification, a field we are very much interested in. Current approaches rely on entering special modes or making high-level assertions about the nature of virtual memory which may or may not be correct. In this thesis, we examine the problems created by virtual memory and develop a unified view of memory, both physical and virtual, based on separation logic. We first develop this model for a simple programming language on a simplified architecture with a one-level page table, taking care to prove it constitutes a separation logic. We then extend the framework to deal with low-level C programs executing in a virtual memory environment of the ARMv6 architecture with a two-level page table. We perform two case studies involving mapping in of a new page into the current address space: first for the simple version of our logic, and finally for our full framework. The case studies demonstrate that separation logic style modular reasoning via the frame rule can be used in a unified model which encompasses virtual memory, even in the presence of page table writes. To our knowledge, we present the first model offering a unified view of virtual and physical memory, the first separation logic involving an address translation mechanism, as well as the first published model of a functional subset of ARM memory management unit. Our memory models, framework, proofs and all results are formalised in the Isabelle/HOL interactive theorem prover."} | 59 | {"work_id": 2327217190, "title": "Verification of programs in virtual memory using separation logic", "abstract": "Formal reasoning about programs executing in virtual memory is a difficult problem, as it is an environment in which writing to memory can change its layout. At the same time, correctly reasoning about virtual memory is essential to operating system verification, a field we are very much interested in. Current approaches rely on entering special modes or making high-level assertions about the nature of virtual memory which may or may not be correct. In this thesis, we examine the problems created by virtual memory and develop a unified view of memory, both physical and virtual, based on separation logic. We first develop this model for a simple programming language on a simplified architecture with a one-level page table, taking care to prove it constitutes a separation logic. We then extend the framework to deal with low-level C programs executing in a virtual memory environment of the ARMv6 architecture with a two-level page table. We perform two case studies involving mapping in of a new page into the current address space: first for the simple version of our logic, and finally for our full framework. The case studies demonstrate that separation logic style modular reasoning via the frame rule can be used in a unified model which encompasses virtual memory, even in the presence of page table writes. To our knowledge, we present the first model offering a unified view of virtual and physical memory, the first separation logic involving an address translation mechanism, as well as the first published model of a functional subset of ARM memory management unit. Our memory models, framework, proofs and all results are formalised in the Isabelle/HOL interactive theorem prover."} | ||
| 60 | +{"work_id": 2187038411, "title": "Modelling and programming embedded controllers with timed automata and synchronous languages", "abstract": "Embedded controllers coordinate the behaviours of specialised hardware components to satisfy broader application requirements. They are difficult to model and to program. One of the greatest challenges is to express intricate timing behaviours\u2014which arise from the physical characteristics of components\u2014while not precluding efficient implementations on resource-constrained platforms. Aspects of this challenge are addressed by this thesis through four distinct applications of timed automata and the synchronous languages Argos and Esterel. A novel framework for simulating controllers written in an imperative synchronous language is described. It includes a transformation of synchronous models into timed automata that accounts for timing properties which are important in constrained implementations but ignored by the usual assumption of synchrony. The transformation provides an interface between the discrete time of synchronous programs and a continuous model of time. This interface is extended to provide a way for simulating Argos programs within the widely-used Simulink software. Timed automata are well-suited for semantic descriptions, like the aforementioned transformation, and for modelling abstract algorithms and protocols. This thesis also includes a different type of case study. The timing diagram of a small-scale embedded component is modelled in more detail than usual with the aim of studying timing properties in this type of system. Multiple models are constructed, including one of an assembly language controller. Their interrelations are verified in Uppaal using a construction for timed trace inclusion testing. Existing constructions for testing timed trace inclusion do not directly address recent features of the Uppaal modelling language. Novel solutions for the problems presented by selection bindings, quantifiers, and channel arrays in Uppaal are presented in this thesis. The first known implementation of a tool for automatically generating a timed trace inclusion construction is described. The timed automata case study demonstrates one way of implementing application timing behaviours while respecting implementation constraints. A more challenging, but less detailed, example is proposed to evaluate the adequacy of Esterel for such tasks. Since none of the standard techniques are completely adequate, a novel alternative for expressing delays in physical time is proposed. Programs in standard Esterel are recovered through syntactic transformations that account for platform constraints."} | ||||
| 75 | {"work_id": 3007157104, "title": "Machine Learning Testing: Survey, Landscapes and Horizons", "abstract": "This paper provides a comprehensive survey of techniques for testing machine learning systems; Machine Learning Testing (ML testing) research. It covers 144 papers on testing properties (e.g., correctness, robustness, and fairness), testing components (e.g., the data, learning program, and framework), testing workflow (e.g., test generation and test evaluation), and application scenarios (e.g., autonomous driving, machine translation). The paper also analyses trends concerning datasets, research trends, and research focus, concluding with research challenges and promising research directions in ML testing."} | 61 | {"work_id": 3007157104, "title": "Machine Learning Testing: Survey, Landscapes and Horizons", "abstract": "This paper provides a comprehensive survey of techniques for testing machine learning systems; Machine Learning Testing (ML testing) research. It covers 144 papers on testing properties (e.g., correctness, robustness, and fairness), testing components (e.g., the data, learning program, and framework), testing workflow (e.g., test generation and test evaluation), and application scenarios (e.g., autonomous driving, machine translation). The paper also analyses trends concerning datasets, research trends, and research focus, concluding with research challenges and promising research directions in ML testing."} | ||
| 76 | −{"work_id": 2964015378, "title": "Detecting Functionality-Specific Vulnerabilities via Retrieving Individual Functionality-Equivalent APIs in Open-Source Repositories", "abstract": "Functionality-specific vulnerabilities, which mainly occur in Application Programming Interfaces (APIs) with specific functionalities, are crucial for software developers to detect and avoid. When detecting individual functionality-specific vulnerabilities, the existing two categories of approaches are ineffective because they consider only the API bodies and are unable to handle diverse implementations of functionality-equivalent APIs. To effectively detect functionality-specific vulnerabilities, we propose APISS, the first approach to utilize API doc strings and signatures instead of API bodies. APISS first retrieves functionality-equivalent APIs for APIs with existing vulnerabilities and then migrates Proof-of-Concepts (PoCs) of the existing vulnerabilities for newly detected vulnerable APIs. To retrieve functionality-equivalent APIs, we leverage a Large Language Model for API embedding to improve the accuracy and address the effectiveness and scalability issues suffered by the existing approaches. To migrate PoCs of the existing vulnerabilities for newly detected vulnerable APIs, we design a semi-automatic schema to substantially reduce manual costs. We conduct a comprehensive evaluation to empirically compare APISS with four state-of-the-art approaches of detecting vulnerabilities and two state-of-the-art approaches of retrieving functionality-equivalent APIs. The evaluation subjects include 180 widely used Java repositories using 10 existing vulnerabilities, along with their PoCs. The results show that APISS effectively retrieves functionality-equivalent APIs, achieving a Top-1 Accuracy of 0.81 while the best of the baselines under comparison achieves only 0.55. APISS is highly efficient: the manual costs are within 10 minutes per vulnerability and the end-to-end runtime overhead of testing one candidate API is less than 2 hours. APISS detects 179 new vulnerabilities and receives 60 new CVE IDs, bringing high value to security practice."} | 62 | +{"work_id": 4281635063, "title": "Evolution of Low-Code Platforms", "abstract": "During my Master's degree, I never had the intention of pursuing a PhD.I valued industry with its practical outcome higher than the, what I thought to be, purely theoretical results of science.During the following years, however, I started to read more and more scientific literature.So when an opportunity presented itself to combine the job of an engineer and architect with scientific research, I decided to jump on it.This jump turned out to be a journey of six and half years, which by no means was an easy walk in the park.At the time I did not know what I was getting into and, to be honest, I felt an imposter for 75% of the time.I learned many things while doing the scientific work presented in this dissertation, not only about conducting research but also about academic writing and selling ideas to peers.More than once a paper was rejected because the writing was not clear enough, I have learned the hard way.Although it was not always easy to receive peer review feedback, the article always turned out better.This might be the most important thing that I have learned about the way I work: I need feedback from peers to do my best work.Unfortunately submitting an article does not result in immediate feedback, making the process a bit slow.Luckily I received help from many people, without whom I never got this far.Although I may forget someone, I am obligated to give thanks where it is due.This work would not have been in this state without the continuous support of Slinger Jansen.Thank you for your enthusiasm, constant encouragement, and sharing your experience with me throughout these years.I have learned so much about the academic world and conducting science through you.The way you always spot an opportunity is inspiring.Sjaak Brinkkemper and Hajo Reijers, you fulfilled your role in the background, but I enjoyed our collaboration.You are both experienced scientists willing to share your experience with a new generation, thank you.I could not have done all of this without the opportunity given by Machiel de Graaf, Rolf de Jong, and Dennis van Velzen.Thank you for allowing me to combine the pursuit of a PhD with my job at AFAS.The flexibility, freedom, and support were everything I could wish for.My colleagues at AFAS did not always understand why anyone would do this for 'fun', but thank you for your interest, support, and patience.Special thanks to the AFAS Focus teams: Buccaneers, Orioles, Braves, Red-Sox, and Giants.This dissertation would not exist without all the work we did in the past years"} | ||
| 77 | −{"work_id": 2783614532, "title": "A Survey on Compiler Autotuning using Machine Learning", "abstract": "Since the mid-1990s, researchers have been trying to use machine-learning-based approaches to solve a number of different compiler optimization problems. These techniques primarily enhance the quality of the obtained results and, more importantly, make it feasible to tackle two main compiler optimization problems: optimization selection (choosing which optimizations to apply) and phase-ordering (choosing the order of applying optimizations). The compiler optimization space continues to grow due to the advancement of applications, increasing number of compiler optimizations, and new target architectures. Generic optimization passes in compilers cannot fully leverage newly introduced optimizations and, therefore, cannot keep up with the pace of increasing options. This survey summarizes and classifies the recent advances in using machine learning for the compiler optimization field, particularly on the two major problems of (1) selecting the best optimizations, and (2) the phase-ordering of optimizations. The survey highlights the approaches taken so far, the obtained results, the fine-grain classification among different approaches, and finally, the influential papers of the field."} | 63 | +{"work_id": 4225922019, "title": "cvc5: A Versatile and Industrial-Strength SMT Solver", "abstract": "Abstract cvc5 is the latest SMT solver in the cooperating validity checker series and builds on the successful code base of CVC4. This paper serves as a comprehensive system description of cvc5 \u2019s architectural design and highlights the major features and components introduced since CVC4 1.8. We evaluate cvc5 \u2019s performance on all benchmarks in SMT-LIB and provide a comparison against CVC4 and Z3."} | ||
| 64 | +{"work_id": 4293212596, "title": "The Astropy Project : Sustaining and Growing a Community-oriented Open-source Project and the Latest Major Release (v5.0) of the Core Package*", "abstract": "Full list of authors: Price-Whelan, Adrian M.; Lim, Pey Lian; Earl, Nicholas; Starkman, Nathaniel; Bradley, Larry; Shupe, David L.; Patil, Aarya A.; Corrales, Lia; Brasseur, C. E.; Noethe, Maximilian; Donath, Axel; Tollerud, Erik; Morris, Brett M.; Ginsburg, Adam; Vaher, Eero; Weaver, Benjamin A.; Tocknell, James; Jamieson, William; van Kerkwijk, Marten H.; Robitaille, Thomas P.; Merry, Bruce; Bachetti, Matteo; Gunther, H. Moritz; Aldcroft, Thomas L.; Alvarado-Montes, Jaime A.; Archibald, Anne M.; Bodi, Attila; Bapat, Shreyas; Barentsen, Geert; Bazan, Juanjo; Biswas, Manish; Boquien, Mederic; Burke, D. J.; Cara, Daria; Cara, Mihai; Conroy, Kyle E.; Conseil, Simon; Craig, Matthew W.; Cross, Robert M.; Cruz, Kelle L.; D'Eugenio, Francesco; Dencheva, Nadia; Devillepoix, Hadrien A. R.; Dietrich, Jorg P.; Eigenbrot, Arthur Davis; Erben, Thomas; Ferreira, Leonardo; Foreman-Mackey, Daniel; Fox, Ryan; Freij, Nabil; Garg, Suyog; Geda, Robel; Glattly, Lauren; Gondhalekar, Yash; Gordon, Karl D.; Grant, David; Greenfield, Perry; Groener, Austen M.; Guest, Steve; Gurovich, Sebastian; Handberg, Rasmus; Hart, Akeem; Hatfield-Dodds, Zac; Homeier, Derek; Hosseinzadeh, Griffin; Jenness, Tim; Jones, Craig K.; Joseph, Prajwel; Kalmbach, J. Bryce; Karamehmetoglu, Emir; Kaluszynski, Mikolaj; Kelley, Michael S. P.; Kern, Nicholas; Kerzendorf, Wolfgang E.; Koch, Eric W.; Kulumani, Shankar; Lee, Antony; Ly, Chun; Ma, Zhiyuan; MacBride, Conor; Maljaars, Jakob M.; Muna, Demitri; Murphy, N. A.; Norman, Henrik; O'Steen, Richard; Oman, Kyle A.; Pacifici, Camilla; Pascual, Sergio; Pascual-Granado, J.; Patil, Rohit R.; Perren, Gabriel, I; Pickering, Timothy E.; Rastogi, Tanuj; Roulston, Benjamin R.; Ryan, Daniel F.; Rykoff, Eli S.; Sabater, Jose; Sakurikar, Parikshit; Salgado, Jesus; Sanghi, Aniket; Saunders, Nicholas; Savchenko, Volodymyr; Schwardt, Ludwig; Seifert-Eckert, Michael; Shih, Albert Y.; Jain, Anany Shrey; Shukla, Gyanendra; Sick, Jonathan; Simpson, Chris; Singanamalla, Sudheesh; Singer, Leo P.; Singhal, Jaladh; Sinha, Manodeep; Sipocz, Brigitta M.; Spitler, Lee R.; Stansby, David; Streicher, Ole; Sumak, Jani; Swinbank, John D.; Taranu, Dan S.; Tewary, Nikita; Tremblay, Grant R.; De Val-Borro, Miguel; Vasovic, Zlatan; Van Kooten, Samuel J.; Verma, Shresth; Cardoso, Jose Vinicius de Miranda; Williams, Peter K. G.; Wilson, Tom J.; Winkel, Benjamin; Wood-Vasey, W. M.; Xue, Rui; Yoachim, Peter; Zhang, Chen; Zonca, Andrea; Astropy Project Contributors; TARDIS Collaboration; Astropy Coordination Comm.--This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted reuse, distribution, and reproduction in any medium, provided the original work is properly cited."} | ||||
| 65 | +{"work_id": 2114444139, "title": "Innovation and Change in the Information Systems Curriculum of an Australian University:a Socio-Technical Perspective", "abstract": "Information Systems is a relatively new curriculum area and one that is still growing in size and importance. It involves applied studies that are concerned with the ways people build and use computer -based systems in their organisations to produce useful information. Information Systems is, of necessity, a socio-technical discipline that has to deal with issues involving both people and machines; with the multitude of human and non -human entities that comprise an information system.This thesis reports an investigation of how Information Systems curriculum is made and how the choices of individual lecturers or groups of lecturers to adopt or ignore a new concept or technology are formed. It addresses this issue by describing a study into how the programming language Visual Basic entered the Information Systems curriculum of an Australian university, and how it has retained its place there despite challenges from other programming languages. It is a study of curriculum innovation that involves an important but small change in the curriculum of a single department in a particular university.Little of the literature on innovation deals with university curriculum and most reported work is focussed on research, development and diffusion studies of the adoption, or otherwise, of centrally developed curriculum innovations in primary and secondary schools. The innovation described here is of a different order being developed initially by a single university lecturer in one of the subjects for which he had responsibility. It is important primarily because it examines something that does not appear to have been reported on before: the negotiations and alliances that allow new material, in this case the programming language Visual Basic, to enter individual subjects of a university curriculum, and to obtain a durable place there.The research investigates a single instance of innovation, and traces the associations between various human and non -human entities including Visual Basic, the university, the student laboratories, the Course Advisory Committee and the academic staff that made this happen. It follows the formation of alliances and complex networks of association, and how their interplay resulted in the curriculum change that allowed Visual Basic to enter the Information Systems curriculum, and to fend off challenges from other programming languages in order to retain its place there.I argue that in this curriculum innovation no pre -planned path was followed, and that representations of events like this as straightforward or well planned hide the complexity of what took place. The study reveals the complex set of negotiations and compromises made by both human and non -human actors in allowing Visual Basic to enter the curriculum.The study draws on the sociology of translations, more commonly known as actor-network theory (ANT) as a framework for its analysis. I show that innovation translation can be used to advantage to trace the progress of technological innovations such as this. My analysis maps the progress of Visual Basic from novelty to 'obvious choice' in this university's Information Systems curriculum."} | ||||
| 66 | +{"work_id": 2171139698, "title": "Test data generation: two evolutionary approaches to mutation testing", "abstract": "To my friends and supervisors,"} | ||||
| 67 | +{"work_id": 2505871501, "title": "2 UML - Unified Modeling Language", "abstract": "Este es un tema de referencia y consulta. En \u00e9l se presentan las diferentes vistas del Lenguaje Unificado de Modelado UML: Vista est\u00e1tica, Vista de gesti\u00f3n del modelo, Vista de casos de uso, Vista de interacci\u00f3n, Vista de actividad, Vista de m\u00e1quina de estados, Vista de dise\u00f1o, Vista de despliegue. Es un contenido de referencia com\u00fan a las asignaturas Ingenier\u00eda de Software I e Ingenier\u00eda de Software II. En el caso de Ingenier\u00eda de Software I se pone el \u00e9nfasis en la Vista est\u00e1tica, la Vista de casos de uso y la Vista de interacci\u00f3n. Curso 2023-2024"} | ||||
| 68 | +{"work_id": 4403223258, "title": "WhiteFox: White-Box Compiler Fuzzing Empowered by Large Language Models", "abstract": "Compiler correctness is crucial, as miscompilation can falsify program behaviors, leading to serious consequences over the software supply chain. In the literature, fuzzing has been extensively studied to uncover compiler defects. However, compiler fuzzing remains challenging: Existing arts focus on black- and grey-box fuzzing, which generates test programs without sufficient understanding of internal compiler behaviors. As such, they often fail to construct test programs to exercise intricate optimizations. Meanwhile, traditional white-box techniques, such as symbolic execution, are computationally inapplicable to the giant codebase of compiler systems. Recent advances demonstrate that Large Language Models (LLMs) excel in code generation/understanding tasks and even have achieved state-of-the-art performance in black-box fuzzing. Nonetheless, guiding LLMs with compiler source-code information remains a missing piece of research in compiler testing. To this end, we propose W hite F ox , the first white-box compiler fuzzer using LLMs with source-code information to test compiler optimization, with a spotlight on detecting deep logic bugs in the emerging deep learning (DL) compilers. W hite F ox adopts a multi-agent framework: (i) an LLM-based analysis agent examines the low-level optimization source code and produces requirements on the high-level test programs that can trigger the optimization; (ii) an LLM-based generation agent produces test programs based on the summarized requirements. Additionally, optimization-triggering tests are also used as feedback to further enhance the test generation prompt on the fly. Our evaluation on the three most popular DL compilers ( i.e ., PyTorch Inductor, TensorFlow-XLA, and TensorFlow Lite) shows that W hite F ox can generate high-quality test programs to exercise deep optimizations requiring intricate conditions, practicing up to 8 times more optimizations than state-of-the-art fuzzers. To date, W hite F ox has found in total 101 bugs for the compilers under test, with 92 confirmed as previously unknown and 70 already fixed. Notably, W hite F ox has been recently acknowledged by the PyTorch team, and is in the process of being incorporated into its development workflow. Finally, beyond DL compilers, W hite F ox can also be adapted for compilers in different domains, such as LLVM, where WHiteFox has already found multiple bugs."} | ||||
| 69 | +{"work_id": 2921681895, "title": "Parameter synthesis in Markov models", "abstract": "Markov models comprise states with probabilistic transitions. The analysis of these models is ubiquitous and studied in, among others, reliability engineering, artificial intelligence, systems biology, and formal methods. Naturally, their analysis crucially depends on the transition probabilities. Often, these probabilities are approximations based on data or reflect configurable parts of a modelled system. To represent the uncertainty about the probabilities, we study parametric Markov models, in which the probabilities are symbolic expressions rather than concrete values. More precisely, we consider parametric Markov decision processes (pMDPs) and parametric Markov chains (pMCs) as special case. Substitution of the parameters yields classical, parameter-free Markov decision processes (MDPs) and Markov chains (MCs).A pMDP thus induces uncountably many MDPs. Each MDP may satisfy reachability and reward properties, such as \"the maximal probability that the system reaches an `offline' state is less than 0.01%\", or \"the maximal expected energy consumption is less than 20 kWh. \"Lifting these properties to pMDPs yields fundamental problems asking: - \"Is there an induced MDP satisfying the property?\" (feasibility), its dual - \"Do all induced MDPs satisfy the property?\" (validity), and advanced problems such as \"What is a concise representation for all induced MCs satisfying the property?\" We study these problems on a conceptual level, and design and implement both improved and novel algorithms. On the conceptual side, a thorough discussion of the feasibility problem yields new results, such as: (1) that answering various variants of the feasibility problem is \u2014 in terms of complexity \u2014 as hard as finding roots of a multivariate polynomial, and (2) that these problems are tightly connected to the analysis of memoryless strategies in partially observable MDPs, a famous model in artificial intelligence. Additionally, we introduce family MCs (fMCs), a subclass of pMCs with finitely many induced MCs. Among others, fMCs define fundamental problems underlying the quantitative analysis of software product lines and sketching of probabilistic programs. On the algorithmic side, (1) we present and analyse improved but previously known approaches, and combine them to meet practical needs. Their analysis inspired (2) three new and orthogonal approaches, utilising advances in convex optimisation, as well as adapting prominent ideas such as inductive synthesis and abstraction-refinement to the particular setting. All methods efficiently exploit advances in the off-the-shelf analysis of MDPs. On the empirical side, the new methods improve the state-of-the-art considerably, handling hundreds of parameters and millions of states. All the approaches we present have been implemented in open-source tools."} | ||||
| 70 | +{"work_id": 1498342204, "title": "An Introduction to Input/Output Automata", "abstract": "We describe the input/output automaton model, a model for concurrent and distributed discrete event systems. We define the model, illustrate the model with several examples concerning vending machines and a leader election algorithm, and survey the ways in which the model has been used. 1 , 2"} | ||||
| 71 | +{"work_id": 2884622219, "title": "The value of universally available raw NMR data for transparency, reproducibility, and integrity in natural product research", "abstract": "Covering: up to 2018With contributions from the global natural product (NP) research community, and continuing the Raw Data Initiative, this review collects a comprehensive demonstration of the immense scientific value of disseminating raw nuclear magnetic resonance (NMR) data, independently of, and in parallel with, classical publishing outlets. A comprehensive compilation of historic to present-day cases as well as contemporary and future applications show that addressing the urgent need for a repository of publicly accessible raw NMR data has the potential to transform natural products (NPs) and associated fields of chemical and biomedical research. The call for advancing open sharing mechanisms for raw data is intended to enhance the transparency of experimental protocols, augment the reproducibility of reported outcomes, including biological studies, become a regular component of responsible research, and thereby enrich the integrity of NP research and related fields."} | ||||
| 72 | +{"work_id": 3023977240, "title": "From constraint programming to heterogeneous parallelism", "abstract": "The scaling limitations of multi-core processor development have led to a diversification of the processor cores used within individual computers. Heterogeneous computing has become widespread, involving the cooperation of several structurally different processor cores. Central processor (CPU) cores are most frequently complemented with graphics processors (GPUs), which despite their name are suitable for many highly parallel computations besides computer graphics. Furthermore, deep learning accelerators are rapidly gaining relevance. Many applications could profit from heterogeneous computing but are held back by the surrounding software ecosystems. Heterogeneous systems are a challenge for compilers in particular, which usually target only the increasingly marginalised homogeneous CPU cores. Therefore, heterogeneous acceleration is primarily accessible via libraries and domain-specific languages (DSLs), requiring application rewrites and resulting in vendor lock-in. This thesis presents a compiler method for automatically targeting heterogeneous hardware from existing sequential C/C++ source code. A new constraint programming method enables the declarative specification and automatic detection of computational idioms within compiler intermediate representation code. Examples of computational idioms are stencils, reductions, and linear algebra. Computational idioms denote algorithmic structures that commonly occur in performance-critical loops. Consequently, well-designed accelerator DSLs and libraries support computational idioms with their programming models and function interfaces. The detection of computational idioms in their middle end enables compilers to incorporate DSL and library backends for code generation. These backends leverage domain knowledge for the efficient utilisation of heterogeneous hardware. The constraint programming methodology is first derived on an abstract model and then implemented as an extension to LLVM. Two constraint programming languages are designed to target this implementation: the Compiler Analysis Description Language (CAnDL), and the extended Idiom Detection Language (IDL). These languages are evaluated on a range of different compiler problems, culminating in a complete heterogeneous acceleration pipeline integrated with the Clang C/C++ compiler. This pipeline was evaluated on the established benchmark collections NPB and Parboil. The approach was applicable to 10 of the benchmark programs, resulting in significant speedups from 1.26\u00d7 on \u201chisto\u201d to 275\u00d7 on \u201csgemm\u201d when starting from sequential baseline versions. In summary, this thesis shows that the automatic recognition of computational idioms during compilation enables the heterogeneous acceleration of sequential C/C++ programs. Moreover, the declarative specification of computational idioms is derived in novel declarative programming languages, and it is demonstrated that constraint programming on Single Static Assignment intermediate code is a suitable method for their automatic detection."} | ||||
| 73 | +{"work_id": 149631060, "title": "Decidability Issues for Petri Nets -- a survey", "abstract": "We survey 25 years of research on decidability issues for Petri nets. We collect results on the decidability of important properties, equivalence notions, and temporal logics."} | ||||
| 74 | +{"work_id": 2790202156, "title": "ZEUS: Analyzing Safety of Smart Contracts", "abstract": "A smart contract is hard to patch for bugs once it is deployed, irrespective of the money it holds.A recent bug caused losses worth around $50 million of cryptocurrency.We present ZEUS-a framework to verify the correctness and validate the fairness of smart contracts.We consider correctness as adherence to safe programming practices, while fairness is adherence to agreed upon higher-level business logic.ZEUS leverages both abstract interpretation and symbolic model checking, along with the power of constrained horn clauses to quickly verify contracts for safety.We have built a prototype of ZEUS for Ethereum and Fabric blockchain platforms, and evaluated it with over 22.4K smart contracts.Our evaluation indicates that about 94.6% of contracts (containing cryptocurrency worth more than $0.5 billion) are vulnerable.ZEUS is sound with zero false negatives and has a low false positive rate, with an order of magnitude improvement in analysis time as compared to prior art.1 Oyente is under active development and future releases could add more features and reduce the false alarms."} | ||||
| 75 | +{"work_id": 4381982883, "title": "ChatGPT for Education and Research: Opportunities, Threats, and Strategies", "abstract": "In recent years, the rise of advanced artificial intelligence technologies has had a profound impact on many fields, including education and research. One such technology is ChatGPT, a powerful large language model developed by OpenAI. This technology offers exciting opportunities for students and educators, including personalized feedback, increased accessibility, interactive conversations, lesson preparation, evaluation, and new ways to teach complex concepts. However, ChatGPT poses different threats to the traditional education and research system, including the possibility of cheating on online exams, human-like text generation, diminished critical thinking skills, and difficulties in evaluating information generated by ChatGPT. This study explores the potential opportunities and threats that ChatGPT poses to overall education from the perspective of students and educators. Furthermore, for programming learning, we explore how ChatGPT helps students improve their programming skills. To demonstrate this, we conducted different coding-related experiments with ChatGPT, including code generation from problem descriptions, pseudocode generation of algorithms from texts, and code correction. The generated codes are validated with an online judge system to evaluate their accuracy. In addition, we conducted several surveys with students and teachers to find out how ChatGPT supports programming learning and teaching. Finally, we present the survey results and analysis."} | ||||
| 76 | +{"work_id": 3103225940, "title": "An LLVM backend for the Open Modelica Compiler", "abstract": "This thesis presents the construction and evaluation of an LLVM based codegenerator, an LLVM backend. The introduction of an LLVM based backend into the OpenModelica compiler was done to examine the advantages and disadvantages of compiling Modelica and MetaModelica to LLVM IR instead of C. To answer this question, the LLVM backend was compared against the existing interpreter and C code generator using four different schemes with corresponding cases. This comparison was made both for both optimised and unoptimised code. From the experiments, it was concluded that an LLVM backend can be used to improve runtime and compile time performance in the OpenModelica Interactive environment."} | ||||
| 77 | +{"work_id": 7151510318, "title": "Unsupervised Translation of Programming Languages", "abstract": "Traduction Non Supervis\u00e9e de Langages de Programmation Un transcompilateur est un syst\u00e8me qui convertit le code source d'un langage de programmation de haut niveau (tel que C++ ou Python) vers un autre. Les transcompilateurs sont principalement utilis\u00e9s pour l'interop\u00e9rabilit\u00e9 et pour transf\u00e9rer des bases de code \u00e9crites dans un langage obsol\u00e8te (par exemple COBOL ou Python2) vers un langage plus moderne. Ils reposent g\u00e9n\u00e9ralement sur des r\u00e8gles de r\u00e9\u00e9criture manuelles, appliqu\u00e9es \u00e0 l'arbre de syntaxe abstraite du code source. Malheureusement, les traductions qui en r\u00e9sultent manquent souvent de lisibilit\u00e9, ne respectent pas les conventions du langage cible et n\u00e9cessitent des modifications manuelles pour fonctionner correctement. Le processus global de traduction prend du temps et n\u00e9cessite une expertise \u00e0 la fois dans les langages source et cible, ce qui rend les projets de traduction de code co\u00fbteux. Bien que les mod\u00e8les neuronaux surpassent consid\u00e9rablement leurs homologues bas\u00e9s sur des r\u00e8gles dans le cadre de la traduction en langues naturelles, leurs applications \u00e0 la transcompilation ont \u00e9t\u00e9 limit\u00e9es en raison de la raret\u00e9 des donn\u00e9es parall\u00e8les dans ce domaine. Nous proposons des m\u00e9thodes pour entra\u00eener des transcompilateurs neuronaux efficaces sans donn\u00e9es supervis\u00e9es. Les traducteurs de langues naturelles sont \u00e9valu\u00e9s avec des m\u00e9triques bas\u00e9es sur la cooccurrence de tokens entre la traduction et la r\u00e9f\u00e9rence. Nous remarquons que ces m\u00e9triques ne capturent pas la s\u00e9mantique des langages de programmation. Nous construisons et publions donc une base de donn\u00e9es de tests compos\u00e9e de 852 fonctions parall\u00e8les, ainsi que de tests unitaires pour v\u00e9rifier l'exactitude s\u00e9mantique des traductions. Nous exploitons d'abord les objectifs con\u00e7us pour les langues naturelles afin d'apprendre des repr\u00e9sentations multilingues du code source, et entra\u00eenons un mod\u00e8le \u00e0 traduire, en utilisant seulement le code monolingue de projets open source GitHub. Ce mod\u00e8le surpasse les m\u00e9thodes bas\u00e9es sur des r\u00e8gles pour la traduction de fonctions entre C++, Java et Python. Ensuite, nous d\u00e9veloppons une m\u00e9thode de pr\u00e9-entra\u00eenement, amenant le mod\u00e8le \u00e0 apprendre des repr\u00e9sentations s\u00e9mantiques du code. Cela conduit \u00e0 des performances am\u00e9lior\u00e9es sur plusieurs t\u00e2ches, y compris la traduction de code non supervis\u00e9e. Enfin, nous utilisons des tests unitaires automatis\u00e9s pour cr\u00e9er des exemples de traductions de programmes. Entra\u00eener un mod\u00e8le sur ces exemples conduit \u00e0 des am\u00e9liorations significatives des performances de nos transcompilateurs neuronaux. Nos m\u00e9thodes reposent exclusivement sur du code source monolingue, ne n\u00e9cessitent aucune expertise dans les langues source ou cible, et peuvent facilement \u00eatre g\u00e9n\u00e9ralis\u00e9es \u00e0 d'autres langages."} | ||||
| 78 | +{"work_id": 6891455501, "title": "Efficient, Expressive, and Verified Temporal Query Evaluation", "abstract": "Runtime monitoring (or runtime verification) is an approach to checking compliance of a system\u2019s execution with a specification (e.g., a temporal query). The system\u2019s execution is logged into a trace\u2014a sequence of time-points, each consisting of a time-stamp and observed events. A monitor is an algorithm that produces verdicts on the satisfaction of a temporal query on a trace. This thesis develops new monitoring algorithms for expressive temporal query languages that are more time- and space-efficient than the state-of-the-art and produce detailed verdicts. An online monitor reads the trace forwards, one time-point after another. An offline monitor processes the time-points in an arbitrary order. We propose a novel paradigm\u2014multi-head monitoring\u2014that fills a middle-ground between online and offline monitoring. A multi-head monitor uses multiple reading heads that read the trace forwards. We develop multi-head monitors for metric temporal logic (MTL) and metric dynamic logic (MDL). Our monitors improve upon the state-of-the-art by optimizing the time and space complexity while producing a sequence of Boolean verdicts denoting the temporal query\u2019s satisfaction at every time-point. We have implemented our monitors, empirically confirmed that their performance improves upon existing approaches, and formally verified the correctness of our monitors using the Isabelle/HOL proof assistant. MTL and MDL events cannot have parameters and queries cannot contain variables. Metric first-order temporal logic (MFOTL) generalizes MTL with parametric events and first-order variables ranging over an arbitrary domain. Hence, a monitor evaluates an MFOTL query at every time-point to a relation representing the valuations of the free variables satisfying the query. An online monitor for MFOTL had been developed in previous work and later formally verified using Isabelle/HOL. The formally verified monitor is called VeriMon. In this thesis, we optimize the time complexity of evaluating VeriMon\u2019s Since and Until temporal operators. Query evaluation for a proper subset of MFOTL queries can be efficiently implemented using relational algebra operations. Alternatively, an arbitrary MFOTL query can be evaluated using structures that represent arbitrary relations satisfying the subqueries of the query, e.g., automatic structures or binary decision diagrams. However, these alternative representations have a negative impact on the performance of the resulting monitor. Hence, in this thesis we use relational algebra operations to evaluate an arbitrary MFOTL query. We first investigate the case of relational calculus (RC), i.e., MFOTL without temporal operators. We develop a novel approach to RC query evaluation by translating an arbitrary RC query into a pair of relational algebra normal form (RANF) queries that can be evaluated using relational algbra operations on finite tables: one characterizes the original query\u2019s relative safety (i.e., whether it evaluates to a finite relation) and the other one is equivalent to the original query if the original query is relatively safe. We implement our translation and empirically confirm that the performance of evaluating the queries produced by our translation improves upon existing approaches to RC query evaluation. Finally, we generalize our translation of RC queries to MFOTL queries. This way, we obtain a monitor for an arbitrary MFOTL query that decides for every time-point if it evaluates to a finite relation and computes the relation if it is finite."} | ||||
| 79 | +{"work_id": 3115704172, "title": "Lineage-driven Fault Injection for Actor-based Programs", "abstract": "Lineage-driven fault injection (LDFI) is an approach for finding bugs or faults in distributed systems. Its current state-of-the-art implementation, Molly, takes programs written in the logic programming language Dedalus as its input. The problem is that Dedalus is a small and obscure language, used to serve as a proof of concept for Molly. Thus, the objective of this thesis is to extend and adapt Molly to a general-purpose, object-oriented language where distributed programs are written using the actor-based framework Akka. This thesis presents a novel concept for employing lineage-driven fault injection for actor-based programs in addition to implementing said concept to analyze existing Akka programs. The results show that the lineage-driven fault injector for Akka programs, ldfi-akka, is capable of successfully pinpointing the weaknesses of the programs that can be analyzed in a feasible amount of time. However, ldfi-akka struggles to analyze larger and complex programs as the underlying SAT-solver used is overwhelmed. The correctness of the analysis made by ldfi-akka is partially based on the subject programs\u2019 ability to a) be rewritten in such a way that logging can be added and b) exhibit deterministic behavior across multiple runs. Conclusively, this study presents a novel approach to employ lineage-driven fault injection on actor-based programs and ldfi-akka, an implementation of LDFI on Akka programs."} | ||||
| 80 | +{"work_id": 2890660842, "title": "Efficient Formal Safety Analysis of Neural Networks", "abstract": "Neural networks are increasingly deployed in real-world safety-critical domains such as autonomous driving, aircraft collision avoidance, and malware detection. However, these networks have been shown to often mispredict on inputs with minor adversarial or even accidental perturbations. Consequences of such errors can be disastrous and even potentially fatal as shown by the recent Tesla autopilot crash. Thus, there is an urgent need for formal analysis systems that can rigorously check neural networks for violations of different safety properties such as robustness against adversarial perturbations within a certain $L$-norm of a given image. An effective safety analysis system for a neural network must be able to either ensure that a safety property is satisfied by the network or find a counterexample, i.e., an input for which the network will violate the property. Unfortunately, most existing techniques for performing such analysis struggle to scale beyond very small networks and the ones that can scale to larger networks suffer from high false positives and cannot produce concrete counterexamples in case of a property violation. In this paper, we present a new efficient approach for rigorously checking different safety properties of neural networks that significantly outperforms existing approaches by multiple orders of magnitude. Our approach can check different safety properties and find concrete counterexamples for networks that are 10$\\times$ larger than the ones supported by existing analysis techniques. We believe that our approach to estimating tight output bounds of a network for a given input range can also help improve the explainability of neural networks and guide the training process of more robust neural networks."} | ||||
| 78 | {"work_id": 4313894866, "title": "The Science of Literature Reviews: Searching, Identifying, Selecting, and Synthesising", "abstract": "The ability to conduct an explicit and robust literature review by students, scholars or scientists is critical in producing excellent journal articles, academic theses, academic dissertations or working papers. A literature review is an evaluation of existing research works on a specific academic topic, theme or subject to identify gaps and propose future research agenda. Many postgraduate students in higher education institutions lack the necessary skills and understanding to conduct in-depth literature reviews. This may lead to the presentation of incorrect, false or biased inferences in their theses or dissertations. This study offers scientific knowledge on how literature reviews in different fields of study could be conducted to mitigate against biased inferences such as unscientific analogies and baseless recommendations. The literature review is presented as a process that involves several activities including searching, identifying, reading, summarising, compiling, analysing, interpreting and referencing. We hope this article serves as reference material to improve the academic rigour in the literature review chapters of postgraduate students\u2019 theses or dissertations. This article prompts established scholars to explore more innovative ways through which scientific literature reviews can be conducted to identify gaps (empirical, knowledge, theoretical, methodological, application and population gap) and propose a future research agenda."} | 81 | {"work_id": 4313894866, "title": "The Science of Literature Reviews: Searching, Identifying, Selecting, and Synthesising", "abstract": "The ability to conduct an explicit and robust literature review by students, scholars or scientists is critical in producing excellent journal articles, academic theses, academic dissertations or working papers. A literature review is an evaluation of existing research works on a specific academic topic, theme or subject to identify gaps and propose future research agenda. Many postgraduate students in higher education institutions lack the necessary skills and understanding to conduct in-depth literature reviews. This may lead to the presentation of incorrect, false or biased inferences in their theses or dissertations. This study offers scientific knowledge on how literature reviews in different fields of study could be conducted to mitigate against biased inferences such as unscientific analogies and baseless recommendations. The literature review is presented as a process that involves several activities including searching, identifying, reading, summarising, compiling, analysing, interpreting and referencing. We hope this article serves as reference material to improve the academic rigour in the literature review chapters of postgraduate students\u2019 theses or dissertations. This article prompts established scholars to explore more innovative ways through which scientific literature reviews can be conducted to identify gaps (empirical, knowledge, theoretical, methodological, application and population gap) and propose a future research agenda."} | ||
| 79 | {"work_id": 4410362977, "title": "Emergence of Calabi\u2013Yau manifolds in high-precision black-hole scattering", "abstract": "Abstract When two massive objects (black holes, neutron stars or stars) in our universe fly past each other, their gravitational interactions deflect their trajectories 1,2 . The gravitational waves emitted in the related bound-orbit system\u2014the binary inspiral\u2014are now routinely detected by gravitational-wave observatories 3 . Theoretical physics needs to provide high-precision templates to make use of unprecedented sensitivity and precision of the data from upcoming gravitational-wave observatories 4 . Motivated by this challenge, several analytical and numerical techniques have been developed to approximately solve this gravitational two-body problem. Although numerical relativity is accurate 5\u20137 , it is too time-consuming to rapidly produce large numbers of gravitational-wave templates. For this, approximate analytical results are also required 8\u201315 . Here we report on a new, highest-precision analytical result for the scattering angle, radiated energy and recoil of a black hole or neutron star scattering encounter at the fifth order in Newton\u2019s gravitational coupling G , assuming a hierarchy in the two masses. This is achieved by modifying state-of-the-art techniques for the scattering of elementary particles in colliders to this classical physics problem in our universe. Our results show that mathematical functions related to Calabi\u2013Yau (CY) manifolds, 2 n -dimensional generalizations of tori, appear in the solution to the radiated energy in these scatterings. We anticipate that our analytical results will allow the development of a new generation of gravitational-wave models, for which the transition to the bound-state problem through analytic continuation and strong-field resummation will need to be performed."} | 82 | {"work_id": 4410362977, "title": "Emergence of Calabi\u2013Yau manifolds in high-precision black-hole scattering", "abstract": "Abstract When two massive objects (black holes, neutron stars or stars) in our universe fly past each other, their gravitational interactions deflect their trajectories 1,2 . The gravitational waves emitted in the related bound-orbit system\u2014the binary inspiral\u2014are now routinely detected by gravitational-wave observatories 3 . Theoretical physics needs to provide high-precision templates to make use of unprecedented sensitivity and precision of the data from upcoming gravitational-wave observatories 4 . Motivated by this challenge, several analytical and numerical techniques have been developed to approximately solve this gravitational two-body problem. Although numerical relativity is accurate 5\u20137 , it is too time-consuming to rapidly produce large numbers of gravitational-wave templates. For this, approximate analytical results are also required 8\u201315 . Here we report on a new, highest-precision analytical result for the scattering angle, radiated energy and recoil of a black hole or neutron star scattering encounter at the fifth order in Newton\u2019s gravitational coupling G , assuming a hierarchy in the two masses. This is achieved by modifying state-of-the-art techniques for the scattering of elementary particles in colliders to this classical physics problem in our universe. Our results show that mathematical functions related to Calabi\u2013Yau (CY) manifolds, 2 n -dimensional generalizations of tori, appear in the solution to the radiated energy in these scatterings. We anticipate that our analytical results will allow the development of a new generation of gravitational-wave models, for which the transition to the bound-state problem through analytic continuation and strong-field resummation will need to be performed."} | ||
| 80 | {"work_id": 2789444712, "title": "Industry 4.0: state of the art and future trends", "abstract": "Rapid advances in industrialisation and informatisation methods have spurred tremendous progress in developing the next generation of manufacturing technology. Today, we are on the cusp of the Fourth Industrial Revolution. In 2013, amongst one of 10 \u2018Future Projects\u2019 identified by the German government as part of its High-Tech Strategy 2020 Action Plan, the Industry 4.0 project is considered to be a major endeavour for Germany to establish itself as a leader of integrated industry. In 2014, China\u2019s State Council unveiled their ten-year national plan, Made-in-China 2025, which was designed to transform China from the world\u2019s workshop into a world manufacturing power. Made-in-China 2025 is an initiative to comprehensively upgrade China\u2019s industry including the manufacturing sector. In Industry 4.0 and Made-in-China 2025, many applications require a combination of recently emerging new technologies, which is giving rise to the emergence of Industry 4.0. Such technologies originate from different disciplines including cyber-physical Systems, IoT, cloud computing, Industrial Integration, Enterprise Architecture, SOA, Business Process Management, Industrial Information Integration and others. At this present moment, the lack of powerful tools still poses a major obstacle for exploiting the full potential of Industry 4.0. In particular, formal methods and systems methods are crucial for realising Industry 4.0, which poses unique challenges. In this paper, we briefly survey the state of the art in the area of Industry 4.0 as it relates to industries."} | 83 | {"work_id": 2789444712, "title": "Industry 4.0: state of the art and future trends", "abstract": "Rapid advances in industrialisation and informatisation methods have spurred tremendous progress in developing the next generation of manufacturing technology. Today, we are on the cusp of the Fourth Industrial Revolution. In 2013, amongst one of 10 \u2018Future Projects\u2019 identified by the German government as part of its High-Tech Strategy 2020 Action Plan, the Industry 4.0 project is considered to be a major endeavour for Germany to establish itself as a leader of integrated industry. In 2014, China\u2019s State Council unveiled their ten-year national plan, Made-in-China 2025, which was designed to transform China from the world\u2019s workshop into a world manufacturing power. Made-in-China 2025 is an initiative to comprehensively upgrade China\u2019s industry including the manufacturing sector. In Industry 4.0 and Made-in-China 2025, many applications require a combination of recently emerging new technologies, which is giving rise to the emergence of Industry 4.0. Such technologies originate from different disciplines including cyber-physical Systems, IoT, cloud computing, Industrial Integration, Enterprise Architecture, SOA, Business Process Management, Industrial Information Integration and others. At this present moment, the lack of powerful tools still poses a major obstacle for exploiting the full potential of Industry 4.0. In particular, formal methods and systems methods are crucial for realising Industry 4.0, which poses unique challenges. In this paper, we briefly survey the state of the art in the area of Industry 4.0 as it relates to industries."} | ||
| 81 | {"work_id": 4408711372, "title": "A Progressive Polyhedral Approximation Method for Nonlinear PDE-Constrained Electricity-Water Nexus Dispatch", "abstract": "This letter proposes an efficient progressive polyhedral approximation (PA) method to tackle the high nonlinearity and nonconvexity of optimal electricity-water nexus (EWN) dispatch caused by hyperbolic nonlinear partial differential equations (HNPDEs). In this method, the HNPDE-constrained EWN dispatch model can be reformulated into a tractable mixedinteger linear programming (MILP) problem by tailored adaptive discretization and piecewise PA. Furthermore, a progressive approximation refinement technique is developed to dynamically strengthen the MILP for efficient convergence to a near-optimal solution. Comparative studies have validated the effectiveness of the proposed method in reducing decision-making time for the EWN dispatch."} | 84 | {"work_id": 4408711372, "title": "A Progressive Polyhedral Approximation Method for Nonlinear PDE-Constrained Electricity-Water Nexus Dispatch", "abstract": "This letter proposes an efficient progressive polyhedral approximation (PA) method to tackle the high nonlinearity and nonconvexity of optimal electricity-water nexus (EWN) dispatch caused by hyperbolic nonlinear partial differential equations (HNPDEs). In this method, the HNPDE-constrained EWN dispatch model can be reformulated into a tractable mixedinteger linear programming (MILP) problem by tailored adaptive discretization and piecewise PA. Furthermore, a progressive approximation refinement technique is developed to dynamically strengthen the MILP for efficient convergence to a near-optimal solution. Comparative studies have validated the effectiveness of the proposed method in reducing decision-making time for the EWN dispatch."} | ||
| 82 | {"work_id": 4406882143, "title": "Beyond the current state of just-in-time adaptive interventions in mental health: a qualitative systematic review", "abstract": "Background: Just-In-Time Adaptive Interventions (JITAIs) are interventions designed to deliver timely tailored support by adjusting to changes in users' internal states and external contexts. To accomplish this, JITAIs often apply complex analytic techniques, such as machine learning or Bayesian algorithms to real- or near-time data acquired from smartphones and other sensors. Given the idiosyncratic, dynamic, and context dependent nature of mental health symptoms, JITAIs hold promise for mental health. However, the development of JITAIs is still in the early stages and is complex due to the multifactorial nature of JITAIs. Considering this complexity, Nahum-Shani et al. developed a conceptual framework for developing and testing JITAIs for health-related problems. This review evaluates the current state of JITAIs in the field of mental health including their alignment with Nahum-Shani et al.'s framework. Methods: Nine databases were systematically searched in August 2023. Protocol or empirical studies self-identifying their intervention as a \"JITAI\" targeting mental health were included in the qualitative synthesis if they were published in peer-reviewed journals and written in English. Results: Of the 1,419 records initially screened, 9 papers reporting on 5 JITAIs were included (sample size range: 5 to an expected 264). Two JITAIs were for bulimia nervosa, one for depression, one for insomnia, and one for maternal prenatal stress. Although most core components of Nahum-Shani's et al.'s framework were incorporated in the JITAIs, essential elements (e.g., adaptivity and receptivity) within the core components were missing and the core components were only partly substantiated by empirical evidence (e.g., interventions were supported, but the decision rules and points were not). Complex analytical techniques such as data from passive monitoring of individuals' states and contexts were hardly used. Regarding the current state of studies, initial findings on usability, feasibility, and effectiveness appear positive. Conclusions: JITAIs for mental health are still in their early stages of development, with opportunities for improvement in both development and testing. For future development, it is recommended that developers utilize complex analytical techniques that can handle real-or near-time data such as machine learning, passive monitoring, and conduct further research into empirical-based decision rules and points for optimization in terms of enhanced effectiveness and user-engagement."} | 85 | {"work_id": 4406882143, "title": "Beyond the current state of just-in-time adaptive interventions in mental health: a qualitative systematic review", "abstract": "Background: Just-In-Time Adaptive Interventions (JITAIs) are interventions designed to deliver timely tailored support by adjusting to changes in users' internal states and external contexts. To accomplish this, JITAIs often apply complex analytic techniques, such as machine learning or Bayesian algorithms to real- or near-time data acquired from smartphones and other sensors. Given the idiosyncratic, dynamic, and context dependent nature of mental health symptoms, JITAIs hold promise for mental health. However, the development of JITAIs is still in the early stages and is complex due to the multifactorial nature of JITAIs. Considering this complexity, Nahum-Shani et al. developed a conceptual framework for developing and testing JITAIs for health-related problems. This review evaluates the current state of JITAIs in the field of mental health including their alignment with Nahum-Shani et al.'s framework. Methods: Nine databases were systematically searched in August 2023. Protocol or empirical studies self-identifying their intervention as a \"JITAI\" targeting mental health were included in the qualitative synthesis if they were published in peer-reviewed journals and written in English. Results: Of the 1,419 records initially screened, 9 papers reporting on 5 JITAIs were included (sample size range: 5 to an expected 264). Two JITAIs were for bulimia nervosa, one for depression, one for insomnia, and one for maternal prenatal stress. Although most core components of Nahum-Shani's et al.'s framework were incorporated in the JITAIs, essential elements (e.g., adaptivity and receptivity) within the core components were missing and the core components were only partly substantiated by empirical evidence (e.g., interventions were supported, but the decision rules and points were not). Complex analytical techniques such as data from passive monitoring of individuals' states and contexts were hardly used. Regarding the current state of studies, initial findings on usability, feasibility, and effectiveness appear positive. Conclusions: JITAIs for mental health are still in their early stages of development, with opportunities for improvement in both development and testing. For future development, it is recommended that developers utilize complex analytical techniques that can handle real-or near-time data such as machine learning, passive monitoring, and conduct further research into empirical-based decision rules and points for optimization in terms of enhanced effectiveness and user-engagement."} | ||
| 83 | −{"work_id": 7134194765, "title": "A Debris\u2010Flow Hazard Assessment Framework Based on an Improved AHP \u2013 CRITIC Method: A Case Study of Gaoling Gully", "abstract": "ABSTRACT As a sudden and highly destructive geological hazard, debris flows pose significant challenges for hazard assessment. However, such assessments often suffer from sparse data, unclear mechanisms, and limited decision\u2010making transparency, highlighting the need for a synergistic modeling approach that integrates domain knowledge with data\u2010driven methods. To address this need, this study proposes a knowledge\u2013data dual\u2010driven hazard assessment framework. By employing an improved AHP\u2013CRITIC hybrid weighting scheme, it effectively combines expert knowledge with statistical characteristics of multi\u2010source data and incorporates the SHAP model to enhance the interpretability of the decision\u2010making process. Using Gaoling Gully as a case study and integrating field investigations with satellite imagery, 14 evaluation factors were selected from four categories\u2014topography, lithology, hydrology, and land cover. An interpretable single\u2010gully debris\u2010flow hazard assessment framework was developed based on an improved AHP\u2013CRITIC weighting method and the SHAP interpretation model. The AHP\u2013CRITIC approach was used to combine subjective and objective weights to delineate hazard zones under different rainfall return periods (10a, 20a, 50a, and 100a). The assessment results were further validated using FLO\u20102D numerical simulations and ROC curves. The results demonstrate that the AHP\u2013CRITIC method achieves high predictive performance and shows strong agreement with the FLO\u20102D simulation results, indicating a clear physical basis. As rainfall intensity increases, high\u2010hazard zones exhibit a linear expansion along the main gully. The SHAP analysis further reveals that hydrodynamic and source\u2010material conditions play dominant roles in the study area. This integrated assessment framework provides a solid theoretical foundation and technical support for managing single\u2010gully debris\u2010flow hazards."} | ||||
| 84 | {"work_id": 4399087350, "title": "E-learning and the Future of Business Education: The Case of GCC", "abstract": null} | 86 | {"work_id": 4399087350, "title": "E-learning and the Future of Business Education: The Case of GCC", "abstract": null} | ||
| 85 | {"work_id": 2787911489, "title": "Automated Code Generation for Maximizing Performance of Detailed Chemistry Calculations in OpenFOAM", "abstract": null} | 87 | {"work_id": 2787911489, "title": "Automated Code Generation for Maximizing Performance of Detailed Chemistry Calculations in OpenFOAM", "abstract": null} | ||
| 86 | {"work_id": 2796251079, "title": "A Concise Introduction to Logic", "abstract": null} | 88 | {"work_id": 2796251079, "title": "A Concise Introduction to Logic", "abstract": null} | ||
| 87 | {"work_id": 3185223169, "title": "An Effort Estimation Model for Agile Software Development", "abstract": null} | 89 | {"work_id": 3185223169, "title": "An Effort Estimation Model for Agile Software Development", "abstract": null} | ||
| 88 | {"work_id": 2911537985, "title": "Microservices vs. Service-oriented architecture", "abstract": null} | 90 | {"work_id": 2911537985, "title": "Microservices vs. Service-oriented architecture", "abstract": null} | ||
| 89 | {"work_id": 2154148696, "title": "Supervisory Control of Timed Discrete-Event Systems", "abstract": null} | 91 | {"work_id": 2154148696, "title": "Supervisory Control of Timed Discrete-Event Systems", "abstract": null} | ||
| 92 | +{"work_id": 3189874403, "title": "Efficient memory and GPU operations for Tiramisu compiler", "abstract": null} | ||||
| 90 | {"work_id": 2725449579, "title": "Mutation Testing Advances: An Analysis and Survey", "abstract": null} | 93 | {"work_id": 2725449579, "title": "Mutation Testing Advances: An Analysis and Survey", "abstract": null} | ||
| 91 | {"work_id": 4407983386, "title": "Parallel TimesNet-BiLSTM model for ultra-short-term photovoltaic power forecasting using STL decomposition and auto-tuning", "abstract": null} | 94 | {"work_id": 4407983386, "title": "Parallel TimesNet-BiLSTM model for ultra-short-term photovoltaic power forecasting using STL decomposition and auto-tuning", "abstract": null} | ||
| 92 | {"work_id": 4313480275, "title": "Algorithmics: The Spirit of Computing", "abstract": null} | 95 | {"work_id": 4313480275, "title": "Algorithmics: The Spirit of Computing", "abstract": null} | ||
@@ -94,7 +97,4 @@ | |||||
| 94 | {"work_id": 3132279601, "title": "Coping with COVID-19: Higher Education in the GCC Countries", "abstract": null} | 97 | {"work_id": 3132279601, "title": "Coping with COVID-19: Higher Education in the GCC Countries", "abstract": null} | ||
| 95 | {"work_id": 2915211782, "title": "Novice Programmers and Introductory Programming", "abstract": null} | 98 | {"work_id": 2915211782, "title": "Novice Programmers and Introductory Programming", "abstract": null} | ||
| 96 | {"work_id": 4381516741, "title": "The Python Programming Language", "abstract": null} | 99 | {"work_id": 4381516741, "title": "The Python Programming Language", "abstract": null} | ||
| 97 | −{"work_id": 2188794726, "title": "Dynamic Dataflow Graphs", "abstract": null} | ||||
| 98 | {"work_id": 4398768423, "title": "LLM4VV: Developing LLM-driven testsuite for compiler validation", "abstract": null} | 100 | {"work_id": 4398768423, "title": "LLM4VV: Developing LLM-driven testsuite for compiler validation", "abstract": null} | ||
| 99 | −{"work_id": 4206807714, "title": "Handbook of Satisfiability", "abstract": null} | ||||
| 100 | −{"work_id": 1481397690, "title": "Satisfiability Modulo Theories", "abstract": null} | ||||
modified
literature_synthesis/landmarks/software_pl_landmarks.csv
+101 −101
@@ -1,101 +1,101 @@ | |||||
| 1 | −work_id,doi,arxiv_id,title,source_name,year,type,primary_category,n_categories,c12,c36,ncs36,cited_by_count,fwci,has_abstract,is_oa,period,score,set,pi_review | 1 | +work_id,doi,arxiv_id,title,source_name,year,type,primary_category,n_categories,c12,c36,ncs36,cited_by_count,fwci,has_abstract,is_oa,period,ntitle,score,set,pi_review | ||
| 2 | −2964015378,10.4230/lipics.ecoop.2025.6,,Detecting Functionality-Specific Vulnerabilities via Retrieving Individual Functionality-Equivalent APIs in Open-Source Repositories,Leibniz international proceedings in informatics,2025,conference-paper,software_engineering,3,15245.0,15245.0,11583.902021240152,15246,2196.5447,True,True,post,7717.916242571953,landmark,True | 2 | +2964015378,10.4230/lipics.ecoop.2025.6,,Detecting Functionality-Specific Vulnerabilities via Retrieving Individual Functionality-Equivalent APIs in Open-Source Repositories,Leibniz international proceedings in informatics,2025,conference-paper,software_engineering,3,15245.0,15245.0,11583.902021240152,15246,2196.5447,True,True,post,detectingfunctionalityspecificvulnerabilitiesviaretrievingindividualfunctionalityequivalentapisinopensourcerepositories,6661.631548957897,landmark,True | ||
| 3 | −4293846201,10.4230/oasics.saia.2024.1,,On Assessing ML Model Robustness: A Methodological Framework (Academic Track),OASIcs : OpenAccess Series in Informatics,2025,conference-paper,software_engineering,4,4701.0,4701.0,4178.076566446758,4702,904.6849,True,True,post,2379.92287676817,landmark,True | 3 | +4293846201,10.4230/oasics.saia.2024.1,,On Assessing ML Model Robustness: A Methodological Framework (Academic Track),OASIcs : OpenAccess Series in Informatics,2025,conference-paper,software_engineering,4,4701.0,4701.0,4178.076566446758,4702,904.6849,True,True,post,onassessingmlmodelrobustnessamethodologicalframeworkacademictrack,2054.203339563862,landmark,True | ||
| 4 | −2095152777,10.7551/mitpress/12274.003.0035,,Managing the Development of Large Software Systems (1970),The MIT Press eBooks,2021,book-chapter,software_engineering,1,939.0,970.0,750.7662588538313,1778,102.1417,True,False,baseline,750.7662588538313,landmark,True | 4 | +2095152777,10.7551/mitpress/12274.003.0035,,Managing the Development of Large Software Systems (1970),The MIT Press eBooks,2021,book-chapter,software_engineering,1,939.0,970.0,750.7662588538313,1778,102.1417,True,False,baseline,managingthedevelopmentoflargesoftwaresystems1970,750.7662588538313,landmark,True | ||
| 5 | −2911537985,,,Microservices vs. Service-oriented architecture,Aaltodoc (Aalto University),2018,dissertation,software_engineering,2,50.0,67.0,685.3986866791745,93,,False,False,baseline,685.3986866791745,landmark,True | 5 | +2911537985,,,Microservices vs. Service-oriented architecture,Aaltodoc (Aalto University),2018,dissertation,software_engineering,2,50.0,67.0,685.3986866791745,93,,False,False,baseline,microservicesvsserviceorientedarchitecture,685.3986866791745,landmark,True | ||
| 6 | −1486172410,10.1017/9781108974073.004,,Introduction to Software Testing,Cambridge University Press eBooks,2021,book-chapter,software_engineering,1,869.0,871.0,549.1255565449688,1056,136.0795,True,False,baseline,549.1255565449688,landmark,True | 6 | +1486172410,10.1017/9781108974073.004,,Introduction to Software Testing,Cambridge University Press eBooks,2021,book-chapter,software_engineering,1,869.0,871.0,549.1255565449688,1056,136.0795,True,False,baseline,introductiontosoftwaretesting,549.1255565449688,landmark,True | ||
| 7 | −7151510318,10.70675/416f6582z4576z444eza710z5e930d59bf97,,Unsupervised Translation of Programming Languages,,2022,dissertation,software_engineering,3,51.0,56.0,485.7543859649123,1,,True,False,baseline,485.7543859649123,landmark,True | 7 | +7151510318,10.70675/416f6582z4576z444eza710z5e930d59bf97,,Unsupervised Translation of Programming Languages,,2022,dissertation,software_engineering,3,51.0,56.0,485.7543859649123,1,,True,False,baseline,unsupervisedtranslationofprogramminglanguages,485.7543859649123,landmark,True | ||
| 8 | −4391974543,10.1109/tse.2024.3368208,2307.07221,"Software Testing With Large Language Models: Survey, Landscape, and Vision",IEEE Transactions on Software Engineering,2024,article,software_engineering,3,351.0,554.0,439.6107042253521,554,579.8344,True,True,post,439.6107042253521,landmark,True | 8 | +4391974543,10.1109/tse.2024.3368208,2307.07221,"Software Testing With Large Language Models: Survey, Landscape, and Vision",IEEE Transactions on Software Engineering,2024,article,software_engineering,3,351.0,554.0,439.6107042253521,554,579.8344,True,True,post,softwaretestingwithlargelanguagemodelssurveylandscapeandvision,439.6107042253521,landmark,True | ||
| 9 | −3185223169,,,An Effort Estimation Model for Agile Software Development,,2020,dissertation,software_engineering,1,36.0,45.0,423.2192575406032,60,,False,False,baseline,423.2192575406032,landmark,True | 9 | +3185223169,,,An Effort Estimation Model for Agile Software Development,,2020,dissertation,software_engineering,1,36.0,45.0,423.2192575406032,60,,False,False,baseline,aneffortestimationmodelforagilesoftwaredevelopment,423.2192575406032,landmark,True | ||
| 10 | −2171139698,10.22024/unikent/01.02.86353,,Test data generation: two evolutionary approaches to mutation testing,Kent Academic Repository (University of Kent),2021,dissertation,software_engineering,1,19.0,19.0,394.8918918918919,24,,True,True,baseline,394.8918918918919,landmark,True | 10 | +2171139698,10.22024/unikent/01.02.86353,,Test data generation: two evolutionary approaches to mutation testing,Kent Academic Repository (University of Kent),2021,dissertation,software_engineering,1,19.0,19.0,394.8918918918919,24,,True,True,baseline,testdatagenerationtwoevolutionaryapproachestomutationtesting,394.8918918918919,landmark,True | ||
| 11 | −7131867455,10.1287/mnsc.2025.00535,,The Effects of Generative AI on High-Skilled Work: Evidence from Three Field Experiments with Software Developers,Management Science,2026,article,software_engineering,2,97.0,97.0,689.140622972096,25,228.8208,True,False,post,344.8563961944324,landmark,True | 11 | +4402442491,10.5463/thesis.831,,From Smallest Software Particle to System Specification,,2024,dissertation,software_engineering,2,0.0,1.0,304.3333333333333,1,,True,True,post,fromsmallestsoftwareparticletosystemspecification,304.3333333333333,landmark,True | ||
| 12 | −4399452770,10.5753/compbr.2018.38.4541,,Engenharia de Software,Computação Brasil.,2018,article,software_engineering,1,503.0,611.0,323.9504225668329,1342,158.682,True,True,baseline,323.9504225668329,landmark,True | 12 | +4408219312,10.17760/d20705205,,Leveraging type annotations for effective fuzzing of python programs,,2024,dissertation,software_engineering,3,1.0,1.0,304.3333333333333,1,,True,False,post,leveragingtypeannotationsforeffectivefuzzingofpythonprograms,304.3333333333333,landmark,True | ||
| 13 | −4408219312,10.17760/d20705205,,Leveraging type annotations for effective fuzzing of python programs,,2024,dissertation,software_engineering,3,1.0,1.0,304.3333333333333,1,,True,False,post,304.3333333333333,landmark,True | 13 | +4403110951,10.32657/10356/179951,,Semantics-aware human-computer interaction software testing,,2024,dissertation,software_engineering,6,1.0,1.0,304.3333333333333,1,,True,True,post,semanticsawarehumancomputerinteractionsoftwaretesting,304.3333333333333,landmark,True | ||
| 14 | −4402442491,10.5463/thesis.831,,From Smallest Software Particle to System Specification,,2024,dissertation,software_engineering,2,0.0,1.0,304.3333333333333,1,,True,True,post,304.3333333333333,landmark,True | 14 | +3008797115,10.48550/arxiv.2002.12543,2002.12543,Metamorphic Testing: A New Approach for Generating Next Test Cases,arXiv (Cornell University),2020,preprint,software_engineering,1,246.0,292.0,286.17663817663816,448,,True,True,baseline,metamorphictestinganewapproachforgeneratingnexttestcases,286.17663817663816,landmark,True | ||
| 15 | −4403110951,10.32657/10356/179951,,Semantics-aware human-computer interaction software testing,,2024,dissertation,software_engineering,6,1.0,1.0,304.3333333333333,1,,True,True,post,304.3333333333333,landmark,True | 15 | +3177813494,10.4230/lipics.esem.2026.34,2107.03374,A Direction-Aware Study of LLM-Based Code Translation Across Eight Programming Languages,arXiv (Cornell University),2021,preprint,software_engineering,6,127.0,678.0,275.3873466752744,1430,,True,True,baseline,adirectionawarestudyofllmbasedcodetranslationacrosseightprogramminglanguages,275.3873466752744,landmark,True | ||
| 16 | −3008797115,10.48550/arxiv.2002.12543,2002.12543,Metamorphic Testing: A New Approach for Generating Next Test Cases,arXiv (Cornell University),2020,preprint,software_engineering,1,246.0,292.0,286.17663817663816,448,,True,True,baseline,286.17663817663816,landmark,True | 16 | +7131867455,10.1287/mnsc.2025.00535,,The Effects of Generative AI on High-Skilled Work: Evidence from Three Field Experiments with Software Developers,Management Science,2026,article,software_engineering,2,97.0,97.0,689.140622972096,25,228.8208,True,False,post,theeffectsofgenerativeaionhighskilledworkevidencefromthreefieldexperimentswithsoftwaredevelopers,245.94062998251673,landmark,True | ||
| 17 | −3177813494,10.4230/lipics.esem.2026.34,2107.03374,A Direction-Aware Study of LLM-Based Code Translation Across Eight Programming Languages,arXiv (Cornell University),2021,preprint,software_engineering,6,127.0,678.0,275.3873466752744,1430,,True,True,baseline,275.3873466752744,landmark,True | 17 | +7110046239,10.4230/oasics.icpec.2025.4,,Can Open Large Language Models Catch Vulnerabilities?,Repositório do ISCTE-IUL,2025,article,software_engineering,3,540.0,540.0,468.828520182987,1,1.0925,True,True,post,canopenlargelanguagemodelscatchvulnerabilities,235.96464653573398,landmark,True | ||
| 18 | −7110046239,10.4230/oasics.icpec.2025.4,,Can Open Large Language Models Catch Vulnerabilities?,Repositório do ISCTE-IUL,2025,article,software_engineering,3,540.0,540.0,468.828520182987,1,1.0925,True,True,post,273.37978163259135,landmark,True | 18 | +4391677389,10.17771/pucrio.acad.65972,,IDENTIFYING CONCERNS WHEN SPECIFYING MACHINE LEARNING-ENABLED SYSTEMS: A PERSPECTIVE-BASED APPROACH,,2023,dissertation,software_engineering,1,7.0,8.0,230.9189189189189,3,,True,True,post,identifyingconcernswhenspecifyingmachinelearningenabledsystemsaperspectivebasedapproach,230.9189189189189,landmark,True | ||
| 19 | −4391677389,10.17771/pucrio.acad.65972,,IDENTIFYING CONCERNS WHEN SPECIFYING MACHINE LEARNING-ENABLED SYSTEMS: A PERSPECTIVE-BASED APPROACH,,2023,dissertation,software_engineering,1,7.0,8.0,230.9189189189189,3,,True,True,post,230.9189189189189,landmark,True | 19 | +3007157104,10.1109/tse.2019.2962027,1906.10742,"Machine Learning Testing: Survey, Landscapes and Horizons",IEEE Transactions on Software Engineering,2020,article,software_engineering,4,245.0,385.0,227.48310158362304,888,240.8699,True,True,baseline,machinelearningtestingsurveylandscapesandhorizons,227.48310158362304,landmark,True | ||
| 20 | −7124592699,10.1007/s44443-025-00401-y,,MSTDP: a multi-scale temporal deep learning framework for just-in-time software defect prediction with cross-attention fusion,Journal of King Saud University - Computer and Information Sciences,2026,article,software_engineering,3,64.0,64.0,454.690720311486,64,585.7812,True,True,post,227.53411707673894,landmark,True | 20 | +58732440,10.22024/unikent/01.02.86458,,An exploration of novice compilation behaviour in BlueJ,Kent Academic Repository (University of Kent),2021,dissertation,software_engineering,3,59.0,60.0,226.01941747572815,61,,True,True,baseline,anexplorationofnovicecompilationbehaviourinbluej,226.01941747572815,landmark,True | ||
| 21 | −3007157104,10.1109/tse.2019.2962027,1906.10742,"Machine Learning Testing: Survey, Landscapes and Horizons",IEEE Transactions on Software Engineering,2020,article,software_engineering,4,245.0,385.0,227.48310158362304,888,240.8699,True,True,baseline,227.48310158362304,landmark,True | 21 | +2725449579,10.1016/bs.adcom.2018.03.015,,Mutation Testing Advances: An Analysis and Survey,Advances in computers,2018,book-chapter,software_engineering,1,63.0,129.0,223.78585461689588,425,230.7729,False,True,baseline,mutationtestingadvancesananalysisandsurvey,223.78585461689588,landmark,True | ||
| 22 | −58732440,10.22024/unikent/01.02.86458,,An exploration of novice compilation behaviour in BlueJ,Kent Academic Repository (University of Kent),2021,dissertation,software_engineering,3,59.0,60.0,226.01941747572815,61,,True,True,baseline,226.01941747572815,landmark,True | 22 | +4293212596,10.3847/1538-4357/ac7c74,,The Astropy Project : Sustaining and Growing a Community-oriented Open-source Project and the Latest Major Release (v5.0) of the Core Package*,Repository of the Academy's Library (Library of the Hungarian Academy of Sciences),2022,article,software_engineering,3,704.0,2029.0,209.06737313811422,5022,296.1452,True,True,baseline,theastropyprojectsustainingandgrowingacommunityorientedopensourceprojectandthelatestmajorreleasev50ofthecorepackage,209.06737313811422,landmark,True | ||
| 23 | −2725449579,10.1016/bs.adcom.2018.03.015,,Mutation Testing Advances: An Analysis and Survey,Advances in computers,2018,book-chapter,software_engineering,1,63.0,129.0,223.78585461689588,425,230.7729,False,True,baseline,223.78585461689588,landmark,True | 23 | +4381982883,10.3390/app13095783,,"ChatGPT for Education and Research: Opportunities, Threats, and Strategies",Applied Sciences,2023,article,software_engineering,3,547.0,885.0,207.4225616221095,1062,249.5576,True,True,post,chatgptforeducationandresearchopportunitiesthreatsandstrategies,207.4225616221095,landmark,True | ||
| 24 | −2962772482,10.1145/3236009,,A survey of methods for explaining black box models,ISTI Open Portal,2019,article,software_engineering,1,719.0,1432.0,217.74340797667946,5022,232.193,True,True,baseline,217.74340797667946,landmark,True | 24 | +2505871501,10.3139/9783446480537.002,,2 UML - Unified Modeling Language,Carl Hanser Verlag GmbH & Co. KG eBooks,2024,book-chapter,software_engineering,1,49.0,49.0,202.090395480226,186,0.0,True,True,post,2umlunifiedmodelinglanguage,202.090395480226,landmark,True | ||
| 25 | −4293212596,10.3847/1538-4357/ac7c74,,The Astropy Project : Sustaining and Growing a Community-oriented Open-source Project and the Latest Major Release (v5.0) of the Core Package*,Repository of the Academy's Library (Library of the Hungarian Academy of Sciences),2022,article,software_engineering,3,704.0,2029.0,209.06737313811422,5022,296.1452,True,True,baseline,209.06737313811422,landmark,True | 25 | +4281635063,10.33540/1197,,Evolution of Low-Code Platforms,,2022,dissertation,software_engineering,1,2.0,5.0,200.88235294117646,8,,True,True,baseline,evolutionoflowcodeplatforms,200.88235294117646,landmark,True | ||
| 26 | −4381982883,10.3390/app13095783,,"ChatGPT for Education and Research: Opportunities, Threats, and Strategies",Applied Sciences,2023,article,software_engineering,3,547.0,885.0,207.4225616221095,1062,249.5576,True,True,post,207.4225616221095,landmark,True | 26 | +2100209048,,,Static And Dynamic Reverse Engineering Techniques for Java Software Systems,Tampere University Institutional Repository (Tampere University),2019,dissertation,software_engineering,3,20.0,20.0,200.45167118337852,79,,True,True,baseline,staticanddynamicreverseengineeringtechniquesforjavasoftwaresystems,200.45167118337852,landmark,True | ||
| 27 | −2114444139,10.25946/26315761,,Innovation and Change in the Information Systems Curriculum of an Australian University:a Socio-Technical Perspective,Victoria University Research Repository (Victoria University),2024,dissertation,programming_languages,1,17.0,17.0,661.9925925925926,54,,True,True,post,661.9925925925926,landmark,True | 27 | +2114444139,10.25946/26315761,,Innovation and Change in the Information Systems Curriculum of an Australian University:a Socio-Technical Perspective,Victoria University Research Repository (Victoria University),2024,dissertation,programming_languages,1,17.0,17.0,661.9925925925926,54,,True,True,post,innovationandchangeintheinformationsystemscurriculumofanaustralianuniversityasociotechnicalperspective,661.9925925925926,landmark,True | ||
| 28 | −1844775953,10.82444/warw.33641182,,Metric domains for completeness,Warwick Research Archive Portal (University of Warwick),2026,dissertation,programming_languages,2,34.0,34.0,1040.594982078853,40,,True,True,post,120.87749969701756,landmark,True | 28 | +4396242417,10.1145/3649828,,Enhancing Static Analysis for Practical Bug Detection: An LLM-Integrated Approach,Proceedings of the ACM on Programming Languages,2024,article,programming_languages,4,83.0,148.0,117.44112676056338,148,155.4628,True,True,post,enhancingstaticanalysisforpracticalbugdetectionanllmintegratedapproach,117.44112676056338,landmark,True | ||
| 29 | −4396242417,10.1145/3649828,,Enhancing Static Analysis for Practical Bug Detection: An LLM-Integrated Approach,Proceedings of the ACM on Programming Languages,2024,article,programming_languages,4,83.0,148.0,117.44112676056338,148,155.4628,True,True,post,117.44112676056338,landmark,True | 29 | +2327217190,10.26190/unsworks/23844,,Verification of programs in virtual memory using separation logic,"UNSWorks (University of New South Wales, Sydney, Australia)",2022,dissertation,programming_languages,3,13.0,13.0,97.35745614035089,13,,True,True,baseline,verificationofprogramsinvirtualmemoryusingseparationlogic,97.35745614035089,landmark,True | ||
| 30 | −2327217190,10.26190/unsworks/23844,,Verification of programs in virtual memory using separation logic,"UNSWorks (University of New South Wales, Sydney, Australia)",2022,dissertation,programming_languages,3,13.0,13.0,97.35745614035089,13,,True,True,baseline,97.35745614035089,landmark,True | 30 | +1844775953,10.82444/warw.33641182,,Metric domains for completeness,Warwick Research Archive Portal (University of Warwick),2026,dissertation,programming_languages,2,34.0,34.0,1040.594982078853,40,,True,True,post,metricdomainsforcompleteness,86.2059940144904,landmark,True | ||
| 31 | −2491926874,10.26190/unsworks/17927,,Formal memory models for verifying C systems code,"UNSWorks (University of New South Wales, Sydney, Australia)",2022,dissertation,programming_languages,5,10.0,11.0,82.37938596491229,24,,True,True,baseline,82.37938596491229,landmark,True | 31 | +2491926874,10.26190/unsworks/17927,,Formal memory models for verifying C systems code,"UNSWorks (University of New South Wales, Sydney, Australia)",2022,dissertation,programming_languages,5,10.0,11.0,82.37938596491229,24,,True,True,baseline,formalmemorymodelsforverifyingcsystemscode,82.37938596491229,landmark,True | ||
| 32 | −4205342885,10.1007/s13132-021-00854-2,,The Futures of Europe: Society 5.0 and Industry 5.0 as Driving Forces of Future Universities,Journal of the Knowledge Economy,2022,article,programming_languages,1,171.0,334.0,82.08749781143715,572,117.4739,True,True,baseline,82.08749781143715,landmark,True | 32 | +4205342885,10.1007/s13132-021-00854-2,,The Futures of Europe: Society 5.0 and Industry 5.0 as Driving Forces of Future Universities,Journal of the Knowledge Economy,2022,article,programming_languages,1,171.0,334.0,82.08749781143715,572,117.4739,True,True,baseline,thefuturesofeuropesociety50andindustry50asdrivingforcesoffutureuniversities,82.08749781143715,landmark,True | ||
| 33 | −2189687801,10.7275/7408407.0,,General Program Synthesis from Examples Using Genetic Programming with Parent Selection Based on Random Lexicographic Orderings of Test Cases,Scholarworks (University of Massachusetts Amherst),2021,dissertation,programming_languages,3,18.0,18.0,81.87032967032967,18,,True,True,baseline,81.87032967032967,landmark,True | 33 | +2189687801,10.7275/7408407.0,,General Program Synthesis from Examples Using Genetic Programming with Parent Selection Based on Random Lexicographic Orderings of Test Cases,Scholarworks (University of Massachusetts Amherst),2021,dissertation,programming_languages,3,18.0,18.0,81.87032967032967,18,,True,True,baseline,generalprogramsynthesisfromexamplesusinggeneticprogrammingwithparentselectionbasedonrandomlexicographicorderingsoftestcases,81.87032967032967,landmark,True | ||
| 34 | −2400988715,10.48550/arxiv.2605.09524,2605.09524,Functional Stable Model Semantics and Answer Set Programming Modulo Theories,arXiv (Cornell University),2026,preprint,programming_languages,3,22.0,22.0,856.0701754385965,22,,True,True,post,78.21485274512901,landmark,True | 34 | +2796251079,10.1007/978-3-319-75844-2_6,,A Concise Introduction to Logic,Springer eBooks,2018,book-chapter,programming_languages,1,139.0,167.0,77.56442638324476,401,44.1726,False,False,baseline,aconciseintroductiontologic,77.56442638324476,landmark,True | ||
| 35 | −2796251079,10.1007/978-3-319-75844-2_6,,A Concise Introduction to Logic,Springer eBooks,2018,book-chapter,programming_languages,1,139.0,167.0,77.56442638324476,401,44.1726,False,False,baseline,77.56442638324476,landmark,True | 35 | +159920301,10.48456/tr-346,,On intuitionistic linear logic,OpenGrey (Institut de l'Information Scientifique et Technique),2021,dissertation,programming_languages,2,16.0,16.0,72.77362637362637,39,,True,True,baseline,onintuitionisticlinearlogic,72.77362637362637,landmark,True | ||
| 36 | −159920301,10.48456/tr-346,,On intuitionistic linear logic,OpenGrey (Institut de l'Information Scientifique et Technique),2021,dissertation,programming_languages,2,16.0,16.0,72.77362637362637,39,,True,True,baseline,72.77362637362637,landmark,True | 36 | +4389109635,10.5463/thesis.524,,A Unifying Theory for Graph Transformation,,2023,dissertation,programming_languages,3,2.0,2.0,69.63636363636364,2,,True,True,post,aunifyingtheoryforgraphtransformation,69.63636363636364,landmark,True | ||
| 37 | −4389109635,10.5463/thesis.524,,A Unifying Theory for Graph Transformation,,2023,dissertation,programming_languages,3,2.0,2.0,69.63636363636364,2,,True,True,post,69.63636363636364,landmark,True | 37 | +630549275,10.26190/unsworks/16534,,The clustered multikernel: an approach to formal verification of multiprocessor operating-system kernels,UNSWorks (UNSW Sydney),2022,dissertation,programming_languages,5,8.0,9.0,67.40131578947368,10,,True,True,baseline,theclusteredmultikernelanapproachtoformalverificationofmultiprocessoroperatingsystemkernels,67.40131578947368,landmark,True | ||
| 38 | −630549275,10.26190/unsworks/16534,,The clustered multikernel: an approach to formal verification of multiprocessor operating-system kernels,UNSWorks (UNSW Sydney),2022,dissertation,programming_languages,5,8.0,9.0,67.40131578947368,10,,True,True,baseline,67.40131578947368,landmark,True | 38 | +4403223258,10.1145/3689736,2310.15991,WhiteFox: White-Box Compiler Fuzzing Empowered by Large Language Models,Proceedings of the ACM on Programming Languages,2024,article,programming_languages,8,52.0,82.0,65.0687323943662,82,86.1348,True,True,post,whitefoxwhiteboxcompilerfuzzingempoweredbylargelanguagemodels,65.0687323943662,landmark,True | ||
| 39 | −4403223258,10.1145/3689736,2310.15991,WhiteFox: White-Box Compiler Fuzzing Empowered by Large Language Models,Proceedings of the ACM on Programming Languages,2024,article,programming_languages,8,52.0,82.0,65.0687323943662,82,86.1348,True,True,post,65.0687323943662,landmark,True | 39 | +4313480275,10.1007/978-3-031-21762-3_3,,Algorithmics: The Spirit of Computing,SpringerBriefs in computer science,2023,book-chapter,programming_languages,2,64.0,64.0,57.94535519125683,90,30.3187,False,False,post,algorithmicsthespiritofcomputing,57.94535519125683,landmark,True | ||
| 40 | −4313480275,10.1007/978-3-031-21762-3_3,,Algorithmics: The Spirit of Computing,SpringerBriefs in computer science,2023,book-chapter,programming_languages,2,64.0,64.0,57.94535519125683,90,30.3187,False,False,post,57.94535519125683,landmark,True | 40 | +2790202156,10.14722/ndss.2018.23082,,ZEUS: Analyzing Safety of Smart Contracts,Network and Distributed System Security Symposium,2018,conference-paper,programming_languages,5,94.0,191.0,56.63186311787072,702,60.5919,True,True,baseline,zeusanalyzingsafetyofsmartcontracts,56.63186311787072,landmark,True | ||
| 41 | −2790202156,10.14722/ndss.2018.23082,,ZEUS: Analyzing Safety of Smart Contracts,Network and Distributed System Security Symposium,2018,conference-paper,programming_languages,5,94.0,191.0,56.63186311787072,702,60.5919,True,True,baseline,56.63186311787072,landmark,True | 41 | +3207822760,10.33612/diss.168003240,,Computer programming skills: A cognitive perspective,,2021,dissertation,programming_languages,1,11.0,15.0,56.50485436893204,21,,True,True,baseline,computerprogrammingskillsacognitiveperspective,56.50485436893204,landmark,True | ||
| 42 | −3207822760,10.33612/diss.168003240,,Computer programming skills: A cognitive perspective,,2021,dissertation,programming_languages,1,11.0,15.0,56.50485436893204,21,,True,True,baseline,56.50485436893204,landmark,True | 42 | +2400988715,10.48550/arxiv.2605.09524,2605.09524,Functional Stable Model Semantics and Answer Set Programming Modulo Theories,arXiv (Cornell University),2026,preprint,programming_languages,3,22.0,22.0,856.0701754385965,22,,True,True,post,functionalstablemodelsemanticsandanswersetprogrammingmodulotheories,55.78034906819967,landmark,True | ||
| 43 | −4297611890,10.1017/9781108778756.017,,Subsystems of Second-Order Arithmetic,Cambridge University Press eBooks,2022,book-chapter,programming_languages,3,59.0,61.0,50.93184096224524,65,4.0902,True,False,baseline,50.93184096224524,landmark,True | 43 | +4297611890,10.1017/9781108778756.017,,Subsystems of Second-Order Arithmetic,Cambridge University Press eBooks,2022,book-chapter,programming_languages,3,59.0,61.0,50.93184096224524,65,4.0902,True,False,baseline,subsystemsofsecondorderarithmetic,50.93184096224524,landmark,True | ||
| 44 | −2915211782,10.1017/9781108654555.013,,Novice Programmers and Introductory Programming,Cambridge University Press eBooks,2019,book-chapter,programming_languages,1,11.0,45.0,45.68985849056604,175,59.7005,False,False,baseline,45.68985849056604,landmark,True | 44 | +2915211782,10.1017/9781108654555.013,,Novice Programmers and Introductory Programming,Cambridge University Press eBooks,2019,book-chapter,programming_languages,1,11.0,45.0,45.68985849056604,175,59.7005,False,False,baseline,noviceprogrammersandintroductoryprogramming,45.68985849056604,landmark,True | ||
| 45 | −4381516741,10.1007/978-3-031-22206-1_2,,The Python Programming Language,Springer eBooks,2023,book-chapter,programming_languages,2,70.0,82.0,45.335480407944175,96,25.4404,False,False,post,45.335480407944175,landmark,True | 45 | +4381516741,10.1007/978-3-031-22206-1_2,,The Python Programming Language,Springer eBooks,2023,book-chapter,programming_languages,2,70.0,82.0,45.335480407944175,96,25.4404,False,False,post,thepythonprogramminglanguage,45.335480407944175,landmark,True | ||
| 46 | −3115704172,,,Lineage-driven Fault Injection for Actor-based Programs,KTH Publication Database DiVA (KTH Royal Institute of Technology),2019,dissertation,programming_languages,3,2.0,2.0,42.74766355140187,2,,True,True,baseline,42.74766355140187,landmark,True | 46 | +3115704172,,,Lineage-driven Fault Injection for Actor-based Programs,KTH Publication Database DiVA (KTH Royal Institute of Technology),2019,dissertation,programming_languages,3,2.0,2.0,42.74766355140187,2,,True,True,baseline,lineagedrivenfaultinjectionforactorbasedprograms,42.74766355140187,landmark,True | ||
| 47 | −3146286581,,,Probabilistic Grammatical Evolution,Estudo Geral (Universidade de Coimbra),2021,dissertation,programming_languages,2,4.0,9.0,40.935164835164834,12,,True,True,baseline,40.935164835164834,landmark,True | 47 | +2797025890,10.13025/17505,,Openness and praxis: A situated study of academic staff meaning-making and decision-making with respect to openness and use of open educational practices in higher education,Arrow@dit (Dublin Institute of Technology),2018,dissertation,programming_languages,1,3.0,6.0,38.953125,12,,True,True,baseline,opennessandpraxisasituatedstudyofacademicstaffmeaningmakinganddecisionmakingwithrespecttoopennessanduseofopeneducationalpracticesinhighereducation,38.953125,landmark,True | ||
| 48 | −7134194765,10.1111/tgis.70218,,A Debris‐Flow Hazard Assessment Framework Based on an Improved AHP – CRITIC Method: A Case Study of Gaoling Gully,Transactions in GIS,2026,article,programming_languages,2,11.0,11.0,15.074074074074074,11,77.5749,True,False,post,39.107426372564504,landmark,True | 48 | +4396905794,10.17760/d20653005,,Predicting typeScript type annotations and definitions with machine learning,,2024,dissertation,programming_languages,3,0.0,1.0,38.94074074074074,1,,True,True,post,predictingtypescripttypeannotationsanddefinitionswithmachinelearning,38.94074074074074,landmark,True | ||
| 49 | −2797025890,10.13025/17505,,Openness and praxis: A situated study of academic staff meaning-making and decision-making with respect to openness and use of open educational practices in higher education,Arrow@dit (Dublin Institute of Technology),2018,dissertation,programming_languages,1,3.0,6.0,38.953125,12,,True,True,baseline,38.953125,landmark,True | 49 | +4415797413,10.52202/079017-2000,2312.07104,SGLang: Efficient Execution of Structured Language Model Programs,neural information processing systems,2024,conference-paper,programming_languages,11,13.0,132.0,36.69097472072476,132,40.1561,True,True,post,sglangefficientexecutionofstructuredlanguagemodelprograms,36.69097472072476,landmark,True | ||
| 50 | −4396905794,10.17760/d20653005,,Predicting typeScript type annotations and definitions with machine learning,,2024,dissertation,programming_languages,3,0.0,1.0,38.94074074074074,1,,True,True,post,38.94074074074074,landmark,True | 50 | +4410362977,10.1038/s41586-025-08984-2,,Emergence of Calabi–Yau manifolds in high-precision black-hole scattering,Nature,2025,article,programming_languages,1,74.0,74.0,30.45267489711934,74,33.8684,True,True,post,emergenceofcalabiyaumanifoldsinhighprecisionblackholescattering,32.33589600674873,landmark,True | ||
| 51 | −4410362977,10.1038/s41586-025-08984-2,,Emergence of Calabi–Yau manifolds in high-precision black-hole scattering,Nature,2025,article,programming_languages,1,74.0,74.0,30.45267489711934,74,33.8684,True,True,post,37.46315526076251,landmark,True | 51 | +4391175874,10.11606/d.45.2023.tde-17012024-190825,,VCAT: an automatic assessment model for visual programming languages,,2023,dissertation,programming_languages,5,1.0,1.0,32.09090909090909,1,,True,True,post,vcatanautomaticassessmentmodelforvisualprogramminglanguages,32.09090909090909,landmark,True | ||
| 52 | −3122286897,10.1109/cgo51591.2021.9370308,,MLIR: Scaling Compiler Infrastructure for Domain Specific Computation,IEEE/ACM International Symposium on Code Generation and Optimization (CGO),2021,conference-paper,compilers,4,74.0,155.0,42.480268473059475,541,52.9944,True,False,baseline,42.480268473059475,landmark,True | 52 | +3122286897,10.1109/cgo51591.2021.9370308,,MLIR: Scaling Compiler Infrastructure for Domain Specific Computation,IEEE/ACM International Symposium on Code Generation and Optimization (CGO),2021,conference-paper,compilers,4,74.0,155.0,42.480268473059475,541,52.9944,True,False,baseline,mlirscalingcompilerinfrastructurefordomainspecificcomputation,42.480268473059475,landmark,True | ||
| 53 | −4407983386,10.1016/j.energy.2025.135286,,Parallel TimesNet-BiLSTM model for ultra-short-term photovoltaic power forecasting using STL decomposition and auto-tuning,Energy,2025,article,compilers,1,83.0,83.0,28.27389289459036,83,34.5383,False,False,post,42.01948495463904,landmark,True | 53 | +4399087350,10.1007/978-3-031-56586-1_67,,E-learning and the Future of Business Education: The Case of GCC,"Studies in systems, decision and control",2024,book-chapter,compilers,1,25.0,61.0,39.77033011272142,61,44.6583,False,False,post,elearningandthefutureofbusinesseducationthecaseofgcc,39.77033011272142,landmark,True | ||
| 54 | −4399087350,10.1007/978-3-031-56586-1_67,,E-learning and the Future of Business Education: The Case of GCC,"Studies in systems, decision and control",2024,book-chapter,compilers,1,25.0,61.0,39.77033011272142,61,44.6583,False,False,post,39.77033011272142,landmark,True | 54 | +4398768423,10.1016/j.future.2024.05.034,2310.04963,LLM4VV: Developing LLM-driven testsuite for compiler validation,Future Generation Computer Systems,2024,article,compilers,5,36.0,48.0,38.08901408450704,48,50.4204,False,True,post,llm4vvdevelopingllmdriventestsuiteforcompilervalidation,38.08901408450704,landmark,True | ||
| 55 | −4398768423,10.1016/j.future.2024.05.034,2310.04963,LLM4VV: Developing LLM-driven testsuite for compiler validation,Future Generation Computer Systems,2024,article,compilers,5,36.0,48.0,38.08901408450704,48,50.4204,False,True,post,38.08901408450704,landmark,True | 55 | +4407983386,10.1016/j.energy.2025.135286,,Parallel TimesNet-BiLSTM model for ultra-short-term photovoltaic power forecasting using STL decomposition and auto-tuning,Energy,2025,article,compilers,1,83.0,83.0,28.27389289459036,83,34.5383,False,False,post,paralleltimesnetbilstmmodelforultrashorttermphotovoltaicpowerforecastingusingstldecompositionandautotuning,36.268640115677634,landmark,True | ||
| 56 | −2188794726,10.1007/978-3-319-91734-4_32,,Dynamic Dataflow Graphs,Springer eBooks,2018,book-chapter,compilers,2,25.0,25.0,35.799701046337816,26,8.9221,False,False,baseline,35.799701046337816,landmark,True | 56 | +2884622219,10.1039/c7np00064b,,"The value of universally available raw NMR data for transparency, reproducibility, and integrity in natural product research",Natural Product Reports,2018,article,compilers,1,25.0,51.0,27.040051638148082,122,28.5226,True,True,baseline,thevalueofuniversallyavailablerawnmrdatafortransparencyreproducibilityandintegrityinnaturalproductresearch,27.040051638148082,landmark,True | ||
| 57 | −4406882143,10.3389/fdgth.2025.1460167,,Beyond the current state of just-in-time adaptive interventions in mental health: a qualitative systematic review,Frontiers in Digital Health,2025,review,compilers,2,54.0,54.0,4.153846153846154,54,8.4784,True,True,post,27.337978163259134,landmark,True | 57 | +3188948186,10.48550/arxiv.2108.05450,2108.05450,Speed Control of DC Motor Using Fuzzy PID Controller,arXiv (Cornell University),2021,preprint,compilers,2,55.0,73.0,24.44561426312255,87,,True,True,baseline,speedcontrolofdcmotorusingfuzzypidcontroller,24.44561426312255,landmark,True | ||
| 58 | −2884622219,10.1039/c7np00064b,,"The value of universally available raw NMR data for transparency, reproducibility, and integrity in natural product research",Natural Product Reports,2018,article,compilers,1,25.0,51.0,27.040051638148082,122,28.5226,True,True,baseline,27.040051638148082,landmark,True | 58 | +4406882143,10.3389/fdgth.2025.1460167,,Beyond the current state of just-in-time adaptive interventions in mental health: a qualitative systematic review,Frontiers in Digital Health,2025,review,compilers,2,54.0,54.0,4.153846153846154,54,8.4784,True,True,post,beyondthecurrentstateofjustintimeadaptiveinterventionsinmentalhealthaqualitativesystematicreview,23.5964646535734,landmark,True | ||
| 59 | −3188948186,10.48550/arxiv.2108.05450,2108.05450,Speed Control of DC Motor Using Fuzzy PID Controller,arXiv (Cornell University),2021,preprint,compilers,2,55.0,73.0,24.44561426312255,87,,True,True,baseline,24.44561426312255,landmark,True | 59 | +2962724414,10.1109/jproc.2018.2817118,,Machine Learning in Compiler Optimization,Proceedings of the IEEE,2018,article,compilers,4,25.0,64.0,22.34837655707576,193,27.4802,True,True,baseline,machinelearningincompileroptimization,22.34837655707576,landmark,True | ||
| 60 | −2962724414,10.1109/jproc.2018.2817118,,Machine Learning in Compiler Optimization,Proceedings of the IEEE,2018,article,compilers,4,25.0,64.0,22.34837655707576,193,27.4802,True,True,baseline,22.34837655707576,landmark,True | 60 | +4392397123,10.1016/j.ijer.2024.102326,,Evolution to revolution: Critical exploration of educators’ perceptions of the impact of Artificial Intelligence (AI) on the teaching and learning process in the GCC region,International Journal of Educational Research,2024,article,compilers,1,37.0,64.0,19.268802878681992,64,24.4917,False,True,post,evolutiontorevolutioncriticalexplorationofeducatorsperceptionsoftheimpactofartificialintelligenceaiontheteachingandlearningprocessinthegccregion,19.268802878681992,landmark,True | ||
| 61 | −4408711372,10.1109/tsg.2025.3553737,,A Progressive Polyhedral Approximation Method for Nonlinear PDE-Constrained Electricity-Water Nexus Dispatch,IEEE Transactions on Smart Grid,2025,article,compilers,3,39.0,39.0,8.943719676549865,39,8.8867,True,False,post,19.744095340131597,landmark,True | 61 | +2783614532,10.1145/3197978,1801.04405,A Survey on Compiler Autotuning using Machine Learning,ACM Computing Surveys,2018,article,compilers,5,21.0,55.0,19.205636103736982,233,25.7446,True,True,baseline,asurveyoncompilerautotuningusingmachinelearning,19.205636103736982,landmark,True | ||
| 62 | −4392397123,10.1016/j.ijer.2024.102326,,Evolution to revolution: Critical exploration of educators’ perceptions of the impact of Artificial Intelligence (AI) on the teaching and learning process in the GCC region,International Journal of Educational Research,2024,article,compilers,1,37.0,64.0,19.268802878681992,64,24.4917,False,True,post,19.268802878681992,landmark,True | 62 | +2206959660,10.58088/85wq-pw11,,Automatic selection of compiler optimizations using program characterization and machine learning,"Library, Museums and Press - UDSpace (University of Delaware)",2024,dissertation,compilers,5,1.0,1.0,19.080000000000002,1,,True,True,post,automaticselectionofcompileroptimizationsusingprogramcharacterizationandmachinelearning,19.080000000000002,landmark,True | ||
| 63 | −2783614532,10.1145/3197978,1801.04405,A Survey on Compiler Autotuning using Machine Learning,ACM Computing Surveys,2018,article,compilers,5,21.0,55.0,19.205636103736982,233,25.7446,True,True,baseline,19.205636103736982,landmark,True | 63 | +2249134499,10.58088/vbbd-jy30,,Improving compiler optimizations using machine learning,"Library, Museums and Press - UDSpace (University of Delaware)",2024,dissertation,compilers,8,1.0,1.0,19.080000000000002,1,,True,True,post,improvingcompileroptimizationsusingmachinelearning,19.080000000000002,landmark,True | ||
| 64 | −2206959660,10.58088/85wq-pw11,,Automatic selection of compiler optimizations using program characterization and machine learning,"Library, Museums and Press - UDSpace (University of Delaware)",2024,dissertation,compilers,5,1.0,1.0,19.080000000000002,1,,True,True,post,19.080000000000002,landmark,True | 64 | +3214427835,,,Sparse tensor algebra compilation,DSpace@MIT (Massachusetts Institute of Technology),2020,dissertation,compilers,3,2.0,2.0,18.265060240963855,3,,True,True,baseline,sparsetensoralgebracompilation,18.265060240963855,landmark,True | ||
| 65 | −2249134499,10.58088/vbbd-jy30,,Improving compiler optimizations using machine learning,"Library, Museums and Press - UDSpace (University of Delaware)",2024,dissertation,compilers,8,1.0,1.0,19.080000000000002,1,,True,True,post,19.080000000000002,landmark,True | 65 | +3139485201,,,Towards automated construction of compiler optimizations,DSpace@MIT (Massachusetts Institute of Technology),2020,dissertation,compilers,5,2.0,2.0,18.265060240963855,3,,True,False,baseline,towardsautomatedconstructionofcompileroptimizations,18.265060240963855,landmark,True | ||
| 66 | −3139485201,,,Towards automated construction of compiler optimizations,DSpace@MIT (Massachusetts Institute of Technology),2020,dissertation,compilers,5,2.0,2.0,18.265060240963855,3,,True,False,baseline,18.265060240963855,landmark,True | 66 | +3023977240,10.7488/era/309,,From constraint programming to heterogeneous parallelism,ERA,2020,dissertation,compilers,8,0.0,2.0,18.265060240963855,2,,True,True,baseline,fromconstraintprogrammingtoheterogeneousparallelism,18.265060240963855,landmark,True | ||
| 67 | −3214427835,,,Sparse tensor algebra compilation,DSpace@MIT (Massachusetts Institute of Technology),2020,dissertation,compilers,3,2.0,2.0,18.265060240963855,3,,True,True,baseline,18.265060240963855,landmark,True | 67 | +3046781014,10.1007/978-3-030-47956-5_14,,ExaStencils: Advanced Multigrid Solver Generation,Lecture notes in computational science and engineering,2020,book-chapter,compilers,6,8.0,12.0,18.204255319148935,30,29.7428,True,True,baseline,exastencilsadvancedmultigridsolvergeneration,18.204255319148935,landmark,True | ||
| 68 | −3023977240,10.7488/era/309,,From constraint programming to heterogeneous parallelism,ERA,2020,dissertation,compilers,8,0.0,2.0,18.265060240963855,2,,True,True,baseline,18.265060240963855,landmark,True | 68 | +3132279601,10.1007/978-3-030-62066-0_12,,Coping with COVID-19: Higher Education in the GCC Countries,Springer proceedings in complexity,2021,conference-paper,compilers,1,23.0,37.0,17.288455680779773,43,37.049,False,False,baseline,copingwithcovid19highereducationinthegcccountries,17.288455680779773,landmark,True | ||
| 69 | −3046781014,10.1007/978-3-030-47956-5_14,,ExaStencils: Advanced Multigrid Solver Generation,Lecture notes in computational science and engineering,2020,book-chapter,compilers,6,8.0,12.0,18.204255319148935,30,29.7428,True,True,baseline,18.204255319148935,landmark,True | 69 | +4408711372,10.1109/tsg.2025.3553737,,A Progressive Polyhedral Approximation Method for Nonlinear PDE-Constrained Electricity-Water Nexus Dispatch,IEEE Transactions on Smart Grid,2025,article,compilers,3,39.0,39.0,8.943719676549865,39,8.8867,True,False,post,aprogressivepolyhedralapproximationmethodfornonlinearpdeconstrainedelectricitywaternexusdispatch,17.0418911386919,landmark,True | ||
| 70 | −7127344046,10.1007/s44217-026-01188-4,,Artificial intelligence policy challenges and institutional readiness in Omani higher education,Discover Education,2026,article,compilers,3,5.0,5.0,35.52271252433485,5,45.7642,True,True,post,17.776102896620227,landmark,True | 70 | +3103225940,,,An LLVM backend for the Open Modelica Compiler,KTH Publication Database DiVA (KTH Royal Institute of Technology),2019,dissertation,compilers,4,3.0,3.0,16.862068965517242,3,,True,True,baseline,anllvmbackendfortheopenmodelicacompiler,16.862068965517242,landmark,True | ||
| 71 | −3132279601,10.1007/978-3-030-62066-0_12,,Coping with COVID-19: Higher Education in the GCC Countries,Springer proceedings in complexity,2021,conference-paper,compilers,1,23.0,37.0,17.288455680779773,43,37.049,False,False,baseline,17.288455680779773,landmark,True | 71 | +4313894866,10.3390/publications11010002,,"The Science of Literature Reviews: Searching, Identifying, Selecting, and Synthesising",Publications,2023,article,compilers,1,91.0,187.0,16.423071260306244,248,45.5306,True,True,post,thescienceofliteraturereviewssearchingidentifyingselectingandsynthesising,16.423071260306244,landmark,True | ||
| 72 | −3103225940,,,An LLVM backend for the Open Modelica Compiler,KTH Publication Database DiVA (KTH Royal Institute of Technology),2019,dissertation,compilers,4,3.0,3.0,16.862068965517242,3,,True,True,baseline,16.862068965517242,landmark,True | 72 | +2787911489,10.1007/978-3-319-68394-2_11,,Automated Code Generation for Maximizing Performance of Detailed Chemistry Calculations in OpenFOAM,Springer eBooks,2018,book-chapter,compilers,4,5.0,10.0,14.319880418535128,37,25.2794,False,False,baseline,automatedcodegenerationformaximizingperformanceofdetailedchemistrycalculationsinopenfoam,14.319880418535128,landmark,True | ||
| 73 | −4313894866,10.3390/publications11010002,,"The Science of Literature Reviews: Searching, Identifying, Selecting, and Synthesising",Publications,2023,article,compilers,1,91.0,187.0,16.423071260306244,248,45.5306,True,True,post,16.423071260306244,landmark,True | 73 | +3189874403,,,Efficient memory and GPU operations for Tiramisu compiler,,2019,dissertation,compilers,4,2.0,2.0,13.714285714285714,2,,False,False,baseline,efficientmemoryandgpuoperationsfortiramisucompiler,13.714285714285714,landmark,True | ||
| 74 | −4407942537,10.1145/3708493.3712691,,LLM Compiler: Foundation Language Models for Compiler Optimization,ACM SIGPLAN International Conference on Compiler Construction (CC),2025,conference-paper,compilers,6,31.0,31.0,23.55532716683796,31,36.5894,True,True,post,15.694024501130242,landmark,True | 74 | +4407942537,10.1145/3708493.3712691,,LLM Compiler: Foundation Language Models for Compiler Optimization,ACM SIGPLAN International Conference on Compiler Construction (CC),2025,conference-paper,compilers,6,31.0,31.0,23.55532716683796,31,36.5894,True,True,post,llmcompilerfoundationlanguagemodelsforcompileroptimization,13.546118597421765,landmark,True | ||
| 75 | −2787911489,10.1007/978-3-319-68394-2_11,,Automated Code Generation for Maximizing Performance of Detailed Chemistry Calculations in OpenFOAM,Springer eBooks,2018,book-chapter,compilers,4,5.0,10.0,14.319880418535128,37,25.2794,False,False,baseline,14.319880418535128,landmark,True | 75 | +7127344046,10.1007/s44217-026-01188-4,,Artificial intelligence policy challenges and institutional readiness in Omani higher education,Discover Education,2026,article,compilers,3,5.0,5.0,35.52271252433485,5,45.7642,True,True,post,artificialintelligencepolicychallengesandinstitutionalreadinessinomanihighereducation,12.67735206095447,landmark,True | ||
| 76 | −2949967139,10.1109/cgo.2019.8661197,,Tiramisu: A Polyhedral Compiler for Expressing Fast and Portable Code,IEEE/ACM International Symposium on Code Generation and Optimization (CGO),2019,conference-paper,compilers,6,26.0,53.0,14.250956889605158,182,15.9098,True,True,baseline,14.250956889605158,landmark,True | 76 | +4385482927,10.1145/3596711.3596751,,Decoupling Algorithms from Schedules for Easy Optimization of Image Processing Pipelines,ACM eBooks,2023,book-chapter,compilers,5,7.0,7.0,12.636627906976743,7,3.981,True,False,post,decouplingalgorithmsfromschedulesforeasyoptimizationofimageprocessingpipelines,12.636627906976743,landmark,True | ||
| 77 | −4385245566,10.4230/lipics.itp.2023.19,,Exploiting Generative AI to Scale up Intelligent Tutoring Systems,DROPS (Schloss Dagstuhl – Leibniz Center for Informatics),2023,article,formal_verification,3,54921.0,72130.0,6621.879465206806,76658,4908.38,True,True,post,6621.879465206806,landmark,True | 77 | +4385245566,10.4230/lipics.itp.2023.19,,Exploiting Generative AI to Scale up Intelligent Tutoring Systems,DROPS (Schloss Dagstuhl – Leibniz Center for Informatics),2023,article,formal_verification,3,54921.0,72130.0,6621.879465206806,76658,4908.38,True,True,post,exploitinggenerativeaitoscaleupintelligenttutoringsystems,6621.879465206806,landmark,True | ||
| 78 | −1498342204,10.1145/3788687,,An Introduction to Input/Output Automata,Formal Aspects of Computing,2026,article,formal_verification,2,284.0,284.0,801.9048786467272,1011,3.5639,True,True,post,1009.682644528029,landmark,True | 78 | +1498342204,10.1145/3788687,,An Introduction to Input/Output Automata,Formal Aspects of Computing,2026,article,formal_verification,2,284.0,284.0,801.9048786467272,1011,3.5639,True,True,post,anintroductiontoinputoutputautomata,720.0735970622139,landmark,True | ||
| 79 | −3117137355,10.1145/3815481,,egg: Fast and Extensible Equality Saturation,Communications of the ACM,2026,article,formal_verification,3,132.0,132.0,146.88980220909326,132,0.0,True,False,post,469.28911647077405,landmark,True | 79 | +2254118105,10.48550/arxiv.2608.14274,2608.14274,Solving QBF by Clause Selection,arXiv (Cornell University),2026,preprint,formal_verification,3,60.0,60.0,2151.793313069909,60,,True,True,post,solvingqbfbyclauseselection,152.12822473145363,landmark,True | ||
| 80 | −1481397690,10.1007/978-3-319-10575-8_11,,Satisfiability Modulo Theories,Springer eBooks,2018,book-chapter,formal_verification,2,501.0,585.0,432.45569620253167,1122,250.357,False,False,baseline,432.45569620253167,landmark,True | 80 | +2921681895,10.18154/rwth-2020-02348,1903.07993,Parameter synthesis in Markov models,RWTH Publications (RWTH Aachen),2020,dissertation,formal_verification,6,14.0,19.0,111.636815920398,26,,True,True,baseline,parametersynthesisinmarkovmodels,111.636815920398,landmark,True | ||
| 81 | −2254118105,10.48550/arxiv.2608.14274,2608.14274,Solving QBF by Clause Selection,arXiv (Cornell University),2026,preprint,formal_verification,3,60.0,60.0,2151.793313069909,60,,True,True,post,213.31323475944274,landmark,True | 81 | +2540354435,10.48550/arxiv.2605.09519,2605.09519,Weighted Rules under the Stable Model Semantics,arXiv (Cornell University),2026,preprint,formal_verification,2,39.0,39.0,1517.578947368421,39,,True,True,post,weightedrulesunderthestablemodelsemantics,98.88334607544486,landmark,True | ||
| 82 | −4206807714,10.3233/faia336,,Handbook of Satisfiability,Frontiers in artificial intelligence and applications,2021,book,formal_verification,2,678.0,777.0,184.30546075085323,1038,93.9568,False,False,baseline,184.30546075085323,landmark,True | 82 | +4225922019,10.1007/978-3-030-99524-9_24,,cvc5: A Versatile and Industrial-Strength SMT Solver,Lecture notes in computer science,2022,conference-paper,formal_verification,4,111.0,222.0,98.23784328546233,468,135.8061,True,True,baseline,cvc5aversatileandindustrialstrengthsmtsolver,98.23784328546233,landmark,True | ||
| 83 | −2540354435,10.48550/arxiv.2605.09519,2605.09519,Weighted Rules under the Stable Model Semantics,arXiv (Cornell University),2026,preprint,formal_verification,2,39.0,39.0,1517.578947368421,39,,True,True,post,138.65360259363777,landmark,True | 83 | +4318573502,10.5463/thesis.149,,Semantically informed methods in structural proof theory,,2022,dissertation,formal_verification,2,9.0,13.0,97.35745614035089,14,,True,True,baseline,semanticallyinformedmethodsinstructuralprooftheory,97.35745614035089,landmark,True | ||
| 84 | −2921681895,10.18154/rwth-2020-02348,1903.07993,Parameter synthesis in Markov models,RWTH Publications (RWTH Aachen),2020,dissertation,formal_verification,6,14.0,19.0,111.636815920398,26,,True,True,baseline,111.636815920398,landmark,True | 84 | +2154148696,10.1007/978-3-319-77452-7_9,,Supervisory Control of Timed Discrete-Event Systems,Communications and control engineering/Communications and control engineering series,2018,book-chapter,formal_verification,1,100.0,117.0,86.49113924050633,365,36.4666,False,False,baseline,supervisorycontroloftimeddiscreteeventsystems,86.49113924050633,landmark,True | ||
| 85 | −4225922019,10.1007/978-3-030-99524-9_24,,cvc5: A Versatile and Industrial-Strength SMT Solver,Lecture notes in computer science,2022,conference-paper,formal_verification,4,111.0,222.0,98.23784328546233,468,135.8061,True,True,baseline,98.23784328546233,landmark,True | 85 | +4297781990,10.4230/oasics.dx.2024.10,,"Leveraging Answer Set Programming for Continuous Monitoring, Fault Detection, and Explanation of Automated and Autonomous Driving Systems",HAL (Le Centre pour la Communication Scientifique Directe),2024,preprint,formal_verification,3,426.0,431.0,78.93772893772893,431,,True,True,post,leveraginganswersetprogrammingforcontinuousmonitoringfaultdetectionandexplanationofautomatedandautonomousdrivingsystems,78.93772893772893,landmark,True | ||
| 86 | −4318573502,10.5463/thesis.149,,Semantically informed methods in structural proof theory,,2022,dissertation,formal_verification,2,9.0,13.0,97.35745614035089,14,,True,True,baseline,97.35745614035089,landmark,True | 86 | +2789444712,10.1080/00207543.2018.1444806,,Industry 4.0: state of the art and future trends,International Journal of Production Research,2018,article,formal_verification,4,298.0,734.0,61.81756449008323,3221,267.6956,True,False,baseline,industry40stateoftheartandfuturetrends,61.81756449008323,landmark,True | ||
| 87 | −2154148696,10.1007/978-3-319-77452-7_9,,Supervisory Control of Timed Discrete-Event Systems,Communications and control engineering/Communications and control engineering series,2018,book-chapter,formal_verification,1,100.0,117.0,86.49113924050633,365,36.4666,False,False,baseline,86.49113924050633,landmark,True | 87 | +2486519520,10.48456/tr-792,,Machine learning and automated theorem proving,OpenGrey (Institut de l'Information Scientifique et Technique),2021,dissertation,formal_verification,4,12.0,12.0,54.58021978021978,14,,True,True,baseline,machinelearningandautomatedtheoremproving,54.58021978021978,landmark,True | ||
| 88 | −4297781990,10.4230/oasics.dx.2024.10,,"Leveraging Answer Set Programming for Continuous Monitoring, Fault Detection, and Explanation of Automated and Autonomous Driving Systems",HAL (Le Centre pour la Communication Scientifique Directe),2024,preprint,formal_verification,3,426.0,431.0,78.93772893772893,431,,True,True,post,78.93772893772893,landmark,True | 88 | +149631060,10.48550/arxiv.2411.01592,2411.01592,Decidability Issues for Petri Nets -- a survey,arXiv (Cornell University),2024,preprint,formal_verification,3,33.0,33.0,53.32230215827339,72,,True,True,post,decidabilityissuesforpetrinetsasurvey,53.32230215827339,landmark,True | ||
| 89 | −2789444712,10.1080/00207543.2018.1444806,,Industry 4.0: state of the art and future trends,International Journal of Production Research,2018,article,formal_verification,4,298.0,734.0,61.81756449008323,3221,267.6956,True,False,baseline,61.81756449008323,landmark,True | 89 | +2890660842,10.48550/arxiv.1809.08098,1809.08098,Efficient Formal Safety Analysis of Neural Networks,arXiv (Cornell University),2018,preprint,formal_verification,6,41.0,98.0,52.040918390543304,167,,True,True,baseline,efficientformalsafetyanalysisofneuralnetworks,52.040918390543304,landmark,True | ||
| 90 | −1586677474,,,Handbook of Satisfiability,,2021,article,formal_verification,2,374.0,375.0,60.365327611379016,486,1.7496,True,False,baseline,60.365327611379016,landmark,True | 90 | +4393942723,10.1007/978-3-031-57256-2_15,,State of the Art in Software Verification and Witness Validation: SV-COMP 2024,Lecture notes in computer science,2024,conference-paper,formal_verification,4,66.0,78.0,48.594819515239784,78,53.289,True,True,post,stateoftheartinsoftwareverificationandwitnessvalidationsvcomp2024,48.594819515239784,landmark,True | ||
| 91 | −2486519520,10.48456/tr-792,,Machine learning and automated theorem proving,OpenGrey (Institut de l'Information Scientifique et Technique),2021,dissertation,formal_verification,4,12.0,12.0,54.58021978021978,14,,True,True,baseline,54.58021978021978,landmark,True | 91 | +2957311447,10.1007/978-3-030-25540-4_26,,The Marabou Framework for Verification and Analysis of Deep Neural Networks,Lecture notes in computer science,2019,conference-paper,formal_verification,4,55.0,141.0,46.39818783571157,498,53.6017,True,True,baseline,themarabouframeworkforverificationandanalysisofdeepneuralnetworks,46.39818783571157,landmark,True | ||
| 92 | −4289665848,10.4230/lipics.csl.2026.30,,Reward Interfaces with Best-Effort Implementations,DROPS (Schloss Dagstuhl – Leibniz Center for Informatics),2026,article,formal_verification,4,15.0,15.0,42.354130914439814,15,0.0,True,True,post,53.328308689860684,landmark,True | 92 | +2905489900,,,Machine Learning for SAT Solvers,UWSpace (University of Waterloo),2018,dissertation,formal_verification,3,3.0,5.0,44.97120921305182,9,,True,True,baseline,machinelearningforsatsolvers,44.97120921305182,landmark,True | ||
| 93 | −149631060,10.48550/arxiv.2411.01592,2411.01592,Decidability Issues for Petri Nets -- a survey,arXiv (Cornell University),2024,preprint,formal_verification,3,33.0,33.0,53.32230215827339,72,,True,True,post,53.32230215827339,landmark,True | 93 | +2900153411,10.1145/3290354,,An abstract domain for certifying neural networks,Proceedings of the ACM on Programming Languages,2019,article,formal_verification,3,99.0,209.0,44.06671585274556,609,46.6555,True,True,baseline,anabstractdomainforcertifyingneuralnetworks,44.06671585274556,landmark,True | ||
| 94 | −2890660842,10.48550/arxiv.1809.08098,1809.08098,Efficient Formal Safety Analysis of Neural Networks,arXiv (Cornell University),2018,preprint,formal_verification,6,41.0,98.0,52.040918390543304,167,,True,True,baseline,52.040918390543304,landmark,True | 94 | +6944541633,10.18154/rwth-2023-09669,,Verification of multi-objective Markov models,RWTH Publications (RWTH Aachen),2023,dissertation,formal_verification,6,2.0,2.0,43.15151515151515,4,,True,True,post,verificationofmultiobjectivemarkovmodels,43.15151515151515,landmark,True | ||
| 95 | −1932627192,10.82444/warw.33484729,,Model checking quantum protocols,Warwick Research Archive Portal (University of Warwick),2026,dissertation,formal_verification,4,14.0,14.0,141.45283018867926,18,,True,True,post,49.77308811053664,landmark,True | 95 | +3016155638,10.1109/sp40000.2020.00024,,VerX: Safety Verification of Smart Contracts,Proceedings - IEEE Symposium on Security and Privacy/Proceedings of the ... IEEE Symposium on Security and Privacy,2020,conference-paper,formal_verification,6,76.0,114.0,42.08811748998665,247,40.057,True,True,baseline,verxsafetyverificationofsmartcontracts,42.08811748998665,landmark,True | ||
| 96 | −4393942723,10.1007/978-3-031-57256-2_15,,State of the Art in Software Verification and Witness Validation: SV-COMP 2024,Lecture notes in computer science,2024,conference-paper,formal_verification,4,66.0,78.0,48.594819515239784,78,53.289,True,True,post,48.594819515239784,landmark,True | 96 | +1639950690,10.14279/tuj.eceasst.24.334,,Checking Unsatisfiability for OCL Constraints,Technische Universität Berlin – Universitätsbibliothek,2024,article,formal_verification,3,53.0,53.0,42.056619718309854,58,2.1008,True,True,post,checkingunsatisfiabilityforoclconstraints,42.056619718309854,landmark,True | ||
| 97 | −2957311447,10.1007/978-3-030-25540-4_26,,The Marabou Framework for Verification and Analysis of Deep Neural Networks,Lecture notes in computer science,2019,conference-paper,formal_verification,4,55.0,141.0,46.39818783571157,498,53.6017,True,True,baseline,46.39818783571157,landmark,True | 97 | +4384521943,10.1007/978-3-031-37703-7_18,,nl2spec: Interactively Translating Unstructured Natural Language to Temporal Logics with Large Language Models,Lecture notes in computer science,2023,conference-paper,formal_verification,4,38.0,82.0,40.90918384733345,122,53.4819,True,True,post,nl2specinteractivelytranslatingunstructurednaturallanguagetotemporallogicswithlargelanguagemodels,40.90918384733345,landmark,True | ||
| 98 | −2905489900,,,Machine Learning for SAT Solvers,UWSpace (University of Waterloo),2018,dissertation,formal_verification,3,3.0,5.0,44.97120921305182,9,,True,True,baseline,44.97120921305182,landmark,True | 98 | +2803355841,10.48550/arxiv.1805.08876,1805.08876,Soteria: Automated IoT Safety and Security Analysis,arXiv (Cornell University),2018,preprint,formal_verification,7,35.0,74.0,39.29620368265515,159,,True,True,baseline,soteriaautomatediotsafetyandsecurityanalysis,39.29620368265515,landmark,True | ||
| 99 | −2900153411,10.1145/3290354,,An abstract domain for certifying neural networks,Proceedings of the ACM on Programming Languages,2019,article,formal_verification,3,99.0,209.0,44.06671585274556,609,46.6555,True,True,baseline,44.06671585274556,landmark,True | 99 | +6891455501,10.3929/ethz-b-000553221,,"Efficient, Expressive, and Verified Temporal Query Evaluation",Repository for Publications and Research Data (ETH Zurich),2022,dissertation,formal_verification,5,4.0,5.0,38.535353535353536,5,,True,True,baseline,efficientexpressiveandverifiedtemporalqueryevaluation,38.535353535353536,landmark,True | ||
| 100 | −6944541633,10.18154/rwth-2023-09669,,Verification of multi-objective Markov models,RWTH Publications (RWTH Aachen),2023,dissertation,formal_verification,6,2.0,2.0,43.15151515151515,4,,True,True,post,43.15151515151515,landmark,True | 100 | +2187038411,10.26190/unsworks/22938,,Modelling and programming embedded controllers with timed automata and synchronous languages,"UNSWorks (University of New South Wales, Sydney, Australia)",2022,dissertation,formal_verification,3,4.0,5.0,38.535353535353536,5,,True,True,baseline,modellingandprogrammingembeddedcontrollerswithtimedautomataandsynchronouslanguages,38.535353535353536,landmark,True | ||
| 101 | −3016155638,10.1109/sp40000.2020.00024,,VerX: Safety Verification of Smart Contracts,Proceedings - IEEE Symposium on Security and Privacy/Proceedings of the ... IEEE Symposium on Security and Privacy,2020,conference-paper,formal_verification,6,76.0,114.0,42.08811748998665,247,40.057,True,True,baseline,42.08811748998665,landmark,True | 101 | +4289665848,10.4230/lipics.csl.2026.30,,Reward Interfaces with Best-Effort Implementations,DROPS (Schloss Dagstuhl – Leibniz Center for Informatics),2026,article,formal_verification,4,15.0,15.0,42.354130914439814,15,0.0,True,True,post,rewardinterfaceswithbesteffortimplementations,38.03205618286341,landmark,True | ||
modified
literature_synthesis/landmarks/theory_abstracts.jsonl
+25 −25
@@ -1,50 +1,50 @@ | |||||
| 1 | −{"work_id": 2808541536, "title": "Meet-continuity and locally compact sober dcpos", "abstract": "In this thesis, we investigate meet-continuity over dcpos. We give different equivalent descriptions of meet-continuous dcpos, among which an important characterisation is given via forbidden substructures. By checking the function space of such substructures we prove, as a central contribution, that any dcpo with a core-compact function space must be meet-continuous. As an application , this result entails that any cartesian closed full subcategory of quasicontinuous domains consists of continuous domains entirely. That is to say , both the category of continuous domains and that of quasicontinuous domains share the same cartesian closed full subcategories. \\nOur new characterisation of meet-continuous dcpos also allows us to say more about full subcategories of locally compact sober dcpos which are generalisations of quasicontinuous domains. After developing some theory of characterising coherence and bicompleteness of dcpos, we conclude that any cartesian closed full subcategory of pointed locally compact sober dcpos is entirely contained in the category of stably compact dcpos or that of L-dcpos. \\nAs a by-product, our study of coherence of dcpos enables us to characterise Lawson-compactness over arbitrary dcpos. \\n"} | ||||
| 2 | −{"work_id": 1486707681, "title": "Sequence distance embeddings", "abstract": "Sequences represent a large class of fundamental objects in Computer Science sets, strings, vectors and permutations are considered to be sequences. Distances between sequences measure their similarity, and computations based on distances are ubiquitous: either to compute the distance, or to use distance computation as part of a more complex problem. This thesis takes a very specific approach to solving questions of sequence distance: sequences are embedded into other distance measures, so that distance in the new space approximates the original distance. This allows the solution of a variety of problems including: Fast computation of short sketches in a variety of computing models, which allow sequences to be compared in constant time and space irrespective of the size of the original sequences. Approximate nearest neighbor and clustering problems, significantly faster than the naive exact solutions. Algorithms to find approximate occurrences of pattern sequences in long text sequences in near linear time. Efficient communication schemes to approximate the distance between, and exchange, sequences in close to the optimal amount of communication. Solutions are given for these problems for a variety of distances, including fundamental distances on sets and vectors; distances inspired by biological problems for permutations; and certain text editing distances for strings. Many of these embeddings are computable in a streaming model where the data is too large to store in memory, and instead has to be processed as and when it arrives, piece by piece. The embeddings are also shown to be practical, with a series of large scale experiments which demonstrate that given only a small space, approximate solutions to several similarity and clustering problems can be found that are as good as or better than those found with prior methods."} | ||||
| 3 | −{"work_id": 4406080942, "title": "Artificial lemming algorithm: a novel bionic meta-heuristic technique for solving real-world engineering optimization problems", "abstract": "The advent of the intelligent information era has witnessed a proliferation of complex optimization problems across various disciplines. Although existing meta-heuristic algorithms have demonstrated efficacy in many scenarios, they still struggle with certain challenges such as premature convergence, insufficient exploration, and lack of robustness in high-dimensional, nonconvex search spaces. These limitations underscore the need for novel optimization techniques that can better balance exploration and exploitation while maintaining computational efficiency. In response to this need, we propose the Artificial Lemming Algorithm (ALA), a bio-inspired metaheuristic that mathematically models four distinct behaviors of lemmings in nature: long-distance migration, digging holes, foraging, and evading predators. Specifically, the long-distance migration and burrow digging behaviors are dedicated to highly exploring the search domain, whereas the foraging and evading predators behaviors provide exploitation during the optimization process. In addition, ALA incorporates an energy-decreasing mechanism that enables dynamic adjustments to the balance between exploration and exploitation, thereby enhancing its ability to evade local optima and converge to global solutions more robustly. To thoroughly verify the effectiveness of the proposed method, ALA is compared with 17 other state-of-the-art meta-heuristic algorithms on the IEEE CEC2017 benchmark test suite and the IEEE CEC2022 benchmark test suite. The experimental results indicate that ALA has reliable comprehensive optimization performance and can achieve superior solution accuracy, convergence speed, and stability in most test cases. For the 29 10-, 30-, 50-, and 100-dimensional CEC2017 functions, ALA obtains the lowest Friedman average ranking values among all competitor methods, which are 1.7241, 2.1034, 2.7241, and 2.9310, respectively, and for the 12 CEC2022 functions, ALA again wins the optimal Friedman average ranking of 2.1667. Finally, to further evaluate its applicability, ALA is implemented to address a series of optimization cases, including constrained engineering design, photovoltaic (PV) model parameter identification, and fractional-order proportional-differential-integral (FOPID) controller gain tuning. Our findings highlight the competitive edge and potential of ALA for real-world engineering applications. The source code of ALA is publicly available at https://github.com/StevenShaw98/Artificial-Lemming-Algorithm ."} | ||||
| 4 | {"work_id": 1491280261, "title": "Grammatical bias for evolutionary learning", "abstract": "A framework for declarative bias, based on the genetic programming paradigm (GP), is presented. The system, CFG-GP, encapsulates background knowledge, inductive bias and program structure. A context-free grammar is used to create a population of programs, represented by their corresponding derivation trees. These computer programs evolve using the principle of Darwinian selection. The grammar biases the form of language that is expressible and the inductive hypotheses that are generated. Using a formal grammar to define the space of legal statements allows a declarative language bias to be stated. The defined language may express knowledge in the form of program structure and incorporate explicit beliefs about the structure of possible solutions. Additionally, the form of the initial population of programs may be explicitly biased using a merit selection operation. This probabilistically biases particular statements generated from the grammar.\r\nThe program induction system, CFG-GP, represents search bias with three operators, namely selective crossover, selective mutation and directed mutation. Each of these operators allows a bias to be explicitly defined in terms of how programs are modified and how the search for a solution proceeds. Hence, both a search and language bias are declaratively represented in an evolutionary framework.\r\nThe use of a grammar to define language bias explicitly separates this bias from the learning system. Hence, the opportunity exists for the learning system to modify this bias as an additional strategy for learning. A general technique is described to modify the initial grammar while the evolution for a solution proceeds. Feedback between the evolving grammar and the population of programs is shown to improve the convergence of the learning system. The generalising properties of the learnt grammar are demonstrated by incrementally adapting a grammar for a class of problems.\r\nA theoretical framework, based on the schema theorem for Genetic Algorithms (GA), is presented for CFG-GP. The formal structure of a grammar allows a clear and concise definition of a building block for a general program. The result is shown to be a generalisation of both fixed-length (GA) and variable-length (GP) representations within the one framework."} | 1 | {"work_id": 1491280261, "title": "Grammatical bias for evolutionary learning", "abstract": "A framework for declarative bias, based on the genetic programming paradigm (GP), is presented. The system, CFG-GP, encapsulates background knowledge, inductive bias and program structure. A context-free grammar is used to create a population of programs, represented by their corresponding derivation trees. These computer programs evolve using the principle of Darwinian selection. The grammar biases the form of language that is expressible and the inductive hypotheses that are generated. Using a formal grammar to define the space of legal statements allows a declarative language bias to be stated. The defined language may express knowledge in the form of program structure and incorporate explicit beliefs about the structure of possible solutions. Additionally, the form of the initial population of programs may be explicitly biased using a merit selection operation. This probabilistically biases particular statements generated from the grammar.\r\nThe program induction system, CFG-GP, represents search bias with three operators, namely selective crossover, selective mutation and directed mutation. Each of these operators allows a bias to be explicitly defined in terms of how programs are modified and how the search for a solution proceeds. Hence, both a search and language bias are declaratively represented in an evolutionary framework.\r\nThe use of a grammar to define language bias explicitly separates this bias from the learning system. Hence, the opportunity exists for the learning system to modify this bias as an additional strategy for learning. A general technique is described to modify the initial grammar while the evolution for a solution proceeds. Feedback between the evolving grammar and the population of programs is shown to improve the convergence of the learning system. The generalising properties of the learnt grammar are demonstrated by incrementally adapting a grammar for a class of problems.\r\nA theoretical framework, based on the schema theorem for Genetic Algorithms (GA), is presented for CFG-GP. The formal structure of a grammar allows a clear and concise definition of a building block for a general program. The result is shown to be a generalisation of both fixed-length (GA) and variable-length (GP) representations within the one framework."} | ||
| 5 | −{"work_id": 3122335070, "title": "Design and development of a mobile learning system for computer science education in Nigerian higher education context", "abstract": "This research focuses on the development of a mobile learning system in the context of Nigerian higher education institution.Mobile learning is an important component of the digital-age educational sector, and plays a key role in ubiquitous learning.Similarly, mobile learning is an increasingly important area in computer science discipline.Although several defenitions of the term mobile learning exist, in this research mobile learning refers to teaching and learning approach that employs wireless technologies and mobile devices to support access to learning resources, promotes student direct engagement and interaction regardless of time, place, and context.The changes experienced by mobile learning over the past decade remain unprecedented.However, practical development and contextualization of mobile learning systems are rather inadequate.Recent developments in mobile learning have heightened the need for a mobile learning application that will aid the pedagogy of several topics in computer science education.Moreover, developing countries such as Nigeria have a shortage of mobile learning environments.Therefore, this dissertation seeks to explain the development of mobile learning system for computer science education in Nigerian context.The study stimulates good practice and promotes theoretical underpinning of mobile learning.Part of the aim of this study is to develop an application that will support learning of computing courses on mobile devices and offer guiding principles for integrating mobile learning into mainstream education.This dissertation follows a design science research, with indepth analysis of existing systems, development of a mobile learning application, MobileEdu, testing the application in concrete settings and evaluation of the system for state-of-the-art.After several initial exploratory studies and systematic literature survey, MobileEdu was developed to aid teaching and learning of computer science courses on mobile devices.The concrete settings for both demonstration and evalu-providing the wisdom, knowledge, and inspiration to conduct this research.I would like to express my profound gratitude to my supervisor Dr. Jarkko Suhonen for the incessant support, guidance, counselling, patience, enormous knowledge, and motivation during the time of my Ph.D study and related research.His constructive ideas and huge experiences in this field helped me to obtain a nice experience through the rigorous research process.Dr. Jarkko"} | ||||
| 6 | −{"work_id": 2121903617, "title": "Introduction to evolutionary algorithms", "abstract": "Since they are gleaned from the model of organic evolution, all basic instances of evolutionary algorithms share a number of common properties, which are mentioned here to characterize the prototype of a general evolutionary algorithm: (i) Evolutionary algorithms utilize the collective learning process of a population of individuals. Usually, each individual represents (or encodes) a search point in the space of potential solutions to a given problem. Additionally, individuals may also incorporate further information; for example, strategy parameters (Sections 16.2 and 32.2) of the evolutionary algorithm."} | ||||
| 7 | −{"work_id": 2900179285, "title": "The Reachability Problem for Petri Nets Is Not Elementary", "abstract": "Petri nets, also known as vector addition systems, are a long established model of concurrency with extensive applications in modelling and analysis of hardware, software and database systems, as well as chemical, biological and business processes. The central algorithmic problem for Petri nets is reachability: whether from the given initial configuration there exists a sequence of valid execution steps that reaches the given final configuration. The complexity of the problem has remained unsettled since the 1960s, and it is one of the most prominent open questions in the theory of verification. Decidability was proved by Mayr in his seminal STOC 1981 work, and the currently best published upper bound is non-primitive recursive Ackermannian of Leroux and Schmitz from LICS 2019. We establish a non-elementary lower bound, i.e. that the reachability problem needs a tower of exponentials of time and space. Until this work, the best lower bound has been exponential space, due to Lipton in 1976. The new lower bound is a major breakthrough for several reasons. Firstly, it shows that the reachability problem is much harder than the coverability (i.e., state reachability) problem, which is also ubiquitous but has been known to be complete for exponential space since the late 1970s. Secondly, it implies that a plethora of problems from formal languages, logic, concurrent systems, process calculi and other areas, that are known to admit reductions from the Petri nets reachability problem, are also not elementary. Thirdly, it makes obsolete the currently best lower bounds for the reachability problems for two key extensions of Petri nets: with branching and with a pushdown stack."} | ||||
| 8 | {"work_id": 3139085460, "title": "Reorienting machine learning education towards tinkerers and ML-engaged citizens", "abstract": "Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, September, 2020"} | 2 | {"work_id": 3139085460, "title": "Reorienting machine learning education towards tinkerers and ML-engaged citizens", "abstract": "Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, September, 2020"} | ||
| 9 | {"work_id": 3086066649, "title": "The role of digital learning toward students' satisfaction and university brand image at educational institutes of Pakistan: a post-effect of COVID-19", "abstract": "Purpose This study is undertaken to examine the role of information and communication technology (ICT), e-service quality and e-information quality towards brand image of universities by concentrating on students\u2019 e-learning, e-word of mouth and satisfaction. Design/methodology/approach The target population was the students of public and private universities in Pakistan. Data collected using an e-questionnaire by 408 students were subjected to PLS-SEM for analysis. Findings Findings revealed that ICT, e-service quality and e-information quality are positively contributed toward students' e-learning which ultimately leads to create positive e-word of mouth and students' satisfaction. Meanwhile, results also identified that e-word of mouth and students' satisfaction lead to generate a positive brand image of universities. Practical implications This study has unique implications for universities to develop an e-learning platform to facilitate their students in this situation of COVID-19. It provides guidelines for educational institutions to implement the learning management system effectively with a view to facilitate the students with education. Originality/value This study has novel contribution in literature in the domain of digital learning. It is unique in a way to integrate the usage of technology with students' e-learning and satisfaction that ultimately create brand image of universities."} | 3 | {"work_id": 3086066649, "title": "The role of digital learning toward students' satisfaction and university brand image at educational institutes of Pakistan: a post-effect of COVID-19", "abstract": "Purpose This study is undertaken to examine the role of information and communication technology (ICT), e-service quality and e-information quality towards brand image of universities by concentrating on students\u2019 e-learning, e-word of mouth and satisfaction. Design/methodology/approach The target population was the students of public and private universities in Pakistan. Data collected using an e-questionnaire by 408 students were subjected to PLS-SEM for analysis. Findings Findings revealed that ICT, e-service quality and e-information quality are positively contributed toward students' e-learning which ultimately leads to create positive e-word of mouth and students' satisfaction. Meanwhile, results also identified that e-word of mouth and students' satisfaction lead to generate a positive brand image of universities. Practical implications This study has unique implications for universities to develop an e-learning platform to facilitate their students in this situation of COVID-19. It provides guidelines for educational institutions to implement the learning management system effectively with a view to facilitate the students with education. Originality/value This study has novel contribution in literature in the domain of digital learning. It is unique in a way to integrate the usage of technology with students' e-learning and satisfaction that ultimately create brand image of universities."} | ||
| 4 | +{"work_id": 2560014408, "title": "Maximization of Approximately Submodular Functions", "abstract": "We study the problem of maximizing a function that is approximately submodular under a cardinality constraint. Approximate submodularity implicitly appears in a wide range of applications as in many cases errors in evaluation of a submodular function break submodularity. Say that $F$ is $\\varepsilon$-approximately submodular if there exists a submodular function $f$ such that $(1-\\varepsilon)f(S) \\leq F(S)\\leq (1+\\varepsilon)f(S)$ for all subsets $S$. We are interested in characterizing the query-complexity of maximizing $F$ subject to a cardinality constraint $k$ as a function of the error level $\\varepsilon>0$. We provide both lower and upper bounds: for $\\varepsilon>n^{-1/2}$ we show an exponential query-complexity lower bound. In contrast, when $\\varepsilon< {1}/{k}$ or under a stronger bounded curvature assumption, we give constant approximation algorithms."} | ||||
| 10 | {"work_id": 4377102915, "title": "Challenges, opportunities, and prospects of adopting and using smart digital technologies in learning environments: An iterative review", "abstract": "The adoption of smart digital technologies in the education system has grown exponentially over the years, creating new possibilities to improve teaching and enhance learning. Against this backdrop, the 'brick-and-mortar' education approach survives on life support, with digital technologies promoting ubiquitous teaching and learning. Through complexity theory, this study uses an iterative review research approach comprising of nine steps to frame the study of smart digital education. The complexity theory lens provides an appropriate framework to reason about the complexities that surface due to interactions of the elements of smart digital technologies in the education system. The complementary strength of the adopted methodological approach led to multiple discourses on technology-enabled and technology-enhanced learning environments. In particular, four broad themes emerged, which demonstrated the prevalence of various technologies and how they interact as a means of making sense of the emerging digitally-enabled education environment. Through these themes, this paper highlights digitalisation affordances (which include multimodality, a/synchronicity, and new forms of engagement), discusses the key challenges and complexities of digitally enabled education, and advances the discourse on how digitalisation can support and promote inclusivity amidst historic challenges. Finally, it discusses how the advancement of technologies provides a new paradigm of learning, revolutionises knowledge construction, and extends and enriches the 'brick-and-mortar' learning environment to enhance the educational experience. As a future research agenda, this paper recommends comprehensive end-to-end programmes and innovative ways to conceptualise and execute digitally-enabled education that provides equity-oriented opportunities for cognitive development."} | 5 | {"work_id": 4377102915, "title": "Challenges, opportunities, and prospects of adopting and using smart digital technologies in learning environments: An iterative review", "abstract": "The adoption of smart digital technologies in the education system has grown exponentially over the years, creating new possibilities to improve teaching and enhance learning. Against this backdrop, the 'brick-and-mortar' education approach survives on life support, with digital technologies promoting ubiquitous teaching and learning. Through complexity theory, this study uses an iterative review research approach comprising of nine steps to frame the study of smart digital education. The complexity theory lens provides an appropriate framework to reason about the complexities that surface due to interactions of the elements of smart digital technologies in the education system. The complementary strength of the adopted methodological approach led to multiple discourses on technology-enabled and technology-enhanced learning environments. In particular, four broad themes emerged, which demonstrated the prevalence of various technologies and how they interact as a means of making sense of the emerging digitally-enabled education environment. Through these themes, this paper highlights digitalisation affordances (which include multimodality, a/synchronicity, and new forms of engagement), discusses the key challenges and complexities of digitally enabled education, and advances the discourse on how digitalisation can support and promote inclusivity amidst historic challenges. Finally, it discusses how the advancement of technologies provides a new paradigm of learning, revolutionises knowledge construction, and extends and enriches the 'brick-and-mortar' learning environment to enhance the educational experience. As a future research agenda, this paper recommends comprehensive end-to-end programmes and innovative ways to conceptualise and execute digitally-enabled education that provides equity-oriented opportunities for cognitive development."} | ||
| 11 | −{"work_id": 3183881215, "title": "Introduction to Algorithms", "abstract": "We briefly discussed what we mean by algorithms in Chapter 1 , but perhaps it bears repeating; algorithms are recipes for solving a specific computational problem. They describe the steps you (or more usually your computer) must take to get from input to output and should guarantee you that if you follow the instructions exactly, you will (1) finish after a finite number of steps and (2) your output will be a solution to the problem they should solve, given the input you had."} | ||||
| 12 | {"work_id": 4394806711, "title": "Artificial intelligence and social media on academic performance and mental well-being: Student perceptions of positive impact in the age of smart learning", "abstract": "The advancement of artificial intelligence (AI) and the ubiquity of social media have become transformative agents in contemporary educational ecosystems. The spotlight of this inquiry focuses on the nexus between AI and social media usage in relation to academic performance and mental well-being, and the role of smart learning in facilitating these relationships. Using partial least squares-structural equation modeling (PLS-SEM) on a sample of 401 Chinese university students. The study results reveal that both AI and social media have a positive impact on academic performance and mental well-being among university students. Furthermore, smart learning serves as a positive mediating variable, amplifying the beneficial effects of AI and social media on both academic performance and mental well-being. These revelations contribute to the discourse on technology-enhanced education, showing that embracing AI and social media can have a positive impact on student performance and well-being."} | 6 | {"work_id": 4394806711, "title": "Artificial intelligence and social media on academic performance and mental well-being: Student perceptions of positive impact in the age of smart learning", "abstract": "The advancement of artificial intelligence (AI) and the ubiquity of social media have become transformative agents in contemporary educational ecosystems. The spotlight of this inquiry focuses on the nexus between AI and social media usage in relation to academic performance and mental well-being, and the role of smart learning in facilitating these relationships. Using partial least squares-structural equation modeling (PLS-SEM) on a sample of 401 Chinese university students. The study results reveal that both AI and social media have a positive impact on academic performance and mental well-being among university students. Furthermore, smart learning serves as a positive mediating variable, amplifying the beneficial effects of AI and social media on both academic performance and mental well-being. These revelations contribute to the discourse on technology-enhanced education, showing that embracing AI and social media can have a positive impact on student performance and well-being."} | ||
| 13 | {"work_id": 7133302269, "title": "AI-assisted learning tools and student learning outcomes: A cognitive load theory perspective", "abstract": "Artificial intelligence (AI) is transforming higher education, yet its impact on students' learning outcomes depends on how effectively these tools are used, perceived, and supported within learning environments. Guided by Cognitive Load Theory (CLT), this study examines how AI-Assisted Learning Tools Usage (AIALTU) and the Perceived Usefulness of AI in Education (PUAIE) influence university students\u2019 Learning Outcomes (LO), with Student Engagement (SE) as a mediator and Digital Readiness (DR) as a moderator. Data were collected from 400 students across top Saudi universities using a validated bilingual survey instrument and analyzed using Partial Least Squares Structural Equation Modeling (PLS-SEM). Results show that both AIALTU and PUAIE significantly enhance learning outcomes, and SE partially mediates both relationships, highlighting engagement as a key cognitive mechanism through which AI tools contribute to academic success. DR significantly strengthens the effect of perceived usefulness on learning outcomes but does not alter the influence of actual tool usage, suggesting that intuitive AI design reduces dependence on digital skills. These findings extend CLT by demonstrating how technological, cognitive, and learner-readiness factors jointly shape learning effectiveness in AI-supported settings. The study offers practical insights for universities aiming to align AI integration with Vision 2030 goals by prioritizing student engagement, intuitive tool design, and digital readiness development. Overall, the results underscore the importance of combining advanced AI technologies with supportive learning strategies to achieve meaningful improvements in student learning outcomes."} | 7 | {"work_id": 7133302269, "title": "AI-assisted learning tools and student learning outcomes: A cognitive load theory perspective", "abstract": "Artificial intelligence (AI) is transforming higher education, yet its impact on students' learning outcomes depends on how effectively these tools are used, perceived, and supported within learning environments. Guided by Cognitive Load Theory (CLT), this study examines how AI-Assisted Learning Tools Usage (AIALTU) and the Perceived Usefulness of AI in Education (PUAIE) influence university students\u2019 Learning Outcomes (LO), with Student Engagement (SE) as a mediator and Digital Readiness (DR) as a moderator. Data were collected from 400 students across top Saudi universities using a validated bilingual survey instrument and analyzed using Partial Least Squares Structural Equation Modeling (PLS-SEM). Results show that both AIALTU and PUAIE significantly enhance learning outcomes, and SE partially mediates both relationships, highlighting engagement as a key cognitive mechanism through which AI tools contribute to academic success. DR significantly strengthens the effect of perceived usefulness on learning outcomes but does not alter the influence of actual tool usage, suggesting that intuitive AI design reduces dependence on digital skills. These findings extend CLT by demonstrating how technological, cognitive, and learner-readiness factors jointly shape learning effectiveness in AI-supported settings. The study offers practical insights for universities aiming to align AI integration with Vision 2030 goals by prioritizing student engagement, intuitive tool design, and digital readiness development. Overall, the results underscore the importance of combining advanced AI technologies with supportive learning strategies to achieve meaningful improvements in student learning outcomes."} | ||
| 14 | −{"work_id": 2112641412, "title": "A Dynamic Survey of Graph Labeling", "abstract": "A graph labeling is an assignment of integers to the vertices or edges, or both, subject to certain conditions. Graph labelings were first introduced in the mid-1960s. In the intervening years over 200 graph labelings techniques have been studied in over 3000 papers. Finding out what has been done for any particular kind of labeling and keeping up with new discoveries is difficult because of the sheer number of papers and because many of the papers have appeared in journals that are not widely available. In this survey, I have collected everything I could find on graph labeling. For the convenience of the reader, the survey includes a detailed table of contents and index. This edition has 267 new references that are identified with the reference number and the word \"new\" in the right margin."} | 8 | +{"work_id": 2118110454, "title": "WHEN BI-INTERPRETABILITY IMPLIES SYNONYMY", "abstract": "Abstract Two salient notions of sameness of theories are synonymy , aka definitional equivalence , and bi-interpretability . Of these two definitional equivalence is the strictest notion. In which cases can we infer synonymy from bi-interpretability? We study this question for the case of sequential theories. Our result is as follows. Suppose that two sequential theories are bi-interpretable and that the interpretations involved in the bi-interpretation are one-dimensional and identity preserving. Then, the theories are synonymous. The crucial ingredient of our proof is a version of the Schr\u00f6der\u2013Bernstein theorem under very weak conditions. We think this last result has some independent interest. We provide an example to show that this result is optimal. There are two finitely axiomatized sequential theories that are bi-interpretable but not synonymous, where precisely one of the interpretations involved in the bi-interpretation is not identity preserving."} | ||
| 15 | −{"work_id": 7122741622, "title": "Recent Advances in Digital Fringe Projection Profilometry (2022\u20132025): Techniques, Applications, and Metrological Challenges\u2014A Review", "abstract": "Digital fringe projection profilometry (DFPP) is a widely used technique for full-field, non-contact 3D surface measurement, offering precision from the sub-micrometer-to-millimeter scale depending on system geometry and fringe design. This review provides a consolidated synthesis of advances reported between 2022 and 2025, covering projection and imaging architectures, phase formation and unwrapping strategies, calibration approaches, high-speed implementations, and learning-based reconstruction methods. A central contribution of this review is the integration of these developments within a metrological perspective, explicitly relating phase\u2013height transformation, fringe parameters, system geometry, and calibration to dominant uncertainty sources and error propagation. Recent progress highlights trade-offs between sensitivity, robustness, computational complexity, and applicability to non-ideal surfaces, while learning-based and hybrid optical\u2013computational approaches demonstrate substantial improvements in reconstruction reliability under challenging conditions. Remaining challenges include measurements on reflective or transparent surfaces, dynamic scenes, environmental instability, and real-time operation. The review outlines emerging research directions such as physics-informed learning, digital twins, programmable optics, and autonomous calibration, providing guidance for the development of next-generation DFPP systems for precision metrology."} | 9 | +{"work_id": 73572444, "title": "Complexity Theory and the Social Sciences", "abstract": "This expanded and updated edition of Complexity Theory and the Social Sciences: The State of the Art revisits the use of complexity theory across the social sciences and demonstrates how complexity informs approaches to various contemporary issues in the context of the COVID-19 pandemic, widening social inequality, and impending social and ecological catastrophe wrought by global warming. The book reviews complexity theory in the practice of the social sciences and at their interface with ecological science. It outlines how social theory can be reconciled with complexity thinking and presents a review of the way research can be done using complexity theory. The book suggests how complexity theory can be used to understand and evaluate governance processes, particularly with regard to social inequality and the climate crisis. The impact of the COVID-19 pandemic is also examined through a complexity lens, reviewing how complexity thinking has been employed in relation to the pandemic and how implementing a complexity framework can transform health and social care. The book concludes with a call to action and the use of complexity theory to inform critical thinking in the education system. This textbook will be immensely useful to students and researchers interested in social research methods, social theory, business and organization studies, health, education, urban studies, and development studies."} | ||
| 16 | −{"work_id": 7155156112, "title": "Gray langurs optimizer: a multi-group bio-inspired optimization algorithm", "abstract": "Many real-world problems are optimizable in nature. These problems often have numerous decision variables and constraints, making it difficult to optimize their objective function. To solve these problems, a group of algorithms known as metaheuristic algorithms has been introduced, which, considering the problem constraints, can find the optimal values of the decision variables in a reasonable amount of time to optimize the value of the objective function(s). Due to the importance and high application of these algorithms, a new metaheuristic optimization algorithm called Gray Langurs Optimizer (GLO) has been introduced in this research. The fundamental inspiration for the GLO is the group behavior of gray langurs in nature. The gray langurs are observed in three groups: one-male, multi-male, and all-male groups. The GLO mathematically simulates the group behavior and social hierarchy of gray langurs in all three groups. The migration of gray langurs between groups due to the death of the alpha or other group members, mate finding, and puberty is formulated by GLO. Additionally, the GLO models the arbitrary behavior of gray langurs within their territory. The GLO is tested on twenty-three classical test functions, including unimodal, multimodal, and fixed-dimension benchmarks, as well as twenty-seven CEC17 test functions, which comprise shifted, rotated, and composite benchmarks. The GLO is also applied to six real-world applications, and its results are compared with those of eight state-of-the-art algorithms both numerically and visually. The experimental results demonstrate the high capability of GLO in optimizing the various test functions and real-world applications. The MATLAB and Python implementations of GLO are available at https://nimakhodadadi.com ."} | 10 | +{"work_id": 4406080942, "title": "Artificial lemming algorithm: a novel bionic meta-heuristic technique for solving real-world engineering optimization problems", "abstract": "The advent of the intelligent information era has witnessed a proliferation of complex optimization problems across various disciplines. Although existing meta-heuristic algorithms have demonstrated efficacy in many scenarios, they still struggle with certain challenges such as premature convergence, insufficient exploration, and lack of robustness in high-dimensional, nonconvex search spaces. These limitations underscore the need for novel optimization techniques that can better balance exploration and exploitation while maintaining computational efficiency. In response to this need, we propose the Artificial Lemming Algorithm (ALA), a bio-inspired metaheuristic that mathematically models four distinct behaviors of lemmings in nature: long-distance migration, digging holes, foraging, and evading predators. Specifically, the long-distance migration and burrow digging behaviors are dedicated to highly exploring the search domain, whereas the foraging and evading predators behaviors provide exploitation during the optimization process. In addition, ALA incorporates an energy-decreasing mechanism that enables dynamic adjustments to the balance between exploration and exploitation, thereby enhancing its ability to evade local optima and converge to global solutions more robustly. To thoroughly verify the effectiveness of the proposed method, ALA is compared with 17 other state-of-the-art meta-heuristic algorithms on the IEEE CEC2017 benchmark test suite and the IEEE CEC2022 benchmark test suite. The experimental results indicate that ALA has reliable comprehensive optimization performance and can achieve superior solution accuracy, convergence speed, and stability in most test cases. For the 29 10-, 30-, 50-, and 100-dimensional CEC2017 functions, ALA obtains the lowest Friedman average ranking values among all competitor methods, which are 1.7241, 2.1034, 2.7241, and 2.9310, respectively, and for the 12 CEC2022 functions, ALA again wins the optimal Friedman average ranking of 2.1667. Finally, to further evaluate its applicability, ALA is implemented to address a series of optimization cases, including constrained engineering design, photovoltaic (PV) model parameter identification, and fractional-order proportional-differential-integral (FOPID) controller gain tuning. Our findings highlight the competitive edge and potential of ALA for real-world engineering applications. The source code of ALA is publicly available at https://github.com/StevenShaw98/Artificial-Lemming-Algorithm ."} | ||
| 11 | +{"work_id": 2117226423, "title": "Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem", "abstract": "Abstract An O( n 3 ) heuristic algorithm is described for solving d -city travelling salesman problems (TSP) whose cost matrix satisfies the triangularity condition. The algorithm involves as substeps the computation of a shortest spanning tree of the graph G defining the TSP and the finding of a minimum cost perfect matching of a certain induced subgraph of G . A worst-case analysis of this heuristic shows that the ratio of the answer obtained to the optimum TSP solution is strictly less than 3/2. This represents a 50% reduction over the value 2 which was the previously best known such ratio for the performance of other polynomial growth algorithms for the TSP."} | ||||
| 12 | +{"work_id": 2808541536, "title": "Meet-continuity and locally compact sober dcpos", "abstract": "In this thesis, we investigate meet-continuity over dcpos. We give different equivalent descriptions of meet-continuous dcpos, among which an important characterisation is given via forbidden substructures. By checking the function space of such substructures we prove, as a central contribution, that any dcpo with a core-compact function space must be meet-continuous. As an application , this result entails that any cartesian closed full subcategory of quasicontinuous domains consists of continuous domains entirely. That is to say , both the category of continuous domains and that of quasicontinuous domains share the same cartesian closed full subcategories. \\nOur new characterisation of meet-continuous dcpos also allows us to say more about full subcategories of locally compact sober dcpos which are generalisations of quasicontinuous domains. After developing some theory of characterising coherence and bicompleteness of dcpos, we conclude that any cartesian closed full subcategory of pointed locally compact sober dcpos is entirely contained in the category of stably compact dcpos or that of L-dcpos. \\nAs a by-product, our study of coherence of dcpos enables us to characterise Lawson-compactness over arbitrary dcpos. \\n"} | ||||
| 17 | {"work_id": 2207864362, "title": "Properties of some algebraically defined digraphs", "abstract": "This thesis is concerned with the study of a family of digraphs defined by systems of polynomial equations over finite fields. We explore the connectivity and diameter of some special classes of these digraphs, along with the structure of their isomorphism classes."} | 13 | {"work_id": 2207864362, "title": "Properties of some algebraically defined digraphs", "abstract": "This thesis is concerned with the study of a family of digraphs defined by systems of polynomial equations over finite fields. We explore the connectivity and diameter of some special classes of these digraphs, along with the structure of their isomorphism classes."} | ||
| 18 | {"work_id": 4285092328, "title": "A Note on Two Problems in Connexion with Graphs", "abstract": "chapter Share on A Note on Two Problems in Connexion with Graphs Author: E. W. Dijkstra View Profile Authors Info & Claims Edsger Wybe Dijkstra: His Life,Work, and LegacyJuly 2022 Pages 287\u2013290https://doi.org/10.1145/3544585.3544600Published:13 July 2022Publication History 1citation11DownloadsMetricsTotal Citations1Total Downloads11Last 12 Months11Last 6 weeks5 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my Alerts New Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access"} | 14 | {"work_id": 4285092328, "title": "A Note on Two Problems in Connexion with Graphs", "abstract": "chapter Share on A Note on Two Problems in Connexion with Graphs Author: E. W. Dijkstra View Profile Authors Info & Claims Edsger Wybe Dijkstra: His Life,Work, and LegacyJuly 2022 Pages 287\u2013290https://doi.org/10.1145/3544585.3544600Published:13 July 2022Publication History 1citation11DownloadsMetricsTotal Citations1Total Downloads11Last 12 Months11Last 6 weeks5 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my Alerts New Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access"} | ||
| 19 | −{"work_id": 4241184911, "title": "Two-Dimensional Cellular Automata", "abstract": "This chapter presents an exploratory study of two-dimensional cellular automata. The extension to two dimensions is significant for comparisons with many experimental results on pattern formation in physical systems. The chapter considers primarily square lattices, with the two neighborhood structures. It describes a phenomenological study of typical two-dimensional cellular automata. Its approach is largely experimental in character: cellular automaton rules are selected and their evolution from various initial states is traced by direct simulation. The chapter reports evidence that certain global properties of two-dimensional cellular automata are very similar to those of one-dimensional cellular automata. It discusses the evolution of two-dimensional cellular automata from simple \"seeds,\" consisting of a few nonzero initial sites. The chapter considers evolution from typical disordered initial states. It discusses some quantitative characterizations of the global properties of two-dimensional cellular automata. The chapter discusses patterns formed by the evolution of cellular automata from simple seeds. It presents an exploratory study of two-dimensional cellular automata."} | 15 | +{"work_id": 7128526706, "title": "Glider snake optimizer (GSO): a nature-inspired metaheuristic algorithm for global and engineering optimization problems", "abstract": "Abstract The rapid expansion of complex engineering and real-world optimization problems necessitates the development of efficient, adaptable, and computationally lightweight metaheuristic algorithms. In this study, a novel nature-inspired algorithm called glider snake optimization (GSO) is proposed, which draws behavioral inspiration from the gliding and serpentine locomotion patterns of arboreal snakes to enhance solution exploration and convergence control. The GSO algorithm incorporates a multi-segment movement mechanism, a flexible gliding path generator, and an elite guidance model to ensure effective balance between exploration and exploitation. Extensive experimental validation is conducted using a comprehensive set of 23 classical benchmark functions, high-dimensional test cases (100D, and 500D), the CEC 2019 benchmark suite, and several constrained engineering design problems. The results demonstrate that GSO outperforms or matches 13 state-of-the-art algorithms, including particle swarm optimization (PSO), grey wolf optimizer (GWO), whale optimization algorithm (WOA), and differential evolution (DE) in terms of accuracy, convergence speed, computational cost, and robustness. The algorithm also exhibits exceptional stability across parameter variations, as confirmed through sensitivity analysis and statistical significance testing. These findings highlight the potential of GSO as a powerful and efficient tool for solving complex optimization problems in both theoretical and practical domains. Additionally, GSO achieves leading performance on most benchmark functions, with error reductions of up to 90% compared with competing algorithms. GSO also demonstrates faster convergence and lower variance across repeated trials, confirming its robustness. These quantitative outcomes further reinforce the effectiveness of the proposed algorithm. The MATLAB and Python implementations of GSO are available at https://nimakhodadadi.com ."} | ||
| 20 | −{"work_id": 4311415873, "title": "Fast Kd-Trees for the Kullback-Leibler Divergence and Other Decomposable Bregman Divergences", "abstract": "The contributions of the paper span theoretical and implementational results. First, we prove that Kd-trees can be extended to \u211d^d with the distance measured by an arbitrary Bregman divergence. Perhaps surprisingly, this shows that the triangle inequality is not necessary for correct pruning in Kd-trees. Second, we offer an efficient algorithm and C++ implementation for nearest neighbour search for decomposable Bregman divergences. The implementation supports the Kullback-Leibler divergence (relative entropy) which is a popular distance between probability vectors and is commonly used in statistics and machine learning. This is a step toward broadening the usage of computational geometry algorithms. Our benchmarks show that our implementation efficiently handles both exact and approximate nearest neighbour queries. Compared to a linear search, we achieve two orders of magnitude speedup for practical scenarios in dimension up to 100. Our solution is simpler and more efficient than competing methods."} | 16 | +{"work_id": 2125690626, "title": "Combinatorial optimization: networks and matroids", "abstract": "Perceptively written text examines optimization problems that can be formulated in terms of networks and algebraic structures called matroids. Chapters cover shortest paths, network flows, bipartite matching, nonbipartite matching, matroids and the greedy algorithm, matroid intersections, and the matroid parity problems. A suitable text or reference for courses in combinatorial computing and concrete computational complexity in departments of computer science and mathematics."} | ||
| 21 | −{"work_id": 4405348595, "title": "Positive Definite Matrices", "abstract": "placeholder notes"} | ||||
| 22 | −{"work_id": 3119051141, "title": "The Arithmetic Optimization Algorithm", "abstract": "This work proposes a new meta-heuristic method called Arithmetic Optimization Algorithm (AOA) that utilizes the distribution behavior of the main arithmetic operators in mathematics including (Multiplication (M), Division (D), Subtraction (S), and Addition (A)). AOA is mathematically modeled and implemented to perform the optimization processes in a wide range of search spaces. The performance of AOA is checked on twenty-nine benchmark functions and several real-world engineering design problems to showcase its applicability. The analysis of performance, convergence behaviors, and the computational complexity of the proposed AOA have been evaluated by different scenarios. Experimental results show that the AOA provides very promising results in solving challenging optimization problems compared with eleven other well-known optimization algorithms. Source codes of AOA are publicly available at and ."} | ||||
| 23 | −{"work_id": 2003494253, "title": "Algorithms+Data Structures = Programs", "abstract": "Learn with confidence with this hands-on undergraduate textbook for CS2 courses. Active-learning and real-world projects underpin each chapter, briefly reviewing programming fundamentals then progressing to core data structures and algorithms topics including recursion, lists, stacks, trees, graphs, sorting, and complexity analysis. Creative projects and applications put theoretical concepts into practice, helping students master the fundamentals. Dedicated project chapters supply further programming practice using real-world, interdisciplinary problems which students can showcase in their own online portfolios. Example Interview Questions sections prepare students for job applications. The pedagogy supports self-directed and skills-based learning with over 250 'Try It Yourself' boxes, many with solutions provided, and over 500 progressively challenging end-of-chapter questions. Written in a clear and engaging style, this textbook is a complete resource for teaching the fundamental skills that today's students need. Instructor resources are available online, including a test bank, solutions manual, and sample code."} | ||||
| 24 | {"work_id": 2891784792, "title": "Improving Online Algorithms via ML Predictions", "abstract": "In this work we study the problem of using machine-learned predictions to improve the performance of online algorithms. We consider two classical problems, ski rental and non-clairvoyant job scheduling, and obtain new online algorithms that use predictions to make their decisions. These algorithms are oblivious to the performance of the predictor, improve with better predictions, but do not degrade much if the predictions are poor."} | 17 | {"work_id": 2891784792, "title": "Improving Online Algorithms via ML Predictions", "abstract": "In this work we study the problem of using machine-learned predictions to improve the performance of online algorithms. We consider two classical problems, ski rental and non-clairvoyant job scheduling, and obtain new online algorithms that use predictions to make their decisions. These algorithms are oblivious to the performance of the predictor, improve with better predictions, but do not degrade much if the predictions are poor."} | ||
| 25 | {"work_id": 2905177801, "title": "Optimal trees for prediction and prescription", "abstract": "Thesis: Ph. D., Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, 2018."} | 18 | {"work_id": 2905177801, "title": "Optimal trees for prediction and prescription", "abstract": "Thesis: Ph. D., Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, 2018."} | ||
| 19 | +{"work_id": 2398690976, "title": "Online Task Assignment in Crowdsourcing Markets", "abstract": "We explore the problem of assigning heterogeneous tasks to workers with different, unknown skill sets in crowdsourcing markets such as Amazon Mechanical Turk. We first formalize the online task assignment problem, in which a requester has a fixed set of tasks and a budget that specifies how many times he would like each task completed. Workers arrive one at a time (with the same worker potentially arriving multiple times), and must be assigned to a task upon arrival. The goal is to allocate workers to tasks in a way that maximizes the total benefit that the requester obtains from the completed work. Inspired by recent research on the online adwords problem, we present a two-phase exploration-exploitation assignment algorithm and prove that it is competitive with respect to the optimal offline algorithm which has access to the unknown skill levels of each worker. We empirically evaluate this algorithm using data collected on Mechanical Turk and show that it performs better than random assignment or greedy algorithms. To our knowledge, this is the first work to extend the online primal-dual technique used in the online adwords problem to a scenario with unknown parameters, and the first to offer an empirical validation of an online primal-dual algorithm."} | ||||
| 26 | {"work_id": 2957144896, "title": "Factors Determining the Behavioral Intention to Use Mobile Learning: An Application and Extension of the UTAUT Model", "abstract": "This study developed and empirically tested a model to predict the factors affecting students' behavioral intentions toward using mobile learning (m-learning). This study explored the behavioral intention to use m-learning from the perspective of consumers by applying the extended unified theory of acceptance and use of technology (UTAUT) model with the addition of perceived enjoyment, mobile self-efficacy, satisfaction, trust, and perceived risk moderators. A cross-sectional study was conducted by employing a research model based on multiple technology acceptance theories. Data were derived from an online survey with 1,562 respondents and analyzed using structural equation modeling. Partial least squares (PLS) regression was used for model and hypothesis testing. The results revealed that (1) behavioral intention was significantly and positively influenced by satisfaction, trust, performance expectancy, and effort expectancy; (2) perceived enjoyment, performance expectancy, and effort expectancy had positive associations with behavioral intention; (3) mobile self-efficacy had a significantly positive effect on perceived enjoyment; and (4) perceived risk had a significantly negative moderating effect on the relationship between performance expectancy and behavioral intention. Our findings correspond with the UTAUT model and provide a practical reference for educational institutions and decision-makers involved in designing m-learning for implementation in universities."} | 20 | {"work_id": 2957144896, "title": "Factors Determining the Behavioral Intention to Use Mobile Learning: An Application and Extension of the UTAUT Model", "abstract": "This study developed and empirically tested a model to predict the factors affecting students' behavioral intentions toward using mobile learning (m-learning). This study explored the behavioral intention to use m-learning from the perspective of consumers by applying the extended unified theory of acceptance and use of technology (UTAUT) model with the addition of perceived enjoyment, mobile self-efficacy, satisfaction, trust, and perceived risk moderators. A cross-sectional study was conducted by employing a research model based on multiple technology acceptance theories. Data were derived from an online survey with 1,562 respondents and analyzed using structural equation modeling. Partial least squares (PLS) regression was used for model and hypothesis testing. The results revealed that (1) behavioral intention was significantly and positively influenced by satisfaction, trust, performance expectancy, and effort expectancy; (2) perceived enjoyment, performance expectancy, and effort expectancy had positive associations with behavioral intention; (3) mobile self-efficacy had a significantly positive effect on perceived enjoyment; and (4) perceived risk had a significantly negative moderating effect on the relationship between performance expectancy and behavioral intention. Our findings correspond with the UTAUT model and provide a practical reference for educational institutions and decision-makers involved in designing m-learning for implementation in universities."} | ||
| 27 | {"work_id": 4294558607, "title": "Targeted Branching for the Maximum Independent Set Problem Using Graph Neural Networks", "abstract": "Identifying a maximum independent set is a fundamental NP-hard problem. This problem has several real-world applications and requires finding the largest possible set of vertices not adjacent to each other in an undirected graph. Over the past few years, branch-and-bound and branch-and-reduce algorithms have emerged as some of the most effective methods for solving the problem exactly. Specifically, the branch-and-reduce approach, which combines branch-and-bound principles with reduction rules, has proven particularly successful in tackling previously unmanageable real-world instances. This progress was largely made possible by the development of more effective reduction rules. Nevertheless, other key components that can impact the efficiency of these algorithms have not received the same level of interest. Among these is the branching strategy, which determines which vertex to branch on next. Until recently, the most widely used strategy was to choose the vertex of the highest degree. In this work, we present a graph neural network approach for selecting the next branching vertex. The intricate nature of current branch-and-bound solvers makes supervised and reinforcement learning difficult. Therefore, we use a population-based genetic algorithm to evolve the model\u2019s parameters instead. Our proposed approach results in a speedup on 73% of the benchmark instances with a median speedup of 24%."} | 21 | {"work_id": 4294558607, "title": "Targeted Branching for the Maximum Independent Set Problem Using Graph Neural Networks", "abstract": "Identifying a maximum independent set is a fundamental NP-hard problem. This problem has several real-world applications and requires finding the largest possible set of vertices not adjacent to each other in an undirected graph. Over the past few years, branch-and-bound and branch-and-reduce algorithms have emerged as some of the most effective methods for solving the problem exactly. Specifically, the branch-and-reduce approach, which combines branch-and-bound principles with reduction rules, has proven particularly successful in tackling previously unmanageable real-world instances. This progress was largely made possible by the development of more effective reduction rules. Nevertheless, other key components that can impact the efficiency of these algorithms have not received the same level of interest. Among these is the branching strategy, which determines which vertex to branch on next. Until recently, the most widely used strategy was to choose the vertex of the highest degree. In this work, we present a graph neural network approach for selecting the next branching vertex. The intricate nature of current branch-and-bound solvers makes supervised and reinforcement learning difficult. Therefore, we use a population-based genetic algorithm to evolve the model\u2019s parameters instead. Our proposed approach results in a speedup on 73% of the benchmark instances with a median speedup of 24%."} | ||
| 28 | −{"work_id": 3111526966, "title": "Introduction to Algorithms", "abstract": "This chapter looks at a number of different algorithms to get some practice in tracing and trying to understand algorithms. Algorithms play an extremely important role in both computer science and mathematics. Algorithms are detailed instructions on how to carry out some specific task. Computer programs are implementations of algorithms, so it is very important that computer science majors and programmers have a good understanding of how algorithms work. Designing an algorithm is one of the first steps in writing a computer program. In order to make algorithms easier for understand they are written in a form of English called pseudocode. Algorithms use something called control structures to tell the algorithm what to do at different times. These are instructions that control how the algorithm works. Conditional controls give conditions for the execution of an algorithm step. Loop controls tell how many times a step in the algorithm should be executed."} | 22 | +{"work_id": 2112641412, "title": "A Dynamic Survey of Graph Labeling", "abstract": "A graph labeling is an assignment of integers to the vertices or edges, or both, subject to certain conditions. Graph labelings were first introduced in the mid-1960s. In the intervening years over 200 graph labelings techniques have been studied in over 3000 papers. Finding out what has been done for any particular kind of labeling and keeping up with new discoveries is difficult because of the sheer number of papers and because many of the papers have appeared in journals that are not widely available. In this survey, I have collected everything I could find on graph labeling. For the convenience of the reader, the survey includes a detailed table of contents and index. This edition has 267 new references that are identified with the reference number and the word \"new\" in the right margin."} | ||
| 29 | −{"work_id": 7128526706, "title": "Glider snake optimizer (GSO): a nature-inspired metaheuristic algorithm for global and engineering optimization problems", "abstract": "Abstract The rapid expansion of complex engineering and real-world optimization problems necessitates the development of efficient, adaptable, and computationally lightweight metaheuristic algorithms. In this study, a novel nature-inspired algorithm called glider snake optimization (GSO) is proposed, which draws behavioral inspiration from the gliding and serpentine locomotion patterns of arboreal snakes to enhance solution exploration and convergence control. The GSO algorithm incorporates a multi-segment movement mechanism, a flexible gliding path generator, and an elite guidance model to ensure effective balance between exploration and exploitation. Extensive experimental validation is conducted using a comprehensive set of 23 classical benchmark functions, high-dimensional test cases (100D, and 500D), the CEC 2019 benchmark suite, and several constrained engineering design problems. The results demonstrate that GSO outperforms or matches 13 state-of-the-art algorithms, including particle swarm optimization (PSO), grey wolf optimizer (GWO), whale optimization algorithm (WOA), and differential evolution (DE) in terms of accuracy, convergence speed, computational cost, and robustness. The algorithm also exhibits exceptional stability across parameter variations, as confirmed through sensitivity analysis and statistical significance testing. These findings highlight the potential of GSO as a powerful and efficient tool for solving complex optimization problems in both theoretical and practical domains. Additionally, GSO achieves leading performance on most benchmark functions, with error reductions of up to 90% compared with competing algorithms. GSO also demonstrates faster convergence and lower variance across repeated trials, confirming its robustness. These quantitative outcomes further reinforce the effectiveness of the proposed algorithm. The MATLAB and Python implementations of GSO are available at https://nimakhodadadi.com ."} | 23 | +{"work_id": 7122741622, "title": "Recent Advances in Digital Fringe Projection Profilometry (2022\u20132025): Techniques, Applications, and Metrological Challenges\u2014A Review", "abstract": "Digital fringe projection profilometry (DFPP) is a widely used technique for full-field, non-contact 3D surface measurement, offering precision from the sub-micrometer-to-millimeter scale depending on system geometry and fringe design. This review provides a consolidated synthesis of advances reported between 2022 and 2025, covering projection and imaging architectures, phase formation and unwrapping strategies, calibration approaches, high-speed implementations, and learning-based reconstruction methods. A central contribution of this review is the integration of these developments within a metrological perspective, explicitly relating phase\u2013height transformation, fringe parameters, system geometry, and calibration to dominant uncertainty sources and error propagation. Recent progress highlights trade-offs between sensitivity, robustness, computational complexity, and applicability to non-ideal surfaces, while learning-based and hybrid optical\u2013computational approaches demonstrate substantial improvements in reconstruction reliability under challenging conditions. Remaining challenges include measurements on reflective or transparent surfaces, dynamic scenes, environmental instability, and real-time operation. The review outlines emerging research directions such as physics-informed learning, digital twins, programmable optics, and autonomous calibration, providing guidance for the development of next-generation DFPP systems for precision metrology."} | ||
| 24 | +{"work_id": 2181620480, "title": "Robust solutions for constraint satisfaction and optimisation under uncertainty.", "abstract": "We develop a framework for finding robust solutions of constraint programs. Our approach is based on the notion of fault tolerance. We formalise this concept within constraint programming, extend it in several dimensions and introduce some algorithms to find robust solutions efficiently. When applying constraint programming to real world problems we often face uncertainty. Whilst reactive methods merely deal with the consequences of an unexpected change, taking a more proactive approach may guarantee a certain level of robustness. We propose to apply the fault tolerance framework, introduced in [Ginsberg 98], to constraint programming: A robust solution is one such that a small perturbation only requires a small response. We identify, define and classify a number of abstract problems related to stability within constraint satisfaction or optimisation. We propose some efficient and effective algorithms for solving these problems. We then extend this framework by allowing the repairs and perturbations themselves to be constrained. Finally, we assess the practicality of this framework on constraint satisfaction and scheduling problems."} | ||||
| 25 | +{"work_id": 7155156112, "title": "Gray langurs optimizer: a multi-group bio-inspired optimization algorithm", "abstract": "Many real-world problems are optimizable in nature. These problems often have numerous decision variables and constraints, making it difficult to optimize their objective function. To solve these problems, a group of algorithms known as metaheuristic algorithms has been introduced, which, considering the problem constraints, can find the optimal values of the decision variables in a reasonable amount of time to optimize the value of the objective function(s). Due to the importance and high application of these algorithms, a new metaheuristic optimization algorithm called Gray Langurs Optimizer (GLO) has been introduced in this research. The fundamental inspiration for the GLO is the group behavior of gray langurs in nature. The gray langurs are observed in three groups: one-male, multi-male, and all-male groups. The GLO mathematically simulates the group behavior and social hierarchy of gray langurs in all three groups. The migration of gray langurs between groups due to the death of the alpha or other group members, mate finding, and puberty is formulated by GLO. Additionally, the GLO models the arbitrary behavior of gray langurs within their territory. The GLO is tested on twenty-three classical test functions, including unimodal, multimodal, and fixed-dimension benchmarks, as well as twenty-seven CEC17 test functions, which comprise shifted, rotated, and composite benchmarks. The GLO is also applied to six real-world applications, and its results are compared with those of eight state-of-the-art algorithms both numerically and visually. The experimental results demonstrate the high capability of GLO in optimizing the various test functions and real-world applications. The MATLAB and Python implementations of GLO are available at https://nimakhodadadi.com ."} | ||||
| 26 | +{"work_id": 4311415873, "title": "Fast Kd-Trees for the Kullback-Leibler Divergence and Other Decomposable Bregman Divergences", "abstract": "The contributions of the paper span theoretical and implementational results. First, we prove that Kd-trees can be extended to \u211d^d with the distance measured by an arbitrary Bregman divergence. Perhaps surprisingly, this shows that the triangle inequality is not necessary for correct pruning in Kd-trees. Second, we offer an efficient algorithm and C++ implementation for nearest neighbour search for decomposable Bregman divergences. The implementation supports the Kullback-Leibler divergence (relative entropy) which is a popular distance between probability vectors and is commonly used in statistics and machine learning. This is a step toward broadening the usage of computational geometry algorithms. Our benchmarks show that our implementation efficiently handles both exact and approximate nearest neighbour queries. Compared to a linear search, we achieve two orders of magnitude speedup for practical scenarios in dimension up to 100. Our solution is simpler and more efficient than competing methods."} | ||||
| 27 | +{"work_id": 4322738676, "title": "Introduction to Genetic Algorithm", "abstract": "The chapter introduces a novel type of classical algorithm for intelligent search and optimization problems that mimic the biological evolutionary process. After a brief introduction to the components of the objective function, objectives and and how to solve any objective function using optimization techniques are explained. According to characteristics of the constraint, different categories of optimization techniques with suitable examples are followed by different steps of the genetic algorithm and its application in different domain. The chapter ends with a discussion on one of the known combinational optimizations: differential evolution."} | ||||
| 30 | {"work_id": 4386113651, "title": "Cheap Correlate or Discriminating Property? An Executable Validation Protocol for Consciousness- and Cognition-Theoretic Claims about AI", "abstract": "Claims that an AI system \"instantiates\" a consciousness- or cognition-theoretic construct are often supported by a cheap correlate: aggregate dependence read as irreducible integration, ordinary shared-store efficiency read as global access, or a confidence-labelled signal read as metacognitive monitoring. Such inferences trade on a construct's appearance while omitting the property that carries the theory's content. The concern is not ours: the validation requirement (an indicator must be both sensitive and specific) is Seth and Bayne's (2022), the indicator-property programme is Butlin et al.'s (2023; 2026), and the proxy-can-be-gamed worry is Birch's (2022). We turn this desideratum into a prospective six-step protocol and audit how far one transparent chess-engine study actually satisfies it. Static feature dependence missed its specified support rule. A corrected 119-position temporal analysis missed its locally specified majority target, although a secondary post-hoc Bonferroni min-p test rejected the global no-departure null for both SI and Phi* (p = .0238). Shared-table configuration reduced wall time and total work, but this was an implementation effect and did not test a global-workspace construct. The internal signal provided no evidence of the specified directional ranking of later move persistence (AUROC .467), while its critic channel was nearly invariant, limiting the instrument. These are bounded case findings, not three independent datasets and not three definitive construct falsifications. The protocol therefore requires prospective theory-to-measure mapping, explicit nulls, sensitivity and specificity checks, power, and claim boundaries. Its generality remains a hypothesis until a second prospective substrate is studied. Status of this preprint. This is a working paper. The author's own gate for journal submission is HOLD/PIVOT: the protocol has not yet been applied to a second prospective substrate, and the theory-to-measure mapping has not yet been adjudicated by outcome-blind experts. It is deposited because the protocol (Section 4) and the reviewer checklist (Section 7.2) are usable independently of those two steps. Sections 1 to 4 and 7 are the proposed contribution; Section 5 is a bounded, single-substrate case audit. Changes in v3.4 (2026-09-27). Status correction only: version 3.3 described the related manuscript P1 as \"under review\"; it had been submitted to a journal. The scientific content and numerical results are unchanged."} | 28 | {"work_id": 4386113651, "title": "Cheap Correlate or Discriminating Property? An Executable Validation Protocol for Consciousness- and Cognition-Theoretic Claims about AI", "abstract": "Claims that an AI system \"instantiates\" a consciousness- or cognition-theoretic construct are often supported by a cheap correlate: aggregate dependence read as irreducible integration, ordinary shared-store efficiency read as global access, or a confidence-labelled signal read as metacognitive monitoring. Such inferences trade on a construct's appearance while omitting the property that carries the theory's content. The concern is not ours: the validation requirement (an indicator must be both sensitive and specific) is Seth and Bayne's (2022), the indicator-property programme is Butlin et al.'s (2023; 2026), and the proxy-can-be-gamed worry is Birch's (2022). We turn this desideratum into a prospective six-step protocol and audit how far one transparent chess-engine study actually satisfies it. Static feature dependence missed its specified support rule. A corrected 119-position temporal analysis missed its locally specified majority target, although a secondary post-hoc Bonferroni min-p test rejected the global no-departure null for both SI and Phi* (p = .0238). Shared-table configuration reduced wall time and total work, but this was an implementation effect and did not test a global-workspace construct. The internal signal provided no evidence of the specified directional ranking of later move persistence (AUROC .467), while its critic channel was nearly invariant, limiting the instrument. These are bounded case findings, not three independent datasets and not three definitive construct falsifications. The protocol therefore requires prospective theory-to-measure mapping, explicit nulls, sensitivity and specificity checks, power, and claim boundaries. Its generality remains a hypothesis until a second prospective substrate is studied. Status of this preprint. This is a working paper. The author's own gate for journal submission is HOLD/PIVOT: the protocol has not yet been applied to a second prospective substrate, and the theory-to-measure mapping has not yet been adjudicated by outcome-blind experts. It is deposited because the protocol (Section 4) and the reviewer checklist (Section 7.2) are usable independently of those two steps. Sections 1 to 4 and 7 are the proposed contribution; Section 5 is a bounded, single-substrate case audit. Changes in v3.4 (2026-09-27). Status correction only: version 3.3 described the related manuscript P1 as \"under review\"; it had been submitted to a journal. The scientific content and numerical results are unchanged."} | ||
| 31 | {"work_id": 2979043732, "title": "ETH-tight algorithms for geometric network problems", "abstract": "promotoren en de samenstelling van de promotiecommissie is als volgt"} | 29 | {"work_id": 2979043732, "title": "ETH-tight algorithms for geometric network problems", "abstract": "promotoren en de samenstelling van de promotiecommissie is als volgt"} | ||
| 32 | {"work_id": 1513303009, "title": "Cellular Automata And Complexity: Collected Papers", "abstract": "Primary Papers * Statistical Mechanics of Cellular Automata * Algebraic Properties of Cellular Automata * Universality and Complexity in Cellular Automata * Computation Theory of Cellular Automata * Undecidability and Intractability in Theoretical Physics * Two-Dimensional Cellular Automata * Origins of Randomness in Physical Systems * Thermodynamics and Hydrodynamics of Cellular Automata * Random Sequence Generation by Cellular Automata * Approaches to Complexity Engineering * Minimal Cellular Automaton Approximations to Continuum Systems * Cellular Automaton Fluids: Basic Theory Additional And Survey Papers * Cellular Automata * Computers in Science and Mathematics * Geometry of Binomial Coefficients * Twenty Problems in the Theory of Cellular Automata * Cryptography with Cellular Automata * Complex Systems Theory * Cellular Automaton Supercomputing Appendices * Tables of Cellular Automaton Properties * Scientific Bibliography of Stephen Wolfram"} | 30 | {"work_id": 1513303009, "title": "Cellular Automata And Complexity: Collected Papers", "abstract": "Primary Papers * Statistical Mechanics of Cellular Automata * Algebraic Properties of Cellular Automata * Universality and Complexity in Cellular Automata * Computation Theory of Cellular Automata * Undecidability and Intractability in Theoretical Physics * Two-Dimensional Cellular Automata * Origins of Randomness in Physical Systems * Thermodynamics and Hydrodynamics of Cellular Automata * Random Sequence Generation by Cellular Automata * Approaches to Complexity Engineering * Minimal Cellular Automaton Approximations to Continuum Systems * Cellular Automaton Fluids: Basic Theory Additional And Survey Papers * Cellular Automata * Computers in Science and Mathematics * Geometry of Binomial Coefficients * Twenty Problems in the Theory of Cellular Automata * Cryptography with Cellular Automata * Complex Systems Theory * Cellular Automaton Supercomputing Appendices * Tables of Cellular Automaton Properties * Scientific Bibliography of Stephen Wolfram"} | ||
| 33 | {"work_id": 2146101030, "title": "Communication complexity of document exchange", "abstract": "We have two users, A and B, who hold documents x and y respectively. Neither of the users has any information about the other's document. They exchange messages so that B computes x; it may be required that A compute y as well. Our goal is to design communication protocols with the main objective of minimizing the total number of bits they exchange; other objectives are minimizing the number of rounds and the complexity of internal computations. An important notion which determines the efficiency of the protocols is how one measures the distance between x and y. We consider several metrics for measuring this distance, namely the Hamming metric, the Levenshtein metric (edit distance), and a new LZ metric, which is introduced in this paper. We show how to estimate the distance between x and y using a single message of logarithmic size. For each metric, we present the first communication-efficient protocols, which often match the corresponding lower bounds. A consequence of these are error-correcting codes for these error models which correct up to d errors in n characters using O(d log n) bits. Our most interesting methods use a new histogram transformation that we introduce to convert edit distance to L1 distance."} | 31 | {"work_id": 2146101030, "title": "Communication complexity of document exchange", "abstract": "We have two users, A and B, who hold documents x and y respectively. Neither of the users has any information about the other's document. They exchange messages so that B computes x; it may be required that A compute y as well. Our goal is to design communication protocols with the main objective of minimizing the total number of bits they exchange; other objectives are minimizing the number of rounds and the complexity of internal computations. An important notion which determines the efficiency of the protocols is how one measures the distance between x and y. We consider several metrics for measuring this distance, namely the Hamming metric, the Levenshtein metric (edit distance), and a new LZ metric, which is introduced in this paper. We show how to estimate the distance between x and y using a single message of logarithmic size. For each metric, we present the first communication-efficient protocols, which often match the corresponding lower bounds. A consequence of these are error-correcting codes for these error models which correct up to d errors in n characters using O(d log n) bits. Our most interesting methods use a new histogram transformation that we introduce to convert edit distance to L1 distance."} | ||
| 34 | −{"work_id": 73572444, "title": "Complexity Theory and the Social Sciences", "abstract": "This expanded and updated edition of Complexity Theory and the Social Sciences: The State of the Art revisits the use of complexity theory across the social sciences and demonstrates how complexity informs approaches to various contemporary issues in the context of the COVID-19 pandemic, widening social inequality, and impending social and ecological catastrophe wrought by global warming. The book reviews complexity theory in the practice of the social sciences and at their interface with ecological science. It outlines how social theory can be reconciled with complexity thinking and presents a review of the way research can be done using complexity theory. The book suggests how complexity theory can be used to understand and evaluate governance processes, particularly with regard to social inequality and the climate crisis. The impact of the COVID-19 pandemic is also examined through a complexity lens, reviewing how complexity thinking has been employed in relation to the pandemic and how implementing a complexity framework can transform health and social care. The book concludes with a call to action and the use of complexity theory to inform critical thinking in the education system. This textbook will be immensely useful to students and researchers interested in social research methods, social theory, business and organization studies, health, education, urban studies, and development studies."} | 32 | +{"work_id": 4313549230, "title": "The Influence of E-Iearning, M-learning, and D-learning on the Student Performance: Moderating Role of Institutional Support", "abstract": "Student performance was affected due to the covid-19 pandemic; therefore, electronic (E), mobile (M), and distance (D) learning are the significant solution for this issue and needs researchers' focus. This study examines the impact of E learning, M learning, and D-Iearning on student performance in educational institutions in the UAE. Besides, this study investigates the moderating impact of institutional support on E-Iearning, M-learning, D-Iearning, and student performance in educational institutions in the UAE. The data were collected from students using questionnaires utilizing smart-PLS to check the data reliability and relationships among variables. The results indicated that E-Iearning, M-Iearning, and D-Iearning have a positive impact on student performance in educational institutions in the UAE. The results also revealed that the institutional support significantly moderates E-Iearning, M-learning, D-Iearning, and student performance in educational institutions in the UAE. The findings of this study help policymakers in establishing the policies related to the improvement of student performance using E learning, M-learning, and D-Iearning."} | ||
| 35 | −{"work_id": 7127964361, "title": "Turning Knowledge into Innovation: The Systemic Role of Knowledge Management Capability, Intellectual Capital, and Knowledge Utilization", "abstract": "In the dynamic and service-intensive context of the tourism and hospitality industry, organizational innovation performance (OIP) is a critical determinant of competitiveness. This study investigates the systemic role of knowledge management capability (KMC) in driving OIP, with a focus on the mediating effects of intellectual capital (IC) and knowledge utilization (KU). Drawing on Dynamic Capabilities Theory and the Knowledge-Based View, KMC is conceptualized as a higher-order capability that facilitates the accumulation, coordination, and application of knowledge resources, thereby shaping both organizational knowledge assets and their practical enactment. Data were collected from senior managers across five-star hotels in Greater Cairo, Egypt, and analyzed using Partial Least Squares Structural Equation Modeling (PLS-SEM). Results indicate that KMC positively influences OIP directly and indirectly through the development of IC and the effective utilization of knowledge. Both IC and KU are found to mediate the relationship between KMC and innovation performance, highlighting the importance of transforming knowledge resources into actionable and value-creating organizational capabilities. The study advances theoretical understanding by elucidating the systemic mechanisms linking knowledge management, intellectual capital, and knowledge utilization to innovation outcomes, and provides practical insights for hospitality managers seeking to leverage knowledge-driven strategies to enhance competitiveness and service excellence."} | 33 | +{"work_id": 3119051141, "title": "The Arithmetic Optimization Algorithm", "abstract": "This work proposes a new meta-heuristic method called Arithmetic Optimization Algorithm (AOA) that utilizes the distribution behavior of the main arithmetic operators in mathematics including (Multiplication (M), Division (D), Subtraction (S), and Addition (A)). AOA is mathematically modeled and implemented to perform the optimization processes in a wide range of search spaces. The performance of AOA is checked on twenty-nine benchmark functions and several real-world engineering design problems to showcase its applicability. The analysis of performance, convergence behaviors, and the computational complexity of the proposed AOA have been evaluated by different scenarios. Experimental results show that the AOA provides very promising results in solving challenging optimization problems compared with eleven other well-known optimization algorithms. Source codes of AOA are publicly available at and ."} | ||
| 34 | +{"work_id": 2003494253, "title": "Algorithms+Data Structures = Programs", "abstract": "Learn with confidence with this hands-on undergraduate textbook for CS2 courses. Active-learning and real-world projects underpin each chapter, briefly reviewing programming fundamentals then progressing to core data structures and algorithms topics including recursion, lists, stacks, trees, graphs, sorting, and complexity analysis. Creative projects and applications put theoretical concepts into practice, helping students master the fundamentals. Dedicated project chapters supply further programming practice using real-world, interdisciplinary problems which students can showcase in their own online portfolios. Example Interview Questions sections prepare students for job applications. The pedagogy supports self-directed and skills-based learning with over 250 'Try It Yourself' boxes, many with solutions provided, and over 500 progressively challenging end-of-chapter questions. Written in a clear and engaging style, this textbook is a complete resource for teaching the fundamental skills that today's students need. Instructor resources are available online, including a test bank, solutions manual, and sample code."} | ||||
| 35 | +{"work_id": 4318219991, "title": "Students' adoption of AI-based teacher-bots (T-bots) for learning in higher education", "abstract": "Purpose The purpose of this paper is to investigate students' adoption intention (ADI) and actual usage (ATU) of artificial intelligence (AI)-based teacher bots (T-bots) for learning using technology adoption model (TAM) and context-specific variables. Design/methodology/approach A mixed-method design is used wherein the quantitative and qualitative approaches were used to explore the adoption of T-bots for learning. Overall, 45 principals/directors/deans/professors were interviewed and NVivo 8.0 was used for interview data analysis. Overall, 1,380 students of higher education institutes were surveyed, and the collected data was analyzed using the Partial Least Squares Structural Equation Modeling (PLS-SEM) technique. Findings The T-bot's ADI\u2019s antecedents found were perceived ease of use, perceived usefulness, personalization, interactivity, perceived trust, anthropomorphism and perceived intelligence. The ADI influences the ATU of T-bots, and its relationship is negatively moderated by stickiness to learn from human teachers in the classroom. It comprehends the insights of senior authorities of the higher education institutions in India toward the adoption of T-bots. Practical implications The research provides distinctive insights for principals, directors and professors in higher education institutes to understand the factors affecting the students' behavioral intention and use of T-bots. The developers and designers of T-bots need to ensure that T-bots are more interactive, provide personalized information to students and ensure the anthropomorphic characteristics of T-bots. The education policymakers can also comprehend the factors of T-bot adoption for developing the policies related to T-bots and their implications in education. Originality/value T-bot is a new disruptive technology in the education sector, and this is the first step in exploring the adoption factors. The TAM model is extended with context-specific factors related to T-bot technology to offer a comprehensive explanatory power to the proposed model. The research outcome provides the unique antecedents of the adoption of T-bots."} | ||||
| 36 | +{"work_id": 3122335070, "title": "Design and development of a mobile learning system for computer science education in Nigerian higher education context", "abstract": "This research focuses on the development of a mobile learning system in the context of Nigerian higher education institution.Mobile learning is an important component of the digital-age educational sector, and plays a key role in ubiquitous learning.Similarly, mobile learning is an increasingly important area in computer science discipline.Although several defenitions of the term mobile learning exist, in this research mobile learning refers to teaching and learning approach that employs wireless technologies and mobile devices to support access to learning resources, promotes student direct engagement and interaction regardless of time, place, and context.The changes experienced by mobile learning over the past decade remain unprecedented.However, practical development and contextualization of mobile learning systems are rather inadequate.Recent developments in mobile learning have heightened the need for a mobile learning application that will aid the pedagogy of several topics in computer science education.Moreover, developing countries such as Nigeria have a shortage of mobile learning environments.Therefore, this dissertation seeks to explain the development of mobile learning system for computer science education in Nigerian context.The study stimulates good practice and promotes theoretical underpinning of mobile learning.Part of the aim of this study is to develop an application that will support learning of computing courses on mobile devices and offer guiding principles for integrating mobile learning into mainstream education.This dissertation follows a design science research, with indepth analysis of existing systems, development of a mobile learning application, MobileEdu, testing the application in concrete settings and evaluation of the system for state-of-the-art.After several initial exploratory studies and systematic literature survey, MobileEdu was developed to aid teaching and learning of computer science courses on mobile devices.The concrete settings for both demonstration and evalu-providing the wisdom, knowledge, and inspiration to conduct this research.I would like to express my profound gratitude to my supervisor Dr. Jarkko Suhonen for the incessant support, guidance, counselling, patience, enormous knowledge, and motivation during the time of my Ph.D study and related research.His constructive ideas and huge experiences in this field helped me to obtain a nice experience through the rigorous research process.Dr. Jarkko"} | ||||
| 37 | +{"work_id": 2121903617, "title": "Introduction to evolutionary algorithms", "abstract": "Since they are gleaned from the model of organic evolution, all basic instances of evolutionary algorithms share a number of common properties, which are mentioned here to characterize the prototype of a general evolutionary algorithm: (i) Evolutionary algorithms utilize the collective learning process of a population of individuals. Usually, each individual represents (or encodes) a search point in the space of potential solutions to a given problem. Additionally, individuals may also incorporate further information; for example, strategy parameters (Sections 16.2 and 32.2) of the evolutionary algorithm."} | ||||
| 38 | +{"work_id": 2963224980, "title": "A Comprehensive Survey of Graph Embedding: Problems, Techniques, and Applications", "abstract": "Graph is an important data representation which appears in a wide diversity of real-world scenarios. Effective graph analytics provides users a deeper understanding of what is behind the data, and thus can benefit a lot of useful applications such as node classification, node recommendation, link prediction, etc. However, most graph analytics methods suffer the high computation and space cost. Graph embedding is an effective yet efficient way to solve the graph analytics problem. It converts the graph data into a low dimensional space in which the graph structural information and graph properties are maximumly preserved. In this survey, we conduct a comprehensive review of the literature in graph embedding. We first introduce the formal definition of graph embedding as well as the related concepts. After that, we propose two taxonomies of graph embedding which correspond to what challenges exist in different graph embedding problem settings and how the existing work addresses these challenges in their solutions. Finally, we summarize the applications that graph embedding enables and suggest four promising future research directions in terms of computation efficiency, problem settings, techniques, and application scenarios."} | ||||
| 39 | +{"work_id": 2900179285, "title": "The Reachability Problem for Petri Nets Is Not Elementary", "abstract": "Petri nets, also known as vector addition systems, are a long established model of concurrency with extensive applications in modelling and analysis of hardware, software and database systems, as well as chemical, biological and business processes. The central algorithmic problem for Petri nets is reachability: whether from the given initial configuration there exists a sequence of valid execution steps that reaches the given final configuration. The complexity of the problem has remained unsettled since the 1960s, and it is one of the most prominent open questions in the theory of verification. Decidability was proved by Mayr in his seminal STOC 1981 work, and the currently best published upper bound is non-primitive recursive Ackermannian of Leroux and Schmitz from LICS 2019. We establish a non-elementary lower bound, i.e. that the reachability problem needs a tower of exponentials of time and space. Until this work, the best lower bound has been exponential space, due to Lipton in 1976. The new lower bound is a major breakthrough for several reasons. Firstly, it shows that the reachability problem is much harder than the coverability (i.e., state reachability) problem, which is also ubiquitous but has been known to be complete for exponential space since the late 1970s. Secondly, it implies that a plethora of problems from formal languages, logic, concurrent systems, process calculi and other areas, that are known to admit reductions from the Petri nets reachability problem, are also not elementary. Thirdly, it makes obsolete the currently best lower bounds for the reachability problems for two key extensions of Petri nets: with branching and with a pushdown stack."} | ||||
| 40 | +{"work_id": 3202325891, "title": "Electrochemical Impedance Spectroscopy (EIS): Principles, Construction, and Biosensing Applications", "abstract": "Electrochemical impedance spectroscopy (EIS) is a powerful technique used for the analysis of interfacial properties related to bio-recognition events occurring at the electrode surface, such as antibody-antigen recognition, substrate-enzyme interaction, or whole cell capturing. Thus, EIS could be exploited in several important biomedical diagnosis and environmental applications. However, the EIS is one of the most complex electrochemical methods, therefore, this review introduced the basic concepts and the theoretical background of the impedimetric technique along with the state of the art of the impedimetric biosensors and the impact of nanomaterials on the EIS performance. The use of nanomaterials such as nanoparticles, nanotubes, nanowires, and nanocomposites provided catalytic activity, enhanced sensing elements immobilization, promoted faster electron transfer, and increased reliability and accuracy of the reported EIS sensors. Thus, the EIS was used for the effective quantitative and qualitative detections of pathogens, DNA, cancer-associated biomarkers, etc. Through this review article, intensive literature review is provided to highlight the impact of nanomaterials on enhancing the analytical features of impedimetric biosensors."} | ||||
| 36 | {"work_id": 4406215947, "title": "Digital Transformation and Innovation Performance in Small- and Medium-Sized Enterprises: A Systems Perspective on the Interplay of Digital Adoption, Digital Drive, and Digital Culture", "abstract": "Small- and medium-sized enterprises (SMEs) face complex systemic challenges in managing digital transformation while pursuing innovation in an increasingly interconnected business environment. This study adopts a systems theory perspective to investigate how digitalization enhances Innovation Performance by examining the dynamic interrelationships among digital adoption, digital drive, digital culture, and Innovation Performance. Through an empirical analysis of 201 Chinese SMEs using PLS-SEM, IPMA, and ANFIS approaches, we reveal that digital drive fully mediates the relationship between digital adoption and Innovation Performance, highlighting the systemic nature of digital transformation processes. Digital culture emerges as a critical moderator, positively influencing the relationships between digital adoption and digital drive, as well as between digital drive and Innovation Performance. These findings demonstrate how different elements of digital transformation form an integrated system where components interact to produce innovation outcomes. This study contributes to systems theory by illuminating the complex interdependencies in digital transformation and offers practical implications for managing systemic change in SMEs."} | 41 | {"work_id": 4406215947, "title": "Digital Transformation and Innovation Performance in Small- and Medium-Sized Enterprises: A Systems Perspective on the Interplay of Digital Adoption, Digital Drive, and Digital Culture", "abstract": "Small- and medium-sized enterprises (SMEs) face complex systemic challenges in managing digital transformation while pursuing innovation in an increasingly interconnected business environment. This study adopts a systems theory perspective to investigate how digitalization enhances Innovation Performance by examining the dynamic interrelationships among digital adoption, digital drive, digital culture, and Innovation Performance. Through an empirical analysis of 201 Chinese SMEs using PLS-SEM, IPMA, and ANFIS approaches, we reveal that digital drive fully mediates the relationship between digital adoption and Innovation Performance, highlighting the systemic nature of digital transformation processes. Digital culture emerges as a critical moderator, positively influencing the relationships between digital adoption and digital drive, as well as between digital drive and Innovation Performance. These findings demonstrate how different elements of digital transformation form an integrated system where components interact to produce innovation outcomes. This study contributes to systems theory by illuminating the complex interdependencies in digital transformation and offers practical implications for managing systemic change in SMEs."} | ||
| 37 | {"work_id": 2955897898, "title": "Wireless Communications and Applications Above 100 GHz: Opportunities and Challenges for 6G and Beyond", "abstract": "Frequencies from 100 GHz to 3 THz are promising bands for the next generation of wireless communication systems because of the wide swaths of unused and unexplored spectrum. These frequencies also offer the potential for revolutionary applications that will be made possible by new thinking, and advances in devices, circuits, software, signal processing, and systems. This paper describes many of the technical challenges and opportunities for wireless communication and sensing applications above 100 GHz, and presents a number of promising discoveries, novel approaches, and recent results that will aid in the development and implementation of the sixth generation (6G) of wireless networks, and beyond. This paper shows recent regulatory and standard body rulings that are anticipating wireless products and services above 100 GHz and illustrates the viability of wireless cognition, hyper-accurate position location, sensing, and imaging. This paper also presents approaches and results that show how long distance mobile communications will be supported to above 800 GHz since the antenna gains are able to overcome air-induced attenuation, and present methods that reduce the computational complexity and simplify the signal processing used in adaptive antenna arrays, by exploiting the Special Theory of Relativity to create a cone of silence in over-sampled antenna arrays that improve performance for digital phased array antennas. Also, new results that give insights into power efficient beam steering algorithms, and new propagation and partition loss models above 100 GHz are given, and promising imaging, array processing, and position location results are presented. The implementation of spatial consistency at THz frequencies, an important component of channel modeling that considers minute changes and correlations over space, is also discussed. This paper offers the first in-depth look at the vast applications of THz wireless products and applications and provides approaches for how to reduce power and increase performance across several problem domains, giving early evidence that THz techniques are compelling and available for future wireless communications."} | 42 | {"work_id": 2955897898, "title": "Wireless Communications and Applications Above 100 GHz: Opportunities and Challenges for 6G and Beyond", "abstract": "Frequencies from 100 GHz to 3 THz are promising bands for the next generation of wireless communication systems because of the wide swaths of unused and unexplored spectrum. These frequencies also offer the potential for revolutionary applications that will be made possible by new thinking, and advances in devices, circuits, software, signal processing, and systems. This paper describes many of the technical challenges and opportunities for wireless communication and sensing applications above 100 GHz, and presents a number of promising discoveries, novel approaches, and recent results that will aid in the development and implementation of the sixth generation (6G) of wireless networks, and beyond. This paper shows recent regulatory and standard body rulings that are anticipating wireless products and services above 100 GHz and illustrates the viability of wireless cognition, hyper-accurate position location, sensing, and imaging. This paper also presents approaches and results that show how long distance mobile communications will be supported to above 800 GHz since the antenna gains are able to overcome air-induced attenuation, and present methods that reduce the computational complexity and simplify the signal processing used in adaptive antenna arrays, by exploiting the Special Theory of Relativity to create a cone of silence in over-sampled antenna arrays that improve performance for digital phased array antennas. Also, new results that give insights into power efficient beam steering algorithms, and new propagation and partition loss models above 100 GHz are given, and promising imaging, array processing, and position location results are presented. The implementation of spatial consistency at THz frequencies, an important component of channel modeling that considers minute changes and correlations over space, is also discussed. This paper offers the first in-depth look at the vast applications of THz wireless products and applications and provides approaches for how to reduce power and increase performance across several problem domains, giving early evidence that THz techniques are compelling and available for future wireless communications."} | ||
| 38 | {"work_id": 4408441779, "title": "Enhancing Creativity and Sustainable Competitive Advantage Through Data-Driven Decision-Making and Digital Leadership", "abstract": "Digital transformation is essential for businesses to maintain creativity and competitiveness. This study explores how digital transformation impacts corporate creativity and competitive advantage in SMEs by leveraging the TOE framework and RBT. Our model integrates both internal and external factors, focusing on data-driven decision-making and digital leadership. Data from 537 SMEs were analyzed using PLS-SEM, IPMA, and fsQCA. Results indicate that technological competence, organizational support, and government support positively influence digital integration, enhancing data-driven decision-making. This decision-making process significantly boosts sustainable competitive advantage and organizational creativity. Digital leadership positively moderates these relationships. Our findings provide actionable insights for SMEs leveraging digital transformation for sustained competitive advantage and creativity. The unique long-term value of this research lies in its comprehensive examination of how digital transformation facilitates both creativity and sustainablecompetitive advantage in SMEs. This study offers a novel theoretical model and empirical evidence that can guide international practitioners and scholars in understanding and implementing effective digital transformation strategies."} | 43 | {"work_id": 4408441779, "title": "Enhancing Creativity and Sustainable Competitive Advantage Through Data-Driven Decision-Making and Digital Leadership", "abstract": "Digital transformation is essential for businesses to maintain creativity and competitiveness. This study explores how digital transformation impacts corporate creativity and competitive advantage in SMEs by leveraging the TOE framework and RBT. Our model integrates both internal and external factors, focusing on data-driven decision-making and digital leadership. Data from 537 SMEs were analyzed using PLS-SEM, IPMA, and fsQCA. Results indicate that technological competence, organizational support, and government support positively influence digital integration, enhancing data-driven decision-making. This decision-making process significantly boosts sustainable competitive advantage and organizational creativity. Digital leadership positively moderates these relationships. Our findings provide actionable insights for SMEs leveraging digital transformation for sustained competitive advantage and creativity. The unique long-term value of this research lies in its comprehensive examination of how digital transformation facilitates both creativity and sustainablecompetitive advantage in SMEs. This study offers a novel theoretical model and empirical evidence that can guide international practitioners and scholars in understanding and implementing effective digital transformation strategies."} | ||
| 39 | {"work_id": 7125913058, "title": "Multiresource-Constrained Flexible Job Shop Scheduling With Fixture Pallets and Setup Stations Under Pallet Automation Systems", "abstract": "Pallet automation systems (PASs) are critical in flexible manufacturing for their ability to integrate diverse production resources, such as machines, fixture pallets (FPs), and setup stations (STs). In traditional flexible manufacturing systems (FMSs), loading/unloading typically occurs at machines, limiting the machines\u2019 capacity. To address this, in PASs, workpieces are loaded and unloaded from the machines at a limited number of STs, so loading, processing, and unloading are three separate segments. However, the research on PASs is limited, and existing studies mainly focused on machines while overlooking FPs and STs. A critical challenge is the tight coupling between resource selection and operation sequencing. To address this gap, we investigate a multiresource-constrained flexible job shop scheduling problem (MRFJSP) with FPs and STs under PASs (MRFFS). First, a mixed-integer programming model is proposed to minimize makespan. Second, a four-layer encoding scheme and a new decoding method with time period insertion based on the intersection of available time of multiple resources (TPI-IARs) are presented to obtain feasible schedule solutions and shrink the search space. Third, a new search algorithm based on critical paths and points mutation (SACP) is developed to effectively balance exploration and exploitation. Finally, four case studies are designed to demonstrate the validity and effectiveness of this work."} | 44 | {"work_id": 7125913058, "title": "Multiresource-Constrained Flexible Job Shop Scheduling With Fixture Pallets and Setup Stations Under Pallet Automation Systems", "abstract": "Pallet automation systems (PASs) are critical in flexible manufacturing for their ability to integrate diverse production resources, such as machines, fixture pallets (FPs), and setup stations (STs). In traditional flexible manufacturing systems (FMSs), loading/unloading typically occurs at machines, limiting the machines\u2019 capacity. To address this, in PASs, workpieces are loaded and unloaded from the machines at a limited number of STs, so loading, processing, and unloading are three separate segments. However, the research on PASs is limited, and existing studies mainly focused on machines while overlooking FPs and STs. A critical challenge is the tight coupling between resource selection and operation sequencing. To address this gap, we investigate a multiresource-constrained flexible job shop scheduling problem (MRFJSP) with FPs and STs under PASs (MRFFS). First, a mixed-integer programming model is proposed to minimize makespan. Second, a four-layer encoding scheme and a new decoding method with time period insertion based on the intersection of available time of multiple resources (TPI-IARs) are presented to obtain feasible schedule solutions and shrink the search space. Third, a new search algorithm based on critical paths and points mutation (SACP) is developed to effectively balance exploration and exploitation. Finally, four case studies are designed to demonstrate the validity and effectiveness of this work."} | ||
| 40 | {"work_id": 7118096636, "title": "A modified starfish optimization algorithm (M-SFOA) for global optimization problems and its application to heart disease risk prediction", "abstract": null} | 45 | {"work_id": 7118096636, "title": "A modified starfish optimization algorithm (M-SFOA) for global optimization problems and its application to heart disease risk prediction", "abstract": null} | ||
| 41 | −{"work_id": 4233225156, "title": "Introduction to Algorithms", "abstract": null} | ||||
| 42 | {"work_id": 1638203394, "title": "An Introduction to Kolmogorov Complexity and Its Applications", "abstract": null} | 46 | {"work_id": 1638203394, "title": "An Introduction to Kolmogorov Complexity and Its Applications", "abstract": null} | ||
| 43 | −{"work_id": 2402846924, "title": "Particle Swarm Optimization", "abstract": null} | 47 | +{"work_id": 4366545219, "title": "Genetic Algorithms and Their Applications", "abstract": null} | ||
| 44 | −{"work_id": 3148190347, "title": "Introduction to Graph Theory", "abstract": null} | ||||
| 45 | {"work_id": 3139484821, "title": "Aquila Optimizer: A novel meta-heuristic optimization algorithm", "abstract": null} | 48 | {"work_id": 3139484821, "title": "Aquila Optimizer: A novel meta-heuristic optimization algorithm", "abstract": null} | ||
| 46 | {"work_id": 4254202520, "title": "On Computable Numbers, with an Application to the Entscheidungsproblem (1936)", "abstract": null} | 49 | {"work_id": 4254202520, "title": "On Computable Numbers, with an Application to the Entscheidungsproblem (1936)", "abstract": null} | ||
| 47 | −{"work_id": 4391177866, "title": "Computational Complexity", "abstract": null} | ||||
| 48 | −{"work_id": 4372046852, "title": "Introduction to Algorithms", "abstract": null} | ||||
| 49 | {"work_id": 7160425037, "title": "Solving SAT by restricted spiking neural P systems with temporal division rules", "abstract": null} | 50 | {"work_id": 7160425037, "title": "Solving SAT by restricted spiking neural P systems with temporal division rules", "abstract": null} | ||
| 50 | −{"work_id": 4396808240, "title": "Parameterized Complexity", "abstract": null} | ||||
modified
literature_synthesis/landmarks/theory_landmarks.csv
+51 −51
@@ -1,51 +1,51 @@ | |||||
| 1 | −work_id,doi,arxiv_id,title,source_name,year,type,primary_category,n_categories,c12,c36,ncs36,cited_by_count,fwci,has_abstract,is_oa,period,score,set,pi_review | 1 | +work_id,doi,arxiv_id,title,source_name,year,type,primary_category,n_categories,c12,c36,ncs36,cited_by_count,fwci,has_abstract,is_oa,period,ntitle,score,set,pi_review | ||
| 2 | −4311415873,10.4230/lipics.wads.2025.45,,Fast Kd-Trees for the Kullback-Leibler Divergence and Other Decomposable Bregman Divergences,Leibniz international proceedings in informatics,2025,conference-paper,algorithms,3,2355.0,2355.0,1915.3516038917253,2354,1042.305,True,True,post,1192.2396032310232,landmark,True | 2 | +4311415873,10.4230/lipics.wads.2025.45,,Fast Kd-Trees for the Kullback-Leibler Divergence and Other Decomposable Bregman Divergences,Leibniz international proceedings in informatics,2025,conference-paper,algorithms,3,2355.0,2355.0,1915.3516038917253,2354,1042.305,True,True,post,fastkdtreesforthekullbackleiblerdivergenceandotherdecomposablebregmandivergences,1029.0680418363954,landmark,True | ||
| 3 | −2402846924,10.1142/9789811205675_0004,,Particle Swarm Optimization,WORLD SCIENTIFIC eBooks,2019,book-chapter,algorithms,1,3563.0,3767.0,1171.7895003921208,6270,302.7094,False,False,baseline,1171.7895003921208,landmark,True | 3 | +4294558607,10.4230/lipics.sea.2024.20,,Targeted Branching for the Maximum Independent Set Problem Using Graph Neural Networks,DROPS (Schloss Dagstuhl – Leibniz Center for Informatics),2024,article,algorithms,4,5110.0,5183.0,861.3021555600685,5183,320.7213,True,True,post,targetedbranchingforthemaximumindependentsetproblemusinggraphneuralnetworks,861.3021555600685,landmark,True | ||
| 4 | −4294558607,10.4230/lipics.sea.2024.20,,Targeted Branching for the Maximum Independent Set Problem Using Graph Neural Networks,DROPS (Schloss Dagstuhl – Leibniz Center for Informatics),2024,article,algorithms,4,5110.0,5183.0,861.3021555600685,5183,320.7213,True,True,post,861.3021555600685,landmark,True | 4 | +4285092328,10.1145/3544585.3544600,,A Note on Two Problems in Connexion with Graphs,ACM eBooks,2022,book-chapter,algorithms,1,631.0,868.0,724.7350484463749,1353,589.8043,True,False,baseline,anoteontwoproblemsinconnexionwithgraphs,724.7350484463749,landmark,True | ||
| 5 | −4372046852,10.1007/978-3-031-26212-8_4,,Introduction to Algorithms,Texts in computer science,2023,book-chapter,algorithms,1,880.0,1114.0,804.2780269058295,1614,491.6762,False,False,post,804.2780269058295,landmark,True | 5 | +2112641412,10.37236/11668,,A Dynamic Survey of Graph Labeling,The Electronic Journal of Combinatorics,2022,article,algorithms,1,1698.0,1780.0,288.61814892416174,2162,44.7232,True,True,post,adynamicsurveyofgraphlabeling,288.61814892416174,landmark,True | ||
| 6 | −4285092328,10.1145/3544585.3544600,,A Note on Two Problems in Connexion with Graphs,ACM eBooks,2022,book-chapter,algorithms,1,631.0,868.0,724.7350484463749,1353,589.8043,True,False,baseline,724.7350484463749,landmark,True | 6 | +2003494253,10.1017/9781009260350.002,,Algorithms+Data Structures = Programs,Cambridge University Press eBooks,2024,book-chapter,algorithms,2,231.0,231.0,275.60804020100505,953,13.0275,True,False,post,algorithmsdatastructuresprograms,275.60804020100505,landmark,True | ||
| 7 | −3148190347,10.1142/9789811273117_0001,,Introduction to Graph Theory,WORLD SCIENTIFIC eBooks,2023,book-chapter,algorithms,1,502.0,503.0,455.41427595628414,885,6.2728,False,False,post,455.41427595628414,landmark,True | 7 | +7128526706,10.1007/s10462-026-11504-x,,Glider snake optimizer (GSO): a nature-inspired metaheuristic algorithm for global and engineering optimization problems,Artificial Intelligence Review,2026,article,algorithms,5,91.0,91.0,101.26493940172338,91,328.7483,True,True,post,glidersnakeoptimizergsoanatureinspiredmetaheuristicalgorithmforglobalandengineeringoptimizationproblems,230.72780750937136,landmark,True | ||
| 8 | −7128526706,10.1007/s10462-026-11504-x,,Glider snake optimizer (GSO): a nature-inspired metaheuristic algorithm for global and engineering optimization problems,Artificial Intelligence Review,2026,article,algorithms,5,91.0,91.0,101.26493940172338,91,328.7483,True,True,post,323.52507271848816,landmark,True | 8 | +1491280261,10.26190/unsworks/6784,,Grammatical bias for evolutionary learning,"UNSWorks (University of New South Wales, Sydney, Australia)",2022,dissertation,algorithms,1,26.0,28.0,209.69298245614038,96,,True,True,baseline,grammaticalbiasforevolutionarylearning,209.69298245614038,landmark,True | ||
| 9 | −2112641412,10.37236/11668,,A Dynamic Survey of Graph Labeling,The Electronic Journal of Combinatorics,2022,article,algorithms,1,1698.0,1780.0,288.61814892416174,2162,44.7232,True,True,post,288.61814892416174,landmark,True | 9 | +7125913058,10.1109/tsmc.2026.3655483,,Multiresource-Constrained Flexible Job Shop Scheduling With Fixture Pallets and Setup Stations Under Pallet Automation Systems,IEEE Transactions on Systems Man and Cybernetics Systems,2026,article,algorithms,3,73.0,73.0,84.02038567493113,73,309.1219,True,True,post,multiresourceconstrainedflexiblejobshopschedulingwithfixturepalletsandsetupstationsunderpalletautomationsystems,185.08934008993526,landmark,True | ||
| 10 | −3183881215,10.1007/978-1-4842-7077-6_3,,Introduction to Algorithms,Apress eBooks,2021,book-chapter,algorithms,1,276.0,434.0,279.4307771487391,877,222.2179,True,False,baseline,279.4307771487391,landmark,True | 10 | +3119051141,10.1016/j.cma.2020.113609,,The Arithmetic Optimization Algorithm,Computer Methods in Applied Mechanics and Engineering,2021,article,algorithms,2,900.0,1513.0,176.3286814620167,2928,183.3132,True,True,baseline,thearithmeticoptimizationalgorithm,176.3286814620167,landmark,True | ||
| 11 | −2003494253,10.1017/9781009260350.002,,Algorithms+Data Structures = Programs,Cambridge University Press eBooks,2024,book-chapter,algorithms,2,231.0,231.0,275.60804020100505,953,13.0275,True,False,post,275.60804020100505,landmark,True | 11 | +4406080942,10.1007/s10462-024-11023-7,,Artificial lemming algorithm: a novel bionic meta-heuristic technique for solving real-world engineering optimization problems,Artificial Intelligence Review,2025,article,algorithms,3,330.0,330.0,112.41427295439541,330,137.3209,True,True,post,artificiallemmingalgorithmanovelbionicmetaheuristictechniqueforsolvingrealworldengineeringoptimizationproblems,144.200617327393,landmark,True | ||
| 12 | −7125913058,10.1109/tsmc.2026.3655483,,Multiresource-Constrained Flexible Job Shop Scheduling With Fixture Pallets and Setup Stations Under Pallet Automation Systems,IEEE Transactions on Systems Man and Cybernetics Systems,2026,article,algorithms,3,73.0,73.0,84.02038567493113,73,309.1219,True,True,post,259.5311022906553,landmark,True | 12 | +2891784792,10.48550/arxiv.2407.17712,2407.17712,Improving Online Algorithms via ML Predictions,arXiv (Cornell University),2024,preprint,algorithms,2,111.0,112.0,142.64098765432098,112,,True,True,post,improvingonlinealgorithmsviamlpredictions,142.64098765432098,landmark,True | ||
| 13 | −1491280261,10.26190/unsworks/6784,,Grammatical bias for evolutionary learning,"UNSWorks (University of New South Wales, Sydney, Australia)",2022,dissertation,algorithms,1,26.0,28.0,209.69298245614038,96,,True,True,baseline,209.69298245614038,landmark,True | 13 | +3139484821,10.1016/j.cie.2021.107250,,Aquila Optimizer: A novel meta-heuristic optimization algorithm,Computers & Industrial Engineering,2021,article,algorithms,1,683.0,1186.0,138.21931012158083,2213,141.9398,False,False,baseline,aquilaoptimizeranovelmetaheuristicoptimizationalgorithm,138.21931012158083,landmark,True | ||
| 14 | −3111526966,10.1201/9781003091479-1,,Introduction to Algorithms,Chapman & Hall/CRC eBooks,2020,book-chapter,algorithms,1,193.0,202.0,200.82966396292002,428,40.7298,True,False,baseline,200.82966396292002,landmark,True | 14 | +2121903617,10.1201/9781482268713-14,,Introduction to evolutionary algorithms,CRC Press eBooks,2018,book-chapter,algorithms,1,260.0,292.0,135.62163175992498,349,50.6462,True,False,baseline,introductiontoevolutionaryalgorithms,135.62163175992498,landmark,True | ||
| 15 | −3119051141,10.1016/j.cma.2020.113609,,The Arithmetic Optimization Algorithm,Computer Methods in Applied Mechanics and Engineering,2021,article,algorithms,2,900.0,1513.0,176.3286814620167,2928,183.3132,True,True,baseline,176.3286814620167,landmark,True | 15 | +2207864362,10.58088/v6j9-5f14,,Properties of some algebraically defined digraphs,"Library, Museums and Press - UDSpace (University of Delaware)",2024,dissertation,algorithms,1,6.0,6.0,134.92307692307693,6,,True,True,post,propertiesofsomealgebraicallydefineddigraphs,134.92307692307693,landmark,True | ||
| 16 | −4406080942,10.1007/s10462-024-11023-7,,Artificial lemming algorithm: a novel bionic meta-heuristic technique for solving real-world engineering optimization problems,Artificial Intelligence Review,2025,article,algorithms,3,330.0,330.0,112.41427295439541,330,137.3209,True,True,post,167.06542210880582,landmark,True | 16 | +2125690626,,,Combinatorial optimization: networks and matroids,,2021,article,algorithms,2,738.0,779.0,125.39890722470469,3320,16.9958,True,True,baseline,combinatorialoptimizationnetworksandmatroids,125.39890722470469,landmark,True | ||
| 17 | −2146101030,10.82444/warw.33642076,,Communication complexity of document exchange,Symposium on Discrete Algorithms,2026,conference-paper,algorithms,3,46.0,46.0,353.0526747845123,122,9.2449,True,True,post,163.5401466489061,landmark,True | 17 | +2181620480,10.26190/unsworks/16444,,Robust solutions for constraint satisfaction and optimisation under uncertainty.,UNSWorks (UNSW Sydney),2022,dissertation,algorithms,2,16.0,16.0,120.8627450980392,17,,True,True,baseline,robustsolutionsforconstraintsatisfactionandoptimisationunderuncertainty,120.8627450980392,landmark,True | ||
| 18 | −4405348595,10.1142/9789811299223_0004,,Positive Definite Matrices,WORLD SCIENTIFIC eBooks,2024,book-chapter,algorithms,2,125.0,125.0,151.20861797162374,135,24.6654,True,True,post,151.20861797162374,landmark,True | 18 | +2117226423,10.1007/s43069-021-00101-z,,Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem,Operations Research Forum,2022,article,algorithms,2,683.0,742.0,120.31161039422922,1131,23.3118,True,True,baseline,worstcaseanalysisofanewheuristicforthetravellingsalesmanproblem,120.31161039422922,landmark,True | ||
| 19 | −7118096636,10.1016/j.eswa.2026.131088,,A modified starfish optimization algorithm (M-SFOA) for global optimization problems and its application to heart disease risk prediction,Expert Systems with Applications,2026,article,algorithms,1,42.0,42.0,46.737664339256945,42,151.73,False,False,post,149.31926433160993,landmark,True | 19 | +2146101030,10.82444/warw.33642076,,Communication complexity of document exchange,Symposium on Discrete Algorithms,2026,conference-paper,algorithms,3,46.0,46.0,353.0526747845123,122,9.2449,True,True,post,communicationcomplexityofdocumentexchange,116.63163896078113,landmark,True | ||
| 20 | −4233225156,10.1007/978-3-030-34209-8_4,,Introduction to Algorithms,Undergraduate topics in computer science,2020,book-chapter,algorithms,1,141.0,149.0,148.13673232908457,330,38.8354,False,False,baseline,148.13673232908457,landmark,True | 20 | +2963224980,10.1109/tkde.2018.2807452,1709.07604,"A Comprehensive Survey of Graph Embedding: Problems, Techniques, and Applications",IEEE Transactions on Knowledge and Data Engineering,2018,article,algorithms,4,296.0,609.0,114.94541813871597,2032,138.3391,True,True,baseline,acomprehensivesurveyofgraphembeddingproblemstechniquesandapplications,114.94541813871597,landmark,True | ||
| 21 | −2891784792,10.48550/arxiv.2407.17712,2407.17712,Improving Online Algorithms via ML Predictions,arXiv (Cornell University),2024,preprint,algorithms,2,111.0,112.0,142.64098765432098,112,,True,True,post,142.64098765432098,landmark,True | 21 | +7118096636,10.1016/j.eswa.2026.131088,,A modified starfish optimization algorithm (M-SFOA) for global optimization problems and its application to heart disease risk prediction,Expert Systems with Applications,2026,article,algorithms,1,42.0,42.0,46.737664339256945,42,151.73,False,False,post,amodifiedstarfishoptimizationalgorithmmsfoaforglobaloptimizationproblemsanditsapplicationtoheartdiseaseriskprediction,106.48975731201755,landmark,True | ||
| 22 | −7155156112,10.1007/s10462-026-11529-2,,Gray langurs optimizer: a multi-group bio-inspired optimization algorithm,Artificial Intelligence Review,2026,article,algorithms,1,40.0,40.0,44.5120612754828,40,144.5047,True,True,post,142.20882317296181,landmark,True | 22 | +2398690976,10.1609/aaai.v26i1.8120,,Online Task Assignment in Crowdsourcing Markets,Proceedings of the AAAI Conference on Artificial Intelligence,2021,conference-paper,algorithms,3,270.0,280.0,104.97509403273355,293,14.5296,True,True,baseline,onlinetaskassignmentincrowdsourcingmarkets,104.97509403273355,landmark,True | ||
| 23 | −3139484821,10.1016/j.cie.2021.107250,,Aquila Optimizer: A novel meta-heuristic optimization algorithm,Computers & Industrial Engineering,2021,article,algorithms,1,683.0,1186.0,138.21931012158083,2213,141.9398,False,False,baseline,138.21931012158083,landmark,True | 23 | +7155156112,10.1007/s10462-026-11529-2,,Gray langurs optimizer: a multi-group bio-inspired optimization algorithm,Artificial Intelligence Review,2026,article,algorithms,1,40.0,40.0,44.5120612754828,40,144.5047,True,True,post,graylangursoptimizeramultigroupbioinspiredoptimizationalgorithm,101.41881648763577,landmark,True | ||
| 24 | −2121903617,10.1201/9781482268713-14,,Introduction to evolutionary algorithms,CRC Press eBooks,2018,book-chapter,algorithms,1,260.0,292.0,135.62163175992498,349,50.6462,True,False,baseline,135.62163175992498,landmark,True | 24 | +2560014408,10.48550/arxiv.2411.10949,2411.10949,Maximization of Approximately Submodular Functions,arXiv (Cornell University),2024,preprint,algorithms,2,62.0,62.0,100.18129496402878,62,,True,True,post,maximizationofapproximatelysubmodularfunctions,100.18129496402878,landmark,True | ||
| 25 | −1486707681,10.82444/warw.33642484,,Sequence distance embeddings,Warwick Research Archive Portal (University of Warwick),2026,dissertation,algorithms,2,38.0,38.0,1163.0179211469535,64,,True,True,post,135.09838201431373,landmark,True | 25 | +4366545219,10.1007/978-1-4471-7503-2_33,,Genetic Algorithms and Their Applications,Springer handbooks,2023,book-chapter,algorithms,1,104.0,181.0,100.06977992485238,232,122.5764,False,False,post,geneticalgorithmsandtheirapplications,100.06977992485238,landmark,True | ||
| 26 | −2207864362,10.58088/v6j9-5f14,,Properties of some algebraically defined digraphs,"Library, Museums and Press - UDSpace (University of Delaware)",2024,dissertation,algorithms,1,6.0,6.0,134.92307692307693,6,,True,True,post,134.92307692307693,landmark,True | 26 | +4322738676,10.1201/9781003216001-5,,Introduction to Genetic Algorithm,Chapman & Hall/CRC eBooks,2023,book-chapter,algorithms,1,176.0,177.0,97.85829307568439,308,4.6255,True,False,post,introductiontogeneticalgorithm,97.85829307568439,landmark,True | ||
| 27 | −4254202520,10.7551/mitpress/12274.003.0008,,"On Computable Numbers, with an Application to the Entscheidungsproblem (1936)",The MIT Press eBooks,2021,book-chapter,computational_complexity,1,312.0,353.0,227.2789500772002,521,95.7524,False,False,baseline,227.2789500772002,landmark,True | 27 | +4254202520,10.7551/mitpress/12274.003.0008,,"On Computable Numbers, with an Application to the Entscheidungsproblem (1936)",The MIT Press eBooks,2021,book-chapter,computational_complexity,1,312.0,353.0,227.2789500772002,521,95.7524,False,False,baseline,oncomputablenumberswithanapplicationtotheentscheidungsproblem1936,227.2789500772002,landmark,True | ||
| 28 | −1638203394,10.1007/978-3-030-11298-1,,An Introduction to Kolmogorov Complexity and Its Applications,Texts in computer science,2019,book,computational_complexity,2,1326.0,1437.0,122.10728346456693,3681,45.0313,False,False,baseline,122.10728346456693,landmark,True | 28 | +1638203394,10.1007/978-3-030-11298-1,,An Introduction to Kolmogorov Complexity and Its Applications,Texts in computer science,2019,book,computational_complexity,2,1326.0,1437.0,122.10728346456693,3681,45.0313,False,False,baseline,anintroductiontokolmogorovcomplexityanditsapplications,122.10728346456693,landmark,True | ||
| 29 | −2979043732,,,ETH-tight algorithms for geometric network problems,TU/e Research Portal,2019,dissertation,computational_complexity,4,5.0,5.0,111.01694915254237,6,,True,True,baseline,111.01694915254237,landmark,True | 29 | +2979043732,,,ETH-tight algorithms for geometric network problems,TU/e Research Portal,2019,dissertation,computational_complexity,4,5.0,5.0,111.01694915254237,6,,True,True,baseline,ethtightalgorithmsforgeometricnetworkproblems,111.01694915254237,landmark,True | ||
| 30 | −2957144896,10.3389/fpsyg.2019.01652,,Factors Determining the Behavioral Intention to Use Mobile Learning: An Application and Extension of the UTAUT Model,Frontiers in Psychology,2019,article,computational_complexity,1,48.0,177.0,72.24848261060211,1039,114.0294,True,True,baseline,72.24848261060211,landmark,True | 30 | +2957144896,10.3389/fpsyg.2019.01652,,Factors Determining the Behavioral Intention to Use Mobile Learning: An Application and Extension of the UTAUT Model,Frontiers in Psychology,2019,article,computational_complexity,1,48.0,177.0,72.24848261060211,1039,114.0294,True,True,baseline,factorsdeterminingthebehavioralintentiontousemobilelearninganapplicationandextensionoftheutautmodel,72.24848261060211,landmark,True | ||
| 31 | −4241184911,10.1201/9780429494093-6,,Two-Dimensional Cellular Automata,CRC Press eBooks,2018,book-chapter,computational_complexity,2,86.0,93.0,68.7493670886076,307,25.2461,True,False,baseline,68.7493670886076,landmark,True | 31 | +4394806711,10.1016/j.heliyon.2024.e29523,,Artificial intelligence and social media on academic performance and mental well-being: Student perceptions of positive impact in the age of smart learning,Heliyon,2024,article,computational_complexity,1,118.0,197.0,59.311783860943,197,74.6231,True,True,post,artificialintelligenceandsocialmediaonacademicperformanceandmentalwellbeingstudentperceptionsofpositiveimpactintheageofsmartlearning,59.311783860943,landmark,True | ||
| 32 | −4394806711,10.1016/j.heliyon.2024.e29523,,Artificial intelligence and social media on academic performance and mental well-being: Student perceptions of positive impact in the age of smart learning,Heliyon,2024,article,computational_complexity,1,118.0,197.0,59.311783860943,197,74.6231,True,True,post,59.311783860943,landmark,True | 32 | +4386113651,10.48550/arxiv.2308.08708,2308.08708,Cheap Correlate or Discriminating Property? An Executable Validation Protocol for Consciousness- and Cognition-Theoretic Claims about AI,arXiv (Cornell University),2023,preprint,computational_complexity,1,89.0,170.0,57.664,193,,True,True,post,cheapcorrelateordiscriminatingpropertyanexecutablevalidationprotocolforconsciousnessandcognitiontheoreticclaimsaboutai,57.664,landmark,True | ||
| 33 | −4386113651,10.48550/arxiv.2308.08708,2308.08708,Cheap Correlate or Discriminating Property? An Executable Validation Protocol for Consciousness- and Cognition-Theoretic Claims about AI,arXiv (Cornell University),2023,preprint,computational_complexity,1,89.0,170.0,57.664,193,,True,True,post,57.664,landmark,True | 33 | +1513303009,,,Cellular Automata And Complexity: Collected Papers,CERN Document Server (European Organization for Nuclear Research),2019,article,computational_complexity,5,236.0,251.0,52.922228129373856,575,9.8222,True,True,baseline,cellularautomataandcomplexitycollectedpapers,52.922228129373856,landmark,True | ||
| 34 | −1513303009,,,Cellular Automata And Complexity: Collected Papers,CERN Document Server (European Organization for Nuclear Research),2019,article,computational_complexity,5,236.0,251.0,52.922228129373856,575,9.8222,True,True,baseline,52.922228129373856,landmark,True | 34 | +2905177801,,,Optimal trees for prediction and prescription,DSpace@MIT (Massachusetts Institute of Technology),2018,dissertation,computational_complexity,1,2.0,5.0,51.149155722326455,27,,True,True,baseline,optimaltreesforpredictionandprescription,51.149155722326455,landmark,True | ||
| 35 | −4406215947,10.3390/systems13010043,,"Digital Transformation and Innovation Performance in Small- and Medium-Sized Enterprises: A Systems Perspective on the Interplay of Digital Adoption, Digital Drive, and Digital Culture",Systems,2025,article,computational_complexity,1,104.0,104.0,24.553686934023286,104,125.7829,True,True,post,52.650920907017586,landmark,True | 35 | +2955897898,10.1109/access.2019.2921522,,Wireless Communications and Applications Above 100 GHz: Opportunities and Challenges for 6G and Beyond,IEEE Access,2019,article,computational_complexity,2,240.0,596.0,49.00829497340763,2594,88.2939,True,True,baseline,wirelesscommunicationsandapplicationsabove100ghzopportunitiesandchallengesfor6gandbeyond,49.00829497340763,landmark,True | ||
| 36 | −2905177801,,,Optimal trees for prediction and prescription,DSpace@MIT (Massachusetts Institute of Technology),2018,dissertation,computational_complexity,1,2.0,5.0,51.149155722326455,27,,True,True,baseline,51.149155722326455,landmark,True | 36 | +4377102915,10.1016/j.heliyon.2023.e16348,,"Challenges, opportunities, and prospects of adopting and using smart digital technologies in learning environments: An iterative review",Heliyon,2023,article,computational_complexity,1,78.0,204.0,47.81265827221507,331,77.7811,True,True,post,challengesopportunitiesandprospectsofadoptingandusingsmartdigitaltechnologiesinlearningenvironmentsaniterativereview,47.81265827221507,landmark,True | ||
| 37 | −2955897898,10.1109/access.2019.2921522,,Wireless Communications and Applications Above 100 GHz: Opportunities and Challenges for 6G and Beyond,IEEE Access,2019,article,computational_complexity,2,240.0,596.0,49.00829497340763,2594,88.2939,True,True,baseline,49.00829497340763,landmark,True | 37 | +3139085460,,,Reorienting machine learning education towards tinkerers and ML-engaged citizens,DSpace@MIT (Massachusetts Institute of Technology),2020,dissertation,computational_complexity,1,3.0,8.0,45.743589743589745,16,,True,False,baseline,reorientingmachinelearningeducationtowardstinkerersandmlengagedcitizens,45.743589743589745,landmark,True | ||
| 38 | −4377102915,10.1016/j.heliyon.2023.e16348,,"Challenges, opportunities, and prospects of adopting and using smart digital technologies in learning environments: An iterative review",Heliyon,2023,article,computational_complexity,1,78.0,204.0,47.81265827221507,331,77.7811,True,True,post,47.81265827221507,landmark,True | 38 | +4406215947,10.3390/systems13010043,,"Digital Transformation and Innovation Performance in Small- and Medium-Sized Enterprises: A Systems Perspective on the Interplay of Digital Adoption, Digital Drive, and Digital Culture",Systems,2025,article,computational_complexity,1,104.0,104.0,24.553686934023286,104,125.7829,True,True,post,digitaltransformationandinnovationperformanceinsmallandmediumsizedenterprisesasystemsperspectiveontheinterplayofdigitaladoptiondigitaldriveanddigitalculture,45.445043036511734,landmark,True | ||
| 39 | −3139085460,,,Reorienting machine learning education towards tinkerers and ML-engaged citizens,DSpace@MIT (Massachusetts Institute of Technology),2020,dissertation,computational_complexity,1,3.0,8.0,45.743589743589745,16,,True,False,baseline,45.743589743589745,landmark,True | 39 | +2808541536,,,Meet-continuity and locally compact sober dcpos,University of Birmingham Institutional Research Archive (University of Birmingham),2018,dissertation,computational_complexity,3,2.0,10.0,44.30861723446894,19,,True,True,baseline,meetcontinuityandlocallycompactsoberdcpos,44.30861723446894,landmark,True | ||
| 40 | −2808541536,,,Meet-continuity and locally compact sober dcpos,University of Birmingham Institutional Research Archive (University of Birmingham),2018,dissertation,computational_complexity,3,2.0,10.0,44.30861723446894,19,,True,True,baseline,44.30861723446894,landmark,True | 40 | +73572444,10.4324/9781003213574,,Complexity Theory and the Social Sciences,Routledge eBooks,2022,book,computational_complexity,1,197.0,215.0,43.70967741935484,454,13.2502,True,False,baseline,complexitytheoryandthesocialsciences,43.70967741935484,landmark,True | ||
| 41 | −73572444,10.4324/9781003213574,,Complexity Theory and the Social Sciences,Routledge eBooks,2022,book,computational_complexity,1,197.0,215.0,43.70967741935484,454,13.2502,True,False,baseline,43.70967741935484,landmark,True | 41 | +3086066649,10.1108/aeds-04-2020-0063,,The role of digital learning toward students' satisfaction and university brand image at educational institutes of Pakistan: a post-effect of COVID-19,Asian Education and Development Studies,2020,article,computational_complexity,1,40.0,110.0,32.031113421948945,216,36.2625,True,False,baseline,theroleofdigitallearningtowardstudentssatisfactionanduniversitybrandimageateducationalinstitutesofpakistanaposteffectofcovid19,32.031113421948945,landmark,True | ||
| 42 | −7122741622,10.3390/metrology6010003,,"Recent Advances in Digital Fringe Projection Profilometry (2022–2025): Techniques, Applications, and Metrological Challenges—A Review",Metrology,2026,article,computational_complexity,1,12.0,12.0,32.16440030557678,12,37.3956,True,True,post,42.66264695188855,landmark,True | 42 | +3122335070,,,Design and development of a mobile learning system for computer science education in Nigerian higher education context,UEF eRepo (University of Eastern Finland),2018,dissertation,computational_complexity,1,2.0,3.0,30.68949343339587,5,,True,True,baseline,designanddevelopmentofamobilelearningsystemforcomputerscienceeducationinnigerianhighereducationcontext,30.68949343339587,landmark,True | ||
| 43 | −7133302269,10.1016/j.chbr.2026.100986,,AI-assisted learning tools and student learning outcomes: A cognitive load theory perspective,Computers in Human Behavior Reports,2026,article,computational_complexity,1,12.0,12.0,85.25451005840362,12,109.834,True,True,post,42.66264695188855,landmark,True | 43 | +7133302269,10.1016/j.chbr.2026.100986,,AI-assisted learning tools and student learning outcomes: A cognitive load theory perspective,Computers in Human Behavior Reports,2026,article,computational_complexity,1,12.0,12.0,85.25451005840362,12,109.834,True,True,post,aiassistedlearningtoolsandstudentlearningoutcomesacognitiveloadtheoryperspective,30.425644946290728,landmark,True | ||
| 44 | −7160425037,10.1016/j.tcs.2026.116009,,Solving SAT by restricted spiking neural P systems with temporal division rules,Theoretical Computer Science,2026,article,computational_complexity,3,12.0,12.0,16.14637579169599,12,22.4653,False,False,post,42.66264695188855,landmark,True | 44 | +7122741622,10.3390/metrology6010003,,"Recent Advances in Digital Fringe Projection Profilometry (2022–2025): Techniques, Applications, and Metrological Challenges—A Review",Metrology,2026,article,computational_complexity,1,12.0,12.0,32.16440030557678,12,37.3956,True,True,post,recentadvancesindigitalfringeprojectionprofilometry20222025techniquesapplicationsandmetrologicalchallengesareview,30.425644946290728,landmark,True | ||
| 45 | −4391177866,10.1007/978-3-031-42209-6_2,,Computational Complexity,Undergraduate topics in computer science,2024,book-chapter,computational_complexity,2,32.0,32.0,38.1794687724336,49,0.0,False,False,post,38.1794687724336,landmark,True | 45 | +7160425037,10.1016/j.tcs.2026.116009,,Solving SAT by restricted spiking neural P systems with temporal division rules,Theoretical Computer Science,2026,article,computational_complexity,3,12.0,12.0,16.14637579169599,12,22.4653,False,False,post,solvingsatbyrestrictedspikingneuralpsystemswithtemporaldivisionrules,30.425644946290728,landmark,True | ||
| 46 | −4396808240,10.1007/978-3-031-53744-8_9,,Parameterized Complexity,Undergraduate topics in computer science,2024,book-chapter,computational_complexity,2,29.0,29.0,35.08039936941671,31,20.0406,False,False,post,35.08039936941671,landmark,True | 46 | +2900179285,10.1145/3313276.3316369,1809.07115,The Reachability Problem for Petri Nets Is Not Elementary,ACM SIGACT Symposium on Theory of Computing (STOC),2019,conference-paper,computational_complexity,4,56.0,92.0,30.27399489989691,145,23.6478,True,True,baseline,thereachabilityproblemforpetrinetsisnotelementary,30.27399489989691,landmark,True | ||
| 47 | −3086066649,10.1108/aeds-04-2020-0063,,The role of digital learning toward students' satisfaction and university brand image at educational institutes of Pakistan: a post-effect of COVID-19,Asian Education and Development Studies,2020,article,computational_complexity,1,40.0,110.0,32.031113421948945,216,36.2625,True,False,baseline,32.031113421948945,landmark,True | 47 | +4313549230,10.1109/acit57182.2022.9994193,,"The Influence of E-Iearning, M-learning, and D-learning on the Student Performance: Moderating Role of Institutional Support",International Arab Conference on Information Technology (ACIT),2022,conference-paper,computational_complexity,1,39.0,58.0,28.716532086697832,67,131.0986,True,False,baseline,theinfluenceofeiearningmlearninganddlearningonthestudentperformancemoderatingroleofinstitutionalsupport,28.716532086697832,landmark,True | ||
| 48 | −7127964361,10.3390/systems14020179,,"Turning Knowledge into Innovation: The Systemic Role of Knowledge Management Capability, Intellectual Capital, and Knowledge Utilization",Systems,2026,article,computational_complexity,1,9.0,9.0,8.79467680608365,9,57.758,True,True,post,31.99698521391641,landmark,True | 48 | +4318219991,10.1108/itp-02-2021-0152,,Students' adoption of AI-based teacher-bots (T-bots) for learning in higher education,Information Technology and People,2023,article,computational_complexity,1,47.0,118.0,27.6563415496146,171,40.183,True,False,post,studentsadoptionofaibasedteacherbotstbotsforlearninginhighereducation,27.6563415496146,landmark,True | ||
| 49 | −3122335070,,,Design and development of a mobile learning system for computer science education in Nigerian higher education context,UEF eRepo (University of Eastern Finland),2018,dissertation,computational_complexity,1,2.0,3.0,30.68949343339587,5,,True,True,baseline,30.68949343339587,landmark,True | 49 | +4408441779,10.1109/tem.2025.3551331,,Enhancing Creativity and Sustainable Competitive Advantage Through Data-Driven Decision-Making and Digital Leadership,IEEE Transactions on Engineering Management,2025,article,computational_complexity,1,59.0,59.0,19.444444444444446,59,84.1776,True,False,post,enhancingcreativityandsustainablecompetitiveadvantagethroughdatadrivendecisionmakinganddigitalleadership,25.781322491867233,landmark,True | ||
| 50 | −2900179285,10.1145/3313276.3316369,1809.07115,The Reachability Problem for Petri Nets Is Not Elementary,ACM SIGACT Symposium on Theory of Computing (STOC),2019,conference-paper,computational_complexity,4,56.0,92.0,30.27399489989691,145,23.6478,True,True,baseline,30.27399489989691,landmark,True | 50 | +3202325891,10.3390/s21196578,,"Electrochemical Impedance Spectroscopy (EIS): Principles, Construction, and Biosensing Applications",Sensors,2021,article,computational_complexity,1,85.0,323.0,25.03316097346723,1335,44.934,True,True,baseline,electrochemicalimpedancespectroscopyeisprinciplesconstructionandbiosensingapplications,25.03316097346723,landmark,True | ||
| 51 | −4408441779,10.1109/tem.2025.3551331,,Enhancing Creativity and Sustainable Competitive Advantage Through Data-Driven Decision-Making and Digital Leadership,IEEE Transactions on Engineering Management,2025,article,computational_complexity,1,59.0,59.0,19.444444444444446,59,84.1776,True,False,post,29.86927243763498,landmark,True | 51 | +2118110454,10.1017/s1755020325100920,,WHEN BI-INTERPRETABILITY IMPLIES SYNONYMY,The Review of Symbolic Logic,2025,article,computational_complexity,1,56.0,56.0,44.757894736842104,56,0.0,True,True,post,whenbiinterpretabilityimpliessynonymy,24.47040778889093,landmark,True | ||
modified
manuscript/references_part05.bib
+3 −3
@@ -661,7 +661,7 @@ | |||||
| 661 | title = {{ChatGPT: Bullshit spewer or the end of traditional assessments in higher education?}}, | 661 | title = {{ChatGPT: Bullshit spewer or the end of traditional assessments in higher education?}}, | ||
| 662 | author = {Rudolph, Jürgen and Tan, Samson and Tan, Shannon}, | 662 | author = {Rudolph, Jürgen and Tan, Samson and Tan, Shannon}, | ||
| 663 | year = {2023}, | 663 | year = {2023}, | ||
| 664 | − journal = {Journal of Applied Learning \& Teaching}, | 664 | + journal = {Journal of Applied Learning \& Teaching}, | ||
| 665 | volume = {6}, | 665 | volume = {6}, | ||
| 666 | number = {1}, | 666 | number = {1}, | ||
| 667 | doi = {10.37074/jalt.2023.6.1.9} | 667 | doi = {10.37074/jalt.2023.6.1.9} | ||
@@ -679,7 +679,7 @@ | |||||
| 679 | } | 679 | } | ||
| 680 | 680 | ||||
| 681 | @article{wu2025radfm, | 681 | @article{wu2025radfm, | ||
| 682 | − title = {{Towards generalist foundation model for radiology by leveraging web-scale 2D\&3D medical data}}, | 682 | + title = {{Towards generalist foundation model for radiology by leveraging web-scale 2D\&3D medical data}}, | ||
| 683 | author = {Wu, Chaoyi and Zhang, Xiaoman and Zhang, Ya and Hui, Hui and Wang, Yanfeng and Xie, Weidi}, | 683 | author = {Wu, Chaoyi and Zhang, Xiaoman and Zhang, Ya and Hui, Hui and Wang, Yanfeng and Xie, Weidi}, | ||
| 684 | year = {2025}, | 684 | year = {2025}, | ||
| 685 | journal = {Nature Communications}, | 685 | journal = {Nature Communications}, | ||
@@ -747,7 +747,7 @@ | |||||
| 747 | title = {{On the foundations of Earth foundation models}}, | 747 | title = {{On the foundations of Earth foundation models}}, | ||
| 748 | author = {Zhu, Xiao Xiang and Xiong, Zhitong and Wang, Yi and Stewart, Adam J. and Heidler, Konrad and Wang, Yuanyuan and Yuan, Zhenghang and Dujardin, Thomas and Xu, Qingsong and Shi, Yilei}, | 748 | author = {Zhu, Xiao Xiang and Xiong, Zhitong and Wang, Yi and Stewart, Adam J. and Heidler, Konrad and Wang, Yuanyuan and Yuan, Zhenghang and Dujardin, Thomas and Xu, Qingsong and Shi, Yilei}, | ||
| 749 | year = {2026}, | 749 | year = {2026}, | ||
| 750 | − journal = {Communications Earth \& Environment}, | 750 | + journal = {Communications Earth \& Environment}, | ||
| 751 | volume = {7}, | 751 | volume = {7}, | ||
| 752 | number = {1}, | 752 | number = {1}, | ||
| 753 | doi = {10.1038/s43247-025-03127-x} | 753 | doi = {10.1038/s43247-025-03127-x} | ||
added
manuscript/scratch_p6.pdf
+0 −0
Binary file not shown.
added
manuscript/scratch_p6.tex
+52 −0
@@ -0,0 +1,52 @@ | |||||
| 1 | +% ============================================================================ | ||||
| 2 | +% UQO Working Paper 44 — The Post-ChatGPT Computer Science Revolution | ||||
| 3 | +% Preamble follows the UQO working-paper template (_modele-working-paper/main.tex) | ||||
| 4 | +% ============================================================================ | ||||
| 5 | +\documentclass[12pt,letterpaper]{article} | ||||
| 6 | +\usepackage[utf8]{inputenc} | ||||
| 7 | +\usepackage[T1]{fontenc} | ||||
| 8 | +\usepackage[english]{babel} | ||||
| 9 | +\usepackage[letterpaper,top=1in,bottom=1in,left=1in,right=1in]{geometry} | ||||
| 10 | +\usepackage{mathptmx} | ||||
| 11 | +\usepackage{microtype} | ||||
| 12 | +\usepackage{setspace} | ||||
| 13 | +\onehalfspacing | ||||
| 14 | +\usepackage{amsmath,amssymb,amsthm} | ||||
| 15 | +\usepackage{booktabs,tabularx,multirow,threeparttable,longtable,array} | ||||
| 16 | +\usepackage{siunitx} | ||||
| 17 | +\sisetup{input-symbols = {()}, table-format = -1.3, parse-numbers = false} | ||||
| 18 | +\usepackage{graphicx,subcaption,float} | ||||
| 19 | +\usepackage[dvipsnames]{xcolor} | ||||
| 20 | +\usepackage[colorlinks=true,linkcolor=NavyBlue,citecolor=NavyBlue,urlcolor=NavyBlue,breaklinks=true]{hyperref} | ||||
| 21 | +\usepackage[authoryear,round,semicolon]{natbib} | ||||
| 22 | +\bibliographystyle{aer} | ||||
| 23 | +\usepackage[font=small,labelfont=bf,labelsep=period,justification=justified,singlelinecheck=false]{caption} | ||||
| 24 | +\usepackage{fancyhdr} | ||||
| 25 | +\pagestyle{fancy}\fancyhf{}\renewcommand{\headrulewidth}{0pt}\fancyfoot[C]{\thepage} | ||||
| 26 | +\usepackage{titlesec} | ||||
| 27 | +\titleformat{\section}{\large\bfseries}{\thesection.}{0.5em}{} | ||||
| 28 | +\titleformat{\subsection}{\normalsize\bfseries}{\thesubsection.}{0.5em}{} | ||||
| 29 | +\titleformat{\subsubsection}{\normalsize\itshape}{\thesubsubsection.}{0.5em}{} | ||||
| 30 | +\usepackage[toc,page]{appendix} | ||||
| 31 | +\usepackage{enumitem} | ||||
| 32 | +\setlist{nosep,leftmargin=*} | ||||
| 33 | +\newtheorem{definition}{Definition} | ||||
| 34 | +\newtheorem{proposition}{Proposition} | ||||
| 35 | +\newtheorem{hypothesis}{Hypothesis} | ||||
| 36 | +\newcommand{\E}{\mathbb{E}} | ||||
| 37 | +\newcommand{\R}{\mathbb{R}} | ||||
| 38 | +\newcommand{\pending}[1]{\textcolor{BrickRed}{[pending human review: #1]}} | ||||
| 39 | +\graphicspath{{figures/}} | ||||
| 40 | + | ||||
| 41 | +% ---- metadata ---- | ||||
| 42 | +\newcommand{\WPnumber}{44} | ||||
| 43 | +\newcommand{\WPtitle}{The Post-ChatGPT Computer Science Revolution} | ||||
| 44 | +\newcommand{\WPsubtitle}{A Comprehensive Systematic Mapping, Bibliometric Analysis, and Knowledge Graph of Computer Science Research, 2022--2026} | ||||
| 45 | +\newcommand{\WPdate}{November 2026} | ||||
| 46 | +\newcommand{\WPversion}{0.1} | ||||
| 47 | +\input{tables/numbers} % machine-generated macros (counts, estimates) — never edited by hand | ||||
| 48 | +\begin{document} | ||||
| 49 | +\input{tables/tab_systems_categories} | ||||
| 50 | +\input{sections/part06_systems} | ||||
| 51 | +\bibliography{references_all} | ||||
| 52 | +\end{document} | ||||
modified
manuscript/sections/part06_systems.tex
+149 −1
@@ -1 +1,149 @@ | |||||
| 1 | −% part06_systems — to be written (Phase 7) | 1 | +% ============================================================================ | ||
| 2 | +% Part VI — Systems and Computing Infrastructure | ||||
| 3 | +% Written by Agent F (Systems Specialist), WP44, 2026-11-03. | ||||
| 4 | +% Sources: literature_synthesis/agent_F/{review.md,claims.csv,contributions.csv,open_problems.csv}; | ||||
| 5 | +% bibliography: references.bib (group J and systems canon) + references_part06.bib (verified; references_verification_part06.csv). | ||||
| 6 | +% Corpus quantities only through the macros of tables/numbers.tex (prefixes Cagr*, Catcount*, ItsSeriesCat*, Sysflow*, Selection*). | ||||
| 7 | +% ============================================================================ | ||||
| 8 | + | ||||
| 9 | +\section{Scope and evidence} | ||||
| 10 | +\label{sec:p6-scope} | ||||
| 11 | + | ||||
| 12 | +This part reviews the eleven categories of the taxonomy that describe how computation is built, housed and delivered: computer architecture, accelerators and AI hardware, operating systems, distributed computing, cloud computing, edge computing, computer networks, database systems, information retrieval, quantum computing and sustainable computing. In the area partition of Appendix~A the first six belong to \emph{data and distributed systems} and the last five to \emph{hardware and emerging paradigms}; the grouping adopted here follows the intellectual dependencies instead, so that accelerators are read with architecture, operating systems with distributed systems, and information retrieval with databases. | ||||
| 13 | + | ||||
| 14 | +The evidence is of two kinds and the two are kept apart throughout. The first is the corpus itself: the yearly primary-category counts and growth rates of Part~IX (Tables~\ref{tab:cagr} and~\ref{tab:systems_categories}), the structural-change estimates of the monthly log-volume series (Table~\ref{tab:breaks}), and the citation flows between categories of the knowledge graph. The second is the landmark lists of the two areas, \SelectionByAreaDataDistributed{} records for data and distributed systems and \SelectionByAreaHardwareEmerging{} for hardware and emerging paradigms, selected by the rule of Part~III (the most cited works of each primary category under the field-normalised thirty-six-month window, with a floor of twenty-five records per category; for 2025 and 2026, twelve-month citations relative to the year mean). What is known about these works is their metadata and, for most of them, their abstract; no full text was consulted. Consequently every statement about the content of a paper below reports what its abstract says, and a paper whose abstract is absent from the corpus is described from its title and venue only. Preprints are named as preprints. The structured record of each claim, with its evidence type and confidence, is in the file \texttt{literature\_synthesis/agent\_F/claims.csv}. | ||||
| 15 | + | ||||
| 16 | +Two properties of the landmark lists bound what they can show. The selection rule favours records that OpenAlex has dated to a re-publication rather than to the original: the distributed-computing list opens with MapReduce \citep{dean2008mapreduce}, Lamport's ``Time, clocks'' and ``The Byzantine generals problem'' recorded as 2018--2019 items, and the computer-architecture list is headed by the NumPy paper. Such records measure what the field cites, not what it produced, and they are set aside. The rule also admits, for 2025--2026, records with very few citations in absolute terms, so that the most recent ``landmarks'' are indications of current citation rather than established contributions. More consequential is classification noise. Roughly one record in five in the two lists is not systems research at all: dissertations on language teaching and admission systems under cloud computing and operating systems, an ethnography of mobile phones and the Paleobiology Database user guide under database systems, nursing students' AI literacy and regulatory sandboxes under operating systems, mammography screening under quantum computing, higher-education surveys under sustainable computing, control-theory papers under distributed computing, molecular-dynamics codes under computer architecture. These records are listed, with their identifiers, in \texttt{literature\_synthesis/agent\_F/review.md}; they are excluded from the synthesis, and their frequency is reported because it bounds the precision of every category-level statistic that follows. The taxonomy's validation in Appendix~A did not sample these categories at the depth that would estimate the error rate, and this is recorded as an open problem for the data-quality discussion of Part~XI. | ||||
| 17 | + | ||||
| 18 | +\section{The systems categories in the corpus} | ||||
| 19 | +\label{sec:p6-corpus} | ||||
| 20 | + | ||||
| 21 | +\subsection{Volume, growth and share} | ||||
| 22 | +\label{sec:p6-growth} | ||||
| 23 | + | ||||
| 24 | +Table~\ref{tab:systems_categories} assembles, for the eleven categories, the primary-category output in 2018, 2022 and 2025, the compound annual growth rates over the baseline (2018--2022) and post (2023--2025) periods, and the structural-change statistics discussed below. The first regularity is a division into two groups. Seven classical categories declined in absolute output between 2018 and 2022 and grew between 2023 and 2025: computer architecture (\CagrComputerArchitectureCagrBaseline{} then \CagrComputerArchitectureCagrPost{} per year), operating systems (\CagrOperatingSystemsCagrBaseline{} then \CagrOperatingSystemsCagrPost), distributed computing (\CagrDistributedComputingCagrBaseline{} then \CagrDistributedComputingCagrPost), cloud computing (\CagrCloudComputingCagrBaseline{} then \CagrCloudComputingCagrPost), computer networks (\CagrComputerNetworksCagrBaseline{} then \CagrComputerNetworksCagrPost), database systems (\CagrDatabaseSystemsCagrBaseline{} then \CagrDatabaseSystemsCagrPost) and information retrieval (\CagrInformationRetrievalCagrBaseline{} then \CagrInformationRetrievalCagrPost). Four categories grew in both periods: edge computing (\CagrEdgeComputingCagrBaseline{} then \CagrEdgeComputingCagrPost), quantum computing (\CagrQuantumComputingCagrBaseline{} then \CagrQuantumComputingCagrPost), sustainable computing (\CagrSustainableComputingCagrBaseline{} then \CagrSustainableComputingCagrPost) and AI accelerators (\CagrAiAcceleratorsCagrBaseline{} then \CagrAiAcceleratorsCagrPost). The 2026 counts are excluded from the growth rates because the year is incomplete. | ||||
| 25 | + | ||||
| 26 | +The second regularity concerns shares rather than levels. Computer networks, the largest of the eleven, held \CagrComputerNetworksShareTwoZeroOneEight{} of all primary output in 2018 and \CagrComputerNetworksShareTwoZeroTwoFive{} in 2025; computer architecture fell from \CagrComputerArchitectureShareTwoZeroOneEight{} to \CagrComputerArchitectureShareTwoZeroTwoFive, database systems from \CagrDatabaseSystemsShareTwoZeroOneEight{} to \CagrDatabaseSystemsShareTwoZeroTwoFive, distributed computing from \CagrDistributedComputingShareTwoZeroOneEight{} to \CagrDistributedComputingShareTwoZeroTwoFive, cloud computing from \CagrCloudComputingShareTwoZeroOneEight{} to \CagrCloudComputingShareTwoZeroTwoFive{} and operating systems from \CagrOperatingSystemsShareTwoZeroOneEight{} to \CagrOperatingSystemsShareTwoZeroTwoFive. Quantum computing rose from \CagrQuantumComputingShareTwoZeroOneEight{} to \CagrQuantumComputingShareTwoZeroTwoFive{} and sustainable computing from \CagrSustainableComputingShareTwoZeroOneEight{} to \CagrSustainableComputingShareTwoZeroTwoFive. The relative decline of the classical systems fields is therefore a phenomenon of the whole period: it began before November 2022 and continued after it, while the absolute output of those fields recovered. Any reading of the post-2022 recovery as a response to a new workload must be weighed against the simpler possibility of reversion after a four-year decline whose causes this corpus does not identify. | ||||
| 27 | + | ||||
| 28 | +\subsection{Structural change} | ||||
| 29 | +\label{sec:p6-breaks} | ||||
| 30 | + | ||||
| 31 | +The interrupted time-series model of Part~IV, fitted to the monthly log-volume series of each category with the event at December 2022, yields a positive change in trend for all eleven categories, with heteroskedasticity-and-autocorrelation-consistent $p$-values below one per cent in every case. The change is smallest for edge computing (\ItsSeriesCatEdgeComputingItsChatgptSlopeChange{} per month, $p = \ItsSeriesCatEdgeComputingItsChatgptSlopeP$) and largest for information retrieval (\ItsSeriesCatInformationRetrievalItsChatgptSlopeChange), with distributed computing (\ItsSeriesCatDistributedComputingItsChatgptSlopeChange), cloud computing (\ItsSeriesCatCloudComputingItsChatgptSlopeChange), accelerators (\ItsSeriesCatAiAcceleratorsItsChatgptSlopeChange), quantum computing (\ItsSeriesCatQuantumComputingItsChatgptSlopeChange), architecture (\ItsSeriesCatComputerArchitectureItsChatgptSlopeChange), operating systems (\ItsSeriesCatOperatingSystemsItsChatgptSlopeChange), sustainable computing (\ItsSeriesCatSustainableComputingItsChatgptSlopeChange), database systems (\ItsSeriesCatDatabaseSystemsItsChatgptSlopeChange) and networks (\ItsSeriesCatComputerNetworksItsChatgptSlopeChange) in between. The uniformity is the finding. A steepening of the same order in quantum computing, which has no methodological connection with language models, and in information retrieval, which has a direct one, is not the signature of a workload-specific shock; it is the signature of a field-wide acceleration whose timing the placebo analysis then tests. | ||||
| 32 | + | ||||
| 33 | +The placebo test rejects date-specificity for every systems category. The share of alternative event dates whose slope statistic is at least as extreme as the one estimated at December 2022 would have to be small for the date to be singled out, and it is never small: \ItsSeriesCatComputerArchitecturePlaceboChatgptSlopeTPlaceboP{} for architecture, \ItsSeriesCatDistributedComputingPlaceboChatgptSlopeTPlaceboP{} for distributed computing, \ItsSeriesCatEdgeComputingPlaceboChatgptSlopeTPlaceboP{} for edge computing, \ItsSeriesCatDatabaseSystemsPlaceboChatgptSlopeTPlaceboP{} for databases, \ItsSeriesCatInformationRetrievalPlaceboChatgptSlopeTPlaceboP{} for information retrieval, \ItsSeriesCatQuantumComputingPlaceboChatgptSlopeTPlaceboP{} for quantum computing, \ItsSeriesCatAiAcceleratorsPlaceboChatgptSlopeTPlaceboP{} for accelerators, \ItsSeriesCatSustainableComputingPlaceboChatgptSlopeTPlaceboP{} for sustainable computing, \ItsSeriesCatComputerNetworksPlaceboChatgptSlopeTPlaceboP{} for networks, \ItsSeriesCatCloudComputingPlaceboChatgptSlopeTPlaceboP{} for cloud computing and \ItsSeriesCatOperatingSystemsPlaceboChatgptSlopeTPlaceboP{} for operating systems. Level changes at the event month are heterogeneous in sign: negative and significant at the five-per-cent level for information retrieval (\ItsSeriesCatInformationRetrievalItsChatgptLevelChange, $p = \ItsSeriesCatInformationRetrievalItsChatgptLevelP$), accelerators (\ItsSeriesCatAiAcceleratorsItsChatgptLevelChange, $p = \ItsSeriesCatAiAcceleratorsItsChatgptLevelP$) and quantum computing (\ItsSeriesCatQuantumComputingItsChatgptLevelChange, $p = \ItsSeriesCatQuantumComputingItsChatgptLevelP$); positive and significant for computer networks (\ItsSeriesCatComputerNetworksItsChatgptLevelChange, $p = \ItsSeriesCatComputerNetworksItsChatgptLevelP$) and sustainable computing (\ItsSeriesCatSustainableComputingItsChatgptLevelChange, $p = \ItsSeriesCatSustainableComputingItsChatgptLevelP$); indistinguishable from zero for the other six, with cloud computing the clearest null (\ItsSeriesCatCloudComputingItsChatgptLevelChange, $p = \ItsSeriesCatCloudComputingItsChatgptLevelP$). The placebo $p$-values for the level statistics exceed \ItsSeriesCatAiAcceleratorsPlaceboChatgptLevelTPlaceboP{} in every category. The Bai--Perron break dates selected by the Bayesian information criterion, reported in Table~\ref{tab:systems_categories}, are scattered from the beginning of 2022 to the spring of 2025; cloud computing is the only category with a selected break in the month of the ChatGPT release, and the single break of the networks series precedes it. The reading that the corpus supports is a broad acceleration of systems output from 2022--2023 onward that the November 2022 date does not single out, superimposed on the prior decline of the classical categories. | ||||
| 34 | + | ||||
| 35 | +\subsection{Citation flows} | ||||
| 36 | +\label{sec:p6-flows} | ||||
| 37 | + | ||||
| 38 | +The category-to-category citation flows of the knowledge graph, aggregated over citing years 2018--2022 and 2023--2026,\footnote{Calendar citing years; the aggregation does not use the 30 November 2022 boundary. Source: \texttt{results/graph/category\_flows\_yearly.csv}, aggregated by the macros of \texttt{tables/make\_numbers.py}.} show the systems categories to be strongly self-referential and stable. In the post years the share of references that a category's works send to works of the same category is \SysflowQuantumComputingPostToQuantumComputingShare\% for quantum computing, \SysflowComputerNetworksPostToComputerNetworksShare\% for computer networks, \SysflowInformationRetrievalPostToInformationRetrievalShare\% for information retrieval, \SysflowComputerArchitecturePostToComputerArchitectureShare\% for computer architecture, \SysflowDatabaseSystemsPostToDatabaseSystemsShare\% for database systems, \SysflowAiAcceleratorsPostToAiAcceleratorsShare\% for accelerators, \SysflowCloudComputingPostToCloudComputingShare\% for cloud computing, \SysflowDistributedComputingPostToDistributedComputingShare\% for distributed computing, \SysflowEdgeComputingPostToEdgeComputingShare\% for edge computing, \SysflowOperatingSystemsPostToOperatingSystemsShare\% for operating systems and \SysflowSustainableComputingPostToSustainableComputingShare\% for sustainable computing. None of these shares moved by more than a few points from the baseline years (operating systems from \SysflowOperatingSystemsBaselineToOperatingSystemsShare\%, quantum computing from \SysflowQuantumComputingBaselineToQuantumComputingShare\%). Three details are relevant to the synthesis. The large-language-model category receives \SysflowInformationRetrievalPostToLlmShare\% of information-retrieval references in the post years against \SysflowInformationRetrievalBaselineToLlmShare\% before, the only systems category in which that destination becomes measurable. Operating systems now sends more references to computer architecture (\SysflowOperatingSystemsPostToComputerArchitectureShare\%) than to itself, which is consistent with the GPU-centred systems work reviewed in Section~\ref{sec:p6-os}. Edge computing and sustainable computing cite computer networks (\SysflowEdgeComputingPostToComputerNetworksShare\% and \SysflowSustainableComputingPostToComputerNetworksShare\%) more than their own category in both periods, a fact about where the classifier draws its boundaries as much as about intellectual dependence. The flows give no sign of a reorganisation of the systems fields around artificial intelligence between the two periods; what changed, as the following sections show, is the content of the most cited works within categories whose citation neighbourhoods stayed where they were. | ||||
| 39 | + | ||||
| 40 | +\section{Computer architecture and accelerators} | ||||
| 41 | +\label{sec:p6-arch} | ||||
| 42 | + | ||||
| 43 | +\subsection{The end of scaling and the arrival of one workload} | ||||
| 44 | +\label{sec:p6-arch-scaling} | ||||
| 45 | + | ||||
| 46 | +The architecture literature of the baseline period is organised around a diagnosis that predates it: the end of Dennard scaling \citep{dennard1974scaling} and the slowing of Moore's law left domain-specific architecture as the remaining route to performance, a position stated in the Turing lecture of \citet{hennessy2019goldenage} and quantified by \citet{leiserson2020roomattop}, who locate the remaining gains in software, algorithms and hardware specialisation rather than in transistors. The tensor processing unit \citep{jouppi2017tpu} and the GPU lineage \citep{dally2021gpu} are the canonical instances; \citet{sze2017efficientdnn} is the standard account of why neural-network inference rewards specialised data paths. The landmark lists confirm that this is the lineage the field cites, and they add the processing-in-memory primer of \citet{mutlu2023pim} and the concurrency analysis of distributed deep learning by \citet{bennun2020demystifying} as the most cited expository works of the pre-2022 years. What the baseline lists also contain, and what is set aside, are scientific-software papers (NumPy, NAMD, Quantum ESPRESSO) that the classifier assigns to architecture because their topics concern CPU and GPU execution. | ||||
| 47 | + | ||||
| 48 | +After 2022 the most cited architecture works, once misclassified records are removed, form a single set: systems papers for the training and serving of large language models. This is the central empirical observation of this section and it is a statement about metadata, not about the field's full output: the citation-ranked top of the category is occupied by one workload. The corpus statistics of Section~\ref{sec:p6-corpus} qualify it at once. Architecture's trend change at December 2022 (\ItsSeriesCatComputerArchitectureItsChatgptSlopeChange{} per month) is in the middle of the systems range, its level change is null ($p = \ItsSeriesCatComputerArchitectureItsChatgptLevelP$), and its share of computer-science output fell from \CagrComputerArchitectureShareTwoZeroOneEight{} to \CagrComputerArchitectureShareTwoZeroTwoFive. The concentration of citation on LLM systems papers occurred within a category that did not grow faster than the rest and whose relative weight continued to decline. | ||||
| 49 | + | ||||
| 50 | +\subsection{Training and inference systems} | ||||
| 51 | +\label{sec:p6-arch-systems} | ||||
| 52 | + | ||||
| 53 | +The training-systems line is largely a pre-window inheritance recorded in preprints and conference papers: tensor and pipeline parallelism in Megatron-LM \citep[preprint]{shoeybi2019megatronlm} and its scaling to thousands of GPUs \citep{narayanan2021megatron}, memory partitioning of optimiser state in ZeRO \citep{rajbhandari2020zero}, fully sharded data parallelism in PyTorch \citep[preprint]{zhao2023fsdp}, and the asynchronous dataflow of Pathways \citep[preprint]{barham2022pathways}. The compiler stack beneath these systems is the one documented in Part~VII: LLVM and MLIR \citep{lattner2004llvm,lattner2021mlir}, TVM \citep[preprint]{chen2018tvm}, Triton \citep{tillet2019triton}. The landmark set adds the paper that brought graph compilation into the dominant framework: \citet{ansel2024pytorch2} describe TorchDynamo, which captures computation graphs by rewriting Python bytecode before execution, and TorchInductor, which lowers them to Triton for GPUs and to C++ for CPUs; the abstract reports geometric-mean speedups of 2.27$\times$ for inference and 1.41$\times$ for training over eager execution on the authors' model suite. This is a vendor-authored evaluation of the authors' own system, which is the norm in this literature and the reason the claims below are reported as the authors' rather than as established. | ||||
| 54 | + | ||||
| 55 | +The inference-systems line is where the window's own contributions lie, and it is organised by one bottleneck. \citet{gholami2024memorywall}, in a perspective article in \emph{IEEE Micro}, state that peak server FLOPS grew at $3.0\times$ per two years over the past twenty years while DRAM bandwidth grew at $1.6\times$ and interconnect bandwidth at $1.4\times$, and argue that memory bandwidth, not arithmetic throughput, has become the binding constraint for decoder-only Transformers at serving time. The trend figures are the authors' and are not re-derived here, but the diagnosis organises the rest of the literature. \citet{pope2023inference}, in a preprint, derive the latency--throughput frontier of Transformer inference under memory and communication limits; FlashAttention \citep[preprint]{dao2022flashattention} reduces memory traffic of the attention kernel by tiling; quantisation methods reduce the weight bytes moved per token, from post-training GPTQ \citep[preprint]{frantar2023gptq} to activation-aware AWQ, whose abstract reports an algorithm--system co-design with an on-device framework (TinyChat) that converts memory savings into speedups through on-the-fly dequantisation and kernel fusion \citep{lin2025awq}. The serving systems proper are discussed with operating systems in Section~\ref{sec:p6-os}, because their abstraction is memory management; here it suffices to note that Splitwise \citep{patel2024splitwise}, an ISCA paper, characterises each inference request as a compute-intensive prompt phase and a memory-intensive token-generation phase with distinct latency, throughput and power profiles, and places the two phases on separate machine pools so that generation runs on older or lower-power hardware. Taken together these works establish, at the level of abstracts, that the architecture community's response to the LLM workload in 2023--2025 was to redesign the memory system and the deployment topology rather than the arithmetic unit. Whether the memory-wall diagnosis survives changes in the installed base, and whether gains attributed to it come from bandwidth or from model-side sparsity, are open (Section~\ref{sec:p6-synthesis}). | ||||
| 56 | + | ||||
| 57 | +The survey of \citet{silvano2025accelerators} closes the period: it classifies accelerators for heterogeneous HPC platforms into GPU and TPU systems, FPGA and ASIC designs, neural processing units, open RISC-V accelerators, and emerging-memory and neuromorphic devices. That such a survey, and the earlier benchmarking of commercial accelerators by \citet{reuther2022accelerators} and TPU v4 \citep{jouppi2023tpuv4}, do not appear in the accelerator landmark list but in the bibliography is a reminder that the classifier routes digital accelerators to architecture. | ||||
| 58 | + | ||||
| 59 | +\subsection{Photonic, neuromorphic and in-memory accelerators} | ||||
| 60 | +\label{sec:p6-accel} | ||||
| 61 | + | ||||
| 62 | +The accelerator category is the one most affected by classification: at least half of its post-period landmarks are memristive and chaotic Hopfield-network circuit papers in journals of nonlinear dynamics and circuit design, a literature on attractors, multistability and image encryption that the topic classifier maps to AI hardware. Removing it leaves a photonic and neuromorphic thread whose baseline anchors are Loihi, Intel's neuromorphic manycore processor with programmable synaptic learning rules \citep{davies2018loihi}, and the perspective on neuromorphic algorithms and applications of \citet{schuman2022neuromorphic}. The post-period additions are optical: the Taichi photonic chiplet \citep{xu2024taichi}, whose abstract reports a diffractive--interference hybrid design with a distributed architecture reaching 160~TOPS/W and on-chip classification over a thousand categories; the universal photonic accelerator of \citet{ahmed2025photonic}, for which the corpus holds no abstract; a review of optical neural networks \citep{fu2024onn}; and, in 2026, a monolithically integrated neuromorphic photonic circuit with on-chip capacitive analog memory, whose abstract reports an analysed power saving of more than 26$\times$ relative to SRAM--DAC designs \citep{lam2026neuromorphicphotonic}, together with a hyper-multiplexed matrix--matrix optical processor. | ||||
| 63 | + | ||||
| 64 | +These are device-level demonstrations evaluated on small tasks, and the efficiency figures they report are figures for the photonic core. None of the abstracts reports end-to-end energy including digital-to-analog and analog-to-digital conversion, memory traffic and precision loss, and none compares against a precision-matched digital accelerator under a shared benchmark. The literature is therefore classified here as speculative with respect to its claim on the computing infrastructure: the physics is established, the system-level advantage is not. The corpus statistics reinforce the caution. The accelerator category's level fell at December 2022 (\ItsSeriesCatAiAcceleratorsItsChatgptLevelChange, $p = \ItsSeriesCatAiAcceleratorsItsChatgptLevelP$), its post-period growth (\CagrAiAcceleratorsCagrPost{} per year) is slower than its baseline growth (\CagrAiAcceleratorsCagrBaseline), and its references go to deep-learning architectures (\SysflowAiAcceleratorsPostToDeepLearningArchitecturesShare\%) and computer architecture (\SysflowAiAcceleratorsPostToComputerArchitectureShare\%) in proportions that did not change between periods. Whatever occurred in AI hardware after 2022 is not visible as a surge in this category's volume or as a reorientation of its citations. | ||||
| 65 | + | ||||
| 66 | +\section{Operating systems and distributed systems} | ||||
| 67 | +\label{sec:p6-os} | ||||
| 68 | + | ||||
| 69 | +\subsection{Operating systems: memory abstractions for accelerators} | ||||
| 70 | +\label{sec:p6-os-os} | ||||
| 71 | + | ||||
| 72 | +Operating systems is the smallest of the eleven categories (\CagrOperatingSystemsNTwoZeroTwoFive{} primary works in 2025) and the one that contracted fastest before the window (\CagrOperatingSystemsCagrBaseline{} per year), recovering at \CagrOperatingSystemsCagrPost{} per year in 2023--2025 while its share of computer science continued to fall. Its baseline landmarks are what one would expect of the late 2010s: customisable trusted execution environments on RISC-V in Keystone \citep{lee2020keystone}, sub-millisecond serverless runtimes for interactive microservices in Nightcore \citep{jia2021nightcore}, the Berkeley position paper on serverless computing \citep[preprint]{jonas2019serverless}, and key-value stores for persistent memory. Unikernels \citep{madhavapeddy2013unikernels,kuenzer2021unikraft} and kernel-bypass or in-kernel packet processing with XDP and eBPF \citep{hoiland2018xdp,vieira2020ebpf} belong to the same lineage and are cited by the corpus, though they do not reach the landmark threshold. | ||||
| 73 | + | ||||
| 74 | +The post-period landmarks are of a different kind. PowerInfer \citep{song2024powerinfer}, an SOSP paper, observes that neuron activations in large models follow a power-law distribution, keeps the consistently active ``hot'' neurons on a consumer GPU and computes the input-dependent ``cold'' ones on the CPU, with predictors and sparse operators to bridge the two. Orion \citep{strati2024orion} intercepts the kernel launches of several clients sharing a GPU and schedules them at the granularity of individual operators so as to limit interference at the scale of tens of microseconds. vAttention \citep{prabhu2025vattention} contests the memory abstraction of vLLM \citep{kwon2023vllm}: where PagedAttention allocates the key--value cache on demand in non-contiguous pages, inspired by virtual memory and paging, vAttention argues that the loss of contiguity imposes programming and performance overheads and restores a contiguous virtual layout through CUDA virtual-memory primitives. This is a live design controversy, and the corpus offers no way to adjudicate it: each system is evaluated by its authors on particular GPU generations and traces, and no neutral, versioned serving benchmark exists. What the abstracts establish is narrower and more interesting: the operating-systems problem of 2023--2025, as the field's most cited work defines it, is the management of accelerator memory and accelerator time for one workload, and the classical concerns of the baseline years---isolation, serverless latency, persistent memory---no longer appear at the top of the category. The citation flows agree: operating-systems works now send more references to computer architecture (\SysflowOperatingSystemsPostToComputerArchitectureShare\%) than to their own category (\SysflowOperatingSystemsPostToOperatingSystemsShare\%). | ||||
| 75 | + | ||||
| 76 | +Two further items qualify the picture. The ``LLM as operating system'' proposals that the bibliography records \citep[all preprints]{packer2023memgpt,ge2023llmos,mei2024aios} treat context management and tool scheduling for language-model agents as an operating-systems problem by analogy; they are position statements, not systems in the sense of the papers above, and none reaches the landmark list. The standardisation of the BPF instruction set as an IETF RFC \citep{ietf2024rfc9669} in 2024, together with an in-kernel aggregation preprint whose record is misdated in the corpus, suggests that kernel-extension technology remained an infrastructure theme of the period; the evidence is one RFC and one abstract, and the suggestion is recorded as such. | ||||
| 77 | + | ||||
| 78 | +\subsection{Distributed computing: a canon cited, not renewed} | ||||
| 79 | +\label{sec:p6-os-dist} | ||||
| 80 | + | ||||
| 81 | +The distributed-computing landmark list is dominated by what the field cites rather than by what it produced: re-dated records of MapReduce \citep{dean2008mapreduce}, Lamport's logical clocks and the Byzantine generals problem head the baseline, and the canon that the bibliography documents---Paxos \citep{lamport1998paxos}, practical Byzantine fault tolerance \citep{castro2002pbft}, the CAP formulation \citep{gilbert2002cap}, Spanner \citep{corbett2013spanner}, Spark \citep{zaharia2016spark}, Borg and Kubernetes \citep{verma2015borg,burns2016kubernetes}---is present in the references of the period without any post-2022 work of comparable standing in consensus, transactions or fault tolerance reaching the list. The growth topic of the baseline years was blockchain: a blockchain survey appears twice under distinct OpenAlex identifiers, the selfish-mining paper ``Majority is not enough'' and a consensus pre-processing method are among the most cited, and in the post years distributed-computing works still send \SysflowDistributedComputingPostToBlockchainShare\% of their references to the blockchain category. The category's trend change at December 2022 is among the largest of the eleven (\ItsSeriesCatDistributedComputingItsChatgptSlopeChange{} per month) and its output recovered at \CagrDistributedComputingCagrPost{} per year after declining at \CagrDistributedComputingCagrBaseline; two Bai--Perron breaks are selected, neither in the event month (Table~\ref{tab:systems_categories}). | ||||
| 82 | + | ||||
| 83 | +The post-period landmarks that survive scrutiny are three. vLLM \citep{kwon2023vllm}, classified here rather than under operating systems, reports that near-zero waste of key--value-cache memory and the sharing of cache blocks within and across requests raise throughput by two to four times at equal latency relative to the previous state of the art. OrbitalBrain proposes in-space distributed training on Earth-observation nanosatellites under bandwidth and power constraints, and a live race-bypassing system for deployed multithreaded applications appears as a 2026 repository record of older work. The first is the window's single most influential systems artefact in this area; the other two are indications of citation rather than landmarks. Federated learning, which the taxonomy treats as a category of its own but which is a distributed-systems topic in its mechanics \citep{mcmahan2017fl,kairouz2021fl,li2020flchallenges}, appears in the systems lists only through surveys, discussed in Section~\ref{sec:p6-sustain}. The conclusion for distributed computing is therefore negative in a precise sense: the corpus records no renewal of the field's theoretical or protocol canon in 2023--2026, and records its most cited new work as an inference-serving system whose intellectual home is the operating-systems tradition of memory management. | ||||
| 84 | + | ||||
| 85 | +\section{Cloud and edge computing} | ||||
| 86 | +\label{sec:p6-cloud} | ||||
| 87 | + | ||||
| 88 | +\subsection{Cloud computing: the same problem, a new workload} | ||||
| 89 | +\label{sec:p6-cloud-cloud} | ||||
| 90 | + | ||||
| 91 | +Cloud computing's baseline landmarks are scheduling and placement papers---virtual-machine allocation with usage prediction, QoS-aware scheduling for energy conservation, metaheuristic task scheduling---together with surveys of data-centre energy efficiency and of IoT--cloud integration. The post-period landmarks keep the problem and change the workload. The review of deep-reinforcement-learning methods for cloud resource scheduling by \citet{zhou2024drlcloud} is the bridge; the 2026 slice consists almost entirely of scheduling for large-language-model inference: token-level pooling and slicing of GPUs for co-located models, contextual-bandit elastic scheduling for serverless multi-tenant inference \citep{li2026deepservecb}, and carbon-aware prompt scheduling, whose abstract reports, in trace-driven simulation, a reduction of 26.8\% in carbon per thousand generated tokens relative to round-robin routing \citep{liao2026caps}. These 2026 records are provisional landmarks in the sense of Section~\ref{sec:p6-scope}, they appear in smaller IEEE conferences, and each is evaluated in simulation or on a single testbed; they are cited here not as results but as evidence of what the cloud-computing literature of 2026 is about. The one post-period landmark with an operations rather than a scheduling focus is RCACopilot \citep{chen2024rcacopilot}, a EuroSys paper that matches cloud incidents to handlers, aggregates runtime diagnostics and uses a language model to predict the root-cause category and produce an explanatory narrative; the abstract reports accuracy up to 0.766 on a year of incidents from one provider, a proprietary evaluation that no public benchmark allows to be reproduced. | ||||
| 92 | + | ||||
| 93 | +The corpus statistics for cloud computing are distinctive in one respect. Its level change at December 2022 is the clearest null of the eleven (\ItsSeriesCatCloudComputingItsChatgptLevelChange, $p = \ItsSeriesCatCloudComputingItsChatgptLevelP$), its trend change is \ItsSeriesCatCloudComputingItsChatgptSlopeChange{} per month, and it is the only systems category for which the Bayesian information criterion selects a Bai--Perron break in the month of the ChatGPT release, with a second break two years later. The placebo result (\ItsSeriesCatCloudComputingPlaceboChatgptSlopeTPlaceboP) does not permit the coincidence to be read as specific, and the category's output had been contracting at \CagrCloudComputingCagrBaseline{} per year before recovering at \CagrCloudComputingCagrPost. The serverless agenda of the baseline \citep{jonas2019serverless} survives in the 2026 papers as the deployment model for inference; what the landmark set does not contain is any post-2022 work on the cloud's own abstractions---storage, consistency, multi-tenancy---of the standing of the Borg or Spanner papers. | ||||
| 94 | + | ||||
| 95 | +\subsection{Edge computing: a change of subject without a change of output} | ||||
| 96 | +\label{sec:p6-cloud-edge} | ||||
| 97 | + | ||||
| 98 | +Edge computing offers the sharpest contrast between what is cited and what is produced. Its baseline landmarks are the blockchain--IoT integration papers of 2018--2019, the \emph{Edge Intelligence} survey of \citet{zhou2019edgeintelligence}, and a cluster of COVID-era reviews of IoT applications that the classifier assigns to the category; the lineage runs from the definitions of \citet{shi2016edge} and \citet{satyanarayanan2017edge} through the edge-intelligence surveys \citep{deng2020edgeintelligence} to the 6G framing of edge AI \citep{letaief2022edgeai6g}. The post-period landmarks are surveys and visions about language models at the edge: mobile edge intelligence for LLMs, which positions the mobile network edge between on-device and cloud inference on grounds of privacy, latency and bandwidth \citep{qu2025meillm}; edge general intelligence with agentic AI, which proposes that distributed edge entities become autonomous agents with perception--reasoning--action loops \citep{zhang2026edgegeneral}; edge--cloud collaborative computing on distributed intelligence and model optimisation \citep{liu2026eccc}; and AI Flow, a device--edge--cloud framework for large models \citep{an2026aiflow}. The abstracts describe architectures, taxonomies and challenges; none reports a measured deployment, and the empirical question of where inference should sit on the device--edge--cloud continuum under energy, latency and privacy constraints is open. | ||||
| 99 | + | ||||
| 100 | +Against this change of subject, the category's time series barely moved. Edge computing has the smallest trend change at December 2022 of the eleven (\ItsSeriesCatEdgeComputingItsChatgptSlopeChange{} per month, $p = \ItsSeriesCatEdgeComputingItsChatgptSlopeP$), after a baseline growth of \CagrEdgeComputingCagrBaseline{} per year that had already raised its share from \CagrEdgeComputingShareTwoZeroOneEight{} to \CagrEdgeComputingShareTwoZeroTwoTwo{} by 2022; its post-period growth (\CagrEdgeComputingCagrPost) is lower than its baseline growth, its single selected break falls in 2025, and its references go to computer networks (\SysflowEdgeComputingPostToComputerNetworksShare\%) more than to itself (\SysflowEdgeComputingPostToEdgeComputingShare\%) in both periods. The LLM-at-the-edge literature is, on this evidence, a change in what the field writes surveys about, not a measurable change in its volume or its citation neighbourhood. | ||||
| 101 | + | ||||
| 102 | +\section{Computer networks} | ||||
| 103 | +\label{sec:p6-networks} | ||||
| 104 | + | ||||
| 105 | +Computer networks is the largest systems category and the one whose relative weight fell most, from \CagrComputerNetworksShareTwoZeroOneEight{} of primary output in 2018 to \CagrComputerNetworksShareTwoZeroTwoFive{} in 2025, with absolute output contracting at \CagrComputerNetworksCagrBaseline{} per year before 2022 and growing at \CagrComputerNetworksCagrPost{} after. It is also the category whose structural-change statistics are least compatible with a post-2022 event: its level change at December 2022 is positive (\ItsSeriesCatComputerNetworksItsChatgptLevelChange, $p = \ItsSeriesCatComputerNetworksItsChatgptLevelP$) but with a placebo $p$-value of \ItsSeriesCatComputerNetworksPlaceboChatgptLevelTPlaceboP, its trend change (\ItsSeriesCatComputerNetworksItsChatgptSlopeChange) is the smallest after edge computing, and its single selected Bai--Perron break precedes the event month (Table~\ref{tab:systems_categories}). The series was rising before ChatGPT. | ||||
| 106 | + | ||||
| 107 | +The most cited works of the period are overviews that set the agenda of the sixth generation of mobile systems: the 6G roadmap of \citet{wang2023road6g}, which surveys requirements, scenarios and testbeds while noting that the ITU-R vision was still under discussion, and the integrated sensing and communications overview of \citet{liu2022isac}, which treats the perceptive radio access network as a defining feature of 6G; both coincide with or precede the start of the window and continue the programme of \citet{dang2020sixg}. Machine learning had entered networking research well before the window, as the surveys of deep learning for IoT analytics and for mobile and wireless networking show \citep{zhang2019dlwireless}, and the programmable-network lineage of OpenFlow, P4 and in-network computation \citep{mckeown2008openflow,bosshart2014p4,kreutz2015sdn,hauser2023p4survey,sapio2021switchml} is cited throughout. What the 2026 landmarks add is a vocabulary: tutorials on large AI models and agentic AI for intelligent communications \citep{jiang2026lamagentic}, a review of energy, scalability, data and security in massive IoT \citep{cheikh2026massiveiot}, the edge-general-intelligence survey already cited, and a tutorial on pinching-antenna systems that belongs to the physical layer. The abstracts of the agentic-AI tutorials describe design principles and taxonomies; their empirical content cannot be assessed from abstracts, and they are provisional landmarks by the criterion of Section~\ref{sec:p6-scope}. The networks category also receives the references of edge computing and sustainable computing in larger proportion than those categories' own works, so that part of what the taxonomy records as networking output is infrastructure work that other communities cite. The established conclusion is modest: the field's agenda in 2023--2026 was 6G, and the arrival of large models is visible in its surveys rather than in its output or its citation structure. | ||||
| 108 | + | ||||
| 109 | +\section{Database systems and information retrieval} | ||||
| 110 | +\label{sec:p6-data} | ||||
| 111 | + | ||||
| 112 | +\subsection{Database systems: data for learning, and vector search} | ||||
| 113 | +\label{sec:p6-data-db} | ||||
| 114 | + | ||||
| 115 | +The database landmark list is the most contaminated by misclassification of the eleven, and what remains after exclusion is small but instructive. The baseline anchors are BLOCKBENCH, a data-processing view of private blockchains with a benchmarking framework \citep{dinh2018blockbench}, the documentation standard \emph{Datasheets for datasets} \citep{gebru2021datasheets}, and the GPU similarity-search paper that underlies the Faiss library \citep{johnson2021faiss}. The post-period landmarks are three: \emph{The Faiss Library} \citep{douze2026faiss}, whose abstract frames vector similarity search as the core functionality of vector databases and describes the library's indexing, compression and benchmarking principles; the data-centric AI survey of \citet{zha2025datacentric}, organised around training-data development, inference-data development and data maintenance; and an empirical study of the effect of six data-quality dimensions on nineteen machine-learning algorithms under polluted training and test data \citep{mohammed2025dataquality}. Database systems' trend change at December 2022 (\ItsSeriesCatDatabaseSystemsItsChatgptSlopeChange{} per month) and its single Bai--Perron break in late 2023 are unremarkable among the systems categories; its output contracted at \CagrDatabaseSystemsCagrBaseline{} per year before 2022 and grew at \CagrDatabaseSystemsCagrPost{} after, and its references go to machine-learning theory, natural language processing and computer vision in proportions that the two periods share. | ||||
| 116 | + | ||||
| 117 | +Two readings are consistent with this record and the corpus cannot separate them. The first is that the database community's most cited work of the period concerns the data that feed machine learning---its quality, documentation and maintenance---and the retrieval of embeddings, rather than transaction processing or query optimisation; this is what the metadata show. The second is that the engine-level work of the period is simply not cited enough within thirty-six months to reach a list ranked by short-window citations, which favours surveys. The bibliography records the community's own positions on both points: the vector-database surveys \citep{pan2024vectordb,taipalus2024vectordb} and the preprint of \citet{han2023vectordb}, the hierarchical navigable small-world index that most vector systems implement \citep{malkov2020hnsw}, the programme of machine learning for database internals \citep{li2021ai4db}, the assessment of large language models for data management by \citet{fernandez2023llmdata}, and the argument of \citet{stonebraker2024goesaround} that specialised vector stores will be absorbed by extended relational engines as earlier specialised systems were. Whether vector search belongs in dedicated systems or in extended relational engines is the contested question of the period, and it is untested at workload level: the landmark set contains library-level evidence and surveys, not comparisons of dedicated and extended systems under mixed structured and approximate-nearest-neighbour queries. | ||||
| 118 | + | ||||
| 119 | +\subsection{Information retrieval: from graph recommendation to retrieval augmentation} | ||||
| 120 | +\label{sec:p6-data-ir} | ||||
| 121 | + | ||||
| 122 | +Information retrieval shows the clearest change in what is cited of any systems category. The baseline landmarks are graph-neural-network recommendation and its surveys: neural graph collaborative filtering, knowledge-graph attention networks, graph neural networks for social recommendation, self-supervised graph learning, and LightGCN \citep{he2020lightgcn}, whose abstract reports that the feature transformation and non-linear activation inherited from graph classification contribute little to collaborative filtering and can degrade it; the surveys of \citet{wu2023gnnrec} and \citet{gao2023gnnrecsurvey} close the baseline. The post-period landmarks are retrieval-augmented generation and language models for recommendation: the survey of retrieval-augmented large language models of \citet{fan2024ragsurvey}, the \emph{ACM Computing Surveys} review of \citet{huang2026ragsurvey}, which organises the paradigm into pre-retrieval, retrieval, post-retrieval and generation stages, the survey of retrieval augmentation for generated content across modalities \citep{zhao2026ragaigc}, the surveys of recommender systems in the era of large language models \citep{zhao2024recsysllm,wu2024llmrec}, and C-Pack \citep{xiao2024cpack}, which releases a training corpus, a Chinese embedding benchmark and the BGE family of embedding models whose abstract reports state-of-the-art results on the English MTEB benchmark as well. | ||||
| 123 | + | ||||
| 124 | +The methodological lineage of this literature is continuous with 2020: dense passage retrieval \citep{karpukhin2020dpr}, retrieval-augmented generation itself \citep[preprint]{lewis2020rag}, late interaction in ColBERT \citep{khattab2020colbert}, and the probabilistic framework that these replaced \citep{robertson2009bm25}; the dense-retrieval survey of \citet{zhao2024denseretrieval} and the preprint survey of language models for information retrieval \citep{zhu2023llmir} document the transition, as does the preprint RAG survey of \citet{gao2023ragsurvey}. What is notable is that the landmark set contains no new retrieval architecture of 2023--2026 and consists, for the post period, of surveys and one resource. This may reflect the citation lag of recent model papers as much as the field's output, and the review records it as speculative. The corpus statistics are the strongest of the systems group: information retrieval has the largest trend change at December 2022 (\ItsSeriesCatInformationRetrievalItsChatgptSlopeChange{} per month), a negative level change (\ItsSeriesCatInformationRetrievalItsChatgptLevelChange, $p = \ItsSeriesCatInformationRetrievalItsChatgptLevelP$), two selected Bai--Perron breaks, output growth of \CagrInformationRetrievalCagrPost{} per year after a flat baseline (\CagrInformationRetrievalCagrBaseline), and it is the only systems category whose references to the large-language-model category become measurable, at \SysflowInformationRetrievalPostToLlmShare\% of post-period references against \SysflowInformationRetrievalBaselineToLlmShare\% before. Its self-share of references nevertheless remained at \SysflowInformationRetrievalPostToInformationRetrievalShare\%, and natural language processing remained its second destination (\SysflowInformationRetrievalPostToNlpShare\%). The placebo $p$-value for the trend (\ItsSeriesCatInformationRetrievalPlaceboChatgptSlopeTPlaceboP) forbids attributing the acceleration to the event date, and the open problem that the literature itself states is evaluative: no agreed protocol separates the contribution of retrieval quality from that of parametric memory and of generation in retrieval-augmented systems. | ||||
| 125 | + | ||||
| 126 | +\section{Quantum computing} | ||||
| 127 | +\label{sec:p6-quantum} | ||||
| 128 | + | ||||
| 129 | +Quantum computing is the systems category least connected to the others: \SysflowQuantumComputingPostToQuantumComputingShare\% of its post-period references go to works of its own category, applied cryptography being the next destination at \SysflowQuantumComputingPostToAppliedCryptographyShare\%. It is also the fastest-growing after 2022 (\CagrQuantumComputingCagrPost{} per year, after \CagrQuantumComputingCagrBaseline{} in the baseline), the only systems category whose share of computer-science output rose throughout (\CagrQuantumComputingShareTwoZeroOneEight{} to \CagrQuantumComputingShareTwoZeroTwoFive), and one whose level fell at December 2022 (\ItsSeriesCatQuantumComputingItsChatgptLevelChange, $p = \ItsSeriesCatQuantumComputingItsChatgptLevelP$). Its two selected Bai--Perron breaks fall at the beginning of 2022 and in the spring of 2025 (Table~\ref{tab:systems_categories}). These are the statistics of a field growing on its own momentum, and the landmark list explains why: the window contains a coherent experimental sequence that has no connection with language models. | ||||
| 130 | + | ||||
| 131 | +The baseline anchors are Preskill's framing of the noisy intermediate-scale era \citep{preskill2018nisq}, the supremacy experiment on a 53-qubit programmable superconducting processor \citep{arute2019supremacy}, the photonic advantage experiment, and the reviews of NISQ algorithms and variational methods \citep{bharti2022nisq,cerezo2021vqa}. The post-period landmarks are the error-correction milestones. \citet{googlequantum2023suppressing} report that a distance-5 surface-code logical qubit modestly outperforms an ensemble of distance-3 qubits, the first demonstration that adding physical qubits improves logical performance on that platform; \citet{bluvstein2024logical} report a programmable logical processor on reconfigurable neutral-atom arrays with up to 280 physical qubits, a zoned architecture and mid-circuit readout; and \citet{googlequantum2025belowthreshold} report two below-threshold surface-code memories on the Willow processor, a distance-7 code whose logical error rate is suppressed by a factor of $\Lambda = 2.14$ per increase of two in code distance, with a real-time decoder, and a logical memory beyond break-even. The figures are those of the abstracts and the articles are peer-reviewed. Two 2025 demonstrations extend the sequence to modular architectures: distributed quantum computation between two trapped-ion modules about two metres apart by deterministic gate teleportation over an optical link \citep{main2025distributedqc}, and Aurora, a 35-chip photonic machine networked over fibre that its authors describe as a sub-performant scale model demonstrating the integration of all primitive components \citep{aghaee2025aurora}. These are feasibility demonstrations; the rates and fidelities required for error correction across modules are not reported in the abstracts. | ||||
| 132 | + | ||||
| 133 | +The contested claim of the period is utility before fault tolerance. \citet{kim2023utility} report, on a 127-qubit processor, accurate expectation values for circuit volumes beyond brute-force classical computation and argue that this is evidence of utility in the pre-fault-tolerant era. The abstract restricts the claim to brute-force simulation. The classical-simulation responses that followed, which reproduced the reported quantities with tensor-network and related methods, are not in the landmark set and are not in the verified bibliography, and they are therefore not cited; the claim is recorded as contested, and the open problem is methodological---utility experiments need independently committed classical baselines fixed before publication, because the classical frontier moves after it. On the algorithmic side, the review of barren plateaus in variational quantum computing \citep{larocca2025barren}, for which the corpus holds no abstract, and quantum-selected configuration interaction \citep{kanno2026qsci}, which samples electron configurations on a noisy device and diagonalises the Hamiltonian classically in the selected subspace, represent the two responses to the trainability problem of variational algorithms: characterise the obstacle, or move the optimisation to the classical side. The software and vendor records---the Qiskit design paper \citep[preprint]{javadiabhari2024qiskit} and a retrospective of IBM's processors and industry applications \citep{abughanem2025ibmquantum}---complete a list in which, as the bibliography anticipates for Part~X, the post-quantum standards of 2024 \citep{nist2024fips203} and the lattice foundations \citep{regev2009lwe,shor1997factoring} are the only links to the rest of computer science. | ||||
| 134 | + | ||||
| 135 | +\section{Sustainable computing} | ||||
| 136 | +\label{sec:p6-sustain} | ||||
| 137 | + | ||||
| 138 | +Sustainable computing is small (\CagrSustainableComputingNTwoZeroTwoFive{} primary works in 2025), grew at \CagrSustainableComputingCagrPost{} per year after 2022 against \CagrSustainableComputingCagrBaseline{} before, has a positive level change at December 2022 (\ItsSeriesCatSustainableComputingItsChatgptLevelChange, $p = \ItsSeriesCatSustainableComputingItsChatgptLevelP$; placebo $p = \ItsSeriesCatSustainableComputingPlaceboChatgptLevelTPlaceboP$) and cites computer networks (\SysflowSustainableComputingPostToComputerNetworksShare\%) and cloud computing (\SysflowSustainableComputingPostToCloudComputingShare\%) more than or as much as itself (\SysflowSustainableComputingPostToSustainableComputingShare\%). Its baseline landmarks concern ICT for the sustainable development goals and data-centre traffic models; the lineage that the bibliography documents is the measurement of machine learning's footprint---the energy of training natural-language models \citep{strubell2019energy}, the green-AI argument \citep{schwartz2020greenai}, the carbon-tracking tools of \citet{henderson2020carbon}, the global data-centre energy accounting of \citet{masanet2020datacenters}---and the post-period landmarks continue it with a notable share of preprints and workshop papers. | ||||
| 139 | + | ||||
| 140 | +The measurement literature proceeds in three steps. Training: \citet{patterson2021carbon}, in a preprint, estimate the energy and CO$_2$-equivalent of T5, Meena, GShard, Switch Transformer and GPT-3 and report that sparsely activated models, data-centre location and hardware choice change emissions by large factors; \citet{luccioni2023bloom}, in a preprint, estimate BLOOM's training at 24.7 tonnes of CO$_2$-equivalent for dynamic consumption and 50.5 tonnes over the life cycle, and extend the accounting to inference through an API; \citet{dodge2022carbonintensity} argue that cloud providers should expose software carbon intensity to users. Inference and water: \citet{chien2023carbongenai} model generative-AI inference as a workload and compare request-direction policies for carbon; \citet{li2023thirsty}, first as a preprint and then in \emph{Communications of the ACM} \citep{li2025thirsty}, bring the water footprint of training and serving into the accounting, with projections of global withdrawal that are the authors' estimates; the reviews of green AI \citep{boloncanedo2024greenai} and green federated learning \citep{thakur2025greenfl} and the related argument of \citet{wu2022sustainableai}, a preprint, organise the mitigation side. Systems and policy: \citet{luccioni2024powerhungry} measure the energy of inference by task at the level of deployed models; \citet{luccioni2025jevons} argue that efficiency gains may raise total consumption through rebound effects and that life-cycle assessment must be joined to socio-economic analysis; \citet{devriesgao2026datacenters}, continuing \citet{devries2023energy}, document that operators' environmental disclosures do not separate AI from other workloads, so that AI's carbon and water footprints can only be approximated from aggregate data-centre metrics; \citet{chen2026aielectricity} review the electricity demand of AI data centres and its interaction with power-system planning, and \citet{kumar2026sustainabledc} review the infrastructures and energy-management options of sustainable data-centre operation; and TokenPowerBench \citep{niu2026tokenpowerbench} provides a benchmark that attributes inference energy to the prefill and decode phases of each request. The latter's abstract quotes industry reports to the effect that inference accounts for more than ninety per cent of total power; such figures recur across this literature and cannot be verified from the corpus. The field's own diagnosis is the open problem: fleet-scale footprints are modelled rather than measured because the data are not disclosed, and the rebound hypothesis has not been tested. | ||||
| 141 | + | ||||
| 142 | +\section{Synthesis} | ||||
| 143 | +\label{sec:p6-synthesis} | ||||
| 144 | + | ||||
| 145 | +Three statements are established by the corpus. The systems categories accelerated after 2022 as a group, and the acceleration is not specific to the ChatGPT date: every placebo test fails to single it out, and the break dates selected by the Bayesian information criterion are scattered across three years. The classical systems categories had been declining in absolute and relative terms since 2018 and recovered in absolute terms only; their share of computer science continued to fall, and reversion is a competing explanation of the recovery that this corpus cannot exclude. The citation flows among systems categories were stable between the two periods; the only measurable new destination is the references of information retrieval to the large-language-model category. | ||||
| 146 | + | ||||
| 147 | +Two statements are established by the metadata of the most cited works, and they must be read with the caveat that short citation windows favour surveys and that roughly one landmark record in five is misclassified. The most cited post-2022 works in computer architecture, operating systems, distributed computing and cloud computing are systems for training and serving large language models---graph compilation, phase splitting, key--value-cache management, GPU sharing, consumer-GPU inference, inference scheduling---and the most cited works in information retrieval, edge computing and networking are surveys and tutorials about language models. Quantum computing and sustainable computing follow their own trajectories, the former an experimental programme in error correction and modular architectures, the latter a measurement literature on the footprint of machine learning in which several foundational items are preprints. | ||||
| 148 | + | ||||
| 149 | +What cannot be established from this evidence is also to be stated. Whether research on language-model infrastructure explains the volume recovery of the classical categories is unknown, because the share of that research in each category's output is not measured here; a topic-level decomposition is the test. Whether any of the systems designs reviewed---paged or contiguous caches, phase-split or co-located serving, hot--cold partitioning---is superior to its competitors is unknown, because each is evaluated by its own authors on its own hardware. Whether photonic and neuromorphic efficiency figures hold at system level is unknown, because no abstract reports end-to-end energy under a shared benchmark. Whether pre-fault-tolerant quantum processors deliver utility is contested and moves with the classical frontier. These, together with the evaluation of retrieval augmentation, the placement of inference on the device--edge--cloud continuum, the disclosure of AI's energy and water use, and the validation of the taxonomy's systems categories against venue streams, are carried forward to Part~X. | ||||
modified
manuscript/sections/part09_results.tex
+288 −4
@@ -574,10 +574,10 @@ and whose self-share does not fall in the post period. The off-diagonal structur | |||||
| 574 | centred on two areas: every area sends a larger share of its references to AI and Machine Learning in the | 574 | centred on two areas: every area sends a larger share of its references to AI and Machine Learning in the | ||
| 575 | post span than in the baseline (by between one and two and a half points for the systems, security, | 575 | post span than in the baseline (by between one and two and a half points for the systems, security, | ||
| 576 | software, theory and computational-science areas), and the AI area itself sends a larger share to | 576 | software, theory and computational-science areas), and the AI area itself sends a larger share to | ||
| 577 | −Perception, Language, Robotics and Interaction and a smaller share to itself. The largest single movement in | 577 | +Perception, Language, Robotics and Interaction and a smaller share to itself. The largest movements in the | ||
| 578 | −the table is the fall of the AI area's self-share, matched by a rise of its references to the vision and | 578 | +table are the falls of the self-shares of the AI, Data, Software and Security areas, each of about three | ||
| 579 | −language categories; the second is the rise of references from Data, Information and Distributed Systems | 579 | +points, matched by rises of their references to the AI area and, for the AI area itself, to the vision and | ||
| 580 | −to Security, Privacy and Trust. The Hardware area is the exception that moves least: its row changes by less | 580 | +language categories. The Hardware area is the exception that moves least: its row changes by less | ||
| 581 | than a point in every cell. | 581 | than a point in every cell. | ||
| 582 | 582 | ||||
| 583 | \begin{figure}[htbp]\centering | 583 | \begin{figure}[htbp]\centering | ||
@@ -657,3 +657,287 @@ boundary rather than concentrated at it, so the hypothesis is supported as a sta | |||||
| 657 | relative to the baseline and not as a statement about a change at the reference date. The classifier | 657 | relative to the baseline and not as a statement about a change at the reference date. The classifier | ||
| 658 | caveat applies with full force: a change in how the classifier partitions the literature would produce the | 658 | caveat applies with full force: a change in how the classifier partitions the literature would produce the | ||
| 659 | same movements, and the semantic-level check of H4 is pending (Section~\ref{sec:r-rq5}). | 659 | same movements, and the semantic-level check of H4 is pending (Section~\ref{sec:r-rq5}). | ||
| 660 | + | ||||
| 661 | +\section{RQ5: foundation models and the boundaries between disciplines} | ||||
| 662 | +\label{sec:r-rq5} | ||||
| 663 | + | ||||
| 664 | +RQ5 asks whether the emergence of foundation models changed the relationship between previously distinct | ||||
| 665 | +computer-science disciplines. Three measurements bear on it: the citation flows of Section~\ref{sec:r-rq4}, | ||||
| 666 | +the co-classification of works across categories, and the semantic distances between category centroids in | ||||
| 667 | +the embedding space. The first was reported above; the second is reported here; the third depends on the | ||||
| 668 | +semantic atlas, which was not available when this part was written, and its subsections are reserved. | ||||
| 669 | + | ||||
| 670 | +\subsection{Co-classification} | ||||
| 671 | + | ||||
| 672 | +Table~\ref{tab:p9-cooccurrence} lists the fifteen most frequent pairs of categories carried jointly by a | ||||
| 673 | +work in its label set, for the baseline and post spans. The baseline list is dominated by pairs that | ||||
| 674 | +describe the standing structure of the field: Computer Vision with Deep Learning Architectures, Computer | ||||
| 675 | +Networks with Cybersecurity and with Edge Computing, Applied Cryptography with Cybersecurity, Computer | ||||
| 676 | +Architecture with Distributed Computing, Cloud with Distributed Computing. Large Language Models with | ||||
| 677 | +Natural Language Processing is the third pair of the baseline list, which is a reminder that the category | ||||
| 678 | +is defined by a vocabulary (language models, pre-training, transformers) that predates ChatGPT by several | ||||
| 679 | +years. The post-period list keeps the vision and networking pairs at the top but is otherwise reorganised | ||||
| 680 | +around the generative-model categories: Large Language Models with Natural Language Processing moves to | ||||
| 681 | +second place with more than twice its baseline count; Computer Vision pairs with Foundation Models, with | ||||
| 682 | +Multimodal AI and with Generative AI; Deep Learning Architectures pairs with Foundation Models and with | ||||
| 683 | +Natural Language Processing; and Foundation Models with Large Language Models enters the list. Six of the | ||||
| 684 | +fifteen post-period pairs involve a category that did not appear in any baseline pair. | ||||
| 685 | + | ||||
| 686 | +\input{tables/tab_p9_cooccurrence} | ||||
| 687 | + | ||||
| 688 | +Table~\ref{tab:p9-llm-partners} looks at the same phenomenon from the side of the Large Language Models | ||||
| 689 | +category. Its partners in the post span are, after Natural Language Processing, Foundation Models, Deep | ||||
| 690 | +Learning Architectures, Computer Vision, Multimodal AI, Information Retrieval, Software Engineering, AI | ||||
| 691 | +Safety and Alignment, Machine Learning Theory, AI Agents, Generative AI, Cybersecurity and Human--Computer | ||||
| 692 | +Interaction; the ratio column shows that the pairings with Information Retrieval, Software Engineering, | ||||
| 693 | +Cybersecurity and Human--Computer Interaction, which are categories outside the AI area, grew by factors | ||||
| 694 | +comparable to or larger than the pairing with Natural Language Processing. These are the category-level | ||||
| 695 | +counterparts of the area flows of Section~\ref{sec:r-rq4}: works that carry the LLM label increasingly also | ||||
| 696 | +carry the label of an application or systems category, which is one mechanism by which the multi-label | ||||
| 697 | +series of those categories accelerated (Section~\ref{sec:r-its-categories}). The measurement is conditional | ||||
| 698 | +on the classifier in the strongest possible way, since co-classification is a property of the label set, and | ||||
| 699 | +on abstract availability, since a work without an abstract rarely carries more than one label; both rise in | ||||
| 700 | +the post period (Table~\ref{tab:p9-classification}), and part of the growth of every pair is attributable to | ||||
| 701 | +them. | ||||
| 702 | + | ||||
| 703 | +\input{tables/tab_p9_llm_partners} | ||||
| 704 | + | ||||
| 705 | +\subsection{Semantic distances between categories} | ||||
| 706 | +\label{sec:r-semantic} | ||||
| 707 | + | ||||
| 708 | +The protocol's semantic test of convergence compares the cosine similarity between category centroids in | ||||
| 709 | +the embedding space, estimated separately on baseline and post works, and reports the drift of each | ||||
| 710 | +category's centroid between the two periods (Section~\ref{sec:m-semantic}). The result files | ||||
| 711 | +\texttt{results/semantic/category\_similarity\_baseline.csv}, \texttt{category\_similarity\_post.csv} and | ||||
| 712 | +\texttt{category\_drift.csv} did not exist when this part was written. \pending{semantic atlas: insert the | ||||
| 713 | +category similarity comparison (baseline versus post, mean off-diagonal similarity, the pairs whose | ||||
| 714 | +similarity changed most) and the drift table when results/semantic/ is produced; the diversity indices of | ||||
| 715 | +Table~\ref{tab:diversity} are to be re-estimated with the semantic distance at the same time}. | ||||
| 716 | + | ||||
| 717 | +\subsection{Semantic clusters and their stability} | ||||
| 718 | + | ||||
| 719 | +The clustering of the embedded corpus into topics and the bootstrap stability of that clustering | ||||
| 720 | +(\texttt{results/semantic/clusters.csv}, \texttt{stability.json}) are likewise pending. \pending{semantic | ||||
| 721 | +atlas: number of clusters, share of works in noise, adjusted Rand index of the bootstrap replicates, and the | ||||
| 722 | +clusters that are new in the post period, from results/semantic/clusters.csv and stability.json}. | ||||
| 723 | + | ||||
| 724 | +\subsection{Reading of RQ5 on the available evidence} | ||||
| 725 | + | ||||
| 726 | +With two of the three measurements available, the answer to RQ5 is that the generative-model categories | ||||
| 727 | +have become the most connected part of the classification, both in what their works cite and in what other | ||||
| 728 | +labels their works carry, and that the areas of computer science that were most distinct from AI in the | ||||
| 729 | +baseline (systems, security, software, theory) now send a somewhat larger share of their references to it. | ||||
| 730 | +Whether this amounts to a change in the relationship between disciplines, or to the growth of one large | ||||
| 731 | +cross-cutting literature alongside disciplines that remain distinct, cannot be settled with citation and | ||||
| 732 | +label data: the self-shares of Table~\ref{tab:p9-area-flow-change} remain above three fifths in every area, | ||||
| 733 | +and the Perception area, the largest, is as self-contained in the post period as it was before. The | ||||
| 734 | +semantic measurement, when available, is the one that can discriminate between the two readings, because it | ||||
| 735 | +does not depend on the classifier's boundaries. | ||||
| 736 | + | ||||
| 737 | +\section{RQ6: institutions, countries and collaboration} | ||||
| 738 | +\label{sec:r-rq6} | ||||
| 739 | + | ||||
| 740 | +Part~VIII analyses the actor networks in full, and this section records the aggregate indicators that the | ||||
| 741 | +hypotheses require and the verdict on H6. The international co-authorship share, among works with at least | ||||
| 742 | +one resolved country, moves from \InternationalCollabYearlyTwoZeroOneEightShareIntl{} in 2018 to a maximum of | ||||
| 743 | +\InternationalCollabYearlyTwoZeroTwoZeroShareIntl{} in 2020 and declines in every subsequent year to | ||||
| 744 | +\InternationalCollabYearlyTwoZeroTwoFiveShareIntl{} in 2025 (Table~\ref{tab:collaboration}, | ||||
| 745 | +Figure~\ref{fig:collaboration}). The share of works with a company affiliation, among works with any typed | ||||
| 746 | +affiliation, rises from \IndustryShareYearlyTwoZeroOneEightShareCompany{} in 2018 to a maximum of | ||||
| 747 | +\IndustryShareYearlyTwoZeroTwoOneShareCompany{} in 2021 and falls to | ||||
| 748 | +\IndustryShareYearlyTwoZeroTwoFiveShareCompany{} in 2025 (Table~\ref{tab:industry}). The country shares with | ||||
| 749 | +fractional counting (Table~\ref{tab:country_shares}, Figure~\ref{fig:country_shares}) show the share of | ||||
| 750 | +China rising through the window and the share of the United States falling, under both counting | ||||
| 751 | +conventions, as the continuation of a baseline trend; the joint output of the two countries falls in | ||||
| 752 | +absolute terms in the post period while both grow (Table~\ref{tab:country_network}, | ||||
| 753 | +Section~\ref{sec:net-international}). The institutional hierarchy is stable: the institutions with the | ||||
| 754 | +largest post-period output are, with few exceptions, those with the largest baseline output | ||||
| 755 | +(Table~\ref{tab:top_institutions}), and the concentration of output across institutions does not increase | ||||
| 756 | +(Table~\ref{tab:institution_concentration}). | ||||
| 757 | + | ||||
| 758 | +\subsection{Hypothesis H6: geography and collaboration} | ||||
| 759 | +\label{sec:r-h6} | ||||
| 760 | + | ||||
| 761 | +H6 states that the share of works with industry affiliations and with China-affiliated authors rises in the | ||||
| 762 | +post period in AI categories, and that the international co-authorship share does not rise. The third clause | ||||
| 763 | +is \emph{supported}: the international share does not rise and in fact declines, with the composition | ||||
| 764 | +explanation that Part~VIII develops (the fastest-growing producers are the least internationalised). The | ||||
| 765 | +China clause is \emph{supported} in the aggregate, as a continuation of a trend that predates the boundary, | ||||
| 766 | +and \emph{inconclusive} for AI categories, because the category-specific country shares are not among the | ||||
| 767 | +result files (\pending{macro: China-affiliated share by category and period, results/bibliometrics}). The | ||||
| 768 | +industry clause is \emph{opposite} in the aggregate, where the company share peaks in 2021 and declines in | ||||
| 769 | +every post-period year, and \emph{inconclusive} for AI categories (\pending{macro: company-affiliated share by | ||||
| 770 | +category and period}). Two remarks qualify the opposite verdict. The company share is measured on works with | ||||
| 771 | +a typed affiliation, and the affiliation coverage of the corpus changes over the window | ||||
| 772 | +(Table~\ref{tab:collaboration}, last column), so a falling share can coexist with a rising count of | ||||
| 773 | +industry works; the count does rise (Table~\ref{tab:industry}). And the literature from which the | ||||
| 774 | +hypothesis was drawn measures industry participation at the frontier of machine learning research | ||||
| 775 | +\citep{ahmed2023industry}, whereas the corpus measures it over all of computer science, where the growth of | ||||
| 776 | +the post period is concentrated in categories and venues with low industry participation. | ||||
| 777 | + | ||||
| 778 | +\section{RQ7 and RQ8: breakthroughs, incremental gains and unresolved problems} | ||||
| 779 | +\label{sec:r-rq7} | ||||
| 780 | + | ||||
| 781 | +RQ7 asks which research areas demonstrate genuine breakthroughs versus incremental benchmark improvements, | ||||
| 782 | +and RQ8 which scientific problems remain unresolved despite rapid publication growth. Neither question has a | ||||
| 783 | +bibliometric answer, and the study does not pretend otherwise: the evidence for them is the knowledge-graph | ||||
| 784 | +extraction over the high-priority set (method, benchmark, dataset and claim nodes with provenance and | ||||
| 785 | +confidence, Section~\ref{sec:m-kg}) and the specialist reviews of Parts~V--VII, which are synthesised in | ||||
| 786 | +Part~X. At the time of writing the extraction had not produced result files that this part could tabulate, | ||||
| 787 | +and the specialist reviews were subject to checkpoint H-3. What the quantitative results of this part | ||||
| 788 | +contribute to the two questions is a set of constraints. The categories with the fastest post-period growth | ||||
| 789 | +(Section~\ref{sec:r-rq1}) and the strongest acceleration (Section~\ref{sec:r-its-categories}) are the ones in | ||||
| 790 | +which benchmark-driven incremental work is most plausible, because volume growth of this speed is not | ||||
| 791 | +compatible with a proportional growth in the number of distinct problems addressed; the categories whose | ||||
| 792 | +volume is flat but whose cross-area references to AI rise (Section~\ref{sec:r-rq4}) are the ones in which an | ||||
| 793 | +imported method is being applied to standing problems, which is where a breakthrough, if any, would register | ||||
| 794 | +as a change of method rather than of volume. The emerging-topic detector of Section~\ref{sec:r-rq10} provides | ||||
| 795 | +a third constraint: the topics it ranks highly are candidates for RQ7, and the topics with sustained volume | ||||
| 796 | +and declining citation acceleration are candidates for RQ8. These are hypotheses for Part~X, not findings | ||||
| 797 | +(\pending{H-3: knowledge-graph extraction counts by relation type, benchmark proliferation and method-adoption | ||||
| 798 | +series for the high-priority set, when produced}). | ||||
| 799 | + | ||||
| 800 | +\section{RQ9: openness, preprints and the evaluation of evidence} | ||||
| 801 | +\label{sec:r-rq9} | ||||
| 802 | + | ||||
| 803 | +Table~\ref{tab:p9-openness} assembles the openness indicators by publication year; Figure~\ref{fig:types-openness} | ||||
| 804 | +in Part~III shows the same series graphically. Three of them rise through the whole window and faster in the | ||||
| 805 | +post period. The share of eligible works linked to an arXiv e-print rises in every year, from | ||||
| 806 | +\VolumeYearlyTwoZeroOneEightNArxiv{} of \VolumeYearlyTwoZeroOneEightN{} works in 2018 to | ||||
| 807 | +\VolumeYearlyTwoZeroTwoFiveNArxiv{} of \VolumeYearlyTwoZeroTwoFiveN{} in 2025, roughly a doubling of the share | ||||
| 808 | +and a quadrupling of the count; the share of works whose surviving record is of preprint type rises more | ||||
| 809 | +steeply, because recent preprints have not yet been matched to a published version, and the 2026 value is | ||||
| 810 | +dominated by that effect. The open-access share rises from \VolumeYearlyTwoZeroOneEightNOa{} to | ||||
| 811 | +\VolumeYearlyTwoZeroTwoFiveNOa{} works, a rise in share of about twenty points over the window of which the | ||||
| 812 | +larger part occurs in the baseline; the abstract-availability share rises through 2024 and falls in 2025 | ||||
| 813 | +and 2026 for records not yet enriched. The DBLP-indexed share falls in the post period, as | ||||
| 814 | +Section~\ref{sec:r-rq1} noted, and the conference share of the corpus is flat or slightly declining, which | ||||
| 815 | +means that the growth of preprints is not matched by a growth of conference publication in the indexed | ||||
| 816 | +record. The number of references per work (last column) is a metadata-completeness indicator rather than | ||||
| 817 | +an openness one and is discussed in Section~\ref{sec:r-rq1}. | ||||
| 818 | + | ||||
| 819 | +\input{tables/tab_p9_openness} | ||||
| 820 | + | ||||
| 821 | +\subsection{Hypothesis H7: preprints and openness} | ||||
| 822 | +\label{sec:r-h7} | ||||
| 823 | + | ||||
| 824 | +H7 states that the share of works with an arXiv version and the share with linked code rise in the post | ||||
| 825 | +period. The arXiv clause is \emph{supported}: the share rises in every post-period year and the post-period | ||||
| 826 | +share is above the baseline share by a wide margin (Table~\ref{tab:p9-periods}), with the caveat that the | ||||
| 827 | +post-period arXiv share is inflated by preprints that will later be merged with a published version and by | ||||
| 828 | +the growth of OpenAlex's coverage of arXiv. The code clause is \emph{inconclusive}: the pipeline does not | ||||
| 829 | +extract code links, and no result file measures the share of works with a linked repository | ||||
| 830 | +(\pending{macro: share of works with a code link by year; not produced by the current pipeline, scoped in | ||||
| 831 | +Phase 3 of the plan}). The evaluation-standards part of RQ9, which asks how benchmarks and reporting | ||||
| 832 | +practices evolved, is likewise outside what the bibliographic record measures and is addressed from the | ||||
| 833 | +knowledge-graph extraction in Part~X when available. | ||||
| 834 | + | ||||
| 835 | +\section{RQ10: early detection of emerging topics} | ||||
| 836 | +\label{sec:r-rq10} | ||||
| 837 | + | ||||
| 838 | +\subsection{Out-of-time performance of the detectors} | ||||
| 839 | + | ||||
| 840 | +Table~\ref{tab:p9-emerging-setup} summarises the evaluation design implemented in | ||||
| 841 | +Section~\ref{sec:m-emerging}: OpenAlex topics as units, features computed at a cutoff from data at or before | ||||
| 842 | +it, a label defined by top-decile growth with doubling over the following twelve or twenty-four months, | ||||
| 843 | +training cutoffs that end before the reference date and test cutoffs in 2023--2024. At the twelve-month | ||||
| 844 | +horizon the pooled test set has \EmergNTest{} (topic, cutoff) rows with a positive rate of | ||||
| 845 | +\EmergPosRateTest{}, lower than the training rate of \EmergPosRateTrain{}; at twenty-four months the rates | ||||
| 846 | +are \EmergtwofourPosRateTest{} and \EmergtwofourPosRateTrain{}. The positive rate is below the ten per cent | ||||
| 847 | +that a decile label would give because of the doubling condition, and it is lower in the test period than in | ||||
| 848 | +training because the corpus as a whole grew faster in 2023--2026, so that doubling against the trailing | ||||
| 849 | +window became harder for an individual topic. | ||||
| 850 | + | ||||
| 851 | +\input{tables/tab_p9_emerging_setup} | ||||
| 852 | + | ||||
| 853 | +Tables~\ref{tab:emerging_h12} and~\ref{tab:emerging_h24} in Appendix~F give the pooled metrics, and | ||||
| 854 | +Figure~\ref{fig:emerging-metrics} displays them. At the twelve-month horizon the gradient boosting model | ||||
| 855 | +attains an AUC of \EmergGbmAuc{}, the $z$-score baseline \EmergZscoreBaselineAuc{} and the logistic model | ||||
| 856 | +\EmergLogisticAuc{}; precision at fifty is \EmergGbmPrecisionAtFiveZero{} for the boosted model and | ||||
| 857 | +\EmergZscoreBaselinePrecisionAtFiveZero{} for the baseline, against a chance level of about the positive | ||||
| 858 | +rate. At the twenty-four-month horizon the ordering reverses: the $z$-score baseline attains an AUC of | ||||
| 859 | +\EmergtwofourZscoreBaselineAuc{} and a precision at fifty of \EmergtwofourZscoreBaselinePrecisionAtFiveZero{}, | ||||
| 860 | +and both trained models fall below it (\EmergtwofourLogisticAuc{} and \EmergtwofourGbmAuc{}). The per-cutoff | ||||
| 861 | +values of Table~\ref{tab:p9-emerging-cutoffs} show that the pooled figures hide large variation: the | ||||
| 862 | +twelve-month AUC of the boosted model ranges over the eight test cutoffs from a little above six tenths to | ||||
| 863 | +near one, the near-perfect value belonging to the January 2024 cutoff, at which the baseline is also near | ||||
| 864 | +perfect and the logistic model near zero, a configuration that indicates a cutoff with very few positives | ||||
| 865 | +whose ranking is determined by one or two topics rather than a cutoff at which the models excel. Excluding | ||||
| 866 | +that cutoff, the boosted model exceeds the baseline at five of the seven remaining twelve-month cutoffs, | ||||
| 867 | +and the baseline exceeds both trained models at every twenty-four-month cutoff. | ||||
| 868 | + | ||||
| 869 | +\begin{figure}[htbp]\centering | ||||
| 870 | +\includegraphics[width=0.95\textwidth]{fig_emerging_metrics.pdf} | ||||
| 871 | +\caption{Out-of-time detection performance of the three detectors by horizon (AUC and precision at 20 and | ||||
| 872 | +50). Sources: \texttt{results/emerging/metrics\_h12.json}, \texttt{metrics\_h24.json}.} | ||||
| 873 | +\label{fig:emerging-metrics} | ||||
| 874 | +\end{figure} | ||||
| 875 | + | ||||
| 876 | +\input{tables/tab_p9_emerging_cutoffs} | ||||
| 877 | + | ||||
| 878 | +Three features of the design explain the pattern. The training set is small, with eight cutoffs at twelve | ||||
| 879 | +months and four at twenty-four, and the positives within it number in the dozens; a boosted model with three | ||||
| 880 | +hundred trees fitted to that many positives learns the idiosyncrasies of the 2020--2021 cutoffs, which the | ||||
| 881 | +reversal at twenty-four months, where training is smallest, bears out. The $z$-score is itself one of the | ||||
| 882 | +six features, so the trained models can at best refine a ranking that the baseline already provides, and at | ||||
| 883 | +the longer horizon the refinement overfits. And the label's doubling condition ties positives tightly to | ||||
| 884 | +recent abnormal growth, which is what the $z$-score measures, so that a longer horizon, over which abnormal | ||||
| 885 | +growth has more time to translate into doubling, favours the simplest signal. The logistic model's | ||||
| 886 | +performance below the baseline at both horizons, and below one half at some cutoffs, indicates that the | ||||
| 887 | +linear combination of standardised features is dominated by the size and age controls, which are | ||||
| 888 | +negatively associated with the label. | ||||
| 889 | + | ||||
| 890 | +\subsection{Hypothesis H8: detection} | ||||
| 891 | +\label{sec:r-h8} | ||||
| 892 | + | ||||
| 893 | +H8 states that the detector trained on cutoffs up to 2022 achieves an AUC above 0.70 and a precision at | ||||
| 894 | +fifty above 0.40 on test cutoffs in 2023--2024 against the baseline growth $z$-score rule, and that the | ||||
| 895 | +preregistered known-emergence set is detected with a median lead time of at least six months before each | ||||
| 896 | +topic's peak growth month. The first clause is \emph{not supported}. The best trained model's twelve-month | ||||
| 897 | +AUC, \EmergGbmAuc{}, is at the threshold to three decimals and marginally below it before rounding; its | ||||
| 898 | +precision at fifty is an order of magnitude below the threshold; and at twenty-four months the trained | ||||
| 899 | +models do not beat the baseline at all, so the comparison ``against the $z$-score rule'' is lost rather than | ||||
| 900 | +won. The AUC values say that the signals rank future emergers above non-emergers with a probability of about | ||||
| 901 | +seven in ten at twelve months and, through the baseline, of about eight in ten at twenty-four months, which | ||||
| 902 | +is informative; the precision values say that a list of fifty flagged topics at a given cutoff contains very | ||||
| 903 | +few of the topics that will double, which is the operationally relevant statement and the one the threshold | ||||
| 904 | +was set for. | ||||
| 905 | + | ||||
| 906 | +The second clause concerns the known-emergence set, and Section~\ref{sec:m-emerging} explains why it could | ||||
| 907 | +not be tested as written: the twelve developments do not map to OpenAlex topics, so the check actually run | ||||
| 908 | +applies the $z$-score rule to keyword series defined by regular expressions, and measures the lead of the | ||||
| 909 | +rule's first firing over the ex-post peak growth month. Figure~\ref{fig:known-set} shows the twelve series | ||||
| 910 | +with the first alarm, and Table~\ref{tab:known_set} the detection months, peak months and leads. The rule | ||||
| 911 | +fires for all \KnownSetNDetected{} concepts, with a positive lead for \KnownSetNPositiveLead{} of them and a | ||||
| 912 | +median lead of \KnownSetMedianLeadMonths{} months. The leads are longest for large language models | ||||
| 913 | +(\KnownLargeLanguageModelsLeadMonths{} months, with a detection in | ||||
| 914 | +\KnownLargeLanguageModelsDetectionMonth{} and a peak in \KnownLargeLanguageModelsPeakGrowthMonth{}) and for | ||||
| 915 | +reasoning models (\KnownReasoningModelsLeadMonths{} months, the regular expression for which includes | ||||
| 916 | +chain-of-thought prompting and therefore fires in \KnownReasoningModelsDetectionMonth{}, long before the | ||||
| 917 | +test-time-compute literature of 2024--2025 that gives the series its peak), and shortest for neural radiance | ||||
| 918 | +fields (\KnownNeuralRadianceFieldsLeadMonths{} months) and for mechanistic interpretability, whose lead is | ||||
| 919 | +negative (\KnownMechanisticInterpretabilityLeadMonths{} months): that series' fastest growth, in | ||||
| 920 | +\KnownMechanisticInterpretabilityPeakGrowthMonth{}, came from a base of a few works and the rule's volume | ||||
| 921 | +condition was not met until \KnownMechanisticInterpretabilityDetectionMonth{}. On the check as run, the | ||||
| 922 | +second clause is \emph{supported}: the median lead exceeds six months. The support is weak for three | ||||
| 923 | +reasons that the method section states and that bear repeating: the units are hand-written keyword series | ||||
| 924 | +rather than the detector's topics, the detector is the baseline rule rather than the trained model, and the | ||||
| 925 | +peak month is an ex-post quantity, so that a lead measured against it is not a lead that an observer could | ||||
| 926 | +have known at the time. The verdict on H8 as a whole is \emph{not supported} for the trained detector and | ||||
| 927 | +\emph{supported with reservations} for the lead-time clause on its substitute test. | ||||
| 928 | + | ||||
| 929 | +\begin{figure}[htbp]\centering | ||||
| 930 | +\includegraphics[width=0.95\textwidth]{fig_known_set.pdf} | ||||
| 931 | +\caption{Monthly keyword series for the twelve preregistered concepts with the $z$-score rule's first alarm. | ||||
| 932 | +Source: \texttt{results/emerging/known\_set\_monthly.csv}.} | ||||
| 933 | +\label{fig:known-set} | ||||
| 934 | +\end{figure} | ||||
| 935 | + | ||||
| 936 | +The scientific content of the exercise lies in what it rules out. A retrospective evaluation with a fixed | ||||
| 937 | +2026 topic vocabulary, a growth-only label and a handful of training cutoffs is the most favourable setting a | ||||
| 938 | +detector of this kind can be given short of look-ahead, and in it the trained models do not improve on a | ||||
| 939 | +one-line rule. Two of the mandate's seven candidate signals (semantic novelty, interdisciplinary connectivity) | ||||
| 940 | +and three others (methodological adoption, benchmark proliferation, open-source activity) are not in the | ||||
| 941 | +feature set (Section~\ref{sec:m-emerging}); the result is therefore a lower bound on what the full framework | ||||
| 942 | +could achieve, and an upper bound on what growth and citation signals alone achieve. \pending{H-4: whether | ||||
| 943 | +to describe the detector as a negative result for RQ10 or as a baseline for the semantic-cluster extension}. | ||||
modified
manuscript/tables/numbers.tex
+67 −69
@@ -4731,27 +4731,27 @@ | |||||
| 4731 | \newcommand{\ClassificationClassified}{9{,}083{,}974} | 4731 | \newcommand{\ClassificationClassified}{9{,}083{,}974} | ||
| 4732 | \newcommand{\ClassificationAssignments}{19{,}257{,}574} | 4732 | \newcommand{\ClassificationAssignments}{19{,}257{,}574} | ||
| 4733 | \newcommand{\ClassificationWhen}{2026-11-04T00:50:50.561726+00:00} | 4733 | \newcommand{\ClassificationWhen}{2026-11-04T00:50:50.561726+00:00} | ||
| 4734 | −\newcommand{\SelectionHighPriority}{13{,}414} | 4734 | +\newcommand{\SelectionHighPriority}{13{,}484} | ||
| 4735 | −\newcommand{\SelectionLandmarks}{1{,}093} | 4735 | +\newcommand{\SelectionLandmarks}{1{,}089} | ||
| 4736 | −\newcommand{\SelectionByAreaAiMl}{234} | 4736 | +\newcommand{\SelectionByAreaAiMl}{233} | ||
| 4737 | −\newcommand{\SelectionByAreaPerceptionInteraction}{207} | 4737 | +\newcommand{\SelectionByAreaPerceptionInteraction}{208} | ||
| 4738 | −\newcommand{\SelectionByAreaDataDistributed}{152} | 4738 | +\newcommand{\SelectionByAreaDataDistributed}{151} | ||
| 4739 | \newcommand{\SelectionByAreaSecurityPrivacy}{125} | 4739 | \newcommand{\SelectionByAreaSecurityPrivacy}{125} | ||
| 4740 | \newcommand{\SelectionByAreaHardwareEmerging}{125} | 4740 | \newcommand{\SelectionByAreaHardwareEmerging}{125} | ||
| 4741 | \newcommand{\SelectionByAreaSoftwarePl}{100} | 4741 | \newcommand{\SelectionByAreaSoftwarePl}{100} | ||
| 4742 | −\newcommand{\SelectionByAreaComputationalScience}{100} | 4742 | +\newcommand{\SelectionByAreaComputationalScience}{97} | ||
| 4743 | \newcommand{\SelectionByAreaTheory}{50} | 4743 | \newcommand{\SelectionByAreaTheory}{50} | ||
| 4744 | −\newcommand{\SelectionByYearLandmarksTwoZeroOneEight}{108} | 4744 | +\newcommand{\SelectionByYearLandmarksTwoZeroOneEight}{121} | ||
| 4745 | −\newcommand{\SelectionByYearLandmarksTwoZeroOneNine}{107} | 4745 | +\newcommand{\SelectionByYearLandmarksTwoZeroOneNine}{115} | ||
| 4746 | \newcommand{\SelectionByYearLandmarksTwoZeroTwoZero}{106} | 4746 | \newcommand{\SelectionByYearLandmarksTwoZeroTwoZero}{106} | ||
| 4747 | −\newcommand{\SelectionByYearLandmarksTwoZeroTwoOne}{87} | 4747 | +\newcommand{\SelectionByYearLandmarksTwoZeroTwoOne}{93} | ||
| 4748 | −\newcommand{\SelectionByYearLandmarksTwoZeroTwoTwo}{92} | 4748 | +\newcommand{\SelectionByYearLandmarksTwoZeroTwoTwo}{102} | ||
| 4749 | −\newcommand{\SelectionByYearLandmarksTwoZeroTwoThree}{128} | 4749 | +\newcommand{\SelectionByYearLandmarksTwoZeroTwoThree}{146} | ||
| 4750 | −\newcommand{\SelectionByYearLandmarksTwoZeroTwoFour}{135} | 4750 | +\newcommand{\SelectionByYearLandmarksTwoZeroTwoFour}{150} | ||
| 4751 | −\newcommand{\SelectionByYearLandmarksTwoZeroTwoFive}{111} | 4751 | +\newcommand{\SelectionByYearLandmarksTwoZeroTwoFive}{106} | ||
| 4752 | −\newcommand{\SelectionByYearLandmarksTwoZeroTwoSix}{219} | 4752 | +\newcommand{\SelectionByYearLandmarksTwoZeroTwoSix}{150} | ||
| 4753 | −\newcommand{\SelectionShareWithAbstractLandmarks}{0.826} | 4753 | +\newcommand{\SelectionShareWithAbstractLandmarks}{0.829} | ||
| 4754 | −\newcommand{\SelectionShareOaLandmarks}{0.740} | 4754 | +\newcommand{\SelectionShareOaLandmarks}{0.773} | ||
| 4755 | \newcommand{\LinkagesampleDoiN}{250} | 4755 | \newcommand{\LinkagesampleDoiN}{250} | ||
| 4756 | \newcommand{\LinkagesampleDoiAutoOk}{235} | 4756 | \newcommand{\LinkagesampleDoiAutoOk}{235} | ||
| 4757 | \newcommand{\LinkagesampleDoiAutoPrecision}{0.940} | 4757 | \newcommand{\LinkagesampleDoiAutoPrecision}{0.940} | ||
@@ -10331,61 +10331,60 @@ | |||||
| 10331 | \newcommand{\SecCoocBlockchainFoundationModelsTwoZeroTwoSix}{163} | 10331 | \newcommand{\SecCoocBlockchainFoundationModelsTwoZeroTwoSix}{163} | ||
| 10332 | \newcommand{\SecCoocBlockchainFoundationModelsTwoZeroTwoSixPct}{0.7} | 10332 | \newcommand{\SecCoocBlockchainFoundationModelsTwoZeroTwoSixPct}{0.7} | ||
| 10333 | \newcommand{\SecLandN}{125} | 10333 | \newcommand{\SecLandN}{125} | ||
| 10334 | −\newcommand{\SecLandWithAbstract}{92} | 10334 | +\newcommand{\SecLandWithAbstract}{97} | ||
| 10335 | −\newcommand{\SecLandWithAbstractPct}{74} | 10335 | +\newcommand{\SecLandWithAbstractPct}{78} | ||
| 10336 | −\newcommand{\SecLandOaPct}{62} | 10336 | +\newcommand{\SecLandOaPct}{67} | ||
| 10337 | −\newcommand{\SecLandPost}{66} | 10337 | +\newcommand{\SecLandPost}{56} | ||
| 10338 | −\newcommand{\SecLandBaseline}{58} | 10338 | +\newcommand{\SecLandBaseline}{68} | ||
| 10339 | −\newcommand{\SecLandYearTwoZeroTwoSix}{33} | 10339 | +\newcommand{\SecLandYearTwoZeroTwoSix}{21} | ||
| 10340 | −\newcommand{\SecLandNoDoi}{9} | 10340 | +\newcommand{\SecLandNoDoi}{12} | ||
| 10341 | −\newcommand{\SecLandTypePreprint}{7} | 10341 | +\newcommand{\SecLandTypeDissertation}{20} | ||
| 10342 | −\newcommand{\SecLandTypeDissertation}{13} | 10342 | +\newcommand{\SecLandTypeBookChapter}{11} | ||
| 10343 | −\newcommand{\SecLandTypeBookChapter}{12} | 10343 | +\newcommand{\SecLandTypePreprint}{5} | ||
| 10344 | \newcommand{\SecLandTypeArticle}{69} | 10344 | \newcommand{\SecLandTypeArticle}{69} | ||
| 10345 | \newcommand{\SecLandTypeConferencePaper}{11} | 10345 | \newcommand{\SecLandTypeConferencePaper}{11} | ||
| 10346 | −\newcommand{\SecLandTypeReport}{9} | 10346 | +\newcommand{\SecLandTypeReport}{6} | ||
| 10347 | \newcommand{\SecLandTypeReview}{3} | 10347 | \newcommand{\SecLandTypeReview}{3} | ||
| 10348 | −\newcommand{\SecLandTypeBook}{1} | ||||
| 10349 | \newcommand{\SecLandCybersecurityN}{25} | 10348 | \newcommand{\SecLandCybersecurityN}{25} | ||
| 10350 | −\newcommand{\SecLandCybersecurityPost}{16} | 10349 | +\newcommand{\SecLandCybersecurityPost}{12} | ||
| 10351 | −\newcommand{\SecLandCybersecurityWithAbstract}{20} | 10350 | +\newcommand{\SecLandCybersecurityWithAbstract}{21} | ||
| 10352 | −\newcommand{\SecLandCybersecurityYearTwoZeroTwoSix}{9} | 10351 | +\newcommand{\SecLandCybersecurityYearTwoZeroTwoSix}{3} | ||
| 10353 | \newcommand{\SecLandCybersecurityPreprints}{1} | 10352 | \newcommand{\SecLandCybersecurityPreprints}{1} | ||
| 10354 | −\newcommand{\SecLandCybersecurityArticles}{13} | 10353 | +\newcommand{\SecLandCybersecurityArticles}{10} | ||
| 10355 | −\newcommand{\SecLandCybersecurityConference}{1} | 10354 | +\newcommand{\SecLandCybersecurityConference}{2} | ||
| 10356 | −\newcommand{\SecLandCybersecurityGrey}{10} | 10355 | +\newcommand{\SecLandCybersecurityGrey}{12} | ||
| 10357 | \newcommand{\SecLandAppliedCryptographyN}{25} | 10356 | \newcommand{\SecLandAppliedCryptographyN}{25} | ||
| 10358 | −\newcommand{\SecLandAppliedCryptographyPost}{15} | 10357 | +\newcommand{\SecLandAppliedCryptographyPost}{11} | ||
| 10359 | −\newcommand{\SecLandAppliedCryptographyWithAbstract}{18} | 10358 | +\newcommand{\SecLandAppliedCryptographyWithAbstract}{19} | ||
| 10360 | −\newcommand{\SecLandAppliedCryptographyYearTwoZeroTwoSix}{8} | 10359 | +\newcommand{\SecLandAppliedCryptographyYearTwoZeroTwoSix}{5} | ||
| 10361 | \newcommand{\SecLandAppliedCryptographyPreprints}{0} | 10360 | \newcommand{\SecLandAppliedCryptographyPreprints}{0} | ||
| 10362 | −\newcommand{\SecLandAppliedCryptographyArticles}{11} | 10361 | +\newcommand{\SecLandAppliedCryptographyArticles}{13} | ||
| 10363 | −\newcommand{\SecLandAppliedCryptographyConference}{2} | 10362 | +\newcommand{\SecLandAppliedCryptographyConference}{1} | ||
| 10364 | −\newcommand{\SecLandAppliedCryptographyGrey}{12} | 10363 | +\newcommand{\SecLandAppliedCryptographyGrey}{11} | ||
| 10365 | \newcommand{\SecLandBlockchainN}{25} | 10364 | \newcommand{\SecLandBlockchainN}{25} | ||
| 10366 | \newcommand{\SecLandBlockchainPost}{6} | 10365 | \newcommand{\SecLandBlockchainPost}{6} | ||
| 10367 | −\newcommand{\SecLandBlockchainWithAbstract}{19} | 10366 | +\newcommand{\SecLandBlockchainWithAbstract}{20} | ||
| 10368 | −\newcommand{\SecLandBlockchainYearTwoZeroTwoSix}{2} | 10367 | +\newcommand{\SecLandBlockchainYearTwoZeroTwoSix}{1} | ||
| 10369 | −\newcommand{\SecLandBlockchainPreprints}{5} | 10368 | +\newcommand{\SecLandBlockchainPreprints}{3} | ||
| 10370 | −\newcommand{\SecLandBlockchainArticles}{14} | 10369 | +\newcommand{\SecLandBlockchainArticles}{15} | ||
| 10371 | −\newcommand{\SecLandBlockchainConference}{1} | 10370 | +\newcommand{\SecLandBlockchainConference}{0} | ||
| 10372 | −\newcommand{\SecLandBlockchainGrey}{5} | 10371 | +\newcommand{\SecLandBlockchainGrey}{7} | ||
| 10373 | \newcommand{\SecLandPrivacyPreservingComputationN}{25} | 10372 | \newcommand{\SecLandPrivacyPreservingComputationN}{25} | ||
| 10374 | −\newcommand{\SecLandPrivacyPreservingComputationPost}{14} | 10373 | +\newcommand{\SecLandPrivacyPreservingComputationPost}{12} | ||
| 10375 | −\newcommand{\SecLandPrivacyPreservingComputationWithAbstract}{21} | 10374 | +\newcommand{\SecLandPrivacyPreservingComputationWithAbstract}{22} | ||
| 10376 | −\newcommand{\SecLandPrivacyPreservingComputationYearTwoZeroTwoSix}{8} | 10375 | +\newcommand{\SecLandPrivacyPreservingComputationYearTwoZeroTwoSix}{6} | ||
| 10377 | \newcommand{\SecLandPrivacyPreservingComputationPreprints}{1} | 10376 | \newcommand{\SecLandPrivacyPreservingComputationPreprints}{1} | ||
| 10378 | \newcommand{\SecLandPrivacyPreservingComputationArticles}{16} | 10377 | \newcommand{\SecLandPrivacyPreservingComputationArticles}{16} | ||
| 10379 | \newcommand{\SecLandPrivacyPreservingComputationConference}{3} | 10378 | \newcommand{\SecLandPrivacyPreservingComputationConference}{3} | ||
| 10380 | \newcommand{\SecLandPrivacyPreservingComputationGrey}{5} | 10379 | \newcommand{\SecLandPrivacyPreservingComputationGrey}{5} | ||
| 10381 | \newcommand{\SecLandFederatedLearningN}{25} | 10380 | \newcommand{\SecLandFederatedLearningN}{25} | ||
| 10382 | \newcommand{\SecLandFederatedLearningPost}{15} | 10381 | \newcommand{\SecLandFederatedLearningPost}{15} | ||
| 10383 | −\newcommand{\SecLandFederatedLearningWithAbstract}{14} | 10382 | +\newcommand{\SecLandFederatedLearningWithAbstract}{15} | ||
| 10384 | \newcommand{\SecLandFederatedLearningYearTwoZeroTwoSix}{6} | 10383 | \newcommand{\SecLandFederatedLearningYearTwoZeroTwoSix}{6} | ||
| 10385 | \newcommand{\SecLandFederatedLearningPreprints}{0} | 10384 | \newcommand{\SecLandFederatedLearningPreprints}{0} | ||
| 10386 | \newcommand{\SecLandFederatedLearningArticles}{18} | 10385 | \newcommand{\SecLandFederatedLearningArticles}{18} | ||
| 10387 | −\newcommand{\SecLandFederatedLearningConference}{4} | 10386 | +\newcommand{\SecLandFederatedLearningConference}{5} | ||
| 10388 | −\newcommand{\SecLandFederatedLearningGrey}{3} | 10387 | +\newcommand{\SecLandFederatedLearningGrey}{2} | ||
| 10389 | % ---- Part VII-a theory macros (Agent G) ---- | 10388 | % ---- Part VII-a theory macros (Agent G) ---- | ||
| 10390 | \newcommand{\ThyCountAlgorithmsTwoZeroOneEightMultilabel}{60{,}011} | 10389 | \newcommand{\ThyCountAlgorithmsTwoZeroOneEightMultilabel}{60{,}011} | ||
| 10391 | \newcommand{\ThyCountAlgorithmsTwoZeroOneEightPrimary}{29{,}148} | 10390 | \newcommand{\ThyCountAlgorithmsTwoZeroOneEightPrimary}{29{,}148} | ||
@@ -12801,30 +12800,29 @@ | |||||
| 12801 | \newcommand{\ThyCoocFormalVerificationGenerativeAiTwoZeroTwoSix}{233} | 12800 | \newcommand{\ThyCoocFormalVerificationGenerativeAiTwoZeroTwoSix}{233} | ||
| 12802 | \newcommand{\ThyCoocFormalVerificationGenerativeAiTwoZeroTwoSixPct}{1.6} | 12801 | \newcommand{\ThyCoocFormalVerificationGenerativeAiTwoZeroTwoSixPct}{1.6} | ||
| 12803 | \newcommand{\ThyLandTheoryN}{50} | 12802 | \newcommand{\ThyLandTheoryN}{50} | ||
| 12804 | −\newcommand{\ThyLandTheoryPost}{27} | 12803 | +\newcommand{\ThyLandTheoryPost}{25} | ||
| 12805 | −\newcommand{\ThyLandTheoryDatedTwentysix}{10} | 12804 | +\newcommand{\ThyLandTheoryDatedTwentysix}{8} | ||
| 12806 | −\newcommand{\ThyLandTheoryAbstract}{39} | 12805 | +\newcommand{\ThyLandTheoryAbstract}{44} | ||
| 12807 | −\newcommand{\ThyLandTheoryOa}{29} | 12806 | +\newcommand{\ThyLandTheoryOa}{34} | ||
| 12808 | −\newcommand{\ThyLandTheoryTypeConferencePaper}{3} | 12807 | +\newcommand{\ThyLandTheoryTypeConferencePaper}{5} | ||
| 12809 | −\newcommand{\ThyLandTheoryTypeBookChapter}{14} | 12808 | +\newcommand{\ThyLandTheoryTypeArticle}{26} | ||
| 12810 | −\newcommand{\ThyLandTheoryTypeArticle}{21} | 12809 | +\newcommand{\ThyLandTheoryTypeBookChapter}{6} | ||
| 12811 | \newcommand{\ThyLandTheoryTypeDissertation}{8} | 12810 | \newcommand{\ThyLandTheoryTypeDissertation}{8} | ||
| 12812 | −\newcommand{\ThyLandTheoryTypePreprint}{2} | 12811 | +\newcommand{\ThyLandTheoryTypePreprint}{3} | ||
| 12813 | \newcommand{\ThyLandTheoryTypeBook}{2} | 12812 | \newcommand{\ThyLandTheoryTypeBook}{2} | ||
| 12814 | \newcommand{\ThyLandTheoryCatAlgorithms}{25} | 12813 | \newcommand{\ThyLandTheoryCatAlgorithms}{25} | ||
| 12815 | \newcommand{\ThyLandTheoryCatComputationalComplexity}{25} | 12814 | \newcommand{\ThyLandTheoryCatComputationalComplexity}{25} | ||
| 12816 | \newcommand{\ThyLandSoftwarePlN}{100} | 12815 | \newcommand{\ThyLandSoftwarePlN}{100} | ||
| 12817 | −\newcommand{\ThyLandSoftwarePlPost}{44} | 12816 | +\newcommand{\ThyLandSoftwarePlPost}{46} | ||
| 12818 | −\newcommand{\ThyLandSoftwarePlDatedTwentysix}{12} | 12817 | +\newcommand{\ThyLandSoftwarePlDatedTwentysix}{8} | ||
| 12819 | −\newcommand{\ThyLandSoftwarePlAbstract}{83} | 12818 | +\newcommand{\ThyLandSoftwarePlAbstract}{85} | ||
| 12820 | −\newcommand{\ThyLandSoftwarePlOa}{73} | 12819 | +\newcommand{\ThyLandSoftwarePlOa}{77} | ||
| 12821 | −\newcommand{\ThyLandSoftwarePlTypeConferencePaper}{11} | 12820 | +\newcommand{\ThyLandSoftwarePlTypeConferencePaper}{12} | ||
| 12822 | \newcommand{\ThyLandSoftwarePlTypeBookChapter}{14} | 12821 | \newcommand{\ThyLandSoftwarePlTypeBookChapter}{14} | ||
| 12823 | −\newcommand{\ThyLandSoftwarePlTypeDissertation}{34} | 12822 | +\newcommand{\ThyLandSoftwarePlTypeDissertation}{38} | ||
| 12824 | −\newcommand{\ThyLandSoftwarePlTypeArticle}{30} | 12823 | +\newcommand{\ThyLandSoftwarePlTypeArticle}{25} | ||
| 12825 | −\newcommand{\ThyLandSoftwarePlTypePreprint}{9} | 12824 | +\newcommand{\ThyLandSoftwarePlTypePreprint}{10} | ||
| 12826 | \newcommand{\ThyLandSoftwarePlTypeReview}{1} | 12825 | \newcommand{\ThyLandSoftwarePlTypeReview}{1} | ||
| 12827 | −\newcommand{\ThyLandSoftwarePlTypeBook}{1} | ||||
| 12828 | \newcommand{\ThyLandSoftwarePlCatSoftwareEngineering}{25} | 12826 | \newcommand{\ThyLandSoftwarePlCatSoftwareEngineering}{25} | ||
| 12829 | \newcommand{\ThyLandSoftwarePlCatProgrammingLanguages}{25} | 12827 | \newcommand{\ThyLandSoftwarePlCatProgrammingLanguages}{25} | ||
| 12830 | \newcommand{\ThyLandSoftwarePlCatCompilers}{25} | 12828 | \newcommand{\ThyLandSoftwarePlCatCompilers}{25} | ||
| 12831 | 12829 | ||||