Searching txt.sour.is

Twts matching #graph
Sort by: Newest, Oldest, Most Relevant
bender
twtxt.net
 (8h ago)
↳ In-reply-to » I disabled the compression of logs on my edge, which I'm hoping will fix the "instability" I see every now and again where my edge network just "falls off the face of the earth". Some folks don't really appreciate / understand this, but Disk I/O can kill your application(s) no matter what. I/O Wait is a real thing.

Great! Write a post about it, and twelve into details, providing graphs, or stats on how disk “I/O can kill your application(s) no matter what”.

⤋ Read More
prologic
twtxt.net
 (2w ago)

Pretty happy with my zs-blog-template starter kit for creating and maintaining your own blog using zs 👌 Demo of what the starter kit looks like here – Basic features include:

  • Clean layout & typography
  • Chroma code highlighting (aligned to your site palette)
  • Accessible copy-code button
  • “On this page” collapsible TOC
  • RSS, sitemap, robots
  • Archives, tags, tag cloud
  • Draft support (hidden from lists/feeds)
  • Open Graph (OG) & Twitter card meta (default image + per-post overrides)
  • Ready-to-use 404 page

As well as custom routes (redirects, rewrites, etc) to support canonical URLs or redirecting old URLs as well as new zs external command capability itself that now lets you do things like:

$ zs newpost

to help kick-start the creation of a new post with all the right “stuff”™ ready to go and then pop open your $EEDITOR 🤞

#awesome #zs

⤋ Read More
yue-fang-readfog
feeds.twtxt.net
 (22w ago)

圖解 AI 三大核心技術：RAG、大模型、智能體
大模型中的 Transformer 與混合專家（MoE）5 種大模型微調技術傳統 RAG 與 Agentic RAG 對比5 種經典的智能體設計模式5 大文本分塊策略智能體系統的 5 個等級傳統 RAG vs HyDERAG vs Graph RAGKV caching ⌘ Read more

⤋ Read More
lyse
lyse.isobeef.org
 (29w ago)
↳ In-reply-to » i really wanna learn golang it looks fun and capable and i can read it kind of but every time i try it i'm immediately stuck on basic concepts like "what the fuck is a pointer" (this has been explained to me and i still don't get it). i did have types explained to me as like notes on code which makes sense a bit but i'm mostly lost on basic code concepts

@kat@yarn.girlonthemoon.xyz Pointers can be a bit tricky. I know it took me also quite some time to wrap my head around them. Let my try to explain. It’s a pretty simple, yet very powerful concept with many facets to it.

A pointer is an indirection. At a lower level, when you have some chunk of memory, you can have some actual values sitting in there, ready for direct use. A pointer, on the other hand, points to some other location where to look for the values one’s actually after. Following that pointer is also called dereferencing the pointer.

I can’t come up with a good real-world example, so this poor comparison has to do. It’s a bit like you have a book (the real value that is being pointed to) and an ISBN referencing that book (the pointer). So, instead of sending you all these many pages from that book, I could give you just a small tag containing the ISBN. With that small piece of information, you’re able to locate the book. Probably a copy of that book and that’s where this analogy falls apart.

In contrast to that flawed comparision, it’s actually the other way around. Many different pointers can point to the same value. But there are many books (values) and just one ISBN (pointer).

The pointer’s target might actually be another pointer. You typically then would follow both of them. There are no limits on how long your pointer chains can become.

One important property of pointers is that they can also point into nothingness, signalling a dead end. This is typically called a null pointer. Following such a null pointer calls for big trouble, it typically crashes your program. Hence, you must never follow any null pointer.

Pointers are important for example in linked lists, trees or graphs. Let’s look at a doubly linked list. One entry could be a triple consisting of (actual value, pointer to next entry, pointer to previous entry).

  _______________________
 /               ________\_______________
↓               ↓         |              \
+---+---+---+   +---+---+-|-+   +---+---+-|-+
| 7 | n | x |   | 23| n | p |   | 42| x | p |
+---+-|-+---+   +---+-|-+---+   +---+---+---+
      |         ↑     |         ↑
       \_______/       \_______/

The “x” indicates a null pointer. So, the first element of the doubly linked list with value 7 does not have any reference to a previous element. The same is true for the next element pointer in the last element with value 42.

In the middle element with value 23, both pointers to the next (labeled “n”) and previous (labeled “p”) elements are pointing to the respective elements.

You can also see that the middle element is pointed to by two pointers. By the “next” pointer in the first element and the “previous” pointer in the last element.

That’s it for now. There are heaps ;-) more things to tell about pointers. But it might help you a tiny bit.

⤋ Read More
cuaxolotl
sunshinegardens.org
 (49w ago)
↳ In-reply-to » So I am really curious, now that I am building upon @sorenpeter's Timeline app, how other users write/add their twtxt, and how you follow conversations. Comment svp!

@codebuzz@www.codebuzz.nl I have some shell scripts that handle some of the log formatting details, but I mostly write my mesages by hand. Lately I’ve been browsing twtxt.net since they aggregate most of the known network. I have a couple of demo aggregators sitting around, but I’m in the middle of some infra rebuilds so a lot of my services are offline rn. They’re both built on a simple social graph analysis that extracts urls for your direct follows the follows listed on each of those feeds (friend-of-a-friend replication). certain formatting operations are awkward with my setup, so I may write an app of some kind in the future. likely gemini-based, but I have a number of projects ahead of that one in the queue.

⤋ Read More
github_blog
feeds.twtxt.net
 (1y ago)

How researchers are using GitHub Innovation Graph data to estimate the impact of ChatGPT
An interview with economic researchers who are applying causal inference techniques to analyze the effect of generative AI tools on software development activity.

The post [How researchers are using GitHub Innovation Graph data to estimate the impact of ChatGPT](https://github.blog/2024-07-17-how-researchers-are-using-github-innovation-graph-data-to-estimate-t … ⌘ Read more

⤋ Read More
os-x-daily
feeds.twtxt.net
 (1y ago)

How to See Individual Core CPU Usage on Mac with powermetrics
There are various ways to monitor CPU usage on a Mac, with perhaps the two most common being with Activity Monitor on the graphical interface side of things, and htop or top on the command line side. While you can show an optional core graph in Activity Monitor, and htop will show CPU core activity … Read More ⌘ Read more

⤋ Read More
github_blog
feeds.twtxt.net
 (1y ago)

New data and visualizations highlight the resilience of international developer collaboration
Discover the latest trends and insights on public software development activity on GitHub with the release of Q3 2023 data for the Innovation Graph.

The post [New data and visualizations highlight the resilience of international developer collaboration](https://github.blog/2024-01-18-new-data-and-visualizations-highlight-the-resilience-of-internation … ⌘ Read more

⤋ Read More
github_blog
feeds.twtxt.net
 (2y ago)

Bypassing OGNL sandboxes for fun and charities
Object Graph Notation Language (OGNL) is a popular, Java-based, expression language used in popular frameworks and applications, such as Apache Struts and Atlassian Confluence. Learn more about bypassing certain OGNL injection protection mechanisms including those used by Struts and Atlassian Confluence, as well as different approaches to analyzing this form of protection so you can harden similar systems. ⌘ Read more

⤋ Read More
github_blog
feeds.twtxt.net
 (3y ago)

Git’s database internals II: commit history queries
This post explores Git commit history as a database where ‘git log’ is the query language. Learn about Git’s custom query index – the commit-graph file – and how to make sure it’s enabled in your repositories. ⌘ Read more

⤋ Read More
niplav
niplav.site
 (3y ago)

with resolving inconsistent graph preferences, does the portion of non-uniquely resolvable preferences shrink with the number of options? in other words: for the set 𝓖_n of all graphs with n nodes, and the set U(𝓖_n) of those graphs with a unique path-graph with a smallest graph-edit distance, is |U(𝓖_n)|/𝓖n<|U(𝓖{n+1})|/|𝓖_{n+1}|?

⤋ Read More
niplav
niplav.site
 (3y ago)

for a given graph G, there is a set of graphs \mathcal{G} so that for every G’ ∈ \mathcal{G}, the transitive closure of G’ is G. does \mathcal{G} contain only one element?

⤋ Read More