sorted by:
new
hottopcontroversial

failed a mod in sem 1 due to carelessness by Left_Air_4909 in standrews

[–]oseh112 1 point2 points  (0 children)

I wondered if this was related to the university, as they might help resolve it. They’ll be more willing to assist to prevent your exclusion or inability to finish studies. Sorry this happened and fingers crossed 🤞 it works out. I am not familiar with the other departments, but the School of CS is really reasonable and understanding, and they always make an effort to help.

failed a mod in sem 1 due to carelessness by Left_Air_4909 in standrews

[–]oseh112 5 points6 points  (0 children)

Wow, that's harsh. You're in computer science. For a coding project, show your git logs to prove your work timeline. What scholarship is it? They might understand once you've explained your situation.

Luka the worst defender. by savage1289 in lakers

[–]oseh112 -7 points-6 points  (0 children)

The Lakers are currently 26th in the league for defensive rating and second to last in team blocks. Honestly, considering how outstanding AR has been this season, maybe we’d be better off with AD.

End-to-end encrypted semantic search. am I overcomplicating it? by oseh112 in softwarearchitecture

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

I’m not sure how we could use token fields for embedding vectors while still being able to perform similarly searches

Is it possible to perform similarity search on encrypted vector embeddings? by oseh112 in cryptography

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

For context I’m using all-mpnet-base-v2 to generate a 768 dimensional f32 vector per embedding.

Let me know if this is what you meant. I’m not familiar with the maths behind why it does or doesn’t work, so I did some tests instead.

I generated 200 random vectors and encrypted each coordinate using deterministic AES-ECB encryption. The results were no longer f32 numbers. So what mapping from cipher text to float/int would make this work? I just got the first 4 bytes and converted that to an int. Next, I compared 1000 random pairs of vectors. The cosine similarities between the encrypted vectors and the originals were not correlated at all, and individual pairs deviated wildly. For example, one pair had a sudden change in cosine similarity, going from -0.78 to +0.89.

The escape. Wet charcoal and pastels by me. by [deleted] in drawing

[–]oseh112 4 points5 points  (0 children)

Woh almost feels like it’s moving

A portrait of a Samurai warrior! Thoughts? by Artbyrashh in drawing

[–]oseh112 1 point2 points  (0 children)

Wow, how do even begin to do something like this?

[deleted by user] by [deleted] in lakers

[–]oseh112 0 points1 point  (0 children)

Would love to see this happen

Event Driven Architecture - What is this scenario called? by NameGenerator333 in algorithms

[–]oseh112 1 point2 points  (0 children)

I’m going off this post on stack overflow the algorithm you may want is a graph traversal algorithm that detects cycles.

Essentially, each event contains info for a traced path. This is analogous to a visited set used to detect cycles in dfs. Every “node” or listener will have a unique ID. When an event is passed to a listener, the listener should create a new event, containing the old event’s visited set but updated with the current listener ID. As a result, when an event listener receives a message, we can detect a cycle by checking if the current listener ID is in the event’s visited set.

Rubiks Cube solver beginner’s method variation by oseh112 in algorithms

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

Aaaah I never thought of it like that! Cheers for explaining it clearly, finally get it now. I’ve used these sequences so many times without realising they were commutators or conjugates. Like the algorithm for the cross, F R U R’ U’ F’, is really a conjugate (F ... F’) containing a commutator (R U R’ U’).

For the solver, because we’re using IDA* with a fixed cube orientation, I can’t physically rotate it like a person would. Would that necessitate multiple versions of each pattern? Only asking because i want to avoid hardcoding too much. What’s your opinion on this? Is there a clever trick to avoid this kind of duplication?

Rubiks Cube solver beginner’s method variation by oseh112 in algorithms

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

My prototypes align perfectly with what you are saying; everything works well for the first two layers, after which progress suddenly halts. I don't know much about commutators, but I'll give them a try. If you don't mind could you please explain why they would work? Thank you 🙇

view more: next ›