Assimilation the Risk of Losing Culture and Identity Essay Example for Free

Assimilation the Risk of Losing Culture and Identity Essay Blacks should not assimilate with the popular dominant culture but instead maintain their own sense of cultural heritage. The black person who makes the choice to integrate into the dominating culture really must be honest with his or her self and admit that all their pronouncements of concern for the welfare of the black community take a backseat to their personal desire to assimilate. These black people are more of a role model to other black people on how to assimilate or integrate into the colorless and racially generic whole of American culture that just so happens to be controlled and dominated from the white community. Although it may sound wonderful to hear someone say that they don’t notice people’s skin color, reality says that people notice color all the time. The pressure placed on blacks by the dominant culture forces them to move toward assimilation hooks urges. ell hooks states that â€Å"One of the most tragic manifestations of the pressure black people feel to assimilate is expressed in the internalization of racist perspectives† (227). Young blacks need to realize that conforming to the dominant culture is not necessary to exist within it. hooks says that â€Å"It is crucial that those among us who resist and rebel, who survive and succeed, speak openly and honestly about our lives and the nature of our personal struggles† (221). In order to resist assimilation black people as a hold need to be more open and honest about the struggles that take place striving for education and success, those who have blazed the trail need to reach back and help those striving to get there. An excellent job is done by hooks in getting the point across about assimilations effects, and also gives those who have chosen to assimilate something to think about, what cost is one willing to pay, is one willing to break family ties and friendship because of the pressure from the dominant culture to assimilate. The pressures of trying to maintain family and community ties and succeeding in life are difficult, these issues gives us some groundwork to fix some of the problems. While it is difficult to achieve education and success while keeping community ties it is possible, hooks says that â€Å"The most powerful resource anyone can have to study and teach in university settings is full understanding and appreciation of the richness, beauty, and primacy of our familial and community backgrounds† (228). ooks has some very valid points, everyone has to look at them and put them into perspective on how it can fit into their lives. There is not one right answer or solution to this problem, everyone has to search within to find a solution, but those whom have traveled on this road less taken have an obligation to teach those who follow. It is imperative to let the youth know that their struggles for identity and success or not in vein and show them that they are appreciated within the comm unity. Without the bounding and nourishment needed to continue the ties, youth will continue to choose to assimilate and take the easy road with less pressure and headaches to deal with. Blacks could better serve the community by assimilating to the dominant culture forces, the melting-pot theory. This view is advantageous to both a government and its people. It is believed that the nation has reached its present state of development because it has been able to forge one national identity. Separating citizens by ethnicity or race and providing special privileges to Blacks can be harmful, where assimilation tends to put everyone on an even playing field. By keeping ties to community and family Blacks draw attention to differences and the dominant culture fosters resentment towards their culture. Blacks in society that make a full effort to be incorporated into the mainstream naturally reciprocate the benefits and approval from mainstream America. Blacks become successful by shedding their cultural heritage and adopting the ways of the popular dominant culture. Typically Blacks absorbed by the ways of the host society, while loosening to varying degrees their connection to their native culture become highly successful. Through this process Blacks are accepted into society and become a part of the dominant culture and national unity is retained. Works Cited: Assimilation: Does it hurt Black people? (2007) Retrieved on 2/10/2008, from www. topix. com/forum/afam/TPIKF7CB1VN57ONEJ Bell Hooks (2000), Where We Stand: Class Matters, By Routledge

Strengthening the Learning Process through Music Essay -- education, co

Introduction: Music is said to influence the process of thinking and learning by motivating the student to think better, analyze faster and work more efficiently. Studies have shown that just listening to music is beneficial. However, it is the participating fully in music, the singing and playing of music that strengthens the learning process. Exposure through lessons and other activities may help students to explore and boost their confidence and help them achieve more success in their endeavors. The fact is, music is an important avenue to individual success. Music should be available to all students in all schools, because it holds such an influential place in academic structure (Children’s Music Workshop Music’s 1). Wilber-Clatonia High School should mandate that all students take at least one semester of vocal and one semester of instrumental music in high school. Music is a universal language, which speaks to a whole variety of people cutting though racial, cultural, social, educational, and economic barriers. It has become an expression for many cultures. The oldest artifacts show people playing musical instruments over four thousand years ago. Men and women through time have been moved by the powerful words and beats that musicians have created to provoke emotions. However, no matter how much music may have differed, it seems that music served a common purpose: to bring people together. By bringing people together fills a student’s â€Å"bag† with self-motivation, assessment and practical application. It allows a person to take a look at the world and appreciate what people do and to have a deep-understanding of the world. This is very important in the world of music because it is culturally diverse. Students experience thi... ...s. â€Å"Creativity.† University of Missouri-Kansas City. 1998. Web. 23 Nov. 2011. Intelligent Life on the Web. â€Å"How Does Music Affect The Brain.† Buzzle.com. 2011. Web. 28 Nov. 2011. IsyB Family. â€Å"Music and Sound Therapy as a Treatment for Autism.† Isybee Autism. 27 April 2011. Web. 26 Nov. 2011. Lanaki9. â€Å"Amazing Grace – Whitley Phipps.† Youtube. 6 Feb. 2007. Web. 23 Nov. 2011. Lennon, John. The White Album. EMI and Trident Studios, 1968. CD. Reid, Harvey. â€Å"On Mathematics and Music.† Woodpecker Records. Web. 26 Nov. 2011. ThinkQuest. â€Å"Math and Music.† Oracle Education Foundation. Web. 23 Nov. 2011. Wilber-Clatonia Public Schools. â€Å"Graduation Requirements.†  ¬Ã‚ ¬Wilber-Clatonia School Board. Wilber: Wilber-Clatonia Public Schools, 2011. Yoh, William H. â€Å"The Cornerstone to a Well Rounded Individual.† Santa Teresa Music and Arts Association. 2008. Web. 23 Nov. 2011.

Maupassant’s Use of Setting in The Necklace Essay

In the story The Necklace, Guy De Maupassant uses the settings to further heighten the dramatic effect of the change in the character of Mathilde Loisel. At the various stages of Mathilde’s character’s transformation, the setting complements to reflect her actions and emotions. At the start of the story, Mathilde is depicted as having accepted her lot, knowing she has beauty but that her station in life granted her nothing more than a life married to a clerk. She still daydreams of luxurious parlors and exquisite food as she moves around her own home with its simple furniture. The Mathilde depicted here is a girl who still has fantasies of escaping her present situation, and Maupassant’s juxtaposition of the images of the lavish setting with the vestibules with Oriental trapestries and large parlors adorned with olden silk with Mathilde’s dreary reality of worn walls and abraded chairs strike a strong contrast between her desires and her inescapable circumstance. When Mathilde went to the party, she was changed – she became truly the girl that she was meant to be, desired and sought after, in a place she felt she belonged. Although Maupassant did not detail it, the reader can imagine extravagant ornaments, crystal chandeliers, and blatant affluence everywhere, lifting Mathilde’s spirits up as her dreams came true: that night she was Cinderella at the ball. But she knew it was a dream, because the other women had furs and she had wraps that spoke of her true station in life. And to bring her feet back on the ground, when she got back home – to the dreary place seemingly more dreary now after all the glamour of the mansion – she discovers she lost the necklace. Their home full of wanting etched its emptiness even more with the realization that she was missing something very valuable, something that was worth more than anything she has. And then, she comes to accept reality – she cannot afford the luxurious life, and because of her whims and fantasies she has cost them a fortune they did not have in the first place. To make up for her behavior, she threw herself to work – her pink nails scrubbed themselves hard in the kitchens where it was dirty with greasy pans and dark-bottomed pans. Here we see Mathilde’s descent – she came into terms with her social status and acted like it. She no longer fancied herself a woman out of place meant for better things, above the needy and the poor common people. They left their house and stayed at the attic; she went to the market and threw water on streets. In the kitchen, in the market, in the attic, she became one of them. And finally, when they have repaid all their debts because of the necklace, we find Mathilde walking at the Champs Elysà ©es for leisure after a week’s hard labor, triumphant because now she is a free woman. The Champs Elysà ©es is hailed the most beautiful avenue in the world, and it is only fitting that Mathilde meet her old friend here. She was no longer the beauty that she was, she was no longer desirable nor recognizable, but she gained a new beauty within: she was her own woman now, strengthened by hard life, and with a firm grasp of reality and newfound pride having paid her dues. And with that pride she went up to her old friend, the same moneyed lady from before. Mathilde stood out in the luxury of Champ Elysà ©es’s beauty, and yet momentarily we saw her transformed again because after all these years of hard work, it was still her foolishness and pride that cost her own beauty and charm. But more than anything, it felt that she belonged there amidst all that glory, because after working herself to that state of being one of the poor as she saw them, as one all her hard work has gained her the richness that she always dreamed of in her younger days.

Simulation of Heap File Operations - Free Essay Example

Sample details Pages: 11 Words: 3227 Downloads: 4 Date added: 2017/06/26 Category Finance Essay Type Argumentative essay Did you like this example? Simulation of Heap File Operations Synopsis (Abstract) The Project demonstrates the simulation of heap file operations and its cost management, by displaying the time taken to complete the selected operations. Various operations such as scanning, insertion, deletion and searching are performed for heap file in this project. In heap file, all the records are stored in chronological order, i.e. Don’t waste time! Our writers will create an original "Simulation of Heap File Operations" essay for you Create order the data is stored as and when it comes in the last, i.e. at the end of the file. There is no sorting applied to the heap files. Due to this, heap file is the most efficient file organization system for applications which have more and more number of insertions and very less deletions and searching. For Deletion, the required page is searched by scanning the whole file. The whole file has to be scanned as the data is not in sorted order and the file can be found anywhere in the file. The record to be deleted is identified using RID (Record Identifier). Once a record is deleted, the data below it shifts up a place in database to accommodate the empty space in middle. Hence all the empty spaces are available at the end of the file in heap file organization. Searching in heap files can be done in 2 ways, Searching with equality and Searching within range. In search with equality, a particular record is to be searched based on the equality condition. In searching within range, a range is given and the records between that ranges is displayed. In heap file organization, only insertion is the most efficient and faster operation. Rest all operations takes a lot of time as they have to scan the whole record due to its unsorted data. Hence heap file organizations are best used in applications which have large number of insertions and very less number of deletions or searching. Examples for the applications can be any statistical information collecting application, such as traffic monitoring or population statistics. Where insertions can be per minute or per day, and fetching or searching can be per day or per year. Heap file is the simplest method for storing data base file. Every operation has different method to calculate cost model. For calculation of cost model, we used four parameters B, R, C, D. B denotes number of pages fully occupied page, R denotes number of records, D denote average time to perform read and write operation, C denotes average time to perform da tabase operation. The methodology is simple for heap file organization. For simulation purpose and to show how the heap file organization works, MySql database has been used. The data is inserted always at the end. For this, No primary key is assigned, hence data is not sorted and inserted always at the end of the table. Any deletion in the table, all the data below it shifts up. For any scanning or searching operation, we have to scan the whole table. To achieve this. We have used simple MySql queries with java programming language, which is connected to MySql using JDBC connectivity drivers. For the front end design, NetBeans IDE have been used. NetBeans provides various inbuilt packages which can be used for the efficient work on databases. Like DBUtils have a tool which converts resultset table data into the Jtable of NetBeans. The cost model is calculated using java programming languages basic time calculation tools. The main outcome of the project is that, we have achiev ed the proper working of all the basic operations of heap file organizations such as insertions, deletions, searching and scanning. And all these operations are handled through the well-designed front end. And the cost model of these operations are also calculated and displayed to the user in the front end as and when any operation is performed. Chapter 1: Introduction 1.1 Pre-amble: The Background work for the heap file organization is very less, as this file organization is not very efficient for most of the daily used application. All the daily used application requires more and more of searching, fetching and deletion of data, which works really slow in heap file organization due to its unsorted nature. Hence the heap file canà ¢Ã¢â€š ¬Ã¢â€ž ¢t be used for most of the day to day applications. But it can be used in statistical applications such as population survey, traffic monitoring etc. where data insertions are far more than deletions or searching. Basically these a pplications donà ¢Ã¢â€š ¬Ã¢â€ž ¢t have proper user interfaces defined to them as they concentrate more on data than user interface. They donà ¢Ã¢â€š ¬Ã¢â€ž ¢t have the mechanism to calculate the cost incurred for the operations on insert, delete and searching. Hence, in our application we created an application with well-designed User interface which can store data in the heap file and calculate and show the cost incurred for the various operations. It will also show the contents of the Database in real time as and when the data is inserted or deleted. 1.2 Literature Review: 1.3 Problem Statement: Simulate and show how the data is stored in a heap file organization by performing basic operations. Basic operations to be performed on a heap file includes insertion, deletion, searching with equality and searching within range, and scanning. Calculate the cost model for each and every operation. Represent the cost model in a graph for bulk record insertions. 1.4 Methodology Adopted: To simulate and show how the data in inserted and stored in a heap file, we have used MySql database. In MySql , we have created a table without any primary key, as a primary key sorts the data as per the tuples in that column , and hence it does not satisfies the heap file structure. The front end is designed in NetBeans and coded using java programming language. The front end is connected to back end using the Java Data Base Connectivity (JDBC), which is a standard API that allows java programs to access database management systems. TheJDBCAPI consists of a set of interfaces and classes written in the Java programming language. 1.5 Technical Features: Simulate and shows the working of heap file organizations, i.e. shows how the records are stored in database in a heap file. Shows in real time in the front end that the insertion always happens at the end of the file and no sorting mechanism is involed. Shows how the deletion is performed in a heap file, i.e. after scanning the whole file for a particular Record Identifier (RID). Shows how searching with equality and searching within range works through front end visualization. NetBeans IDE is used for the front end design. MySql is used for the database management system. JDBC is used for connecting the java programming language used in NetBeans to the MySql. Chapter 2 : Project Description In this simplest and most basic type of organization,records are placed in the file in the order in which they are inserted, so new records are inserted at the end of the file. Such an organization is called a heap or pile file. This organization is often used with additional access paths, such as the secondary indexes. It is also used to collect and store data records for future use. Inserting a new record is very efficient. The last disk block of the file is copied into a buffer, the new record is added, and the block is then rewritten back to disk. The address of the last file block is kept in the file header. However, searching for a record using any search condition involves a linear search through the file block by blockà ¢Ã¢â€š ¬Ã¢â‚¬ an expensive procedure. If only one record satisfies the search condition, then, on the average, a program will read into memory and search half the file blocks before it finds the record. For a file of b bl ocks, this requires searching (b/2) blocks, on average. If no records or several records satisfy the search condition, the program must read and search all b blocks in the file. To delete a record, a program must first find its block, copy the block into a buffer, delete the record from the buffer, and finally rewrite the block back to the disk. This leaves unused space in the disk block. Deleting a large number of records in this way results in wasted storage space. Another technique used for record deletion is to have an extra byte or bit, called a deletion marker, stored with each record. A record is deleted by setting the deletion marker to a certain value. A different value for the marker indicates a valid (not deleted) record. Search programs consider only valid records in a block when conducting their search. Both of these deletion techniques require periodic reorganization of the file to reclaim the unused space of deleted records. During reorganization, the file blocks a re accessed consecutively, and records are packed by removing deleted records. After such a reorganization, the blocks are filled to capacity once more. Another possibility is to use the space of deleted records when inserting new records, although this requires extra book keeping to keep track of empty locations. We can use either spanned or unspanned organization for an unordered file, and it may be used with either fixed-length or variable-length records. Modifying a variable length record may require deleting the old record and inserting a modified record because the modified record may not fit in its old space on disk. The cost model of a heap file can be calculated using 4 variables, i.e. B, R, C, D. B denotes number of pages fully occupied page, R denotes number of records, D denote average time to perform read and write operation, C denotes average time to perform database operation. Let us see the theoretical cost model calculations in a heap file with respect to differe nt operations: Scan: The cost is B (D+RC) because we must retrieve each of B pages taking time D per page, and for each page, process R records taking time C per record. Search with Equality Selection: Suppose that we know in advance that exactly one record matches the desired equality selection, that is, the selection is specified on a candidate key. On average, we must scan half the file, assuming that the record exists and the distribution of values in the search field is uniform. For each retrieved data page, we must check all records on the page to see if it is the desired record. The cost is O.5B (D + RC). If no record satisfies the selection, however, we must scan the entire file to verify this. If the selection is not on a candidate key field (e.g., Find employees aged 18), we always have to scan the entire file because records with age = 18 could be dispersed all over the file, and we have no idea how many such records exist. Search with Range Selection: The entire file must be scanned because qualifying records could appear anywhere in the file, and we do not know how many qualifying records exist. The cost is B (D + RC). Insert: we assume that records are always inserted at the end of the file.  ¥e must fetch the last page in the file, add the record, and write the page back. The cost is 2D +C. Delete: We must find the record, remove the record from the page, and write the modified page back. We assume that no attempt is made to compact the file to reclaim the free space created by deletions, for simplicity. The cost is the cost of searching plus C + D. We assume that the record to be deleted is specified using the record id. Since the page id can easily be obtained from the record id, we can directly read in the page. The cost of searching is therefore D. If the record to be deleted is specified using an equality or range condition on some fields, the cost of searching is given in our discussion of equality and range selections. The cost of deletion is also affected by the number of qualifying records, since all pages containing such records must be modified. The NetBeans provide various tools to design an efficient front end, and java programming provides large number of interfaces and classes to perform operations on databases using JDBC. The resultsets are used to take results from database and display it in the front end. And NetBeans have a package called DButils which helps in converting the ResultSet table data into the NetBeans table data. An SQLresult setis a set of rows from a database, as well as metadata about the query such as the column names, and the types and sizes of each column. Depending on the database system, the number of rows in theresult setmay or may not be known. In short, the overview of Heap file in points: Simplest and most basic method insert efficient, with new records added at the end of the file, providing chronological order retrieval inefficient as searching has to be linear deletion is accomplished by marking selected records as deleted requires periodic reorganization if file is very volatile (changed frequently) Advantages efficient for bulk loading data efficient for relatively small relations as indexing overheads are avoided efficient when retrievals involve large proportion of stored records Disadvantages not efficient for selective retrieval using key values, especially if large sorting may be time-consuming not suitable for volatile tables Chapter 3: Software Requirement Specification This chapter deals with the software and hardware requirements for our application. All applications have their own software and hardware requirements based on the work they perform and tools they use. The Hardware requirements gives the minimum amount of hardware required to run the application efficiently without any hitches. The hardware requirements include processor, ram, Hard Disk space etc. The software requirement gives the details about the required tools, languages, database management systems and their versions which are compatible for this application. 3.1 Introduction: 3.2 Hardware and Software Requirements: Hardware Requirements: Processorà ¢Ã¢â€š ¬Ã¢â‚¬Å" Dual Core (minimum), Quad Core (Recommended). RAM à ¢Ã¢â€š ¬Ã¢â‚¬Å" 1gb (minimum), 2gb (Recommended). Storage à ¢Ã¢â€š ¬Ã¢â‚¬Å" 500mb (minimum), 750mb (Recommended). Software Requirements: Ubuntu 14.04 LTS Netbeans 6.7 or higher. Java Programming Language (openjdk-6). JDBC Connector. DBUtil package in NetBeans. 3.3 Functional Requirements: Introduction : The most basic functional requirement to show the working of heap file is data. Every application needs data to act upon. Here we will have student records to be inserted into a heap file. There will be a field to get student id for equality search and lower and upper limits for range search. There will be buttons to select any particular operation to be performed. There will be table views in front which show the real time output of how the data is stored in the database. Input: The inputs are Student Id, Student Name, Semester and marks. All these details are inserted with every student record. All these inputs are provided at the front end i.e. User Interface provided by the Application. For searching with equality, we will need a student id as an input to search the student with that particular student id. For searching within range, we need upper limit and lower limit of the range, to get all the records which comes within that range. There will be separate buttons for all the operations, clicking on the button will perform a particular operation Processing: Once the inputs are given, the inputs are processed from the front end and passed to the database through Sql queries. The queries are created in java programming languages and passed to MySql through JDBC connector/Driver. For all the operations, cost will be calculated as soon as the operation is performed. Output: After processing, the output is generated at the front end which shows the real time working of the database and where the recently added data is stored (i.e. at the end of the file in our heap file application). It will also show the cost model calculated during the processing time for that particular operation. 3.4 External Interface Requirements: Java Database Connectivity(JDBC): The JDBC have pre-defined interfaces and methods to perform various operations on database management systems. Queries are prepared using the statements and those statements are used to execute the query with methods like executeQuery(). ResultSets is a set of rows from a database, as well as metadata about the query such as the column names, and the types and sizes of each column. Depending on the database system, the number of rows in theresult setmay or may not be known. DataBase Utility(DBUtil): The ResultSet returns the contents of the database table in rows and colums. To convert the table details stored in ResultSet into the table model of NetBeans, an external package is implemented called DBUtil. DButil consists of a method called ResultSetToTableModel(arg), which takes one argument of ResultSet type. 3.5 Performance Requirements: The Performance of our application is totally dependent on the basis of the operations performed on it. If the operations include large number of insertions, this application provides the fastest and efficient way for it. But if there are more number of deletion and searching operation, the performance of this application may reduce as compared to the insertion operations. All this is due to the structure of Heap files, where insertions are performed faster, as the records are stored at the end of the file and it doesnà ¢Ã¢â€š ¬Ã¢â€ž ¢t have to follow any sorted mechanism. Whereas any deletion or searching operation requires the whole file to be scanned to search for the desired record. 3.6 Design Constraints: Primary key not to be used, as it will sort the file on which it has been used. Deletions and searching operations should be performed rarely. Chapter 4: Design Specification 4.1 Architectural Design: 4.2 System Design: 4.3 Detailed Design: Chapter 5: Testing and Results 5.1 Testing: Unit Testing: Unit testingis a softwaretestingmethod by which individual units of source code, sets of one or more computer program modules together with associated control data, usage procedures, and operating procedures are tested to determine if they are fit for use. In out applications, all the operations performed on heap file such as insertion, deletion etc are all created in separate units. Each of which is tested separately if they are fit to be used or not. Integration Testing: Integration testing(sometimes calledintegrationandtesting, abbreviated IT) is the phase in softwaretestingin which individual software modules are combined andtestedas a group. In our application, after unit testing, we integrate all those units i.e. operations into one application and check if they working fine together. 5.2 Results: 5.3 Conclusion: This application demonstrates the simulation of how the data is organized in heap file organizations and how various operations are performed on it. This application also calculates the cost model and shows how much time a particular operation took, to perform the given task. The heap file organization gives best and efficient results for insertions. Whereas deletion and searching takes more time insertion takes. Hence, this application proves that heap files are best for the applications where insertions are too many and deletions/searching is too less, for example, in statistical applications such as population survey, traffic monitoring etc. This application provides a user friendly front end to see the real time working of heap files and how the inserted data is arranged in a heap file to make user understand the concept of heap file in a better way. References Annexure Department Of MCA, RVCE1