Marketing Communication College Case Study Example | Topics and Well Written Essays - 1000 words

Marketing Communication College - Case Study Example As a member of the skin care and hygiene product market, Dermacare experiences rigid competition from other industry leaders including Proctor and Gamble, Johnson and Johnson, and Revlon. What has been our P/Cost ratio Are we enjoying market growth Why or why not L'OREAL, the world's largest cosmetics company, is jointly owned by Gasparal (France) (51 per cent) and Nestle (Switzerland) (49 per cent). It markets Ambre Solaire through its Laboratories Garnier division. L'OREAL has interests in most sectors of the global cosmetics and toiletries markets. In addition to its Garnier Division, L'OREAL operates through three divisions in the UK: Salon, Perfume and Beauty (e.g. Cacharel, Armani, and Helena Rubinstein) and Active Cosmetics (e.g. Vichy). Ambre Solaire had previously been associated with oil formulations (as opposed to creams and gels) for deep tanning and self-tanning products. L'OREAL is very active in research and development and is perceived by customers as inventive and at the forefront of technology. Boots is one of Britain's major high street retailers and has interests in both the retailing and manufacturing of sun care products. In 2008, Boots was by far the largest retailer of sun care and other toiletry products. Its Soltan brand accounted for about 40 per cent value share in its 1,100 outlets. Soltan benefited from Boots' skin care and pharmacy heritage, and was especially strong in the after-sun sector, with roughly a one-quarter share by value. The strength of Boots was highlighted in March 2006 when it introduced a star-rating system that indicated how much protection a product provided against UVA rays in proportion to the amount of UVB protection offered. While its introduction created some uncertainty in the industry, virtually all manufacturers accepted the new system. Avon Cosmetics Ltd A subsidiary of Avon Products, Inc., Avon Cosmetics is the oldest beauty company in the USA and one of the world's four largest cosmetics companies. It entered the UK market in 1957. Avon sells its cosmetics, toiletries and fragrances to individual consumers. The bulk of its business comes from its sales representatives ('Avon Ladies') selling to women in their homes and workplaces. Avon employs some 100,000 representatives in the UK alone. In the 1980s it increased its market share in line with the growth of home shopping; however, its sales in the early first decade of the new millennium have been sluggish owing to its inability to match retailers' product-ranges and prices. Nevertheless, Avon accounts for around 11 per cent of all sun care sales. Nivea A well-established global brand developed by the German manufacturer Beiersdorf in the early nineteenth century. The company had developed a number of line extensions across its range of skincare products that competed directly with Dermacare in a number of sub-categories. While its traditional market strength was in continental Europe the company's products enjoyed a high degree of loyalty and recognition in the UK market. Ciba Consumer Products Ciba Consumer Products is a subsidiary of the Swiss chemicals giant Ciba-Geigy. Ciba's core consumer business was in over-the-counter (OTC) health care. In the UK toiletry sector, its main product was Piz Buin, the number five sun care brand. Warner-Lambert Warner -Lambert's Hawaiian Tropic

Biology Essay Example | Topics and Well Written Essays - 500 words - 2

Biology - Essay Example Creatine Phosphate also called as creatine is a source of energy which on reaching the muscle is converted into phosphocreatine. It provides energy during heavy work out when there are depleted levels of ATP and acts as a major source of energy. 5. During short bursts of extreme muscular activity, lactate (lactic acid) can build up to high concentrations in the muscles and blood. the reason usually given to explain this accumulation is during strenuous work out sessions the oxygen present in the blood cannot produce energy that can satisfy the demand of the body so, there are other processes that start functioning in the body that operate in the absence of oxygen to produce ATP for which lactic acid is the end product. During exercise the energy stores in the muscle are depleted and the energy is derived from other process which are biochemical and metabolic in nature. They tend to release substances like lactate which accumulate and lead to generation of muscle fatigue because the muscle cannot excrete the metabolites compared to the speed at which they are produced. 6. Mitochondria are an essential part of the cell structure which is responsible for generation of energy. Mitochondria Cytopathy is a disease that affects the mitochondria leads to decrease in production of energy leading to multiple organ failure.

An Overview Algorithms And Data Structures Computer Science Essay

An Overview Algorithms And Data Structures Computer Science Essay Algorithms consist of a set of rules to execute calculations by hand or machine. It can also be defined as an abstraction consisting a program executed on a machine (Drozdek 2004). This program will follow operations carried out in sequence on data organized in data structures. These data structures are generally categorized into: Linear data structures examples which are arrays, matrices, hashed array trees and linked list among others. The tree data structures which include binary tree, binary search tree, B- trees, heaps e.t.c. Hashes which consist of the commonly used hash table Graph Graph: This is an abstract data structure which implements the graph oriented concepts. The graph will consist of arcs or edges as (x, y) of nodes or vertices. The edges may assume some value or numeric attribute such as cost length or capacity. Some of the operations of the graph structure G would include: Adjacent (x, y) an operation testing whether for the existence of an edge between x and y. Set_ node, value (G x, a) an operation setting the value associated with node x to a Add (G x, y) an operation that adds to the graph an arc from x and y if it is not existent. Graph algorithms are implemented within computer science to find the paths between two nodes like the depth or breadth first search or the shortest path (Sedgewick 2001 p 253). This is implemented by the Dijkstras algorithm. The Floyd Warshall algorithm is used to derive the shortest path between nodes. Linked lists These are linear data structures consisting of a data sequence linked by a reference. Linked lists provide implementation for stacks, queues, skip lists and hash tables. Linked lists are preferred over arrays because the lists may be ordered differently from how they are stored in memory. These lists will therefore allow the removal or insertion of nodes at any point. Each component or record has a node containing an address to the next node called the pointer or next link. The remainder of the fields are known as the payload, cargo, data or information. The list has first node as the head and the last node as the tail. A linked list may be circularly linked where the last node references the first node in the same list or linear where the link field is open. B -Tree This is a tree data structure that stores sorted data and allows searches, deletions, insertions and sequential access. The operations in the B- Tree are normally optimized for bulky data systems. The B -Tree has variants of design. However the B -Tree stores keys in the internal nodes. However this does not normally reflect at the leaves. The general variations are B+ Tree and B* Tree (Comer 129). The searching process is similar for the B- Tree and the binary search tree. It commences at the root and a traversal is executed from top to bottom. The search points at the child pointer with values between the search values. The insertion starts at the leaf node which if containing fewer than legally acceptable elements qualify for an addition, otherwise the node is evenly split into two nodes. A median is chosen in determining the left or right hand placements with values greater than the median going to the right node. The median here acts as the separation value. The deletion process assumes two popular strategies. Either the element located is deleted followed by a restructuring of the tree. Alternatively a scan may be performed followed by a restructuring of the tree after the candidate node to be delete has been identified. Hashes This is a data structure employing the hash function mapping to identity keys. The function transforms the key as an index of an array. The function then maps every key possibility to a unique slot index. Using well dimensioned hash tables every look up is independent of the population in the array. The hash table efficiency is utilized in database indexing, implementation of sets and cache and associative arrays. A simple array is central to the hash table algorithm. This algorithm derives an index from the elements key. This index is then used to store the elements in the array. The hash function f represents the implementation of the calculation. Hash tables implement various types of memory tables. The keys are used in this case for persistent data structures and disk based database indices. Greedy Algorithms. These algorithms work by making most promising decisions at the onset whatever the outcome would be is not taken into consideration at that moment. These algorithms are considered straight forward, simple and short sighted (Chartrand 1984). The upside or advantage to these greedy algorithms is that they are easy to invent and implement and will prove efficient. Their disadvantage is that they are not able problems optimally because of their greedy approach. Greedy algorithms are applied when we try to solve optimization problems. A typical implementation of these algorithms is the making change problem whereby we are required to give change using minimum number of notes or coins. We commence by giving the largest denomination first. Informally the greedy algorithm for this problem would follow the steps below: Begin without anything At each stage and without passing a given amount Consider the largest addition to the set. A formal algorithm of the implementation of the making change problem can be written as here below: MkChange C à ¢Ã¢â‚¬  Ã¢â‚¬â„¢ {100, 25, 10, 5, 1} // C is a constant set of different coinage denominations Sol à ¢Ã¢â‚¬  Ã¢â‚¬â„¢ {X} // Represents the solution set Sumà ¢Ã¢â‚¬  Ã¢â‚¬â„¢ 0 which is the sum of items in {X} WHILE Sum. Not = n L =Largest of C such that Sum +L IF no such item THEN RETURN No item SUM à ¢Ã¢â‚¬  Ã‚  Sum+L RETURN S. An approach by the greedy algorithm to ensure optimization is the maintaining of two sets one for chosen items and the other for rejected items. Based on the two sets the algorithm will carry out four functions. Function one checks whether the chosen set of items can provide a solution. Function two checks for flexibility of the set. The selection function identifies the candidates. The objective function gives a solution. The greedy algorithm applies for the shortest path. The Dijkstras algorithm aims at determining the length of the shortest path. This path runs from S the source to other nodes. Typically Dijkstras algorithm maintains two sets of nodes S and C. S in this case consists of already selected nodes whereas C will consist of the rest of the nodes within the graph (Papadimitrious Steiglitz 1998). At the initialization of the algorithm our set X has only S. After execution {X} includes all the nodes of the graph. During every step in the algorithm a node in C that is closest to S is chosen. The remainder nodes that dont belong to S will result in a disconnected graph. The diagrams below illustrate the Dijkstra algorithm Considering the graph G = (V, E). Each node of the graph has an infinite cost apart from the source node with 0 costs (Design and Analysis of Computer Algorithms 2010) Source: Design and Analysis of Computer Algorithms 2010 Initialize d[S] to zero and choose the node closest to S. Add to S while relaxing all other nodes adjacent to S. Update every node. The diagram here below illustrates this process: Source: Design and Analysis of Computer Algorithms 2010 Choose the closest node X and relax adjacent nodes while updating u, v and y as indicated in the diagram below. Source: Next we consider y as closest and add to S and relax V as indicated in the diagram below Source: Design and Analysis of Computer Algorithms 2010 Consider u and adjust v as a neighbor as indicated in the diagram here below. Source: Design and Analysis of Computer Algorithms 2010 Finally add V and the predecessor list now defines the shortest path from S which was the source node. The diagram below illustrates the resulting shortest path Source: Design and Analysis of Computer Algorithms 2010 Spanning trees Typically graphs will have a number of paths between nodes. Spanning tree graphs consist of all the nodes with a path between any two nodes. A graph consists of different spanning trees. A disconnected graph will represent a spanning forest. A breadth first spanning tree results after a breadth first search on this graph. The depth first spanning tree results after a depth first search on the spanning tree. Spanning tree applications among others includes the travelling salesman problem here below: Problem: Considering an undirected graph G= (V, E) having a non negative integer cost associated with every edge and representing a certain distance. We can derive a tour of the graph G with the minimum cost. The salesman may start from city 1 and go on to the six cities (1 6) and return back to city 1. The first approach would run in the following manner from city: 1 to 4 to 2 to 5 to 6 to 3 to 1 resulting in a total of 62 kilometers. The diagram below shows this approach. Adding the edge weights we have 15+10+8+15+9+5 = 62 Source: Design and Analysis of Computer Algorithms 2010 The other alternative approach which is the most optimal would run in the following man from city: 1 to 2 to 5 to 4 to 6 to 3 to 1 resulting in a total of 48 kilometers. The diagram below shows this approach. Adding the edge weights we have 10+8+8+8+9+5= 48 Kilometers Source: Design and Analysis of Computer Algorithms 2010 Other applications using the panning tree approach are like the airlines route determination, designing of computer networks, the laying of oil pipelines to connect refineries and road link constructions between cities. (Goodrich Tamassia 2010; Sedgewick 2002). A typical minimum spanning tree application based on the spanning tree application MST(minimum spanning tree) cost can be used o determine the points of connection of some cable for example the fiber optic being laid along a certain path. The edges with a larger weight which corresponds to more cost would be those that require more attention and resources to lay the cable. An appropriate result would be derived from the graph with the minimum cost. Prims Algorithm. The approach for this algorithm is that it proceeds from an arbitrary root node at every stage. A new edge being added to the tree at every step. The addition process terminates when all the nodes in the graph have been achieved. This algorithm concentrates on the shortest edge. Therefore the time lapse for the algorithm will depend on how the edge is searched. The straight forward search method identifies the smallest edge by searching adjacently a list of all nodes in the graph. Every search as an iteration has a cost time O (m). Total cost time to run a complete search is O (mn). The Prim algorithm (basic) takes the following steps: Initialize the tree to consist of a start node WHILE not all nodes in the tree Loop Examine all nodes in the graph with one end point in the tree Find the shortest edge adding it to the tree End. After each step or iteration a partially completed spanning tree holding a maximum number of shortest edges is created as A and B will consist of the remaining nodes. The loop looks for the shortest edge between A and B. Kruskals Algorithm. This is an algorithm that computes the minimum spanning tree (MST). This is done by building a generic algorithm into a forest. Kruskals algorithm will consider every edge and is ordered based on the increasing weight. Consider an edge (u, v) that connecting two different trees. It follows that (u, v) will be added to the set of edges in the generic algorithm. The resultant is a single tree from two trees connected by (u, v). The algorithm can be outlined as follows: Commence with an empty set E selecting at each stage the shortest edge not yet chosen or discarded regardless of its location on the graph MST KRUSKAL (G, w) A à ¢Ã¢â‚¬  Ã‚ { } // the set containing the edges of the MST for every node n in V[G] do make_set (n) sort edge of E by decreasing weights w for each edge (u, n) in E do if FIND_SET (u) not equal FIND_SET (n) then A=A U {(U, N)} UNION (u, n) Return A The algorithm above makes use of disjoint set data structures. Kruskals algorithm can also be implemented with the priority queue data structure. The resulting algorithm is shown below: MST KRUSKAL (G) for each node n in V[G] do define S(n) à ¢Ã¢â‚¬  Ã‚ { n} initialize the queue Q consisting of all the edges of the graph G. Weights are not used as key here A à ¢Ã¢â‚¬  Ã‚ { } // This set will contain the edges of the generic algorithm(MST) WHILE A has v-1 edges do n à Ã¢â‚¬Å¾ S(n) and u à Ã¢â‚¬Å¾ S(u) IF S (n)! = S (u) Then add edge (u, n) to A S(n) U S(u) Return A The Binary Search Tree. A binary tree is one where every internal node X will store an element. Generally the elements in the left sub tree of X are less than or equal to X whereas those on the right sub tree are equal or greater than X. This represents the binary search tree property. The binary search tree height amounts to the number of links between the root and the deepest node (Skeinna 2008). The implementation of the binary search tree is such as a linked data structure where each node is an object with a total of three pointer fields namely left, right and Parent. These points to nodes corresponding to the left, right children and the parent. A NIL in any of these fields indicates no parent or child. The root node contains NIL in the Parent field. Dynamic programming algorithms These typically explores ways of optimization sequence based decisions in determining solutions. The algorithms employed avoid full enumeration of partial decisions that having a sub optimal contribution to the final solution. They instead concentrate only on optimal contributors (Aho Hopcrost 1983). The optimal solution is derived from a polynomial number of decision steps. At other times it is necessary for the algorithm to be fully implemented, however in most cases only the optimal solution is considered. Dynamic programming algorithms use of duplication and every sub solution is stored for later referencing. These solutions to the sub problems are held in a table. The total sub problems are then worked out using the bottom up technique. The steps in this bottom up technique will include the following: Begin by addressing the smallest sub problem Combine and sum up their solution increasing the scope and size UNTIL arriving at the solution of the original problem Dynamic programming relies on the principle of optimality. This principle alludes to the fact that present in an optimal decision or choice sequences are sub sequences that must be optimal as well. Warshall Algorithm. The WFI algorithm as it is also known is a graph analysis algorithm used to determine the shortest path in a weighted graph (Chartrand 1984). A comparison carried out will cover all possible paths between nodes of the graph. Consider graph G with nodes V as 1 to N. Let sPath(i, j, k) be the function that will return the shortest path between I and j while using the nodes 1 to k, demonstrates a recursive formula that results as shown here below sPath(i, j, k) = min{shortestPath(I, j, k-1),shortestPath(i, j, k -1)+shortestPath(k, j, k-1)} shortestPath(i, j, 0) = edgeCost(i, j) This forms the heart of the WFI algorithm. The shortest path is first computed as shortestPath(i, j, k) for all (i, j) pairs of k where k = 1 to n. The Floyd Warshall algorithm iteratively determine paths lengths between nodes (i, j) over i=j. The initial path is considered as zero, the algorithm provides the path lengths between the nodes. Conclusion Data structures and their associated algorithms are fundamental even today in providing the means for data storage and manipulation (Sage 2006). Core and complex computer processing involving memory management functions for operating systems, the database management systems cache implementation rely on data structures and their associated algorithms to execute efficiently and effectively. It is therefore becomes necessary that an adequate study of these data structures and algorithms is carefully studied and understood by system programmers to ensure the design of efficient and effective software.

The Symbolism of the Stone Angel by Margaret Laurence Essay -- Stone A

The Symbolism of the Stone Angel by Margaret Laurence Margaret Laurence's novel, The Stone Angel is a compelling journey of flashbacks seen through the eyes of Hagar Shipley, a ninety year-old woman nearing the end of her life.   In the novel, Margaret Laurence, uses the stone angel to effectively symbolize fictional characters.     The term symbolism in its broadest sense means the use of an object to stand for something other than itself.   In The Stone Angel, Margaret Laurence uses the stone angel to sybmolize the Currie family values and pride and in particular, the pride and cold personality traits of Hagar Shipley.   There are three primary areas where the stone angel is used to symbolize characters in the novel.   They are: the Currie family pride as a symbol of egoism and materialism, Hagar's lack of compassion for her family and friends as symbolized by a heart of stone, and Hagar's blindness to the feelings and needs of the others as symbolized by the blindness of the angel.     The stone angel is symbolic of the Currie family pride and values.   The stone angel memorial is purchased and brought from Italy by Jason Currie at great expense and placed at the grave site of his wife, in the Manawaka cemetery.   The stone angel is the largest and most expensive memorial in the cemetery.   Although the stone angel is intended to be a memorial for Mrs. Currie, it was not really suitable because Hagar describes her as being meek and a feeble ghost.   The angel is not intended for Mrs. Currie, but in fact, represents the materialistic and egotistical values that characterizes Jason and later, Hagar.   Jason purchases the stone angel in pride and not in grief over the death of this wife: "bought in pride to mark her bones and ... ...from her point of view and is blind to the needs and aspirations of others.   She can only see things from her side of the fence and cannot see how others view the world from the other side.   She is a blind as the stone statue. Although the Currie?s family pride is symbolized repeatedly by the stone angel throughout the novel, it is Hagar who is best symbolized the stone angel.   The angel aptly symbolizes the blindness, hardness, and lack of feelings that are characteristics Hagar displays during her life.   In retrospect, Hagar is the stone angel. Works Cited and Consulted Blewett, D.. "The Unity of the Manawaka Cycle." The World of the Novel: A Student's Guide to Margaret Laurence's The Stone Angel. Ed. Lillian Perigoe and Beverly Copping. Scarborough: Prentice Hall Inc., 1983. Laurence, Margaret. The Stone Angel. Toronto: McClelland &Stewart Inc., 1988.

Personal Dilemma Paper Essay

In February 2014, Baltimore Ravens player Ray Rice and his fiancà ©e Janay Palmer (now wife) were arrested, charged and later released in Atlantic City on what was called simple assault charges. The details were not clear at the time. However, what was known was that Rice and Palmer got into a some form of an altercation inside the Revel Casino. Rice’s lawyer stated in was just a â€Å"minor physical altercation.† Not long afterward video footage surfaced showing Rice dragging an unconscious Palmer out of an elevator. The Ravens organization as a whole defended Rice after he was arrested and reiterated he would continue to be the team’s running back. Steve Bisciotti, the team owner, praised Rice and his good character and noted that Rice had no prior off-field trouble. The charges against Rice were elevated to aggravated assault after prosecutors presented the case to a grand jury. At that point, the charges were dropped against Palmer for simple assault (AP, 20 14). Palmer stated she did not wish to proceed with prosecuting Rice. However, that did not keep the state of New Jersey from moving forward with prosecuting the case. Rice did not accept a plea deal that would keep him out of jail in exchange for going through anger management and the successful completion of probation. Instead, he decided to plead not guilty and apply for a first-time offender program that might remove any charges in as little as six-months. Under this program, Rice would need to keep out of any trouble and partake in counseling on a regular basis. Prosecutors did allow Rice into this program instead of going to trial. If he stays out of trouble and completes the 12-month program, his record will not reflect the case. Interestingly, this program is normally only used for non-violent and victimless crimes. Also, entry into the program has been granted in less than 1% of all domestic violence cases in the state of New Jersey (AP, 2014). The National Football League (NFL) claimed it had not seen any video of an altercation within the casino elevator. A law enforcement official stated the elevator video was sent to the NFL in April and he had proof in the form of a 12-second voicemail with a number within the NFL offices that confirmed the videos arrival. The league office denied ever receiving it. The league claims it requested the tape, but was denied. The Ravens also claimed not to have seen the video until it was released by TMZ (AP, 2014). Rice is basically assured of not going to jail, but was not able to keep the NFL commissioner from laying down a little justice of his own. He originally suspended Rice for a mere two games. This decision was met with considerable public outrage. Goodell had to admit that his initial punishment was wrong and beefed up the NFL’s policy on domestic violence in reaction to the public outrage. The new policy would suspend a player six-games with no pay for a first offense, and lifetime banishment for a second offense. After seeing Rice knocking his wife unconscious, the Ravens terminated his contract. Allegedly, the team made this decision because Rice was not honest with them. Shortly after his release from the team, the league suspended him indefinitely. Since the league had previously suspended Rice (the initial two-games), the commissioner needed justification to indefinitely suspend him. The commissioner notified the Players Association that an indefinite suspension resulted from Rice telling them something different than what appeared on the video of him hitting Palmer. Contrary to the commissioner’s statements, there were several sources (including Ravens General Manager Ozzie Newsome) who stated that Rice was being truthful (McManus, 2014). By all accounts, Rice was known as a good guy. The commissioner said seeing the video changed everything. But, why? Everyone knew what happened before the video was released. Rice knocked out his then fiancà ©e in an elevator. Nothing changed before or after the video was released. Goodell stated they should have seen it earlier and should have pursued their own investigation more vigorously. That is true. So, why didn’t they? The question still remains. Why would seeing the video change their minds about his punishment? Initially, it was only worth a two game suspension. Remember,  nothing changed. After the video was released, he is suspended indefinitely. Since this is his first offence, shouldn’t he be suspended for only six games? Why should he lose his job and income. Wouldn’t it be better of the NFL and the Ravens organization to help this man and his family instead of just tossing him away like trash? Rice was clearly tried and found guilty by the court of public opinion. It is amazing how fast we are as a society to be publicly correct, jump to conclusions, and show our willingness to take away a person’s livelihood. References AP, (2014). Timeline of Key Events in the Ray Rice Case. Retrieved on 13 Sep 14 from http://abcnews.go.com/Sports/wireStory/timeline-key-events-ray-rice-case-25441413 McManus, J. (2014). How the NFL’s new domestic violence stance came to be. Retrieved on 13 Sep 14 from http://espn.go.com/espnw/news-commentary/article/11464303/how-nfl-new-domestic-violence-stance-came-be

Females & family Essay

Being someone means that a person has one’s own concept of an own identity. This means that one knows what he/she wants and why he/she wants it. Furthermore, one that has properly established an identity can be freed of the manipulations of others. Men and women alike are in search and in pursuance of a self that they could call their own. Even in fiction, the idea of maintaining a personal identity is exemplified. Although their pasts could never be made out quite perfectly, the characters present state and outlooks about the future are enough to explain what is the common theme. The women in the two stories lacked a certain sense of identity that is their own. Judging from their behavior, thoughts and desires, it can be safely said that being in a married state had made them lose their selves. Both female wives were accustomed to a patriarchal family where the male decides for the family. Nancy in Dead Men’s Path and Mrs. Mallard in The Story of an Hour were typical housewives who ascertain to the decisions of their husbands. Both craved for their own interests subtly. Both had unmet needs that were asking to be freed, much ignored by the people around them who were far too busy to even notice. Look more:  literary analysis of the story of an hour essay The female lead character in The Story of an Hour, Mrs. Mallard, was aspiring for freedom that she did not even know she was lacking. Being a married person, most of her time she was thinking of her family—husband, sister and other relatives. Her own good was put at the back of her mind and was very seldom thought of. At the time that her sister gently broke with her the news of her husband’s death, she finally realized that she had been cooped up under the shadow of her husband. Mrs. Mallard was consumed by the thought of exercising her long extinguished right. In her mind she was thinking about the future that was smiling brightly ahead of her, for times that she would be enjoying on her own. â€Å"There would be no one to live for during those coming years; she would live for herself. (Chopin, 1894). † It can be said that her life with her husband had not been a rather satisfying one because her husband had not understood her likes and preferences. She further thinks that due to his death, â€Å"there would be no powerful will bending hers in that blind persistence with which men and women believe they have a right to impose a private will upon a fellow-creature. A kind intention or a cruel intention made the act seem no less a crime as she looked upon it in that brief moment of illumination (Chopin, 1894). † At that instant, all she wanted was to be free—to be really and truly free—in the full essence of the world. That thought she had enjoyed all to herself, as others would find it hard to understand her joy. She looked at the future ahead of her with a renewed hope. In the words of Chopin (1894), â€Å"But she saw beyond that bitter moment a long procession of years to come that would belong to her absolutely. And she opened and spread her arms out to them in welcome. † Mrs. Mallard had been afflicted by heart attack, which showed how fragile she was. Despite the grief that she should be voicing out due to the sudden death of her husband, she could not cage the enthusiasm that gripped her intensely. â€Å"She said it over and over under her breath: ‘free, free, free! ’ The vacant stare and the look of terror that had followed it went from her eyes. They stayed keen and bright. Her pulses beat fast, and the coursing blood warmed and relaxed every inch of her body (Chopin, 1894). † Even her love—or what used to be love, even in the littlest sense—had been forgotten completely. In fact, Mrs. Mallard thought, â€Å"What could love, the unsolved mystery, count for in the face of this possession of self-assertion which she suddenly recognized as the strongest impulse of her being! (Chopin, 1894)† At this point she had established the notion that she was to put herself above everything else seeing that she is not expected to be caged again. She could have sensed her inappropriate response to the death and so locked herself up to celebrate with herself before she went down to face her relatives. She was excited about the future that smiled brightly at her; her time would be spent on whatever she wanted to do without reference to other’s decisions and preferences. She was at last free to be herself again. That was of course until she found out that the cause of her imprisonment was well alive and breathing, her heart failing to cope up with the sudden burst of happiness and then disappointment. The sudden news that gripped her with a revived hope for a bright future had been devastated at the truth that she was not truly freed yet. Nancy, the new headmaster’s young wife, had been burdened by the duties of a wife that she looked older than her actual age. In the following sentence her frustrations were illuminated as stated: â€Å"In their two years of married life she had become completely infected by his passion for ‘modern methods’ and his denigration of ‘these old and superannuated people in the teaching field who would be better employed as traders in the Onitsha market’ (Achebe, 1972)†. The text explicitly mentioned that since she had been married she had lost her own sense of identity and became a subordinate of her husband who had better things in mind than listen to the woes of his wife. Also according to the story, Nancy had been the listener to what his husbands had to say about other people without saying that he has listened to what his wife wants to say. Achebe (1972) illustrates this position by saying that â€Å"Her little personal misfortune could not blind her to her husband’s happy prospects. † In the scene where Nancy was excited about her husband’s new arrangement, she was thinking about her new status and how every other woman would look envious. She was not concerned with what her husband had to do for the welfare of the community. Instead, she was focused on what she would be. She wanted herself to be better in comparison to the other women. She wanted not to regret the fact that she was married to a man that was not unhandsome but not dashing either. However, when she realized that unlike her all other teachers were unmarried, young and better in terms of physical characteristics than her, she was disappointed. She had wanted to be envied and be idolized by others, especially females. Her simple dream was far from being fulfilled. In the story, her character had â€Å"began to see herself already as the admired wife of the young headmaster, the queen of the school. The wives of the other teachers would envy her position. She would set the fashion in everything†¦(Achebe, 1972). † Looking at the two stories and the roles of females in the texts, a generalization can be made stating that females, once in a married status, is asked to sacrifice certain needs that they had been accustomed to in their single life. Because of a family, the women in the stories were asked to be more mature than they actually were, thought of more important things than themselves and asked to understand others in turn. Belonging to a family that is ruled by the male, the lives of the two females could be seen as insignificant in comparison to their husbands. And because their opinions were often unheard, Nancy cannot be blamed for disillusioning herself with the prospect of being the â€Å"queen of the school†; neither can Mrs. Mallard be blamed for her blatant and straightforward yearning for freedom that had been evading him since she was married. Also, the two women could be seen as incomplete because they did not have children with whom to share their happiness with. Nancy had a husband who was busy tending to the needs of the school while Mrs. Mallard had a wife that traveled for business purposes. Both were left to search their own happiness. Word count: 1305 Reference: Achebe, Chinua. (1972). Dead Men’s Path. Girls at War and Other Stories. Harold Ober Associates Incorporated. 30 April 2009. http://www. emcp. com/product_catalog/school/litLink/Grade10/U10-02deadmen/selection. php Chopin, Kate. (1894). The Story of an Hour. 30 April 2009. http://www. vcu. edu/engweb/webtexts/hour/