There is common sense, there is sense and there is something beyond sense. With common sense, your survival process gets handled. You don't have to be brilliant, you just have common sense. You will survive pretty good, you could turn out quite street smart. Actually, if somebody very intelligent is walking down the street, let's say Albert Einstein is walking down the street, a street urchin can easily con him. Albert Einstein doesn't have the wily nature of the one who is walking the streets every day. Very easily you can disable him. You may have enormous intelligence about something else. So, because the street kid has more common sense, common sense is restricted to a certain habitat. In that habitat it works. In another place, your common sense doesn't work. You know, you heard of the ISRO, they have sent a Mars probe now. At ten percent of the cost what NASA would do normally, because it's all indigenous and they build it up in their own ways. So, they were interviewing people to be taken in. For a job in ISRO, Shankaran Pillai applied. He is very street smart, a lot of common sense. So, the interviewer asked him, which is closer, Moon or Mumbai? They didn't bang along. Shankaran Pillai looked up in the sky and he said Moon. He said, what? How do you say that? He said, well, I can see the Moon, I can't see Mumbai. So, this kind of sense goes well in certain things. But if you want to transcend, you need a different kind of sense. This kind of sense is good on the survival mode. When you're on a survival mode on the street, this kind of sense works pretty good. If we try to go all over with this kind of sense will become one big mess. So going beyond one senses and knowing, why is it needed? It's not needed if you're thinking in terms of a need. If you're using the word need as whether it is necessary for my survival or not, it's not needed. But unfortunately, if you had come here as a chimpanzee, it's definitely not needed. But your tragedy is you have evolved into a human being. Wanting to live like a chimpanzee doesn't work. That's the whole problem. Human intelligence and awareness has come to a place where it cannot limit itself to the ambit of survival. It has to. Look, now what we're doing as a solution for this problem is not a problem, it's a possibility. Every possibility, those who are not willing to take on the possibility for them, it seems like a problem. It's a phenomenal possibility. But most human beings are treating it like a problem. So how they're solving the problem is, raise the bar of survival. Keep on raising it. What was your idea of survival twenty-five years ago? What was your idea of survival fifteen years ago? What is your idea of survival today? It's raising the bar, isn't it? Two meals a day was survival when you didn't have anything. If you have known that such a state, it's good to know those things. But now, maybe mercy is survival. In every different segment of society, survival has been raised to a place where billionaires are still struggling to survive among their community. Yes, I have had this opportunity at close quarters to see multi-billionaires, but they're still beggars.  What… how many more pennies can I gather? It's the same stuff. It's just the numbers have increased but the experience of life is still the same because you raise the bar of survival. Now your whole life, it doesn't matter what you do, still goes in survival. Everybody, I… I won't fix this for you. In your life, you must fix it. How much is survival? You must fix it somewhere. Now, not after twenty-five years when you get there, no. Now we must fix, this is my survival. Then what do I want to do? My survival is taken care of. What is it that really matters to me in my life? Whatever that is. If you don't structure our lives like this, forever you will be fighting with phantoms. Why I'm saying you're fighting with phantoms is, in other countries where the bar of survival has not been raised so high, people can change the course of their life when they wish. I find in the most affluent nation on the planet, everybody is enslaved for thirty years minimum. Their house loan is for thirty years, car loan is for five years, another thing is something, their insurance, this, this, this. They just fixed. Tomorrow morning if they find something really compelling that they want to do, they cannot do, they can only do it after thirty years. We did not come to affluence for this. The idea of affluence is you have the freedom to change the course of your life, do what you want to do. You don't have to be stuck with what you thought was the best thing when you were twenty. At twenty you may think this is the best thing, at forty the damn thing means nothing. If still the same same things mean a lot to you, that means you're stuck. You're not growing, isn't it? A whole lot of people are stuck at fourteen, not even twenty. Same things, still they're excited about somebody's body part, they're still very excited about... it's ridiculous. When you're fourteen you are excited, I understand. When you're forty-five, fifty-sixty, you're still in the same bin. Is it tragic way to live? Because a sense of life is that we are able to explore as much as we can when we live here, to know and experience everything possible that is there in this life.


Team of the Year! Oh my God. I wanna say a lot about how this makes me feel, but I also wanna be monetized on this video, so I'm just not gonna say it. Bro, not only did Team of the Year just drop and there are a ton of absolutely insane cards, but they actually gave us a Team of the Year fantasy pack that you can buy with only training that contains all 96 overall Team of the Year players user picks one. So generous!  It's always like a complete random pack. That is so cool. I wanna open up those training packs and I wanna get some Team of the Year players on my pack and play squad. Here's how we're gonna do it. However much training I get in all the packs I open today, I can use towards any of the random Team of the Year packs. I cannot open the fantasy pack. Honestly, in my opinion, that completely ruins the point of the pack and play, because if I could just choose any of the Team of the Year players, then why the hell wouldn't I just go on the auction house and buy them? Like it's the exact same thing. What bundle do I open?  A Legends fantasy bundle says I have a 9% chance of getting a 94 plus overall.  I don't like openings that much, but I think I'll get the most training out of this. There's also a chance there's a 97 overall Fletcher Cox Proble Limited packs right now. I am absolutely dying to know what that pack animation is. I don't think there's like damn near no chance I'm actually gonna pull that, but. All right, our big three on the first pack, I'm already Cooper out. You know what, this is all ready. Oh, okay, we're good, baby. We're good, baby. Yes! Like he's not going on the team but that's the training I'm looking for. Let's go. Keanu Neal in the first round, Annotation Hill. Ooh, Patrick Ricard in the second round. I was so not ready for that animation. Hey, 90. So I'm talking about baby. Let's get that training up. Another Usume, whoa. All right, baby. I see Kyle Van Noy, a series redux probably. Yeah, I was about to say those don't give me hype anymore. They have some trash series redux impacts right now. So, Archon Latimore, Keeshon, damn. Keeshon Johnson, that's actually sick. Yeah, I pulled Keeshon Johnson and Mike Evans father all in the same pack. Trent Williams, Kalel Mac, and we do get a big legend. What do we got, baby? Nothing too special. So far though, I don't think any of these Oh, hey, we got a big legend right on this one. They should adjust those animations instead of cucking me like that. Keeshon Johnson, Lamar, whoa. You can still pull these. I know you can still pull these. I also got Eric Wilson and Nick Chump. Why am I second rounds better than Mike? Why am I second rounds better than my top rounds, bro? That's wild.  Not to mention, I know you guys saw it, but he DM me on Instagram and we're gonna play a game at him pretty soon. It's gonna be a banger.  Let's go. Let's go. Second round's kind of an L here, but dude, this is the Will Clap Pack. I don't care what I get in the Will Clap Pack. I'll get a 91 chance to sharpen the Will Clap Pack. Where'd he make it? I'm gonna promote him and start it right now so I can't like, forget about it.   Playing the game back to that. If I wanted to, I could make that the title. I probably, oh, big legend. No, it's gonna tuck me, isn't it? Yeah, it's gonna be good. I knew that. Good try, though. You almost got me. William Clapington in the 15th. Let's go. I can't believe that happened. Buddha Baker, Zach Martin, damn. Wait, that might actually be good. That might. I don't know who my right guard is right now, but I gotta assume he's better. Tyler Lockett, Devonte Adams, and yeah, man. That's just rude, honestly. When they give me that, it's just rude. Weird first round. We got Tyree Kill, Chase Young, Diggs, Nate. Hey, that's actually a good sign. Honestly, Kenny Clark, damn! I don't get any training from Kenny Clark, though. I didn't actually think that through. 86, Lawrence, Taylor. No, no, no, no, no, no! I need to see that animation again. Wait, what? I skipped over it like it was a weak-ass animation. Dude, am I stupid? Okay, so there's the 50 animation. What's the animation here? Thank you for 95 million. Hey, I don't think I'll be quick-selling him, man. I think he's going straight to the squad. Dude, get some nice 88 plus over all legends, players, top results. If I can get something really good here, give me a lot of training. All right, come on, let's see it, baby! Yes, okay, okay! Hey, 88 plus, we get a 93. I'll absolutely take that and do it. I don't even give a... Oh, damn! See, like, there's no animation on that, but I got an animation on 87 Joe Thomas. I'm going to make sure the lineup has all the best possible players that we just got, and then I'll start quick-selling. And then I have a 91 Zach Martin instead of an 88. I like that. Then I defense the Marcus Peters. Oh my God, that's so good. Sadly, I didn't get a new strong safety. I'm still kind of stuck with that, man, up there. Although, one of those Troy Vincent's is going to be pretty nice here. All right, now I'm just going to go through. I'm going to mark literally every single thing we just pulled that isn't on the lineup, and we're going to see what it looks like. Damn, this is actually going to be a lot of training. I'm so geek. I can't quick-sell with Clapdoe, even if it's the duplicate. 96K for the first wave. 77K for the next wave. I'm going to quick-sell even all the old stuff I have in the slide-up. Anything that isn't getting used right now, go into the dungeon for some team of the ear players. All right, boys, we're finally done. We have 457,000 training. I can use training down until I have 188,000 left. Is that what it was, 188,000? I think so. Yeah, we got to go defense. We're definitely going to start out at least three defensive packs.  I know this shit's going to be lit. Random defense team of the year player, 39,000 training. Wish me luck, gentlemen. I want to see this animation so bad. Let's go. Let me see that. Ah, you're shitting my teeth.   Oh my God. I'm buying a ticket to Brazil, and I'm bringing three Tiki torches filled with gasoline. I'm lighting them on fire, and I'm throwing them at the goddamn Tiki hut where the six of ragged tanks are making mad at 21. All right, boys, I restarted the entire game.  Yes! Give me that animation. What do you got? Exactly. I said we're on defense for our free safety or a strong safety. Now, not to mention Jesse Bates was a Wheel of Mott legend back with his, like, I think it was 88 overall team of the week cards. He was in my lineup for a long time.  Now, the scary thing would be if we got a duplicate. That's where this will get bad. So we have to continue to get separate players every single time. I'm gonna go string tag the EA. It's not a garbage company. They're not a garbage company! Joey Post! We are taking no Ls right now. Come on! I'm not benching Patrick Willis, but on Monday, David's still really good. Honestly, the only pull I'm looking for now is either Bryce Callahan, Zavian Howard, or Jamalax. I don't want to be in this endless loop of quick selling and just doing that. So give me one of them right now! God, I'm so elite, bro. I'm so elite. I literally spoke it into existence. Offense, what I would like is, I'd like Justin Jefferson or Russell Wilson. I really don't need much else. Offensive line is cool. I don't want a center. Don't you dare! We get seven digs. So good. So, so, so, so, so good. I'm definitely happy that's seven digs. He's gonna be a beast. All right, hey, another offense. Team of the year pack. Can you clutch me out? Keep me on a hot streak! Trent Williams. Hey, Trent Williams was mad because I just took him off the lineup for Jim Bokovert, but now he's right back in it. Final pack, I'm actually gonna go a random specialist team of the year player. I don't even really know what's in these packs. I have not looked, but I'm excited to see! Damn! That gold glove, Grady Jarrett. Rush defensive tackle. I'm cool with it. I don't even want to re-roll, dude. You got so many great positions. I'm just ready to go put the best possible lineup in and go absolutely ballistic on somebody. Let's do it. All right, ladies and gentlemen, we're only up two overalls. We have from a 90 to a 92, but the insane difference that this team has is unbelievable. The only real liability left on the Pack-A-Bloy squad is Chauncey Gardner Johnson. I'm serious, it's so sad, honestly, but Bryce Callahan, amazing Marcus Peters, amazing both from today's episode. And then on offense, we add digs and Trent Williams. Without further ado, let's hop into this game. Now, I won't, I completely messed up my record for the Pack-A-Bloy squad. If any of you can remind me what my record is supposed to be in Pack-A-Bloy, I don't know if you guys would even know because Pack-A-Bloy's kind of scattered, but I know that once we make the playoffs, that's where the Pack-A-Bloy squad resets. I don't know what I'm supposed to be, so. I'm sorry, I don't know where I'm at.  We got Valentine's Day in like two weeks. Don't let nicks and cuts ruin the big day. If you're not clued in, Manscape is the global leader in men's grooming and hygiene. And they have the perfect all-in-one men's grooming kit for you, it's called the Perfect Package 3.0. I wanna walk you through it, this thing's awesome. They also have new refined cologne, you're gonna want that for Valentine's Day. But okay, let's get into the products. Number one, the flagship, Lawn Mower 3.0. It's got advanced skin-safe technology for the really sensitive areas. Got this little LED light to guide you, waterproof cordless, the best. Also comes with ball deodorant and ball toner. Don't sleep on this stuff, very important. Listen, if you got a girl unlike me. If she needs gift ideas for you, this might be the absolute perfect gift because you both benefit, you know? Hey, 100%, make sure to check this out, boys. There's a link in the top of the description that's gonna get you 20% off and free shipping that's at Manscape.com. Hey, Manscape, thank you as always for sponsoring. Love you guys. Gentlemen, enjoy the rest of the video. Opponent has already snagged the Xavier and Howard. He's got a 98 Camara. This is gonna be a fun one. All right, foe, you shot a little con. Let's do what we do best. Oh, let's get a mean learn.   He goes with a slip screen. I don't know. I think it's these jerseys, but something's throwing my eyeballs off right now. Oh, he throws in the middle of the, whoa. Wait a second. I'm getting dotted up. Come on, baby. Oh, okay. No, you did it. Wait, I just got actually lost. Like actually, that's like, that's a lot more realistic to NFL football than what Madden usually does. In most of the time in Madden, if you throw to a contested one-on-one wide receiver, the corner just goes up in one-hands. He's literally just gonna look at Mac after I, no, not right now, dude.  It's fourth and nine, bro.  Hey, give me the dump. I got a dump for that? Bro, it looked like I was gonna get smoked. Hey, free dubs, baby. Robert Woods, Ocho, Cinco, Drew Brees. His gamertag is soccer rocks.  In fact, I played soccer for more years than I played football, which is why I was a kicker.  You probably don't, but. So kindergarten through fifth grade, I played soccer and I was really good at soccer. And then I moved to schools, I moved to DeWitt. Football was the coolest part of DeWitt, soccer was not. So I basically got peer pressured into playing football. Excellent decision though, because I had an amazing time, I love football. All right, first intent, what are you cooking up, Brees? Oh, what are you cooking up, Brees? You're cooking up to my Gilmore, baby?   I want my berry to cook, bro. He didn't get to cook as hard as I wanted him to last game. Just broke two ankles for eight yards. I'm like, fourth and two in berry. We trust, easy. It's too easy for him. All right, first intent, what do you got? Digs, digs, ah, that throw, great throw, amazing throw. It's such an easy touchdown. All you do is you look at Todd heaping brides and you say, wow, you've got a heaping bride, honey, every time.   That's not open. None of this is open. Where you gonna throw, Brees?  Who took that? Chauncey Gardner Johnson took that.  We're gonna get, we should probably get a rage quit pretty soon here. Wait, this is Holder Blast.   What is it? Two fouls and forcing completions.  Just quit. Just quit. I might as well fumble that. Wow. I actually just show voted and didn't fumble. No, Barry hasn't gotten a touchdown yet. Gotta distribute the wealth. All right, Bates, let's go get this shmoney, baby. Let's get a stop, boys. Certain three, big stop, gentlemen. Big stop. For Hill. That was clean. That was pretty clean.  There's a diving one, too. So while we put Acrobat on him, gentlemen, throw it to Diggs. Like, I think he's that much. Oh, he's not. Step up, Rogers.  Swerve. Swerve. I'm having way too much fun. I need to step up. All right. Go to roll out. Wait. Damn. That animation is so set up to, like, her failure. All right. She's going to go Mary underneath. Let him do his thing. Ooh! Ooh! Damn it. He finally got to me. Set your feet, Rogers, and secure that. Ice. Russell Wilson could never have made that throw. I'll tell you that right now. Go, Diggs! Go, Diggs! Go, Diggs! And zone! Nasty. Barry for two. He had him. No way. Wait, no way. I was stretching. Wait!  No! Soccer Rocks just scored six on me, and celebrated the touchdown. Because I swear to God, this will be open every time. Oh, wait. No, no, no. That's literally not what I meant to do. Shit. Wait, wait, wait. Take that out to the one. He took it out to the one! We're totally getting a save here. Hurry, hurry, hurry! Get there, Gartner! Get there, Gartner! No! He, oh! He got so lucky. He pushed forward. Get there, get there, get there! Oh my God. You're not going to score again. I brought so much dishonor to my family in the past two minutes. All right, man. I'll play a cover two, and no matter where you try to throw this, it will not be open. You will have to run this ball. Try it, Duff. Boys, we got to make up for our sins here. Yup. Secure it. Roger's got the X-Factor lit up. I think it's a run-in gun. You can't guard that with Thierry's Leonard. I think it's Bazooka. Yeah, it looks like a Bazooka. I'll say that much. Oh, look at Diggs! Got him again. That was a slam. After getting shelled 14 straight, we're going to see it's there. J-N-K, does he have the- Ooh, ooh! Damn, out of bounds. He's probably going to take the underneath route. Right here, right here, right here, right here. Oh, fumble! And Bolster grabs it with one hand! Oh! Finally get a sack too. Impressive, boys. I'm on Grady Jarrett, baby! You like that? You like that Grady Jarrett Lurt? You like that, boys? He just got lured by Grady Jarrett. You got to go. Wait, what did I win by? 24? Depression. Trippin' 28. He dropped 14 unanswered. Pretty solid. Honestly, a perfect game for the Team of the Year video. That was so much fun. We get a free game from Rat Tail and Soccer Rocks. We just get to go absolutely ballistic. Squad's looking good, bro. 92 overall. That's what Wheel of Muzz is. Wheel of Muzz 92. All right, hey, I love you guys. Thanks so much as always. I'll see you in the next video. Peace out.


Hello, my name is Margaret Holben Ellis and I'm Vice President of the American Institute for Conservation of Historic and Artistic Words, the AIC. We're the national professional organization of conservators. Conservators strive to preserve cultural heritage made up of books, paintings, DVDs, drawings, sculpture, flags, costumes, monuments, even entire buildings. The humanities are what make us human. The evidence includes famous and priceless paintings, but also anonymous and equally priceless historic artifacts. They are physical manifestations of our humanness. Comfort witnesses to what we think and what we do. Our mission is to make sure they're preserved. This way the next generation can experience its humanness through material culture. Thank you.


Presidential candidate of the All Progressive Congress, Boila Tinibu, has told members of the party in the northeast that they have reasons to work for its success at the polls. Tinibu said this in Gumbay during the wedding reception of Mashbahu Yahya, son of Gavna Inua Yahya. He said with the emergence of Senator Kashim Shatima, his running mate, members of the party in the region had a duty to work for the APC's success in the 2023 elections. Hello, hope you enjoyed the news. Please do subscribe to our YouTube channel, and don't forget to hit the notification button so you get notified about fresh news updates.


Hi, welcome to In the World of Winooski. I'm Mayor Christine Lott and I'm joined today by our Director of Public Works in the City of Winooski, John Rauscher. Welcome, John. Thank you. We are here to talk about two bond votes that you'll see on the Town Meeting Day election this March. Before we dive into the details, just want to start with what is a bond vote. If you haven't voted recently in Winooski, we have had several of these. A bond vote is basically a loan that the city takes out to cover significant expense items and we are required by state law to get voter approval on that. You'll be asked on the ballot if you approve us taking on this debt or this bond and allowing the city to borrow money that's paid back with tax dollars. There's going to be two bond votes on the ballot this Town Meeting Day. For example, John, can you share some items that might typically require a bond vote? Sure. So typically anything like large equipment, so say a fire truck or if we're doing a major street reconstruction project where we want to take out a long-term loan, that's when we'd look at doing a bond vote. Yeah, it's items that take like 10, 20, 30 years in order to pay off. Correct. Yep. Let's take a look at the two items that will be on the Town Meeting ballot March 5th. So they are called Article 6 and Article 7. The first one, Article 6, will ask you if we can use leftover bond proceeds from a prior bond vote from the Hickok Street Reconstruction Project to make additional capital improvements. And then Article 7 will be a bond to pay $4.6 million towards the Burlington-Winooski Bridge project. So let's talk about the details of each of these. So Article 6, in 2019, voters supported a bond vote of $1.3 million to reconstruct Hickok Street. This project was completed under budget, leaving over $500,000 unspent. And because of the rules of a bond vote, these funds can only be used for street reconstruction as authorized by voters. John, can you tell us a little bit about the leftover, like how did we end up with leftover money from Hickok Street? Yeah. So we, as you mentioned, we performed a reconstruction project on Hickok Street primarily because of water main replacement work that was pretty critical. We were having multiple breaks. So we reconstructed the entire street, sewer, paving, sidewalks, curbing. And we ended up being a bit more efficient with the project, because we didn't have to reconstruct the entire street. We were able to do some work without disturbing some of the piping underneath. So we were able to, what's called slipline sewers. We didn't have to excavate down to the sewers to rehab them. So saved us a significant portion of funds that is now allowing us to potentially roll that to another very similar project. Yeah. And we can't, because of the laws around these bonds, it's not like we could invest this money or put it into the general fund or use it for other purposes. Right. So this is the language, the actual language you'll see on the ballot, asking to approve use of up to that $515,000 of unexpended proceeds for work on, oh, we don't have the actual streets listed in the bond language, for additional infrastructure improvements. So let's talk about what those are. So this is a picture of our annual paving plan. And can you tell us a little bit about that and then dig into where I've noted here, bond vote approval? Sure. So this is a slide that we showed during our public budget presentations. So what you can kind of see here is there's two boxes, both with some FY25 work that we're proposing. So the, on the right hand side, you'll see some streets that are listed for the bond vote work. So that is Reginald, Bernard, Florida Ave, and we've... Gail or Roger? Gail Street up there. So what we're proposing to do is use those bond proceeds that are left over to replace the concrete curbing, which is in really, really poor conditions, some place it's not even existing. And we're also replacing the sidewalks for those streets because of the grade of the roadway, if we're increasing the curb height, we're also going to want to increase the sidewalk height as well. So we have proper drainage. And what that'll allow us is in a future year, FY26, we can go ahead and then resurface those streets. So we have to do some of that work before we can get to the resurfacing work. And these streets were actually planned for resurfacing a year or two ago, is that right? Yeah, correct. So our crews actually have done quite a bit of work on those streets already. Our internal DPW crews will go out and the manhole structures in the street, they'll bring them back up to grade and make sure they're in good condition. That takes a few weeks to do that work. So a lot of these streets are already prepped for for paving work. And then looking back at the slide, we have in the upper left regular FY25. So there is always funding annually for a certain amount of repaving work. When your crew discovered that the curbing was kind of shot on the other side of town, what is the funding gap that that like curbing is significantly more money than just the annual repaving? Yeah, the the concrete work is substantially more expensive than just resurfacing a street. So in this case, it's, you know, the bond amount that we're looking to roll over about half a million dollars in just concrete work that we have to do ahead of the paving work, which is more like $200,000. Okay. And so you said it would be FY26 when the actual paving would happen. So to be clear, will FY25 work happen this upcoming summer or the one after? So we're looking to do that work this summer. That's our target. We do have some big construction projects going on. So there is a chance it could slide into the beginning of, well, FY25 is it bridges into the next next year. So it could be later in FY25. But within the FY25 period targeting this summer. Okay. And then for reference, it's Pangro Terrace and up there upper North Street is that's just the regular repaving work that we do every year. Correct. Yep. So that's our typical, we call mill and resurfacing where we replace inch and a half of street pavements. It's about 0.6 miles of paving centerline paving. We estimated about $212,000 worth of work for FY25. That's a lot every year just to keep up with our existing street network. Yeah, absolutely. And then we have here, similar to the annual paving plan with the streets, there is a sidewalk plan. And so we show here, again, some of that sidewalk work would be a part of this bond vote. And then we've noted the main street project that'll also include sidewalk. And we have another piece happening right down on West Canal. Yeah, small, around 225 linear feet of just gap sidewalk that's missing. So we're happy to try to fill in those, those missing sidewalk gaps when we can. But yeah, overall, I think we're looking at with the next year to around 5000 linear feet of new sidewalk, which we hear from the community members, that's a large priority that they want to see done. Yeah. And so can you tell us a little bit about our, the approach to annual paving and sidewalk work? Sure. So we typically are looking to do at least ideally a mile of resurfacing work a year. That's our goal. We look at the entire street network. We do what's called a pavement condition inventory. We've got a little slide that shows this. Yeah, great. So we look at, you can kind of see on the bottom there, there's a graph that shows pavement condition inventory ratings, which it's pretty simple at, you know, zero to 100, 100 is great, zero is your street is failed. And what you can kind of see is a curve where we try to get to the streets before they really hit the really steep portion of the curve when it gets extremely expensive to do that work. Because now we're, we're not just milling and resurfacing, we're reconstructing, which is substantially more expensive. So we keep a pretty good eye on what our street network overall looks like. So right now we're, you know, high 68, our target is 72, which is a good condition. Okay. And I will say, you know, we, we in the city have invested increased funds annually to try to get to that, you know, one mile getting to a street every 15 years of mill and fill. That's helped along by the Main Street Reconstruction Project, the Hickok Street Project that we did. So I, you know, we've been making some pretty good strides, trying to maintain that street network. But it's been challenging, you know, winners like this, where you have these freeze-thaw cycles that really damage the roadways, creates more work and degrades the road network a lot sooner. And the budget that's on for town meeting day this year also has some increase into that annual work. Yeah, correct. Yep. So let's move on from the, the first Bonvo article six, which is asking to reallocate funds from existing debt. It's not adding new debt, essentially. Article seven does add new debt. So this is a bond vote to cover a portion of the cost of the Winooski Burlington Bridge Project. So a large federal grant has been awarded to cover this, maybe even over 70 million dollar project. State statute requires a local match. And our portion is estimated at 4.6 million. I think that's a conservative figure that is being put on. And so let's get into a little more detail on that. You can see here the actual bond vote language. So the, the bridge, very critical part of the regional infrastructure, also critical for Winooski residents. Too narrow, not good bike and pedestrian infrastructure. The surface is in less than ideal shape. Can you tell us a little bit more about what is included in this project? Sure. So some background. The bridge was constructed in 1928. So as mentioned here, it's, it's coming close to the 100 year sort of, you know, design life that the bridge was, was meant to, to be around for. In 2017, some stakeholders, the City of Winooski, the City of Burlington, we are the 50-50 owners of this bridge. We met with the Chinning County Regional Planning Commission and started looking at what's called a scoping study for the bridge, knowing that, you know, it's getting to the end of its useful life and we need to start doing some planning to determine the best options for replacement. So we went through this, this planning study that lasted from 2017 to 2019 and came up with some alternatives with stakeholders, VTRANS, other agency groups in the area and arrived at a project that was approved by both city councils. And that is currently what we're progressing as far as a project for replacement. There's actually, in this note about timeline, you can see the advisory committee here. There were a number of kind of local groups engaged in that design process as well as some public meetings. So this is widening new bike and pedestrian infrastructure. What will that part look like? I know that's a bit of... Yeah, so the existing bridge, as you mentioned, is, has restrictions. It's 57 feet wide. It's two four-lane, very narrow traffic lanes are 10 foot, six inches wide, and then two six-foot wide sidewalks with no shoulders. So not ideal for, you know, the current users of the bridge, you know, multimodal users and even vehicle users. So the proposed bridge would look at increasing the width by about 19 feet, so about 78 feet wide. It would slightly increase those lane widths to accommodate modern vehicle widths, so 11 feet wide. But it would really where this bridge is going to have the most enhancements on the bike pedestrian side. So we're looking at two two-foot shoulders on either side of the vehicle, the end of the vehicle lanes, just to give a little buffer. And then 12-foot multi-use pass protected by a barrier on each side. So pretty significant increase in width, but mainly to accommodate the multimodal use of the bridge. So twice as wide and with a barrier there, a lot a lot safer for the folks walking and biking across. Right, yep. Let's dig into the, oh well first, before we leave the timeline, when would we anticipate construction happening? So construction would start around 2027. So, and that is primarily driven by our federal grants that we have. So back in 2022, we received a federal DOT raise grant for $24.8 million, which is significant portion of the bridge. But that really triggered this bond, though, in moving forward with this project. And with that grant comes these pre-restrictive timelines for building the bridge. So we actually have to be completed by 2031 per the grant requirements. Okay. So that is why we're looking at 2027 to give us, you know, two or three years of actual construction. And can you talk a little bit about what's planned so far for the process? I think I had read that as I recall in the preferred alternative, they may be able to build it kind of upstream and reduce the amount of time it's closed. Yeah, that is potential. So there is the process for constructing this bridge is what's called design build. So that will give us the best chance to meet those deadlines. And one of the options we're looking at is accelerated bridge construction, where they've they build the bridge physically next to the existing bridge. And then at some point, we'll take the bridge, the existing bridge out of service, and slide in the new bridge. And there's roughly a four to six week closure with that, that type of construction. The team is also looking at some other options where the bridge could be realigned potentially so that, you know, some of the existing bridge, the partial lanes could remain open to allow, you know, emergency vehicles and some like one way traffic potentially. So they're they are reviewing that currently. So there's a few options out there right now. So those are, you know, two potential items. And I think Burlington and Winooski have both talked to the project team and to VTrans about trying to retain pedestrian bike access throughout, given it's much harder to do a detour for those kind of users. Yeah, correct. And both actually those options would provide, would maintain bike and pedestrian access across the bridge. And knowing that this would be a significant undertaking, have significant traffic impact during construction, when do we estimate our main street reconstruction to end, which should be kicking off this summer, right? Yeah. So Main Street will is looking to start this April. That currently is projected to be a conservatively three season project. So, you know, there would be a pretty good gap in between bridge starting. And there is a chance that, you know, the Main Street project could be a two season project even. So a little more gap between this, that project and the bridge. Great. It's going to be a busy several years. Let's talk about the cost and funding. You mentioned that raise grant. That's covering 80% of the cost. Is that right? It is. So the raise grant is 24.8 million. However, the project itself will be covered 80% by federal funds, VTrans covers the other portion. Then ultimately, the cities are required to cover 10% of the remaining project costs and then split 5% each way. Right, because we have that 50-50 ownership. And I have to apologize. I left a placeholder. I forgot to update this slide. With this bond vote passing, we'll then have to make these payments. There's sort of a schedule laid out here where it really kicks in in FY28. So in future years, what would the tax impact be for taking on this new debt? Yeah, it ends up roughly being about a 4% increase when both the principal and interest kick in. So you can kind of see we can kind of step it a little bit because in theory, an FY27 is shown. That is just an interest payment at that point. So it's not one hit of 4%. We can kind of grow into that 4% a little bit. And this is probably the most conservative estimate right now. So we're showing the full $73 million plus project. I mean, we're hopeful we can bring that cost down a little bit as we move further into design phases. So that is a very conservative estimate at this point. Well, and that's a good point too. So we are building into this bond vote $4.6 million, a conservative estimate. If our 5% share is lower, we don't have to take $4.6 million in debt. Right, exactly. And so we wouldn't be having to work quite as much in, but we need to have the space and the voter authorization in order to continue forward with the project. Yeah, it's an up to amount. And then when we actually know when we go out and bid the project and get actual numbers, then we'll go out and get the financing needed to cover that cost, which as shown, this is conservative. So we're hoping that we'll see a lower number at the end of the day. Always fingers crossed. And then finally, I don't know how much detail you'll have on this because it's not when you skis project, but I understand part of this larger project with the bridge will also include some changes on the Burlington side to that intersection. Can you share anything about that? Yeah, a little bit. That project is lagging a little bit behind the bridge. Burlington went through a similar process where they went through a scoping study that intersection has a lot of kind of odd angles where the streets come in. And ultimately, what they're trying to do is sort of clean up that intersection and make it more user friendly and more bike and pedestrian friendly. So it is sort of a separate project from bridge, but the timeline is happening at the same time, same consultant. And it's not a Winooski cost, but it makes sense to do it at the same time. It's adjacent to the bridge, so we're not disrupting people twice, and we can do it concurrently. So that's yeah, that's about it on that one. Last off the cuff question, speaking of disruption, so I mentioned previously, we've got our Main Street project starting now. This is coming presumably in 2027. There's also the Exit 16 Double Diamond Interchange project in Colchester, just north of our Main Street. Do you know what the timeline is on that? I think the latest is there's no work happening this summer. So construction that did occur was part of a Phase 1 construction project. And from what I've heard is from V-Trans is that they have not bid out the second phase work. And that is the very disruptive work where they're completely changing that interchange. So no work happening this summer, but potentially next summer. So a lot happening on the corridor. There's a lot. But when you look at these three projects, so the bridge that we're talking about tonight, that project on the interchange, and then the Main Street project that we'll be starting this summer, all of these are going to have significant improvements for bike lanes, pedestrians. We're talking like tens of millions of dollars coming into multimodal projects just in this very small area to support the broader region, but also this is part of Winooski's community vision and master plan. Yeah, absolutely. So we are here talking about these bond votes in service of upcoming Town Meeting Day election. March 5th, Tuesday, I have some details here on this slide. You can actually get it, request an absentee ballot and vote early. You could stop in City Hall and vote early. 27 West Allen Street if you're not familiar. And then voting in person is at the Winooski Senior Center. That's at 123 Barlow Street. The polls are open 7 a.m. to 7 p.m. And this is a local election, which means for Winooski residents, all legal residents can vote regardless of U.S. citizenship status, given our all resident voting act. All resident voting, I am so tongue tied. The all resident voting measure that came up two years ago and was enacted by the legislature. So please come out. Please come support both of these bond votes to recap. Article 6 to reallocate the, actually let me go back to that slide, to use leftover bond proceeds, reallocate that $500ish from the Hickok Street Reconstruction for additional capital improvements. This won't raise your taxes and will allow us to redo curbing sidewalks and streets on the east side of town. And article 7 will provide us enough debt capacity to provide a 5% local match to the Burlington Winooski Bridge project. Both of these will create a lot of safety equity infrastructure improvements for Winooski. Well, thank you so much. Thank you for joining us tonight and getting into the details, John. And thank you for joining us. Hope to see you on Town Meeting Day, Tuesday, March 5th.


That's part of a base wide beautification project at CFAS, CMEs did their part by standing, gluing and wrenching away. We're taking old cannon wheels that have been sitting out in the weather for probably the past 20 years or so. They were rotted, they were deformed, the CO put in a request to us to fix them. While the cannons may look intimidating, they're also a symbol of peace. The cannons were a gift to the Japanese from the Russians from the first Sino-Japanese War and the Russians wanted to present it to the Japanese as a peace offering. Thanks to these busy bees, CFAS can appreciate a more beautiful base. Seaman Christina Coffey, Fleet Activities, Sasebo, Japan.


Got the loops as well, you hate to see it, you're just despising, I'm the Yamcha player though. Born and raised Yamcha player, how's it going everybody? Dato do it here, back with some more Dragon Ball Fighters Rank Matches, this time playing a team of few, Zamasu, Super San Goku and Yamcha. The reason for the basic team this time around is just because I'm playing early morning Fighters, it must be at bright and early 9am, and you must be like, wow that has nothing to do with the video, and it really doesn't. But if you guys play Fighters at different times of days like I do, you start to notice a pattern and early morning, that's the crowd that's like, alright I gotta go to work, but real quick let me get on Fighters, do one or two rounds where I just absolutely beat somebody up and I'm already in the corner. And this guy's playing a very good team by the way, base Vegeta Super San Goku team Gohan, that's powerful. That is a powerful team, don't snap me back into Zamasu, I clearly didn't want to play him right now. That was sick, that overhead was not, I didn't even know it was happening. That was like a case of, I literally didn't even see it. I was watching the screen, I just did not see what he was doing. Level 3 into the spark, what's the okie here, I completely forget, there's a reason you do that. Do I spark? I'm gonna spark here. How do you block that? I like it, I like it, get the beam assist, get the beam assist. Oh that doesn't work, I would take a hit there unfortunately, oh he down heavy. I don't think he expected it to hit. Yeah I was untangling my mic cord. I moved, he made me panic in such a way that I picked the controller up and tangled myself up. Damn, the true mix is always on the inside. No dragon rush, what's the pressure looking like?  Okay, what the, not the range I was looking for there. Wow dash in. All right, you can, I can tell this is going to be quite the set. We have not touched him nearly enough. Okay, he went for a secondary low. Overhead, overhead, take it next time me. No, the defense was doing all right, we just failed the tech check. Wow, I did not know how lame that was gonna sound before I said it, but I'm just gonna apologize and move on. All right, I'm gonna expect he jumps in. I read the jump in and he read the jump, but I down heavy to putt is legit. I'm sick. I'm just gonna level three. I don't see the need to waste a bar and make myself lose an extra one. Are we in the corner? Okay. Okay. Beautiful connection on that one, baby. Let's just save a bar again. We're already in the corner. The mix is already going to be potent. Sparking's off the table. So if anything, this, this could be the comeback. I'm gonna go for the dragon rush. That seemed pretty safe to me. Boom.  We got a Yoncha video on our hands. All right, he's definitely gonna do the leg thing, right? So I read it. No, he didn't. That's safe though. That's safe. So fast. Team Gohan's got the damage in the bag. He's been dropping a little some stuff here. Nice. I thought I was gonna get counter hit on that one. Not gonna lie. I was already getting ready to say I can't believe I biffed it. The key blast. I've been so good at super dashing this set, but I just wasn't ready on that one. Man, he's gonna try to tag. He's gonna, I'm not, I'm not, you can, you can stagger at all day every day, boy. I am not letting go of the block button. Come here. Come here. So you were trying to play a little bit of offense.  Watch this. He's gonna DP. That was sick, but I hate it. Why did he able to chuck out some legs before I could punish? All right. I'm gonna, I was gonna do a tier list video after I do a couple recordings and Team Gohan just got moved up to S plus after that one. He got moved up to S plus. That counter hit him there. Oh, back up. Ah, this is bad. What? I was mashing. Did I, I, I went over his head. I think, I don't know. I might have missed seeing that, but I think my jab went over his head. All right. We vanished out. Ah, too much stagger. I'm gonna switch. Yeah, a little too obvious. A little too obvious on that one looking back. Oh, this is gonna be a hard set. Ah, this foozy. Why you got to hit me with all of that? Bright and early in the morning, huh? Team Gohan is so sick. I got to learn this character. He's never really like, I've never really gotten like, I've never had too much fun with him when playing, but I think at this point it might be a necessity to check him out. If not, if not to actually learn, Oh, we got some lag there. If not to actually learn how to play him on offense, just to see what the, you know, it'll help out the defense regardless. All right, get off me. Oh, I take that every day of the week. Are you kidding me? Go ahead. Let me see them. Let me just get the lows. Let's go there. Oh, no, a vanished, vanished, finished. All right, nice. Read the reflect there, punish appropriately.  I probably could have, was there a way to do that meterless? I don't know. I don't know, but I am just key blast was going to get punished there. This could, by the way, this connection has been really nice. I'm going to get over the corner too. Why even I truly don't know. Nice. That LL cross up is so good. They're going to nerf Yamcha, aren't they?  What a whiff. What a, what a poor choice. Literally had to hit him with the Oh, no. Oh, is this going to be, oh, this is going to hurt. The knockdown after this is going to be wild. Don't TP. Thank God. Nice. He keeps doing that. I wonder if that's supposed to counter it. I wouldn't be surprised if like the online just slows him down just barely enough for us to get there. Oh, the beam after was so smart. He knew I wanted that. Oh, the key blast loops up here that were basically dead already. I wonder how he's going to do it though. Does he have to do one level three at least? No, he doesn't go for it. Oh, I panicked. I panicked. I was holding back and he did that and I crouched. Crouched for some reason. Nice. Okay. Okay. I'm really focused right now. Panic Vanish. If my name isn't Panic Vanish McGee, I don't know what it is. And that's my actual birth certificate name. I didn't level five. Don't do it. Oh, we still kick it, baby. No key blast, huh? I thought that would kill. Nice. I didn't even have to vanish, but I did at a, again, Panic McGee. I can't stop, but I, you might ask, why did you mash? And I thought it was going to be at a thousand IQ play. Here's what I thought he would do. I thought he would know that I would block so he would try to run up and like or drag a rush. Why my IQ? Why? Why? Why do I have to max? Why do I have to, why do I have to max out the old IQ credit card every day, huh? Oh, made him block at least. Oh, he caught me standing. What's this combo? Oh, oh, just reform it. Oh, just get real creative. Look at the health bar melt. To be fair, I didn't, what did I get hit by a 2M? This, I was born to be melted. Oh, hard knock. And he's going to DP as well. Watch. He's going to try to read the spark. No reads. Okay. Oh, oh, never mind. He is bringing in Zamasu. I was like, oh, he's not bringing in Zamasu. Nope. Just going to do it with a different character. Okay.  All right. Get me out of there. Oh, it's too obvious again.  I always get stomped. I get stomped with Zamasu. Get off me. That was nice. I'll take it. I think I'm going to level 3 here. Get him out of the corner into the light. I know it's not the best move, but at this point we're about to get 3-0 sweep. So I need to do something to come back. Nice. Not going to be a kill, I don't think, but you know, we're here. I wish I learned defense doing well. Two overhead hits. My man was stomping on him. Got the loops as well. Oh, you hate to see it. You're just despising. I'm the Yamcha player though. Born and raised, baby. Born and raised Yamcha player. Oh, you've got to be able to look out with Yamcha. I'm never going to stop loving that. That's how that works. Reads. Oh, yeah, you got read. You got read on that one, bro. Too much. That sucked. Nice. Saw the opportunity to mash. Oh, not my turn. I don't know why I thought it was actually, but I was so confident. Damage is a little neutered, which is good.  Level 1 and level 3 is going to hit for sure. We still have spark. I just, and I don't think Goku has any way to really read it and get a big punish out of it. Nice. Switch up. I should have won with the downwards coming on. Going for it. Oh, it's so risky. Oh, Yamcha. Man, what a punish. I really should learn that to be fair. I tried to down heavy punish him. I should have expected the beam though. That's how you keep it relatively safe. Yamcha, you got to get me out of this mess, dude. I know I'm asking for a lot. Okay. Oh, the accidental super jump threw me off. We're not dead. We're not dead. Yeah, not even close. Get away. I'll take it. I'll take it. I'll take it. This is a knock. Hard knock for sure. Save the meter just for defensive reasons in case we got a guard cancel and a panic or, you know, vanish in a panic. It's all the same to me as unfortunate as that is. What? How did that hit him? I don't care. I don't care. I'll take it if it's cheap for me, baby. I hate myself. That was the slow. I bet he hates himself even more right now. Oh my goodness. Did we just win this?  It's not going to kill. We just have to read. Let's go. Let's go, baby. That's why they pay me the big bucks. That's why they invest in the Dotto do his stocks. The stock price is going nowhere but up, baby. On to the next round.  I'll tell you that right now.  Why do I never get that down heavy punish? It's like I can see it in my mind every time, but I just never do it. I'm just so dumb. Oh, he crossed me out. I'm a guard cancel punish. Damn it. Wait, I'm too antsy right now. Why am I so hyped up? I got to calm it back down. Get those nerves back down because right now we are seeing the result of no patience. We got a spark. Oh, no. Oh, come on. I am sucking right now. Oh, okay. I was confused. I mean, realistically, my answer should have been blocked to both, but okay. Gohan's so low. If we could take out Gohan, I think we'll be in such a good place, but unfortunately it's going to involve some switching and I don't know if we necessarily got the chops for all that. He keeps trying to do that. That's very risky. Oh, nice vanish. Really? That was good too. That was good too. Hold on. Hold on. Hold on. Two bars. Not going to kill. He might go for a snap. I don't know why he would though. Yeah, he's going to take sliding and I'm not going to hold tag this time. In the tech check. Failing it. Oh, man. I got to work on my tacking, dude. It's getting to a point where it's not even a joke anymore. It's just depressing. Oh, come on. We could have killed. Okay, let us live. Okay. Okay. We can't go for Gohan now, right? It doesn't make sense. Nice tag. Nice tag. We're getting his team low, but it's just we got to finish a character off here. No drops this time around unfortunately. One bar, one der, Vegeta comes in, gets the job done, and now it's up to the very character we've been getting washed with. I'm going to go for Gohan again. DP. I was, I was, he's been very patient all game with that DP that I just, it got to the point. It came out in the clutch. Oh, so much damage here. Kamehame. Oh my God. He's going to go for the Vegeta again. No, the mix. Do we wake up level three as a goodbye present just to say you vested us? No, we wake up and get it. Well, that's going to do it, dude. Man, what a, what a run. What a set. It was fun. It was fun. You know, sometimes you got to get put through the paces. Anyway, it's actually good that I got some team Gohan footage for that tier list video if I do end up making it. But if you didn't enjoy this video, definitely make sure to go down below in the comments. Let me know your favorite moment and hit the like button and subscribe if you enjoy the content we make here. You can also check out some more of my videos right away just by going on top of your screen. There should be some up there. So give any of those a watch if they look interesting to you. Other than that, I've been down to do it. Thanks again for making it to the end and I will see you in the next video.


Think about it, Shisho, do you think the children and humans are intrinsically peaceful and pure? Do you think children and humans and that we've been corrupted by conditioning or do you think there is an Intrinsic evil in our nature? No, I don't think there's an evil, but I think we can be brutal. There's a quote from Kabbalahit Bipap and it's the black guy that says it, and I remember this is towards the end of it's an amazing episode where he says there's like children are extremely brutal, like a child will take a bug and pull off its legs and watch the bug die without really understanding what that is, right? So once we don't understand something, we have capacity for pure brutality That's why censorship is so horrendous, right? When centralized power sensors information, sensors dialogue, then what happens is one society could be completely shut off from another society, right? And if they're completely shut off from the society, then there's no humanity going across between the two and these people can and have been extremely brutal to these other people. Look at what Americans were okay with doing to Iraqis for ten years with sanctions with Madeline Albright coming out and saying that a half a million Iraqi children dying because of the sanctions that the price was worth it, right? Americans didn't even bat an eyelash, right? And four years later, they invaded Iraq and killed hundreds of thousands of more people, over a million more people, right? Why was that allowed to happen? Because for over a decade, Western propagandists brainwashed, programmed, Western society to think that Iraqi lives did not matter, right? They dehumanized them. So I don't think our tendency is evil, but we have the capacity for other brutality, right? Because we lack information.


Hi everyone, Joe for jazby's casebreaks.com coming at you with 2019-2020 Panini Chronicles basketball fat pack number three five six given away two spots in that 12 team number block For a macular picker team number two and within this break. We're also giving away seven spots in this pack break right here So there are a couple layers of giveaways here. So thanks everyone here for getting into the action so Sean down to Robert and everybody in between has a shot at those spots right there. So that's a different dice roll I got the names in there already Let's roll it. Let's randomize it one and a six seven times for that list one two three four five six and Seventh and final time so top seven after seven is going to be Sean Michael Leysiow Robert Matt Matt and Mike Congrats right here to the seven So let's get your names into those spots right here. We'll put little rooftops next to your name so you know That you won them in this So copy that little rooftop there we go. Oh Now let's grab all 30 names here and we'll assign you a random team Obviously, we do as always we do the pack break first then a completely new dice roll and new and blank list We'll give away the number block spots So three times for names and teams one and the two one two and three Robert down to Robert three times to the teams one two and three After three times we got jazz down to Jets nets all right, so No trade and stuff like this, but here's just a quick look at the list right here Robert Grizzlies Matt Pelicans Don't get those names again new dice roll and then we'll see who gets those two spots right Good luck PJ Washington, Jr. Pascal Kobe white Luca Donchich Ja Marant nice Seiku Demboya Darius Basely and Jordan pool. No Clay Thompson poor Clay Thompson No clay so I guess guys like Jordan pool and Eric Pascal need to need to step up All right. Now. Let's see who's gonna win spots in That 12 team a random number block. It's like a $500 value Mike down to Matt and everybody in between And it's gonna be top two after 10 5 and a 5 hard 10 and 10th and final time after 10 Top two It's gonna be Big thanks everybody here on this side of the list sad times. We'll get him next time Top two Robert Runkle and Matt nice Matthew Janowski Robert Runkle. You're in. Thanks for watching. I'm Joe for jazby's case breaks calm We'll see you next time for the next one


we can use Myhill-Nerode theorem to prove that some language is not regular. So far we have used the pumping lemma either the usual one or the generalized one to prove some language L to be non regular, but now that we know Myhill-Nerode theorem this gives us another method to prove a language not regular. For example, consider this language 0 N, 1 N we know that this language is not regular we prove its non regularity by the pumping lemma. Now, the way we use Myhill-Nerode theorem to prove non regularity is this, recall we have one thing that Myhill-Nerode theorem says that L is regular if and only if R L is of finite. In other words the equivalence relation R L for language L if you consider that then if the number of equivalence classes is infinite then the language is not regular and if the number of equivalence classes is finite then the language is regular. In this case it is fairly easy to show that R L for this language will have infinitely many equivalence classes. Let us consider sets of strings like this E k is 0 N, 1 N minus k and of course, now take two strings from two different E k's. So, let us say E k 1 and E k 2 I claim that a string. So, let us write it here let us say x is in E k 1 and y is in E k 2 and k 1 is different from k 2. So, consider this string x 1 k 1. So, remember what is x x will have some N number of 0's and some number of 1's which is less than by k 1 from the number of 0's and if you add this one you know k 1 once after x in clearly this will have equal number of 0's and 1's therefore, x 1 to the power k 1 this string will be in the language. Whereas, if you take y from E k 2 the deficiency number of 1's it is less by is k 2 and k 2 is different from k 1. So, this will not be in the language. So, therefore, from here we find that x and y was any string from E k 1 and any string from E k 2 must in different equivalence classes. Then it is not difficult to see now since we can have infinitely many k's this means that we will have infinitely many sets like this such that if you take two different such sets and you take two strings one from here one from here they cannot be in the same equivalence class they must be in different equivalence classes and therefore, number of equivalence classes of R L for this language must be infinite. Therefore, this proves that the language L is not regular. So, this is a direct application of Myhill-Narodith theorem to show a language to be not regular. Let us now consider this topic of minimization of states of DFA's. So, what is the problem? We have a DFA m we would like to find out find a DFA m dash such that both m and m dash they accept the same language and of all DFA's accepting that language m dash has the minimum number of m. Now, the first thing we need to appreciate that even for this problem Myhill-Narodith theorem tells us a way of going about let us see how. So, L is let us say L is a language and m is a DFA to accept it. Now, you recall the definition of R m what was R m we said starting from this machine definition m we said that two strings x and y are related by this if and only if x and y take m from its initial state to the same state. Now, we can write it in or the symbols that we are familiar with suppose m is q sigma delta q 0 and f then how many equivalence classes R m will have R m will have exactly so many equivalence classes and one for each state and we remember that corresponding to state q let us say small q the equivalence class may let me may be I can call it as a q is the set of all strings x in sigma star such that delta hat q 0 x is q. So, what it means is sigma star is partition into equivalence classes and each equivalence class corresponds to one of the states of the machine m. Now, what is the best machine for this language L now it is not difficult to see if we go back to Myhill-Narodith theorem the any machine so for the language L a machine a DFA let us say m 1 has minimum number of states a DFA m 1 has minimum number of states the of course, this DFA has to accept the language L if and only if the equivalence relation corresponding to this machine R m 1 is exactly equal to the equivalence relation R m. In other words what we are trying to say is this that x for all x y in sigma star x R m 1 y this holds if and only if x y is so because remember that any machine to accept L gives rise to of course, an equivalence class R m and what we have proved in Myhill-Narodith theorem that that R m is what we do we call it is so let me let me get a picture. So, let us say this is sigma star and let us say force we are just taking an example R L is partition sigma star let us say in these many equivalence classes and remember that the language L has to be one of these or a number of this union of some of these equivalence classes. So, for the purpose of illustration let us write let us say that this particular equivalence class the strings in this D constitute the language L this is my L and of course, the other strings are not in the language L now if we provide any machine any DFA to accept L Myhill-Narodith theorem says that the corresponding R m for so let us say m to accept L has to be a refinement of R L that means what if you go back to the definition of the refinement of two equivalence relations the R m is an equivalence relation R L is another equivalence relation and we said that R m is a refinement of R L if the equivalence classes of R L are such that they are basically obtained by breaking one or more equivalence classes of R L actually I should have said 0 or more because if m is your best machine then R m equivalence classes will be same as R L equivalence classes. So, in other words if the machine m does not have the minimum number of states to accept the language then it means that R m will essentially partition some of the equivalence classes will break up some of the equivalence classes. So, let me show that situation in this manner let us say by this colored thing what we mean is now previously R L had 1, 2, 3, 4 you know 1, 2, 3, 4 equivalence classes. Now, this particular equivalence class of R L is partitioned into two and this is one equivalence class of R m this is another equivalence class of R m and similarly here may be more things are broken up but this picture will suffice to make a point and this is the general understanding of refinement R m is a proper refinement of R L that means that it breaks up some of the old equivalence classes of R L for its equivalence classes. So, what would minimization mean minimization would mean that right now I have two states recall that for every state of the machine m we had an equivalence class in R m if it is a proper refinement R m is a proper refinement of R L that would mean what two or more equivalence classes corresponding to therefore, two or more different states of the machine m all of these actually fall in the same equivalence class of R L right. So, for example, here that may be this particular equivalence class corresponded to state q 1 and this particular this particular equivalence class corresponded to the state q 2 and what is their relation their relation is that the equivalence class in R m corresponding to the state q 1 and the state q 2 both these classes are subsets of the same equivalence class of R L. So, if there is a way of combining these two states then of course, it would mean that this line would go this pink line would go and will have we will have improved in terms of the number of states in the D F A accepting the same line. So, this is why we are saying that for the language L a D F A m 1 to accept L has minimum number of states if and only the equivalence classes corresponding to that machine R m 1 they are exactly the same equivalence classes of R L if not it would mean the R m 1 is a proper refinement of R L and therefore, this kind of possibility of combining two equivalence classes its two of its equivalence classes into one is there and thereby the possibility of reducing the number of states is there. So, now we can see what is our problem for minimization we are we have been given a particular machine m we have been given a D F A m can I find two states repeatedly in this machine m such that the equivalence classes corresponding to these two states equivalence classes for R m corresponding to these two states both of these equivalence classes they are parts of the same equivalence class of R L how do I identify such pairs of states the question we are asking is for this machine m let us say m is again as before q sigma delta q 0 F the question we are asking is can we identify q 1 q 2 in q such that the equivalence classes corresponding to q 1 q 2 subsets same equivalence class. Now, it might appear a little confusing because we are simultaneously talking about two different equivalence relation when I say can we identify q 1 q 2 in q such that the equivalence classes corresponding to q 1 q 2 now here we are talking of the real equivalence relation R m. So, let me write it clearly such that in R m the equivalence classes corresponding to q 1 and q 2 are both subsets of the same equivalence class of R L. Now, so then you can see then this is then you can see the picture. So, this is q 1 this is q 2 something like this and therefore, at least intuitively we see that we can do something to merge these two states and thereby will improve in number of states. Now, what is easy in fact what is more direct and equivalent of course, to identify pairs of states which are not in other words let us look at this what we are saying is that q 1 q 2 another way of saying this that we are trying to identify this pair q 1 q 2 is distinguishable this is the term used to mean that the equivalence class in R m corresponding to q 1 and the equivalence class corresponding to q 2 in R m these two equivalence classes are not subsets of the same equivalence class of R L. So, if the equivalence classes in R m of q 1 and q 2 fall in different equivalence class of this is the definition of this term distinguishable that I say a pair of states is distinguishable if this is this holds. Now, this holds when that we know see what do we know when will to so let us say now that a q 1 is the equivalence class corresponding to q 1 in R m of course, and a q is the equivalence class corresponding to q 2 in. So, when are they not in the same equivalence class of R L. So, the situation is this is q 1 and may be not q 2 here, but if you take something like this this was your q 2 then this equivalence class and this is your a q 1 and this is your a q 2 and there of course, in two different equivalence classes of R L and such pairs of states are easy to see or easy to figure out at least we have a definition because they are in two different equivalence classes of R L. So, a string from here let us say what can I say about suppose that x is in a q 1 and y is in a q 2. Now, suppose that x is not in the same it is not related to y by the equivalence relation R L that means, the equivalence class in which x is there and in which y is there these two classes all in different equivalence classes of R L and that is what is was this question. So, that is how to answer and what would what do I know about a q 1 and a q 2 a q 1 are all those strings which take m from q 0 to the state q 1 and a q 2 are all those strings which take the machine m from q 0 the initial state to the state q 2. Now, let us write this in terms of the machine behavior. So, let us summarize what we are saying this is a machine m q 1 q 2 are two states in the machine and equivalence class a q 1 is an equivalence class corresponding to the state q 1 for the equivalence relation R m and that by definition is this we had seen the definition of R m is the set of all strings which take the machine from its initial state to q 1 and similarly for q 2. Now, what we are saying that these two states are distinguishable if and only if these two equivalence classes are in two different equivalence classes of R L and how can I figure that out. Now, look at it this way that suppose there is a z some strings a such that delta hat exactly one of delta hat q 1 z and delta hat of q 2 z. Remember these two will be two states what we are saying that suppose there is some string z such that exactly one of these two states is in F and basically that means the other is not other is not in F consider this situation. So, there is some string z such that delta hat of q 1 z let us say it is one of the final states and delta hat of q 2 z is not a final state. But what does it mean let us say string x took the machine as we said suppose from q 0 to q 1 and now consider this z. So, now let us say to suppose x this string x is in a q 1 and y is in a q 2. Suppose this is the situation then now look at these two strings x z and y z. So, of course x is in the equivalence class a q 1 and now you applied this string z as a concatenated string to x on x right and similarly you did for y z and now what you would what do you find that totally if you take this string x z x took the machine m from q 0 to q 1 and then from q 1 z took it to let us say final state and whereas y took the machine from its initial state to q 2 and then the same z took the machine to a non final state. That means what that means this string will be in the language and this string will not be in the language. That means what the two strings x and y is not related by the relation equivalence relation R L and therefore of course it means that a q 1 and a q 2 are in two different equivalence classes of R L and that is why this is the situation in which we can say q 1 and q 2 this pair of states is distinguishable and coming back to what we were saying earlier it means that there is no way we can merge these two states and hope to get DFA which will be accepting the same language. However, you see that this is now at least it seems that given a pair of states look at this situation what we are saying that suppose there is a string z in sigma star that exactly one of these two states is a final state. This is something we can test as we shall see by means of an algorithm and thereby we will be able to figure out all pairs of distinguishable states and from what I know from Eil-Nerode theorem that such pairs of distinguishable states if q 1 and q 2 are distinguishable that they cannot go into the same equivalence class of R L and my the best DFA or the DFA that will correspond to whose R M will correspond to R L that will be by somehow combining those states which are not distinguishable. So, let us now spend time to find out how we can test this condition. So, we have motivated ourselves towards this definition of distinguishability for a pair of states what we are saying is that a pair of states is distinguishable if you can find a string z such that exactly one of delta hat q 1 z this is one state and this is the other state going from q 2 to z using z exactly one of these states is in F. In such a case if you can find this condition to be true for a pair of states we will see that pair of states is distinguishable and there is a systematic way of finding all pairs of distinguishable states first of all one thing is very clear that if one of q 1 q 2 is in F and the other is not q 1 q 2 is distinguishable why so because in that case in this situation. So, what is the situation let us say q 1 is in F one of the final states and q 2 is not F then this pair is distinguishable that is because consider z to be epsilon the empty string delta hat q 1 z q 1 epsilon is q 1 which is a final state whereas delta hat of q 2 z z is epsilon this will then be when z is epsilon it will be q 2 and q 2 is not final state in that case of course this pair is distinguishable. So, that is how our algorithm would start to find out the set of all possible pairs of distinguishable all possible distinguishable pairs of states I am outline of algorithm to find all pairs of distinguishable states. So, the initialization will start from this observation. So, let us see what is our the desired output, output should be the set of all the set s let us say all pairs. So, this is the set that I would like to construct given a machine M. So, initialization for s will build s iteratively initialization is from this observation that s is all p q one of p or q in F the other not. So, I have first approximation to my set of all distinguishable states. Now, let us see how we can starting from this initialization how we can augment this set iteratively. So, this is the iteration part consider r 1 r 2 with a pair of states which is not already in s and we will add r 1 r 2 in s. So, we will add we will augment our set s by this new pair if for some a in sigma delta r 1 a and delta r 2 a this was in s.  So, there is a string z such that delta hat of p z let us say is in one of the final states is is one of the final states and delta hat of q z is not and now consider the string a z a takes r 1 2 p and rest of the string z takes p to a final state whereas, this same string a z this same string a z what its behavior with respect to r 2 r 2 goes to q on this symbol a and from q this string z takes the machine to a state which is not final states. So, here is this string a z which is such that exactly one of this will take r 1 of the of the two states r 1 and r 2 a z is a string such that it will take the machine one to a final state from one exactly one of these states r 1 and r 2 and therefore, r 1 r 2 is distinguishable. So, this is the justification let me rub this out this is the justification part and our algorithm therefore, will mean that in the iteration part you are considering all pairs of states which are not already in s and such a pair you will add to s you know if you find some symbol a remember that number of symbols in sigma is finite. So, one after another you test this condition you have chosen a pair r 1 r 2 which is not in s consider delta r 1 a and delta r 2 a this pair ask is it already in s if it is in s then put this pair also in s and so on and finally, we must say when to stop we say that stop the process if in an iteration no new pair is added to remember the iteration is this entire thing. So, maybe you know just to emphasize this I should write consider each r 1 r 2 not in s. So, in one iteration remember in an iteration you already have a set of pairs which is in s and some of the pairs which are not in s these are the set of all pairs of states. So, in iteration in one iteration you will consider all the elements which are not in s and as you consider one pair you may find this condition to be true. So, in that case that pair will be added and so on. Now, imagine an iteration where all the pairs which are not in s you tested this condition and you could not put this any new pair that pair to s that was true for all the pairs not in s in that case we say that iteration did not add any new pair to s and in such a case will stop the algorithm. What is the time complexity of this algorithm is it is fairly easy to see that this is a polynomial time algorithm because in each iteration how many total number of pairs of states are there if there are n states there are you know n square pairs of the order n square pair actually n choose two pair and actually we should talk of unordered pair because these are if p q is distinguishable and q p is also distinguishable, but that is a detail the main thing is in each iteration we add at least one new pair. So, how many total number of iterations? So, let me write here the time complexity of the algorithm and then we will bother about the correctness time complexity. There are at most order n square iterations and what do you do in each iteration in each iteration you consider all the pairs which are not in s and they can be order n such pairs which are not in s sorry order n square such pairs not in s and you do something you do this test for each such pair. So, you can see that in each iteration n square. So, therefore, the algorithm is polynomial time, this what I said is kind of pessimistic you should be able to see that the algorithm really the way I have said as if it is order n 4, but actually it is order n cube just to make this point that it is polynomial time I made this rather lose argument, but you should be able to see this that this is actually order n cube though from what I have said it does not immediately follow you should be able to do this check that this is indeed order n cube and now let us talk about the correctness of the algorithm. So, let us see why the algorithm that we have outlined is indeed correct when is it correct if when we stop by then we would have discovered all pairs of states which are distinguishable. We end with a certain set s and if that s contains every pair of distinguishable states then of course, the algorithm is correct. So, I would like to show that is indeed true and let us prove this by contradiction. Suppose, our algorithm is not correct then suppose then they must exist then for some instance and here the instance is of course, you are given a DFA then for some instance when the algorithm ends there are pairs of states pairs of distinguishable states which are not in s that is why the algorithm is incorrect. So, incorrect means this condition must be true there must be some instance where it is working incorrectly that means it has not been able to complete the entire set of it has not been able to put all the set of distinguishable states into distinguishable pairs of states in s. Now, let s prime be the set of distinguishable states pairs of states not in s. So, these are s prime are all those pairs which ought to have been in s, but they are not in s. So, supposing these are these pairs p 1 p 2 or let us say p 1 q 1 p 2 q 2 and so on and now suppose for each one let us say we say for each p i q i each such distinguishable pair which is not in s let z i let z 1 in this case z i. So, these are strings and what are these strings they distinguish these pairs these are the shortest. So, this so let z i be the shortest length string such that exactly one of p i z i q i z i is in f. So, that means these string z i witnesses the fact that the pair p i q i is distinguishable and we are saying that z i be the shortest length string of all such pairs let of all such strings they may there will be infinitely many strings let z i be the shortest. Now, let z be the shortest of all these strings. So, in each z i is shortest witness for that corresponding pair and of all these let particular z z be the shortest of all z i and let z correspond to the pair. So, now let the string z be some a followed by let us say z dash that is the string z begins with the symbol a. Now, consider this pair of states delta p a let this be the state r 1 and let this be state r 2.    So, in that is that would have been the pair r 1 r 2 I would have picked up and z prime would have been the z and not this z. So, this is true r 1 r 2 this pair is distinguishable of course that is easy to see and what more this pair is already in s and now comes the contradiction that consider. So, since r 1 r 2 is in s it means this pair r 1 r 2 this pair r 1 r 2 was included in s sometime in the algorithm may be in the initial phase or may be in some one of the iterations. So, now consider the iteration immediately following that when r 1 r 2 came in to s by then the pair p q would not have been in s in any case p q is never in s p q was missed by our algorithm, but when you take the pair p q and consider the symbol a then you would have got the pair r 1 r 2 which was already there in this set s and then p q would have been declared as distinguishable. So, therefore, we have a contradiction and therefore, this is not true that there is some pair of distinguishable states which our algorithm had failed to discover.


It's only six months to go until the Paris 2024 Olympic and Paralympic Games. It's going to be epic and we can't wait to see you there. Paris 2024 is going to be brilliant. I can't wait to see you there. Six months to go to the Paris Paralympics. I'd like to say how excited I am at the prospect of hopefully running for Great Britain. Fingers crossed. I can't believe it is six months to go until the Paris Paralympic Games. Are you excited? I really look forward to Paris 2024. It will be my eighth Paralympic Games and I can't wait to get out there in six months time. Bring it on. I can't wait to see you all there. I can't believe it's only six months to go to the Paralympic Games 2024. As soon as 2024 here I've got a real feeling of it's crunch time. We've got three events to go. I'm very excited.


Literature on measurement and reliability, sometimes differentiates between different types or different facets of reliability. This difference is sometimes made also in the more applied literature that discusses different reliability coefficients. Typically, when we start discussing reliability, the starting point is this classical test theory equation. The idea in classical test theory is that the variation in the observed scores x is a function of the variation in true scores t plus some error variations. Or an individual observed score x is a sum of individual true score plus some random noise realises. But this is not the only way of thinking about reliability. One source of confusion is that when I teach measurement, I quite commonly give this book chapter from Singleton straights, research design book to students and then they will read and memorise that reliability is about stability, consistency or equivalence and then they write that into an exam. Without really understanding what does it mean that reliability is about stability, what does it mean that reliability is about equivalence. Are equivalence and stability the same or are there perhaps different types of reliability, different estimates of reliability or what are these terms about. Let's take a look. This article by Smith and co-authors in Psychological Methods explains the difference in that normally the random noise can be divided into three main components. There is the random response error, this is purely noise, transient error which is something that relates to time and specific factor error which is something that relates to the measurement instrument or survey items. And if you have multiple raters then you have the radar error and you could for example calculate inter-rater reliability estimates which are different from these reliability estimates based on transient and specific factor error. So what are these different errors? So what is a random error, transient error and specific factor error? These have been introduced by, worked by Krombach and they come from his work on generalizability theory. And the idea that what the random error is that this is simply something that relates to the occasion and it relates to, this is just random noise like if you are accidentally mark an incorrect person, incorrect scale option in a survey form then this is a random error. Something that occurs simply by chance only and it's not stable, it's not consistent between items and so on. So this is perhaps the closest to E in classical test theory. But this is not the only kind of random error in the data. It is also possible that you have transient error and transient error is something that relates to the measurement, the occasion, that specific time. For example if you are measuring person's satisfaction with life then that is something that is probably fairly stable from day to day and only changes over longer periods of time. However if you ask a person how satisfied they are with life at this point then their mood which varies from one day to another for example if you did not sleep well you may be in bad mood and then you may indicate less satisfaction. So this kind of transient errors, errors that occur for a specific time and then go away are what the transient error is about. And the transient error is about stability. So if there is no transient error and the construct that we measure is stable then measures should correlate highly over time. Then we have the specific factor error. So the specific factor error relates to the specific measurement procedure. So if you have multiple indicators of the construct then those indicators typically have some variance components that are not due to the construct. For example if you ask a person how innovative they think their company is that probably measures innovativeness of the company but also it measures the general attitude of that person towards the company. So that would be a specific factor error, that sort of variance. The idea of specific factor error is that each indicator can have this specific source of error that's called uniqueness in factor analysis which combines the item specific variation and the random noise into one variance component in the model. But we assume that the specific factor errors will cancel out if we have multiple different items but if we have the same item measured at different locations. So we do a test-retest then the specific factor error if that exists would be incorrectly attributed as a reliable variance because it's not related to the true score. This article by Lee, Smith and Putka in Organizational Research Methods presents this kind of various decompositions. So there is the variance of x, the variance of the measured score is true score variation plus person occasion variation which is the transient error plus person item within scale and person scale variation which is the specific factor error. So that is the variation that is stable over time and that relates to the measurement instrument. This is variation that is not stable over time and it does not relate to the measurement instrument but it relates to the mood of the person and that kind of things. And then we have the final component pure random noise. It's important to understand that when you choose a reliability coefficient or reliability estimation approach, different estimation approaches and different coefficients can give you different numbers because they quantify different sources of random variance. So you can have for example if you have single measurement occasion and single measurement item then you of course cannot estimate reliability because you don't know how much of that variation of that measure is due to the true score, how much is due to the error. If you have multiple measurement occasions then you can evaluate stability. So you can check if that measurement is stable over time but you cannot know if there is specific factor error. If there is some sort of variation relating to that specific item that is not due to the true score but should be considered as measurement error then that can be quantified using test reliability. Then we have multiple measurement items and single measurement occasion and this is the most common scenario where we address reliability. And then we would say that this is about equivalence. Test retest is about stability and multiple parallel tests or tests that we assume to be parallel are about equivalence. And for example coefficient alpha, composite reliability, oh my god, other indices are these equivalence indices. Then we have also a coefficient of equivalence and stability, which for example this Ormeses Arisa Smith's paper discusses and they are applicable to scenarios where you have multiple measures from multiple measurement occasions. Then you can parcel out this variation in the true scores to transient variation, item specific variation and random noise. So that allows you to do that kind of variance decomposition. While we normally work with coefficients of equivalence it is useful sometimes to understand that if your test retest reliability and your coefficients of equivalence for example coefficient alpha give you different values. It does not necessarily indicate that one of those values must be incorrect. It is just that these quantify different aspects of reliability.