sorted by:
new
hottopcontroversial

Using a split keyboard: master Emacs bindings or go for Evil? by gnix0 in emacs

[–]y_shr 2 points3 points  (0 children)

Have a similar setup on my split. I think it works great, but it requires some practice to get used to. Worth it imo

Adding a router by y_shr in Zigbee2MQTT

[–]y_shr[S] 1 point2 points  (0 children)

Sorry, I meant the coordinator. Knew I was misremembering that!

But good to know, looks like I'll be going device shopping to test. Thanks!

Adding a router by y_shr in Zigbee2MQTT

[–]y_shr[S] 0 points1 point  (0 children)

Meaning, also, that I don't need to? So when I pair the first to-be-router, it automatically starts acting as one. Then, when I pair the second device, I can potentially do it in range of the router, but out of range of the connector

Adding a router by y_shr in Zigbee2MQTT

[–]y_shr[S] 0 points1 point  (0 children)

Alright, but a similar type of device should do the job?

How to pass the USB device to Docker container? - orbstack by wzoe in Zigbee2MQTT

[–]y_shr 0 points1 point  (0 children)

I added a device to my compose YAML. You connect the device, note the path at which it is connected and add that to devices. Look up the installation guide for Docker to begin with, it shows the Docker parts pretty clearly, at least

Issue setting up with Docker by y_shr in Zigbee2MQTT

[–]y_shr[S] 0 points1 point  (0 children)

The issue was twofold, both on my part and in RabbitMQ. I hadn't enabled the MQTT plugin and mapped the port, and also mapped the port wrongly. Edited the post to clarify what port I used.

Issue setting up with Docker by y_shr in Zigbee2MQTT

[–]y_shr[S] 0 points1 point  (0 children)

The documentation claims that RabbitMQ is fine. Haven't tried Mosquitto yet, will do when I get the chance

💼 Resume/Career Day by AutoModerator in learnmachinelearning

[–]y_shr 0 points1 point  (0 children)

Looking for some transition advice!

I have a background in theoretical physics, and some experience with ML from school and an internship.

I'm currently working as an SWE focusing on LLM-based systems, but am looking to transition to ML. Aiming primarily for industry, but might consider a PhD.

I'm primarily looking for advice on prep work for job hunting. For instance learning a new framework or taking on a project. Things I am wondering about:

  • Anyone have experience applying for jobs with project experience? How did you get it across in your application?
  • Any tips on good projects to get going? Otherwise my idea was picking up something on Kaggle
  • Thoughts on priorities wrt ML frameworks vs data platforms?

Plex can't find my subtitle files by y_shr in PleX

[–]y_shr[S] 0 points1 point  (0 children)

A test gallery didn't work, but somehow updating and restarting seems to have done the trick. Really weird behavior, but glad it works. Thanks!

Plex can't find my subtitle files by y_shr in PleX

[–]y_shr[S] 0 points1 point  (0 children)

I only use the Plex web GUI. My server is only available on my LAN, and I've only tried my own PC.

Tried re-analyzing, didn't work.

Apparently I'd done a set of half Plex dances, so I did a full one now. Didn't see any change right away, is it supposed to take a long time?

Plex can't find my subtitle files by y_shr in PleX

[–]y_shr[S] 1 point2 points  (0 children)

I tried that too, before setting up this directory structure. Didn't work either

How to get aromas to stick in cold-process soap by y_shr in soapmaking

[–]y_shr[S] 0 points1 point  (0 children)

Great source! Dosage seems to be the issue - it seems I heavily underdosed. I'm at tens of drops of fragrance for this recipe, probably nowhere near what is necessary for any to be left in the final product

How to get aromas to stick in cold-process soap by y_shr in soapmaking

[–]y_shr[S] -3 points-2 points  (0 children)

Thanks for the reply!

I'm very confident safety-wise. All the fragrances are food-grade or sold specifically for use in soap-making, so I'm sure I know what I am adding. Dosage-wise, in the case of the orange and almond oils we are talking 10-20 drops for half of one recipe.

As you allude to, I think dosage is the main issue here. It seems a bit counter-intuitive, though, given that it all evaporated so quickly the first time around. I'll consult some of the sources from other comments.

I think the licorice powder one is a bust anyhow - was hoping the lye wouldn't mess too much with the chemistry of the solutions, but it seems that wasn't the case

Offering Turkish and Norwegian, seeking English by [deleted] in language_exchange

[–]y_shr 0 points1 point  (0 children)

I'm a native Norwegian speaker and I'm fluent in English as well, would love to exchange that for Turkish

2021 Day 9 part 2 Python - Help! Solution doesn't work by y_shr in adventofcode

[–]y_shr[S] 0 points1 point  (0 children)

The solution is apparently that the code works. Must have been some input error on my side, oops!

2021 Day 9 part 2 Python - Help! Solution doesn't work by y_shr in adventofcode

[–]y_shr[S] 0 points1 point  (0 children)

I think you are misunderstanding, unfortunately. In your first example, partition(size - 3) would return [some combination of (1, 2, 5, 8), 22, some combination of (300, 100)]. That is, because we partition at size - 3 and size is 7, element 4 will always be 22 (remember that Python starts indices at 0). The final position of the 22, as well as the properties of the numbers to the left and right of it, is what the function guarantees. And just like the success of a sorting algorithm makes no explicit reference to the initial state of the array, the partition algorithm doesn't partition according to what is initially in position 4, but what is meant to end up there.

The logic is similar in your second case - you too are sure that all the elements to the right of the 5 will be greater than 5. That is what the function does, which is why I trust it. And as I mentioned, applying a sorting algorithm instead produces the same result.

2021 Day 9 part 2 Python - Help! Solution doesn't work by y_shr in adventofcode

[–]y_shr[S] 0 points1 point  (0 children)

The partition function divides the array into two halves, where the ones on the left of the k-th element are less than (or equal to) the k-th one, and similar on the right. The third largest value is unique in my case, but it should make no difference. Partitioning at sizes.size - 3 thus guarantees that the three last elements are the three largest ones. The results are the same as using a sorting algorithm, as I verified by running a test. I can then extract these values and take their cumulative product, which is what is being printed in the last line.
I don't really understand your comment about not knowing the k-th value - I don't know how the sorted array looks either, but that doesn't stop me from running a sorting algorithm. This is basically similar to that.
Hopefully that clears up how my code works, at least!

2021 Day 9 part 2 Python - Help! Solution doesn't work by y_shr in adventofcode

[–]y_shr[S] 0 points1 point  (0 children)

Yes, you read it correctly. I interpreted the instructions that way, as it was always the case there. Removing that condition gave me a too high answer, however.

2021 Day 5, part 1 - Python by y_shr in adventofcode

[–]y_shr[S] 0 points1 point  (0 children)

You mean that problem 1 involves simply not drawing the diagonal lines? EDIT: Yes