This video is sponsored by DistroKid. Follow the VIP link in the description down below to get 7% off an already amazing price to distribute your music to the world. Hi folks, I'm Mike, and I hope you're well.  And if you're just starting out, it could be difficult to know exactly what to focus on. That's why I've made this video with five essential beginners mixing tips. But even if you've been mixing for a while, you may find these useful in terms of refocusing on what's really important. Let's get started with what I think is absolutely key. Balance. I'm primarily talking about level or the comparative volume of all of the elements in your mix. Balance doesn't mean that all of the faders will be at the same level, and it doesn't mean that all of the meters will be reading at roughly the same level. It's a little bit more subtle than that. And when you have a good balance, it feels like everything is working in the right way with each element. In other words, the things that are supposed to be kind of in the background will sound in the background, and the things that are supposed to be upfront, often things like vocals, will feel like they're just a bit upfront in terms of everything else.  However, when you get into your door and do your own balance, you can quickly find that you lose objectivity. And when that happens, I have a really quick tip for you, something you can do. Let's take a look at this really simple mix. This is a guitar and a vocal. We just wanna balance these two things together.  Was it the touch of my hand? Was it the way that I stand? Okay, that guitar is way too quiet, right? So I think we all understand that right away. Let's push the fader for the guitar all the way up to the top, and have another listen. Was it the touch of my hand? Was it the way that I stand? Too close. Now, it wasn't quite so obvious this time, but I think most of you will agree that that guitar was kind of overwhelming the vocal, and the vocal should really be sitting up front with this piece of music. So what I like to do is find those extremes and then work from them to a point where I'm kind of not quite sure anymore. So let's push that fader all the way down to where it was before. I'm gonna play the track, and I'm gradually gonna push the fader up until I get to that point where I just feel, is it right or not? Not sure, let's have a listen. Was it the touch of my hand? Was it the way that I stand? Too close, and that kept you running? This is a point where I'm not quite sure. I'm thinking, you know, that could be okay. Let's try the other extreme and work down from it. So fader all the way up. Was it the touch of my hand? Was it the way that I stand? Too close, and that kept you running? Okay, so I think there is a bit of a gray area. So what I'm gonna do is look at those two extremes. They were here and here, or not extremes, but the edges of the extremes, and then just go halfway in between, right? It happens to be around about zero for this mix. Doesn't mean it will be for yours, but that's where I reckon it's probably gonna be about okay. Let's have a listen. Was it the touch of my hand? Was it the way that I stand? Too close. Now I think that is now about right. So I find it useful to listen to those extremes and work from them. Now as I add more elements to this song, I may find that I'll be fine tuning this for absolute sure, but that's a pretty good starting point. Now there's one other thing which you can use in this situation, which is absolutely golden. Reference tracks. These can really save your life with a mix. A reference track is a commercially produced track which you're gonna use as a reference. Something to listen to and compare to your mix to assess all kinds of elements about your mix. We'll talk about that later, but first of all, I wanna talk about some really important things about reference tracks. First of all, make sure you choose the right track. Preferably something in a similar genre with similar instruments being used and a track that you would like your track to sound similar to in terms of productions. That's super important. The other thing is make sure you're listening to your reference track through the same speakers that you're mixing with. The easiest way to do that is just to drag or import your track into your door. I like to have it on its own track which I can solo and mute, et cetera. That's really handy. And when you do that, make sure it's roughly at the same volume as the rest of your mix. Usually it's gonna be way too loud because it's already been mastered. So often you'll have to turn it down a little so it's at a similar volume because if it's much louder, it tends to just sound better to you for that reason. So that's super important with reference tracks. Now what am I listening for in a reference track? Well, I'll go through a few of the things that I often listen to. First of all, there's balance that we talked about a moment ago. How loud is the vocal compared to the guitar or the piano? How loud is the kick compared to the bass guitar? Those kinds of things are really important. So I'll be listening to the reference, then listening to mine and comparing them. Another thing that I'll be listening for is particular frequency ranges. I'll listen for air or those very high frequency ranges in the reference and see how mine compares. On the other end of the scale, the low end. Now the low end is super, super important, I feel with reference tracks because many of us are mixing in non-ideal environments in terms of low end. So a reference can be super helpful. And I'll also be listening for presence in the mid frequencies, all of that kind of stuff. So definitely do make sure of reference tracks. And if you've been mixing for a while and you're struggling with your mixes, let me know in the comments down below, have you been using reference tracks? Love to hear from you on that. By the way, when I was preparing for this video, I came up with so many other tips apart from the five I've included here. If you'd like to know about those and you'd like to see a part two to this video, do let me know in the comments down below. So a lot of people wonder where they should start their mix and I would most often suggest that you should start in the loudest part of the song. In this song, for example, you can see here where all these sort of pink clips are that we have the most elements present in the song in that part of the song. It's generally going to be the loudest part of the song. So I would start your mix there and try and get everything in balance. But there's a word of caution with this. Just because the balance will be correct for that part of the song, doesn't mean it's going to be correct in other parts of the song. So for example, in this very busy section, I may have a particular balance between the vocal and the piano, but I may find in a much quieter verse that I don't need the same balance. Now we normally change that from one section to another section of a song through automation. So automating values. It could be a fader. It could be levels of different effects or what have you. Now automation is sometimes regarded as a rather more sort of intermediate part of mixing. And I guess you could say that it's something that you wouldn't concern yourself with right now if you're a beginner, but I would aim to learn about it reasonably soon. Otherwise you're just going to find that some parts of your song sound in balance and other parts don't. And you want the whole thing to be in balance. Use buses. I come across people who've been recording at home for decades sometimes and they still don't use buses. And I can't help but feel they're making mixing way more difficult than it needs to be. Let me show you why. I've got a number of different vocal tracks here. 10 of them all in fact. And they make up a kind of a choir or a vocal group. I'm going to select all of them. And without using a bus, I'm going to apply reverb to each of them. So I'll grab my reverb and I'll just go and drop it in the insert section. At least here in studio one, it automatically inserts it to all of the tracks I've got selected. Now the first thing I'll often want to do is create a balance between the dry and the wet signal. So what I'd need to do is go to the first track here, solo it and pull up its plug-in like so, have a listen and adjust that balance. Okay, that's fine. But I'm now going to have to go through that process another nine times for these 10 tracks. And if I don't get it right when I've added other elements to this mix, I'll have to go back and do it all again. I probably won't bother. And it will probably never be quite right. The other thing is I'm using 10 plugins already in my mix. And even though we've got much more powerful computers these days, I still think we need to manage the resources from within our door. Okay, so how would you do this with a bus? Well, first of all, let's get rid of all of those plugins. And here in studio one at least, once I've got all of my tracks selected, I can grab my reverb and drag it over to the sends section. So I'll do that and just drop it there. And if I just move this plugin out of the way slightly, you can see that a bus has been created here. A bus is just an extra channel in our console or a mix through in our door where we can send audio. It's as simple as that really, but it has multiple uses. And the first use here is for our reverb. Let's have a quick listen. Oh, we play. So all of those vocals have now got reverb on them, but the balance is pretty poor. Well, all I have to do is pull up this one plugin here, which is inserted into my bus and adjust that balance. However, I'm not actually gonna use the plugin for this. What I'm gonna do when I'm using a bus is turn this signal all the way up to fully wet in the plugin. There's usually a control for that. And then what I can do is just use the fader on the bus down here to adjust that blend. Let's do that now. Oh, we played it all this game. And if I want to adjust it again later, super, super simple. I don't need to do it 10 times every time I want to make an adjustment. So that's one use of buses and it's one way of routing to a bus using an effects send. Let's just get rid of that for a moment. I'll get rid of the send from all of the tracks like so. Just do that, remove. Sorry, I didn't select all of them. Let's try that again, remove. And this time I'm gonna show you how we can use a bus to route all of the sound from a track or a channel in your mixer through to that bus. So I'm gonna select all of them again and then I'm gonna right click here in Studio One and select Add Bus for Selected Channels. I do that. And you can see that again, a bus has been created. Now, because all of those vocals are going through to that bus, I can now control the whole volume of the whole choir with just one fader like so. Oh, we played it all. It's just one of the many uses of buses. It may seem like a kind of an intermediate kind of a thing to be worrying about as a beginner, but I would say get on to it as quick as you can. It's gonna make your life much, much easier. Now, when you wanna get your music heard and sold on major platforms like Spotify, Apple Music, Amazon, Google Play, et cetera, I highly recommend you make use of our sponsor, DistroKid. You don't have to sign up with accounts for all of those places. DistroKid is a place where you can manage it all from one central place. It's really, really cheap, actually. And if you follow the VIP link in the description down below, it's even cheaper. The car test. Back in the day, you'd finish your mix in the studio, and the first thing you do is jump into a car, take it for a drive, and have it listened to on speakers that were down by your legs in a very closed environment where you're not sitting equally between speakers, et cetera, a very different experience to listening to your song in studio monitors. And the point of the car test, I suppose, was to listen to it in an environment where many listeners will be listening to it. And as I say, in a place where you're gonna get a very different sound to your studio monitors. Now, the car test is probably still important, but I'd say possibly more important would be the ear pod test, or maybe even just the phone speaker test. The important thing is, do listen to your mix on different devices. It's going to reveal problems that you didn't know were there on your studio monitors, especially for home studio producers where our mixing environment is often less than ideal. Now, do be cautious with this. Obviously, these different systems do have characteristics. Don't listen through a phone speaker and expect it to have amazing bass response. It doesn't. It probably can't even produce some of the low frequencies. So I don't want you to listen to that and then suddenly turn up all of the low end in your mix to compensate. So do this with some intelligence. But I would say that, as I say, the ear pod test is really important these days because for many of us, it's where we listen to most of our music. Now, what that means is because you're familiar with your particular listening device, you kind of know how a professional mix should sound on that at least. So it's a really good place to test your mix. Now, as I said earlier, if you'd like a part two to this video, there's so many tips I could have given you today which I didn't have time for. So let me know about that in the comments down below. And if I get enough comments, I'll definitely make that video. Thank you so much for joining me today. Good luck with your mixing and I'll see you in the next video.


Okay, so this is lecture 23, so roughly I think we are halfway into the course and we are doing fine, thought we will be too slow but we are doing fine. Okay, so this class is going to be an illustration of the Wittebi algorithm. We will see an example, a couple of examples and maybe some quick ways of bounding probability of error. Okay, so that will be this class. Okay, so I am going to start with the simplest example out there for the Wittebi algorithm, which is this mz being 1 by root 2 minus 1 by root 2 z inverse and what is my mz going to be? It is basically, what is my mz? Let me see, it is the equivalent causal monic response. So I am doing a spectral factorization on my sieve pulse and the monic causal part is mz. So I am going to say my transmit constellation is ppsk plus minus 1. So that is going to be my transmit constellation. So the picture you should have in mind is symbols are coming in into mz, it is getting filtered by mz and you obtain received symbols to which noise gets added and then you receive something zk and you already code based on zk. So I am going to take an example situation, it is quite simple. So if you do a trellis for this, you will get a two state trellis. So I am going to draw a very simple case where there are three stages and one termination stage, three data stages and one termination stage. So if you draw the trellis for this, it would look something like this, that would be the trellis. And like I said typically you work with a certain zk which was received. So I am going to say zk is so the transmitted symbols are either 0 minus root 2 plus root 2. So we will take roughly root 2 as, what can we take root 2 to be roughly as 1.4. So I am going to take root 2 as 1.4, then 1.4, minus 1.4 as 0 gets transmitted and I am going to receive that signal corrupted by noise. So that is what is going to happen. So I am going to take minus 1.1, then 0.3, then minus 0.5, then 1.6. So those are my received values. I am trying to decode, remember how many symbols have I transmitted? If I have a trellis like this for decoding, how many symbols have I transmitted? Yeah, it is only three data symbols. The last one was a termination symbol. So the sk would have length 3, bk would have length 4, sk 3 plus that extra plus 1 which was for termination. That was my sk. So I will quickly write down the outputs corresponding to each branch below the branch and we will write down the branch metric above the branch. So the output corresponding to each thing is this. So once I write for one complete stage that is good enough. We do not have to keep writing for the whole thing. So the first exercise is to compute branch metric for each branch. So go ahead and do that. Done, we see enough. So I am going to write down the branch metric up on top. Let me know if I make any mistakes. 2.21, no? 1.21. Am I right? 1.21, right? 1.89, 2.89, 1.7, right? It is numbers below are a little bit distracting. So 1.9 is 3.69, right? Am I right? I am sorry. Oh, okay, okay. So that is going to be 0.81, yeah, right? This one will be 3.69, 6.1, no? Okay. So this would be 1.6 square which is 2.56, and then 0.04, okay? How many of you think you can eyeball the ML path without doing any Viterbi? It is two test relays with four stages. You should quickly eyeball the minimum path, right? So it is absolutely nothing in this. But anyway, we will run the Viterbi and we will do maybe a slightly more complicated example the next time, okay? All right. So how does the Viterbi work? So you start with the state metric assignment and then update the state metrics and the side-over paths stage by stage, okay? So initial state metric that you assign is 0 for the known state before state 0. After that, if you look at this guy here, okay, plus 1, right? If you look at this plus 1, I don't know if we can look at my marker, it is a little bit too tiny. If you look at the plus 1, there is only one branch coming into it, okay? So obviously that has to be the side-over. There is no real choice, okay? In your minimum, there is no problem. And the branch metric would be 1.21 and that would be the survivor. So I will take, I will put a red ink on the survivor, okay? Likewise here, the state metric would be 0.09 and the survivor would be just that one path, there is no choice, okay? Now you start getting choices, okay? But the minimization is easy enough because you have only two paths coming into it, right? If you look at this plus 1, okay? I will put a question mark here. So this is the one I am looking at right now. There are two possible ways in which they could have come in. If I take the top route, right? The path metric becomes 1.3. If you take the bottom route, thing becomes what? No, no, no, no. 1.3 again, okay? So the bottom one is 1.3 again, okay? So I have to make a choice. What choice shall we make? Okay? So it turns out in those kind of situations, you can choose anything. You can't go wrong, okay? Right? The ML path is anyone. So we will pick the top one, okay? So top is always better. So we will pick the top one, survivor, okay? So down below, if you come here, what happens, right? Yeah, 0.18 and the bottom path, okay? So that is clearly the survivor, right? The other one is just too much. It goes to some 3.1 or some 4.1, okay? So you don't have to worry about it, right? So notice several things, okay? So at the end of the first stage, right here, okay? You have only two possible paths, okay? Total number of paths up to that point is only two. And you kept track of both paths. Right here, how many paths do we have totally in the trellis up to that point? Four different paths. Do you see that? Right? Two different inputs, four different paths, okay? That's how you compute it. You don't have to go through the trellis and compute. But how many paths are we keeping track of? Only two. So I've already eliminated two paths and that will continue stage by stage. In every stage, I'll eliminate half the paths. I'll only keep track of the remaining half which are survivors. So that's where the savings is coming. So that the way I remember the way I split all the paths as unions of several things. That I'm doing stage by stage. So I'm only keeping track of those paths that are important for me, okay? So let's go through here. Once again here, it's quite easy. This is going to be what? 1.56 and the top path. This is going to be zero point. What is it? Four three, no? Am I right? Okay? And the bottom path. 1.55, yeah? Thought I had 1.30. That is okay. So for some reason I wrote three. Okay, that's okay. It's not a big deal. But okay? So once again, I want to point out that at this point, you should have actually had eight different paths but you're only keeping track of two. Okay? So if you did not have termination, okay? What would you do here? Okay, so that's the question. If you did not have termination, you have two paths, one with metric 0.43, another with metric 1.55. If you did not have termination, what would you do? Yeah. So one decision to say is of these two paths, I'll take the one with lower metric, but that's not supposed to be ML. I mean, it's not really clear whether there's some other path that would have ended in this stage with lower than 1.55, right? So I mean, well, in this case, maybe it's too easy. But when you have more states and all that, you can't really decide between paths that are ending in those states. Okay? So because you can't compare a path that is ending in this state with the path that is ending in that state and throw one out, because you don't know everything is ending at the same path. Right? So you can't do that. Okay? So that's the problem. So you can't really decide, but there are practical algorithms where people just pick the lowest path at this point. But usually there is termination. So you can go through for the next one and you will get only one path as the ML path. Okay? So when there's termination here, once again, it's very easy to see. This is 0.47 and the bottom path. Okay? So now you backtrack and write down your SCAP as what? It's going to be minus 1, minus 1. Okay? So it's away from ZK by a metric 0.47. And every other path in the trellis would have a metric which is larger than that. That much I'm guaranteed. Right? This is the closest that I can get to ZK on the trellis. Okay? So that's what my Viterbi algorithm guaranteed. All right? So this is how we run the Viterbi and it's quite simple. In most cases, it's no real problem. But we're going to do one more example just for complicating matters and driving home some points. It's important to do that. And the next example I also wanted to do because we will use it for some analysis later on. Okay? So it's slightly more painful example but I think it's good to do that. Okay? Just to point out that the Viterbi can get really complicated once the number of states increase. Okay? So here we're going to take M of Z to be 1 by root 2. Okay? So what we'll do is we'll do this. Just to make the metrics easier, I'll get rid of all these root 2s. I'll just simply take an M of Z. Okay? But it may not be monic. It may not be normalized to 1. It may not be minimum phase. Nothing like that. Okay? I'm not guaranteeing this. For example, I'm taking this. Okay? So we'll take 1 minus Z inverse plus Z comma minus 2. Okay? Well, it is monic but I don't know. Maybe some of you can do a quick computation and tell me if it's minimum phase or not. Okay? I'll take BPSK. By the way, how do you find if this is minimum phase or not? Find the zeros and the poles. Okay? All of them are inside the unit circle. Then it is. Okay? What do you think? Do you think this will have poles? Okay? There are no poles, right? It's no question of poles. What about zeros? Where will the zeros be? It'll have two zeros on the unit circle, right? So it is. This, is it? Am I right? Will it have two zeros on the unit circle? No? Why will it have? Okay? Okay. Anyway, think about it. I think this is the factor of 1 minus or 1 plus Z power minus 3, right? So, so you can figure out where it will have. I think it has two zeros on the unit circle. That's what I think because, anyway, check it out. Doesn't matter. Okay? So, let's do, so, so, so now the number of states is what? Four. Okay? We did the trillis before. The number of states is four. So, I'm going to, since the number of states is four, I'm going to take a very, very simple example to make sure my life is very simple. So, I'm going to just take maybe two or three symbols once again, depending on how much space we have on the board. Okay? So, that's going to be the limitation. Okay? So, the known state at the beginning will take as 1, 1. Okay? And then it will transition into two different possibilities, 1, 1 or minus 1, 1. It's a first trillis. Then it will transition into again, 1, 1, 1 minus 1, 1 minus 1, 1 minus 1, minus 1. Okay? And then finally, the stage will become complete. Okay? All right? So, if you notice, there's a subtle thing I did. What is the subtle thing I did in the ordering of the states? Okay? Yeah. So, the first possibility here, the state, what did I do for that state? I chose it as the third state. Okay? So, you might say, there's some, just makes my diagram maybe look a little bit prettier. Okay? So, those are things you might want to pay attention to. It's okay. You don't have to do it. Right? Even if you do it, the other way, it will work. It will give you a valid trillis, but it might become a little bit more ugly. All right? So, okay. So, I think I'm going to terminate right after this. Okay? So, it's going to be plus 1, plus 1, then plus 1 again. Okay? So, the trillis is fine. Okay? So, we'll write down the outputs below the branch in the complete stage. Okay? And that should give you, okay? What are the outputs? Top here, 1 minus 1. Is that fine? Minus 1. This one is what? Minus 3. Okay? 3 and 1, 1 and minus 1. Okay? Those are the outputs. Check and make sure I've not made any mistakes. Is it okay? It's no, maybe? Yeah, 1, no? No, it's 1. Is it okay? I'm not getting enough heads to nod. Let me see. I'm sorry, 3. 3 is wrong. No, those are the outputs corresponding to each branch. At that time, writing below the branch. It's not metric or anything. Okay? Why am I writing it in this stage and not here? Yeah, so it's all the same. Also, this stage has all the branches, right? This stage doesn't have some branch and then as I go along, I'll have to do it. So, take one complete stage and then write down all the outputs below the branch. Okay? So, then whenever you have to compute the branch metric, you can quickly look at that output and then use that for computing. It's very easy to do that. So, okay? So, now I have to give you the Z case. Z case, I'm going to write on top. Okay? Next to the stage. Okay? So, these are things you can use. It's not too bad. Okay? So, I'm going to say 0.8. Okay? Minus 1.1. Okay? 2.6. Okay? Minus 0.9. And then 0.5. Okay? So, those are my Z case. All right? So, the next job is what? Once you have the Z case, write the branch metrics. Okay? Go ahead and do that. So, let me move my Z case a little bit further away so that, so you see already it's becoming painful if you have to compute all the branch metrics without doing the sub-weaver part. So, it's probably best to just compute the branch metrics as you go along instead of computing it ahead of time. Okay? So, if you do that, here it's going to be 0.04. Am I right? And down below it's going to be 1.8 square is what? Sorry? 3.24. Is that fine? Okay. So, likewise, keep going along. 2.1 I believe is 4.41. Okay? Here would be 0.01. Okay? 4.1 squared would be what? So, as we say it's roughly 16. Okay? 17.61. Okay, good. I don't know. It's okay. 17.61 is good enough. 16.81. Okay? So, there you go. That's the right answer for 4.1 squared. Okay? And then 2.1 again would be 4.41. Okay? Alright? So, let's do something now. Okay? Just to simplify matters. Okay? What's the branch metric? Mod Z k minus B k squared. Oh, that will split into mod Z k squared plus mod B k squared minus 2 times B k Z k. Okay? So, we can write that as what? So, mod Z k squared we can definitely ignore. Right? So, we can write that as mod B k squared minus 2 times Z k B k. Okay? So, if you want to further split this, it's going to be B k times B k minus 2 Z k. Okay? So, this is a computation which is probably slightly simpler than the other computation. Okay? So, can I do it just arbitrarily starting at this stage? Can I use this different formula only for this stage? Yes? Yes or no? Yes, I can. Right? So, I can do whatever I want because as long as I am consistent in each stage, I can subtract any quantity that is constant because the way I compare my path matrix, I am doing it stage by stage and everything will pay the same penalty. So, I am okay. All right? So, that's important. Okay? So, let's see. Maybe this calculation is easier. It's tougher. Okay? So, I don't know. Yeah. So, maybe the squaring is easier. Okay? So, 1.6 square is 2.56. 3.6 square is what? 12. Okay? Good. So, there you go. We'll go through and do a lot of computation. Okay? Once again, 3.6. Okay? 5.6 square. Okay? Sorry? Oh, you have a calculator. Okay? So, 30. 3.6. Good. So, this is 0.4 which is 0.16. Okay? So, this is 2.56. So, one thing I want you to notice is what? What is one thing you can notice here? Yeah, a lot of calculations are being repeated. The reason is there are only four different outputs possible for eight different branches, right? What are the four outputs? Plus or minus one, plus or minus three. In fact, plus or minus three occurs only for two. So, one and minus one occurs for a lot of these things. So, it's enough if you compute four of these squares and quickly write down the remaining. Yes. It's not a big problem. So, let's go through here. 1.9 is 3.61. Am I right? And then 0.01. Okay? Then what? 3.9. There you go. That's another interesting square to compute. Sorry? 15.21. 15.21. There you go. Then you have 1.9 again which is 3.61. Right? So, finally, we have an easy calculation which is 0.25 and 2.25. Okay? So, who's going to eyeball the ML path? So, it's a dangerous game to play, but you can do it in this case also. Because when I gave you the Z case, I looked at the outputs and biased it towards, made it very close towards one path which I wanted to take. So, that's why it's becoming very easy. If I had picked my ZK randomly, it would have been much more difficult to find the ML path. You'll have to actually do the Witter B. Okay? So, let's do Witter B. If you do the Witter B, you're going to start with the state metric 0 on the leftmost side. Okay? The state metric here is going to be 0.04. Here it's going to be 3.24. Okay? So, the survivors are going to be full here. Okay? So, the next state also, you have only one path going into each state, right? Right? So, notice that. So, this is going to be 4.45. This is going to be some huge number. Okay? So, I think it's 19, no, 20.05. Okay? So, this one is 0.05. This one is 6.6. So, 7.65. Is that fine? And if you write down the survivor path, this is what's going to be. So, you have four survivor paths and that is something which in general will be true. What is the general statement we can make now? If you have psi mu state Witter B, implies what? Right? At stage mu, after stage mu, you will have exactly psi mu paths, survivor paths. Okay? So, psi mu, stage mu is complete. Okay? Let me not say it's complete. It's a weird statement. Stage mu results in psi mu paths, survivors. Okay? After that, what will happen? There will be only size, size x power mu, psi-waver paths after that. After that, it will not increase. Okay? So, usually you will expect that to double after that, but it doesn't double after that. It becomes a constant. Okay? Let's go through here. Here, it's going to be 4.45 plus 2.56, which is 7.01. Okay? Here, you would get 0.21. Here, you get 17.41. Here, you get 2.61. Okay? And what are the paths? Okay? Here, you have this guy. Here, you have this guy. And here, you have what? I'm sorry, 37, no? 17.37, is it? Okay. It's okay. I'm just... Is it okay? So, make sure... How can it be 17.37, man? That's the end in a 1, no? Maybe 3-1. 17.41, no? For once, I'm doing it correctly, huh? Yeah, I know. There are 2 million numbers. Okay. So, I want to make a few observations about what's happening to the survivor paths at this time. Okay? So, write down the 4 survivor paths as a sequence of states. Okay? Can you do that? So, number the states is 0, 1, 2, 3. Okay? 1, 2, 3, 4. Don't do anything else. If you write down the survivor paths... survivor paths... Okay? So, what's happening? You'll observe something that's slightly interesting. What has happened to the 4 survivor paths? What are the 4 survivor paths? 1, 1, 1, 1. Okay? So, the first survivor path is 1, 1, 1, 1. What is the second survivor path? 1, 1, 3, 2. What is the next survivor path? I'm sorry? 1, 1, 1, 3. What is the last survivor path? 1, 1, 3, 4. Okay? So, those are the 4 survivor paths after stage 3. Well, stage 2. 0, 1, 2. Right? So, the first thing you'll notice about survivor paths ending at... after any stage is what? This entry, the last entry is very easy to predict. What will the last entry be? 1, 2, 3, 4. Right? In the same sequence, it will come. Okay? There's no... There's nothing there in that thing. The last state for survivor path has to be that state itself, whichever state you're in. Okay? So, there's no problem. Okay? So, what's interesting about the previous things? What has happened? Do you notice anything interesting? I'm sorry? Yeah. So, the survivor paths have merged in the first stage. Okay? So, what does it mean? So, I know in my ML path is going to be one of these 4. Right? Right? Finally, the ML path will be one of these 4. So, what can I say even at this point, even before I go through and complete the whole thing? I can make my ML decision for the zeroth stage. What will be my ML decision for the zeroth stage? Plus 1. My escape for the zeroth stage is going to be plus 1. I know for sure why. Because all my survivors have merged at that stage and that corresponds to a plus 1 transition. Okay? So, that is something that is interesting which happens in a Witter B, which helps us in terms of complexity. Do you see why? Why would this help us in terms of complexity? Exactly. So, what's happening is when you actually run the Witter B for say L equals 1000 or something for 1000 symbols, you will have to store these paths for 1000 stages. Okay? So, what's expected in Witter B is once you progress a little further, your survivor paths would have merged a little further behind, which means from there you can actually make a decision and finish it off. You do not have to wait till you fully complete. So, in terms of complexity, in terms of memory and also in terms of what? In terms of the latency that you encounter before you can make decisions, this merging of the survivor path is an important event that happens. Okay? So, typically what happens is people have some ballpark number like 4 times mu. Okay? If you progressed for say small k stages, k minus 4 mu at that point the survivor paths would have merged is one theory. Okay? So, based on simulations, people have that understanding. Okay? So, if you do not have that thing, if you have to keep track of all these survivor paths and figure out where they are merging. Okay? So, that's an interesting thing to do. Think about how you would program it. Okay? If you have to store all these survivor paths, what data structure will you use for their storage so that you know when they have merged? Right? Can you do that? Anyone here who has done programming with these kind of things before? So, you think about it. So, is it possible to store these things efficiently in some structured way so that when they have merged a certain distance behind, you will automatically know it's easy to find. Okay? It's difficult. It's not that easy, but maybe it's doable. Okay? So, think about it. Okay? So, that's some possibility there. All right? So, this merging is quite crucial in terms of reducing complexity and all that. Okay? So, let's proceed to the next stage. It's quite easy to do from now on. Okay? So, you do this. From now on, it's automatic. Right? There's no decision because if I sent only three data, if I send more data, there'll be decisions. From now on, there is no decision. Do you see that? Okay? Just because there's no decision, you can't say I'll decide on the several path here. Why? Because the metrics are adding up. You have to compare the metric till the last point. Am I right? Am I right or am I wrong? No, you still have to make decisions. Okay? So, look at this state. There are two possible paths. You'll have to decide on the one that's coming below and then you get point 22. Okay? So, it's much easier but still one needs to do some work. Okay? So, what is this? 6.22 in the survivor path. That's the one that came from below. Okay? The next one is much easier again. It's 0.47. Okay? So, miracle of miracles. We have the same minimum metric as the previous example. Okay? Did we get that? Did we get 0.47 for the previous one or? Okay? So, this is called the freak of nature. Okay? So, once you do that, you can decide S cap. What is S cap going to be? Plus 1. Minus 1. Plus 1. That's it. Okay? The remaining two I know for sure are plus 1s. Alright? Okay? So, that's a slightly more complicated example. If I had one more stage with data, you would have had to do real more complicated operations for one more stage and that becomes the problem. Alright? So, in practice when you're running, if at all you want to run beta B, so for a long stretch of data, there are a lot of issues you have to worry about. Okay? So, let me try to point out a few issues. First issue is some implementation issues which you might have to worry about. Okay? I pointed these out even the last time around but I want to just go through that. First thing is storage. Okay? What all do you need storage for? What all need storing? What's the crucial thing that needs storing? Okay? The survivor paths have to be stored. Okay? So, that will pretty much be the overwhelming storage requirement. Okay? What else needs to be stored? See, the branch metric may not be stored, right? When you come to a particular stage, you compute the branch metrics, right? And then you use the use the same memory. Okay? Even the state metrics need not be stored. You only have to store them for two of them. Okay? So, the survivor path memory will pretty much dominate your requirement. Okay? So, what people do to... So, if your length increases, if you have to decode 1000 symbols, then your survivor path might become too large. Okay? So, what people do to combat that is use some notion of what's called decoding depth. Roughly, this is chosen to be, say, some 6 times mu. Okay? So, that's just a ballpark number where 5 times mu might be good. You'll have to do simulations to check these things. But maybe 6 times mu is a good number to pick. Okay? So, what does that mean when I say 6 times mu? Okay? So, I start at stage 0. I proceed up to some stage K. Okay? I store my survivor paths. I look 6 mu behind. Okay? So, this is K minus 6 mu. Okay? I'll kind of decide at this time that survivor paths have merged at this point. Okay? Okay? Seems like a reasonable decision to make. If you have some data structure which is turning on and saying, hey, the survivor paths have merged here, then you can make a decision without any problems. But usually, it's difficult, at least in VLSA and all that and hardware to build such data structures. So, people don't do that. You just pick a 6 mu and say, at this point, the survivor paths have merged. So, how do I decide? How do I decide on those things? You take any one of those paths that are surviving here, go 6 mu back and output that. That's it. And then what can I do? I can throw away this memory and start storing only from this. Okay? So, you see in DSPs and digital signal processors which say they can that can implement Viterbi, they'll have the circular buffers. Okay? So, your old buffer will have length only K. And after that, you'll start rewriting from the beginning. So, you'll keep writing in a circular buffer and you'll have a flag which shows what the 0th position is and you'll implement it. Okay? So, this is how decoding depth is done. So, you go up to K and then K minus 6 mu we design. Okay? So, it's slightly suboptimal, but you can do simulations and other arguments to show that it has to work. And if you know that the survivor paths have merged, there's nothing suboptimal about it. It's exactly optimal. Okay? So, that's one thing to minimize your stories. The other problem we will have is in overflow for state metrics. Right? As your L becomes larger and larger or even your K becomes larger and larger in what you're deciding. Right? You'll have an overflow problem. As in what do I mean? The state metric keeps on accumulating. You saw before some of the values can become very large. Okay? So, usually you should imagine these state metrics are stored in fixed point format. Okay? So, you can't have a huge dynamic range. Everything is possible, not possible. So, what people do is usually they subtract a constant and keep making sure that the state metric lies within some range so that they have good presentation. Okay? So, you basically subtract a constant at each stage. Okay? So, the third problem is one of latency. Okay? So, the decoding depth actually also takes care of this latency issue. Right? If you did not have a decoding depth. Okay? So, you would have to go through the entire sequence before outputting the first one and that might be too much latency for you to tolerate in the communication system. You might expect the results to come out much faster. Okay? So, for that decoding depth to an extent, solves the problem. Solves the problem to an extent. But even otherwise, naturally, the bitter B seems to be a very sequential algorithm which cannot be run in parallel. What do I mean by parallel? Suppose I receive a sequence of L outputs. I can't start decoding the 0th and the 10th and the 11th or 12th at the same time. Right? I have to start at 0 and only when I've decoded everything I can proceed. Okay? So, that also is a problem. Parallelism is a problem and there are solutions for parallelism as well. So, this is an interesting solution. Again, uses the properties of the bitter B algorithm. Suppose you have a very long sequence that has been received. What people do is split it up into different windows and you let the windows overlap. Okay? So, here you have the first window. Right? This will be the first window. Okay? The second window will overlap by say some 4 mu or some such ballpark number. Okay? With the first window. This is the second window and so on. Okay? The successive windows will overlap by 4 mu or 6 mu or whatever number you pick. So, now what will happen is you'll start here as well as here in parallel. Okay? So, here you assume you know what the initial state was. So, you know how to put the 0th state metric. Here what will you do to start off? You don't know anything, right? So, you don't know the metrics there. So, what you'll do is you'll put 0 for everything. Okay? You'll put equal state metric, 0 for everything and start. By the time you have run through to 4 mu or 6 mu stages, what would have happened? There will be significant difference between the state metrics and somehow the memory would have taken care of it and you would have obtained some advantage from the bitter B. Okay? So, even though you made a suboptimal choice of all 0 state metrics at this point, you should not know, but you wanted to start ahead of time because you wanted to run both in parallel, right? So, so that you can decode very fast. So, but by the time you run through 4 mu stages in the second window, there would have been enough metric that would have picked up and the erroneous parts would have been had larger metrics and the valid part probably would have had shorter metric and there would be enough differentiation and the state metrics here might be accurate. Okay? So, the state metrics here might be okay. Okay? By the time you start there. Okay?  You don't go all the way back to the 4 mu. Okay? Do you see that? Okay? So, is this clear or? It's definitely not clear. Okay? So, so when I make decisions, when I trace back, how do I trace back? I don't trace back all the way to the beginning of my window. I stop here. Okay? So, the second window, right? Okay? So, let me say this is 0. This is maybe L1. Okay? So, this is L1 minus 4 mu. This is L2. Okay? So, the first window works on stages 0 to L1 plus 4 mu. Okay? So, it's actually work L1 plus. Okay? Let me say 8 mu here. Be very careful. So, maybe, maybe 4 mu. Okay? So, that's fine. Okay? So, it works from stages 0 to L1 plus 4 mu. Second window would work from? No, wait. I'll come back to it. I'll come back to it. Stages L1 minus 4 mu to what? L2 plus 4 mu. Okay? So, why am I doing this 4 mu, 6 mu? Okay? I want some enough decoding depth to decide for stage L1. Okay? So, this is what the Witter B will run. So, this is for just the running. Okay? So, if you look at decisions, this is just the Witter B. If you look at decisions, right? Okay? The decisions for the first window will be from what to what? 0 to L1 minus. No, no, no. 0 to L1. Okay? The second window will be L1 plus 1 to L2. Do you see that? Okay? So, remember every time if I want to make a decision on stage K, I should have run my Witter B forward till K plus 4 mu or 6 mu or some such thing. And only then can I make a decision on stage K. Okay? So, I want my first window to run so that I can make decisions from 0 to L1, which means the first window actually should run forward for L1 plus 4 mu, then I can use my decoding depth and make a decision. Okay? But for my second window to start, even my initial metric is bad. Okay? So, when I run actually for the decoding depth, only my last metric will be bad. So, I am running through because I have not terminated, right? So, I am running through further and coming back. But for my second window, even the starting point is bad. So, I cannot start where I want to decide. I have to start 4 mu or 6 mu before run through. I know there will be some overlap. It seems like wasteful decisions, but you have to work with that if you want more parallelism in your Witter B. Okay? So, this is called the windowed Witter B. Okay? And today's wireless systems, for instance, try to use windowed Witter Bs because you want faster data rates, right?  Everything has to go fast. So, you implement windowed versions of these algorithms and practice today. Okay? So, it is considered much better. Okay? So, I will stop here for now. I think this is pretty much all I wanted to say in terms of Witter B. And next class, we will pick up on some simple analysis and we will proceed further with you.


Item Number SCP-845 Object Class Euclid Special Containment Procedures Specimens of SCP-845 are to be contained in a hermetically sealed chamber, at least four by six by three meters in size, with no more than seven individual specimens kept in a single chamber at any given time. The bottom of each chamber should be covered to 15 centimeters with clay-rich soil, save for a reservoir of fresh water, as well as a dispersal of sticks and logs. The chamber should be brightly lit during daylight hours and dimly lit at night. The reservoir should be continually stocked with small fish for feeding, as SCP-845 will not recognize non-living fish as food. Wild specimens of SCP-845 are to be captured and transferred to a suitable containment facility. Waterways believed or confirmed to be inhabited by SCP-845 should be sealed off from the public, and carefully monitored for activity until such time it is believed that all specimens have been captured. Description SCP-845 is a species closely related to both the European polecat, Mustylaputorius, and domesticated ferret, Mustylaputorius furrow. Specimens of SCP-845 appear similar to a common hybrid between these subspecies, with dark fur, a pointed muzzle, and an elongated body. SCP-845 demonstrates greater prevalence of social behavior and diminished territorial instinct compared to European polecats. SCP-845's anomalous abilities manifest when a specimen is startled, hunting, or rarely when participating in play behavior. During such times, specimens are capable of fully converting their bodies into a liquid. In this state, the specimen is a light brown liquid, with a density slightly less than that of water. It will most often flow freely, but will change viscosity rapidly if it is in danger of being separated into multiple masses, which has been shown to invariably kill the specimen, and will revert to its solid form if it is in extreme danger of this occurring. Its liquid state shows limited motility on land, but is extremely mobile underwater, capable of forming itself into complex hydrodynamic structures, including fins and water jets for use in hunting fish. Analysis of its liquid state is ongoing, but has revealed the presence of fiber-like structures connecting nodules of data expunged. Specimens of SCP-845 seem to seek out small, contained spots for resting, including in their liquid state. Because of this, specimens are known to sometimes enter humans' canteens while on camping trips. If a human or other animal attempts to consume part of a specimen, the specimen will either attempt to retract itself from the subject's mouth, or may force the subject to consume it in its entirety. Both seem to be instinctual reactions, attempting to remain in a single piece. Upon being deposited into the subject's stomach, the specimen will enter an apparent state of confusion, switching rapidly between solid and liquid states. Shortly afterwards, the specimen will re-solidify and initiate burrowing behavior in an attempt to escape. The subject will experience severe internal bleeding and acute peritonitis, as the specimen tears through the walls of the stomach, muscle, and tissues of the abdominal cavity. Upon successfully breaching the surface of the subject's skin, the specimen will enter a liquid state and exit through the wound before re-solidifying and attempting to return to its original habitat. Lesson complete. If you missed the previous orientation, go watch SCP-844. Cry, baby, right now. Or for the complete course, watch this playlist.


Hello and welcome to the lecture on Introduction to Graphs. In this lecture we will be discussing about graph data structure, its terminology. The learning outcome of this video lecture is that the student is able to explain graph data structure, need of graph, graph terminology and types of graphs. What is graph? Graph is a non-linear data structure that is used to implement the mathematical concept of graph. Graph is a collection of vertices, edges that connect these vertices. Here vertices are also referred as nodes. Need of graph, graph is used to represent the data where data are related to each other in pairs. There are several problems that are naturally graph problems such as networking problems, routing problems, sorry, route planning problems and transport network. For example, the city map can be represented as graph in which the location in the city can be represented as nodes and the roots connecting these locations can be represented as edges. In this graph the city connected to each other is represented in graph G where the node is represented in the city and the edges connecting is representing the root between the city. A graph G is defined as an order set of vertices and edges where V represents set of vertices and E represents the edges that connect the vertices. For example, as shown in this figure a graph G with vertices A, V, C, D, E and edges AB, VC, AD, PD, DE, CE. So here there are five nodes and six edges present in the graph G. Graph can be directed or undirected graph. In undirected graph the edges do not have any direction associated with them. If N H is drawn between the nodes A and B then the nodes can be traversed from A to B as well as from B to A. The given graph G is an example of undirected graph. G can be represented as set of vertices that is V is equal to A, B, C, D and set of edges E is equal to AB, VC, AD, BD, DE and CE. Graph G1 is an example of directed graph. In directed graph edges form an ordered pairs. If there is an edge from P to Q then there is a path from P to Q but not from Q to P. The edge PQ is set to initiate from node P and terminate at node Q. G1 can be represented as a set of vertices where V is equal to P, Q, R, ST that is a set of vertices and set of edges equal to PQ, PS, RQ, QS, ST and TR. Adjacent vertices or nodes or neighboring nodes in graph if two vertices are set to be adjacent if an edge directly connects them. In graph G vertex A and B are adjacent vertices whereas A and E are not adjacent vertices. In graph G the path from vertex A to E is represented as A, B, C, E which is one path and another path is A, B, D, E. Next one is closed path. Path is known as closed path if the H has the same end points that is if starting vertex is equal to the last vertex. In graph G path A, B, A, B, C, E, D, A is a closed path. Cycle. A path in which the first and last vertices are same. A cycle is a path of at least three vertices that starts and ends with the same vertex. A simple cycle has no repeated edges or vertices except first and last vertices. A cycle is a closed path that is we start and end at the same vertex in the middle we do not travel to any other any vertex twice. Loop. A loop is a special case of cycle in which a single arc begins and ends with the same node as shown here an edge that has an identical end points is called an a loop. Here the edge starts with the node A and ends with the node A. Degree of node. Degree of node is the total number of edges containing that particular node. In graph G degree of node is a 2 and degree of node B is 3. If degree of node A is equal to 0 it means that A does not belongs to any edge and such node is known as isolated node as shown in graph G1. Here is the time to reflect on the content what we have learned. State the following statement is true or false. A cycle is a path of at least three vertices that starts and ends with the same vertex. You can pause the video for a time and think on the answer for this question. The statement given is true yes a cycle is a path of at least three vertices that starts and ends with the same vertex. Connected graph. Two vertices are said to be connected if there is a path between them. A graph is said to be connected if there is a path from any vertex to any other vertex. In a connected graph there are no unreachable vertices. For example as shown in this diagram there is a path from any vertex to any other vertex. So this is the connected graph. In directed graph if there is a path from each vertex to every other vertex then it is strongly connected graph as shown in this diagram. A directed graph is a weakly connected if at least two vertices are not connected. So this is an example of weakly connected graph. So where you will find at least two vertices which are not connected. Complete graph. Complete graph has an edge between every pair of vertices that is there is a path from one node to every other node in the graph. As shown here it is an example of complete graph where the number of nodes are seven. So each node is connected to every other node in the graph. Weighted graph. A graph is said to be weighted graph if every edge in the graph is assigned some value. In weighted graph the edges of the graph are assigned some weight or length. The weight of edge is a positive value indicating the cost of traversing that edge. This diagram shows the weighted graph where value is assigned to each edge in the graph. Next is disjoint graph. A graph is disjoint graph if it is not connected. For example this graph is a disjoint graph where there is no edge between A, B, C, D vertices to F, G, H vertices. So this is an example of disjoint graph. Di-graph. A directed graph is called di-graph in which every edge has a direction assigned to it. An edge of directed graph is given as an order pair PQ for example of nodes in a graph. For example HPQ indicates that H begins at node P and terminates at node Q. Here P is the predecessor of Q and Q is the successor of node P. Nodes P and Q are adjacent to each other. The out-degree of a node is the number of edges that originates at that node. In this graph out-degree of node Q is one. The in-degree of a node is the number of edges that terminates at that node. So in this example in-degree of node Q is two. In-di-graph the degree of a node is the sum of in-degree and out-degree of that node. So in this graph degree of node Q is the sum of out-degree and in-degree of that node that is equal to three. A node is called as source node if it has a positive out-degree but its in-degree is equal to zero. So in this graph out-degree of a node P is two and in-degree is zero therefore P is a source node. A node is called as a sink if it has positive in-degree but its out-degree is zero. So in this example if we assume that there is no H from node T to R then T is an example of a sink node. Now this is time to reflect on the content what we have learned. Here graph G is given in this diagram identify this graph G is undirected or directed graph. In graph G is there a path from node A to node C? If yes then write the nodes visited in this path. Is there is a source node in this graph? If yes then specify. So you can pause the video for a time and write the answer for this question. So here is the answer for the given question. In graph G edges form are in pairs indicating direction therefore graph G is directed graph. Second question yes there is a path from node A to node C. One path is A, B, E, D, C and another path is A, E, D, C. Third question answer source node is a node which has a positive out-degree but its in-degree is equal to zero. Another node A is source node because node A is out-degree is two and in-degree is zero. Therefore there is no other node whose in-degree is zero. Thank you for watching this video.


Hello, I am Peter Thawke, one of the four curators organizing the British Library's new exhibition, Writing, Making Your Mark. This tablet is an exceptional survival because it preserves us a Holmberg book from about 2000 years ago in ancient Greek. What happens here is that the teacher puts two lines in very neat handwriting as a sample on the top of the tablet which says you should not accept advice from someone wise and the other line says you shouldn't believe all your friends. And this is the sample the child, the pupil, was supposed and asked to copy out at home. So the child tries their luck and tries to write the first line but drops the first letter immediately. This thing which reminds us our sea is missing from the beginning of the line. And then the child is trying the best to put the letters between the lines. Sometimes the pupil doesn't manage because some letters are hanging down from the line and the major mistake is committed at the end when the child runs over the margin and scratches the precious wooden frame of the tablet. The second line looks more or less alright although some letters are still hanging down the lines and they are a bit shaky, they cannot be compared to the nice and neat handwriting of the teacher. So the child thinks they should do it again. So the second go, there is the same mistake here. The letter, the first letter C is missing again. The rest seems to be okay although the letters are shaped a bit odd way. But the second line somehow manages to be too tight, too narrow. But the child is still trying their best so the letters are squeezed between those very narrow lines sometimes almost like an illegible way. And when the child gets to the end of the line the letters are clearly hanging. But it still shows that methods of teaching how to write stayed the same. Materials changed a lot. Nowadays in schools they use digital blackboards, whiteboards. But the very essence of how we teach children to write stayed the same. My children in school, they are still copying texts and samples. Exactly what happened about 2000 years ago in Egypt.


Good morning, my name is Charles Jones and it's for presently the launching track in your tentative about promoting your office and your language. Welcome, everyone, thank you for being here. So very quickly I thought about doing an introduction, many of you know me already, my name is Charles Jones and I know the things these days. Mostly working on promoting your office on social media but also contributing to the general marketing. So this session has one specific topic which is the motion of your office in native languages and I've been so to speak working on promoting your office and earlier openoffice.org in precisely worldwide native language communities. And today I would like perhaps to help and share my experiences about precisely this aspect of promoting and marketing a new office and engaging people in a new office project when you do not or you do not speak English or when your English is not good enough. So let's start right away. We're first going to discuss a little bit, you know, what is striking when you are not speaking English or English is that you want to tell me first which is that language is not an abstract reality. In fact language is most of the time a geographical, cultural, maybe even economical context. And while I would say that it is always the case, basically there is a set of realities that frame where your language and how your language lives, flows, kinds maybe. And this in turn makes for different realities based on language and the area you are in. So here I've got a very, very summary, perhaps some schematic set of examples of types of language matching two days of reality. And of course I'm not suggesting that all of these actions or all of these approaches are the most absolutely adopt but basically these are maybe approaches that have been seen sometimes to be more of a priority in comparison to others. So the important thing while you're considering the promotion of new office in languages other than English is that you need to tailor an instinctive, vital approach. So as I said examples, for instance, we're going to have intake languages so if you're visiting India, what we can see is that what really interests or volunteers on the field is going to be education and raising the brand words is one example. If you're going to Western Europe and to a large extent Eastern Europe too, what you're going to have is forms of promotion that involve much more social beliefs and social media and marketing, for instance. Then you have Portuguese and Brazilian, which is perhaps one of the same that Portuguese in general. Well you have a reality, which is a reality of Brazil and free and open for software in Brazil. So the approach will be a bit different. There will be business supports about growing skills and of course the relations with the national and local companies. Then Asian, Chinese, Japanese and Korean. Of course these three countries and these three cultures and these three languages encompass wide cultural differences. We're not putting them in the same basket because I don't know better. It's just that they share a common reality from what I can see. Which is indeed a sophisticated form of social media, that's one thing. But at least that's my experience with China and PRC distribution. That is how you insert liberal office somehow in the distribution. How people can get liberal office. Because most of the time, for instance, in PRC you're going to have people who are very happy to use pirated software from Microsoft. And that's just about it. So if you manage to get distribution deals involving money or not, then you're striking something really big in PRC automatically. African languages, of course, you're again encompassing a wide variety of languages, cultures, spaces. Then you're going to have a different kind of approach which is going to focus mostly on education, but also distribution, you're again, distribution. It's something quite different from the distribution pattern you have in PRC, for instance. So this being said, here is, I wouldn't say a standard list, but it's basically a list of actions that is always going to happen. There's not a one-minute recipe, but there are things that may not be obvious, but it's just being useful, and that they want to consider what a promoting liberal office is in their language. So of course it starts with online presence, websites, and a few years ago they stopped there, but it's not just a website. The website at home, this is not where you can human spread the news around the world. So you can do a website with active social media accounts. Active social media accounts means active social media accounts, not let's say Twitter accounts sleeping, otherwise it's not really good news. But it also means being available and having a strong presence on social media. It may seem obvious, but it is not. I'm very happy, I must say, when I'm looking at a liberal class like this, when I look at all these liberal office groups that basically exist for a wide number of languages, and very little for that reason, that shows there is action. But there are cultures and languages and groups and sociologies that essentially do not encourage the presence of social media.  But there are people who will say, you know I'm not on Twitter, so why should I be on Twitter? Well, the point is not what you do, the point is that if you actually want to spread the word, you need channels and networks that are available to you. That also means another thing, which has, let's say, a little bit more of a trolling potential than what I said at the time so far. We will meet and show there are people here or in other groups who will tell me, or who will tell you, you know, it's very important not, or to privilege social networks that do not, let's say, have a mining on your profile and what have you done. It's very important not to give Facebook because Facebook is involved. I think Facebook is involved. Many people think that Facebook is equal. This being said, Facebook is where everybody is. So I do not care whether you feel that Facebook is equal. I do not care whether you think that that's more, that's the best thing since widespread. I think that is an excellent, beautiful idea. But Facebook is where everybody is.  Very goodness. Because there's a whole lot of people who are a group of plus too, so it's fine. But again, you need to be where you're existing and potentially users are. Then, dots. An interactive presentation of your office. I must plead guilty because I'm probably the bad example here. But essentially, if you can have anything from, you know, standard brochures, they don't have to be six pages long. It's not like that. Just small presentation brochures like one leaflet, maybe one, you know, one sheet of paper, at least something you can print for just simply share by email. It's just fine. That gives you a very simple kind of collateral that you can make more. And of course, interactive video presentation. We started to see, thanks to the 4-day team, some very nice presentation videos about their office this year. I hope they will be translated for the presentation that can be spread. Then, of course, meetings and participation. I think this one is quite obvious. We usually don't have much of a problem with explaining this one. Then, this is a bit more complicated. The one because it's more difficult and second because it's just not so obvious to understand. Growing a user base and attracting new countries. We've said this before, but marketing recipes for LibreOffice as a community tend to be kind of no go. Because if you're trying to apply traditional marketing techniques during the swap teams, you know, pricing mix of what I have here, it's not going to work. The product is both catering to such a broad range of users. And the product itself is not a product. It is a community producing software. So it's a bit complicated at first. But one of the logical consequences of that is that in fact when you are promoting LibreOffice, you're not just promoting the fact that LibreOffice is a great software, you're actually promoting the fact that there is a community and that anyone can join. And in fact, any user, anyone who made the conscious decision or made the unconscious in front to nominate LibreOffice uses at that very moment he or she is the potential candidate to join your community. And I know that it's very hard for our contributors who are localizing LibreOffice to even have time to set up some sort of welcoming community with a user support activity on one side and maybe localize quality insurance or localize bills from the other localization team next to it, maybe a little bit of translating documentation activities. That is actually quite hard because it simply requires time and it simply requires manpower, which most of us don't know how. Then, and you've noticed that from this last one, although this is all from being an exhaustive list, of course, I've listed the traditional promotions such as ads. I think that might work. We have one good example of how it can work and one bad example. The good example is, well, what Firefox did a few years ago with their ads in the New York Times. So they had ads in the New York Times and their download really showed progress, I mean big progress. We have another one, which is that it was the ad in the site's journal for LibreOffice and one of the downloads would seem to have decreased, obviously, they could not seem to have increased by any sensible factor after this ad, which truly is very impressive, but you know, rotary orders. I don't know, at least what we saw was an interest in essentially anything that had to do with about us pages and document the foundation of one. I think the download page was lovely, which is a bit crazy. Well, the journal, the site journal. Yeah, the site journal. I know, I know. I know. It was lovely. I think the site journal is known for very intellectual political or technical stuff. I do not have to not see it. They are open. Yeah, but I have not seen the ad myself. But it was in paper. That was in paper. That was the funny thing. It was in paper edition, but inside of it. So then suddenly you said, you know what?  You had no conversion rate because of course you could not get it. So you also get it as a download program which is very depressing and useful for the ad marketing paper. Anyway, I'm going to come back to this topic of the role in your community. Because again, while it may seem very different from marketing, in fact, marketing opens or is free and open from software. It's precisely about growing your community. So the community, as we say, is made of your users and the contributors of any kind that you have. Whether they are developers, localizers, documentation writers, people providing user support, people providing, you know, working with the quality assurance of localize builds, showing up at events to help you lose these of art. This is what you need. And you need to grow that. You need to grow at least some part of it because in fact that is how you grow your market share. That is how you grow your user base. Do not think, please do not think that you are in some sort of company where there is a team on the one hand and then there is your customers aka your market. No, that's not going to work. First of all because you have the money that's facing and you are not an entity or business. Therefore do not have this money based relationship that you are going to have with customers. So you are going to have users and these users are going to be sometimes noisy and sometimes they are going to thank you and sometimes a small chunk of them might actually be interested in helping. And helping of course they can do in various capacities. Even if they are not technical, that's okay. You also need people. Yet, attending groups, ensuring that people asking questions online are being answered, helping out with documentation, producing maybe collateral, maybe you need something like a cluster or whatever you need. So only people can help. And of course you have the localizers and people who are communicating should invest more time in providing quality insurance and contributing to quality insurance. So it's very important to nurture your local community the community in your language. Now, it sounds a little bit different but it's actually pretty much the same continuation. When you have a community and the bigger your community is the more it shows inside the wider e-books in the team. In fact it's just a simple thing. I called this in-down marketing and the term had the tickets to me but basically you have in-down marketing and out-down marketing. Out-down marketing is what you should think that marketing is. But in fact marketing, and I don't have a graph there to show you, marketing starts with tradition, product definition and you should include this industrial marketing. And whether you're an industrial player or not, I can care for this in-down marketing. It starts when out of your corporate strategy you can derive product definition based not just on market research but actually based on your resources your state-of-the-art technology how you can service your customers you know, all this. And you have a phase where you have in-down marketing and this in-down marketing goes from that very moment to the moment when you have shipped your product out of the door and then everybody still that's a very important thing. That very moment the in-down marketing stops and in theory you have the up-down marketing work and it's going to be promotion, promotion, promotion. So in the office just like for the subject project in-down marketing is actually extraordinary important. There are reasons for that. Again, we're not in a framework where you can have customers and those customers pay in exchange for something whether they're in a consumer's market or a corporate market it doesn't make any difference. When you are inside of your office thinking of hope rating as contributing well, you're not handling customers by any means. But you only work with the community and this community can grow or this community can diminish but if the community grows you will find out that in fact you are growing your user base and therefore you're doing the right job and promoting your office. So it's important that not just that you grow your user base you grow your community and your contributors it's actually extremely important that you ensure that your community is integrated, really integrated inside of your office project. Is it easy? Well processes structures even when they're not really effective or detailed or not even handy all one thing they can help by being effective by proving that they're effective this is one thing but I don't think in my experience this is the difficulty the real difficulty is cultural differences and language barriers you first have to deal with the fact that every individual is unique and you're going to have shy people shy people may not want or dare to express themselves even in their language but after that if you send them you need to tell I don't know who in English because he is maybe German or she is Italian and you need to tell them about something then you will have to see people who are just very embarrassed but complicated in the language and the fact is that at the end of the day many people think that they cannot communicate in English but actually in written form they can and they will just find so please don't think you need a states diploma in English master to use in English I can assure you this is not how it works but so the most important part is really the side of human interaction yet it is the most important because this is how you show first of all it exists it shows who you are it shows what you do and then it shows you can even have opinions and your opinions just matter as much as anybody else's and you're just simply adding to the country views so you enrich the broader parts of that side so that would be my main idea for this session it is really that if you want to think about promoting the English language in your language it is good to be older but yes there are a few obvious things which we discussed small collaborations websites being in the social media ensuring that you take the right approach and you understand what you need and what is possible in your own geography cultural context that might help but aside that the earlier community is the most important thing well thank you this presentation was meant to be relatively short because we are here to share so if you have questions I'm sure you do have questions so please go ahead two questions I was just thinking for example in Canada we don't have any group or association so as far as the name of our site we were going to organize and create one does it really matter what name is there an association with the Indians well I think it's going to be very easy I think you're still going to page seven pages on our website I don't know what is the best approach where you might have something called CAA CAA.meagorale CAA.meagorale slash Canada CAA we can't name CAA we can't name CAA CAA is what CAA is the 10th one oh yeah CAA is the 10th one U.S. U.S. there is two things the language and the country. Yes. I want to clarify. So we want to avoid the... Yeah, thank you. ...we already discussed that. So Michel finds another way to expose the countries without political... Well, we can have what we call racial groups.  I mean, I know what really became the North American group, but instead it was translated into some sort of U.S. group. So... So I'm sure you can have like Canada or something. We should discuss countries in particular. Yeah. And in Italy, for very well, the Libre Italia concert. Yeah. And... Yeah. Yeah, because that recalls the Libre office that it's the... basically it's the only... it's the only real product of the Libre. So if you call the Libre Italia, there isn't an immediate association and that's working very well. So we can check if we can buy... buy some domain names and songs and... We already have the Libre Italia and it's going to be a property of the association soon. You're very organized and you're... No, of course. You should think also to... Just to... Yeah. Yeah. We had a... I think that... We have... But the way... The way structure teams can... know it all from... The way that's created is also a conversation. Yeah. So if you have an existing organization... It's running in the same way, by the way. It's the marketing guy. It's running in the same way. Sure. But... Then that becomes a question about... Is Libre Italia T... We can say that's the... Which they've read in... Digraphs, but it's not like... Maybe it's controlled by T.F. Yes, we... For instance, you know, if we start inside T.F. and then Libre Canada wants to do something then that's a conversation between them. T.F. Do we still need something? So... Yeah. It's just slightly different. Yeah. Although I think that... So we start Libre Italia through Google+. And... The... What I've done at first was to invite all the people that I knew and all the people that were commenting about open source in the other community. So I... I was... I was looking at the... I think community always on Google+. The Fedora community on Google+. And the... The general links community here on Google+. And I was just... connecting people and sending every now and then a message that Libre Italia and we want to visit it. And actually because of the peculiar situation of Italy in T.F. you have to be admitted in Google+. So it's not free. It's moderated. And it's going to be moderated forever because I don't know some people there. It's very... You know, in Italy is the only place where there is an association supporting a budget of an office and clearly hostile to Libre office.  So this is hostile. So... And I understand it's a peculiar situation. We are Italians. You should live in Italy for a couple of years to understand how we are done with our mindset works. But this is... I accept your position. But the fact that we created something that was close where people was invited to share experiences worked extremely well you think that in just over one year we have 2,400 people that asked to be an associate and are now associated with Libre Italia In five days we have 110 members of the association which is just crazy. If you think that TDF in four years, 200 members we have 110 in five days. I think it's just incredible. And I think it is because we have been able to create a lot of kind of group in the group inside the Google Class community. So, repeating or copying or cloning the Italian experience I think it makes sense. Yes. Project list and... Yeah. In two days. In two days. There is a marketing workshop later on today. Yes. And there is also... Yeah. There is also a community. Maybe you can discuss there and then post on the project list in Seattle and around and get them on this TDF help on website. And thank you everyone again. You're not going to hear at all from who's very eager to tell you about features. So, thank you everyone. Thank you everyone.


The real reason why Camilla Harris is in Africa. Africa, as we all know, is a diverse continent with a lot of opportunities and amenities to offer to the world. Many great leaders of the world always make trips to Africa, either for political, military, economic, or for bilateral trade agreements. In the past few years after the COVID-19 surge, many leaders like the Pope, President of France, and many others have visited Africa, and now is the turn of the U.S. Vice President just a few months after the U.S. Africa summit. The U.S. Vice President started a week-long trip to Africa on Sunday in order to spore up U.S. investment in the continent and counter the rising influence of Russia and China. Vice President Harris is expected to visit Ghana, Tanzania, and Zambia as she focuses on economic development, climate change, food security, and a rising youth population. This visit marks the highest profile outreach by the Biden administration as it moves to counter China's growing influence. What is the real reason for this visit? Hello there, you are watching Africa Reloaded. I am James, your host. Stay with me to find out the real reason why Camilla Harris is visiting Africa. As always, before I begin, a like on this video will be very much appreciated. China has invested heavily in Africa in recent decades, including in infrastructure and resource development, while Russian influence has also grown, including through the deployment of troops from the private military contractor Ranger Group in several countries. Africa seems to be getting more attached to China and Russia more than the United States of America. On this trip, I intend to do work that is focused on increasing investments here on the continent and facilitating economic growth and opportunity. Harris said on Sunday, shortly after touching down in Ghana, the first destination in a trip that will include visits to Tanzania and Zambia. Harris' visit brings a reflection of those by former President Barack Obama, who attracted massive crowds and the widespread personal embrace from regional leaders who tried to attach themselves to the political and historical moment rooted in the world's most powerful leader having a direct bloodline to their continent. While on her trip, Harris said she wants to promote increasing investments, the economic empowerment of women, girls and young business people, digital inclusion and food security in light of mounting challenges from climate change. She said she will also be discussing democracy and government as she meets with various leaders and will be observing just some of the innovation and creativity that is inspiring the world. Before you continue to watch this video, please subscribe to our channel to become part of the Africa Reloaded Community. Vice President Kamala Harris delivers a speech at the Kotoka International Airport March 26, 2023 in Akra, Ghana. We are looking forward to this trip as a further statement of the long and enduring very important relationship and friendship between the people of the United States and those who live on this continent, the Vice President said. The administration of President Joe Biden aims at strengthening ties with Africa in part to offer an alternative to rival powers amid global competition over the continent's future. The Vice President intends to visit a recording studio and meet with women entrepreneurs in Akra and also stop by a tech incubator in Dar es Salaam. In in Zambia's capital, Luzaka, Harris is expected to meet with business and philanthropic leaders to talk about expanding access to digital and financial systems. She's going to give a major speech in the capital of Ghana and also engage with a lot of young people in the country. She's focused a lot on the rising youth generation in Africa. The median age in the continent is only 19 years old and roughly half of the world's population growth is going to happen in Africa over the next several decades, which is just an enormous potential for the region. When she gets to Tanzania, she'll be meeting with the country's first woman president. And that's a place where the country's trying to solidify its democracy and try to institute some governing reforms. So we should expect her to highlight some of that as well. And then on to Zambia, where there will be more talk about entrepreneurship, food security, other issues that kind of have dominated conversations in Africa, says Chris Magyrian and Associated Press White House reporter. Harris is going to be facing sort of a delicate balancing act on this trip. A lot of U.S. outreach to Africa is rooted in this U.S.-China rivalry. China has a lot of influence in the continent through lending countries money, through building major infrastructure projects like roads and railroads. But at the same time, U.S. officials don't want African leaders to feel like they're being caught in the middle of this geopolitical chess match between the U.S. and China. They want to make African leaders feel like they're dealing with them on their own terms. And that's something that the vice president will need to balance while she's there to try to form partnerships that help the U.S. and its geopolitical goals, but also create its own relationships with African countries as well. The Associated Press White House reporter concluded. Harris' visit is closely watched as she is the first person of color and first woman to serve as vice president. Tell us what you think in the comment section. Will Camila Harris be able to seal and rebuild African relationship with the U.S.? Thanks for watching to the end. Please remember to like this video, subscribe to our channel, and turn on notification to get alerts of newly posted videos.