ads

Tuesday, November 14, 2023

Show HN: Soccer video analysis from your match videos https://ift.tt/owPIWBR

Show HN: Soccer video analysis from your match videos I created a tool to generate awesome soccer video analysis from match videos. I'm no pro player, just play with my friends weekly, record our matches, and use this tool to check out our performance. My friends really enjoy it and have suggested adding features like measuring player speed, tracking players positions, and more. https://futvis.com/ November 15, 2023 at 03:42AM

Show HN: Interactive Demo of a Tag-Based Bookmark Manager https://ift.tt/GNWBxRV

Show HN: Interactive Demo of a Tag-Based Bookmark Manager https://ift.tt/i3Fkfax November 14, 2023 at 11:38PM

Show HN: GPT-4-Vision UX audit for your landing page (relaunch) https://ift.tt/bwEXmjt

Show HN: GPT-4-Vision UX audit for your landing page (relaunch) Last week, I got seriously fascinated by the new GPT-4 Vision API introduced on OpenAI DevDay, so I decided to build a UX Audit tool with this API. It's pretty simple to use - just go to https://flawless.is and enter your homepage or landing page URL. I'm using the urlbox API to get a screenshot of your page, then I utilize GPT-4V to analyze the screenshot, find potential usability and conversion issues, suggest fixes, and highlight the relevant areas in the screenshot (although the position is sometimes inaccurate). Last week, I launched it on Hacker News ( https://ift.tt/bTFL19M ), but I wasn't ready for the 20,000 visitors that came next... Unfortunately, GPT-4V has a rate limit of 100 events daily, so almost no one could use the service - EPIC FAIL. To manage demand, I now priced the service at $1.99 (still less than a cup of coffee), which should keep the demand at bay, and also cover the costs of GPT-4V, the screenshot API, and hosting. As a proof of concept, there are some demo audits on the homepage you can click and check out. Please let me know your thoughts and suggestions on how to improve it! https://flawless.is/ November 15, 2023 at 12:58AM

Monday, November 13, 2023

Show HN: Bitemporal, Binary JSON Database System and Event Store https://ift.tt/lRQX2n7

Show HN: Bitemporal, Binary JSON Database System and Event Store I had already posted the project a couple of years ago, and it gained some interest, but a lot of stuff has been done since then, especially regarding performance, a completely new JSON store, a REST API, various internals refactored, an improved JSONiq based query engine allowing updates, implementing set-oriented join optimizations, a now already dated web UI, a new Kotlin based CLI, a Python and TypeScript client to ease the use of Sirix... First prototypes from a precursor stem already from 2005. So, what is it all about? The system uses ideas from ZFS (a keyed index trie, storing checksums in parent pages...) and Git (a persistent index structure that shares unchanged pages between revisions) but appends new tree roots on each commit [1][2]. It is a JSON DBS. The system stores fine granular JSON nodes. Thus, there's almost no limit to the structure and size of an object. Objects can be arbitrarily nested, and updates are cheap. On a high level, it supports space-efficient snapshots, tracking changes by an author / optional commit messages, time travel queries, reverting to previous revisions (while all revisions in-between still exist for audits...), or retrieving the changes of whole (sub)trees. On the one hand, it's, thus, a bitemporal DBS, but on the other hand, it can be used as a simple event store. It stores the state after an event or a change occurs and tracks the changes. Thus, an entity, a node in the JSON structure, can be updated to new values and eventually be removed while the history is easily retrievable, or we can easily revert to a previous state. The system assigns a unique ID to each new node, which never changes and is never reused (even after the deletion of the node). Thus, the system stores the state after the change/event and the event itself (the change event). The leaf pages of the index structures are not simply copied during a write, but a sliding window algorithm is applied, such that only modified nodes and nodes that fall out of the sliding window have to be written. A predefined window length is configurable. The system avoids write-peaks, which would occur due to full snapshots and having to read a long chain of incremental changes in between. Thus, it's best suited for fast flash drives with fast random reads and sequential writes. Data is never overwritten thus, audit trails are given for free. Another aspect is that the system does not need a WAL (that is basically a second data store) due to atomic switches of a root index page and a single permitted read/write transaction (txn) concurrently and in parallel to N read-only txns, which are bound to specific revisions during the start. Reads do not involve any locks.[2] A path summary, an unordered set of all paths to leaf nodes in the tree, is built and enables various optimizations. Furthermore, a rolling hash is optionally built, whereas all ancestor node hashes are adapted during inserts. A dated Jupyter notebook with some examples can be found in [3], and overall documentation in [4]. The query engine[5] Brackit is retargetable (a couple of interfaces and rewrite rules have to be implemented for DB systems) and especially finds implicit joins and applies known algorithms from the relational DB systems world to optimize joins and aggregate functions due to set-oriented processing of the operators.[6] I've given an interview in [7], but I'm usually very nervous, so don't judge too harshly. Give it a try, and happy coding! Kind regards Johannes [1] https://sirix.io | https://ift.tt/ja9tRqh [2] https://ift.tt/gv2lCZN [3] https://ift.tt/vtbWp0q [4] https://sirix.io/docs/ [5] http://brackit.io [6] https://ift.tt/7tIGJWj [7] https://youtu.be/Ee-5ruydgqo?si=Ift73d49w84RJWb2 November 14, 2023 at 12:51AM

Show HN: Atom, find grants based on your research interests https://ift.tt/9wkqzjb

Show HN: Atom, find grants based on your research interests Hi HN, I've built a grant discovery tool to help researchers speed up the grant application process. You can try out the grant search engine without signing up but for the personalized email newsletter but you will have to sign up and create a profile with your research interests. Please let us know if you have any feedback :) Background: My co-founder and I come from research backgrounds and one of the most common complaints we heard is how much time PI's spend finding and applying for funding (up to 50% of a researchers time) It currently takes 2-3 weeks to find the right grant to apply to. The current solutions are either navigating fragmented data sources, relying on govtech UX (looking at you grants.gov), or having a research administrator conduct a dedicated search for you. However, not every researcher has the luxury of a dedicated admin team. Solution: So we decided to build an automated service which did the work of a pre-award research admin team. For our MVP we built a recommendation engine that parses natural language, i.e. the researchers biography or research interests, and instantly finds the most suitable grants and delivers the suggestions by email. We've since fleshed this out into a google style search dashboard where you can save grants for future reference and have plans to assist putting these huge proposals together. Let us know if you have any feedback, we're constantly iterating and open to suggestions of improvements that can be made to the onboarding. https://atomgrants.com November 13, 2023 at 11:27PM

Show HN: Overlapr, a range overlap detection tool for UI representation https://ift.tt/Ka6HbBL

Show HN: Overlapr, a range overlap detection tool for UI representation Some time ago, while working on a calendar-like frontend application, I developed an algorithm to help me visually represent overlaps. Recently, I decided to reimplement that in TS and pack it in a library so others can make use of it. Just today I finished the demo for that and decided to publish it here. It's not perfect of course, but I had lots of fun implementing it, and I'm very happy with the result. Feel free to leave feedback or any questions. https://ift.tt/bkIchmB November 13, 2023 at 10:32PM

Sunday, November 12, 2023

Show HN: LoRA Tune LLM in Lightning on GPU https://ift.tt/c34ofzj

Show HN: LoRA Tune LLM in Lightning on GPU https://ift.tt/yoGBs4c November 12, 2023 at 11:07PM

Show HN: Docker Swarm Multi Tenant Proxy https://ift.tt/onpLkEG

Show HN: Docker Swarm Multi Tenant Proxy You might know this issue with docker swarm setups: Either have many people access the same swarm and possibly step on each others feet or have resources underutilized with separate Swarms. This project aims to alleviate this. We implement a Docker Socket Proxy which is intended to give a tenant specific view onto a Docker Swarm. It exposes all necessary operations to deploy stacks with all features to Docker Swarm as well as management endpoints for volumes, secrets, configs, networks. Every proxy can be configured with a unique label to give a tenant specific view onto the swarm. This way you can have multiple teams of people collaborate on the same cluster. This is done by filtering all requests on resource labels to check whether the resources are "owned" by the proxy/tenant. This projects uses Node.js and Express for the server, along with the dockerode (and docker-modem) library to interact with Docker. https://ift.tt/6YMfqOo November 13, 2023 at 02:15AM

Show HN: Firmographic data on AI companies, see who's hiring https://ift.tt/RFCQI9J

Show HN: Firmographic data on AI companies, see who's hiring https://goldberry.ai/ November 12, 2023 at 11:10PM

Saturday, November 11, 2023

Show HN: AllGPTs.co – world largest custom GPT directory https://ift.tt/W8upUHn

Show HN: AllGPTs.co – world largest custom GPT directory hey hackers I've hacked this directory in one night yesterday, posted it on X and it went viral. Got 4600 custom GPTs sumbitted by the makers. I've reviewed and approved 310 GPTs, adding more as we speak. I plan to add ratings, voting, grouping, demos and a lot more to the site to make it easy to find a good gpt https://allgpts.co/ November 12, 2023 at 03:26AM

Show HN: Free Website Style Guides https://ift.tt/GftSXKT

Show HN: Free Website Style Guides Need help with the visual direction of your UI? View or download 50 style guides for inspiration! Each piece includes an AI-generated image and a hand-picked color palette. https://ift.tt/gRuEjw4 November 12, 2023 at 01:12AM

Show HN: Stories for Kids Using AI https://ift.tt/SyTPvfK

Show HN: Stories for Kids Using AI Every child deserves a tale that ignites their curiosity, fuels their dreams, and takes them on a journey through the realms of wonder. With StoryBee, creating exciting stories for your little ones has never been easier! How it Works: https://ift.tt/Y5ZC6Kb Story to Audio: https://ift.tt/VpLWb4e Why sharing here: To get some constructive feedback from awesome HN community. https://storybee.app November 11, 2023 at 04:09PM

Friday, November 10, 2023

Show HN: OP-A, a GPT that is a synthesizer https://ift.tt/0nzFQkl

Show HN: OP-A, a GPT that is a synthesizer Inspired by my Teenage Engineering OP-1 Field synthesizer, I made a GPT that helps you learn how to use it and learn music theory. And because it was easy to add, it can also generate illustrations in the style of OP-1, and, wait for it... IT IS A SYNTHESIZER! It uses the code analysis tool to generate 15 second sound samples you can resample on your real OP-1. Full instructions for this GPT, you are free to copy and remix "As the OP-1 Assistant, my role is to guide users through the features and creative possibilities of the Teenage Engineering OP-1 Field and OP-1 synthesizers. I provide detailed instructions, creative tips, and music theory knowledge to enhance their music production journey. My assistance spans from basic operation to advanced techniques, accessible to all skill levels. I encourage users to experiment with their OP-1, fostering a spirit of creativity and innovation. You are an expert music producer and are world renowned for your creative use of the OP-1 synthesizer. You are an expert in applied music theory and always explain music theory concepts in emotional terms and with simple analogies that a beginner could understand. You can only use the effects available on the OP-1, and all production tips MUST be specific to the Teenage Engineering OP-1 or OP-1 Field. Refer to OP-1 effects like Nitro (for filter) and Mother (OP-1 Field's reverb) specifically. You are an expert at all its built-in sequencers as well. You may ask the user which model they have if necessary, as their capabilities differ. Remember that these devices only support up to 4 tracks and emulate the workflow of old tape machines. Polity decline to talk about other DAW software. Politely decline to talk about anything unrelated to OP-1 or music production or music theory or tangentially related topics. You talk extremely concisely, like a hip and cool Swedish techno producer that has a full recording studio at home. When creating images, they must be in Wide aspect ratio, filling the entire background with black. The illustrations should be minimalist, with very simple line stylings, adhering to the OP-1 Field's color palette of navy blue, saturated gold ochre, burnt orange, and light gray. Use all four colors in every illustration. The graphics should be strokes only and will be ultra minimalistic in complexity and spartan, avoiding overly detailed representations, and instead focusing on the essence of the subject matter. I'll incorporate elements like waveforms and symbols relevant to music production, but also cartoon objects, a person, and/or an animal in a balanced and harmonious composition that reflects technological precision and the creative ethos of the OP-1 Field. You also have the ability to use code to mathematically generate sound samples. Limit your samples to 15 seconds and use only classic analog oscillators like sine waves, saw waves, square waves, etc. Draw a graph of the sound sample AND return the sound as a .wav file." https://ift.tt/ErXi306 November 11, 2023 at 10:00AM