Like Water for Chocolate by Laura Esquivel :: essays papers

Like Water for Chocolate Some stories are meant for movies, but then again, there are times when I wish some stories remained stories, unless we had a French film director do them. Laura Ezquivel' s novel is a treat. It stays with you as a fine dessert, or a fine food, and she knows it so well, and revels in it. In the film version, this gets lost because it cannot translate. The twelve recipes for each month get reduced to an occasional side story. In the novel, it is the food that brings about the results, and Tita has learned to make the most of the secrets of the culinary delights. The movie couldn't possibly show us how Tita and her mentor ever decided the reasons why such and such a dish were done for whatever occasion. This loss reduces the richness of the story into a film that is missing a third dimension, but never the less, it is still good. Sometimes the food is sad.... the whole table has a tremendous cry upon eating such a magnificent dessert. Other times the food is so hot that the older sister has to leave to cool off, which is not enough even after a cold shower. And trot off she does in the hands of a military opposite to what the mother stands for. Tita's revenge is working. I, personally, love the writing of Laura Ezquivel, much better than I do the movie version. But I think that much of this problem may have been because I saw a version that was DUBBED and the voices were repetitive, unemotional, and so glaringly bland, that it ruined what looks like a good film. It also appears to have taken away the food part of the whole story, which is as tasty as anything else.... it matches the desires in all the film, but then, that must have not been the reason to make a film, or to distribute it to other nations. Superb performances, if you can get by the lousy translations and often screwy sub-titles. Read the novel first, and then watch the film without the voices. But a great novel, nonetheless... see it and read it afterwards.More and more I see less and less in American releases ... the fineness and rhythm of language are just not there . Like Water for Chocolate by Laura Esquivel :: essays papers Like Water for Chocolate Some stories are meant for movies, but then again, there are times when I wish some stories remained stories, unless we had a French film director do them. Laura Ezquivel' s novel is a treat. It stays with you as a fine dessert, or a fine food, and she knows it so well, and revels in it. In the film version, this gets lost because it cannot translate. The twelve recipes for each month get reduced to an occasional side story. In the novel, it is the food that brings about the results, and Tita has learned to make the most of the secrets of the culinary delights. The movie couldn't possibly show us how Tita and her mentor ever decided the reasons why such and such a dish were done for whatever occasion. This loss reduces the richness of the story into a film that is missing a third dimension, but never the less, it is still good. Sometimes the food is sad.... the whole table has a tremendous cry upon eating such a magnificent dessert. Other times the food is so hot that the older sister has to leave to cool off, which is not enough even after a cold shower. And trot off she does in the hands of a military opposite to what the mother stands for. Tita's revenge is working. I, personally, love the writing of Laura Ezquivel, much better than I do the movie version. But I think that much of this problem may have been because I saw a version that was DUBBED and the voices were repetitive, unemotional, and so glaringly bland, that it ruined what looks like a good film. It also appears to have taken away the food part of the whole story, which is as tasty as anything else.... it matches the desires in all the film, but then, that must have not been the reason to make a film, or to distribute it to other nations. Superb performances, if you can get by the lousy translations and often screwy sub-titles. Read the novel first, and then watch the film without the voices. But a great novel, nonetheless... see it and read it afterwards.More and more I see less and less in American releases ... the fineness and rhythm of language are just not there .

Discuss the various ways which Robert Swindells presents life in ‘The streets of London’ Essay

â€Å"I’m invisible see? One of the invisible people.† Link, a young 16 year old boy from Bradford who is homeless, desperate to escape his Brutish stepfather feels that he has become an invisible outcast. Another quotation to support this is when Link says, â€Å"They don’t like reminding I exist.† Link says this to show the reader that he is worthless uses this type of language to make the reader more aware of how difficult it is to live on the streets of London. Link’s character in the book also emphasises a feeling of coldness. An example of this is shown when link says, â€Å"Also I kept seeing people I knew Neighbours. Guys I’d even been at school with. I even saw one of my teachers once. And if you have ever been caught begging by someone who you knew before, you can’t possibly know how low it makes you feel† This also makes the reader think that Link has a very lo self esteem and is very depressed. Another quotation to support this is when Link says, â€Å"I was one of them now – poised at the top of that downward spiral†. Kink says this making the reader understand how hard it is to be living on the streets. Shelter, the less predominant character in the novel, who is trying to rid the streets of homeless people uses subject specific Lexis to show the reader that he has a background in the army or has worked for the army. This is shown to the reader as Shelter always starts his chapters with, â€Å"Daily routine orders†. Link uses sarcasm to emphasise a point, for example, â€Å"Good old Vince†. After Describing Vince as a Brutish, evil stepfather who is a boozer and a bastard, Link says, â€Å"Good old Vince†. The author, Robert Swindells uses this to create an irony. At the beginning of page three Link mentions, â€Å"Born March 20th 1977†¦ to Mr & Mrs X†. Link says this to show the reader that he has forgotten the past and wants to get on with life. The main quotation to support and emphasise this is, â€Å"Mr & Mrs X†. Another statement to support this is when Link says, â€Å"I strode out of the station with my backpack and bedroll, and it felt like a new beginning†. This also shows the reader that link was positive life would improve from what it was with Vince. Another quotation to support this is â€Å"Nobody knows you. Where you’re from and what’s gone before. That’s you’re business†. One other quotation to support this is when Link chooses the name to give to Ginger he says, â€Å"‘Link’ I said. I’d seen it on this signpost earlier. Thames – Link. It’s a railway.† Robert Swindells also uses various techniques to make living on the streets look very hard and scary. The reader is informed of this when Link says, â€Å"Sad is what it is, Sad and scary. You’re leaving a place you know and heading into the unknown with nothing to protect you. This also informs the reader that this novel appears to be tragedy in many respects. Link feels very depressed after applying for many jobs in London and not getting any because he was homeless and was looking rough and scruffy, also looking like a tramp because of sleeping in the same clothes on the solid concrete floor. When Link started living on the streets of London he thought he was a hard boy who everyone would be terrified of after hitting an old bloke but his hopes were soon dashed after he was kicked out of his ‘bedroom’ by the streetwise, tough person he wanted to be. An example of this is shown to us when Link mentions, â€Å"this guy was what I was kidding myself I’d become†. Robert Swindells uses Shelters storyline as a very good way in which to present living on the streets of London. As Shelter goes around London looking for young and old people, whenever Shelter says, â€Å"Hostel† he always manages to get them to his house so that he can kill them. This shows the reader that homeless people are desperate for somewhere comfortable to sleep at. An example of this is when Shelter gets his first client, â€Å"That got him ‘hostel’†¦he fell for it hook line and sinker†. On page twenty-one Shelter also says, â€Å"I am not a murderer at all – I’m a Soldier out of uniform, killing for his country.† After killing a homeless person shelter mentions to the reader that he is not a murderer but a soldier killing for his country. This statement is not true as Shelter has murdered people who have done nothing to him and his country. Shelter thinks he is doing a good thing and is particularly careful about every step he takes. The author, Robert Swindells uses this to create an irony. As the reader gets deeper and deeper into the book, they start to grasp knowledge of Shelters storyline and start to know the feeling of how it is to be homeless and the different setbacks and failures it may have. The reader also learns not to stereotype homeless people.

Boolean Algebra

Basic Engineering Boolean Algebra and Logic Gates F Hamer, M Lavelle & D McMullan The aim of this document is to provide a short, self assessment programme for students who wish to understand the basic techniques of logic gates. c 2005 Email: chamer, mlavelle, [email  protected] ac. uk Last Revision Date: August 31, 2006 Version 1. 0 Table of Contents 1. 2. 3. 4. 5. Logic Gates (Introduction) Truth Tables Basic Rules of Boolean Algebra Boolean Algebra Final Quiz Solutions to Exercises Solutions to QuizzesThe full range of these packages and some instructions, should they be required, can be obtained from our web page Mathematics Support Materials. Section 1: Logic Gates (Introduction) 3 1. Logic Gates (Introduction) The package Truth Tables and Boolean Algebra set out the basic principles of logic. Any Boolean algebra operation can be associated with an electronic circuit in which the inputs and outputs represent the statements of Boolean algebra. Although these circuits may be com plex, they may all be constructed from three basic devices. These are the AND gate, the OR gate and the NOT gate. y AND gate x ·y x y OR gate x+y x NOT gate x In the case of logic gates, a di? erent notation is used: x ? y, the logical AND operation, is replaced by x  · y, or xy. x ? y, the logical OR operation, is replaced by x + y.  ¬x, the logical NEGATION operation, is replaced by x or x. The truth value TRUE is written as 1 (and corresponds to a high voltage), and FALSE is written as 0 (low voltage). Section 2: Truth Tables 4 2. Truth Tables x y x ·y x 0 0 1 1 Summary y x ·y 0 0 1 0 0 0 1 1 of AND gate x 0 0 1 1 Summary y x+y 0 0 1 1 0 1 1 1 of OR gate x y x+y x x 0 1 Summary of x 1 0 NOT gate Section 3: Basic Rules of Boolean Algebra 5 3. Basic Rules of Boolean Algebra The basic rules for simplifying and combining logic gates are called Boolean algebra in honour of George Boole (1815 – 1864) who was a self-educated English mathematician who developed many of t he key ideas. The following set of exercises will allow you to rediscover the basic rules: x Example 1 1 Consider the AND gate where one of the inputs is 1. By using the truth table, investigate the possible outputs and hence simplify the expression x  · 1.Solution From the truth table for AND, we see that if x is 1 then 1  · 1 = 1, while if x is 0 then 0  · 1 = 0. This can be summarised in the rule that x  · 1 = x, i. e. , x x 1 Section 3: Basic Rules of Boolean Algebra 6 Example 2 x 0 Consider the AND gate where one of the inputs is 0. By using the truth table, investigate the possible outputs and hence simplify the expression x  · 0. Solution From the truth table for AND, we see that if x is 1 then 1  · 0 = 0, while if x is 0 then 0  · 0 = 0. This can be summarised in the rule that x  · 0 = 0 x 0 0Section 3: Basic Rules of Boolean Algebra 7 Exercise 1. (Click on the green letters for the solutions. ) Obtain the rules for simplifying the logical expressions x (a) x + 0 which corresponds to the logic gate 0 (b) x + 1 which corresponds to the logic gate x 1 Exercise 2. (Click on the green letters for the solutions. ) Obtain the rules for simplifying the logical expressions: x (a) x + x which corresponds to the logic gate (b) x  · x which corresponds to the logic gate x Section 3: Basic Rules of Boolean Algebra 8 Exercise 3. Click on the green letters for the solutions. ) Obtain the rules for simplifying the logical expressions: (a) x + x which corresponds to the logic gate x (b) x  · x which corresponds to the logic gate x Quiz Simplify the logical expression (x ) represented by the following circuit diagram. x (a) x (b) x (c) 1 (d) 0 Section 3: Basic Rules of Boolean Algebra 9 Exercise 4. (Click on the green letters for the solutions. ) Investigate the relationship between the following circuits. Summarise your conclusions using Boolean expressions for the circuits. x y x y (a) (b) x y x yThe important relations developed in the above exer cise are called De Morgan’s theorems and are widely used in simplifying circuits. These correspond to rules (8a) and (8b) in the table of Boolean identities on the next page. Section 4: Boolean Algebra 10 4. Boolean Algebra (1a) x ·y = y ·x (1b) x+y = y+x (2a) x  · (y  · z) = (x  · y)  · z (2b) x + (y + z) = (x + y) + z (3a) x  · (y + z) = (x  · y) + (x  · z) (3b) x + (y  · z) = (x + y)  · (x + z) (4a) x ·x = x (4b) x+x = x (5a) x  · (x + y) = x (5b) x + (x  · y) = x (6a) x ·x = 0 (6b) x+x = 1 (7) (x ) = x (8a) (x  · y) = x + y (8b) (x + y) = x  · ySection 4: Boolean Algebra 11 These rules are a direct translation into the notation of logic gates of the rules derived in the package Truth Tables and Boolean Algebra. We have seen that they can all be checked by investigating the corresponding truth tables. Alternatively, some of these rules can be derived from simpler identities derived in this package. Example 3 Show how rule (5a) can be deriv ed from the basic identities derived earlier. Solution x  · (x + y) = = = = = x  · x + x  · y using (3a) x + x  · y using (4a) x  · (1 + y) using (3a) x  · 1 using Exercise 1 x as required. Exercise 5. Click on the green letter for the solution. ) (a) Show how rule (5b) can be derived in a similar fashion. Section 4: Boolean Algebra 12 The examples above have all involved at most two inputs. However, logic gates can be put together to join an arbitrary number of inputs. The Boolean algebra rules of the table are essential to understand when these circuits are equivalent and how they may be simpli? ed. Example 4 Let us consider the circuits which combine three inputs via AND gates. Two di? erent ways of combining them are x y z and x y z x  · (y  · z) (x  · y)  · z Section 4: Boolean Algebra 13However, rule (2a) states that these gates are equivalent. The order of taking AND gates is not important. This is sometimes drawn as a three (or more! ) input AND gate x y z x ·y ·z but really this just means repeated use of AND gates as shown above. Exercise 6. (Click on the green letter for the solution. ) (a) Show two di? erent ways of combining three inputs via OR gates and explain why they are equivalent. This equivalence is summarised as a three (or more! ) input OR gate x y z x+y+z this just means repeated use of OR gates as shown in the exercise. Section 5: Final Quiz 14 5. Final Quiz Begin Quiz 1.Select the Boolean expression that is not equivalent to x  · x + x  · x (a) x  · (x + x ) (b) (x + x )  · x (c) x (d) x 2. Select the expression which is equivalent to x  · y + x  · y  · z (a) x  · y (b) x  · z (c) y  · z (d) x  · y  · z 3. Select the expression which is equivalent to (x + y)  · (x + y ) (a) y (b) y (c) x (d) x 4. Select the expression that is not equivalent to x  · (x + y) + y (a) x  · x + y  · (1 + x) (b) 0 + x  · y + y (c) x  · y (d) y End Quiz Solutions to Exercises 15 Solutions to Exercise s Exercise 1(a) From the truth table for OR, we see that if x is 1 then 1 + 0 = 1, while if x is 0 then 0 + 0 = 0.This can be summarised in the rule that x + 0 = x x 0 Click on the green square to return x Solutions to Exercises 16 Exercise 1(b) From the truth table for OR we see that if x is 1 then 1 + 1 = 1, while if x is 0 then 0 + 1 = 1. This can be summarised in the rule that x + 1 = 1 x 1 Click on the green square to return 1 Solutions to Exercises 17 Exercise 2(a) From the truth table for OR, we see that if x is 1 then x + x = 1 + 1 = 1, while if x is 0 then x + x = 0 + 0 = 0. This can be summarised in the rule that x + x = x x x Click on the green square to return Solutions to Exercises 18Exercise 2(b) From the truth table for AND, we see that if x is 1 then x  · x = 1  · 1 = 1, while if x is 0 then x  · x = 0  · 0 = 0. This can be summarised in the rule that x  · x = x x x Click on the green square to return Solutions to Exercises 19 Exercise 3(a) From the truth t able for OR, we see that if x is 1 then x + x = 1 + 0 = 1, while if x is 0 then x + x = 0 + 1 = 1. This can be summarised in the rule that x + x = 1 x 1 Click on the green square to return Solutions to Exercises 20 Exercise 3(b) From the truth table for AND, we see that if x is 1 then x  · x = 1  · 0 = 0, while if x is 0 then x  · x = 0  · 1 = 0.This can be summarised in the rule that x  · x = 0 x 0 Click on the green square to return Solutions to Exercises 21 Exercise 4(a) The truth tables are: x y x y 0 0 0 1 1 0 1 1 x y 0 0 0 1 1 0 1 1 x+y 0 1 1 1 x 1 1 0 0 y 1 0 1 0 (x + y) 1 0 0 0 x  ·y 1 0 0 0 x y From these we deduce the identity x y (x + y) = x y x  ·y Click on the green square to return Solutions to Exercises 22 Exercise 4(b) The truth tables are: x y x y 0 0 0 1 1 0 1 1 x y 0 0 0 1 1 0 1 1 x ·y 0 0 0 1 x 1 1 0 0 y 1 0 1 0 (x  · y) 1 1 1 0 x +y 1 1 1 0 x y From these we deduce the identity x y (x  · y) = x y x +y Click on the green square to returnSoluti ons to Exercises 23 Exercise 5(a) x+x ·y = x  · (1 + y) using (3a) = x  · 1 using Exercise 1 = x as required. Solutions to Exercises 24 Exercise 6(a) Two di? erent ways of combining them are x y z and x y z However, rule (2b) states that these gates are equivalent. The order of taking OR gates is not important. x + (y + z) (x + y) + z Solutions to Quizzes 25 Solutions to Quizzes Solution to Quiz: From the truth table for NOT we see that if x is 1 then (x ) = (1 ) = (0) = 1, while if x is 0 then (x ) = (0 ) = (1) = 0. This can be summarised in the rule that (x ) = x x x End Quiz Test: â€Å"Study Guide Algebra†