# Publications Published articles for Publications. This is one page of public article previews, not the complete archive. Follow Next page to continue. Summaries are not the original full articles. ## A Jargon-Free Learning Hub for AI Foundations DevFeed: [A Jargon-Free Learning Hub for AI Foundations]() Original publisher: [Read original article]() Author: Dr. Ashish Bamania Published: 2026-07-04T11:28:14Z Content type: opinion Language: en Sources: [Dr. Ashish Bamania]() Topics: [Artificial Intelligence](), [Large Language Model](), [Mixture of Experts (MoE)](), [AI Development]() Tags: [ai](), [artificial-intelligence](), [data-science](), [llm](), [machine-learning](), [mixture-of-experts-moe](), [programming](), [publications](), [technology]() ### AI overview The author announces a learning resource focused on high-quality, jargon-free information about Artificial Intelligence. Its planned lessons cover how LLMs generate text, building and training an LLM from scratch, NVIDIA GPUs for AI engineers, and building and training a Mixture-of-Experts LLM from scratch. ### Source excerpt Photo by Google DeepMind on Unsplash 👋🏻 Hey everyone! The internet is full of publications that buzz about every new model release, churn out hot takes on who's winning in AI, and spew doom-and-gloom hype (plus a hundred "10 prompts that will change your life" posts). None of them have made a meaningful difference in my life. Rather, this content is written to provoke emotions and go viral. I have a deep dislike for this type of writing. So, I am fixing this by going the other way and creating a spot where you can find very high-quality, jargon-free information about Artificial Intelligence. Here are four lessons that describe what I'm talking about. A hardware-level tour of how LLMs generate text Build and train an LLM from scratch What every AI engineer must know about NVIDIA GPUs Build and Train a Mixture-of-Experts (MoE) LLM from Scratch If you're interested in really leveling up as an AI engineer, here's your link to join me alongside 10,000+ other smart engineers 👉🏻 Into AI Cheers! ## Catalyzing scientific impact through global partnerships and open resources DevFeed: [Catalyzing scientific impact through global partnerships and open resources]() Original publisher: [Read original article]() Published: 2026-05-01T16:37:00Z Content type: article Language: en Sources: [The latest research from Google]() Topics: [Open Source](), [datasets](), [Google](), [Transformer architecture]() Tags: [apis](), [architecture](), [australia](), [collaboration](), [community](), [data-mining-modeling](), [developers](), [general-science](), [global](), [google](), [health-bioscience](), [india](), [japan](), [open](), [open-source](), [open-source-models-datasets](), [partnerships](), [publications](), [research](), [science](), [software](), [technology](), [transformer-architecture]() ### AI overview Google Research describes an open-science approach centered on responsible research, open-source software, open-access datasets, and partnerships with scientific organizations and consortia worldwide. It highlights shared technologies and datasets, including Transformer architecture and specialized models used across fields such as medicine, genomics, neuroscience, climate, and energy. ### Source excerpt Data Mining & Modeling ## How SMBs use threat research and MDR to build a defensive edge DevFeed: [How SMBs use threat research and MDR to build a defensive edge]() Original publisher: [Read original article]() Author: Ben Tudor Published: 2026-03-05T10:00:00Z Content type: article Language: en Sources: [WeLiveSecurity]() Topics: [Threat Research](), [Cybersecurity](), [SOC](), [Monitoring](), [Business Security]() Tags: [business](), [business-security](), [conferences](), [cybersecurity](), [monitoring](), [operations](), [publications](), [research](), [security](), [small-business](), [soc](), [threat-research]() ### AI overview The article explains how small and midsize businesses can use managed detection and response (MDR) to access proactive threat monitoring, hunting, and expert cybersecurity capabilities without building an elite in-house SOC. It also describes how threat research and intelligence inform MDR workflows, combining advanced technology with human expertise. ### Source excerpt We speak to Director of ESET Threat Research Jean-Ian Boutin about where solutions that blend advanced technology with human expertise provide the most practical value for businesses ## Deepening our partnership with the UK AI Security Institute DevFeed: [Deepening our partnership with the UK AI Security Institute]() Original publisher: [Read original article]() Author: William Isaac; Owen Larter Published: 2025-12-11T00:06:40Z Content type: article Language: en Sources: [Google DeepMind News]() Topics: [ai safety](), [Google](), [Responsibility & Safety](), [Security](), [AI Models](), [AI Research](), [Chain-of-thought]() Tags: [ai](), [ai-models](), [ai-safety](), [ai-security](), [chain-of-thought](), [collaboration](), [google](), [publications](), [reports](), [research](), [responsibility-safety](), [safety](), [technical](), [techniques](), [uk]() ### AI overview Google DeepMind announces an expanded partnership with the UK AI Security Institute focused on foundational AI security and safety research. The collaboration includes model testing, shared research resources, joint publications, and work on monitoring AI reasoning processes. ### Source excerpt Google DeepMind and UK AI Security Institute (AISI) strengthen collaboration on critical AI safety and security research ## Waiting for PostgreSQL 19 - Sequence synchronization in logical replication. DevFeed: [Waiting for PostgreSQL 19 - Sequence synchronization in logical replication.]() Original publisher: [Read original article]() Author: depesz Published: 2025-11-11T12:24:23Z Content type: tutorial Language: en Sources: [select \* from depesz;]() Topics: [PostgreSQL](), [Replication](), [Sequences]() Tags: [benchmark](), [logical](), [pg19](), [postgresql](), [psql](), [publications](), [replication](), [sequence](), [sequences](), [synchronization](), [uncategorized](), [upgrade](), [upgrades](), [waiting]() ### AI overview This article demonstrates PostgreSQL 19's planned sequence synchronization for logical replication. It sets up source and destination databases, tests sequence synchronization, finds that resynchronization must be manually invoked, and reports that synchronizing 10,000 sequences took about one second in the author's test. ### Source excerpt First, on 9th of October 2025, Amit Kapila committed patch: Add "ALL SEQUENCES" support to publications. This patch adds support for the ALL SEQUENCES clause in publications, enabling synchronization/replication of all sequences that is useful for upgrades. Publications can now include all sequences via FOR ALL SEQUENCES. psql enhancements: \d shows publications for ... Continue reading "Waiting for PostgreSQL 19 - Sequence synchronization in logical replication." ## Decompiling 2024: A Year of Resurgence in Decompilation Research DevFeed: [Decompiling 2024: A Year of Resurgence in Decompilation Research]() Original publisher: [Read original article]() Published: 2025-01-29T00:00:00Z Content type: article Language: en Sources: [mahaloz.re]() Topics: [Programming](), [Software Engineering]() Tags: [graph](), [publications](), [research](), [retrospective]() ### AI overview A retrospective of decompilation research in 2024, covering academic and broader field progress. The article reports that 2024 produced an unusually high number of top-tier decompilation publications, including eight papers that represented nearly 30% of all such work. ### Source excerpt The year 2024 was a resurgent year for decompilation. Academic publications from that year made up nearly 30% of all top publications ever made in decompilation. In this post, I do a summarization and retrospective of both the academic and ideological progress of decompilation in 2024. Hint: decompilation research is back. ## Applying Semantic Web Principles to Source Code for Better Understanding DevFeed: [Applying Semantic Web Principles to Source Code for Better Understanding]() Original publisher: [Read original article]() Author: Mattt (mattt@nshipster.com) Published: 2020-07-07T07:00:00Z Content type: opinion Language: en Sources: [NSHipster]() Topics: [Code](), [Semantic Web](), [Programming](), [Development](), [Syntax Highlighting](), [Universal Syntax Tree.](), [Website]() Tags: [abstraction](), [code](), [internet](), [miscellaneous](), [programming](), [publications](), [source](), [space](), [syntax-highlighting]() ### AI overview The article proposes applying semantic web principles to source code to improve understanding. It outlines language-agnostic representation, unique URL identifiers for packages, modules, and APIs, and decentralized information distributed across federated data sources. ### Source excerpt What if, instead of lowering source code down for the purpose of execution, we raised it for the purpose of understanding? ## Empirical Evaluation of Secure Development Processes DevFeed: [Empirical Evaluation of Secure Development Processes]() Original publisher: [Read original article]() Author: Adam Published: 2019-12-07T00:00:00Z Content type: article Language: en Sources: [Shostack & Friends Blog]() Topics: [Software Engineering](), [Cybersecurity](), [Vulnerabilities](), [Architecture & Design](), [least privilege]() Tags: [announcement](), [cybersecurity](), [development](), [publications](), [report](), [security-vulnerabilities](), [software](), [software-engineering](), [workshop]() ### AI overview The author reports on a workshop at Schloss Dagstuhl about empirically evaluating secure development processes. The workshop report examines the lack of empirical data on how security principles, architectures, and methodologies affect resulting systems, making it harder for organizations to choose cost-effective practices for reducing vulnerabilities. ### Source excerpt Earlier this year, I helped to organize a workshop at Schloss Dagstuhl on Empirical Evaluation of Secure Development Processes. I think the workshop was a tremendous success. ## The Essential Barbara Liskov DevFeed: [The Essential Barbara Liskov]() Original publisher: [Read original article]() Author: Marc Brooker Published: 2014-09-21T00:00:00Z Content type: opinion Language: en Sources: [Marc Brooker's Blog](), [Marc Brooker's Blog]() Topics: [Computer science](), [distributed-systems](), [Replication](), [Availability](), [Protocol (disambiguation)]() Tags: [availability](), [distributed-systems](), [publications](), [replication](), [research](), [science](), [systems](), [types](), [worth-reading]() ### AI overview An overview of selected Barbara Liskov papers, covering behavioral subtyping and the Liskov Substitution Principle, as well as replication and highly available distributed systems through Viewstamped Replication. The article emphasizes the papers' historical significance, readability, and relevance to working programmers. ### Source excerpt The Essential Barbara Liskov Some of my favorite Barbara Liskov publications. Barbara Liskov is one of the greats of computer science. Over a research career nearing 45 years, she's had a resounding impact on multiple different fields, and received an impressive list of honors and awards, including the 2009 Turing Award. In the same spirit as The Essential Leslie Lamport and The Essential Nancy Lynch, I thought I'd write about some of my favorite Liskov papers. These are just papers I like or found particularly interesting, and I'm likely to have missed some you like. What does it mean for one type to be a subtype of another? We argue that this is a semantic question having to do with the behavior of the objects of the two types: the objects of the subtype ought to behave the same as those of the supertype as for as anyone or any program using the supertype objects can tell. Data abstraction and hierarchy, A behavioral notion of subtyping and Behavioral subtyping using invariants and constraints, are why most working programmers would recognize Liskov's name. The Liskov Substitution Principle, widely known as the L in SOLID, is a widely-followed rule about the relationship between the behavior of its supertypes and subtypes. I'll readily admit that types are an area of computer science that I'm not very familiar with, but I found these papers easy to follow and very applicable. For the working programmers, there's not much material there that isn't covered in the wiki page, but it's worth reading to see how Liskov lays out the arguments for the principle. If you're interested in the history and thinking behind rules, these are great papers to read. Availability is achieved through replication. Transaction processing depends on forcing information to backups so that a majority of cohorts know about particular events. Viewstamped Replication: A New Primary Copy Method to Support Highly Available Distributed Systems deserves to be recognized as one of the most influent ## The Essential Nancy Lynch DevFeed: [The Essential Nancy Lynch]() Original publisher: [Read original article]() Author: Marc Brooker Published: 2014-05-10T00:00:00Z Content type: article Language: en Sources: [Marc Brooker's Blog](), [Marc Brooker's Blog]() Topics: [distributed-systems](), [Algorithms, Complexity](), [Availability]() Tags: [algorithms](), [availability](), [distributed-systems](), [history](), [publications](), [worth-reading]() ### AI overview The article recommends selected Nancy Lynch papers on distributed systems, focusing on impossibility results, bounds, consensus, atomicity, and the CAP theorem. It highlights the papers' historical value, readability, and usefulness as guides to further distributed-systems research. ### Source excerpt The Essential Nancy Lynch Some of my favorite Nancy Lynch publications. While reading distributed systems papers, one of the names that comes up most often is Nancy Lynch's. From a standard textbook for university distributed systems courses (Distributed Algorithms), to some of the earliest successful results on consensus, to the proof of the CAP theorem, Lynch's name is everywhere. In the same spirit as The Essential Leslie Lamport, I thought I'd write about some of my favorite Nancy Lynch papers. The criteria are the same as last time: I like these papers for some reason. I'd probably make a different list if I wrote this post again next week. What good are impossibility results, anyway? They don't seem very useful at first, since they don't allow computers to do anything they couldn't previously. A Hundred Impossibility Proofs for Distributed Computing is a great read. It covers a huge amount of ground across most of the distributed systems field as it stood in 1989, and presents an overwhelming number of results. The focus is on impossibility results and bounds (as the title suggests), but the paper frequently wanders off this path. This paper is worth reading on it's own, but it's also a really great way to discover distributed systems papers you haven't seen before. With 103 references, there's plenty to keep you busy if you're looking for papers and books to read. Despite covering some deep results quite formally, the paper remains readable even without deep expertise in some of the areas it covers. A Hundred Impossibility Proofs is also a great piece of history, a snapshot of the distributed systems world 25 years ago. Why this is worth reading: It presents a huge number of results in a very compact and readable package. You won't get bored reading this paper. However the read request does not begin until after the write request ... has completed. This therefore contradicts the atomicity property, proving that no such algorithm exists. The algorithm that doesn ## The Essential Leslie Lamport DevFeed: [The Essential Leslie Lamport]() Original publisher: [Read original article]() Author: Marc Brooker Published: 2014-03-30T00:00:00Z Content type: opinion Language: en Sources: [Marc Brooker's Blog](), [Marc Brooker's Blog]() Topics: [Algorithm](), [Concurrent Programming](), [Concurrency](), [Computer science]() Tags: [concurrent](), [concurrent-programming](), [programming](), [publications](), [science]() ### AI overview The article recommends selected Leslie Lamport publications, focusing on the bakery algorithm for mutual exclusion in concurrent programming and on the ordering of events in distributed systems using logical clocks. It presents these works as particularly elegant and valuable for understanding computer science. ### Source excerpt The Essential Leslie Lamport Some of my favourite Leslie Lamport publications. After it was announced that Leslie Lamport had won the 2013 A.M. Turing award, the link to his list of publications found popularity on most of the tech-related sites I visit. It's an excellent page, with a long (and growing) list of Lamport's publications, and witty comments by the author on each one. The whole list is worth a read, but can feel overwhelming, so I thought I'd try distill it down it some papers that I feel are really worth reading, if you read nothing else on that page. The criteria are: I like these papers for some reason. I'd probably make a different list if I wrote this post again next week. The algorithm is quite simple. It is based upon one commonly used in bakeries, in which a customer receives a number upon entering the store. The holder of the lowest number is the next one served. In A New Solution of Dijkstra's Concurrent Programming Problem Lamport describes the mutual exclusion problem formally posed by Dijkstra, and presents a solution to it. The bakery algorithm is remarkable. Unlike the earlier solutions, which depended on shared memory locations with fairly restrictive behaviors, the bakery algorithm works without any underlying mutual exclusion. Lamport's invention, or discovery, of this algorithm seems to kicked off a cascade of other solutions. Szymanski's, which seems to have been the first to offer both strong fairness and use of a fixed number of shared variables of a bounded size, is particularly interesting. Why this is worth reading: The bakery algorithm, while not very relevant to today's concurrent software due to changes in memory models, is very simple, very beautiful, and solves a complex problem in an innovative way. It's simply a beautiful piece of computer science. In a distributed system, it is sometimes impossible to say that one of two events occurred first. The relation "happened before" is therefore only a partial ordering of the even