Hacker News Board Hacker News, browsed like a classic message board
Live data from Hacker News

Ask HN: What problem are you close to solving and how can we help?

news.ycombinator.com

Post reply on HN
Print view View original

391–400 of 486 posts

Re: Ask HN: What problem are you close to solving and how can we help?

#391

Post by evandwight »

cdaringe wrote: post #315
evandwight wrote: post #101

I'm trying to make social media moderation more democratic and using that to decide fuzzy questions like "should this post be censored", or "is this misleading" [0]. While the crowd's answer won't be perfect it will help sort through a lot of the noise and feel better than the decision of whatever mod happened to create the subreddit. The problem: how can I make decisions based on a sample with a binary question. I t…

I worked on a similar idea last year. What I did was take urls to content, scrape the content, and pipe it through a machine learning a evaluator to apply various labels and warnings to content. Lastly, add some nice embeddable UI to surface the report. I got it to a decent state, but didn’t know how to propagate it or inject it into social communities. I wanted people to be able to tag it on Facebook, and it would r…

Cool! Was it supervised learning?

I feel like machine learning isn't at the level where it can tell if something is misleading, unless it's from a known sketchy source.

Re: Ask HN: What problem are you close to solving and how can we help?

#392

Post by cxr »

adriangrigore wrote: post #366
cxr wrote: post #360

Earlier quoted context omitted.

ES6 backtick strings.

I believe you misunderstand, I'd rather distance myself from the NodeJs ecosystem and use standard UNIX tools for developing web sites. I believe sh is great as a templating language.

I didn't say anything about NodeJS. (In fact, that would be adding a different dependency, not reducing the count by one.)

Re: Ask HN: What problem are you close to solving and how can we help?

#393

Post by felixhuttmann »

marcosdumay wrote: post #254

Yeah, this week I've restarted my scanning tunnel microscope that I'm failing to make work for years... The current one is a standard pair of long metal bars with the piezoelectric component on one end, with 2 screws, and a 3rd screw on the other end. My problem is that it doesn't matter how I design the thing, either the screws offer too little precision so I can't help but to crush the tip into the sample every tim…

Your STM is missing a proper approach mechanism. The vertical range of the piezo that is used for scanning will only be a few 100 nanometer. A screw is too coarse for that! Stick-slip mechanisms with a ramp (Besocke or Beatle-type STM https://www.researchgate.net/figure/1-Diagram-of-the-Besocke... or page 25 of https://www.bgc-jena.mpg.de/bgc-mdi/uploads/Main/MoffatDiplo...) are one solution. Even with such a mechanism, the 'approach' phase takes many minutes!

Re: Ask HN: What problem are you close to solving and how can we help?

#394

Post by minhmeoke »

graphcolorer wrote: post #219

I have a graph with weighted edges. I want to remove edges to make the graph colorable with N colors (e.g. N=40) such that the total weight of removed edges is minimized. If I'm able to solve this problem, that will complete a project I've been working on for years now to make a working keyboard for a person I know that has cerebral palsy.

Here is an algorithm that could work and run reasonably quickly, although it might not be optimal:

1. Find all vertices with degree N > 40 (eg: find all points in the graph with more than 40 outgoing edges).

2. For each pair (a, b) of these degree N > 40 vertices, find the set of common points (c) connected to both a and b by edges, eg: there exists 2 edges (a - c) and (b - c). In essence, you're forming V shapes (a - c - b) where the two tips (a, b) of the V have at least N > 40 outgoing edges.

3. Identify the pairs of vertices (a, b) that are connected by 40 or more Vs (eg: there are at least 40 pairs of (a - c) and (b - c) edges).

4. Remove the (a - c) or (b - c) edge with the highest weight. If (a - c) and (b - c) have equal weight, remove the edge which is connected to the node a or b with more outgoing edges.

5. Repeat steps 3 and 4 until each (a, b) pair has at most 39 Vs connecting them together.

At this point, I think you can color the graph with N=40 colors (one color for a and b, then different colors for each in-between point of the 39 Vs between them).

There might be a way to improve the criteria for which edge to remove in step 4 (maybe using the backtracking approach mentioned by other commenters), but this should be a decent starting point.

Re: Ask HN: What problem are you close to solving and how can we help?

#395

Post by thieu96 »

desertraven wrote: post #365

I find it hard to find communities for my ever-changing niche interests. I’m working on community discussion boards which exist at the intersection of interests. Eg. Mountain Biking/New Zealand, Propulsion/Submarine, Machine Learning/Aquaponics/Tomato, etc. The search terms for interests are supplied from Wikipedia articles which avoids duplicate interests and allows for any level of granularity. I find that key word…

this kind of sounds like reddit to be honest, is reddit lacking something you wish would be there?

Re: Ask HN: What problem are you close to solving and how can we help?

#396

Post by adriangrigore »

cxr wrote: post #392
adriangrigore wrote: post #366

Earlier quoted context omitted.

I believe you misunderstand, I'd rather distance myself from the NodeJs ecosystem and use standard UNIX tools for developing web sites. I believe sh is great as a templating language.

I didn't say anything about NodeJS. (In fact, that would be adding a different dependency, not reducing the count by one.)

So how would you interpret the ES6 backtick strings?

Re: Ask HN: What problem are you close to solving and how can we help?

#397

Post by mkl »

skoocda wrote: post #376
dzink wrote: post #227

Working to enable users of https://www.DreamList.com to record audio of any length and see it transcribed, ideally at the same time as the recording, while the recording is also saved. The goal is for grandparents to save stories for loved ones and not worry about quality of the transcription - just talk. When the recording is saved, the transcription can be redone or tweaked if needed later, but the memory is not lo…

I worked on this for a couple years during a previous startup attempt. I designed a custom STT model via Kaldi [0] and hosted it using a modified version of this server [1]. I deployed it to a 4GB EC2 instance with configurable docker layers (one for core utils, one for speech utils, one for the model) so we could spin up as many servers as we needed for each language. I would recommend the WebRTC or Gstreamer approa…

In my experience, Google's API completely fails when any slightly unusual vocabulary is involved (e.g. in this instance, grandparents talking about their past jobs), and tends to just silently skip over things. Amazon's wasn't much better with vocab., but at least didn't leave things out, so you could see problems. I don't have experience with any of these others, but I think for my purposes (subtitles for maths education videos) no one will have made an appropriate model yet.

Re: Ask HN: What problem are you close to solving and how can we help?

#398

Post by cxr »

adriangrigore wrote: post #396
cxr wrote: post #392

Earlier quoted context omitted.

I didn't say anything about NodeJS. (In fact, that would be adding a different dependency, not reducing the count by one.)

So how would you interpret the ES6 backtick strings?

The "obvious" way. (The same runtime that you're planning to use for the JS you mentioned in your original comment. https://news.ycombinator.com/item?id=28349504>)

Re: Ask HN: What problem are you close to solving and how can we help?

#399

Post by iamwil »

paulsutter wrote: post #157
iamwil wrote: post #153

What are the resources to look at for designing the architecture of a scheduling system (for coroutines/threads)? Would I first look at how Operating systems implement it? Or how VMs like Erland implement it? Same question for effects systems, where would I look to understand how they're designed and the trade offs for their design decisions?

Everyone starts with callbacks, moves on to coroutines, and eventually ends up writing polling loops. Can take decades for each person to work through it. Erlang's messaging may have potential as another alternative

By polling loop, do you mean like a while loop that checks a queue for work at a preset frame rate?

Re: Ask HN: What problem are you close to solving and how can we help?

#400

Post by adriangrigore »

cxr wrote: post #398
adriangrigore wrote: post #396

Earlier quoted context omitted.

So how would you interpret the ES6 backtick strings?

The "obvious" way. (The same runtime that you're planning to use for the JS you mentioned in your original comment. https://news.ycombinator.com/item?id=28349504 >)

And do the generation on the client side?
Post reply on HN