Preliminary, but impressive, results. A flaxseed-supplemented lower-fat diet appeared to decrease cellular proliferation rates in men with pre-cancerous changes in their prostates. However, given the composite nature of the intervention, both a lower-fat diet and flaxseeds, it's unknown whether the effects can be attributed to the flaxseed supplementation of fat-restricted diet, or both factors working together. To figure that out, you'd have to design some study where you split men into four groups, or a control group, a flaxseed-only group, a lower-fat-only group, and then a flaxseed and lower-fat group. And so that's exactly what they did. 161 prostate cancer patients, at least 21 days before their prostate removal surgery, were randomly assigned to one of those four arms. And as the title describes, it was apparently the flaxseeds, but not dietary fat restriction alone that reduced prostate cancer proliferation rates in men pre-surgery. Here are the numbers. Whether they were eating their usual or lower-fat diet, it was the men eating the flaxseed that saw their tumor proliferation rates significantly drop. Though if you look at what they actually ate, the quote-unquote low-fat diet groups never really got down to the target 20% calories from fat.  Still, the lower-fat groups were the only ones who saw a significant drop in cholesterol and body weight, so there are certainly benefits. Bottom line, further studies are needed before we can definitively support flaxseed supplementation as a proven complementary therapy for prostate cancer. To date, however, the evidence suggests that flaxseed is a good low-cost source of nutrition and is well-accepted and safe to use, so why not give it a try?


Նौ ԳԱՍ Rocco ԑլսայց ԱՆ ԻՆ ԵՐԱՆ ԰ԳԱՆ ԿԯՐԱՆ ԲԴԱՆ ԵՐԻԵՏ ԱՆ ԱՆ ԱՊԼսղԱՆ ԱՆ ԱՆ ԱՆ ԱՆ ԱՆ ԱՆ ԱՆ ԱՆ ԱՆ ԱԻԱԱՆ ԱՆ ԱՆ ԱՆ,ԱՆ ԱՆ ԴՎ,Լա ԱՆ ԱՆ, մԱՆ,ԱՆ,� and we are compensate them as much as possible with the affordable healthcare that is our main motto. Now we are also progressing and we are making new departments, new ICU facilities as well as recruiting new doctors and now Dr Das is our chairman he is the only wholesome owner of this hospital under the leadership of our MD madam Mrs Nilanjana Mukherjee and with our CEO Mr Nanda Devi Nanda and other officers and we are really progressing and making an impact in the hospital and we are growing in lift and bounce that's all, thank you very much Thank you


Okay, here we go. So this is about the use of an array. It is more like a philosophical question. It has multiple answers. There is which is the more appropriate scenario for use of an array in a program. This formulation of the question is not related to C++ implementation. This is the standard mathematical notation that you would use while describing an array. So an array A for example is simply described as A equal to the set of values. So there are a total of 6 values, 5, 9, 12, 34, 56, 43. Since this is a conventional mathematical notation, the different elements of an array are represented using indexes 1, 2, 3, 4, 5, 6, etc. To clarify this, it is stated that A1 is equal to 5. So what is the sum of A2 plus A4 plus A6? Very straightforward. Everybody has done this simple sum. Which of the following properties are true for arrays? Again, this relates of course to C++. Comment on the properties of arrays which hold for arrays. Choose appropriate answer for arrays in C++. We must declare its name and size and when we declare the size, the size could be a floating point number. Just two simple statements made. These all relate to array declarations and array handling. This is definitely a C++ question. An array A of size 5 is defined with initial values 2, 5, 6, 3, 2. What will be the value corresponding to A of this expression? A simple question, if you have seen the lectures, you should be able to answer it very quickly. So here is a core segment, practically lifted straight from a lecture. So those of you who have seen the lecture know exactly what is happening here. It presumes that marks is an array of type int which is defined earlier. You can also presume that the value of n is less than or at most equal to the size of the array. So if this core segment is run, what does A represent? Standard deviation, average, sum or none of these. In practice, when you write programs involving arrays, the lectures advise that you should take certain precautions. Some of those are listed here. Whether anyone or more are valid or none of them hold for handling array. So there are the four choices here. All right. So here we start the session with a very brief recap. We are going to solve some problems. Increasingly, we will be moving towards writing programs. As Mr. Supratik and I have been mentioning, today you will have to write core segments and therefore listen to these things attentively. The first of course is merely a very quick 15 second glance at some of the points related to arrays that were mentioned in the class before we start. So all of you recall from the lecture that if you have an array, it's a hundred integer elements, then each element will be allocated four consecutive bytes because int is four bytes. Concecutive elements are allocated, memory locations are allocated to different elements of the array. The way the array is declared is like this. You write a size and absolute number inside square brackets, the name and define the type of the array. Every element of the array is accessed by an index. So if you want to find out the sum of n numbers, n marks rather, then you declare this marks array, start with sum equal to zero. The array has n elements. So you read n. So basically saying it's like our CS11, there are 600 students, but not all or 573 students who may give the quiz. So the exact number of students who give the quiz need to be entered here. This is another iteration. This presupposes that marks have been read into the array. No, it is reading error. So as soon as it reads this, it adds the element of that marks to sum and at the end you output this sum. Okay. Now, if my intention in life was to find the sum of n marks, do I need an array? Yes or no? If I only want to find sum, I don't need an array at all. I can just read a mark, add it to sum, discard it. In fact, I don't need so many locations. I need exactly one location, just a value to be read. Obviously arrays are to be used when I have to do something more with these values after finding sum. For example, not just the average, but I have to find standard deviation. A program was discussed in the lecture. If I have to find out standard deviation, I need all individual elements and also the average which must have been pre-computed before I go to calculate the standard deviation. So therefore I need to retain this value. In general, there will be many occasions when you will be required to retain and use these values again and again and again in algorithm. Notice that this is the preferred way we have indicated. You can actually set up a for loop in myriads of different ways. Every individual can decide one's own way. But this is something which has come to be an acceptable more or less conventional practice in C++ that you start the index with zero. You end the index to be just less than n because the array goes up to n minus one and you increment the array by one. Count++ is also a perfectly acceptable practice because you are incrementing that count by one. In the classes, in the lectures, you have seen different ways of handling indexes. During the discussion on the iterative solutions, you have seen multiple things that can be stuck inside the single false statement. Now those are very nice things to know and those are very good things to use when you want to do multiplicity of things. However, as a practice when you are handling an array and you are just scanning all the elements of an array, whether it is a one-dimensional array or two-dimensional array, the best thing is to set up the simplest loop without any complicated computations inserted inside the false specification. So in English, you should read this slide, execute the loop over all elements of the array. That is the purpose, nothing else. This is the first practice problem. So see it carefully. This is a new term that is being introduced. Erastrozen is, this is a very old algorithm, by the way, to find out all prime numbers up to some n. So what you do is you list all natural numbers. You of course, omit one because one divides everything technically. So one is a factor of everything. But you start with two, two to n. Now what you want to do is you want to reduce this long list of all integers, chop off those numbers which have any previous number factor. So four is a multiple of two, you have to chop it off. Six is a multiple of two, you have to chop it off. So you keep removing elements of these natural numbers. Once you have done this for two, you take the next number, which is still remaining there, which is not yet chopped off, which is three because three does not have two as a fact. So now you take three and scan the remaining elements if they are powers of three, that is multiples of three. And if they are multiples of three, you chop them off. What will be the next element remaining in that list? Two is over, three is over. Will four be there? No. Four would have been chopped off when you looked at two. So five will be there. Now you look at the remaining elements, chop off all those elements which are multiples of five. You keep doing this, you will end up with only those elements which are all prime number. So this is a very simple algorithm. Now what is the equivalent of chopping off? If you are supposed to do it on paper, you may simply cross a number. But you will start with all these numbers, all these natural numbers in an array. So what is the equivalent of chopping it off in an array? Chop, chop. What do you see? C plus plus. I don't want this number. Okay? He has a solution which says whenever any number is found to be a multiple of any previous number, replace that number with minus one. But now when you examine, you will have to keep checking whether first that number is minus one or not. Because you will be still scanning the entire array. You don't know which particular position a number has gone. The second possibility is that actually when I remove a number, I physically remove it. Meaning I upgrade all the subsequent numbers up by one position. If I have 100 numbers left and let's say four is removed. So I push five to the fourth position, I mean the position of four, six to position of five and so on. And my array becomes smaller. The third possibility is to use an external flag. Keep this array as is. But have another array and integer array which has only let's say zero, which means all numbers have not yet marked. And some other number, which means that number is marked. That approach is taken in this practice problem to tell you how while dealing with arrays you quite often have to deal with one array and based on the judgment that you arrive at by examining some element of that array, you do something on the element of this other array. These are things which are frequently required. So therefore that approach has been taken in this practice problem. There are multiple approaches possible, of course, to implement this. So to recap again, we know that prime numbers are number which are only divisible by one in itself. We don't bother about one. We don't bother about itself, but we bother about any other number less than that. If it divides it, then we forget. So we use this back to solve the problem. So here is the algorithm. We start with a list of consecutive integers, two to n. We assume that all elements are unmarked. That means all are currently, technically, they are all prospective candidates of being prime numbers. Now we mark the lowest unmarked element p and remove all multiples of the p in the list. The lowest unmarked element has to be a prime number because if it is not a prime number, it should have been marked in the previous iteration. You're starting with the first number as two, two each prime and that will be the lowest unmarked number when you start with this algorithm. So when you kickstart this statement is correct and you can show easily by induction that this statement will remain valid if the following procedure is executed. So mark the lowest unmarked element and remove all multiples of p in the list except p itself. Repeat steps two and three until all elements are marked. So keep doing this for the first number two, then the next number three, then the next number which will not be four because four would have been marked, next number five and so on. So here is an algorithm that is given for you to program structure that is given for you. This is an explanation. All elements left in the list are prime which are numbers less than n. So let's say n is equal to 14. You start with this list two, three, four, five, six, seven, eight, fourteen and when you complete the execution of the C++ program that you are going to now write, you should have the output list as two, three, five, seven, eleven, thirty. The output list does not mean that these will be the elements physically remaining in the array. We said we'll not disturb the array elements but we'll mark them. So these are the elements which will be output which would have been unmarked at the end of the algorithm. Fairly simple straightforward algorithm but we would like you to write the C++ program in a particular way. You can write multiple variations as someone suggested you could use replace a number by minus one. That's also an easy way of solving the problem but in this particular case you solve it like this. The step by step execution of this algorithm just as an explanation for some because some of you because you have to set up an iteration. So iteratively you start by looking at two. Now after outer iteration which you will set for examining all elements inside each iteration you'll have to conduct another iteration to scan the remaining elements of the array from this point onwards and examine whether any one of them is a multiple. So if you start with two remove four, six, eight, ten, twelve and fourteen. The effective new list now is two, three, five, seven, nine, eleven, thirty. Now you again mark three and remove nine. Then in the new list is this. Now you mark five you will also mark it. After you mark five there is nothing to be removed. After you mark seven nothing to be removed all of these will remain. So marking is equivalent of doing something, recording it. Putting minus one was his suggestion. Putting a separate array is the suggestion that the people who wrote this algorithm have taken. So here is the code line. The outline says I declared an array called removed 100. This array is a special array. This is not the list of numbers. This is something like a set of flags. It could have been a Boolean array as well because I just need to know whether true or false. But the person has chosen to use an int array. The array will contain zero if a corresponding number in another array is not removed and it will contain one if the corresponding number is removed. So that means if there is a list of hundred numbers which I need to examine there should be hundred elements in the removed array as well. And there should be one one on two correspondence. The fifth element of that main list should correspond to the fifth element here as far as the flagging is concerned. The way you are supposed to write is you write a code snippet which will mark all elements with zero. Which elements? The elements of array removed. This is the flag array. How could you have achieved it more simply? Will it assign five to all the elements of array? All elements will become five. Then why? If I say zero, all elements should become zero. So don't make assumptions. The best way it is if you are not sure of what C++ does or if you think that a feature is compiler dependent feature, which means it is not guaranteed to run exactly identically on different compilers on different machines, do the Golagiri yourself in your program. That is what this program says. This is an extremely simple code that you have to write. The second one is if i is not removed, then remove all multiples of i less than hundred except i. You will wonder that if this is the removed list and there has to be a list of actual numbers. This contains, by the way, all zeros initially, so you have to fill this up. You would expect an actual list to contain what is what you are going to examine, right? Some of them are going to be removed. For example, this is going to be removed. This is going to be removed, etc. Where is the array? There is nothing called list. There is nothing there. The point is you don't require an explicit list of integer numbers because you can use the association between index of this array and the corresponding number. So if you are looking at four, effectively you are looking at the value of i, some index i. For int i equal to two, two hundred, two less than hundred. So please note that you are not going to examine this element, this element at all because it does not exist. It is meaningless. Now, when you are examining i equal to two and you are going to mark this element, then you are removing all other elements which are multiples of two by simply changing the value of i and marking the ith element of this removed array, you don't require any other array. After all, you want to remember which particular integer number you don't want to look at subsequent. This single array is more than sufficient. So look at how the problem has been transformed. The problem stated you start with a list of integers and then mark them. That's what you would do on paper. The problem has been transformed into a removed list. And what does removed list contain? It contains zero if it is not removed and one it is removed. So this list will contain all zeroes initially and start containing someones. Where is the list? The list is hypothetical. The list is A in your mind and in the algorithm the list is equal to the index of this array. As the index varies, you are looking at that number. So when you vary i, i is not only index to this array. i is also the natural number which you are examining. Finally, using the array of removed. Now you know the array contains only zeroes and ones, nothing else. But using this array and of course some conditional if you have to set up a separate iteration to go over the entire array. But the third course snippet says you have to write output all primes less than one. All right. Let us quickly look at instead of having discussions on the solutions that you have found out, four people have offered for their solutions to be seen. So let us together analyze these. So just look at the first snippet. This is solution by Schloecker. This one is straightforward. Everybody agrees. This is correct. So almost a trivial thing. You have to set up an iteration for some index equal to zero to less than 100 and put that jth element to zero. Look at the second snippet. I had this outer iteration statement in i equal to two i less than 100 i plus plus already included. So your snippet actually starts from here. By the way, this is serious because in your quiz examinations and in your test examinations and your problem in the lab, the project submissions of the papers of the program submission. If you are required to write a snippet and submit it as a dot CPP file, you have to write only this. For example, if for snippet two, you write for int equal to i equal to two in our auto grader. This for int i equal to two is already there. Now that will get added to this and there will be chaos in the auto grading. So when you are said write code snippet two, it means you have to write the code which will exactly you cannot write whatever is already pre-written. Just remember this from an exam point of here. Of course, it is correct because it explains the context, but just remember. So the second code snippets look at every i value of i. At this juncture, i is being treated as a number. It's not an index of n. You have to examine all numbers from two to 100 less than 100. So i is that number. Now you examine what she has done is to mark numbers two, three, four, five, six, whether they are removed or not. She assumes that the marking starts with zero element, zero, one, two, eight. So you have to remove this and go back. So complicate your logic. I'm not sure if the rest of the logic will be correct then. The output statement also you have to do that. I can find a fault in your final solution. If removed i equal equal zero for your outputting l plus two, clever girl. All right. So do you do you now see the logic? You have an iteration for every number i that you take. You have to examine all the numbers k from i plus one to less than 100 and examine whether k is divisible by the starting number i. So you just examine k modulo i. If k modulo i is equal to zero, it means k is divided by i. If it is, then k must be marked out because k is no more a prime. So removed k minus two equal to one, that is because she has a lag of two in the removed array. It's a slightly complex. So this solution will work. There is another solution by Nikhil. This is code snippet two. I'm not discussing code snippet one because it is trivially understood by everyone. Please note that the outer iteration is already set in the problem. Like to remind you this for int i equal to two i less than 100 i plus plus is already set up here. So your code snippet has to assume that you have some value of i at this point. If the ith element itself has been removed, then you simply say continue. That means I don't want to do anything with this i. I just go back and take the next element. But if i is not removed, then all multiples of i have to be removed amongst the subsequent numbers. So that is where this iteration is set for j equal to i plus one to n. And if j modulo i is zero, then jth element, I mean jth value is marked as removed. This will also work correctly. There is another one by Chaitanya. Again I'm not discussing code snippet one. So what he does is he examines if the value of i has not been removed. That means removed i is zero, which means i has not been removed. So i has to be considered. But look at the optimization he is trying here. He is not examining from j equal to two to less than n. The point being that if I am examining a certain value i, then i multiplied by something less than n is sufficient. I need not examine the remaining value. If up to that range I have not found any multiple. I will not find any other multiple later. Values of j, where i into j is less than n, only needs to be examined. I don't need to examine remaining values of it. This clever optimization reduces the number of inner iterations to be executed. Thereby reduces the amount of work without sacrificing the correctness of the algorithm. Any number which is a multiple. Now here is a problem there. I multiplied by jth element is removed. So I multiplied by two, I multiplied by three, I multiplied by four, I multiplied by five. So instead of actually looking at every number and dividing by i, he is reciting sort of multiplication table of i. And any value which is in the multiplication table is being removed. You agree that i into j is nothing but a multiplication table. And every j is actually therefore of such kind has to be removed. Here is another one by Aniket. He is not optimizing on the number of elements examined. But what is he doing is that if the ith element is not removed in that, that means i is a valid number to be considered, he's starting j equal to two into i. What is the justification Aniket of starting j equal to two into i? So he's saying that all numbers below two into i would have been taken care of. They would have been either eliminated in the previous iterations or their primes. So he's also doing the multiplication table implementation in a different way. He has to examine all multiples of i. He's actually not examining anything at all. He is like in our younger days in hindi we used to say And every time he finds a multiple he just hatches that index and sets it to minor. So all of you have got different ways of solving the problem but you could also sort it in a straight forward way. Examine all values for j greater than i up to n. Find out whether each value of j is a multiple of i by finding out the modulo remainder and setting the value appropriately but some of these algorithms are slightly more efficient. Here is another problem. We may not have much time to have discussions on this problem. We'll continue these discussions even tomorrow but i would like to discuss this problem today. Everybody is familiar with q. All of you are familiar with q for the bus or something. Well the kind of disorderly queues that you see at bus stops is not what i'm trying to describe here. Here is an orderly queue where a new person coming in always joins the end of the queue and does not join a friend who is standing somewhere in between. When a bus comes only the head of the person at the head of the queue only enters and people don't crowd in the last man does not get in. So c plus plus queues naturally behave in a far better manner than most human being behave. But this is the queue we are discussing. We want to simulate a queue. A queue can be simulated by using an array. The head of the queue could be the starting point of the array. The tail of the queue could be the other end of the array. Since we can directly access any element you can access the top element as well as the last element. First element as well as the last element. So n queue and d queue are two operations defined here. We'll also discuss a deck later. The n queue is actually joining the queue. It's an insertion operation that inserts the given new element which has come at the end of the queue. And correspondingly d queue is a deletion operation which takes out the element at the start of the queue. Now here we are going to simulate a queue by actually inserting and deleting elements. Insertion is very simple. If there is a place at the end of the array you insert whatever was the last element you have to somehow remember it. And that plus next element you insert the new fellow. Easy. But to d queue to let a fellow go and catch a bus you have to physically remove the fellow. So physically removing means you have to shift all the remaining elements up by one place. Okay? That is how you could simulate. So here are some examples. If you have an array initially the queue is empty. So the array elements have nothing. Mr. 4 joins the queue. So that is the first element. Now Mr. 5 joins the queue. So now the elements are 4 and 5 because 5 gets added at the last element. 6 joins the queue, 6 gets added at the last element. If you just say d queue, please note that d queue function has no parameter. By implication the first element or 0th element has to be removed. So 0th element is removed and the array queue looks now as 5 and 6 only. Another 8 joins the queue is like this. 9 joins the queue is like this. If there is a d queue, d queue operation is like that. So this is the question one. Consider the queue 4 6 7 8 9 10. This is the queue. You can actually define an array and initialize that array to these values. If you put six values in brushes then exactly first six elements 0th, 1st, 2nd, 3rd, 4th and 5th will be initialized independent of the size of your array. So that is your queue. In fact you can call that array as queue. Now you have to perform the following operations the queue. So what is being written here is a main program with semicolons missing. You define that array and you simply say n queue 11, n queue 13, d queue, d queue, d queue, n queue 12. Obviously you should have to write two functions. One function which is n queue. Another function which is d queue. Please note that if you pass arrays in functions they are always passed by reference not by value. And this is the second question. I will come back to the first question so keep it here so you can start writing it. Second question is what is the minimum number of operations needed to remove 12 out of the queue. You have n queue 12. Now when you say how many operations required to remove 12 means if you have to d queue 12 how many operations you will have to undo. How many shift operations, comparison operations etc. So please note this question down. Have you noted this? I would expect you to actually write down these two functions at home today because tomorrow we'll have some discussion session and additional problems when we meet. Thank you so much.


When I first started sewing I thought I'm gonna save so much money by not shopping and I probably could not have been furthest from the truth. I think that I probably I Know that I spend more on sewing than I do Shopping before I started sewing but I think that's because I had gotten so good at Bargain shopping. I had gotten so good at Waiting for sales Waiting for the sales to go on sale Shopping clearance shopping with coupons shopping thrift stores that I had this full robust wardrobe full of Brand new or at least new to me clothes and I wasn't really spending a lot of money on them The problem was is that as we all know they aren't made well They don't fit well and they don't last very long So I know that with sewing it is clearly a much better option to you know Slow fashion is the way to go and for so many reasons But I've also learned a few things over the years about how to save money while still sewing and As I'm sure many of you have on your personal or your family Resolutions for this year is to figure out ways to save money, but I don't want you all to stop sewing I don't want you all to stop enjoying Sewing so I have some money-saving tips that are gonna help you continue to sew but not break the bank several most a majority of the Indie pattern companies often send their new patterns out to regular everyday sewists Beginners you really doesn't matter at what level you are they want to get a handle if it's a beginner pattern They want beginners to try it so that they know if the instructions aren't clear and all of that kind of stuff But they send them out to all of you you test them you sew them up You give them feedback all of that kind of stuff and in exchange for that work that you were doing for them They will send you a free copy of the pattern when it's released I know that a few of them will send you a free hard copy so it's a really great way to a Get free stuff and Be have a new garment You know you get to try the pattern for free to and you're on a deadline So you kind of have to get it sewn So it's a really fun way you get to meet a lot of people because you're all in this one little group kind of getting each other feedback So that's also kind of fun, but it's a free pattern and at the end of the day free is free so taking the patterns that you already own or One of the myriad of free patterns that are available online So really good quality well drafted patterns are 100% free Well, nothing in life is free a lot of times you have to give over your email address But hey, I mean we're all used to that these days But like the Colette Sorbetto free great little pattern they even redid it last year to be more accommodating to all of us The Henley is that no him walk? From grain line 100% free. There's a lot of them. There's a lot of really great patterns out there that are completely 100% free You can take those patterns take the base of them the Sorbetto is a great example because it's just a very very simple Sleeveless woven top pattern. I mean What can you make with the sleeveless woven top pattern? You can add a skirt to it You can add a peplum to it. You can add sleeves to it You can embellish it in about a thousand different ways There are truly so many things make it boxier make it cropped make it longer make it a tunic You know, there's like literally so many things the hemlock tee is a knit Like I think it has a drop shoulder again add a skirt lengthen it widen it narrow it shorten it Take the sleeves off, you know There's so much you can do with all the patterns that either are free to you online or that you already own so go shop your own stashes your own pattern stashes and Think of what you can make you'll learn so much from pattern hacking and you'll have like It's kind of like what I did for the McCall 7 6 6 0 pattern I think three garments out of that and in my opinion and from what a lot of you said in the comments They all look completely different. You would never know that they came from the same pattern so think of patterns as a way as like a jumping off point try and maybe buy patterns or find patterns They're just super basic that you know You can turn into several different kinds of garments my goodwill doesn't have a ton of fabric there They have had like upholstery fabric before but never fashion fabric however, they do have a ton a ton a ton of like sheets and Things like that that you can use in place of Muslins don't spend money on muslin fabric go get a king size sheet. You guys is like huge It's a lot of fabric. You could make several muslins from it and then go to Goodwill and Search the racks for things that you can refashion I'm gonna be doing a video later this month about a refashion that I'm working on But basically it came from like a triple XL dress Triple XL dresses have a lot of fabric especially the older ones because the style back then was for them to be very loose and Baggy so there was just like a lot of fabric going on back then and you can turn a Triple XL dress into a ton of things even if you're not a super super small person like me But Sarah Tiao, I think that's how you say her name. She is Excellent at this she has a way of seeing a garment and knowing what it's what it could be like what its potential is So she's very small very petite so she doesn't have to buy the huge huge huge dresses in order to You know size them down or refashion them into something else But still her it's very inspirational to see what she makes with her stuff I do this all the time. They're called my crazy muslins because in the end you end up with like a fabric or a Muslin that's like four different fabrics or more. Oh, man They're all crazy and then none of them match or anything like that But how many scraps do you have that are this big?  There's a center front seam So I only needed to find one fabric for this left side and another fabric for this right side the only thing you have to pay attention to is Finding scraps that match your fashion fabric So if you're making a knit top and you want to make it like a slouchy tea You it'd be best to use slouchy tea scraps to make your muslin if you're making a fit-and-flare dress. That's woven Use a woven to make the muslin same rules apply to making muslins whether you're making it out of muslin fabric or out of scrap fabric but You just don't want to do all that work for muslin out of a fabric That isn't similar to what you're gonna be using in the end and then end up with like some weird distorted Version of what you thought you were making But it's a completely free way to make muslins and as we all know making muslins also saves us money because We can get the fit right and we can figure out, you know If it's gonna be too small or if it's gonna be too low-cut or it's gonna be too much of anything that will prevent us from Actually wearing it and making something isn't We don't make things for the sake of making them we make them so that we can wear them and wear them proudly So making a muslin, you know We'll save you money in the end because you'll have a well-fitting garment that you will want to wear and it won't You know be uncomfortable or ill-fitting or anything like that I can't tell you how many free stuff I've gotten from winning contests and they cost nothing to enter I've won I won the ginger jeans party just a few months ago Where I got cone mills denim like high-high quality denim. I got a really great jeans pattern I got the hardware kit to make the jeans Completely free. I basically got everything I needed to make jeans But the time no one can give me the time I need to make the jeans. I had to find that for myself I've won really nice fabrics from a boutique in New York City Who is Elliot Bierman on Facebook every week every week picks a winner and they win Fabric from them and they only have high quality nice fabrics made usually from viscose aka rayon Usually imported really really good stuff. So you just need to go through if you don't have an Instagram It's really the best way But find an Instagram that you can use enter the contest. It usually Consists of following that page maybe following another page Commenting telling your friends about the the contest or re-sharing it. It's silly. It's free and Although it's a little bit You know there are a little bit of rules to it and you have to do a bunch of stuff and you know Let everybody know and kind of help promote the the company that's giving away the stuff But at the end if you win like you get a lot of cool free stuff It costs you nothing to enter other than a little bit of time and maybe a little bit of dignity Other than that like it's totally free and Like you can win a lot. They give away sewing machines online. They give away I mean so like so much stuff notions fabric patterns, of course like tons and tons of stuff So enter the contest and remember you can't win unless you play If you don't know about Seamwork or you don't know exactly the ins and outs of it Basically, it is a company owned by Colette patterns very reputable brand where they Provide two digital patterns every month for six dollars But all your credits add up and you can use them to buy Colette patterns if you don't end up downloading the Seamwork patterns But what's best about Seamwork? I think is that in addition to the two sewing patterns that you get You also get pattern hacks for each of those patterns and sometimes you get as many as like three Four different hacks for the one pattern so you could come away with Call it ten patterns for one month for six dollars if you utilize The pattern hacks that they provide to you This will also help you on what was it number two that we talked about in this video Because you'll learn about pattern hacking. They actually teach you how to do it. They teach you slash and spread They teach you, you know how to make the alterations that you need to make To hack their patterns and then you can apply that to other patterns that you have so you become better at Number two in this video in addition to having tons of patterns And different variations of patterns in your stash just from the Seamwork So it's six dollars a month. I'll have a link in the description box below Where you can go and sign up and I just feel like you could probably Between that by between having Seamwork, which is like getting I mean, they're cute pattern. They're really cute Between having that which feels like new patterns and then shopping your old patterns and then hacking Either free or old patterns that you already have you could sew all year long without ever buying a single pattern Like well, I mean, yes, you're paying for the subscription for Seamwork But that's not in my mind in my girl math mind. That's not really buying a pattern. It's buying more of a membership type of thing you get a lot of things with the Seamwork subscription they have like a magazine that comes out in an email and just some information and Interviews and things like that, but the patterns are really what you're paying for so So yeah, I just feel like between all of those things you could really get away this whole year 2018 Without ever buying pattern if anybody is gonna take that challenge I want to know about it and I want to know how it goes as the year is going on. I'm not committing to it not me but if anybody out there is really, you know trying to cut back on Sowing I mean these indie patterns can cost $20 or more. I mean, I would say $20 on average Yes, you can get patterns at Joanne the big four patterns You can get them for $1.99 sometimes 99 cents Vogue you can get for $5 Which is great, but I just feel like Free is better than any of those prices That I mean six dollars divided by you know ten patterns. That's nothing. That's change That's less than we spend on you know stick a gum in some places. You know what I mean So it can be it can be really affordable if you utilize the resources that people have Outline for you. So with all of that said I hope that my penny-pentures that are out there this year my heart goes out to you I've been there before too, and I hope that some of these tips will help you save money all year long Maybe you're saving up for something Maybe you just Love to sew but don't have the funds to sew which we've all been there too Whatever your reason is. I hope these tips help you continue on your hobby You continue to be able to do something that you love without really breaking the bank So thanks so much for watching and I will see you all in my next video. Bye


Four people have been arrested following a drug bust near Sebeka. Authorities say they seized 21 grams of methamphetamine with a street value of $2,000, along with a gun, cash, and drug paraphernalia. 40-year-old Kevin Vasswood of Pondsford, 46-year-old Carla Keyser of Sebeka, 58-year-old Kenny Williams of Sebeka, and 54-year-old David Lucanen of Sebeka were arrested during the early morning search on October 25th. If you've enjoyed this segment of Lakeland News, please consider making a tax-deductible contribution to Lakeland Public Television.


Yes, hi guys, we'll come back again and someone asked a question regarding MOI visa inquiry. Yes, when we look at the visas, when you look at the visas to Qatar to most of these Gulf countries, it's quite very, very interesting when we come to these countries. Do you know the reason I have to share with you? This is a secret definitely I want to share with you before we get into the video. The secret is that the way the Gulf countries tend to stimulate every kind of process, it is quite amazing. This is where you see that you can access anything without even needing the help of someone. Yes, when you look at the visa processing, we need either you are outside, all you need to do or all you need to have is what we call the Internet or what you need to have, what you call connection. It can be Internet, it can be data on your phone, but you need to have what you call connection for you to check. Yes, we look at the MOI visa inquiry. Yes, when you go to the Ministry of Interior portal, you will be able to check the status of your visa, your application visa, the status of your visa, whether it's in process, whether it's not in process, that is definitely should know. It's quite very amazing that you can access everything that you need at your fingerprint without even a glance, without even a minute. So most of the times I keep on telling people that download what you call or go to the website, check if you put in your application with the agent or your agent is applying for you the visa or even a sponsor is applying for you the visa and is willing to share, be flanked to you to share out all the information or the application process. You can put in your passport number and put in your nationality. You put in nationality and passport, you can check your visa using what you call your passport. You can check your visa using what you call the application number. So all those are options. If you're ready in the country to know the status of your visa, whether it's expired or whether it's still valid to come into the country, you can still use it using what you call, you can still use it using what you call your passport or Q&A. So it's quite very interesting that you can check your visa on the ministry of the interior portal, fee of charge. So for those that want to inquire about the visa, I think it is the right time for you, you can check the visa and check the visa on the ministry of interior website without anyone. You can check status and know exactly how the visa is moving and definite what you need to know. So hope I've tried to share something for you. Hope you definitely know now. You never have to be deceived by agents anymore. Just go to the ministry, put in your passport number, put in your nationality. Then it will give you all the details of the visa, all the process of it all until it is get off. Thank you so much for coming back to us by the way. It's always makes giving you all this update. Don't forget to subscribe.


Welcome back to Kids Fun Science. My name is Kim and today's experiment is the rubber band cup rocket launcher. So basically you need rubber bands, you need three or four cups and then you're off to ready to go. So one cup is empty, no rubber band. That is your launcher and then you're going to use another cup and you're just going to put a rubber band all the way around it and that's going to be your rocket, right? So Sam's pretty easy, grab a cup and just put a rubber band all the way around it for the first one so we only have one rubber band. For the second experiment just add a second rubber band in a plus sign right there. You can tape it down if you want to but you don't need to. So it was just a regular cup and no rubber band and you put it down and then you're going to take your rocket with a rubber band and you're going to stretch it down to the bottom here as far as it'll let it go and then you're going to try to release both fingers at the same time and it shoots off. So pretty good. They're going to angle off if you don't do it exactly. If you do this side one side then let go here it's going to angle to the side as you kind of saw there. So we're going to try to make an attempt to do it again with the smaller cups and we'll let go and two shot that way there but hence the potential energy is throwing up then kinetic energy is released. We're going to go one more step up to see by increasing it to two rubber bands will it go a little higher. The first one went about three feet. We're going to measure it in a little bit but we're going to see if this goes any higher. So we're going to take our launcher. We got two rubber bands here and they just flip it right over put it right in the middle here and then try to release it at the same time. That's the tricky part but it's still going to launch and definitely has a little more power. It angled still probably about the same height but it felt like it was going up a little bit faster. So let's try a smaller cup same thing we got two rubber bands. These are both 64 so they're a little thicker on the rubber band pull it down you can feel I can feel the tension already so that potential energy is just storing in it. That definitely went the farthest that went probably about four feet so that definitely went a good good distance on there. All right so we're doing the larger cup now I think I'm just gonna we know the we know the we know that the rubber bands can go higher so I'm just going to skip the single rubber band here we're going to go double rubber bands double rocket so double here show you in a second so I got I got two rubber bands on each one we got one launcher right here and then we're going to put the first rocket down and then the second rocket down and we're going to see if we can hit the ceiling with these larger rubber bands pull down that definitely hit the top of the ceiling very hard and get straight back down definitely the highest launch so far so the results are when you have the larger cups and the double rubber band it definitely shoots the highest so I will come back and tell you the science behind it right after this so potential and kinetic energy the science behind this is as you stretch down the rubber band over the cup you're storing up energy by putting tension on the rubber band the stored up energy is called potential energy the more the rubber band stretches the more energy that is stored this is why the further the launcher is pressed down over the cup the further it flies up when you release the rubber band the tension is is released it's the potential energy that's transformed into kinetic energy which is energy in motion I hope you like this video if you did remember to click thumbs up and to subscribe thanks for watching


The film has so many funny moments, what's your funniest memories from making the film? The bedroom, we know where we're getting him ready, but I just couldn't stop laughing. I was just laughing the whole way through. Yeah, they let us improvise this whole thing about him getting me ready for the night out.  Just welcome to adulthood. Thanks, and Michael was dressing me up and then that whole thing about you look like a beacon and stuff like that, that's all just Michael just having fun. That was a good laugh, we had a good time there and mine is just, it's just yeah pissing about with him in terms of funny moments was just the best. How much do you get to improvise lines like that? I spent five years writing a script and then he came in and went bollocks. Me and Ben, we've made some short films that were all improvised and we got Michael's soccer in, we knew he had a good background in improvisation and then we knew we wanted to make those characters' friendship feel really real and so we just thought that would be a good way of creating that rapport. I was laughing the whole way through. Every single scene I was laughing. A lot of the time we would make each other laugh and it's in the film because we just liked having that because your friends make you laugh and the one thing that really annoys me in a lot of comedy is that people don't laugh so you get all these comedies where people are cracking these amazing jokes and then their friends just go and then it's on to the next thing whereas I like seeing people making each other laugh on camera it's really infectious. The chat-up scene in the bar is so good, what was that like to film? That was actually tricky, that was one of the scenes where there was no improv it was all carefully written down and that was one of the only scenes that's made it from the first draft to the last and so it was actually quite tricky to shoot, there was a lot going on you've got Michael in that side texting, you've got me with the girls looking down there's a lot, it's quite a technical scene so it wasn't actually that fun to shoot but what's really fun is now watching it with crowds and it's getting this huge reaction so this is the fun part of watching that scene now at the time I was like this isn't going to work this is something kind of a dodgy sitcom this is just going to be crap but no I think we pulled it off so obviously this is about a date that goes horrifically wrong what are some of your own worst date experiences in real life? Do you do much dating? No No, I've never really done it I tried Tinder Did you do that? I tried it recently and I hated it and I went on Tinder and I was just swiped right at anything that looked human I was just going yeah that's alive, that's alive and then waited for like three days and then got one response and it was this woman and she said we had a match I think she was like Russian or something I went oh cool, do you want to meet up? and she went yes it was £50 for the blowjob she said she was a prostitute Right So I spent three days on there I had one match which was a Russian prostitute that deleted Tinder I'm not brilliant with women at all I'm a shit, I don't know what to do


Studying winter swans by owenshers. Here's how you can analyse this poem. In terms of structure, the poem is written in seven stanzas, however the first six stanzas are terseps and the final is a couplet. The poem opens with pathetic fallacy which signals that the lovers in this poem are having a difficult time in their relationship. The alliteration of W hair shows that the lovers are considering whether this should break up. The earth is personified as gulping for breath and the personification here shows that their relationship is fighting for its life. They see swans and this is symbolic of them in a relationship. The simile and enjambement in line nine shows that the swans are teaching the lovers a lesson about being together. This simile shows the importance of being unified and staying together. The dialogue here shows the speaker's lover reflects on how it's important they stay together. The sibilance in slow stepping, shingle and sand shows that the lovers realise that they want to stay together. The poem then moves from being a tersept to being a couplet showing that they've decided to stay together.


Welcome back, everyone, to theCUBE's live coverage in San Francisco, California, theCUBE's live Google Next 2023 coverage. This is day two winding down. This is the analyst angle section where we go in and we break down, we analyze, we look at it, we kick it, we analyze, we critique it, and we see where the action is and where the needles are moving, where the game is being changed. I'm John Furrier, your host, Dustin Kirkland, contributing analyst with theCUBE. Welcome to the show. Thank you very much. We start with you, Joao, welcome back to theCUBE. Good to see you again. Thanks, Joao. As usual, great guest contributor appearance. Thank you. Rob Stretche, heading up our new CUBE Collective Analyst Team. Rob, as usual, great day today, a lot of great commentary. Yeah, it was great. Let's get into it. First question, are we drunk on Genevieve AI? Okay, I mean, I'm feeling it. I feel buzzed. Sure. A little intoxicated, a lot of action. Yeah, I don't know. Are we drinking too much Genevieve AI Kool-Aid? I'm going to say maybe we've had a few too many cookies and a little too much milk, okay? It's maybe not to the point of abuse, but we've been talking a lot about it. The thing is that this is a once in a lifetime, once in a generation change in the way we fundamentally approach technology. And that doesn't come along every day. John's been comparing this to the dawn of the internet in the late 90s. And I think that's apropos. I think there's really something here that is pivotal and will never be able to go back to writing code without an assistant, reading 1,000 page documents and manuals without something to help us summarize that and digest. Rob, what about you? You drinking the Kool-Aid? I think it's in everything that they're doing here, they've weaved Genevieve AI into every single platform. Duet is in everything from Looker, BigQuery, through all of the workspace apps. I think we are a little high on Genevieve AI, but I think to Dustin's point, maybe for a good reason for certain things, I think it applies more in certain areas than it does in other areas, but writing emails will never be the same, right? I mean, Genevieve AI is there to absolutely help with that kind of stuff. So Archie, we're going to ride the wave, hype wave? Are you drunk on AI too? I am actually, I have seen a couple of swings in the whole industry since 94.com as to why it happened and why some people got lost. It's a hype cycle. During the hype cycle, the warning to the vendors is that don't swing the pendulum to the new shiny object. Stay practical, do not shun your existing customers. They have real problems. The brown field is important. Yes, this time, this generated AI is real on the creational side. When the humans are involved, you can use these models to augment humans, right? But when it comes to automation, there's hallucination problem. You can't take these models close to the systems of a record or automation, which doesn't have human looking at the logs or machines, right? So you have to be careful there with the messaging that you don't want to alienate the CIOs of these companies which have a lot of brown field workloads. But having said that, the duet is everywhere. The demos were great. The narratives has shifted. I call the developers are not maze runners anymore. As a developer, I was like a maze runner. I need to take a look at the login, the identity, persistence, so many things I have to do. I have to do less of that now as a service services, as well as with a lot of help from AI to cook up the code routines for me. And refactoring demo was great from yesterday and today as well. Well, I'm kind of old, so I'll date myself. When I started in college in the 80s in computer science, I will never forget, I would say the older guys, hey, you're the punch card generation. And I never once touched a punch card. And people don't even know what punch cards are. That's how the mainframes were coded. Dustin, this is a punch card moment where you don't talk about that maze running. That's old. Now the new way is going to be completely different. And by the way, structured languages at that time were awesome. And that's just changing. I think it's easier and easier. Yeah, it's fundamentally changed. And that's the thing, we'll never go back to punch cards. We'll look at it as antiquated. We kind of nostalgically think about, I don't know, Romans running around in togas day to day. That's the way we think about punch cards. It's this anachronistic sort of thing. We're going to look back, I think, at a moment before AI was able to generate really intelligent answers to queries, really high quality tests for code. I want to flip this on its head though and ask you a question, John. So, you know, if maybe there's too much discussion around an AI here at this Google event, is there maybe not enough focus on AI certain somewhere else? You mean like, I don't know. AWS? Yeah. Well, I mean, I think the question everyone's asking is, did AWS miss the gen of AI? And I know that's come up a lot. Again, I've talked on theCUBE about it all the time, Rob, you know I've been my rant here. Amazon Web Services definitely missed the gen of AI wave as we know it in the hype. Okay, so start talking about a lot of things that are going on. But remember what's happened in the past 18 months. Amazon's been on a growth rate that's been second to none in terms of revenue growth, client growth, just thundering performance and everyone knows we've been documenting that. Internally, I've had conversations with Andy Jassy, Adam Sileski, Swamy, all the top people and some of the product managers. They knew about gen of AI. It's not like they weren't doing it. They were doing stuff. They just didn't see it as an important point at that time. And open AI and Microsoft pulled off the marketing hype CUBE of the century, which is by organizing a press event and doing the 10 billion, whatever the number was, was a 10 billion dollar investment. That became such a shiny object, if you will, even though it was not, but that woke up mainstream. Once that shoe dropped, they were flat footed. And that's what happened with Amazon. So it wasn't like a bad decision. I asked Adam Sileski last year before re-invent about data and platforms. He actually brought up LLMs, unaided awareness on that part. He said, yeah, LLMs, he had it in his talk track, but it wasn't like we're investing in it because they're the number one.  And so we will see what happens at re-invent, Rob. And we're going to see if AWS can step up to the plate and, but remember, that's a few months away. This shit's changing so fast. Yeah. Well, it'll be interesting to see because they actually promoted Swamy to the S team as well as part of this over the last couple, I think it was last month. And if you start to look at it, like you said, they've had LLMs for a long time. I mean, Titan underneath, Alexa has been there forever. And that's came out of like nuance and the people who built that. So it's, but to your point, the usability of it other than for voice was missing. Amazon has historic run and the key point of the story with AWS, and this is may or may not be well known for the folks that's just jumping in now, back when Amazon Cloud was growing like a weed because of a major factor. If you wanted to provision a data center viewer startup, like Dropbox, Airbnb, Twitter, they all started on Amazon because your choice was to provision by gear as cheap as 10 grand to 100 grand just to get the app up and hosted. And then so it was easy and no brainer to put the credit card down and go to the only game in town, AWS. Okay, so that's why they won. And then they took over the enterprise and natural growth. But today, Amazon's weak link. Their only, I think their blind spot is if they miss that startup wave, with right now, this culture, if you take someone in the dorm who's 22 and say, here's the console for AWS and here's the console for Google Cloud. I guarantee you, nine out of 10, I'll be like, what's AWS? Okay, I can back up you over here. The experience matters actually, Google being BDC company from DNA, they know experience that I think better than the. Do you disagree with my statement? That if I. No, actually I do, partially I disagree. Okay, AWS is a good contender. They number one right now. Yeah, I don't know. Actually no, AI as well, AI as well. Because we're shifting, right? In that shift, they're not going to let it go as easily as we think they will. Because a lot of, okay, look at this. Google is doing AI, of course, but a lot of ecosystem around it, a lot of startups are doing AI as well. VM where we saw last week, they are training their SDKs and their code actually snippets and CLIs. They have a model, so that can sit in AWS as well, in Azure and in Google. So Google will train their own sort of Google stuff, which when we talk about the creation side of things, right? Yep. Enabling practitioners of Google Cloud, they will do that. And Amazon will do theirs. I think the. The question, I mean, still. The benchmark. Okay, go ahead. I think Google still has to push harder and keep pushing if they want to get that, you know, like number two seat. Okay, Rob, you worked at AWS, you worked at Google, Dustin. Amazon's number one, they've been growing. They have a lot of large enterprises. They are the number one cloud. They have a lot of stuff that they've solved. Now, they're there. So they're in a good position.  So what's the benchmark for AI dominance today? What's the scoreboard? How do you measure whether someone's winning or losing? Because they did more press releases? Yeah. For a moment. I think AWS has a challenge that they can overcome potentially. And that challenge is that each service that's built there is an individual service. Unlike here where they're building solutions, GWT is integrated into everything here. Maybe too much so, but it's in every product. The way that AWS services, even within the services, like S3 has three engineering teams. Integrating AI into S3, if you were going to go and do that and say, hey, I want to be able to find my objects, it's going to be tough. I think that they have a tougher road to have as pervasive in AI than Google does or Microsoft for that matter. I think Amazon could still be an AI infrastructure dominant player with bedrock in that space, but I don't think it will be as pervasive as it is with Google or Microsoft. Doesn't which it could. Yeah, I'd break it into kind of two pieces. One is the marketing piece. And in that one, I agree with you to a large extent, AWS has missed the marketing hype cycle for AI. Several questions, whether that matters or not. Go look at the run rate and the business and I'd say, no, it doesn't matter all that. They're doing just fine. The longer tail is a different question. But Microsoft nailed it, Google nailed it. As we've said over and over and over again, much of this AI stuff is old. Alexa's a great example. We've been asking Alexa for directions and recipes and that's AI. Duet is kind of just a really fancy clippy. We had clippy in Microsoft word years ago, right? Now, what's changed is that, wow, I mean it's just so much more powerful than, hey, can I help you put a period on into that sentence? So there is a marketing angle. The big piece though, I think you've nailed it, which is if seven out of 10, eight out of 10, any number north of five out of 10, if a majority of kids out of college, startups getting funded are doing the majority of their work on TPUs, on Google Cloud, GPUs, Google Cloud, more so than Microsoft or Amazon, that fundamentally changes the landscape for a decade or more. And if you look at this market, and by the way, Amazon never had competition before like this when that startup wave was the proxy, was the canary in the coal mine, for who will win, obviously they grew with them. If Amazon loses the startups, I think they might lose the generational game of the next gen cloud and that's a risk. Now I'm just saying, we'll see they have startup programs, so that's an area we're going to watch it reinvent. The next question comes down to, what does the scoreboard look like for winning in AI? Is it production workloads? Is it revenue? Because right now the developer market, to me, is where that focus should be, because that's like, to me, that has always been in this market, at CNCF and open source, the developers are the ones voting with the collective intelligence of their code. And that's the de facto standard body in my mind of what gets adopted. If those developers are not coding on AWS, they won't be there. And that means the enterprises will follow the consumer developer market, which is open source. So that's to me the dots that kind of are weird to connect, like you can't just say we're going to put a service and use our power of our machine. If the developers don't like it, it won't hunt, the dog won't hunt. So I believe that Amazon's got to focus on the developers better than they are now while doing the enterprise game, because they're doing okay at that, they're not hurting. I think developers, masons of digital empires, right? They lay every brick and build these things, right? So AI is in hype cycle, lot is very real as well. It's not just fake hype like Web 3 or crypto, you know? Those were just fake, you know? So this is real and definitely AWS has to put their act together. There's no doubt about that. I'm sitting here watching you and you guys from this seat and you guys were over here too when you're doing the interviews. Behind us is the hardwareverse. It's where the TPUs are. People are getting selfies next to it.  We are in a world where speed matters, speeds and feeds. Amazon's got great infrastructure. They're always optimizing the physics from James Hamilton's days, the Peter DeSantis here at Google, they got great pedigree on infrastructure making, you know, from cooling and power to IO transfer. So the question is, what's the future look like for the next gen cloud for AI? Is it TPUs versus GPUs? Is it going to be embedded in the software? That's going to be a very interesting question because the dominoes will fall and storage comes up only once in the entire conference ride. No one says we're worried about it. I was going to say that made my head explode in a positive way today at least. I mean, when storage was brought up, but it just shows you how buried some of the other announcements were. Like that Ally, Alloy, DB, Omni can be deployed on any Docker container platform. It's a Docker container. It can be on bare metal. It's running on laptops at people's houses. The fact that Google is really pushing it all in on that and really trying to decouple and bring their kit other places, we talked about it with the Google, the distributed cloud, Google distributed cloud where CSPs are running it. And I think to me that's a big win for them is that they're taking a different approach. They learn from the failures of outposts. And they're taking a very different approach than even Azure Stack, which is done okay. Well, we're going to have a few months to prepare for re-invent. So this team here and all of our analysts and our collective, we're going to be looking at all the corners of the landscape of AWS and we're going to be inspecting where they're going to infuse AI, how that's going to play out. Because we will see how they play their hand, Rob. When their cards come down to re-invent, we're going to see what they're going to be holding relative to their GNAI capabilities. Well, I want to shift gears. Oh, you want to continue? Yeah, actually, yeah. I think on that note, the channel conflict, like you guys talked about that yesterday evening, right? The channel conflict is more here on Google side because they are cooking up the sovereign cloud and also cloud in your data center, like equivalent of outpost, you know, if you will. So two different flavors of infrastructure. For countries, they want to be sovereign, for companies, which they want to have to keep everything private. So it collides with VMware, it collides with Red Hat, it collides with so many other- We talked about that yesterday, Jeff, and I think I've always said, Dave, and Dave and I talked about this years ago when we started theCUBE, EMC had, VMware had an ecosystem. Ecosystems is about enabling them to create value to make money, right? Get me some distributions, my products, get some customer value, get paid for it, and when you start having conflict, sometimes it's good conflict, we thought about yesterday, and I think when the tide is growing, growth hides a lot of the barnacles, if you will. When the tide pulls out, you can see where the barnacles are and who's going to close on, who's swimming naked. So, but that's a different, I think Google's fine. I mean, to me, the thing is, is that what I'm thinking about all week here now is the AI cloud was my thing yesterday about what I'm thinking about that day. Today I'm thinking about this wave of abstraction, and every wave, whether it's punch cards, web, it was a game of simplifying, reducing the steps it takes to do something, whether it's productivity, like you said, the maze versus simplicity, and making it easy to use, right? So simplification, reduce the steps it takes to do something. So the area is, the question on it for you guys is, where do you see that formula hitting? Yeah, I see data analytics, there's all these areas of storage where you can reduce, abstract away steps. Yeah, I got strong feelings on that one. I've got a personal mantra that's written across my whiteboard at home, and it's been there for years, and it's two words, reduce complexity. That's something that as a product manager, and as a leader and as executive, I've always challenged the teams that work for me to do. Anytime we can reduce, remove unnecessary complexity, especially. Now, I think where we're at right now in the cycle is an incredibly complex set of solutions. I'll draw a very quick analogy, since we're here at the Google Cloud event, Kubernetes, Kubernetes, Kubernetes, we spent years, I spent years working on Kubernetes, incredibly complex, and way too many people worry about Kubernetes they need to. Meanwhile, in the last four years, I think Google has done a really nice job of abstracting that away into Cloud Run, Cloud Build, write some code, deploy it, and it runs, hey, guess what, there's a Kubernetes underneath it, but who cares, you don't have to know, and I think that's a good example of reducing complexity. Where I think we'll go over the next six months, and I think some of the winners will emerge, will be those who are able to reduce the complexity of, I don't know, how many APIs did we have to learn the names of?  We're the areas, we're the areas that you can jump right out and just jump off the page, we're the areas that are screaming for simplification and ease of use. Multi-Cloud, right? Multi-vendor, Simplicity, Multi-Cloud, Simplicity. Remember, Google was supposed to be the Multi-Cloud, you know, where's that narrative? So Google is known for like shunning the old narrative and moving on to the new narrative is very fast. I still want them not to do that, keep the core intact. Okay, you love open source, stay there. You still want to be open and enable multiple clouds, stay there, do not shun old narratives. Like I have, actually I'm doing analysis at home which I'll publish tomorrow end of the day, that what was said in last two, three years, which was not even mentioned this year by Google. So, yes, that's the- They're going to pull the plug, Rob, final word here, get the word in, officially, where's the spots? I think it's all about how you pick your models, what's the right model, how do you know which framework to use, and all of the different stack that goes on there to Dustin's point and you know, sorry, Jeep's point, it's still super complex. I think it's really somewhere it has to get simpler. It's the new enterprise model, it can't be the old one which will solve complexity with more complexity. That's the old way, that's the old enterprise way, software, everyone knows that, don't do that, it's making it simpler, that's the cloud way. Just briefly, we talked to the people who train the partners, they are telling us that it's very complex problem to solve. Training partners on the new stuff, it's very hard. Guys, thanks so much, again, sorry, Jeep, thank you for being a great contributor. Dustin, thank you for coming on for the first time. We're going to do more of this and appreciate your contribution and of course, we've got theCUBE collective. Rob, are you going to put a quick plug-in for the collective? Yeah, so we're really ramping up, starting to ramp up things and get things off the ground and we have a lot of really interesting services that will be coming around that will be partnering with that collective to be able to provide, so really excited. And Sue, I'm super excited because theCUBE is a unique point, we talk to great people, we get the data, we want to share that with you and having a community that can work together to roll it all up is something, it's been a big mission of ours for many, many years. Dave and I and the team, so guys, thanks so much for a great analyst angle. And we're going to end day two, we'll see you tomorrow, day three in theCUBE. Keep it right there, look for us tomorrow at theCUBE.net and SiliconANGLE.com. Thanks for watching.