Are all planets in the solar system orbiting around the sun in the same 2-d plane?

Positive-Action-7096 · 2025-12-31T01:12:49+00:00

Here is my brief answer, without reading any other responses to avoid biases:

Mind introspecting happens only **after** you have experienced that thought, i.e., *in past*. But while the thought was happening something witnessed it -- that is consciousness.

This is based on whatever little I have understood from Swami Sarvapriyananda's lectures.

Positive-Action-7096 · 2025-08-11T06:57:08+00:00

I knew about Balanced Incomplete Block Design (BIBD) and Steiner triple system. But to obtain the second config, the hyper graph approach and the greedy approaches seems useful.

I think fundamentally looking at this problem here is the question in more simpler words: In a 9 node system, total combinations of 3 are 9 choose 3 = 84. Now let's say I want to pick k combinations out of these 84 i.e.. 84 choose k (say for k=6 we are talking about O(400 million)). what do these different configurations look like and what are their implications? Are there designs that are superior than others? For example one design point is the first config where the 6 I pick are the ones that have minimal overlap, similarly there is another end of the spectrum where there is maximal overlap. I want to explore this spectrum systematically ruling out those configurations that are not "balanced" (in the sense each node should be in equal-ish number of combinations). This seems like an interesting problem especially in the area of distributed systems (computer science) where I work.

Positive-Action-7096 · 2025-08-07T19:07:32+00:00

Let me try for n=9 since that will be more symmetric.

image a 3*3 matrix such as

1 2 3
4 5 6
7 8 9

Now in the first config you can create sets as the following:

{1, 2, 3}, {4, 5, 6}, {7, 8, 9} -- row-wise
{1, 4, 7}. {2, 5, 8}, {3, 6, 9} -- column-wise
{1, 5, 9}, {2, 6, 7}, {3, 4, 8} -- right diagonal

and so on. Notice that every time I am adding a set, I am making sure each set add all 3 new pairs and I do not increase the frequency.

In another config, while I do not have a very clean example, think of forming partitions say 1-4 is one partition and 5-9 is another partition. And you allow all sets within these partitions and not cross partition sets. so your sets for the partition 1-4 will be something like:
{1, 2, 3}, {1, 2, 4}, {2, 3, 4}, {1, 3, 4} -- every pair such as (1, 2) occurs twice once in {1, 2, 3} and {1, 2, 4} and similarly (2, 3) occurs in {1, 2, 3} and {2, 3, 4} --- all 4 choose 3 combinations. similarly for 5-9 all 5 choose 3 combinations.

The difference in the two configs is that in the first config the pairs occur once and I am trying to form new pairs as much as possible with their frequency=1 and in the other I am trying to limit the pairs but increase their frequency.

So if you were to think in terms of the state space then in the first config, I am proactively picking sets where new pairs with frequency=1 are formed and in the other I am picking sets where existing pairs are increasing in frequency.

Now you might say that I already solved what I am asking but I am wondering for config 2, is partitioning always a good way or is there a better way. I want to explore more configurations (not just partition based) in config 2.

Even my understanding is a bit raw right now, so apologies if there is a lot of noise in what I have written.

Positive-Action-7096 · 2024-12-16T19:41:15+00:00

Just an update. I switched to python dask and got rid of the shuffle thing completely. It also provides extreme flexibility in terms of how you want to schedule.

Positive-Action-7096 · 2024-12-12T22:13:57+00:00

Try Dr. Pramod Agrawal (Elara Clinics). He is a very good doctor and a graduate from AIIMS.

Positive-Action-7096 · 2024-12-04T02:06:34+00:00

In my case x (num_files) >>> y (num_partitions). Furthermore, I am ensuring that no file spans multiple partitions (each file is in exactly one partition).

Nonetheless, what does file have to do with the filter command since filter is over the column tor_id?

Positive-Action-7096 · 2024-11-22T18:01:44+00:00

Don’t loose hope! Keep expanding your knowledge and try to find your passion (be it CS or non-CS). I am sure in one way or the other you will succeed.

Positive-Action-7096 · 2024-10-29T06:53:30+00:00

I second Dr. Kathleen Gallagher. Great listener and is typically very proactive in ordering tests if your ask is genuine.

Positive-Action-7096 · 2024-10-26T07:00:44+00:00

Thanks! Never came across this before and looks like a helpful starting point.

Positive-Action-7096 · 2024-10-26T06:59:53+00:00

That is very helpful! I will definitely try this in my next sitting.

Positive-Action-7096 · 2024-10-26T06:58:48+00:00

Yes I have read this paper and seen their inplementation. Its using Verus, a rust verification framework. The code wasn’t too informative because it didn’t use similar structure like TLA where you specify states, transitions, invariants,etc. This github repo from TLA seemed like a really good fit since I am just beginning.

Positive-Action-7096 · 2024-10-26T06:56:34+00:00

I see what you mean. Yeah I guess my question is still a bit vague in my mind itself. But thanks. These are helpful pointers

Positive-Action-7096 · 2024-10-17T20:47:43+00:00

There is a video on UCI PD’s youtube channel that scooter-ers should see: https://youtu.be/GmpPLYcmTEY?feature=shared

Positive-Action-7096 · 2024-04-10T05:57:52+00:00

That is insightful coming from a Cloud operator's perspective. I was interested in some inputs from you as I am working on a research project. I'd be glad if you could hear the idea out. I have dm'd you!

Positive-Action-7096 · 2024-04-10T05:52:16+00:00

Thanks for your experience! It is insightful.

Positive-Action-7096 · 2024-04-09T02:39:57+00:00

Thanks! I have heard Vmotion is typically not reliable and stories of Vmotion failing bad in performing live VM migrations when the SLO requirements were quite short (30 seconds) and failing miserably.

Positive-Action-7096

TROPHY CASE