Japan Town in San Francisco Essay Example | Topics and Well Written Essays - 750 words

Japan Town in San Francisco - Essay Example The Japan Center, though looks quite conventional, has many delightful restaurants and shops, stairways and open courtyards and is considered as the focal point of Japanese culture in the middle of San Francisco. The Peace Pagoda, designed by the famous Japanese architect Yoshiro Taniguchi, is a five-storied stupa which is a contribution by the people of Osaka, Japan to San Francisco. San Francisco's Japantown share its borders with California, Geary, Octavia, and Fillmore Streets. It has about 150 small and medium sized businesses with plentiful affordable housing complexes for seniors. It also has non-profit organizations like the Japanese Cultural and Community Center of Northern California, Kimochi Senior Center, Nihonmachi Little Friends (preschool), national headquarters for the Japanese American Citizens League, the Japantown Task Force, the Japanese Benevolent Society, and the Ikenobo Ikebana Society of America. (2000 Census, 2006) History: The first Japanese also called as Soko' resided in San Francisco during early 1860s. Initially they lived in Chinatown and in neighborhoods south of Market Street. Post the disastrous earthquake and fire in 1906, these Soko's started moving to the Western Addition where they opened their own centers of prayers and typical Japanese shops and restaurants. The area slowly started to look Japanese in every manner and was soon looking like a Ginza which was later known as Nihonmachi, or Japantown. It was the dawn of San Francisco's Japanese American community. San Francisco, California houses the largest Japantown in United States of America. However, it is smaller than the one which was prevalent in United States prior to the World War II. It so happened that after the invasion on Pearl Harbor by Japanese, the US authorities took Japanese Americans into custody and put them in concentration camps. At the same time, African Americans encroached on the vacant neighborhood. These thousands of African Americans had come in search of wartime industrial jobs. However, after the war, Japanese Americans returned along with Japanese immigrants closely followed by investments from the Japanese government as well as Japanese companies. Owing to the redevelopment plans by Justin Herman in the 1960 to 1980, the African Americans were relocated to places like Fillmore district in the west, Tenderloin in the east and Hunters Point in the south. At this point of time, many residents of San Francisco decided against returning after the World War II resulted in forced captivity of Japanese Americans - some being probably second or third generation Americans since 1942-45. About one-third of the internees decided to relocate themselves in the East and Midwest after the encouragement of the War Relocation Authority. During the period of 1950's, JapanTown was negatively impacted by this redevelopment due to the widening of Geary Boulevard and the obliteration of scores of Victorians for the construction of the boulevard and the Japan Center Mall. Inspired by the conventional Japanese pedestrian walkways, the famous Webster Bridge was also designed. The Miyako hotel at Post and Laguna has a charming Japanese garden. Also seen is one of the favourite destinations, the twin origami-style fountain in the middle of the one block open air mall which extends from Peace Plaza north toward Pacific

Combining risk assessment and value engineering (this is project risk Essay

Combining risk assessment and value engineering (this is project risk management class) - Essay Example ng is an important technique that helps in the identification and elimination of unnecessary costs in construction, product design, manufacturing, operations, practices and processes. For over sixty years of existence and use, value engineering is referred to by different names. While some people refer to it as value engineering, others call it value analysis, value methodology or value management. However, the reference to value engineering in different terminologies does not change its concept. The concept of value engineering as a systematic process can be used to improve a projects value through a critical analysis of its functions by a multidisciplinary team. Value refers to the equivalent in goods, money, services or a fair return for something exchanged. It is most often represented in the relationship indicated below: The function is measured by the customer performance requirements while the resources are measured in labour, materials, time, price and many other elements that are essential for the accomplishment of the function. In a value methodology, the focus is primarily on how to improve value through the identification of alternative ways of reliably accomplishing a function that meets the customers performance expectations. A job plan in the systematic process of value engineering outlines the specific steps used to evaluate an issue and attain the maximum feasible alternatives that address the issue in consideration. The issue being considered could be a particular event risk(s) that potentially can be dealt with through value engineering in the context of risk assessment (Cretu, Stewart and Berends, 2011). The analysis of functions, as done by a multidisciplinary team through the application of value engineering, helps to improve the value of a project. The multidisciplinary team is a value engineering team that comprises the project stakeholders and experienced professionals. The team members are chosen based on their experience and expertise

Three Symbols in the Great Gatsby Essay Example for Free

Three Symbols in the Great Gatsby Essay â€Å"The Great Gatsby† to criticise America from straying from the â€Å"American Dream†. Typically the American society tries to follow the American Dream, which is a dream of a society that allows everyone, no matter what economic class they were born into, to be able to accomplish whatever they want with hard work. With this principle no matter their social class Americans should be able to accomplish anything. Fitzgerald thought that the American society wasn’t following the American dream; he successfully used symbols to criticize different aspects of American society, showing the weakness of each deviation from the American Dream. Many symbols were used, but the three most significant symbols were: the â€Å"green light†, the godliness of the eyes of Dr. T. J. Eckleburg and the sadness of the â€Å"Valley of Ashes†. Each symbol played a key role in Fitzgerald’s criticism. How did these symbols play a key role in Fitzgerald’s criticism of the American society that doesn’t follow the American Dream? The first of the three symbols, the green light, was a powerful tool in which Fitzgerald used to criticise the loss of the American Dream from the American society. The green light was important because it represented the endless â€Å"hope† of which the American Dream promises. The hope for a desire should never be lost if the American Dream is followed correctly; Fitzgerald showed that this isn’t always true in the American society by showing that Gatsby’s hope fades away when he realizes because of class distinction he will never be able to marry Daisy. Fitzgerald emphasizes this though Nick Caraway, his narrator, who observes: -â€Å"Possibly it had occurred to him that the colossal significance of that light had now vanished forever. † (The Great Gatsby, pg. 125) Fitzgerald used Nick to show as Gatsby begins to realize that Daisy will never leave Tom and go with him, that the green light slowly begins to fade and symbolically so does his hope, his hope was what kept him going and now it was gone he had nothing to live for. When Gatsby’s hope dies does his will to live dies also. Gatsby realizes that because he wasn’t born in the upper class he wouldn’t be able to accomplish his dream. A green light means go, but in this case Gatsby has had to stop, thus stoping his hope and his American Dream. Fitzgerald is then able to symbolise how the American Dream has â€Å"stoped† in the American society. How did this play a key role in the criticism of the American society? It allowed the reader to see that even though some Americans work their hardest for something they were still not able to accomplish their dream because of the class they were born into, this completely goes against the American dream thus allowing Fitzgerald to criticise the American society on this aspect of the American society. The eyes of Dr. T. J. Eckleburg symbolizing God’s eyes watching over the people played a key role in the criticism of the American society because the reader was able to view the actions of various characters as being contrary to what God would agree with. Fitzgerald could then use the reader’s dislikes of the behaviour of the characters to inturn dislike the society. The readers disliking the society allowed Fitzgerald to criticise the American society more effectively. In order for a successful criticism the reader needs to agree with the criticism. If a reader sides with the group that is being criticised they probably won’t agree with the criticism, but with Fitzgerald using the eyes of Dr. T. J Eckleburg he was able to make the reader dislike the society, and in turn the reader wouldn’t want to side with them. The symbolism of the eyes of Dr. T. J. Eckleburg was made clearer to the reader when Michales looked to the billboard in the following quote: -â€Å"Standing behind him, Michales saw with a shock that he was looking into the eyes of Dr. T. J. Eckleburg. †( The Great Gatsby, pg. 152 ) Michales realizing the symbolism of the eyes of Dr. T. J. Eckleburg allowed the reader to realize this symbolism too. The reader than could decide that some actions of some characters were immoral. Fitzgerald went on to write that the sign was faded. This symbolized that god was leaving the hearts of the people allowing the reader to find more fault in the American society. Why were the eyes of Dr. T. J Eckleburg one of the most important symbols in the criticism of the American dream? For Fitzgerald to show that the society was doing things against God’s will, depicts that what they are doing is very immoral. A religious reader will probably want to side with what God judges so they would also think that some characters in the American society were immoral. The reader would then be more against the American society allowing Fitzgerald to better criticise it because the reader won’t be trying to defend it if they were against it. The American Dream allows all Americans the same opportunities for self improvement. The Valley of Ashes was a key force in the criticism of the American Dream because it was used in two literary devices of setting and symbolism. Fitzgerald by establishing the setting in the Valley of Ashes allowed the reader to better relate to the working class because they could see a very detailed picture of the daily life of the working class. The Valley of Ashes depicts the working class as not getting the same opportunities as the upper class for self improve. The working class will probably stay in the working class forever and so will their children. Fitzgerald tells this with the use of his narrator Nick Caraway’s description of the Valley of Ashes -â€Å"But above the gray land and the spasms of bleak dust which drift endlessly over it†¦Ã¢â‚¬  (The Great Gatsby pg. 26) The bleak dust that â€Å"endlessly covers† the land symbolizes how the working class lives are static, non-changing. Fitzgerald by showing the poor conditions of the working class makes the reader feel pity for the working class, causing the reader to be against that aspect of American society that puts the lower class into poverty. The idea of someone not being able to accomplish something just because of the circumstances of which they were born shows the corruption of the American society. How was the Valley of Ashes one of the most important symbols for Fitzgerald to use in the criticism of the American society that follows the American dream? The Valley of Ashes showing the poor qualities of the working class makes readers realize that some Americans aren’t able to accomplish their dreams because of circumstances from when they were born goes against the principles of the American Dream. Fitzgerald was better able to criticize the American dream with the use of three symbols. His symbols allowed the reader to, better relate to his writing, use prior knowledge to help in the understanding of his criticism, have a visual picture of the working class, and realize the flaws of some characters in a religious sense. The green light played one of the most important roles because without out it the reader wouldn’t have realized that people in the American society that do try to follow the American dream and work their hardest sometimes aren’t able to accomplish their dream thus showing that America isn’t following the American Dream. The seconded of the most important symbols was the Valley of Ashes, without the valley of ashes the reader wouldn’t have realized that sometime a person isn’t able to accomplish something because of the status of which they were born. The last most important symbol used was the eyes of Dr. T. J. Eckleburg with this symbol Fitzgerald was able to move the reader against the actions of the American society because he showed that god was against the actions, if the reader was against the actions than Fitzgerald could criticise the actions of the American society more effectively because the reader would agree more with what he was saying. Without the above three symbols playing their key role in the criticism of the American society, Fitzgerald’s criticism of the American society not following the American dream wouldn’t have been as greatly done.

Performance Analysis Of Election Algorithm Computer Science Essay

Performance Analysis Of Election Algorithm Computer Science Essay Distributed systems are the systems consisting of multiple processors that connect through a network to communicate. To manage the communication between different nodes and the exchange of data between them, a leader among them is required. In our project we implement the various Election algorithms for choosing the leader in Distributed Systems thus solving the coordinator election problem. We are also comparing the performance of each of these election algorithms. First we implemented the Election algorithms using the message passing interface(MPI). Then we measured and compared the performance of each of these election algorithms and simulated the results. Finally we modified the distributed leader election algorithm to suit the mobile ad-hoc networks. Key Words: Distributed Systems Election algorithms Unidirectional ring algorithm Lelanns algorithm Chang Roberts algorithm Bidirectional ring Leader election Mobile Adhoc Networks Introduction Distributed system It is a group of processors where the memory or a clock is not shared. Every processor has its own associated memory and the information is exchanged through communication networks. Distributed algorithm A distributed algorithm is an algorithm run on such a distributed system assuming the non-existence of central coordinator in these systems. So these algorithms require one process to act as a coordinator. There is no way to select one of them to be leader if all the processes are alike without different characteristics. One of the processes has to take this special responsibility, no matter which process takes it. This problem in which a leader has to be elected is termed as the coordinator election problem that is how to choose a process among the different processors to make it a central coordinator. Election algorithm An election algorithm is used to solve the coordinator election problem in these distributed systems. Any election algorithm must be a distributed algorithm by the nature of the coordinator election problem. The most important feature in election algorithm is it assumes every process has a Unique ID. It votes a process from among the different processors which can act as the initiator, sequencer and monitor in detecting and solving situations like Deadlock, Mutual Exclusion etc. Thus electing a leader process has become a major issue in wired and ad hoc networks. The goal of election algorithm is to see that when an election begins it ends with all processes by an agreement as who has to be the new coordinator. ELECTION ALGORITHM ON RINGS : A ring is formed by the processes in ring algorithm. In this each process sends only messages to the next process in the ring. It can be classified into two categories Unidirectional Bidirectional The messages are sent only in one direction in unidirectional and in both directions in Bidirectional ring algorithms. To compare the performance of these algorithms, the different criteria taken into consideration are Total number of messages passed Complexity of the messages used Time elapsed by the algorithm 2. Implementation Software We have used the message passing interface (MPI) for implementing our algorithms which are discussed below. It is a standard specification for communication through messages among different processes. It is independent of any language. It is used in parallel computing to write programs for group and point to point communication between nodes. We used the C language to implement the election algorithms. The MPIs routines are directly callable in C. The main MPI calls used in our program are MPI_Init: Before communicating, all instances of the code should call this so as to prepare the MPI implementation for the communications environment. MPI_Finalize: For exiting the communication, this is called by all the instances of the code. MPI_Comm_size: To learn about the number of processors which are using MPI environment to communicate, this routine is called. MPI_Comm_rank: Each of this process assigns an integer to the communicating process. MPI_Send: To send a message to another process, this is called. MPI_Recv: This call allows to receive a message from a process. 3. Unidirectional Ring Algorithms The ring algorithm consists of processes arranged in the form of a ring consisting of a token. The token is passed between processes and the process which has the ring can send a message. The election problem can be implemented using the ring algorithms Lelanns algorithm Chang Roberts algorithm 3.1 LeLanns algorithm In this we assume that all the processes are physically and logically ordered. In LeLanns algorithm whenever the coordinator is lost, the initiator sends a token to the other processes in the ring by adding its id. Nodes cannot initiate any messages once they receive the token. After circulating the token, if the process receives back its id then it is chosen to be the leader since it knows that others cannot become leaders as it knows all the ids of the other processes and it has the least id. The message complexity of LeLanns algorithm is O(N2). ALGORITHM: Step 1: begin Step 2: send the token to neighbours with id of current process as i Step 3: add current process id j and forward to neighbours Step 4: if process P receives back its id then Step 5: leader is P Step 6: else return null Step 7: end Message Complexity: Every initiator sends N messages. So the worst case time complexity is N2. The algorithm is implemented using MPI and the message complexity and time complexity given by the MPI program is No.of processes Messages Real time User time System time 5 25 1.195 0.025 0.023 10 100 1.292 0.027 0.024 15 225 1.446 0.030 0.027 20 400 1.551 0.034 0.030 25 625 1.654 0.036 0.030 Table 1: LeLanns algorithm 3.2 Chang Roberts algorithm This is similar to lelanns algorithm but with a little change. When a process receives a token with an id greater than the current process id, it drops that particular token as that process cannot be a leader . Hence it forwards the token with an id less that itself. In this way it saves time by discarding the unwanted messages. The worst case message complexity of Chang Roberts algorithm is O(N2) and the average case message complexity is O(N logN). ALGORITHM: Step 1 : send message with identifier = I to other processes Step 2 : if identifier J of current process > I then send the message to neighbours with identifier I Step 3 : else drop message with identifier I and send the message with identifier J to neighbours Step 4 : continue this process until a particular process receives back a message with its identifier. Step 5: if a process receives a message with its id then process= leader. Step 6: else return null Step 7:end Message Complexity: The best case time complexity is 2N-1. The process with largest id sends N messages and other N-1 processes send one message each. The algorithm is implemented using MPI and the message complexity and time complexity given by the MPI program is given in the table 2. No.of processes Messages Real time User time System time 5 9 1.189 0.024 0.023 10 19 1.299 0.027 0.024 15 29 1.412 0.029 0.026 20 39 1.531 0.033 0.028 25 49 1.650 0.036 0.031 Table 2:Robert Changs Best Case Algorithm The worst case time complexity is N(N+1)/2. The process with largest id sends N messages and other N-1 processes send messages from 1à ¢Ã¢â€š ¬Ã‚ ¦N-1. No.of processes Messages Real time User time System time 5 15 1.186 0.024 0.023 10 55 1.301 0.027 0.025 15 120 1.414 0.030 0.027 20 210 2.511 0.034 0.029 25 325 1.654 0.035 0.030 Table 3: Robert Changs Worst Case Algorithm 4. Bidirectional Ring Algorithms 4.1 Leader election algorithm for Bidirectional Ring In these bidirectional ring algorithm messages can be sent or exchanged in any direction. We have used the algorithm mentioned in [2] An improved upperbound for distributed election in bidirectional rings of processors. J.Van Leeumen and R.B Tan. Distributed Computing(1987)2:149-160 for implementing it with the MPI. The name (identifier) of a large processor is contained in the register ID which is maintained by the processor and a (Boolean) register DIR that has a direction on the ring in which there are processors that still have a smaller processor up for election. A smaller candidate which is still alive when the messages( the ones having the name of a Large candidate) are created, have them being sent out in its direction. Processors that begin a chase are known as active, and the left over processors are observant. To get rid of the smaller candidate and force agreement on the larger candidate is the main idea behind a chase. After the current active processors have begun the chase, the observant processors basically relay messages onwards unless they notice an unusual situation on the ring only. As the algorithm proceeds, there are two unusual situations that can arise at the location of an observant processor. They are (i) The processor receives a message of the current phase, say through its left link, that contains a value which is less than the current value in its ID register. The processor turns active, increments its phase number by 1, and initiates a chase with the value its current ID in the direction of the message that was received, i.e., out over its left link. (ii) Two messages of the same phase are received by the processor from opposite directions. The processor turns active, increments its phase number by 1, and initiates a chase with the largest value contained in the two messages in the direction of the smallest. As the algorithm proceeds, several active processors that can arise in a phase rapidly decreases, and at the end a single processor will be left precisely. This processor will be familiar that it receives two messages of the same phase from opposite directions that hold same values and is elected because either it receives a message of the current phase with a value exactly alike to the one it sent out (and stored in its ID register) or it receives two messages of the same phase from opposite directions that hold same values. ALGORITHM [2]: The algorithm describes the actions of an arbitrary processor on a bidirectional ring with half-duplex links as required for electing a leader 1) Initialization a) Let u be the executing processors identification number. Send message to both neighbors and phase number Pnum:=0; b) Wait for corresponding messages and to come in from two neighbors c) Compare u1 and u2 and set ID to max(u1,u2)and Dir to the min(u1,u2) and goto Active state else Observant state. 2) Election A processor performs in either active or observant state. a) Active A processor enters the active state with some value v stored in its ID register and a phase number p. The phase number p is either stored in Pnum or it is an update stored in temporary register. The phase number Pnum is incremented by 1 and a message is sent in Dir direction and goes to observant state. b) Observant In this state a processor receives messages and passes them on, unless an unusual situation is observed that enables it to initiate a new phase. Receive messages from one or both directions. Discard any message received with p less than Pnum. i) If the number of messages left are zero then go to observant state. ii) If the number of messages left is one then { Let the one message received be where necessarily p>=PNUM.} if p=PNUM then v = ID:goto inaugurate; v DIR:= direction from which the message was received; goto active state v > ID:begin goto observant else PNUM = p; ID =:v; DIR:=the direction in which the message was going Send message to direction DIR; goto observant iii) If the number of messages left is one then{Let the two messages received be and ,necessarily from opposite directions and with p>=PNUM} if v1=v2 Pnum := p; goto inaugurate else v1!=v2; ID:-=max(v1,v2); DIR:=the direction of min(v1,v2); goto active 3) Inauguration A transfer to this final phase occurs when the algorithm terminates and the ID register contains the identity of the unique leader. Message complexity: The message complexity of the bidirectional algorithm is 1.44NlogN + O(N). MPI is used implementing the algorithm. The Time and message complexity given by the MPI program is No.of processes Messages Real time User time System time 5 14 1.186 0.024 0.022 10 29 1.302 0.027 0.024 15 44 1.417 0.030 0.026 20 59 1.534 0.033 0.028 25 74 1.661 0.036 0.030 Table 4: Leader election algorithm for Bidirectional Ring 4.2 Leader election algorithm for Mobile Adhoc Networks A mobile ad hoc network is dynamic in nature. It is composed of a set of peer-to-peer nodes, that exchanges the information within the network through some wireless channels directly or through a series of such links. A node is independent to move around as there is no fixed final topology. The nodes move freely in a geographical area and are loosely bounded by the transmission range of these wireless channels. Within its transmission range, a mobile node communicates with a set of nodes thus implying all of them have to be in a network. These set of nodes are also known as the neighbors of the communicating node. The mobile nodes act as intermediary routers to direct the packets between the source and the destination nodes (i.e., the set of neighbors). A node is designated as a leader to coordinate the information that needs to be exchanged among nodes and to be in charge of their data requirements. The identification problem of a leader is termed as the leader election problem. Why do we need to select this leader? When the nodes are set out, they form an adhoc network between them within which the whole communication happens. If the topology of the network changes dynamically, a node may suspend its communication with the previous node, just like in distributed networks. So there has risen a need for a leader so that the maintenance of the network and the clock synchronization within it can be done. Also a new leader has to be chosen every time the members of the group are getting updated while communication is taking place. When the communicating nodes move freely and if they are not within the transmission range of each other, then the wireless network fails . Similarly the formation of wireless links happen only when the nodes which are separated and are too far and to communicate, move within the transmission range of one another. The network topology may change rapidly and unpredictably over time since the nodes are mobile. So developing efficient distributed algorithm for adhoc networks is a challenging work to be done. The largest identity node is chosen to be the leader using minimum wireless messages in this approach. A mobile ad hoc network can be considered as a static network with frequent link or node failures, which can be thought of as a mobile node of an adhoc network going out of reach. To cover all the nodes in the network we use the diameter concept. While distance is described as the shortest path between the nodes, diameter is defined as the longest distance between any two nodes in the network. The number of hops will be the taken for measuring the distance and the assumption is that the network becomes stable after a change happens during leader election process and there are only a limited number of changes in the network. A network having N nodes are considered here. Since the topological changes are considered during the leader election, this algorithm takes more than diameter rounds to terminate. If however, the topological changes are not considered diameter rounds are taken to elect the leader. We have used the algorithm mentioned in [3]An Efficient Leader Election Algorithm for Mobile Adhoc Networks Pradeep Parvathipuram1, Vijay Kumar1, and Gi-Chul Yang2 for implementing it with the MPI. Leader Election Each node propagates its unique identifier to its neighbors and a maximum identifier is elected as a leader in every round. This maximum identifier is propagated in the subsequent rounds. All the rounds need to be synchronized. idlist (i) identifies identifier list for node i, which consists of all the neighbors for node i. Lid(i) =max(idlist(i)) Termination At (rounds >= diameter), for each node i, If all identifiers in idlist are the same(i) the node i stops sending the maximum identifier further and chooses the maximum identifier in the idlist(i) as the leader. The algorithm gets terminated if for each node i the elements in idlist (for each node) are the same. The termination may not be at the final part of the diameter rounds, If all identifiers in the idlist as the leader. ALGORITHM [3]: Each node i in the network has two components a) idlist identifier list b) Lid(i) leader id of node i. 1) Each node say node i transmits its unique identifier in the first round and Lid(i) in the subsequent rounds to their neighbors and all these ids will be stored in idlist. Lid(i) = max (idlist(i)); 2) A unique leader is elected in diameter rounds, if there are no topological changes in the network. The algorithm is modified to incorporate topological changes in between the rounds and below is the description of how the algorithm is modified. Case 1: If a node has no outgoing links then lid(i) = i; Case 2: If a node leaves between the rounds, then the neighbors would know this. Suppose node i leaves the network after round r and let its neighbors be j and k. neighbors of i (i.e. j, k). 1) Delete (ilist, idlist(j k)) // delete ilist from idlist ilist contains the group of identifiers that node i has sent to its neighbors before round r along with i The ilist information is also deleted from all the neighbors of j and k if the ilist identifiers have been propagated in the previous rounds. This process continues until all the nodes in the network are covered. 2) Repeat while (round > = diameter), // Termination condition Compare all the identifiers present in idlist(i) for each node i. If all the identifiers in idlist(i) are equal, node i stops propagating its maximum identifier and elects the maximum identifier as the leader. Case 3: If a new node i joins the network in between the rounds say round r then the neighbors will update its idlist. 1) If neighbors of i say node j is the neighbor for node i. Add (i,idlist(j));The normal algorithm continues (the ids are propagated), nodes keep exchanging the information till diameter rounds. 2) Repeat while (round > = diameter),For all nodes in the network (node j) receives an identifier i at diameter round. IF i is greater than the maximum identifier node j has propagated in the previous round (diameter-1). a) Propagate node i to all the neighbors of j. b) Also propagate the node i information to all the neighbors of neighbors i until the whole network is covered, if the above condition satisfies. Else do not propagate the information to nodes in the network i) Compare all the identifiers present in idlist(i) If all the identifiers in idlist(i) are equal, node i stops propagating its maximum identifier and elects the maximum identifier as the leader. ii) All nodes in the network follow this process and a unique leader is elected connected component. The time taken for the algorithm to elect a leader will be O (diam + Άt) where Άt is the time taken for all the nodes to converge and Άt depends on the topology changes. Message complexity The message complexity of this algorithm depends on the number of rounds. In each round it sends 2N messages if we consider a ring topology as every node has 2 neighbors. So message complexity is 2N* No. of rounds. This algorithm is implemented using MPI and the message complexity and time complexity given by the MPI program is No.of processes Messages Real time User time System time 5 30 1.187 0.023 0.022 10 120 1.301 0.026 0.024 15 240 1.421 0.030 0.027 20 440 1.541 0.032 0.029 25 650 1.752 0.037 0.031 Table 5: Leader Election Algorithm for Mobile Adhoc Networks 5. Simulations Message Complexity with respect to number of processes Time No.of Messages Transferred Sno Algorithm N=5 N=10 N=15 N=20 N=25 N=5 N=10 N=15 N=20 N=25 1 LeLanns 1.195 1.292 1.446 1.551 1.654 25 100 225 400 625 2 Chang Roberts 1.189 1.299 1.412 1.531 1.65 9 19 29 39 49 3 Bidirectional Ring 1.186 1.302 1.417 1.534 1.661 14 29 44 59 74 4 MobileAdhoc 1.187 1.301 1.421 1.541 1.752 30 120 240 440 650The message and time complexity of each of these 4 algorithms for different number of processes is implemented in our programs and the results are as shown in table 6. All the above simulations are plotted on the graph so as to analyze the way different algorithms message complexity varies with the number of processes on which it executes. 6. Conclusions Table 6: Simulation ResultsComparing the results, we can conclude that the Lelanns algorithm is the most fundamental algorithm and requires large number of message exchanges among the four algorithms. Changs and Robert algorithm made considerable changes to Lelanns algorithm however in the worst case that algorithm also requires O(N2). For leader election in ring topology these are the two unidirectional algorithms that are to be considered. The bidirectional algorithm requires less messages than the worst case Changs and Roberts algorithm. It requires O(N logN) messages. It takes less time to discover the leader when compared to unidirectional algorithms since the messages are sent in both the directions. The final algorithm is put into effect for mobile adhoc networks and is run in many rounds. The messages complexity depends on number of rounds. It guarantees that there is only one leader at a time but however it handles the partition in the network and requires more number of messages .

Essay --

How different would the U.S. be if it were not energy dependent upon the Middle Eastern nations? It is estimated that the United States used over â€Å"18.6 million barrels per day (MMbd) of petroleum products during 2012†. (â€Å"How dependent are we on foreign oil?†) The U.S.’s dependence on oil has caused major difficulties regarding its military and economic status. However, biochemists in the U.S. have discovered new ways to decrease the U.S.’s dependence on foreign oil. By fermenting and distilling the sugars of corn, biochemists can create an organic compound called bioethanol (or denatured ethanol) that, when mixed with conventional gasoline, can be able to operate cars. Environmentalists have stated that ethanol may be more detrimental to the atmosphere than traditional gasoline. In addition, carmakers have noted that the use of ethanol may cause problems in cars’ engines. Does the benefit of America being energy dependent outweigh the speculated detrimental consequences of using ethanol? Ethanol is usually combined with traditional gasoline to create â€Å"gasohol† or gasoline and alcohol. â€Å"In fact, one-third of gasoline sold in the US is mixed with ethanol.† (Giametta) Adding ethanol lowers carbon dioxide emissions, according to the U.S. Department of Energy. Carbon emissions occur when the fuel combustion of the car is not fully completed. An incomplete combustion may yield carbon, carbon monoxide, and other chemicals. Ethanol is thirty percent oxygen. Adding oxygen yields a more complete fuel combustion; therefore, it would lower the amount of carbon emissions. There are two types of ethanol gas that can operate regular, unmodified cars: E10 and E15. E10 has a concentration of ninety percent gasoline and ten percent ethanol, while ... ...uction can get rid of waste and make fuel. [Also] From farm to car, cellulosic ethanol releases less greenhouse gas than gasoline (86 percent less) and corn ethanol (52 percent less than gasoline).†(Nasr) Cellulosic ethanol shows promising benefits, but it also has its own share of consequences. It, like corn ethanol, will significantly decrease a car’s mpg. Growing the biomass needed to create the ethanol is another matter at hand. Will the U.S. have enough land to grow enough plant biomass to satisfy the demand? Cellulosic ethanol emits greenhouse gases as well, so in reality, it doesn’t particularly solve the problem of greenhouse gases. Hopefully, in the near future, we will be able to mass produce an alternative fuel without any detrimental consequences, but until that time arrives, I believe that corn ethanol isn’t worth the financial and environmental risks.

The Medical and Ethical Perspectives of Human Cloning Essay -- Argumen

The Medical and Ethical Perspectives of Human Cloning      Ã‚  Ã‚   In our modern day world, the technology of genetic engineering and human cloning for the use of asexual reproduction has reached a point to where we must ask ourselves if it is a good practice for medical purposes, or if it presents issues of ethical and moral concern.   Human cloning is a very cmplex process; it is very multilayered in the promises and threats that are suggested by scientists (Kolata 8).   In the basic definition, cloning is accomplished by removing the nucleus of a mature, unfertilized egg and replacing it with a specialized cell from an adult organism.   The nucleus taken contains most of the hereditary material from the original human source, and it develops from the human source it was taken from.   This process makes it possible for scientists, or geneticists, to reproduce unlimited amounts of duplicates, which are known as clones (Pence:   Flesh 18).   Human cloning has reached a point wher the ethical and moral values have not been co nsidered, and we have not fully learned and understood the negative consequences of such a new and overwhelming technology.   There are, however, individual benefits of using genetic engineering for medical purposes.   Such purposes include gene therapy and asexual reproduction.   The use of genetic engineering in our society is viewed differently in two very arguable ways.   Scientists, bioethicists, doctors, lawyers, professors, and authors join in the debate over human cloning and its medical benefits versus moral and ethnical concern.   Ã‚  Ã‚   Cloning and genetic engineering ahve been ideas that scientists have explored for a long time.   "Cloning first came to public attention roughly thirty years ago, following the s... ...raise tough questions. http://www.msnbc.com/news/229707.asp Mohler, Albert R. "The Brave New World of Cloning: A Christian Worldview Perspective."   Human Cloning: Religious Responses.   Ed. Ronald Cole-Turner. Louiseville, Ky.: Westminster John Know Press, c 1997. MSNBC Staff and Wire Reports.   Korea says human clone test succeeds: Scientists claim to cultivate human embryo in experiment.   http://www.msnbc.com/news/224234.asp Pence, Gregory E. Flesh of my Flesh: The Ethics of Cloning Humans.   Lanham, Md. Rowman and Littlefield, c 1998. Pence, Gregory E. Who's Afraid of Human Cloning? Lanham, Md. Rowman and Littlefield, c 1998. Roleff, Tamara L. ed. Biomedical Ethics: Opposing Viewpoints.   San Diego, CA Greenhaven Press, Inc. c 1998. Wekesser, Carol. ed. Genetic Engineering: Opposing Viewpoints. San Diego, CA Greenhaven Press, Inc. c 1996. The Medical and Ethical Perspectives of Human Cloning Essay -- Argumen The Medical and Ethical Perspectives of Human Cloning      Ã‚  Ã‚   In our modern day world, the technology of genetic engineering and human cloning for the use of asexual reproduction has reached a point to where we must ask ourselves if it is a good practice for medical purposes, or if it presents issues of ethical and moral concern.   Human cloning is a very cmplex process; it is very multilayered in the promises and threats that are suggested by scientists (Kolata 8).   In the basic definition, cloning is accomplished by removing the nucleus of a mature, unfertilized egg and replacing it with a specialized cell from an adult organism.   The nucleus taken contains most of the hereditary material from the original human source, and it develops from the human source it was taken from.   This process makes it possible for scientists, or geneticists, to reproduce unlimited amounts of duplicates, which are known as clones (Pence:   Flesh 18).   Human cloning has reached a point wher the ethical and moral values have not been co nsidered, and we have not fully learned and understood the negative consequences of such a new and overwhelming technology.   There are, however, individual benefits of using genetic engineering for medical purposes.   Such purposes include gene therapy and asexual reproduction.   The use of genetic engineering in our society is viewed differently in two very arguable ways.   Scientists, bioethicists, doctors, lawyers, professors, and authors join in the debate over human cloning and its medical benefits versus moral and ethnical concern.   Ã‚  Ã‚   Cloning and genetic engineering ahve been ideas that scientists have explored for a long time.   "Cloning first came to public attention roughly thirty years ago, following the s... ...raise tough questions. http://www.msnbc.com/news/229707.asp Mohler, Albert R. "The Brave New World of Cloning: A Christian Worldview Perspective."   Human Cloning: Religious Responses.   Ed. Ronald Cole-Turner. Louiseville, Ky.: Westminster John Know Press, c 1997. MSNBC Staff and Wire Reports.   Korea says human clone test succeeds: Scientists claim to cultivate human embryo in experiment.   http://www.msnbc.com/news/224234.asp Pence, Gregory E. Flesh of my Flesh: The Ethics of Cloning Humans.   Lanham, Md. Rowman and Littlefield, c 1998. Pence, Gregory E. Who's Afraid of Human Cloning? Lanham, Md. Rowman and Littlefield, c 1998. Roleff, Tamara L. ed. Biomedical Ethics: Opposing Viewpoints.   San Diego, CA Greenhaven Press, Inc. c 1998. Wekesser, Carol. ed. Genetic Engineering: Opposing Viewpoints. San Diego, CA Greenhaven Press, Inc. c 1996.

Business Plan for Sushi Restaurant

Business Plan for Oyi-Shi Sushi Restaurant By: Hongying Cai Cover Letter: Dear Investor: You’re looking at a business plan for one of the finest and best Sushi restaurant what will take place in down town Manhattan. The restaurant is specifically located at the Ground Zero, where back in the old days, the finest place. Right now the government is rebuilding the World Trade Center, which means wealthy people are coming back to down town Manhattan. This is a great opportunity to start a restaurant around the area, since the population will significantly increase due to the rising of a 105 stories skyscraper.Oyi-Shi sushi restaurant is design for consumer to have a relaxed and pleasant environment for brunch, lunch, happy hour, and dinner. We serve variety style of Japanese sushi, Such as Aburi Sushi, Gunkan-Maki, Maki Sushi and Nigiri Sushi, Plus different selections of beverages. Oyi-shi restaurant will be able to occupy over 40 guess, and a Bar, which will accommodate 15 peopl e. Executive Summary: Sushi restaurant industry had grown enormously in United State during last decade. As of now days, there are approximately 30,000 throughout 50 states, There are over 200 sushi restaurant located in New York.The purpose of this business plan is to find investor or a partner to start off the business. Oyi-Shi Sushi Bar and Grill is a high-end sushi restaurant and bar located at Ground Zero, Seeking to provide customer with a pleasant environment for dinning or happy hours. Plus we would like to satisfy customer with our descent sushi catering and variety selection of sushi styles. Company Back Ground Oyi-Shi sushi restaurant Inc. is a New York base corporation, Will be register under the State of New York. Restaurant is initially found by HongYing Cai, and seeking to have a partner. Mr. Cai will obtain 55% of the business.There are overwhelming competitions in restaurant business. In New York City, there are over thousands of restaurant serving different food or caterings. Another obstacle for sushi restaurant is raising price in seafood. According to IBIS World, sushi restaurant industry is facing a decline in revenue of 3. 4% each year. However there are still opportunities for sushi restaurant business. The project for rebuilding World Trade Center will have a significant increase of population in down town Manhattan. With increase in population there is a need for food. Management Team: Overall restaurant will be managed by HongYing Cai.I have over 7 years of working experience in restaurant industry. Plus majority of my relatives are restaurant owner, they can give me advises on managing the restaurant. For chief, I will hire 2 Japanese sushi chief, who had at least 5 years of experience on making sushi catering, plus 2 sushi helpers, with at least two year in experience. We’ll hire 7 waiters or waitress. 3 of them will doing daily shift, 4 of them will have the night shift, each of the waiter or waitress need to be very polite to the customer and fluent in English, bonus if speaking other language, Japanese or Chinese is preferred.Financial Plan There are no loans make in the starting of the business, all capitals had came from founders and the partner. General assumptions of Federal tax rate are around 33%, and sales tax rate is around 5%. These tax rates are fixed for all 5 years projection. We also assume that the average sales of the restaurant increase about 15% each year. We also Assumes that the operating cost is around 45% of the good sold. |Year 1 |Year 2 |Year 3 |Year 4 |Year 5 | |Sales |$1,440,000 | $1,656,000 |$1,904,400 |$2,190,060 |$2,518,569 | |Operating Cost |$648,000 |$745,200 |$856,980 |$985,527 |$1133356 | |EBITA |$792,000 |$910,800 |$1,047,420 |$1,204,533 |$1,385,213 | |Tax, Interest rate and |$300,960 |$346,104 |$398,020 |$457,723 |$526,381 | |depreciations | | | | | | |Net Profits |$491,040 |$564,696 |$649,400 |$746,810 |$858,832 | Capital Required Oyi-Shi sushi restaurant will star t off with $400,000 capitals.Following table will show how this capital will be used: |Project Start off Cost | | |Initial Lease Payment and Deposits |$50,000 | |Working Capital |$150,000 | |FF&E |$50,000 | |Leasehold Improvement |$15,000 | |Security deposit |$10,000 | |Opening supplies |$15,000 | |Company vehicle and lease deposit |$40,000 | |Marketing budget |$50,000 | |Miscellaneous and Unforeseen Cost |$20,000 | |Total |$400,000 | Marketing Plan The Objective of this marketing plan is to maximize the visibility of the business in the surrounding area. By doing so, I will use a number of marketing strategies that will allow the Sushi Restaurant to easily target men and women within targeted market. These strategies include traditional print advertisements and discounts offered as a part of a grand opening campaign. Below is a description of how the business intends to market its services to the general public.The Company also intends on hiring a local public relations firm that will promote reviews and articles about the restaurant, its cuisine, and relevant hours of operation and pricing. I will invite local food critics to the Company’s Sushi Restaurant location in order to generate positive publicity about the restaurant. The Company will maintain a sizable amount of print and traditional advertising methods within local the local market to promote the sushi and Japanese cuisine products that the Company is selling. At the onset of operations, the Company will distribute an expansive number of coupons for lower priced fare within local circulars Location Analysis I had picked area around Ground Zero, as the location of the Oyi-Shi Sushi restaurant.Primary reasons are rebuilds of World Trade Center. According to the Port Authority of NY and NJ, this newly raising skyscraper is five major skyscrapers at downtown Atlanta, providing Class A Office space. Plus there will be world’s most significant memorials and museums, which means there are good amount of tourist. Reports from Port Authority of NY and NJ also indicated there will be 250,000 people and over 200,000 commuters using the World Trade Center’s transportation hub. Manufacturing plan In order to provide customer with the best food, I decided to import the seafood and other goods needed to serve the customer every 3 days. I will have 3 big refrigerators to store these goods.Each of the refrigerators will be store with different goods, for example, all seafood will be store within one particular refrigerator with temperatures under the control to make sure the condition of the seafood is in good standing. Appendix â€Å"Sushi Restaurants in the US Industry Market Research Report Now Available from IBISWorld. † PR Web. April 12, 2012. December 10, 2012. http://www. prweb. com/releases/2012/4/prweb9393316. htm â€Å"Sushi. † Wikipedia. December 15, 2012. December 15, 2012 http://en. wikipedia. org/wiki/Sushi â€Å"World Trade Center: A Roadma p Forward† The Port Authority of NY and NJ. October 2, 2008. December 15, 2012. http://www. panynj. gov/wtcprogress/pdf/wtc_report_oct_08. pd