Now, with exercise five, we're going to take the next step in building out our structure from the top down. Specifically, we're going to look at our ANN methods, train and evaluate, and give them just a little more form. We know that they're both going to do almost exactly the same thing, so what we do in one will be able to copy and use for the other for now. They bring in a data set, and then they iterate through it. In the train case, it iterates through and trains on each one, and in the evaluate case, it iterates through and uses it to evaluate the neural network's performance on each one. But for now, we're just going to set up the iteration loop and cycle through them. To set this up in our ANN class, we'll start by defining some class-level attributes, the number of iterations to train, and the number of iterations to evaluate on. It helps to cast these as integers, so the little int parentheses takes that number, make sure it's an integer, so that we can use the range keyword on it later and count through all of the integers up there. We're setting a fairly large number for training here, 100 million, a million to evaluate. These are numbers that will change later. We can go now into the train method and iterate through each one of these 100 million iterations. For each one, we get the next example from our training set. This will be a two-dimensional array, and so before we can feed it into a neural network, the first thing we need to do is flatten it out. Just turn it into a long one-dimensional array. Ravel is the keyword that does that. So when we're all done, we have these inputs, x. In this case, it'll be an array of four numbers, or four pixel values from our example, and we can print that out to see what's going on. And then we can do something almost exactly the same for the evaluate function. Now, we are at a sweet spot. We have something that produces a visible result, so we can run it and make sure that at least so far, we haven't introduced any hidden bugs. Anything that gums up the works. When we run it, we see, sure enough, we get an endless stream, nearly endless stream of these examples that are flattened into arrays of four numbers, and taken at random from our set of examples. So, so far, everything's looking really good.


At this time we shall have the presentation of the colors. Please remain standing for the invocation, Bishop Bolen. A year has passed and once again the members of the White House Photographers Association stand before you and we beg you to bless us. We are confident in our conviction that you must love photographers because you surely would not have given us a beautiful world with all its picturesque places and peculiar people if there wasn't somebody about to record it for posterity. We see ourselves in the unfolding of your creation when there emerged a race of men and women by film possessed, disciples of duplication and artists of no mean repute, doomed by their calling to stop the corridors of power in search of that one elusive picture which is worth the proverbial ten thousand words and hopefully an equal number of dollars. Be with us, Lord, as we record the march of our nation, its agonies and its ecstasies, its triumphs and its disasters, its sorrows and its joys. Help us to capture for all time the faces of rapture which illustrate our victories big and little, the release hostage, the missing child reunited with his family, the miners coming out alive, the winning home run in the bottom of the ninth with two out. Make us sensitive to those private moments of grief when tragedy disrupts the human family, when the innocent are the victims of the drunken driver, the terrorist, the drug pusher. Especially in this election year, we ask you, Lord, to be at our side when the hours are long, the planes are late, the parade is rerouted, the newsmakers don't make any, and the coffee tastes like Delta Mud. Give us moments of respite so that we can dream the epic photographer's dream of being in the right place at the right time with the right equipment and no other photographer inside. Bless our president and Mrs. Reagan who have graced our table this evening. Give them the courage to face the challenges of the global community in a continuing search for peace and justice so that we may all raise our eyes in hope rather than cowering in fear. While honoring this assembly with their presence, they also provide the membership with a less altruistic glow of contentment. And so far as while president, the president and our First Lady are in here in our vision, they are not out there providing somebody else with a photo opportunity. Kindly, Father, be good to those who love us, spouses and children, who share our frustrations and bravely tolerate our complaints, reward them for that profound wisdom and insight which persuades them that in their lives we are the greatest gifts you could have given them. And give us the grace, Lord, to believe it also. And remember, too, Lord, those familiar faces of our company who have abandoned their dark rooms forever and embarked on that final one-way journey from which there is no return. Be gracious to them, Lord, judge not their portfolios on which many an editor may have already cast a jaundiced eye, but judge their lives, their caring, their compassion, their search for perfection, their endless quest to blend the mysteries of your divine creation with the inadequacies and the imperfections of our human condition. Welcome them, Lord, and let their joy be unconfined. Bless the food we are about to eat and let our sharing be enhanced by ebullient conversation and sparkling wit. An occasion to remember truly the gift of a God who loves life and wishes to honor us by doing likewise. Amen. Ladies and gentlemen, while you're still standing, First Lady, President Ronald Reagan and Nancy Reagan. Hear, hear. Not to try to top Bishop Boland with any verbiage. Please be seated. Dinner is served. Amen. The winner of the 1988 Kodak White House News Photographers Association, Chief Middleman. United States. Thank you. Thank you very much. Thank you. Well, thank you, Ken, and thank all of you, and my congratulations again to the award winners. I'm delighted to be at this 1988 White House News Photographers Dinner, the last one that Nancy and I will be attending. I've always considered photographers, the cameramen and the crew, my favorites among the press, so I knew that being friends, you wouldn't mind if I got off a few things off my chest tonight. There's been a lot in the papers in recent weeks about insiders' views of the White House. Well, I've had it with all that, so tonight I'm going to give you the view from the ultimate insider, me. I'm going to tell the real story of this administration. It's been a wonderful two terms with lots of accomplishments, and I've even brought the slides to prove it, so Marlon hit the lights. One of the most interesting episodes was General Secretary Gorbachev's visit to the United States. I tried to help him understand our culture. In this photo, I'm saying this is the way it works, Mikhail. If Domino's doesn't get the pizza here in 35 seconds, we get it free. I like Mikhail personally, but you have to watch the Soviets every minute. Someone accidentally noticed that several weeks after they left, noticed they planted bugs all over the place. And by the way, on the matter of the INF Treaty, I told the Senate not to worry about verification. I told them I'd take care of it.  Oops, oops. When out during my presidency, I've always emphasized diplomacy. But sometimes it comes to the point you have to use force in foreign affairs. And here I am, arm wrestling General Norega for Panama. We really enjoyed our trip to China, and we're amazed that the population was over a billion people. And as you can see here, the lines are terrible. On another trip, the government of Indonesia gave us these gifts. And there are friends. Actually, I love this shirt. I finally found something louder than Sam Donaldson. And speaking of the press, remember during the contra-aid vote when the networks wouldn't let me on the air? I bet you wondered how I finally got my message out. It's no secret that the press and I sometimes don't get along. In addition to my standard ploy of using helicopter noise to avoid reporters' questions, I've now added a new method to avoid questions. Tear gas. I've loved almost every minute I've been in office, although there were a couple of trips to the hospital. In case you're wondering what happened here, I had just said, so Don, you say you're going to write a book. But while I was recuperating, the congressional leadership came to see me. And here I am asking for a colon donor. One of my greatest enjoyments is talking to the young men and women who defend us from attack. Here I am, on top of the White House. And the soldier is explaining where he thinks the next book will come from. It's fortunate that not everything has been spilled in these books, however. I mean, I hope the environmentalists never find out about this one. We used to fly Air Force One over Wyoming low and shoot Buffalo from the window. But I'll tell you someone I trust totally, George Bush. He's been a wonderful vice president, and he'll make an excellent president. And that's why I endorsed him, and why I'll work hard for him this fall. Here we are listening to one of his speeches. You do get to meet lots of wonderful people as president, and they're always bringing me things to try on. What struck me about this photo is that this hat fit Don Regan fine. Now, this is an interesting photo. This young man down front there in the picture later told me he had a vision of Michael Dukakis in the Oval Office. And I like this one of Lucky sitting on my lap. Unfortunately, my raincoat was on the seat just behind me. Now, this is a sight I've seen many times. And you do sometimes get in the way, and you do sometimes cause a commotion. But your work has produced a permanent historical record of my two terms as presidents. You've been there with me. You've captured me in moments of hope and excitement during the campaign, moments of disappointment like when General Secretary Gorbachev and I parted there in Iceland, moments of grief such as when we were with the families of the Challenger crew, many, many moments of joy and optimism, and of course moments of love whenever I look in Nancy's direction. You've captured what life has meant for Nancy and me over these past eight years. And for that, I genuinely thank you. And you know there's one picture you've taken time and time again, that of me saluting the troops. I do that out of respect. You here tonight do good, hard, creative work, and I respect that too. So, as we say our farewells here tonight, this salutes for you. And now tonight, good night, and God bless you. Ladies and gentlemen, at this time we'd like President Reagan to present our photographer of the year, his grand prize, Jim Stansfield from National Geographic. Will you come up, please? Ladies and gentlemen, the White House News Photographers Association photographer of the year, James Stansfield. And now Steve Athens, worry Steve. Ladies and gentlemen, the White House News Photographers, cameraman of the year for the third consecutive year, Steve Athens. Ladies and gentlemen, this is the grand award that they both share for six months each, given to both our award winners each year. Congratulations, gentlemen. Mr. President, before you sit down, sir, the White House News Photographers Association has a small token that they'd like to give you as a belt buckle. Also, one other thing that we have for you, Mr. Reagan, is last year at the Library of Congress we presented your wife with her own camera, and she got a lot of play out of it and took a lot of pictures on your summit. And this year, since you're embarking on a summit next week, we have for you a brand new camera loaded and ready to take pictures. Thank you very much and good shooting, Mr. President. She's this. Thank you.


For this recipe, the Chunky Monkey Frozen Banana Bites, you're gonna take one banana, peel it open, and then you're gonna cut it into 14 slices. Be careful to keep your fingers out of the way of the knife because we don't want anybody to get hurt. They gave me about 12, but that's okay. Next, you're gonna take your knife with some peanut butter on it and gently spread it onto one of the banana slices. Then, taking the other slice, sandwich it in half and set it aside. Repeat this for the rest of the banana. Once you've finished all of the bananas, place them onto a plate and then move them to the freezer for about 15 to 20 minutes. Once your bananas are frozen, place a toothpick through the center. Then, gently pick it up and then roll it in the chocolate. Gain the chocolate all over. Simply return it back to the plate. Repeat with the rest of them. Then return them to the freezer for about 30 minutes.


Hi, this is Michelle Getzinger from Berkshire Hathaway. I'm a realtor out of the Fox Chapel area, and I want to go over a couple of things that are happening right now in the marketplace. First off, there's a big demand for buying houses due to the backup from COVID being from the shutdown from COVID. Then on top of it, that was our spring market, which is the busiest time of the year for realtors to sell houses. That's when everybody's moving because they want to be in their house before the kids switch for their school district for next year. So that being said, a lot of the deals as they've been coming on have been in a multiple offer situation. It's been crazy. The house hits the market two to three days later, you're having a multiple offer situation. What does that mean? Well, that means there's not a whole lot of houses out there and there's a lot of people that are fighting to get one. And how do you win those multiple offer situations? All right, so let's talk about a multiple offer situation. You put in an offer, you've been told there's multiple offers on the table, and now you want to get your dream home, but you've got to beat everybody else out. So when you hear the term highest and best, what is happening, and let me tell you, based on a scenario that just recently happened with us, is we had a lot of action on a house. It was priced properly. We got 15 offers in. So it was within the two day period that it was listed. We said it was highest and best by Sunday at 2 PM or whatever, and we went through them. And how we had to distinguish between the offers gets pretty complicated. All right, so the first thing we did when we got our multiple offers is we started to divide them by the type of financing they had. So there's a couple different ways that the financing can be structured. The best one would be obviously cash. The second one would be a conventional loan. Reason being is they have less restrictions. Then the next one would be FHA and then VA having the highest restrictions lending-wise. Okay, so when you are told to bring the term highest and best to the table, that means you have a time limit where you're going to come in with your highest number and your best terms. So the least amount of contingencies attached to your offer that you're giving the seller. So you want it to be as clean as possible. If you can't avoid seller's assist, that would probably be a good time to do it. You can also waive things like inspections. I never encourage people to waive inspections or not get an inspection, but you can waive it and still get the home inspection. You just can't make the deal contingent on the inspection. You also have to let the other realtor know that you're doing that. But it would be for informational purposes only. Other tips for you when you're trying to win a highest and best situation. Number one, other than having the cleanest offer that you can bring to the table with the best type of mortgage that has the least amount of restrictions, is you might want to write a letter. Now I know people really think that's hokey, but it does. It goes a long way. It kind of separates you out and tells your story. There's 15 of them on the table. That seller might be able to connect with you. If you're a veteran and you write a letter and they have a family member that has served in the past, I've actually seen it happen where a seller takes a lower price amount or not as good a terms just because they're connected emotionally with that buyer. Another contingency that you can add on is you can add an escalation clause. That would be only if it's allowed, the other realtor has to approve it. It is when you put an offer in, hypothetically, like a full price offer, and then you're willing to go $10,000 above the asking price and you do it in an escalation clause. So what happens is we attach that to the sales contract and we get to beat the next bid on the table by $500 or $1,000 that goes up. So it's essentially like a bidding war and you get to click up an increments of $500. That being said, these market conditions won't last forever and thanks for watching and good luck with your multiple offer situation.


What's going on everyone? Sam here with latent sports cards ripping 2022 Prism World Cup soccer. First off the line, a photo, two box break, number 19 random group style. Here's a look again at your random results. As always you can find these on the website under the results tab as well as the link that's currently in chat. So good luck everybody. Let's do some prism soccer. First off the line, there's your first off the line sticker. Let's do it. Palms man. I always love ripping soccer. Prism World Cup soccer. It's been fun. Go Portugal. Portugal. I know who are we rooting for now? I'm rooting for I'm gonna have Portuguese. Oh yeah that's easy then. Portuguese and Irish. I think I think all my nationalities are out. Most of my nationalities didn't even qualify. Nice gentle. Pink coming up here. Netherlands and Brazil. Future's nice. Yeah right. There's Rafael Liao for Portugal speaking of. Let's go. There you go. Nice one there. Pink that's going to Kailan with group each. Ederson. I know kind of surprising Spain got knocked out. Just cheer for Messi.  Yeah. Argentina's a fun one. I'm with you right. That Romo's guy. Yeah for sure. Yuri Telemans for Belgium. Nice one there for Danny with group F. No group. Yeah group F. Ilkay Gondogan. Some base there. Silver coming up here it looks like. Mbappe base. There's silver Jocko Gavrajol for Croatia on the rookie. Nice one there Croatia. Is that Lissandra Martinez and base? What's up Ryan? What's up Rory? Ryan Rory what's going on guys? Joshua everybody. Oh yeah. Got a good group in here right now for sure. We got the crew in here. Good squad of individuals. Squad up. Let's see what we got. Forgot to put Gobrock birdie in your order notes. No how dare you. There's a nice national pride going to Serbia. Duzan Vlasovic. There you go Serbia. That's going to be you to see on the case hit. There we go. Nice one there. Again going to Serbia. These national prides are awesome. Yeah I see he saw me yesterday dude. That was a mess. Absolute mess. Silver Jackson Irvine going to Australia. And base. I know Vinny Jr. and Mr. Charleston playing really well is scary. Plus obviously Neymar did well. I was getting my haircut. I was watching Brasilia. They're going to be them in France. They're going to be tough to beat. My girlfriend's French. I'm going to root for France I think. There you go. There's Montessar Talbi for Tunisia. Yeah Brazil's like firing right now. Brazil's getting really hot. They're going to be a team to beat. They're really good. Hyper coming up again. Hyper Neymar Jr. Very nice speaking of. You to see with Brazil on group G. Nice one there. Congrats on the Neymar. That's pretty solid. Base base and base. Sean dropping guys a link to our Bowman Chrome and Pristine Mixer. Coming up very soon. 19 to go on that as well. Got our shimmer coming up here. What's that? It looks like a red mojo behind it. No purple mojo behind it. See somebody big, big shimmer. We've got Jose Maria Jimenez. That's going to Uruguay. Four of five. Nice one there. Uruguay. That's going to be where's Uruguaya. Kyle M with group H. Nice shimmer. Followed by another Ducan Blahovic. This time purple mojo 49 of 49 going to Serbia. You to clean up with that spot so far. Silver connections. Paul Pogba and Rafael Varan for France. Gaby rookie for Spain. Wouldn't it be dope if it was Portugal and Argentina? It would be wild. It would be awesome. That would be pretty awesome. That's what the Mecca right there. That is. That's what everybody wants right there. Purple coming up here. Purple is going to be Trent Sainsbury going to Australia to 199. 68 out of 199. These guys don't play in the next one, right? Probably not. Yeah, probably not. Mid to late 30s, right? Yeah. Tanaka going to Japan. Jeremy Doku for Belgium on the Phenomenon's base. The mic will watch the game Saturday morning with Forest somewhere. Oh yeah? Yeah, he was talking about it. Who is it? I have no idea. I'm just showing up. Silver, Jan Vertongen or Jan Vertongen. That's going to Belgium. Group F, Dany C. So looking for our auto here as well.  Here's our auto, speaking of Blue Shimmer Auto and a red as well. We've got Blue Shimmer Auto, Unai Simone. Nice one there going to Spain. Congrats, Spain, you to see. And the goalie card, Unai Simone. And we've got a nice one here. Red, Jude Bellingham going to England. That's Jinwuke. Congrats on that to 399. Nice Bellingham. He's a beast, dude. He's so good. Brazil, silver cup card. Club Bali. Bates. Daycare out there right now. Cody Gokpo rookie. There's a blue messy. There we go. Congrats, Argentina. 81 out of 299. There it is. Argentina is Robert G with Group C. Nice one there. Robert. Robbie. Robbie. Oh, this guy's okay. Nice. Trash. Yeah, he is kind of garbage. Trash. Connections, Rodrigo de Paul and Paredes. And base. Baker to the Rams? Really? Did he really? Did he really? Really to the Rams? I guess with Stafford out, that kind of makes sense. How long is Stafford out for? Peter M, couple spots there. Second first off the line. That's not a bad move actually. I thought for sure he was going to San Francisco. Yeah, San Fran would have been a good spot. Same with like, I heard New England. I heard Rumblings in New England. I don't think they'll check in with that kid. Probably not. No, that's, you go to New England, you gotta be a different kind of person. Yeah, true. Tweet this really quick. They say he's going back to New England, Brady. They shut down Stafford down for the rest of the season. Yeah, I guess that makes sense. I'm gonna tweet it really quick too, Sean. Yeah, I guess if he's been there long enough. They're feeling good with Purdy, huh? If he's been there long enough, I guess, like... He did what he needed to do. Yeah, not like he stumbled or anything, you know. Looks like we got our auto in the first pack here. There's a Griezmann on top. Yeah, they weren't going for Baker. Auto is going to be Jose Maria Jimenez. That's going to Uruguay. Doing very well with that Uruguay spot. That's going to be Kyle M again. Nice one there, not numbered. Next one is Red going to Ecuador. That's going to be Jeremy Sarmiento on the rookie. It's a 399. Ecuador is Danny C, Group A. Yeah, Purdy did look good, man. Silver Global Reach, Phillip Costich. Purdy did look good, yeah. I just feel like it's a matter of time before the wheels kind of fall off. Yeah. You know what I mean? Red Mojo coming up here. Nice continuance. It's going to be Yori Telemans for Belgium going to Danny C with Group F. 79 out of 99. Nice one there. Lester City legend. Hannibal. Oh yeah. Phillip Coutinho for Brazil. Nice one there. Cracked Ice. Bernardo Silva. Never doing that again. No, I'm going to set it and forget it for now on. Every time I've set it and forget it, I win. Every time I've set it and forget it, I win. And then every time you have second thoughts. Every time I listen to somebody or hear something on the radio. Yep. That's the end of that. Yep. Uh, something here. Upside down. Face card. I'm with you, Josh. Pink is Jose Maria Jimenez. Man, it's been a big time break for him. Going again to Kylan. One per box on the pink Ghana cup card. I just felt like I knew big was going to be this way. I wouldn't even be in college, dude. Just not be that good. Yeah, just, uh, there's more show than anything else. That's true. Silver Rafael Liao for Portugal. Yeah, I was going to say, Kyle, you literally have the whole Hemenes. Like just go for the rainbow at this point. Nice. I'm going with that. Honestly, dude, that's funny. That's something coming up here. It looks like it's going to be a national landmarks of Sandro Asmoin for Iran. That is Jinwoo. There you go, buddy. Newer going to have to pull you a case hit at some point. There it is. Congrats, man. Nice national landmarks. Siddharah Asmoin. Jinwoo has been itching for a case hit out of his breaks. And there it is. There we go. Congrats, man. Jinwoo K with Group B. There it is. Finally got a case hit. I told you, Jinwoo. We're going to do it, man. We were going to do it, buddy. There is Moises Casito for Ecuador and the Silver Rookie. I thought about it too. When I saw you got Group B, I was like, all right, for case hit, they've got a lot of mangas, they've got a lot of national landmarks, and they've got a lot of national pride. So it's like, all right, boom. I did not think it would be Iran that we're going to pull a case hit of. Or Iran. I would have figured like, oh, we're going to get you like in England or a USA. There's Sergey Milankovic-Savage for Serbia on the hyper. Ronaldo, Global Reach, Portugal. Cratch, Jinwoo. Still looking for Shimmer coming up here as well. Got Hyper, Vojtek Šežni for Poland. Yes, same, dude. I'm feeling good. Ready to go, man. Yesterday, not so much. Today? Understandable. Gassed up, buddy. Straight a rock and roll, man. Straight a rock and roll, remember. Oh yeah, big time. Blue coming up here. Not Shimmer, I don't believe. I don't think that is. Maybe it is. No, I can't really tell, to be honest. No, it's true blue of Adam Buksa, or Buksa. It's $2.99. That's going to Poland. Sean's dropping guys a link again. Two hour mixer. Pristine and Bowman Chrome. 19 to go on that. Breaking relatively soon. Gonna be a fun one. We pulled some fire out of it. Got a lot of hip potential in there, too. Got our blue Shimmer. It's gonna be Marcelo Brozovic going to Croatia this time. Nice one there. One of five. Croatia is gonna be... Team I Can't Find, of course. Where's Croatia? Oh, there it is. Danny C with Group F. Then we've got going to Serbia. Orange 22 out of 35. Sasa Lucec. Man, I have to say, Yuta with that Serbia spot has done very well as well. Nice one there. Congrats, Yuta. Silver of a Charleston Scorer's Club. Charleston, he's playing really well. He's playing really well, dude. Yeah. So good, man. Silver on summer. That's going to Switzerland. They just got... They just got absolutely pieced by Portugal's Switzerland. Well deserved. Yeah. Last pack here. Good luck, everybody. Looks like we've got a silver to end it. It's gonna be Min Kyu Sung for Korea. Iran Cupcard or Iran, as Sean told me. And base. That'll do it for the break, guys. Do a quick recap here. Just do base. Yeah. I guess just do the Shimmers from now on. Shimmers and autos, too. Shimmer, okay, okay. Yeah. Max cards. We had Sonar Esmoin going to Spain. Or Iran, Iran. That is Lino Messi on the blue. Number 2, 299. Very nice there for Argentina. And National Pride, Dusan Vlasovic. Or Vlasovic going to Serbia. That'll do it for the break, guys. Thanks again for the fill. We'll... Next up, we've got another one of these.


What's up guys, my name is Michael and welcome to my YouTube channel. Today we are going to go over code forces round 696 puzzle from the future division two. Okay, so basically you have two numbers A and B their length of N. Okay, and A and B just has digits zero and one. Okay. Now what we're going to do is we're going to add A and B together. And then we're going to call it C. Okay, that's what it is. Now, what Michael's going to do is that he's going to remove all the consecutive digits, which is like digits side by side that are the same. And we're going to call that a new number D. Okay, now, unfortunately, we lost the integer a before we could calculate D. So now what we want to do is we want to find the any arbitrary number a of length N such that D is the maximum as possible. I'll actually go over go over what I mean by that. So like, we have two integers a and then two integers B. Right. So let's actually go over an example. So here, let's say we have 0 1 1 0 is a so 0 1 1 0. This is a. Okay. And B is equal to 1 1 0 1. So 1 1 0 1. Okay. So these are this is a this is a number a and this is a number B. Okay, what we're going to do is we're going to have C is going to equal to a plus B. Okay, that's what this is going to do. So what this is doing is that it's just going to add them up. So this is going to be they actually calculate this for us. I think I don't want to I don't want to do math myself.  Okay, so this is going to give us C. Okay, now what we're going to do is we're going to get another integer called D. Okay, so now what we're going to do is we're going to find the create a new new number D and it's going to get rid of the consecutive numbers. So here the consecutive equal numbers. So like we have 1 2 1 1. Basically what that means is that it's going to repeat the repeated values. So it's going to get rid of the repeated values. So we have 1 2 1 1. So if I get rid of the repeated values, I'm just going to have 1 2 1, right? Because 1 was repeated. This one was repeated. So I'm going to get rid of that. So that's what this number D is. Okay, that's what this number D is. So now now the problem is asking is that unfortunately now Mike lost to the original A. So this original value of A, he lost this, right? This is he doesn't know what this is. Okay. But he does give you B, right?  So he tells you what this is, what this, this, this value B is. And he wants to know what a value a what is the value of a to maximize this D, this number D, right? So this we want to make this as large as possible, right? So we want to make this D as large as possible, max, largest as possible. So we want to give you, we want to find this, the A such that this D is as large as possible, right? So when you add A plus B, and then you remove the consecutive equal numbers, this D would be as large as possible. Okay. Okay, so I actually don't remember what I put, but I did solve this during the contest. So let's just actually just go over what I did. Okay. So how do you solve this problem? How do you actually solve this problem? Okay. So remember, we have to think back what the problem statement is asking. So they want this D to be as large as possible. So how do I get D as large as possible? Well, think about, think, think he's very good. Okay. So remember, we have this value of B, right? We're given this. And we need to get this value as large as possible. So what is the largest possible value you could have, right? Of D? Well, the largest possible value you could have, because these are all zeros and ones, digits zeros and ones, largest possible values, if there is, there are all twos, right? Do you guys understand? Because if I had like one, one, one, one, and I add one, one, one, one, like assuming both of these are assuming me a and B are just as large as possible, like completely as large as possible. If I add both of them up, there's going to give me a bunch of twos, right? Because we know that from the input statement that A and B only have digits zero and one. So the largest possible I could actually have is going to be a bunch of twos, right?  Well, I don't know if it's going to be a bunch of twos, right? Because we don't know what, what, what's going to have, right? Because it could be a bunch of twos, it could, it could not be. But we do know what B is, right? So we know what B is. B is one, one, zero, one, right? B, B is a value they give us, they give us this, right? So if I want to get the largest as possible, given that this B now is not, not, if this B value is not a bunch of ones, what do I have to do? It's like simple.   And the reason why is because think about this. To get to maximum, the maximum possible you could possibly get, right?  If you add them together, there's a bunch of twos, right? All twos, right? Because we have only digits zero and one. So the maximum possible value of A could be, this A could be, right? Because given this B, it's just going to be a bunch of ones, right? So what did I do first? So first in the code, what I did was I first created a new, a new string, this, I actually messed up this, the notation of B and A, but just, just, this is supposed to be A, okay? So in this case, I just created a initial string of all ones, okay? Of A to have all ones, okay? So initially, A is going to have is, A is going to have is just going to be full of all ones. So here, it'll be all ones, right? And all ones, the length of N, because we know what, we know what the two strings lengths are, right? We know they're both lengths of N. So I make them all ones, okay? So now what do I do? What I do is I take this string of all ones, right? And I add it with my string of B. So here, remember, what was our string of B? I don't actually remember. What was the example they gave us? Okay, so the string of B they gave us was 0, 1, 1, 0. I think, no, no, 1, 1, 0, 1, 1, 0, 1, okay? So 1, 1, 0, 1, okay? So what I do is I take A, I fill a bunch of ones, and I add it to B, okay? So these are just basically, basically implementing it, right? The maximum possible value I could have if A is just all ones, I just take this and add it with B. So I add these together. So this is going to see is going to equal to both these add together. So it's going to be 2, right? 2, 1, and then 2, right? 2, 2, 1, 2, okay? So that's just that's just adding the two numbers together. So that's what I do here, right? I create a new string of C. It's going to equal to the string of my the input value of B plus equal to converted the string of A converted, right? So this B is actually supposed to be A. Just don't mind it, right? This is just a bunch of ones, okay? So what we do is here, what this code is doing is it's going to convert, it's going to loop through, loop through both of the strings, and it's going to convert it to the number value, right? Because it's a string, I read it as a string. So I'm going to convert it to its original number. So this is just going to convert each individual digits to its digit values, and it's going to add them up. And it's just going to convert into a string. So that's what the C is going to equal to. Okay, now what do I have to do? Remember, we have to get rid of the get rid of the values, right? So we have to the problem doesn't end here, because if you look back at the problem statement, we have to get rid of the consecutive equal digits in C, right? So if they have the same digit, right? The same digits of like 1100, right? We have to get rid of that. If we get rid of a digit, it makes the values super small. And that's not what we want. Right? Remember, we want to make the digit D as large as possible, maximum as possible. So we don't want equal digits in our answer. So if we go back to this, go back to this case, right? Our answer, like if I just just guess that A is going to be all ones, right? What's this going to do is it's going to get C is equal to two, two, one, two, right? But then our D, remember, our D is going to remove the equal consecutive digits, the ones that are right next to each other and they're equal. So what this is going to return is it's going to get rid of this two, and because this two and this two are the same, right? It's going to get rid of this two. So it's going to give us one, two, one, two. And this is way smaller than C. Remember, we want our D to be as maximum as possible, largest as possible, right? That's that's what they want. So we cannot have consecutive equal digits here, two, two, one, two. We cannot have consecutive equal digits. So how do I make it remain maximum as possible without completely getting rid of, without the without just changing it completely, right? You're just just getting rid of the consecutive digits. How do I make this D as maximum as possible, right? Simple. We don't allow consecutive digits in C. So in when we see two, two, one, two, we don't allow that, right? We don't want consecutive digits in C. So how do I prevent a consecutive digit in C, right? If, what do I do? I'm going to subtract one from A, right? So whatever digit that was repeated, this two, two, one, two, right? Two, two, one, two. This two was repeated. I'm going, instead of having this A as a value of one, I'm going to have this A as a value of zero, okay? So that's going to prevent, that's going to get rid of this consecutive digit. So in this end, this two is actually going to be a one, right? Because we have zero plus one is will be one, right? So this sum is now actually going to be, it gets rid of the consecutive digit and we will have two, one, one, two, right? Now let's look at this next one. Okay, we have one, one. Well, we don't actually have a consecutive digit here, one and two, one, one, two. These are not consecutive digits, right? These are not equal digits. These digits are not the same, not equal consecutive digits. So we're done, right? So if I want to print out the original value, it'll just be a now. I have the maximum of the right value of a to add to be to get D as large as possible, right? Because in this end, in the end, this D is not going to be two, one, two, it's going to be two, one, one, two. Okay, that's what this D is going to equal to. That's what this D is going to equal to. So in the case of our example, what I did in the code is basically just that. So here, here, we, what I do is here is, this C is just created by adding them together, right? And then here, I check if there's a consecutive digit, right? So I loop from one to the end. And if it is equal, I'm going to replace the value with a zero in the original value. So here, in the original value of a, I'm going to replace the original digit set is going to now equal to zero. Right? So that's what this does. This does. So this loop checks if I find a consecutive digit in my new C value, right, in new C, I'm going to set the original value of my original value of a is going to be equal to zero. Okay. And then I'm going to, what I'm going to do is I'm going to, a C is for the value of C, I'm going to convert it into its number format. Okay. If the update the new value of C, so what this does is the C original was two, I'm going to change it into a one, right? That's what this does because now the updated value is going to be zero plus one is going to give me one, right? This place of zero plus this place of one is going to give me one. So that's what this does. Okay. So that's what this C does. It updates the value. Okay. Then what I do is I'm going to update it again to check if I run this again. And the reason why I run this again is that sometimes you, we don't actually, there's some issues that might occur with some few test cases that might occur. So I basically do this again in case if I had like a repeated digit that needs to get removed. Okay. So that's what I did here. So yeah, I pretty much did I set C equal to an empty string, and I just redid this exactly one more time. So I basically just update, I add up the two values of A and B again, call that my C. If, if the value is equal to a repeated character right one next to each other, I'm going to set it back to zero of my original value to zero, and then I just print out the value. And that's going to get you the optimal a value added to be such that this D is going to be as large as possible. Right. So I hope you guys enjoyed this video. Rate com subscribe. That was pretty much the gist of it. Rate com subscribe. I'll check you guys later. Peace.


Hello and welcome to the session that has discussed the following question. It says check whether the following probabilities probability a and probability of b are consistently defined. In the first part we are given probability of a is 0.5 probability of b is 0.7 and probability of a intersection b is 0.6. And in the second part we are given probability of a is 0.5 probability of b is 0.4 and probability of a union b is 0.8. Let us first understand the key idea behind this question. The probability of a union b is equal to probability of a plus probability of b minus probability of a intersection b. So this implies probability of a intersection b is equal to probability of a plus probability of b minus probability of a union b. Now to check the consistency of the probabilities that is probability a and probability of b are consistent probability of a intersection b should be less than equal to probability of a and probability of a intersection b should be less than equal to probability of b. So this knowledge will work as key idea. Let us now move on to the solution. In the first part we are given probability of a is 0.5 probability of b is 0.7 and probability of a intersection b is 0.6. And we can see that the probability of a intersection b is greater than probability of a that is 0.6 is greater than 0.5. So these probabilities are not consistent because for the probabilities to be consistent probability of a intersection b should be less than equal to probability of a and probability of a intersection b should also be less than equal to probability of b. So not consistent. Now in the second part we are given that probability of a is 0.5 probability of b is 0.4 and probability of a union b is 0.8. Now from this we can find out the probability of a intersection b probability of a intersection b is probability of a plus probability of b minus probability of a union b. The probability of a is 0.5 probability of b is 0.4 probability of a union b is 0.8. So probability of a intersection b is 0.1 so probability of a intersection b is less than probability of a that is 0.5 is less than probability of a intersection b is 0.1. The 0.1 is less than probability of a which is 0.5 also probability of a intersection b is less than probability of b probability of a intersection b is 0.1 and probability of b is 0.4. So the probabilities are consistent hence probability is given in the first part of the question are not consistent. So the answer is no because probability of a intersection b must be less than or equal to probability of a and b and the probability is given in the second part of the question are consistent. So the answer is yes and this completes the question. Bye for now. Take care. Have a good day.


We have seen that we can bypass the Giver-Sotherwood result in the special domain called the single peak domain and we have also discussed one example, pick the leftmost peak or the rightmost peak or the median peak which is a mechanism which is on to and strategy proof but not a dictatorial one. So, in this module we are going to look at that specific mechanism in some further detail and we will show that this is indeed strategy proof. This class of mechanisms is actually strategy proof and the class of mechanism that we are going to talk about they are named as median voter social choice function. It is a class of social choice functions. So, how is it defined? So, it is defined in the following way. So, it is a social choice function which is mapping from this restricted domain of the single peak preferences to the set of alternatives. If there exists a collection of n minus 1 peaks and we will call this peaks as the phantom peaks. The name being phantom because it is not a real peak. So, it is not an agent who is having this kind of peak rather it can be chosen arbitrarily and based on that we actually define what is the median. So, the social choice function is actually defined in terms of in particular it could be it could be indexed by B itself that is given a specific B set of phantom peaks. We are picking the median of those peaks and also the peaks of the players. So, how can we actually represent the common things that we have actually discussed? So, for instance, if you have the peaks the phantom peaks all cluster together on the left, then you know that all the n minus 1 peaks are on the leftmost position. Then the first position of first of this agent peaks is going to be the median of this collection of B as well as the peaks of the players. So, in some sense if we pick this B carefully we can actually create the leftmost peak as your outcome. Alternatively, if all the peaks are on the rightmost position that is by leftmost and rightmost I mean the ones that are that can have them the maximum negative. So, if in the domain there is a leftmost position there cannot be any agent peak which is even further left to it and there is no agent peak which is for the right to to it. Then if we pick all those phantom peaks to be the rightmost peaks then we know that the rightmost agent peak is going to be the median of this collection and therefore we can also reproduce that rightmost peak picking mechanism using this description of the median border. And similarly, if you have if you want to pick the median of the agent peaks then you can actually pick half of them. So, half the phantom peaks to be on the left half the phantom peaks on the right of course depending on whether n is even or odd you can adjust accordingly, but that will give you the phantom peak which is the median of all the agent peaks. And this outcome the outcome of this mechanism need not always be an agent peak by choosing arbitrary phantom peaks you can also have a phantom peak as the median of this collection of peaks here. All right. So, here we are I am calling median, we have the computation is the median with respect to the common ordering the common ordering of all this of all these alternatives. We have already defined that a single peak preference is defined with respect to this common ordering over this alternatives and that is that is this one. And we are computing the median with respect to that ordering in this examples set of examples we are assuming that they are all located on a real line. Now, that is the that is the reason why we have introduced phantom voters so that we can look at all these mechanisms collectively. So, it is a it is not only a single social choice function it is a collection of social choice functions, but they have this property that by adjusting the phantom peaks appropriately you can output different kinds of medians different kinds of peaks as the final outcome. Now, here is a important result due to MULA 1980 every median voters social choice function that is every social choice function which belongs to this class that we have defined just now is strategy proof. So, that is one important result and it is not very difficult to prove and I will not do the proof formally because it is the very similar way that we have argued in the previous module how you can argue that median voter so median peak or a leftmost peak or a rightmost peak is strategy proof is because the only way an agent can alter this median is by going on the other side of the median. And presumably because this is a single peak preference if the only way it can change that median is by reporting its peak to be on the other side of the median which essentially is less preferred than the current outcome and that is essentially the idea of this proof again. Now, notice that this is a very special property of median and mean or any other kind of statistical measures of all these peaks does not have this property in fact you can manipulate means and you can construct one example. So, let us now go into a little further detail of this of this mechanisms and let us look at what are the structure of Pareto efficient mechanisms and here we have a claim. Let us imagine that P mean and P max are the leftmost and the rightmost peaks and again by leftmost and rightmost we mean the common ordering over all these alternatives. So, if they are the leftmost and the rightmost peak according to that common ordering then F will be Pareto efficient if and only if this outcome of that social choice function lives within that minimum and maximum point. So, to draw a picture, so let us say P mean was here and P max is somewhere above and if you pick any F of P that must lie somewhere in between. It can be the P max itself, it can be the P mean also but it will never be outside it. So, because there is an if and only if condition we will prove it in both directions. So, the first is the forward direction or the only if direction, so we can prove it via contradiction. So, let us assume that this Fp is not inside this, so it can be either on the higher side or on the lower side. But in both these cases what we immediately observe is because the peaks are somewhere here. So, the agent peaks are always living somewhere in between if you pick. So, if the Fp is somewhere here then it is strictly worse than their current peaks for all the agents and that is certainly dominated alternative. So, let us look at the other direction, the if direction that is if Fp lies between these two points P mean and P max then it must necessarily be predator efficient. And that argument is also quite straightforward then you cannot really find a condition that there exists some B which is strictly preferred by all the agents over this current outcome Fp, all the agents on the left hand side of this, so between P mean and this F of P they prefer they have their own choices which is more preferred than Fp possibly. But there are some alternatives for which it is on the other side. So, you cannot really find another alternative one consolidated alternative. So, let us say you pick some B from here and if you try to see if it is better than Fp by all the agents that is not true because B is on the other side it is strictly worse than Fp for all the agents who speak on the left hand side. Similarly, if B falls here for all the agents which are on the right hand side for them B is strictly worse than Fp. So, we will never find this kind of an example where this Fp is Pareto dominated and therefore the condition of Pareto efficiency is vacuously true. Okay. So, in the Gibbard-Sathuwait setting we have discussed certain properties and we are going to look at those properties, the implications of those properties with strategy proofness in this current setup of single B preferences as well. The first condition that we are going to look at is monotonicity. The similar results like this Gibbard-Sathuwait setting holds here too, even though the proofs differ quite a bit. So, let us look at the relationship between the strategy proofness and monotonicity and look at the easier direction. So, strategy proofness implies monotonicity and if you recall the proof we did, we transitioned from one preference profile to another preference profile by changing one agent's profile at a time and the same proof will hold even for this setup. So, there is nothing very interesting in this direction but in particular when we are talking about the reverse direction that if F is monotone whether it is strategy proof or not that particular proof is not so straightforward and the same proof that we have done earlier will not hold and it will not hold because of the fact that it was a constructive proof. We constructed it in a way that if there was a violation of strategy proofness that means B was more preferred. So, B is when the agent is manipulating and getting an alternative B and when it is not manipulating it is getting A and that was preferred by some agent I in that setup that and then we have constructed a different preference profile P double prime where B was on the top for that agent and E was directly below this and this was possible in the unrestricted domain in the Gibbard-Sathuwait setting but in the single pick preferences so you can imagine that the B could be somewhere here and A can be anywhere else so A can be here or here based on what is their relative position in this total ordering remember that the common ordering you cannot alter in single pick. So, you will have to also take care of all the intermediate alternatives which are lying between A and B and therefore we cannot just pick B and A right after each other because then you will also have to argue what happens to these alternatives here because they will certainly in a single pick preference they will certainly be between A and B and we will have to argue that. So, what I am trying to suggest is that the reverse in order to show the reverse direction you will have to also do a possibly different construction or provide an count example maybe this implication is not true at all in that case you can you should be able to give an example pad is monotone but not strategy proof. Let me give you the answer the reverse implication is also true but the construction will be a little different so I leave that as a homework exercise. So, the next result that we have already shown in the case of Giver-Sathabwet that is the unrestricted domain about on-to-ness unanimity and Pareto efficiency. As before the Pareto efficiency is the strictest notion and it implies unanimity and on-to-ness that holds even here too but the reverse implication that whether on-to-ness will imply unanimity and unanimity will imply Pareto efficiency under the condition that this social justice function is strategy proof that requires some amount of work and that is exactly what we are going to do here and that will also give you an idea that how we are going to do the construction in the single pick preferences we will also have to take care of certain additional things because there is a restriction in the domain. Okay, so let us assume so all that we need to show to show the this equivalence that is we know that Pareto efficiency implies unanimity implies on-to-ness so strategy proofness plus this will also imply that under the strategy proofness to show the reverse direction we need under strategy proofness this on-to-ness will also imply Pareto efficiency. So, let us try to improve this via contradiction. So, let us assume that F is strategy proof and on-to but not Pareto efficient. So, what does that not Pareto efficient mean? It means that there exists a pair of alternatives A comma B such that A is strictly preferred over B for all the agents yet the mechanism has chosen this outcome to be B so which is Pareto dominated by all the agents. So, since this preference is a single pick so we know that A is strictly above B so maybe somewhere here so A is strictly preferred over B then there must exist another alternative and this is an implication think about it of the single pickness that there must exist some other C which is strictly preferred over B and it is also neighboring alternative. So, in that ordering the common ordering of all these alternatives C just leaves next to B I mean of course A could have been on the other side of B as well in that case C would also be on the other side but it does not really matter C is a neighboring alternative of B and that also is strictly preferred over B and here we are only considering discrete alternatives so it is not continuous. So, in particular C can be A itself that is also a feasibility if A and B are neighbors then A and B then our job becomes a little easier but in general there could always be a C which is strictly preferred over B and that is not only for agent I it should be for every agent and because for every agent the preference is a single pick. All right so now we also know from the definition of on-to-ness because we have assumed that it is strategy proof and on-to. So from on-to-ness for this particular C that we have found just now there must exist some preference profile B prime such that the social choice outcome of that B prime is actually producing so that is an implication of on-to-ness. Now we are ready to construct our P double prime so what does P double prime do? It picks C to be the topmost one and the B to be the next second alternative and this is possible because these two are neighboring the neighboring alternatives so we can look at all these preferences which has C as big and B as the second alternative in that in that preference order for every agent I in N. Now the proof is very simple we look at two different transitions from P to P double prime and we apply monotonicity and here we are using that the fact that monotonicity and strategy proofness are equivalent here also then you can conclude and yeah this is very similar to previous one I don't want to spend time on that so P double prime will also be B because in P the outcome was B right so in P the outcome was B so you have B here because it is a satisfying monotonicity you can convince yourself that the relative position of B is only getting better in P double prime. Similarly if you are going from P prime so P prime is this alternative where C is on top so C is the outcome and because C is moving to the topmost position of course its relative position is also increasing using monotonicity you can conclude that this is this is equal to C the outcome P double prime is C and here is a contradiction because here it is B here it is C and B and C are not the same so we have proved this result that so we have started with a with an assumption not B so but we have proved that this is supposed to be B so then we have actually proved this equivalence which we had for the unrestricted domain but this implication is also true even in this single big preferences domain. So now we are interested in designing non-dictatorial social choice functions so the the non-dictatorial social choice functions we need to define one additional property called anonymity so what is anonymity anonymity says that the outcome is insensitive to agent identities I mean the name itself is quite self-explanatory that it is not looking at the agent identities it is just looking at their preferences and making the decision based on that so the permutation of so we will have to define for anonymity something called a permutation of the agents so let's look at sigma which is picking one of these agents and possibly renaming that the same agent with a different name so maybe agent one is now called agent three agent two is called agent one and so on now what we are going to do is we we are going to apply a permutation sigma to a preference profile B to construct another profile now the how is this permutation done the preference of I goes to the agent sigma of I which is the transformed version of that agent in this new profile and we are going to denote this new profile as B superscript sigma so let us look at an example to understand what it means so suppose we have three agents and sigma is following it maps one to two two to three and three to one so if you if you look at the original preference profile which looked looked as this now one has become two so the same preference profile will go now go to the agent two in the new game in the new transform game two will go to three so the two's preference has gone to the agent three's preference and three's has become one so three has become one here so that is the the meaning of this permutation of this permutation of the preference profile now the social outcome should not alter due to agent renaming so what we have done we haven't changed anything in the population that the same population remains we have just renamed the the agents and the idea of anonymity is that this social outcome that we are going to get from the from this population should not alter due to the agent renaming so formally the social choice function f is anonymous if for every profile B and for every permutation so this is very important to look at any possible permutation of sigma then the in this new world so in this world the social choice outcome that was there should be the same as the social choice outcome in the original original game now you can answer this question that can you find an example of a non-anonymous social choice function and the hint is that we we have actually seen that in the past think in the lines of the gibberish other way so if you if you tie the the outcome let's say an outcome if we define our social choice function in the following way that it will be the the most preferred alternative of player number one and now you are actually tying it to a very specific player so if the players if you alter these players using this permutation of these players then what the new player one has a topmost alternative of B while in the original game the topmost alternative of player one was A so you can you can begin to see that the social choice functions which actually tie to a very specific player let's say player one and its top alternative that is not going to be anonymous and you we know a name for that that is a dictatorial social choice function dictatorial social choice function is not anonymous and by we'll see in the next module that by introducing this notion of anonymity and enforcing this we are actually ruling out those dictatorial allocations


Okay, so hi again. Thank you for attending this last presentation of the day. So in case you were not at the previous presentation, I'm Pierre-Marie and I work at Haydecaux. And so this presentation will be about small library to read thermal files. So what is thermal exactly? Let's first describe what it's not. So it's a format, it's a text format to record data basically. It's generic, just like XML, JSON, and EML, which I will compare it to. So in XML, everybody knows XML. It's a format that is more or less easily written and written by humans, more or less because it's a bit verbose. And one of its defaults is that it's expensive to process. It's a complex format and writing a XML parser is a big job and it's very hard to get it right, not only to write the parser, but then to write something that uses a parser because of the format complexity, such as the namespace feature validation is cumbersome because basically between tags you have text and well when it spaces it's fine, it's just notation, but when you have extra text, is it valid or not? You have to, it's complicated to check that an XML document actually conforms to some given format. There are tools to do that, but they are even more complex. So well, XML is something that is good for some purposes, but it has these defaults. So another widely known format is JSON. JSON is also very easy to read and write for humans. It's very easy to parse for machines. There is a specification for that, but it has again some shortcomings, such as well, this document is invalid because you're not allowed to have a comma at this place and if you have some experience writing this kind of document, you know that having this comma is handy because you don't have, when you add a new entry, you don't have to add it there anyway, it's handy. JSON does not allow strict JSON because some implementations can be more permissive. There's no provision to write comments. I'm sure there are other problems. So, and there are several known gotchas, so you may know that JSON comes from JavaScript and in JavaScript you can't. The spec does not make a difference between integers and floats, so basically everything is a float. And so when you're writing numbers in JSON, you don't know what's the precision that the implementation will use to represent your numbers, so you're not sure that your numbers will be preserved basically. It's a big issue. Another widely known format is GML. So it looks actually, it's a superset of JSON, so every JSON document is a valid GML document. It's easy enough to write, but actually the format is very complex and adds a lot of subtleties, so it's not very, depending on who you ask, it's not very, it's not a format that you can write things in and be confident in how it will be interpreted from the first look. And yes, you have several annoying gotchas. You don't, strings are not, there's no need for quotes, so generally you write strings without quotes until the string you want to write is some magic keywords such as a new, which will not be a string, it's gonna be interpreted as a new value. So it's not very nice. So after this quick tour of readily known text formats and their defaults, their issues, there is Tamil. So it's a file format, you have an example here. It's a file format that looks a lot like any files, the older format that was mainly used on Windows and some configuration, mainly in configuration files. So Tamil has been created specifically for this use case. It's easy to read and I mean it has obvious semantics. So here you have a mapping title is an entry that is, it has a value that is a string here. You have first-class dates, dates is a native type to this format. It's mainly oriented as a mapping between keys that are strings and values that can be anything. Other mappings, arrays and numbers and so on. You have Booleans. Anyway, the format has a specification. It's not formal, but it's very precise. And so it's quite easy to know if, to read the spec and to actually know how to pass and the right documents. And yeah, so it has a lot of good properties that make it a good candidate to write, to use Tamil as a file for your software configuration and sometimes just to record data. So that was for the Tamil language. I didn't invent it. So this is the Canyonical home for the project. What I did on the other hand is oh yes, sorry. So I told you it's used for configuration files. So in the real world, most of the Tamil uses I could find were package managers. So the main one is I think is Cargo, the Rust package manager. And other package managers for other languages also use this Tamil. And as you probably saw earlier today, Alaya uses the Tamil format as well. And so Aida Tamil, it's an Aida library. It's very simple one to read, I mean to pass and to create Tamil documents from scratch. So I've written it actually for Alaya because we were looking for a file format that could be easy to write, to read and write for humans and machines for to describe packages. So this library has two very simple jobs. First, take a stream of bytes and parse it and convert it to in-memory data structures containers. And the other job is to turn this in-memory, this containers back into a Tamil document. So there are two parts in the library to fulfill those jobs. First, you have the definition of the data structures, the containers, and so programs to actually do the parsing and the dumps. And the project is on GitHub. So if you want to have a look, this is the projects home. So, and this is where, oh yeah, okay. Oh, it's good, but the big deal. So the first part is the data structures, the containers. It's very simple. You have two types, so Tamil value and any value type. So Tamil value is what could be any value in a Tamil document, could be a table, a mapping between key and values, could be an integer, a string, or any other data type allowed by the Tamil format. And you have this enumerated type that describes what's behind a Tamil value. So is it a table, an array, a string, a date, an integer, a Boolean, could be anything. And you have this function kind that takes an existing value and returns what is behind this value. All right, so you have naturally functions to create values. So if you want to create a Tamil value that is a Boolean, you call the create Boolean function that takes the actual value you want to store inside a Tamil document. You have the same for integer, tables, and so on. And also functions to add an entry in a mapping, all sorts of operations you would like to do with the containers. So that was to create values and you have the corresponding other operations to actually read the values behind the Tamil document. So here the asBoolean function takes a value and assuming that this value holds a Tamil Boolean, it retains the corresponding A-Boolean. Otherwise? Or it's a precondition, so otherwise, you have an assertion error. Yes, as I said earlier in the slides, it's a NAIDA 2012 library, so we can use preconditions there to actually be specific about what are the requirements for each function. So it should be quite natural. Well, this library does not do anything complex, so it's supposed to be very easy to use. Yes? Because that would, yes, well, it's a personal opinion, but I have the feeling that having multiple constructors, the only way as a human to understand which, so you're talking about overloads, having multiple functions, having the same. Don't we return the same type anyway? Sorry? Don't we return the same type anyway? They do return the same type, but they. You can't do all of them. I can because they are part, yes. But when you have the thing is that when you have, because of the shape of this, wait, let me. You get the both of the best of both worlds, to place your function create integer. Yes? The function creates, and the parameter is called crop integer. Yes, well. They would name parameter association. Actually, that works for the atomic data types. That doesn't work for arrays and tables because you have constructors that just create empty containers. So for tables and arrays, that doesn't work. Indeed, it could work for the atoms. So Booleans, strings, integers, dates, and so on. But as a feeling that if you do that, if you rely too much on overloading, the code ends up less readable because as a reader you have to, I mean, if you have create integer and provided directly an integral literal, it's quite obvious what it's doing. But if you have, is factually, instead of 42 here, you have other calls, other functions, other something, anything more complex, your brain has to work a little bit more to know what it's doing, actually. But that's right. And then you have to rely on actually coding practices to make the thing the less, the more understandable possible. Yes. Anyway, so this is what the, using the API looks like to build values. So it's quite straightforward. Here we create an integer, a string, and then an empty table, and then we fill the table with the values that we just created before. And so if you're familiar with JSON, by when the execution reaches the command, you have in T a document that is equivalent to this JSON document. And here you have a small example of what converting terminal values back to a native Ada values looks like. So that was it. With that, you can create terminal documents programmatically without passing any terminal. But then, so, so yes. First, still in the terminal package, the main package that define containers and so on, you have two functions to actually convert a string to a terminal value and the other way. So, well, it's not directly returning a terminal value because when there is a passing error, you want to actually return an error. I decided not to use an exception because of various practical considerations such as the Ada standard does not guarantee that the message that you associate to an exception will be preserved. I mean, you don't have any guarantees regarding the length. So for error messages, it's not great. And also, anyway. Also in the read results also contains the source location of the error. I mean, it could be in text, but I prefer to keep it as numbers. Anyway, so that's quite straightforward to use. There is another package that actually allows you to do this the same, but instead of dealing with terminal documents strings in memory, it goes to the file system. And finally, if your terminal documents, you don't want to read it from memory or from a file. For instance, if you want to get it from the network or from a compressed file, well, there are generic sub-programs that just abstract the stream of primitives to read or write the terminal file to and from an abstract stream. And that's it. So again, here is the project home. So this library is already available in Alaya. Fortunately, because Alaya requires it. So it would be a shame if it wasn't for you to stop there. There is only one release. It's a very young project. And as far as I'm aware, the only serious use of this library is Alaya, the Alaya project. But still, the first release is, I mean, the API probably won't move much except if I rename constructors, but that's another debate. And so you're welcome to have a look and if you want contribute. Thank you. And if you have questions, I will be... Just a remark, there is another benefit of terminal that you didn't mention is that you have no closing bracket. Now it's very important because if you want to accumulate results in a file, you cannot do that in Yemo because when you've closed the bracket, there is nothing you can do after that. Take a tool like an example in a control, which, by the way, can have its output in terminal format. Then you can run it several times and accumulate the results in the same file. Yes, the text concatenation also works from a valid document concatenation. Yes, absolutely. And that's something you cannot do with Yemo. Yes, that's right. Well, that works for the maps. Actually, it depends. I mean, it works for the top-level document, for the top-level mapping, but you can actually have nested, you have a syntax to create nested tables, but all that doesn't matter. Another thing I didn't mention about this format is that it's specified, actually, it's not a text format, it's a binary format, in the sense that it specifies that all documents must be, must use UTF-8. So you don't have to worry about encodings when you use this library, more or less. Because when you provide it a string, it's assuming that it's a valid UTF-8 string. Other questions? Yes? Are you also the author of Knack called Jason or did you just take some inspirations from it? I took some inspiration from it. Actually, I'm one of the current maintainers of Knack called Jason. Yeah, I think the API, some parts of the API were easy to use. Yes, yes. I didn't, yes. Actually, the parts where, when you pass, it doesn't raise an exception, but returns a structured error, first class value error. It's the part I contributed to Knack called Jason. So. Okay, thank you. Thank you very much. Thank you.


My name is Mireya Galvan and I'm in the Planning and Data Analytics Department, also called the 4th Lab now. And I just graduated from I am Terrell Academy for STEM and VPA where I focused on computer science and has STEM endorsement and I'm planning on continuing my education at Fordham University in New York. So I've always been interested in local government and everything that entails. There's just so many pathways and so many career paths to that. And so when I saw the Next Gen Ambassador Program, it was an amazing opportunity for me because there's not a lot of experiences and programs for students in my age group, being I don't have a college degree yet and I'm kind of in between just graduated high school. And so I really wanted to get this experience in the professional workplace. I've learned a lot of responsibility so far. Along with that I've learned time management, being given tasks and being able to work independently. And it's also been very empowering given those tasks and being treated as an equal and as a co-worker rather than a student and an intern. So that has been really great for me. Even if you're remotely interested in local government and civil engagement, I think it's an awesome opportunity.


So, he says to me, my favorite horror series of all time is the Conjuring. So what'd you end up doing?  Yeah, I actually threw him off a bridge. Oh, look, we got a new patron request from John Adano for the dentist, 1996.  Hello and welcome to today's edition of Frightfully Forgotten's Trash or Treasure, but before we get started, what are we drinking? We're drinking Tooth Decay Mosaic IPA. Very fitting, because today we're covering the dentist from 1996. This is a patron request by John Adano. This movie was directed by Brian Usina. He did so many horror movies, but one that we gotta mention is Bride of the Reanimator, which we covered. You can click the link above. And Society is another one.  It was also co-written by Stuart Gordon. He did tons of horror movies, but the Reanimator we gotta mention. This movie stars Corbin Burnson, and he's in tons and tons of TV, probably most well-known for LA Law.  A decade. For a decade. Of course, he is in Dawn of the Dead, the best zombie film of all time. He's not in his underwear in this, though. No, he's not in his yellow git. So we get introduced to Alan Feinstone. He's this very respectable dentist. He's very clean-cut, very well-dressed. They got a pool boy outside, muscular and everything, and sweating, and he suspects a little bit of something going on with the pool boy and his wife.  I should have dressed like the pool boy. Yeah, you should have. He goes into his car to go to work, but he actually doesn't go to work, he comes back, and he actually does catch his wife screwing the pool boy for fuck's sakes.   Going down on him, it's like super, actually, it's pretty graphic. This really sets him off.  Four ways than one. They have a dog, though. The dog ends up getting out and he ends up just shooting the dog. Finally going into the office, there's tons of people waiting. Taking this little kid in and it's his first time to the dentist.  On top of that, in comes the IRS guy, Erwin R. Scheister.  He's got some problems. I got a little bit of work that he's doing here. But the IRS really does that. If you take care of my problem, I can take care of your problem. His next client is his beauty queen. Well, she's under. He starts picturing that it's his wife groping her and he's like putting his fingers in her mouth. He's all taking her panties down. He's taking her panties down. Her agent is there waiting. He's like, what's taking so long? We have an appointment that we got to get to. He opens up the door and sees the dentist is all like getting in there and her panties are on the ground. Oh, no, no, she's reacting poorly to the gas. The manager takes the beauty queen and walks off.  It's this dentist.  Everything's just falling to pieces. And all this is happening on his wedding anniversary. His wife is supposed to pick him up from the office to take him out for dinner. He wants to show her his new kind of themed room. Romantic Paris theme. Gets her in the chair. Opera music's playing and straps her in. He's like, well, what's going on? Puts the gas on.  And he goes to town. Oh, yeah. I know what you've been up to. It's the next day. He's at home and cops show up at his house. Dog was killed and a couple of doors over. You know anything about that? Oh, no, no, I don't know anything about that. Pool boy shows up to finish the work that he had started the day before. Skimming the pool and pulls it off. His tongue comes out. What's his tongue all about? The dentist's wife is kind of sunbathing with a hat over her face like this. Pulls it off and her mouth is all torn up and disfigured. She's got her tongue missing and everything. Dentist comes out of nowhere with the scalpel and slits his throat like tons of times. There's blood going everywhere.  He goes back to his office. There's a whole room of people waiting, including the guy from the IRS. You all need some sort of work done. And that's where we're going to end the plot. If you want to see how the dentist ends, finish watching it. But is it trash or treasure? Well, that'll lead us to the treasure part of this. For this type of movie, for a straight to video kind of movie, the acting's top notch. There's not one straight to video performance in the movie. And the dentist is the perfect starring role in this. He's great. Which leads us to the characters. They're all good. They're all memorable. You watch the dentist once. You remember the dentist. You remember actually all of the front office desk at the office. You remember they're all really memorable people. There's also the customers too. They're waiting, right? There's the Marilyn Monroe type woman. There's the girl with the braces that everybody can relate to.  Yeah, they're all memorable, like well thought out characters. The effects in this movie are great. Actually, they're really good. Especially when he starts mutilating people's mouths and you see the aftermath like the wife goes to town on that IRS guy. He's all just fucked. He's got that big apparatus on his face. That crank thing. Super cranking it like... Crank's jaw. And he's all drilling his tongue.   Where you're like, oh. Couldn't have picked a more cringe worthy thing. Exactly. Right, then your mouth, your teeth. Cause like it's so relatable.  And nobody likes the dentist, right? There's also the sounds too. There's the sounds of his gloves. All that squinching sound of the gloves. The drill. The drills. The crunching and the maiming of the teeth. Like... And the kills are pretty good too. Even though there actually aren't that many kills. Yeah. He more maims than anything. Big survival rate. But these people aren't left with much of a life after. No man. Is the problem, right? There's the one woman that he strangles with the pantyhose cause she discovers what he's been doing. With the pantyhose. Yeah, exactly. And the other dental assistant he kills with the syringe with the air bubbles in it. Right to her brain. Right, Halloween II style. The humor in this movie is great and it's intentional.   Well yeah, of course. And then especially with the dentist being so clean. Even subtly humor like the girl that wants to get her braces off and she's showing up day after day hoping today is the day and like, oh, he didn't get to you today. She comes back the next day sitting there all happy and he didn't get to you today. Premise is pretty good and pretty actually relatable too in real life because for real dentists have some of the highest rates of suicide out of any profession it seems. Kind of sympathize with him a little bit. Not totally, but a little bit you do. Kind of see where he's coming from but the means to an end is sort of a little arguable there. That brings us to the trash of the dentist. I think the pacing is probably the biggest piece of trash in this movie. It starts off really good. He's fantasizing about killing the pool boy and he doesn't. Then after that, it takes him a long time to really fall off the deep edge. They were going for a steady decline into madness, right? Yeah, a slow burn, yeah. But it's too slow for the type of movie that it is.  Right away. Right away. I don't want to wait 45 minutes for him to just start naming people. I want to see some good deaths.  And he kind of does, but not quite enough. Not enough. It's not enough to really ruin the movie but leaves you wanting so much more. Sadly, the music is a piece of trash in this, too. And it's done by horror movie legend Alan Howard. He's scored so many movies with John Carpenter as a collaborator and it's like, this just sounds like straight-to-video 90s generic boring horror movie music. Exactly. Do-do-do-do-do-do-do-do-do. Do-do-do-do-do-do-do.  There's nothing special about it, there's nothing intriguing, there's nothing that builds tension.   Come on, you could have did better than this. Yeah. Good lord. Phoned it in big time. Fuck, he must have got a big paycheck or something.  Barely in it.  So that brings us to the consensus, the dentist, trash or treasure. I think it is pure treasure. It's treasure. It's actually a lot of fun. It is. Besides a few points we mentioned, I had a blast while I was laughing and having a good time for most of it but did a little bit of this for some of it, you know? Right, exactly. But it does make you cringe, makes you go like this a lot, which is what it was intended to do. That's what a horror movie should do. Exactly. And there's actually a sequel too, which I really wanna watch. So until next time, keep drinking.


In this review, it was found that healthy diets reduce the risk of gestational diabetes mellitus, GDM, in white European women, but not in other populations. This suggests that diet may be more effective at reducing GDM risk in certain ethnicities than others. Further research is needed to determine if this finding can be replicated in other populations. This article was authored by Harriet Fuller, J. Bernadette Moore, Mark M. Isles, and others.


Up here. Oh, oh, I heard a shiny sound. Oh, oh, shiny bristle. Bristle, bristle, bristle. Okay, pokeball, pokeball. And we're good.


vodka Gin actually nice Else make it go into the morning.  Yes?  I'm Rick you call the in-square Twitter juicy content Thanks, sir. It was from a patron. I'll shoot your Twitter account subscribe to the like button How are things on in twat land as toxic as ever? You literally said that like five times. Yep. I'm gonna say it again Today we actually have a game a Game to play a game to play. Oh, I hope it has lubrication and vibration. Oh, it does And it's a it was made by somebody I'm sure it was it was genius observation. It It's pretty straightforward. They say do not mention his name, so they don't want me to give him credit Which is fine if we call you by our name. What if we call you by there's never there's not a famous Bye. No that one has to go to RuPaul Bye, I Don't know. I was just throwing any other name, but Salman Khan. I don't think he's by he's not Not by any stretch of the maybe is I don't know him personally now, but I don't think he is He's made that pretty clear, but this is actually I think it's actually a stills game So it'll it'll show us a frame right of a film. Okay. We have to guess the film by the frame. Yes, okay. I was a You had done that when on your Instagram story with your son. Oh, yeah, and you got like nine out of ten, right? I got most of them. Yeah, I was impressed. I'm very intelligent. I was impressed. I'm very intelligent like But okay, so here we go. All right You read that you'll each get two chances to guess the movie whoever guesses it will get two points If you don't know the movie Zero points. Okay, so if you guess it right you get two points And it's not a matter of getting it first, right? Yeah, cuz the game's not timed you can decide if you want to add a time element You'll manually change the slide to reveal the movie. I think we just make the decision. Yeah, cuz I have to press the spacebar here. Yeah Simple guess the movie and I don't know if these are all Hindi or if it's Right, we just know I was not told we're just told it's a movie So it could be all Bollywood. It could be a mix. It could be Indonesian We would do terrible. You never know. We probably wouldn't get any of those First one got it one. Okay. I think I need to press it. All right Joe Doc bar Yeah, I would have said the same thing honest and for true I would have said Joe to our and two points is too much math one point It should just be one point for the ones you get much Matthew. Yeah Okay, so it looks like one frame and then the next one is it's the reveal got it so one point for Corbin wonderful ready Okay, too. I don't think that's part of them. I don't think it is. I don't think it's here. We go. Oh Shit, um It's okay. Cajal. Is that it is that key? What's your guess it's okay, I think that's K through G. I think but it could be a couple I'm I think it is that I know I know what it's not so I'm gonna say yes I think it's I think it's K through G in my mind. It's definitely K3. Yep. Yeah. Okay, cool Two points for me three ready Bangor was on to you. Oh Dildo Hockney to it's right It says at the bottom still from Dildo Hockney dough bad editing there was far on even in Bangor's ranked at Wow, it's early Hey, look at down here Connie looks great for Wow, what oh that's pay Pico is it really yep Wow Nice job. Nice job. I would dad daddy. I would not have gotten that one. Yeah, so three to one right on five That's Vicki. Yep. What was Vicki and that's a good one married I'm gonna say believe it or not. It's it's What is it on Really, I think so when did he get me didn't get married. I think there's a I think I think that it's are you talking about the one The massacre one. Yeah, I think it's from there. I don't think I could be wrong I'm not I'm not certain, but that's the name of Sardar Udam. Yeah, that's what I meant. It's early I was I got up at four One so I think it's my son Ross I Forgot he was in that. I forgot That was our first exposure to him was Ross II. I don't know if that was it. I'm pretty sure Ori I don't know. Well, they're pretty close. All right. Okay, so three to one. What in the hell? That's okay Oh, uh, yeah, we met all right. There you go. Yep, 41. I keep hot. I keep thinking those are Stills ready. Yeah Ori That was a tie. Yeah So we're just not gonna count that. No, so still four to one. Yep But yeah, that's definitely Ori great movie man. I watch that again. I was thinking about it This Memorial Day weekend. I was thinking about watching that was a great movie. It's a great movie Just a four to one because we got that one as a tie. Yeah We don't know a dongle. I saw I saw him. What'd you say? I thought it was We don't know I saw him, but then Yeah, back there. It's definitely gotcha gotcha.  It is. It's a great movie. It is. You would not think no Biggest box office success of all time.  I don't know Wish they I wish they had I wish they had shown Helen. No, that's that's an iconic. That's a great image to show on obviously to a time that Seven to one. Wow. Good job Donor Vicki donor. Nope. We haven't seen that Rick. So what this is but die? Oh, yeah, you're right We could still recognize the poster But die. Oh, yeah, you're right. Hey, I'm just guessing anything. I know not necessarily what I've seen I was like, we haven't seen Vicki Donner yet We need to we saw that we saw the trailer like a lump within like the first ago couple months. Yeah Eight to one or not. I don't hate to one who cares Okay, I think it was a tie. Yeah, you're right. Okay still eight to one Ready ready Deli belly no But I do I Don't think so. Oh, yeah, I was gonna say that's not what I do. Oh, yeah How could you not get that? Oh, I love Ludo.  Am I right? I love Ludo. That's so sad No, you clearly don't That's the guy from yeah, it is. You're absolutely right. We didn't realize it Julie Sure sure looks like him. I'll say a little bit. It's so good in that movie. Yeah, he did everybody Yeah, that's a really good movie. Yep Pankaj eight to one still I think who's that? Oh, that's on the hon. Is it? I think so. I don't know. You're right. Nice job As far as you remember anything other than the piano playing him. All right, that's the only thing I remember eight to two Big that's what on I For some reason I always like even though the movies are nothing like mason and udon Interesting yeah mixed up in my mind got it So I was like my son and I was like that's a mason and but the names always get mixed up for me So eight to three. Wow. Hey, can I call it a comeback? Yeah, unless it's all over your back. Wait, what? Eight three Yeah So it looks like all Hindi 93 is that Bull bull is that bull bull? I I I Would never be able to guess I genuinely don't know what that is Wow, good job 10 to 3 baby. Good job. I love that movie Still one of the best horror Great, but I wow. Yeah from that that image. I was not able to decipher 10 to 3 Oh Crap, um, it's with Nassir. Oh, what's the name of that movie? That's KK. That's so good You know it say it cool. Oh Son of a gun. Yeah, I knew at the minute I saw him on your eye cushy up. Oh Hey, wait, isn't this here in that movie? Forgetting okay, I love it three. Yeah. That's a great movie. Oh, I Was just seeing if you were gonna get it 11 to 3 Oh Nice job. I was trying to my brain. I was like 11 to 4 nice job What was that it wait? Oh, don't show it. What it? No, that was it. That was it. Okay. Okay. Oh 11 to 3 No 5 because we tied twice Well, I had outright for oh was that one for yeah, so six you've technically got I've technically gotten Include the ties. Yeah. Yeah, but I whooped yo motherfucking ass. Mm-hmm.  I'm glad yours so desperately in need of affirmation that you do that for yourself I'm not I just am a very competitive And it this is true. I know this for many years of game nights Incredibly and decade of Oscar pay. I have a Me my wife me my wife. I've had a Peloton for a couple years now. So you got it used on the Facebook workplace a couple years ago And I've started to use it a lot more now since I've started to work out There's because it has this thing where it actually tells you there's a leaderboard of everybody's ever taken it Right and those crazy numbers on that But there's people that are in there at the same time as you okay not competing it But it'll tell you where they're at in terms of alpha. They're not competing But Corbin is on I have to win every single of course like if whatever they're out because it tells you your output And I have to beat their number Some of my favorite time was at Oscars when We would win because we were always talking about who's gonna win who's gonna win and whenever he got the right one It was always this giant in your face and he'd stand up into a pelvic thrust in my face And I would sometimes wish you would win just so I could see the celebratory ridiculous sometimes. I literally always win Every single time. Anyways, that was a lot of fun. Thank you so much. Yeah, thank you.   There was not one that I The one that I really was done on the one I didn't know I I knew it after it was revealed It was one of those. Oh, yeah guy. I forgot he was in it But the one there was only one image where I was a hundred percent. Yeah, I had I could not place it was also A lot of these have been predominantly Bollywood, which is great Obviously, it just depends on the person that makes it in what they watch. Yeah If you want to make a tumble one if you want to make a Please to Lugo all south India. Yeah Bengali Such a ride We'll play them all man. It just I can't make them myself because I don't know all these So it's like I knew that what you did. Yes, I made you made this one I made this you son of a didn't want to know he just we didn't want us to tell us his name That's why he was unnamed Trig that would be funny though Anyways, let us know and please send us more games and what you got down below


So the process of what you call as spiritual is not a psychological process. Your memory has nothing to do with it. It's a life process, it's an existential process.  To do this, we do many things here and you know, you might have seen people in the ashram walking around with those orange tags. You've seen the silenced tags people are wearing.  To become silent is possible only when you do not think much of yourself. If you think something about yourself, if you think I'm smart, how can you shut up? You tell me.   Then you can simply look at life with great sense of wonder, without a thought appearing in your mind.  If you see one thing, a thousand thoughts will go off, isn't it? You're not sitting here in the satsang, totally silent. You're agreeing with me, disagreeing with me, making comments within yourself, making comments about the clothes that somebody is wearing next to you, appreciating it, depreciating it. Everything is happening, am I wrong? Because the moment you think there is some value to what you think, then you can't stop it, no way to stop it.  When you see there is absolutely no life value to your thought process, it is just memory recycling itself. It is just the same old nonsense re-cycling itself. But if you're excited, if you're enamored by this recycle, if you think it's great, you cannot stop it.