Hey everyone, I am Akshay Ra and today I am going to talk about nearly optimal robust secret sharing against rushing adversaries. This is based on joint work with Pasin Manurangasi and Prasanth Nalini Vasudevan. Let me start this talk by recalling the notion of threshold secret sharing that was introduced in the seminal works of Shamir and Blackly in the late 1970s. In this setting, there is a dealer who has a secret message s that is n bits long. The dealer splits the secret into n shares SH1 up to SHn with some threshold parameter d. He then sends the IH share SHi to party pn. We want a threshold secret sharing to satisfy the following two properties. The first property, which is called the correctness property, requires that any group of more than t parties can come together, use their shares to reconstruct the secret s. The second property, which is the secrecy property, requires that the shares corresponding to any group of t parties reveal no information about the underlying secret. Threshold secret sharing is a fundamental cryptographic perimeter with numerous applications. Some of these applications include constructing secure multi-party computation protocols, designing threshold cryptographic primitives, constructing leakage resilience at good compilers and so on. However, the basic version that I defined in the previous slide provides security only against passive adversaries. In order to protect against the stronger malicious adversaries, there have been many strengthenings of threshold secret sharing that have been proposed. Some of these strengthenings include robust secret sharing, verifiable secret sharing, and the more recent non-malleable secret sharing. The focus of this work is on robust secret sharing. Robust secret sharing was introduced by Rabin and Benor in 1989. So it's just like any other threshold secret sharing scheme, satisfying both the correctness and the secrecy properties. In addition to these two properties, we require a third property which is the robustness property. Roughly speaking, this robustness property requires that any group of t-corrupted parties who might deviate arbitrarily from the protocol cannot force an honest party to reconstruct to a wrong secret. To give more details about the robustness, let's consider the reconstruction phase of the protocol. In the reconstruction, the parties start with the shares that was handed over to them by the dealer. We consider an adversary that could corrupt up to T of these parties. The reconstruction could proceed in multiple rounds and in each round, a party could send a message to every other party. The honest parties will follow the protocol whereas the adversarial parties might deviate arbitrarily from the protocol. At the end of the reconstruction, the robustness requirement states that all the honest parties output the secret S that was originally shared. Here we might consider an adversary that can either be rushing or non-rushing. The stronger rushing adversarial model allows a corrupted party to wait for all the messages from honest parties before sending its own message in a particular round. For applications related to secure multi-party computation, it is extremely crucial that the secret sharing is robust against rushing adversaries. The more formal definition of robustness is as follows. A T out of N secret sharing scheme is said to be T, N, epsilon robust is for every malicious adversary A controlling up to T parties and for every secret S, the probability that there is an honest party that outputs something different from S while interacting with A in the reconstruction phase is upper bounded by this parameter epsilon. One can think about epsilon as being the error parameter for the robustness. Given this definition of robustness, let me state a couple of observations. The first observation is that Shamir secret sharing is perfectly robust that is epsilon is equal to 0 when N is greater than or equal to 3T plus 1 and this follows due to the error correcting properties of Reed-Solomon codes. On the other hand, if an adversary is able to corrupt a majority of the parties, in other words, if N is less than or equal to 2T, then robustness is impossible to achieve. So the interesting set of parameters is when N lies between 2T plus 1 and between 3T plus 1 and the most challenging setting here is when N is equal to 2T plus 1. In the work of Rabin and Bernard also gave a construction of robust secret sharing when N is equal to 2T plus 1 with error parameter being true to the minus lambda. The share size of their construction was M plus order N times lambda where M is the length of the secret. When compared to the non-robust variant, there is an additive overhead of order N times lambda in their construction. So a natural question to ask is whether this overhead is necessary. A work by Carpentry et al in 94 showed that for N being 2T plus 1 and error being 2 to the minus lambda, any robust secret sharing scheme has to have a share size which is at least N plus omega of lambda. A couple of points to note about this result is that perfect robustness is impossible to achieve in this regime and furthermore, the share size of a robust secret sharing scheme is strictly larger than their non-robust counterpart. A long line of work followed and which has tried optimizing the share size of a robust secret sharing scheme to achieve this lower bound. I would like to remark that there are many exciting words that consider the setting where T is equal to half minus delta times N where delta is some arbitrarily small constant. However, in this setting, the lower bound of Carpentry et al does not hold and in fact one can obtain a construction of robust secret sharing with a constant overhead. That is the share size is M plus order of 1. However, the focus of this work is when N is equal to 2T plus 1 and in this regime the lower bound of Carpentry et al holds. Let me now give you details of the prior work on the setting where N is equal to 2T plus 1 and the prior work can be summarized in this following table. The work of Kramer et al in 2001 improved upon the Rabin-Penor construction by giving a robust secret sharing scheme whose share size is M which is the length of the secret plus O prime of N plus lambda. Here O prime hides polylogarithmic factors. However, the reconstruction complexity in the construction was exponential in the number of parties and it was only proved secure against non-rushing adversaries. A work by Savalos et al in 2012 gave a construction that had a similar share size as that of Kramer et al but it had an efficient reconstruction procedure and was proven secure against the rushing adversaries. In 2016, a work by Bishop et al gave a construction which had a near optimal share size of M plus O prime of lambda and it also had an efficient reconstruction. Unfortunately, it was proven secure against non-rushing adversaries. Last year, Fer and Yuan gave two constructions of robust secret sharing. The first construction had a share size of M plus O prime of N to the epsilon times lambda where epsilon could be an arbitrarily small constant. The reconstruction in their work was efficient and it was proven secure against the stronger rushing adversaries. They also gave another construction which had a near optimal share size with security against rushing adversaries but the reconstruction was slightly super polynomial. So, the open problem which follows from this long line of work is to get a construction of robust secret sharing with a near optimal share size with an efficient reconstruction procedure and with security against rushing adversaries. In this work, we resolve this question in the positive by giving a robust secret sharing for the case where N is equal to 2T plus 1 with security against rushing adversaries and the share size of our construction is M plus order of lambda times log square N plus log N times log N. Here, M is the length of the secret, lambda is the error parameter, N is the number of part. An interesting point to note is that even when restricted to the non-rushing case, our share size is better than the prior best known work by Bishop et al in 2016. Furthermore, our reconstruction is polynomial time and it only involves two rounds of communication. So, our work completes this table by giving a construction with a near optimal share size with polynomial time reconstruction procedure and it's proven secure against the stronger rushing adversaries. I would like to remark that in a concurrent and an independent work, Fair and Yuan gave a construction of nearly optimal robust secret sharing against rushing adversaries. When compared to our construction, the share size is slightly larger and the reconstruction requires five rounds when compared to our two-round reconstruction. And furthermore, the techniques used in both these works are completely different. In the rest of the talk, I would like to give you details of our construction and explain how we achieve a near optimal share size. But before we move on to our construction, I would like to explain the Rabin-Benhor construction and which serves as our starting point. So, let's take a look at the Rabin-Benhor construction. So, the Rabin-Benhor construction takes the secret S and first shares it using Shamir secret sharing to get n shares SS1 up to SSN. Next for every party and for every i in n, we choose a random MAC key and compute a tag on the ith Shamir share using this key. And the share of a party includes its Shamir share and the n pairs of key, tux. So, this can easily be shown to be correct. But in order to prove security, we need to be slightly careful. This is because the tag could reveal information about the shares of the other parties and it's not entirely clear on how we can prove the secrecy of this construction. To ensure privacy, we use what is called as a private tag scheme. That is the property that this private tag scheme satisfies is that the key, tag pair does not give any information about the underlying message. So, if we use this private tag scheme, we can prove the secrecy property of this construction. So, let's see how we prove robustness, but before that, let me explain the reconstruction procedure. So in the Rabin-Bennau reconstruction just involves a single round of communication. So in this round, each party broadcasts its Shamir share to every other party. Note that the parties do not broadcast the key, tag pairs and these are private and known only to this party. So, we now consider an adversary who can corrupt up to t parties and since we consider a malicious adversary, the broadcasted share of the corrupted parties could be different from the share that was given to them by the leader. Once a party, let's call it as PI, receives all the broadcasted shares, it just checks if the tag is valid. Note that it follows from the security property of the tag scheme that if an adversarial party has modified the Shamir share, then the verification of the tag scheme fails with overwhelming probability. So what a party does is that it just collects the shares for which the verification passes and does a Shamir reconstruction to recover the original secretness. Unfortunately, the main drawback of this construction is that the size of each share is m plus order n times lambda and which is very far from being optimal. So let us now take a look at our construction and let's see how we can improve the share size. The first step in our construction is exactly same as the Rabin-Penor construction that is we take this secret and share it into n shares SS1 to SSN using Shamir secret share. The second step is where we differ from the Rabin-Penor construction. Specifically, instead of choosing the key and computing the tag for every i and n, what we do is that for every party, we choose a random subset of the set 1 to n with size order log n and we call this subset as the watch list of this party. For every i in the watch list, we choose a random MAC key and compute the tag on the i at Shamir share using this key and the share for the party includes its Shamir share and the key, tag pairs corresponding to every element of its watch list. Note that since the size of each party's watch list is order log n, the overhead that we achieve in this construction is order lambda times log n. The idea of using watch list of small size to authenticate the shares goes back to the work of Bishop et al and is called as the local authentication paradigm. Specifically instead of authenticating every share, we choose a local random subset and authenticate the shares corresponding to this subset. Given this locally computed shares, the reconstruction procedure is no longer as straightforward as the previous Sahab and Pendaw constructions. So let's take a look at our reconstruction procedure. So as I had mentioned before, our reconstruction involves two rounds of communication and let's take a look at the first round. In the first round, the parties just broadcast the Shamir share to every other party. As before, we consider an adversary that could corrupt up to T parties and since we consider a malicious adversary, the broadcasted share could be different from the share that was handed over to them by the dealer. Unlike the Rabind Bin or construction, a honest party cannot check if every received share was modified or not because it does not have enough key, tag pairs. But what it can do is to check the received shares for those corresponding to its watchlist. So that is what the honest party does. So an honest party PI, for every element J in its watchlist, it checks if the Jth received share was correct, that is it checks whether the tag is valid or not. If the tag is valid, it labels the party J as being good, otherwise it labels the party J as being bad. In the second round, each party just broadcasts a set of labels for corresponding to parties in its own watches. So this is the second round of communication. Now at the end of the second round, every party has the labeled watchlist of every other party. Let me make a couple of quick observations. The first observation is that an honest party always labels an other honest party in its watchlist as being good. And this just follows from the correctness of the tags. On the other hand, if an honest party has a corrupted party in its watchlist and if this corrupted party has modified the share, then with overwhelming probability it labels that corrupted party as being bad. And this just follows from the security property of the tags. On the other hand, a corrupted party might choose an arbitrary label. It could label an other corrupted party as being good. On the other hand, it can also label an honest party as being bad. Furthermore, since we allow the adversaries to be rushing, the labelings of the corrupted parties can depend on the labelings of the honest party. So given these two observations, let's consider the graph that is restricted to the set of bad edges. That is, we remove all the edges that are labeled as good and we just include the edges that are labeled as being bad. So in this restricted graph, one can easily observe that the set of honest parties will form an independent set. This is because every honest party will label another honest party as being good. And it's not too hard to show that the maximum independent set on this restricted graph contains a large number of honest parties and contains only a few adversarial parties. So this just follows from the fact that the edges from the honest parties are chosen uniformly at random. So this gives a very natural approach to reconstruct the original secret. Just find the maximum independent set on this restricted graph and do a read Solomon decoding on the shares corresponding to this independent set. Since this independent set is guaranteed to contain a large number of honest parties and only a few number of adversarial parties, the read Solomon error correcting properties ensure that the reconstructed secret is same as the original secret. So this is the main idea. But unfortunately, in order to make this idea work, you need to find the maximum independent set on this graph in polynomial time. But recall that it's a classic result that finding the maximum independent set is NP hard on first case graphs. But what goes in favor for us is that this graph that is generated is not first case. And in fact, there are some random edges, specifically the edges from the honest parties are chosen uniformly at random. In spite of this favorable point, we do not know how to find the maximum independent set in this graph in polynomial time. But what we do know is that we can find a set S such that the set S has a large intersection with the set of honest parties and has a small intersection with the set of corrupted parties. Once we find the set S, we can like before do a read Solomon decoding to recover the actual secret. And one of the main contributions in our work is to find is to give a polynomial time algorithm for finding the set S. And we call this algorithm as the vertex identification algorithm. Unfortunately, I wouldn't have time to go into the details of this vertex identification algorithm. And I would encourage you to look into our paper. So this brings me to the last slide. So in this work, we gave a construction of a robust secret sharing with an efficient reconstruction procedure for the case where n is equal to 2t plus 1 and the construction had security against rushing adversaries and had a near optimal share sense. Some of the open problems that have been it to resolve are the following. So our share size has a poly logarithmic overhead over this factor lambda. So a share size is m plus 4 prime of lambda. And the question is, is this poly logarithmic overhead necessary? Another interesting open problem is to improve the concrete efficiency of a construction. So that's it. Thank you for your attention. And you can find the full version of our paper on email.


and welcome to the session. Today we will discuss the following question. The question says evaluate 1 upon 3 to the power minus 1 minus 1 upon 4 to the power minus 1 whole to the power minus 1. Let's see its solution. We need to solve the expression 1 upon 3 to the power minus 1 minus 1 upon 4 to the power minus 1 whole to the power minus 1. Now we know that for any non-zero integer a, a to the power minus m is equal to 1 upon a to the power m. Now this can also be written as 1 upon a to the power m. So here we have taken the reciprocal of the base a that is 1 upon a. So this can be written as here to get the positive exponent we will take the reciprocal of 1 upon 3 and the reciprocal of 1 upon 3 is 3 upon 1. So it will be 3 upon 1 to the power 1 minus same way it will be 4 upon 1 to the power 1 whole to the power minus 1. This is equal to 3 minus 4 to the power minus 1 that is minus 1 to the power minus 1.  Therefore minus 1 is the final answer for this question. With this we finish this session hope you must have enjoyed it. Goodbye and take care.


vlogmas day six we're starting off the vlog with some incredibly annoying bad news I'm currently barring my dad's Tesla because I don't have a car here and I'm home for a month and I just got two flat tires on the highway amazing and now they have to tell my car and I'm just trying not to freak out it's not my car I just feel so bad like I the thing is like there was like a tire pressure monitor error on here but my dad said it was a glitch and now there's two flat tire so I don't really know what happened but I just feel really bad I literally had a full day of plans to meet people and hang out with them but I think I have to cancel and it just sucks and I think I have to go back to my mom's because the car will probably be ready in Decatur tomorrow and that's close for my mom's and it's just really thrown a wrench in my day but I'm trying not to usually I'd be like in fucking tears right now like balling my eyes out and they're kind of coming out right now but it's gonna be okay because you know it's gonna be okay this is so stupid to cry over but I just get frustrated when shit like this happens because I don't know what to do but it's okay everything's gonna work out I'm meeting my friend for breakfast and I feel so bad cuz she's waiting in her car and I'm still gonna go because I still have to wait for the tow truck to come and everything so I need to get in a better mood because this is not fun okay perfect yeah okay cool thank you so much we got a lavender matcha freaking latte it's so good and this place is really cute but yeah just waiting for the tow truck team wait introduce yourself okay I'm Navia I have a model and I full-time nanny and I live in Atlanta so who are you signed with I'm signed with salt models or salt agency and then I'm also signed with CGM models and so we're taking pictures right now and she like taught me some modeling pose like hacks do you want to share them really quick yes so one thing I learned in modeling with pictures is elongating your body and yourself so they always tell us to like elongate our necks like this and then chin down that way your jawline looks sharp kind of just looks like effortless like you're not really trying and then when you want to look taller you kind of just like go on your tippy toes I feel like that's something that everyone should know and another thing we have so like when you don't want to smile and you kind of want to smile one thing that I do I feel like everyone's different but I kind of suck in my cheeks like like that and I just oh yeah but those are two things that I always do that's so cool yeah you just kind of look at you go I kind of want to do like a whole video like myth busting like my oh what my god modeling what's it called like modeling myth busting yes yes I want to do a whole video on that if you guys have any like specific questions if you guys are interested in like the modeling industry comment them down below and we will get that thing going because I feel like she has so much knowledge I definitely do yeah she was telling me all of this stuff like and I was like blowing my mind we were also talking about how we I don't know if this is like in every city but like in Atlanta they used to have these commercials all over the radio saying like do you want to be a Disney star coming for this audition and it was like like Barb yeah yeah I have a lot I have a lot so let me know if you guys are interested in that video and we'll definitely do that because I I would love to just hear more about the industry that would be so fun I feel like everyone would learn a lot yeah kind of know the insides of modeling and also just like to respect models more yeah like the thing she was telling me I was like oh my god like she has to pay for like getting her photos done like it's not like most of time she has to pay not as glamorous people think it is yeah and there's a lot of like investment at first right so it's very interesting so it is a lot later and there's not really much going on today but I ended up having to go back to my mom's house because they're taking the car to a Decatur shop and so she's closer to Decatur so I was like okay I'll just spend another night at my mom's house but I'm now with my friends I know me they were like my childhood best friends we've known each other since three years old yeah which is when I moved to Georgia yeah I wonder how our families met each other with your guarantee I think so we all wouldn't you yeah we all like we're really Georgia area we move when I was two from where oh Chicago okay wait were you born there yeah oh okay so and then she just moved to Chicago but now she and were you living with me or not yes like four months yeah yeah that's cool I feel like Chicago is a very cool city to like I when it's not winter it's oh yeah I was this winter I was just talking to my friend about like where else I would like even think about moving and I was like Chicago sounds cool like everyone always says it's such a fun city and I visited but I've only visited in the summer time yeah so I don't think I would make it through winter in January and so that was like in the thick of winter yeah and the sucky part is like okay even if you get used to the cold we're all the layers what sucks is the sun sets of 430 yeah but I feel like that's like everywhere yeah different cuz like the sun wouldn't even be out during the day really yeah not dark and you don't feel like in Georgia though you should see awesome when it's like sunny over the visiting January 14th to 18 my best friend just moved there too so we're gonna be there and then all our friend lives in Dallas do you need to stay at my place we I was thinking like maybe like a night or two at our friend place and then your place okay we just wait January when 14th to 18 okay okay remind me to put that on my calendar I'm excited wait you guys are gonna be my first visitors because Ryan Ryan has had his friends come visit well I think there's this one guy and then his mom and stuff no one's coming visit me we're like okay good yay I'm excited hey well we're gonna take a walk around this beautiful lake and we'll talk to you guys soon what's that thing where it's like here all the chickens or something we're about to decorate the tree we have an Indian movie playing right now we're watching Happy New Year so it's char o'conn and it's very cheesy also I have a chocolate orange and my mom picked me up from Kroger so I'm gonna eat this for my chocolate treat tonight and we're gonna do a little fire over here which is a really cool like vintage fireplace thing and it smelled so good last time we did it didn't really burn for that long but maybe we'll try to do something different this time I also forgot to mention that you're supposed to like bang it on a corner of the table so it like actually breaks into pieces because it's like literally in the shape of an orange like there's a bunch of pieces so I'm gonna bang it


Welcome to the skies over Colorado for November 2021. I'm Staff Astronomer John Ennsworth of the Cherrywood Observatory and volunteer at the Little Thompson Observatory for Longmont Public Media. In the news this month, the most massive white dwarf yet discovered has been studied. It's got a pretty crazy name there, I won't try to read that out. But it is near the limit of what our models say, a white dwarf can be, if it gets a little bit bigger, it could become a neutron star, just dump some more stuff. It is also the most compact, just slightly bigger than the moon, our moon, and it's actually smaller than other white dwarfs because of its very high mass. So it's kind of paradoxal, but when they're less massive they're basically more fluffy. I don't know if I'd call it a teaspoon of material that weighs as much as a mountain, fluffy but it is. It's rotating 6.94 times a minute. The space station went for a spin for a second time. A Russian thruster fired unexpectedly while they were testing engines of a Soyuz capsule. It had been docked there since April. The station turned by 57 degrees, which is pretty alarming because all the links to Earth through radio communication rely on those antennas lining up. They keep it really under control most of the time. A different Russian module rotated the station 540 degrees back in the summer. It was about one and a half revolutions, so I left it upside down really bad. So hopefully they can get control of their thrusters. Am I going to go into detail on the space 10-year plan? We'll bring some of these out as highlights in the future, but in three main categories, the Decadal Astronomical Community Plan centers on worlds and suns and contexts, new messengers and new physics, and cosmic ecosystems. There's a bunch of different things underneath that taking us up in the decades in the future. Pretty cool. Things like the James Webb Space Telescope was planned in an earlier version of this type of advanced thinking. Big star parties are fading out for the depth of the winter. I didn't until making these videos realize how they really do shut off around Christmas, but in December they were known listed. There's three there, Georgia, Texas, and Mississippi. So, November is Astro 101. It was asteroid observing, because we're going to send you out to try to find one this time. When you're looking up from your backyard in asteroid, they look like stars. They're not moving in that evening with respect to the stars, they just aren't additional dim stars. And they're probably better seen in binoculars or a small telescope, but there is a possibility of catching one naked eye.  What I do is I will take a look at the constellation around where I think it is, kind of figure out where I can see this candidate, make like a made-up constellation, including it, and then see if that made-up constellation, or astrism, would be a better word for it, is broken. One of these stars is out of position from what I remember. You could also sketch it, or take a picture of it. But these asteroids are in an orbit around the sun, mainly far between Mars and Jupiter. There are some out at Jupiter, there are some that cross Mars and Earth's orbit. I'm not looking at those. So these main belt asteroids have an orbital period of about three to six years. Because we are going around the sun once a year, we catch up with each asteroid about every 15 to 18 months. Because we are going faster, we're in an orbit closer to the sun than these asteroids, we pass them, just like watching a semi-truck in the right lane go backwards out your car windows. You pass on the left, we pass these things, and they seem to go backwards or retrograde in the sky for about 45 days before and after they are straight out from us, from the sun, so up at midnight on the meridian. About 50 become brighter than 10th magnitude, putting it within reach of a small to medium telescope. So the human eye can see ideally down to about 6 magnitudes, 6.5 magnitudes, in a very dark location, very good eyes, young eyes, and our experience of observing the sky, you might be able to push it below the 6.8 area, that's possible. But basically Vesta 5 should be visible. Here's an image, it's not how they look, this is from missions, to the asteroid belt, but you can see the relative sizes. Series is the biggest, Vesta is the next largest, but Vesta has a brighter surface. We get the sky above your backyard for this month, we begin the month with a new moon, you should see a beautiful crescent passing Venus in the early part of the month. Illumination, first quarter on the 11th, full moon is backed up from the 31st of October last year to the 19th of November now, and the month ends with a third quarter in the pre-dawn sky. Plants are a great place for viewing, just after sunset in the evening as Venus, just after sunset, setting almost 3 hours after sunset, very bright, brilliant thing, just can't miss it. Also after sunset you have Jupiter and Saturn in the sky, Saturn sets around 10, Jupiter about 11, so Saturn is the slightly dimmer one between Jupiter and Venus, over in the western sky. Neptune is high in the southern sky, setting at 1am, Uranus is just rising in the eastern sky in the sunset hours. Here's the below of the sun going down, I've taken off the atmospheric below, so it's going to be bright, having the sun close to the horizon. Venus, Saturn, Jupiter, Neptune and Uranus just rising. You need to set at midnight, all that there is is Neptune and Uranus, Neptune is getting ready to set in the west, and Uranus is kind of high in the western sky, Uranus past the meridian. In the pre-dawn sky, Mercury is very close to the sun, you may get a glimpse very early in the month, if you're looking into the orangey yellow twilight glow, Mercury will stand out in that case, Mars is too close to the sun right now to see, there's Mars right down there, there's Mercury, Mercury is brighter than Mars at this point, Mars is beyond the sun and the solar system, so it's pretty far away. We will talk about comet Leonard next month, but there is a comet, it's very dim right now, but it's going to be bright enough as it gets into the inner solar system. So on November 1st sunrise at 7.29, by mid month it jumps to 6.44 because we changed its standard time on Sunday the 8th, and by the end of the month, the sunrise is at 7am, sunset way early at 4.36, the sun sinks from 36 degrees up in the southern sky at local noon down to 29 degrees, I'll say local noon because it's not exactly noon, you have to take into account the earth going faster and slower, and it's not quite perfectly circular orbit around the sun, it's called the equation of time if you want to look that up, that would be a good thing to hit in a future month. So the future object is, not really an object, but we're going to look at the Leonid meteor shower, you get some meteors visible from November 3rd all the way to the end of the month, as a meteorologist I can also say November 30th is the end of hurricane season, so it's also the end of the Leonid meteor season. Peaks on the 17th, not too far from Thanksgiving, it comes from the source comet 55p Temple Tuttle, and it's best right before dawn after the moon sets this month, and you can get pretty good rates 10 to 15 meteors per hour. Your observing challenge is the asteroid series, and good with binocular it will not look like this, it's just going to be a single point of starlight, might even have a twinkle to it, because it is so small. Magnitude 6.7 at its maximum would be a good binocular object. Check back, like I said before, a couple days later to see if that whole thing has moved. It's small, 466 kilometers in diameter, and on December 1st it'll be 1.76 earth sun distances. So here we are, December 1st a midnight right at the end of the month. There's a series right up here in Taurus, so here's the V of the Hades star cluster, the bright orange star of Aldebron, which is the fiery red eye of Taurus, and we have one horn up here, one horn over here, the body here, and right above is the little star cluster, the Pleiades of 410 light-years away. So it's in very easy to recognize territory, and it's up high at the end of the month. Let's take a look at astronomy events in the near Longmont, the Longmont Astronomical Society on November 18th, and I believe this is just through Zoom, they have Professor Dolores Kipp, Starstruck Space Weather for Humans and Technology, 7 p.m. I don't see anything on their site, seeing that they've got their monthly star party planned, so check the site, maybe you can find something I did not. Little Townsend Observatory, public nights are still canceled through the end of the month. Check the websites for things like this video. The Estus Park Memorial Observatory is still operating under small groups and reservations, doing three openings a week. Check out the site for all the details. Northern Colorado Astronomical Society via some webcast method. Dr. Joseph, I'd say Pace, Monsters in the Universe, new insight into black holes. Sorry if I got the last name incorrect, November 7th. This planetarium reopened and has limited capacity and covered 19 restrictions. The observatory might be closed for the Thanksgiving Christmas period. I did not see anything there, so maybe they'll pick up when things pick up again in January. And finally, instead of featured software, since I kind of ran through everything that I've used recently, we're covering historical missteps in astronomy in about 30 seconds. This would be the Flat Earth, and basically there's a number of ways to take a look at the world around you to see evidence that the Earth is not flat. The moon is round, as are other planets. You can see them go through phases with curved shadows on them. Ships vanish over the horizon as they go downward from your point of view that you would not see on a flat surface. Different constellations are visible in different latitudes. That would also not be the case. You'd be able to get the entire sky if you didn't have the body of a round thing behind you as the Earth goes around the Sun throughout the year. You can take a look at shacks, shadows and sticks at noon and reproduce the Aristophanes experiment. Aristophanes way back in the B.C. E. years determined the size of the Earth within a percent. So there are websites where you can use data from high schools using this lab and some very simple trig to even figure out the curvature of the Earth that way. If you go up in the mountains you can see farther from higher up. That's similar to the ships on the horizon observation. The need for time zones and how they're distributed across the map would only happen on a sphere. The shape of the Earth's shadow on the moon is always round during a lunar eclipse and that can happen in any direction of the sky. As the moon is rising, setting are high up in the sky. It's always a round shadow. Gravity and the focal pendulum can be set up in different locations and a disk would have a different distribution and reaction to the center of mass of a disk versus the center of mass of a sphere. And of course if you just get high up into the atmosphere on balloons or rockets you can see the curvature of the Earth is curved no matter where you take off. If you have any additions or corrections, contact me at channelsworthhaggmail.com. This has been the skies over Colorado for November 2021. Keep hooking up.


What's going on everyone Sam here with Layton sports cards. We are doing a two-box a little mixer here for Brandon Oh, we've got a 2022 Panini Immaculate baseball first off the line and a 2022 Leaf best of sports So we'll start with your immaculate photo. Good luck here, man It's all one of the ones that's out of two pull like a wander out of two. That'd be pretty awesome I'd be in on a wander out of two be very in on that Very big time in on that. She got my second. Well, I try to finish spider-man All right, we've got a Jason Hayward 10 of 10 for the Cubs that is game war on the Hayward Nice one there grads on that brand We've got a Chipper Jones nice one there do this next patch is unreal This might be a top like three or five coolest patches. I've ever seen in my entire life This thing is insane How about for the pirates? Roansy Contreras Dude, look at the patch on that part of the pirate a of a Dude, that's so sick. Look at the patch there.  That's insane. That is an insane exactly Rosie insane patch That's so nasty. Holy cow. What's up, Greg? That's nasty. That is so nasty. I want to mag that one just because of that patch, dude We've got a Kevin Smith two out of 48 That's going to the it's an ace card right there Yeah, an eyepatch patch right there So true SG We've got a Brandon Marsh 3 of 10 very nice Take that for sure. Congrats on that one Brandon. That's the eye-black RPI Nice Marsh Yeah jinxed on the others exactly. Yep Literally yours and SG's came right back-to-back on our two streams On that one, Greg. We've got Matt Manning 24 out of 25. That is a two-color RPA Going to the Tigers while going to you of course Brandon, but it's a Tigers car Yeah, that dude that that Roanzee is insane man. That is an insane patch All right, best of sports now Brandon's done pretty well on these actually. I think it's the same Brandon that orders these Oh We've got 2019 Panini optics, I am Williamson PSA 10 Nice one there Congrats on that one. Nice Zion He's gonna be a stud lost to the Hawks last night That'll do it for your break there Brandon, thanks again for jumping in man. We'll get these right out to buddy. Appreciate the support


Well, here's this game.  When I walked in the GameStop and I saw this on the shelf I knew it was going home with me, but I didn't know what to expect from the actual game I mean look at this cover art. It looks like they had a photo shoot where they took one photo and just went with that one The full title for this game is my riding stables life with horses between the title and the cover I really don't know what to expect here, so let's just boot it up and find out well Immediately this icon on the home screen looks nothing like the cover of the game It doesn't even have the name of the game on it like most icons do alright alright. I'm still gonna give it a chance Let's go ahead and Did I say I wasn't sick I'm feeling it building back up the music looping on this title screen sounds like it was downloaded illegally from limewire in 2007 what is the bit rate quality of this music like for Okay, so we have story mode and we have instant mode and you guys know me I love a good story.  Okay, so we'll create a new profile I got a choice between a boy and a girl so I'm gonna do my best to recreate this broad right here That way it feels like I was a little less lied to also for some reason it's letting me use symbols in her name So I'm gonna put a question mark at the end Making her name Susan. All right time to pick my horse the best part of the game my life with horses So you would think naturally there's a ton of different breeds to choose from you know Yeah, yeah No, that's not it says there is but all it does is make the same horses character model Bigger or smaller if you ask me it's pretty poor effort for a game. That's all about horses. All right fine Whatever it really doesn't matter. I suppose I'll just make my horse look as nice as I can and then I'll call him Kevin With like seven exclamation marks so specifically Kevin from that one scene in home alone So from what I'm gathering here this stable is run down Then it's your job to build it back up as the whole point of the story mode and to do that You're presented with this list of tasks, which looks like it was made in Microsoft Word 2005 edition, but I mean what else do you expect at this point? Also that uh that terrible music from the title screen Yeah, that doesn't end that just keeps on looping throughout the entire game as you play. Oh Oh this hurts Next next next next come on nothing's happening the more I press next the more it loops I want to move on. I want to play the game.  It didn't actually go next on to anything It just looped the same menu over and over and you had to go back to go next We're making sense My life with horses Okay, I felt like I was splitting hairs on that one I'm gonna take a step back and I'm just gonna enjoy the ride from here. See what I did there Never mind feel it. It's coming back.   It's like the start of every walking animation starts with a little slide before she takes that first step What is she wearing Heely's? All right, fine. This is probably the one nice thing I'll say about this game. This area is at least charming like it doesn't look terrible. It's not offensive to me It's kind of cute. Yeah, I mean, it's fine. That's pretty much the only nice thing I have to say about this game so far. So I guess I'll start by checking this house. Oh Geez man, come on get into that room on the right just turn into that freaking room Come on, man. I just can't with these controls. Okay. Finally. I'm in the room. Hope it was worth the trouble I have a bed. I can sleep in and I have a wardrobe. I can change my clothes. Well, I'll be I guess move over Red Dad Redemption I have a new camp to stay in and by stay in I probably mean literally since I had so much trouble getting in the room What are my chances of getting back out of it? Actually, I figured out that walking backwards in this game is a lot easier than walking forwards Like it might look like I'm trying to get up these stairs, but in reality I'm just trying to turn around and leave this house. Okay So in this area I can do mini games with the horses like this one I have to stop the horse when it gets to a checkpoint. It's the closest thing to a game I've played so far, but it's hideously boring. All I have to do is press a direction and then you guessed it Let go when I'm in the checkpoint. This first one I nailed because I mean how hard can it be? When you turn the horse left and right in this area, there's no animation for the horse actually turning around It just flips the JPEG image of the stupid horse. It looks ridiculous It reminds me of the way that old YouTube series Charlie the unicorn was animated Shun the non-believer Shun Weirdly now this mini game has become impossible Whereas before the horse stopped on a dime now when I let it go It walked half the circle before it finally decides to slow down and come to a halt for the life of me I could not hit this checkpoint a second time and I do not care enough to try anymore I spent way too long trying to find my horse, but finally finally here He is tucked behind this corner now the excitement can begin now the riding side of it comes in the place surely if I can Just get up on the back of the horse here if I can just if you can just stay still for a second there Kevin I'd appreciate it if you just want to stop moving every single time I try and Kevin Kevin Kevin end of the day What is this on my screen? I have a new oh, I guess this game's on a day and night cycle And it just restarted the day on me putting me back inside my room It's fine try this one more time Apparently I couldn't ride Kevin here because he's a dirty boy literally look at his hygiene bar.  I Guess the next part of this game that you can actually call a game is cleaning up old Kevin here If you thought the mini games from before were boring It gets better in this part of the game you just use that a long stick in your drag a brush over horse parts This takes Way too long, and then you have to clean each one of his hooves individually. This is the most fun I've ever had in a video game Considering how long it takes to clean up your horse They could have worked on a longer idle animation for the thing it resets every few seconds And it's so painfully noticeable when you're stuck here doing this for an hour Oh It's fine my horse is clean and the saddle is on he's got flowers in his hair, and he just doesn't care It's finally time finally time to go ride Oh, it's getting better already. We have a brand new music track to listen to I mean It's pretty much the same crap, but it sounds just as bad, but it's different Don't mind me. I'm just looking for gold or a different game just something that was worth my 30 bucks So the riding part of the game which for some reason I thought would maybe be a free roam I just get to ride my horse around no It's actually on rails and all you have to do is time your jumps over these hurdles That's the game, but it gets even worse. So you span the a button to go faster, which is fine I'm good with that But you're also supposed to hit it left trigger and right trigger at the same time to jump these hurdles But no matter what I do I cannot jump one of these freaking hurdles I've tried everything in my skill set waiting until what feels like the appropriate time before pressing and then I try pressing it a Little bit earlier than that and then I tried pressing it at the wire to see if it's a split second thing I didn't do anything. So I tried riding a little slower.  This is a children's game Why can I do this? What am I missing am I pressing the wrong buttons? I've tried everything. I've tried motion controls Nothing seems to work What makes this even worse is when you fail three times in a row It doesn't just put you back to the start of the race No, it kicks you out of this entire part of the minigame It throws you into a loading screen and puts you back in the stables You have to awkwardly try and turn the take controls around or walk backwards into the icon to start it again Sit through another loading screen only to fail three more times because the damn thing isn't registering any jump I try and make I can't take it anymore. I just gotta pause the game. I gotta walk away. I should say Wait a second, did I just see What So when you pause the game It doesn't actually pause the game as a whole the games ecosystem doesn't come to a grinding whole instead I guess it just freezes the horse in place the horse stops moving But everything else does like you can see off to the left here. The grass is still moving But what's freaking hilarious is they didn't freeze the animation of your character riding the horse So every time you pause the game while riding the horse.   There are some terrible games out there WWE 2k 18 trollin I and of course Oh, there's a lot of competition so to truly claim that this is the worst game. I At least have to finish this all right last attempt I'm gonna give this everything I've got to try and clear a hurdle don't mess up Don't mess up. Don't mess up. Don't mess up. Oh, no, it's like myself out I I pressed it when the actual icons came up on the screen way too well wait a second wait Wait a minute. Okay, so it turns out you're supposed to press it as soon as it shows you the icon depressor on the screen Even though it's way sooner than the actual job. I'm not kidding I can press this put the controller down and still have it jump Did anyone play this while it was in development and did anyone care? This is supposed to be a game in the one part that's supposed to be enjoyable where the only game mechanic is jumping over these hurdles You have me lock in my jump beforehand so it auto registers when I get to the fence.  Okay, well wait, can we just stop the video for a second and rewind the take? Oh Man, I hate to break the fourth wall But I'm editing the video right now and I'm seeing this for the first time Looks like there's a split second during some of these jumps where her legs snaps upwards towards the sky I'm sorry. I don't know if it's because it's 2 a.m. Or because I've been editing this thing for way too long I'm losing my mind over this is All right, whatever back with the video. Oh, I can't believe this next part Oh now that I know how to do these jumps as soon as I passed that last hurdle That would always get me and I couldn't make my way past it because of the three failing system as soon as I passed that hurdle The game starts to chug big time and I don't know why because there isn't much happening on this screen right now It's not that intense of a game Especially when all your animations loop every two seconds the game doesn't have to process much and yet it still Manages to slow down to a crawl Look how slow the horse jumps over these hurdles and I am not kidding They have actually removed my ability to go faster at this point You know how earlier on that first stretch I could spam a to go faster Well, even on long stretches of path in this part of the game I can't go faster anymore because the game knows if I was able to go any faster than this It would probably just crash and burn my switch would blow up and my house would melt down This game can't handle going any faster because it can't even handle going at a trot Can you imagine if it tried going at a gallop? Oh, no, that's it. That's it I finished and I don't and I don't just mean this race. I know I mean I am finished with this I I don't never want to see this again. I never want to touch this again I never want to even think about this again. I'm hesitant to even say it's the worst game on the switch because it's not a game I don't care what anyone says I know there's bad games on every system and I know that switch has its fair share of bad games Heck I reviewed a few of them, but this is the worst I can't even say it. This is the worst thing on the switch and whatever anyone says they're wrong This is the worst thing on the switch and I'll let you know when that changes I feel dirty. I feel like I have to shower I'm all sweaty if you thought kevin's hygiene levels were bad Just count yourself as lucky that you can't see mine right now If you enjoyed this video, make sure you have the lip all over that subscribe button Click the top on this video right here because I'd appreciate it


Next up would be game theory to the rescue when hard decision are to be made So ladies and gentlemen, please welcome our next speaker like Sander handoff Probably wait until the talks finish, but thank you anyway Okay, I'm going to talk about game three obviously today. So Let me introduce yourself and myself. So in my day job. I develop and I consult so I'm Moving vertically through thing and I review technical solutions and we work on higher bringing high-tech startups Together with bigger companies if they have something that helps both companies. So that's what I'm doing the daytime if you have a challenging High-tech startup talk to me. Maybe we can help you And also I'm one of the organizers of the conference here program chairing I'm also active in the MongoDB community I'd like to talk and if you have any comments questions feel free to ping me on Twitter later Game theory We will only be able to stretch the surface of game theory Today, so there won't be no coding few last chance to leave now and I hope I can give you an idea about game theory because it's it's a little bit alive beyond if Else else if it's it's it's a glance into a different life a little bit I stumbled across using it just like by coincidence at the beginning of the year while actually the call for proposals were running and Yeah, people seem to like the idea unfortunately, so I mean game theory is Very human concept. It's not tech. It has a background in economics and philosophy and and I think you can imagine yourself like our world is getting much more hectic complicated so many options decisions and we are required to To make decisions all the time and sometimes this can be really difficult or stressful and And we very often worry did we do the right make the right choice? um Did I pick the right Pokemon to win the next? challenge So little knowledge of game theory can come really handy not only coding life solving some problems and Yeah, it's about making the best decisions you can but Probably not only best decisions for yourself Also of the best decisions for you and the people who surround you We'll step into that to that later. So Just think about how do you make decisions? How do you make judgments? Do you really note down like the pros and cons and wake them up? Some people do Some people don't they very much rely on their stomach as we say in Germany so Think about do your decisions affect others and Do you care about it? um and And that's supposed to be game theory is is going you have to anticipate the decisions that others Do while you're interacting with them and how they impact you and how your decisions impact the others and Yeah, this is basically like the basic idea of a game free and Actually, I stumbled across it For one client we were we're getting messy accounting data in from some very popular online platform for videos and We we can Check what the what's in there look like sometimes they just make match for some word stuff We don't really know and we try to account to the people who gave the video material or audio licenses and So if we could do it manually, but it's it's like really a lot a lot of data We would be like many people and not effective because we are it's a it's really a penny accounting business and So we also use like systems like for example like elastic search and we are the elastic search Who knows elastic search? Yeah, most of you so you know you can also like get a probability back on the quality or the results you get so how you get some indicator how Elastics are things how accurate to result us and so we have we have something to work with so but We have a like also like customized systems. We can look directly in the database. We have some some funny search stuff I don't want to go too deep in this but just like I was really stuck like in the combination of all okay I've all these expert systems. I can ask and Probably one expert system will improve my input and if I put it into me the other expert system I can even get better input and so I Was getting really confused like and So I thought what about game theory because I can't really use is else else is then To really solve it and so I remembered game theory and gave it a try on So let me introduce you a little more into game theory And I hope it will help you to make decisions and your coding or whatever Problems you're facing or like basically maybe just in your life or maybe even better in your life so game theory very often if you see a picture about game theory you will see chess and Yes, but it's actually a very bad example because it's game for you about playing games No, again, you can leave if you thought this is a game talk It's not about playing games it's about interactions between humans which we can also like Pretend it's it we can basically Imagine it's it's also like a game like simplified version of Interactions we can regard this as a game and we know games like chess or go or tic-tac-toe but They are that deterministic on every player knows at every stage of the game Everything you see you can see Everything basically it would be like playing poker with all cards on the table all the time and basically, it's just like You can calculate all possible results Yeah, of course, we don't because our brains are not capable and even computers are not capable of calculating all the results imaginable for all and for each and every move in in time so It's Imagine like game theory having all the cards on the table If the inform it the information is not not sorry It's not having all the cards on the table. Some information might be hidden and is there a way on to determine how you Still can Evaluate chances come make build up basically build up a strategy and basically this is what I was doing Then as a as an eight-year-old I believed I will win chess against the partner of my mother If I just chose the right color in the beginning After I lost many many games. I came to the conclusion. That's not the case. It's very unlikely but I Think like the average chess player is also trying to find a strategy and Anticipating what the next moves of your opponent might be although you can basically calculate each and every possible result You're anticipating what your player will do. You're anticipating his strategy and this Getting us a little bit closer to game theory and game theory was not just like invented um Overnight um, let's have a little glance into Game for your history. Oh, it was like first mentioned this goes back to the 1700s on Wargrave letters the guys from Britain, um, there's a French guy who Wrote a paper on a leading in the direction um and Then in the beginning of the 20th century things start to pick up with Zermolo Zermolo, um, über die Anwendung der Mengenlehre und die Theorie des Schachspiers Which actually can translate about how applying Set to your feet set theory in chess games then Then in the 19 Late 1920s The thing starts to really pick up with a paper from Hungarian Scientist John von Neumann. I think he moved to the US later and he wrote another paper to a theory leg is as of spiele, which is about like theory in board games and This paper got noticed a lot and in 1944 he published a book co-authored with Oscar Morgenstern theory of games and economic behavior and so we see already um The game for your thing is very close to economics and usually We think economic and people caring about economics. Oh, that's just a soft business. It's not like programming is much more better So um, we don't probably look into theories there And the the challenges is can we build up a mathematical model? Can we basically analyze or calculate results of of people's actions on the decisions the players might do and Basically, that's probably most famous thing in the 1950s It's like the prisoners dilemma dilemma and John Nash came up with the National Equilibrium And Yeah, it's very famous because like John Nash's life was a beautiful mind movie So he's very popular and by the way, this is a picture of John von Neumann. They're Hungarian scientists so background game theory is in economics political science and psychology Uses as well in logic computer science by largely with biology and poker Um, it's an a mathematical approach to real-life simulations There are situations that involve two or more decision-makers and Each decision-maker you for example Has a number of different actions they might take And the ultimate outcome does not just become depend on your actions It also depends on what the other people do So you are forced to think and come up with a strategy And this is basically so let's start with a really simple game this Something easy and practical. It's called zero sum game and the zero sum game is the winner takes it all and The other's game is the others lost and I'm really happy so many people and it's so crowded because I would like to play Two-finger Mora, so please partner with the one on your right Yeah, sorry, sorry, sorry, I thought you can go from lunch and have an app on sorry now So two finger Mora is a very simple game pick a partner and You basically Your child you have two choices show one finger or two finger and You have to decide who is the even player and who's the odd player and then just like as rock and scissors you Play with your partner and you show your fingers at the same time and if the result is Even even player wins and the result is odd or player wins. So you basically have 50-50 chance. So and you have five minutes, and I will be back once you have the results Yeah, oh you did a simulation Okay Five minutes was a joke. We're enjoying this Okay, we continue now It's good to hear you all have fun with I Didn't imagine this simple game would make you so lucky Okay, but basically What would be like a mathematical representation of what we were just like doing? that we call this like the strategic form and basically Yeah, that's like what we call the strategic form and So and this is also like the basis one can calculate on with like these matrices So, um, zero some games one winner one loser. It's a very competitive and this is a Another nice way. Um, it's called one zero some games it's more about synergy and everyone games on For example, like doing the same game in a little bit different form So let's do a non-zero same game, but please don't get as excited as Only 15 minutes left and I have to get you to prisoners dilemma is my goal So let's play a positive way of this thing. Um, let's do the same game, but Similar game, so if you show the same Counterfingers each of you gets two points and if it differs you only get one point and this is basically About more about cooperation You want to give it try? No, I think everybody can imagine So, um You have the idea so you can like interactions and this is like very simple interactions put into a matrix and we can work with that There's is there are games with perfect information as I mentioned chess go Tecto so everybody knows about everything and all the options and outcome for the other players and there are games with incomplete information basically life so Yeah, that's like the two and As next just like the classic game theory on thing is the prisoners dilemma So what is the prisoners dilemma? The prisoners dilemma imagine they're like two criminals They're already with the police the police has caught them and Imagine having them in two rooms in the police the strength In our police headquarters and they're being interrogated interrogated and the dilemma is Each of the two criminals does not know how the other criminal will decide so If you know if you cooperate, I mean if you ever have seen one of the US or Series they say if you cooperate or we can make a deal with the DA and Yeah, you can guard you will get free. Yeah, so the thing is that you know if you cooperate You might get free. You don't get any sentence but what if Your colleague your criminal colleague your co-operator conspirator also is cooperating Because then both are cooperating and it's not that all the criminals cooperating. They're just like saying yes We did it. We're so sorry and everybody will get free. Of course They will might they will both get a sentence a reduced sentence. Yeah on that and the other outcome Of course is just stay quiet and probably the police won't be able to prove anything or Probably open like only like a minor crime And then you might only end up with like a one-year sentence and This is the prisoners dilemma.  Yeah, okay, we'll get some sentence, but not to the full crime You probably might only end up in prison for one year and how can you actually? Decide because there's two there's a dominant strategy what we call in game theory. It's a dominance So what what's always the best outcome you should choose and? actually confessing is because You either go to jail for one year or five years, but never for 20 years, so this is the best choice and And also confessing is only the only strong Nash equilibrium In the game and in the equilibrium is basically When there are no more gains for no one in being in the games so basically Nobody wants to take any action because he can no longer gain from it And this is of course in this simple game. This is just like a one round, but just like imagining There's more criminals involved like a gang of five and you have to think about over to the other four People decide on and it is a completely different game because probably There are a couple. They're very close and they won't never will give each other up But if it's just like some random guys you met on the street arm and you fought the gang to break in You might Tend to decide. Oh, that's better confessed because I don't trust those guys and also I don't want to be a part I can be apart from them, but you don't want to be apart from your Girlfriend or boyfriend for a time. So this is where things can get complicated and How can we calculate stuff like that? We can use algebra. There's many approaches Bayesian Nash Equilibrium we can do just like Monte Carlo city simulations to to get some results and Yeah, and there's some material you can look into There's a Python tool called gambit You can just play around with and think that there's a really nice blog post from a biologist Martin Jones at evolving strategies For an iterated prisoners dilemma tournament I think it's very descriptive with outcomes and everything. So I had really a lot of fun reading it while doing research for this talk and there's also From Stanford on cause there are a game three course from Matthew Jackson, which I think it's really good. I'm very well taught stuff and Yeah, I I hope I was able to give you a glance into Game theory a little bit different approach on thinking And yeah, I hope you had a good time and if there's time left. We can play some more to finger more Yeah, okay. Yeah, thank you. It's chance. Yes Hi, okay. So first, thank you very much for the talk. Can I ask you that you go back to the slide where you have the matrix? Yeah So Here it's very clear. I just pick up a little bit. I hardly can can hear you. Okay. Yeah so here I think it's very clear that the optimum for both if the Go is that they both serve minimum sentence is that they both keep quiet But you said that the Nash equilibrium is basically that if they both would confess Yeah, basically, let's like that. That's the best strategy is to confess why because there's no better strategy not Confessing but the thing is you can calculate like I mean, I don't understand certain drop you why you would prefer Being in prison for five years instead of one Sorry, I don't I don't understand why you would prefer being in prison for five years Instead of one. I mean, I know they have good food No, the thing is you don't know what the other one does that's the problem. You don't know what your partner decides on That's the whole trick of game. That's a thank you for the question. That's the key You don't know what the other party does Yeah, and so you make you need to make a decision on basically What's the best move, but you don't know? That's why that's why this is that's why this is the dominant strategy it minimizes your loss You will never go to prison for 20 years if you confess So like this place like the minimum is the maximum you can So basically if you would keep quiet, you would basically risk very higher penalty Yeah, basically if you can quiet, okay, that's a higher bet. I mean you if you know, it's yeah So first of all side note, I think it's interesting how people standing up and being very loud Kind of is the tragedy of the comments so another game theory concept But my question really is were you able to solve your data problems using game theory? I was yeah I was able to improve it Because like the thing is when when when do I end like like putting like the information Into the next system to improve it. So basically I didn't mention in a talk because it was a little deeper You can also define a threshold and if you know like the gain will be minimum And I think I remember it was like 5% or so so if we say we are we think the information is 95% accurate and After like also like a threshold of iterations, so it won't go on forever I mean if you just have one letter we might never we will never get a real result That's that that's the two things. Yeah, you can do the threshold easily you say like okay Percentage on probability or like iterations and then just like take the result as is it was very good for improving and interaction on multiple systems We have a few more questions. We don't have much time. So try to be short. Okay, this is done We have one question here Have you used the Python axle rod? No, no, I haven't used it, but I've seen it online during your reflux. Have you used it? It was developed by a friend of mine at Cardiff. Oh, yeah It's been very interesting in kind of raising interest in Python programmers in the in the dilemma, but I just wanted if you Had a strategy in the tournament No, actually like actually I was quite surprised because I thought when I when I Did research on When I was trying to solve the problem. I was doing I just thought okay Python game free area I expected like at least ten libraries and the result they were hardly any So it was quite surprised because usually there's a Python library for everything in life So yes It'd be great if we could pick up on the like helping and building stuff like that and also like Just like add game theory to our tool set of thinking when we're trying to solve problems because I know from like at least I feel being like Programming a lot You tend to think very deterministic. Yeah, this is the truth This is the end game fear opens up your mind to be a little bit more flexible finding a practical solution Very well, we are out of time. So let's thank the speaker


Lime ninja on rumble.   They're Nazis. They go, oh Exactly she's talking. Come on.  They're giving standing ovations to Nazis They're funding Billions of dollars hundreds of billions of dollars to Nazis to wage war on Russia Do you recall your World War two? Who was fighting against Russia in World War two?  What do you do with these people? You show them on your computer here Canadian government giving standing ovations to Nazis like none. Do you see? Bravo, you inspire me to cook at home and eat from herbs from home I bought a mint plant nice mint is the best. I always grow mint But I have 89 chicho. Can I grow tobacco plants in my house or do they need to be? I've never grown tobacco inside. I start the seeds inside, but then I put them outside So I've never tried inside.  Oh, dude do a search if you can find it even the Guardian and Western corporate media in 2014 wrote there's one article says Ukraine has a Nazi problem like even the Western media Propaganda's that refused to acknowledge it now or last for the last five years in the early 2010s They were writing about Ukrainian Nazis full-on like this is a fact like anybody that Doesn't know it hasn't looked into it.   It's like Zionist youth camps, right?


Globally, cardiovascular diseases are the number one killer globally in terms of numbers of people. About 17.5 million people died from cardiovascular diseases in 2012, almost equally half from heart attacks and the other half from strokes. Heart problems are common all over the world, but the death rate depends on where you live. There's a progressive decrease in mortality in developed nations, especially Western Europe and North America, but this same phenomenon is not happening in developing nations. High pretension, high cholesterol and tobacco smoking are some of the risk factors that lead to cardiovascular diseases. Using nuclear imaging techniques, health professionals can detect problems at an early stage. The International Atomic Energy Agency for the past several years have played the central role in promoting the use of technology, the use of cardiac imaging. Transferring knowledge and expertise is a key to combating heart and blood vessel diseases, especially in developing countries. Our goal is to support our professionals to improve the quality of practice and to better use the resources that they have available. The IAEA organized an international conference that brought together medical professionals from around the world to discuss the global improvement of cardiovascular care services. These people, 350 people that we've brought together in Vienna, can really be good ambassadors to take the word back to their countries, back to their academic institutions and really to spread this worldwide. These experts agreed that education, early detection and technology are vital to tackling this worldwide problem. In Vienna, Austria, this is Alexandra Anapanich reporting for the IAEA.