• limer ( limer@lemmy.ml ) 
    link
    fedilink
    arrow-up
    12
    ·
    1 year ago

    A new data structure in computer programming. I got the idea from cell chemistry, and figured computers today can handle slow and inefficient, instead of fast and clever. Turns out it’s also great for networking.

      • limer ( limer@lemmy.ml ) 
        link
        fedilink
        arrow-up
        5
        ·
        1 year ago

        It’s a personal project I’ve been working on.

        Basically the data is moved around by things very slowly. It’s easy to integrate them into different systems. It’s like a very slow communication layer on top of everything else.

          • limer ( limer@lemmy.ml ) 
            link
            fedilink
            arrow-up
            3
            ·
            1 year ago

            Thanks 😊. Several, but still in development.

            I’ve been working on this for some now; I’ll be talking about this more when I finish all the api.

            the open-api inbound calls and db have been done for months. But it’s not a complete implementation in the code. However the spec was done a couple years ago and it has not changed, which means I’m probably going to keep that one.

            I’m working on a testing platform where people can log in and try the library. I’m using that to test and finish.

            Once I have actually finished, it will be public under the apache2 license. I’ll save this comment and let you know in a new community I will make in .ml for it

    • I actually do think I’ve invented a data structure for interleaving multiple streams in a single file in a really efficient way. I can’t find something that looks like it, and it seems obviously faster and more logical than anything else I’ve seen. It’s the level below B-trees so not optimised for least amount of lookups within a record table, nor would it be efficient for adding records in a middle of the stream, but for treating data streams like files (append, shrink) I do think it’s significantly more efficient than what else I can find. One of these days I really should submit a paper and see what reviewers say.

  • Naich ( Naich@lemmings.world ) 
    link
    fedilink
    arrow-up
    10
    ·
    1 year ago

    I invented a pagination system for web pages that allowed easy navigation with only a few clicks to get to the page you want, whether it was 3 pages or 3000 pages.

    I’m really surprised no one else has invented it because it was so much better than anything else I’ve seen.

  • melsaskca ( melsaskca@lemmy.ca ) 
    link
    fedilink
    arrow-up
    8
    ·
    1 year ago

    I invented (developed) an mp3 file splitter. I did this in order to allow more tracks for the digital books my wife listens to. Each track was over an hour long and she’d sometimes have to listen to over 45 minutes just to end up to where she fell asleep the night before. Now each track is 10 minutes long (or 15, or 5; it’s variable, so your choice). So I make tiny sized mp3 files out of large sized mp3 files.

  • mub ( mub@lemmy.ml ) 
    link
    fedilink
    arrow-up
    5
    ·
    1 year ago

    An effectively infinite power source. It is scalable for use in phones, cars houses, ships, factories. Obviously I can’t publish it because it would never make it through the patent process without me and anyone I know being disappeared.

    Yes I made one. Yes it works. No I’m never sharing it with anyone.

  • JillyB ( JillyB@beehaw.org ) 
    link
    fedilink
    arrow-up
    5
    ·
    1 year ago

    A method of optimizing parameters for manufacturing bearings. Specifically the raceway superfinish process.

    There are several machine parameters (oscillation speed, stone pressure, time, etc) that go into the superfinish process. The only output is surface roughness. I created a way to optimize for a low roughness. The best part was that once you set it up, you can just start printing out worksheets and handing them to engineering techs to get some more data collected.

    Before I did this, superfinish parameters were considered a bit of a black art and were only adjusted when there was a problem. This means they were always as bad as they could possibly be.

  • lungdart ( lungdart@lemmy.ca ) 
    link
    fedilink
    arrow-up
    4
    ·
    1 year ago

    I wrote an algorithm that could detect top talker trends from network flows. At the time it could reliably work up to 40Gbps depending on flow sample rate and your definition of reliable.

    Not sure if it’s in use anymore.