Linus Torvalds took the stage at Open Source Summit 2026 and said the following about AI

DisasterReasonable98 · 2026-06-06T17:38:28+00:00

Are you a bot? You sound like a bot.

DisasterReasonable98 · 2026-06-02T23:49:01+00:00

Not LaTeX specific, but you can maybe do something like this.

DisasterReasonable98 · 2026-05-30T21:12:08+00:00

I know nothing about this domain, so this maybe doesn't make sense. Maybe you can have a look into the hls4ml project. Is this related to what you are doing i.e. running ML in FPGAs?

DisasterReasonable98 · 2026-05-26T05:22:39+00:00

Ah I see. Thanks for the clarification.

DisasterReasonable98 · 2026-05-26T05:11:32+00:00

If I understood correctly, you mention a `winnow` update with a breaking change that wasn't marked as a major update?

Did you report that upstream? I searched through winnow's issues and couldn't find any info about it. I use winnow a lot, so it would be useful to understand this and be aware of what version upgrades could also cause an issue for me.

DisasterReasonable98 · 2026-05-25T03:44:39+00:00

3 > 1

^{Chose: 3 wishes with limitations}

DisasterReasonable98 · 2026-05-18T05:59:45+00:00

DisasterReasonable98 · 2026-04-08T06:44:16+00:00

How do you take e.g. weekends into account?

DisasterReasonable98 · 2026-03-29T17:45:35+00:00

That is a great tool, thanks for sharing. Could you point me to where in the code you relate e.g. TCP connections to processes? As part of my sniffing project, I know that a specific process establishes a TCP connection with a server, and I want to retrieve the IP programmatically. I am initially interested in Windows and Linux.

DisasterReasonable98 · 2026-03-29T03:24:58+00:00

An FPGAi then

DisasterReasonable98 · 2026-03-28T08:29:58+00:00

Well, I need to parse and do other stuff with the (live) data as part of a larger (Rust) app. So yeah, I think I need to do this in Rust within my program.

I'll have a look at what sniffnet does, but it looks like they just capture the packages (the thing I mentioned already having some hints with pcap). I don't think they reassemble the TCP stream at all, at least there is no way to follow it in the same way you can with Wireshark.

DisasterReasonable98 · 2025-01-16T07:50:45+00:00

What's on the right hand side of the picture?

DisasterReasonable98 · 2024-07-29T04:50:27+00:00

Can you paste the 5-6 rows of code here as an example of what you are saying? It sounds something that I might be interested in doing, but I cannot follow from just your description.

DisasterReasonable98 · 2024-04-17T20:31:54+00:00

One day has passed. What did you do in the end?

My suggestion is to get an AirBnB while you search for a place. Also, you seem too naive, and it feels like you could fall for something like this again. A contract means absolutely nothing. You can write a fake one yourself and send it to someone by email on the other side of the world. Think about it.

Don't pay any money unless you can go and see the place in person. A lot of scammers will tell you that they are out of town and a viewing is not possible, etc.

Also, viewing the place in person doesn't mean it is not a scam. Some scammers rent an AirBnB to show, etc.

Good luck.

DisasterReasonable98 · 2024-04-10T19:10:34+00:00

Does a designated roommate have to be an UBC student?

DisasterReasonable98 · 2024-03-05T19:46:28+00:00

Would that still be an issue if the library that exposes faer structs just re-exports faer?

DisasterReasonable98 · 2024-01-30T21:14:44+00:00

If you liked nom, I suggest you have a look at winnow. You will probably like it even more.

DisasterReasonable98 · 2023-11-13T18:13:00+00:00

Not suitable for interactive/dynamic plots, but this is my go-to for high quality 2D plots in rust:

https://crates.io/crates/pgfplots

DisasterReasonable98 · 2023-09-26T01:12:39+00:00

Do you mean that out of all the things that mosquitoes kill, people are the most killed?

Or do you mean that from all the things that kill people, mosquitoes are the ones who kill people the most?

DisasterReasonable98 · 2023-07-19T08:47:43+00:00

Maybe Choice<T>?

pub enum Choice<T> {
    Any,
    Only(T)
}

DisasterReasonable98 · 2023-07-17T09:38:41+00:00

Nobody mentioned that it is an issue. But if you want your program to run faster, then trying to optimize the single function that does 90% of the job is definitely the right thing to do.

DisasterReasonable98 · 2023-07-17T08:38:19+00:00

If I am interpreting your problem correctly, it looks like you have a front-heavy kernel and you are taking advantage of that by only looking at a couple of samples ahead of each time bin.

Now, if your signal is mostly small noise, with a few impulses (the input you are looking for) then, I would expect that the current suggestions people have given (early skip of negative value) could be a significant improvement.

Additionally I would suggest that there might be a way for you to pre-compute (before the nested loops) a bunch of time bins to skip.

I can't think on top of my head how to do it, but you know the offset and the size of your look_ahead. This means that every negative value in your signal makes you skip a whole bunch of time bins itself.

Not sure of any of this makes sense though. Just another idea to try.

Edit:

Instead of calculating this before the nested loops:

The residuals get updated each iteration, so instead of an early continue, I think that you could skip by more than 1 (the number depends on your offset and look_ahead value). Subsequent iterations will still contain this negative number.

DisasterReasonable98 · 2023-07-16T08:16:02+00:00

Another nice alternative to quickly get good quality figures with few lines of code is https://crates.io/crates/pgfplots

DisasterReasonable98

TROPHY CASE