New Form 8-K Reference Chart: Fill & Download for Free

I highly doubt so, assuming you are referring to Korea (or Asia at least).That is because K-Pop’s criteria is vastly different from mainstream pop (aka Western pop). In the K-Pop world, nobody will be fascinated if you sang a song exactly like the original singer. If you sang “Always” as good as Yoon Mirae, then the question would be: Why would they need you? Why not get Yoon Mirae, herself, instead?A good example would be Han Hee Jun who achieved the 9th place in American Idol Season 11[1]. When he attempted to audition for K-Pop Star Season 3, his initial attempts were met with criticisms because the criteria for K-Pop is different from that of Western Pop. To the judges (CEOs of JYP, YG, Antenna Music), he was just using good vocal technique and singing the song well. That’s it. There was a lack of emotions, and he failed to convey his intentions through the song to the audience.(Disclaimer: After he changed his style, he managed to climb up to Top 6 in K-Pop Star.)Coming from someone who teaches voice for leisure (aka part-time vocal coach), I have come to realise that the US focuses a lot on techniques, whereas Korea focuses on delivery. This means that someone who belts high notes is going to be wildly accepted in the US; while, on the other hand, someone who can deliver the emotions and connect with the audience will instead be preferred (even if at the expense of vocal techniques) in Korea.A popular example I often use is Lee Jinah[2]from K-Pop Star Season 4. Her vocal technique is objectively ‘crap’ and she probably wouldn’t even survive preliminary auditions in the US, let alone be shown on TV (maybe on US TV just for some humour?). However, she managed to wow the K-Pop judges and climbed to the 3rd position in the competition. Her songs are fun (she writes her own songs) and they just make you either soak in the emotions, or sing along with them.Check out this song “Yum, yum, yum” and the reactions of the people there who have just heard it for the first time (not scripted, of course):So what has this got to do with whether K-Pop dies down or not?From what I shared, you can see that K-Pop is constantly trying to push boundaries and innovate (because they don’t really want someone who sounds the same as a previous singer, but something new instead). And this innovation will continue to propel the K-Pop industry forward to achieve new heights.Look at the recently formed SSAK3 which consists of Rain, Lee Hyori and Yoo Jaesuk[3], 2 of which are past K-Pop industry big shots over a decade ago, while the last is the nation’s top MC / comedian. They managed to revitalise the ‘oldies’ trend (and also rebrand themselves) by doing a remake of ‘Play That Summer’[4]while producing a new song ‘Beach Again’. Their concept is to merge the ‘good o’ days’ with what is modern and popular in the mainstream right now (which can be seen in their ‘Beach Again’ song). This actually runs in contrary to the current K-Pop trend which is about Hip Hop, Candy Pop, or ‘Cool’-ness if you think about it.We are not just talking about pure hype, because their song is actually sweeping the music charts and winning established K-Pop artists like BLACKPINK, Hwa Sa (of MAMAMOO) or ZICO[5] and clinching 1st place in M! Countdown (surpassing Jeon Somi)[6]:Let’s not forget that Yoo Jaesuk brought new attention to the Trot genre with his alter-ego - Yoo San Seul[7], just before prompting with SSAK3.The day that they stop growing in their music development will be the day when the decline will start. But until then, it’s still heading upwards and doesn’t seem to be stopping.The only place where it may die down would probably be the West, like how Nobody (Wonder Girls)[8]and Gangnam Style (Psy)[9]eventually died out.Footnotes[1] Han Hee-jun - Wikipedia[2] Lee Jin-ah - Wikipedia[3] SSAK3 - Wikipedia[4] https://www.youtube.com/watch?v=jFRWlCYDWBs[5] SSAK3 Suffers Unexpected Hate From Netizens For "Unfairly" Sweeping The Music Charts[6] SSAK3 win #1 + Performances from July 30th 'M! Countdown'![7] Yoo Jae Suk says promoting as Yoo San Seul was a lonely experience[8] Nobody (Wonder Girls song) - Wikipedia[9] Gangnam Style - Wikipedia

Having read some articles about tries(aka prefix trees aka radix trees), I decided to write one of my own.Today we are going to talk about a trie implementation in C++. We willalso compare a string search with AVL and Radix tree.IntroAtrie is an ordered tree data structure that is used to store a dynamicset or associative array where the keys are usually strings. We aregoing to take a look at the implementation of prefix trees forstoring ASCII strings. Each string ends with a terminal symbol that willnever repeat in a string again. To indicate terminal symbols inpictures and examples, we will use the dollar sign. To indicate them inthe code, we’re going to use the null symbol. Thus, in ourimplementation the strings will be standard C ones, which allows to usethe standard string.h library. All the mentioned above should be easilycarried over to other alphabets.In a regular radix tree each edge is assigned with some symbol.As for root nodes, they store some service(user) information. Thus, anyroute from a tree root to one of its leaves defines precisely only onestring. This string is considered to be stored in the specified tree.For instance, a trie stores the following set of strings: {abab$, aba$,bc$, b$, bac$, baca$} (see the picture below). The root is on the left,leaves (their number coincides with the number of strings) are on theright. The root of baca$ string is highlighted in red.A cautious reader will notice that this way a trie represents a regular deterministic finite-state machine, the states of which corresponds to leaves of a trie. Trie implementation in libdatrie library is based exactly on this concept. The automaton is represented with the help of arrays.Tomake an automaton smaller, represent a trie in a partially compressedform. Such form means that all “tails” of the tree (areas with nobranches) are packed in strings (see the picture A below). We can alsocompress in a similar way all the chains with no branches (picture B).In this case the tree will no longer be a finite-state automaton, orrather it will still be an automaton, but for an alphabet of strings,not symbols. Working with a tree like with an automaton relies on thefact that the alphabet size is finite and we can define its serialnumber by any symbol in the alphabet in O(1) of time (the same will notwork for strings). Thus, its implementation with the help of arraysbecomes problematic. But when implementing with the help of pointers,there should be no problems with strings storage.Representing a Trie Using PointersLet’ssee how we can use pointers to represent trie edges. First of all, weshould realize that in this case, it will be really uncomfortable tostore information in trie edges. Therefore, we should relocate symbolchains from edges to root nodes. Use an obvious feature of orientedtrees: just one edge enters any node, except for the root one.We are going to get the following structure:There’sanother problem, as an outdegree of a tree node can be random (even ofthe current alphabet size). To solve this problem, let’s apply astandard method: store a list of children nodes in each node. The listwill be singly linked, so we will store only a head (older sister) in anode. This will allow us to reject an empty root. Now, a trie will berepresented with a pointer to the list head of children nodes of the oldroot (i.e. we replace a tree with a forest). Thus, each node will storeprecisely two pointers: link – to the oldest node, next –to its younger sister. The following picture shows the process of such transformation; blue arrows correspond to link pointers, red arrows – to next pointers.Inorder to understand the principle of working with a tree, you shouldkeep in mind the scheme that is presented in the picture on the left.Meanwhile, the actual representation of a tree will be like in thepicture on the right.So, we have moved on from the tree with a variable outdegree (a regular tree) to the binary tree, in which link and next are pointers to the right and left subtrees, like in the picture below:Now we can get down to implementation. A tree node is a chain of key symbols, its len length and link and nextpointers. The chain is not required to end with a terminal symbol, sowe should know its length. There’s also a minimal constructor thatcreates a trivial tree consisting of one node with a given key (to copysymbols, use a standard strncpy function) and an even more minimaldestructor.struct node // a structure to represent tree nodes { char* key; int len; node* link; node* next; node(char* x, int n) : len(n), link(0), next(0) { key = new char[n]; strncpy(key,x,n); } ~node() { delete[] key; }}; Searching for KeysThe first operation we will take a look at is inserting a new string in a prefix tree. The search idea is standard. We will move from the tree root. If the root is empty, the search is unsuccessful. If otherwise, we will compare the key in the node with a current x string. Use the following function that will calculate the length of the biggest common prefix of two strings of the given length.int prefix(char* x, int n, char* key, int m) // length of the biggest common prefix of x and key strings { for( int k=0; k<n; k++ ) if( k==m || x[k]!=key[k] ) return k; return n;} When searching, we are interested in the following cases:A common prefix can be empty. In this case we will continue to search recursively at the child node of the given one. i.e. we will pass by next reference;If a common prefix is equal to the sought x string, the search is successful, we’ve found the node. That’s when we use the fact that we can find the end of a string, which has a terminal symbol, in the tree leaf only.A common prefix is congruent with the key, but is not congruent with x. In this case we will recursively go to the parent child node by using a link reference and passing it x string without the found prefix.If we have found the common prefix, but it is not congruent with the key, the search is unsuccessful as well.node* find(node* t, char* x, int n=0) // x key search in t tree { if( !n ) n = strlen(x)+1; if( !t ) return 0; int k = prefix(x,n,t->key,t->len); if( k==0 ) return find(t->next,x,n); // let’s look for the child’s node if( k==n ) return t; if( k==t->len ) return find(t->link,x+k,n-k); // let’s look for at the child’s node return 0; } By default, n length of x string is zero so that we could call the search function by specifying a tree root and a search string.... node* p = find(t,"baca"); ... The following picture shows the process of searching three strings (one of them is successful, the other ones – not so much) in the provided above tree.We should note that in case of success, the search function returns a pointer to the tree leaf, where the search was finished. This node should contain all the information connected with the sought string.Inserting KeysA new key insertion (as well as in binary search tress) is similar to key search. Of course, there are some differences. First of all, in case of an empty tree, we should create a node (a trivial tree) with the defined key and return a pointer to this node. Secondly, if the length of a common prefix of the current key and the current x string is more than zero, but less than the key length (the second case of an unsuccessful search), we should split the current node into two, leave the found prefix in the parent node and place the remaining part of the key into p child node. To perform this operation, use split function. After splitting the node, go on inserting x string in a p node without a found prefix.The node splitting code:void split(node* t, int k) // dividing t node according to k key symbol { node* p = new node(t->key+k,t->len-k); p->link = t->link; t->link = p; char* a = new char[k]; strncpy(a,t->key,k); delete[] t->key; t->key = a; t->len = k;} Insertion code:node* insert(node* t, char* x, int n=0) // inserting x key in t tree { if( !n ) n = strlen(x)+1; if( !t ) return new node(x,n); int k = prefix(x,n,t->key,t->len); if( k==0 ) t->next = insert(t->next,x,n); else if( k<n ) { if( k<t->len ) // cut or not to cut? split(t,k); t->link = insert(t->link,x+k,n-k); } return t;} The following picture represents abaca$ and abcd$ keys insertion in the mentioned above tree:You should note, that if the given x string is already in the tree, there will be made no insertion. In this case a prefix tree behaves as a proper set.Deleting KeysAs always, key deletion is the most difficult operation. Though in case of tries, it is not that scary. The thing is that when we delete a key, we delete just one leaf node corresponding to some suffix of the key. At first, we should find this node. If the search is successful, we delete it ands return the pointer to the younger sister of the given node (since it is a leaf, it has no children, but can have sisters).At that, we could finish the deleting process, but there’s one problem. After the node deletion, there can form a chain of t and p nodes, in which t node has just one p child node. Therefore, if we want to keep the tree compressed, we should join these two nodes into one by performing merge operation.The code of merge operation is quite trite. We create a new key, then move the subtree of a p node to t and delete p node.void join(node* t) // t and t->link nodes merge{ node* p = t->link; char* a = new char[t->len+p->len]; strncpy(a,t->key,t->len); strncpy(a+t->len,p->key,p->len); delete[] t->key; t->key = a; t->len += p->len; t->link = p->link; delete p;} The older node is in charge of merging as the younger one does not have the information about its parent. Merge execution has the following criteria:Key deletion by link reference, not next;After deletion, a new link reference does not have next reference. There’s just one child node, so we can merge it with the current one.node* remove(node* t, char* x, int n=0) // deleting x key from t tree { if( !n ) n = strlen(x)+1; if( !t ) return 0; int k = prefix(x,n,t->key,t->len); if( k==n ) // deleting a leaf { znode* p = t->next; delete t; return p; } if( k==0 ) t->next = remove(t->next, x, n); else if( k==t->len ) { t->link = remove(t->link, x+k, n-k); if( t->link && !t->link->next ) // does t node have just one sister node? join(t); } return t;} Examples of deleting keys without merging:with merging:EfficiencyThere have been carried out a computational investigation on comparing AVL and prefix trees as for operation time and memory consumption. As for me, the result was a bit bewildering. Anyway, let’s go step by step. There have been formed 8 test string sets. The following table represents their features:First of all, they measured the build time of a tree according to the given set of strings and time for searching in it all the keys of the same set (i.e. successful search only). The below graph presents the comparison of AVL tree and a prefix tree (radix tree) build time. You can see that a prefix tree builds up a bit faster.The following chart compares the time spent on searching all keys for the same two trees. A balanced binary tree spends two times less time on searching, than a prefix one.Finally, let’s take a look at memory requirements for one symbol. The results are presented in the following graph:On average, there are about 2 bytes per one symbol, which is not bad. But in case of flags a prefix tree spends less than 1 byte on 1 symbol (there are plenty of common long prefixes).Thus, there have been found no winner. It’s worth to compare the operation time of these two trees as for the number of strings. But according to the provided above charts, there would be nothing revolutionary. Of course, it would also be interesting to compare these two approaches with hash tables…

My optional subject is Public Administration.I have written four mains with Public Administration as an optional. I got 228 marks in 2015, 297 in 2016, 290 in 2017 and 307 in 2018. Public Administration has always been special to me and this is one subject which never ditched me in Mains exam.My journey with public administration began in the end years of college when I got Laxmikanth public administration book. Over the years I read a number of books, many research papers and have really grown fond of this subject.One thing I would like to state in advance is that I have done very little answer writing as far as optional paper is considered. But I have focused more on approach and analysis, linkage and relevance. I will share all these experiences in this write up and hope that you will benefit from it somehow.To start with, I learnt much of my pub ad from a thread run by @doodlbean maa’m on ForumIAS. I scanned through all 260+ pages on that thread and observed, read, ingrained the right approach towards public administration.In the next few years I built on this foundation, going into details by reading from various sources.Based on my personal journey I would recommend following approach. Aspirants should see if it suits their studying style, time availability and interests. This is only indicative in nature. There is absolutely no need to read some of the books I mentioned if you don’t have time.The essential books: The must read booksAribam-Paper 1 & Paper-2 (One should start with these two books)Administrative Thinkers: Prasad & Prasad (This can go parallel with Aribam if you are new to the subject, otherwise P&P can always be referred to for more in-depth understanding of a thinker)Mohit Bhattacharya: New Horizons of Public Administration (The language of this book is tough, so it should be read after Aribam. 2nd or 3rd reading of the book gives some good conceptual clarity)Shubhra Saxena: Public Administration Super 50 (25-25 topics from Paper 1 & Paper 2 have been dealt in a nice manner, more of a revision and content enrichment book, will help in marks augmentation. This used to be my go to book during the interval between paper 1 and paper 2 on the optional exam day)Vikram Singh: Public Administration Dictionary (Some of the complex concepts have been explained beautifully and a simple manner, quite effective for using them in your answers)Frederickson, Smith & Others: The Public Administration Theory Primer [Some selected chapters of Primer can be done like Postmodern theory (ch 6), Governance (ch 9), future of pub ad (ch 10) etc]Website: https://publicadministrationtheone.blogspot.com(The website is a rich source of various pub ad concepts and is also helpful in quick revision of an entire topic in a 360 degree manner)The non-essential books: Recommended, but they are not necessarily must-read books.Mohit Bhattacharya: Restructuring Public Administration: A New Look (should be read after New horizons, deals with NPM and Post NPM development; concepts like Neo-weberian state (NWS) has been explained beautifully.Mohit Bhattacharya: Social Theory and Development administrationRamesh K. Arora: Comparative Public AdministrationHidden Syllabus :This is what we often hear in pub ad circle that there is a hidden syllabus. Irrespective of whether it is there or not, following things/names need to be studied, mainly through internet or other books.Following should be looked into :·Public Administration in other countries - the French and American version, Thatcherism and Reaganism and how New Zealand successfully adopted concepts of Thatcher·Minnowbrook 3 and latest advances in the field of Public Administration (You can refer to public administration review (PAR) website)·Thinkers like Marx and his views on Bureaucracy, Hegel, Hayek, Nozick, Friedman, Talcott parsons, Aaron Wildavsky and Budgeting, Waldo,Warren Bennis, Foucalt and his Governmentality concept, Edward Weidner and his contribution to Development Administration, Gunnar Myrdal, Sabatier’s Advocacy Coalition Framework (ACF), Harrold Lasswell and his idea on Policy Science, Estonian Black Box of Policy Making·Gender and Administration, Gender in Administration and Gender and Budgeting etc. (Very well covered in Mohit Bhattacharya: Social Theory and Development administration)·Ferrel heady and his contribution to Comparative Public Administration·Concepts like Neo Classical Theorists, Neo Marxism, Post Structuralism, Post Modernism, Pareto Optimality, Critical Theory, Habermas, Contingency vs Strategic Contingency , Neo Taylorism and Gramsci’s criticism of Taylor, Taylorism and recent best practices like Toyota Production System, Kaizen, Gemba etc, Phenomenological approach: Heidegger And Husserl work. asked in 2018 mains)·Amartya Sen & Jean Dreaze vs Bhagwati Sen Debate·Techniques of Administrative improvement - CPM, PERT and how to draw the charts, Gantt Chart, Enterprise Resource Management, SAP, Management Information SystemRoad to good score:1.Use simple language which doesn’t require an examiner to read a particular sentence twice. Simplicity is the function of your understanding and conceptual clarity. Build upon it.2.Introduction should be sharp and focused. Don’t beat around the bush. Also, for 10 marker try to come to the main body in the very next paragraph as time and space is limited. In 15/20 markers, one can elaborate the same point in little bit more details compared to a 10 marker.3.It often happens that we approach question tangentially, meaning that we use the concepts but somehow it is not answering what has been asked. So using the keywords of a question in your answer would help in ensuring that diversion doesn’t happen in the answer.4.For paper 1, contemporary examples, especially from Indian Administration will surely boost your marks. Hence keep an eye on happenings in Indian administration and link it with Paper 1 thinkers and theories. Example: Use of MIS in district administration is an example of New Public management (NPM), Social audit is a tool to take feedback from environment (People, civil society) and make administration more transparent (moving from a closed system to an open system) etc. Similar linkages can be thought of.5.For paper 2, try to link with paper 1 concepts and thinkers as far as possible. For example for 2016 Pub ad paper-2: defense ministry/home ministry question..Likert’s linking pin mechanism can be used to improve policy making process in India, officials from two overlapping ministry can work jointly on a policy like border management in remote areas (defense ministry and home ministry).6.Use of constitutional articles: If there is a question on governor, the starting line can be : Article 153 states that there shall be a governor for each state. Similarly, article 163 for Council of minister, article 169 for state legislative council, article 279A for GST council etc should be used.7.Use of 2nd ARC recommendations, Punchhi commission recommendations, Sarkaria commission recommendations would augment marks. Aribam covers selected chapters of 2nd ARC in the end of both books. Those must be done thoroughly. Also, it is recommended that you read original chapters and make some concrete notes. This will improve your understanding.8.Use Flow charts and Diagrams wherever possible. They will help you to present your answer in a better way and you can save lots of time. For example, Barnard’s contribution-satisfaction equilibrium can be shown using a balance (remember that justice lady using that tarajoo..balance). Write Contribution on one end and satisfaction on another end. Similarly, PRIs and Social Audit can be linked with Sherry Arnstein’s participation ladder. Draw a ladder and show how true empowerment happens through participation.9.Try to quote one example as far as possible for all answers. This will mean you need to have a collection of examples. Keep an eye on best practices (Some best practices which I had collected are 1.Vadodara's One day governance model(ODG) 2.Gujarat CM's citizen access approach: SWAGAT Project 3.UP's grievance redressal project: Lokvani Project 4.Nagaland's community Involvement in Elementary education, health services and electricity management: Communitisation Program 5.Some e-governance programms: E-Mitra-Rajasthan, HARIS-Harayana, SARITA-Maharashtra,FRIENDS-Kerala,GYANDOOT-MP,BHOOMI-Karantaka 6.Bhagidari : Citizens participation in Governance, Delhi 7.Trichi Community Policing model, 8.PRAHARI: Community Policing Initiative in Assam ). Keep collecting similar examples and also work on their linkages: (Compassionate Kozikhode project..Can you link it with Perry’s Public service motivation model (PSM)?)10.Have a good peer group and discuss about topics and questions regularly. Confluence of various ideas will do magic on your answer. This can be done either on ForumIAS (now quest platform) or on telegram. Also, you can form a very close group of 3-4 friends apart from these platform and discuss everything with them. I have benefitted immensely from these associations and I am highly thankful to all my friends for their help and co-operation.11.Though I didn’t do much answer writing practice for optional I highly recommend that you do practice answer writing on a frequent basis. It is also good to join any test series so that someone would correct your presentation. Additionally you should go through the toppers copy, try the questions first and learn from their approach. If there is a good diagram, you can practice and internalize it. Keep collecting such flowcharts and diagrams. This is called cumulative learning from community (to use the pub ad terminology: network learning )My marksheet