пятница, 23 августа 2019 г.
Not given ( no title ) Research Paper Example | Topics and Well Written Essays - 2250 words
Not given ( no title ) - Research Paper Example For there to be any private nuisance claim made, the plaintiff must provide the court with substantial proof of interference. It is then within the courtââ¬â¢s jurisdiction to judge the reasonableness of the defendantââ¬â¢s behavior and try to establish fault from evaluating it. This establishes a balance between the two sides since the court evaluates the evidence before making a ruling. The court rules in favor of the plaintiff if it can establish that the plaintiff suffered because of the interference and will continue to do so unless compensated by the defendant (Dodson 2002, pg. 60). On the other hand, the statute defines public nuisance as any criminal activity which threatens the community as a whole. It is a criminal offence therefore; it attracts criminal cases tried by the criminal courts. The plaintiff in these cases is the state which represents the entire community and not a person or a group. On rare occasions do individuals benefit from a criminal case directly, for example, a person qualifies for a personal injury claim warranting compensation if the criminal activity in trial directly affected them. A good illustration of a public nuisance includes companies held liable for dumping hazardous waste materials into water catchment areas (Scott 2001, pg.68). However, some cases attract both private and public nuisance claims. The illustration mentioned above serves as a good example. The company could be held liable by the state for the polluting of a water catchment area which benefits the entire community. It can also be held liable by owners of the land adjacent to the water catchment area. They could claim that the companys negligent actions had adverse effects on the enjoyment of their comfortable homes (Scott 2001, pg. 77). Legislation describes the phrase interest in landââ¬â¢ in a way that attempts to include land solely owned by an individual in a legal manner. Meaning, the
Analysis of Early Roman civilization Assignment Example | Topics and Well Written Essays - 250 words
Analysis of Early Roman civilization - Assignment Example For instance, the practicality of the Roman civilization is evident from the many roads they built as well as their strong belief in faith and patriotism(Forsythe, 30). Besides, early Roman civilization stressed on morals and characters and held women in high regards unlike other civilizations like the Greek. Education was still information with the focus on teaching children about Roman religion and ideas. Early forms of education included memorization of the Romanââ¬â¢s Twelve Tables (Forsythe, 32). Home education would also account for civilization of early Rome as the emperor built schools because it was expanding. Education during early Roman civilization was practical based, and this explains the Romans tremendous contribution in engineering and law. Conversely, early civilization ideologies planted a bad culture of spectatorship among the Romans as they focused more on professionalism. The civilization bred a materialistic culture where Romans focused more on wealth acquisition and luxury living. However, it is the luxurious nature of the civilization that would mark the decline of the emperor because barbaric groups gathered with intention of getting the rich life of the emperor without fighting invaders (Forsythe,
четверг, 22 августа 2019 г.
The Grievances Amongst the Russian People Essay Example for Free
The Grievances Amongst the Russian People Essay Assess the extent to which the grievances of the Russian people were addressed by the October Manifesto The grievances amongst the Russian people were addressed to some extent by the passing of the October Manifesto. The laws passed in the October Manifesto were designed to benefit the working class as well as prevent an outbreak of violence and an imminent revolution. Stolypin was appointed as the chairman of ministers for the Duma. Which had been created in the hope to please the working class enough to draw them back to the factories. However while in that position he implemented many controversial laws. Consequently Stolypin was assassinated and caused a huge impact on the Russian people. Firstly Tsar Nicholas II was persuaded by his advisers to issue the October Manifesto, because the increasing misery of the Russian people had reached a point where they were willing to take the risk of initiating a revolution. The suffering the Russian people, especially the working class endured around October 1905 was extreme due to the Russo-Japo war. There were severe shortages on everything but most importantly fuel and food which were necessities. The level of their discontent was increasingly rising and revolution was becoming an imminent possibility. The Tsar was consequently persuaded by his trusted advisors to give up his absolute power and focus on trying to retain a partial power. The passing of the October Manifesto effectively stopped the threat of revolution. The laws passed within this document allowed for the setting up of a Russian parliament called the Duma, gave the people a right to vote, allowed for basic civil rights to be for filled such as free speech and better working and living conditions. The passing of the October Manifesto ended absolute monarchy in Russia. This also pleased and convinced the workers to go back to working class to go back to work. Secondly a man named Stolypin was appointed by the Tsar to be chairman of the Duma, the new Russian parliament. However this was a tactical move by the Tsar, Stolypin was placed in this position so as to reverse all the changes that had been made in the October Manifesto which the Tsar had to concede to in October 1905. Stolypin implemented many controversial policies such as, punishing the leaders of the revolution through hanging. Which resulted in the death of over two thousand people and around 21,000 being banished to Siberia. The noose became known as Stolypins neck tie. An upper house of the Duma was created called the State Council. The deputies of this house were also appointed by the Tsar consequently they were answerable to him in preference to the public. The Upper House was put in place so as to stop any law that was not suitable proposed by the Duma. Also in 1907 Stolypin engineered a new electoral law, which was made in favour of the rich. The rule stated that it would take 230 large landowner (nobles), 1000 large business owners (industrialists), 15 000 small business, 60 0000 peasant, and 125 000 factory workers votes to elect one deputy to the Duma. The new electoral law limited the rights of the poor and working class; basically landing them back to where they began for their fight for basic rights. However during the period of Stolypin, Russia was fairly stable between 1907 and 1911, due to Stolypins wise intelligence. He implemented some legal reforms for peasants and factory workers that did not fully satisfy them but kept them content. Stolypin was very wise in the decisions he made. Stolypin was able to keep the threat of revolution down by passing some legal reforms that satisfied the peasants and working class. However he did implement many controversial policies that took back the rights of the working class, that they had fought so hard to win. Thirdly the impact of Stolypins downfall and assassination created growing discontent amongst the people. With rising numbers of strikes and demonstrations. After Stolypins assassination in 1911, the middle class dominated Duma, removed the restrictions and overturned Stolypinââ¬â¢s social reforms in order for Russia to more rapidly industrialise. Russia experienced worsening discontent throughout 1912 to 1914. In 1912 striking miners in the Lena Goldfields in Siberia were massacred by the Cossacks which therefore provoked a wave of more strikes. In July 1914 a general strike began. Violent clashes between the factory workers Cossacks and police ended in mounting causalities. This near revolution only ended due to the out break of WW1. Stolypins assassination had a great impact on the Russian people; it increased discontent amongst the working class which resulted in more strikes, casualties and deaths. The Russian people were consequently stuck back in the same position they had fought so hard to get out of in 1905. In conclusion the grievances amongst the Russian people were addressed to some extent by the passing of the October Manifesto in 1905. The Manifesto allowed for the creation of a Duma which resulted in a more democratic environment, and allowed for the right to vote. This manifesto also allowed for basic civil rights such as free speech and better working and living conditions, which were the biggest issue behind most of the strikes. However the commission of Stolypin by the Tsar to fill the place of the chairman of ministers for the Duma created problems. The Russian people were kept content throughout the period of Stolypins power despite the gradual reversal of all changes made by the Tsar in the October Manifesto. After the assassination of Stolypin a general strike broke out, this landed the Russian people back to square one. So to some extent the passing of the October Manifesto in 1905 addressed the grievances amongst the Russian people.
среда, 21 августа 2019 г.
MapReduce for Distributed Computing
MapReduce for Distributed Computing 1.) Introduction A distributed computing system can be defined as a collection of processors interconnected by a communication network such that each processor has its own local memory. The communication between any two or more processors of the system takes place by passing information over the communication network. It has its application in various fields like Hadoop and Map Reduce which we will be discussing further in details. Hadoop is becoming the technology of choice for enterprises that need to effectively collect, store and process large amounts of structured and complex data. The purpose of the thesis is to research about the possibility of using a MapReduce framework to implement Hadoop. Now all this is possible by the file system that is used by Hadoop and it is HDFS or Hadoop Distributed File System. HDFS is a distributed file system and capable to run on hardware. It is similar with existing distributed file systems and its main advantage over the other distributed File system is, it is designed to be deployed on low-cost hardware and highly fault-tolerant. HDFS provides extreme throughput access to applications having large data sets. Originally it was built as infrastructure support for the Apache Nutch web search engine. Applications that run using HDFS have extremely large data sets like few gigabytes to even terabytes in size. Thus, HDFS is designed to support very large sized files. It provides high data communication and can connect hundreds of nodes in a single cluster and supports tens of millions of files in a system at a time. Now we take all the above things mentioned above in details. We will be discussing various fields where Hadoop is being implemented like in storage facility of Facebook and twitter, HIVE, PIG etc. 2.) Serial vs. Parallel Programming In the early decades of computing, programs were serial or sequential, that is, a program consisted of a categorization of instructions, where each instruction executed sequential as name suggests. It ran from start to finish on a single processor. Parallel programming (grid computing) developed as a means of improving performance and efficiency. In a parallel program, the process is broken up into several parts, each of which will be executed concurrently. The instructions from each part run simultaneously on different CPUs. These CPUs can exist on a single machine, or they can be CPUs in a set of computers connected via a network. Not only are parallel programs faster, they can also be used to solve problems on large datasets using non-local resources. When you have a set of computers connected on a network, you have a vast pool of CPUs, and you often have the ability to read and write very large files (assuming a distributed file system is also in place). Parallelism is nothing but a strategy for performing complex and large tasks faster than traditional serial way. A large task can either be performed serially, one step following another, or can be decomposed into smaller tasks to be performed simultaneously using concurrent mechanism in parallel systems. Parallelism is done by: Breaking up the process into smaller processes Assigning the smaller processes to multiple processors to work on simultaneously Coordinating the processors Parallel problem solving can be seen in real life application too. Examples: automobile manufacturing plant; operating a large organization; building construction; 3.) History of clusters: Clustering is the use of cluster of computers, typically PCs or some workstations, storage devices, and interconnections, appears to outsider (user) as a single highly super system. Cluster computing can be used for high availability and load balancing. It can be used as a relatively low-cost form of parallel processing system for scientific and other related applications. Computer clustering technology put cluster of few systems together to provide better system reliability. Cluster server systems can connect a group of systems together in order to provide combined processing service for the clients in the cluster. Cluster operating systems distribute the tasks amongst the available systems. Clusters of systems or workstations can connect a group of systems together to share critically demanding and tough tasks. Theoretically, a cluster operating system can provide seamless optimization in every case. At the present time, cluster server and workstation systems are mostly used in High Availability applications and in scientific applications such as numerical computations. A cluster is a type of parallel or distributed system that: consists of a collection of interconnected whole computers and is used as single, unified computing resource. The whole computer in above definition can have one or more processors built into a single operating system image. Why a Cluster Lower cost: In all-purpose small sized systems profit from using proper technology. Both hardware and software costs tend to be expressively minor for minor systems. However one must study the entire cost of proprietorship of your computing environment while making a buying conclusion. Next subdivision facts to some issues which may counterbalance some of the gains of primary cost of acquirement of a cluster. . Vendor independence: Though it is usually suitable to use similar components through a number of servers in a cluster, it is worthy to retain a certain degree of vendor independence, especially if the cluster is being organized for long term usage. A Linux cluster created on mostly service hardware permits for much better vendor liberation than a large multi-processor scheme using a proprietary operating system. Scalability: In several environments the problem load is too large that it just cannot be processed on a specific system within the time limits of the organization. Clusters similarly provide a hassle-free path for increasing the computational means as the load rises over time. Most large systems scale to a assured number of processors and require a costly upgrade Reliability, Availability and Serviceability (RAS): A larger system is typically more vulnerable to failure than a smaller system. A major hardware or software component failure fetches the whole system down. Hence if a large single system is positioned as the computational resource, a module failure will bring down substantial computing power. In case of a cluster, a single module failure only affects a small part of the overall computational resources. A system in the cluster can be repaired without bringing rest of the cluster down. Also, additional computational resources can be added to a cluster while it is running the user assignment. Hence a cluster maintains steadiness of user operations in both of these cases. In similar type of situations a SMP system will require a complete shutdown and a restart. Adaptability: It is much easier to adapt the topology. The patterns of linking the compute nodes together, of a cluster to best suit the application requirements of a computer center. Vendors typically support much classified topologies of MPPs because of design, or sometimes testing, issues. Faster technology innovation: Clusters benefit from thousands of researchers all around the world, who typically work on smaller systems rather than luxurious high end systems. Limitations of Clusters It is noteworthy to reference certain shortcomings of using clusters as opposite to a single large system. These should be closely cautious while defining the best computational resource for the organization. System managers and programmers of the organization should intensely take part in estimating the following trade-offs. A cluster increases the number of individual components in a computer center. Every server in a cluster has its own sovereign network ports, power supplies, etc. The increased number of components and cables going across servers in a cluster partially counterbalances some of the RAS advantages stated above. It is easier to achieve a single system as opposed to numerous servers in a cluster. There are a lot more system services obtainable to manage computing means within a single system than those which can assistance manage a cluster. As clusters progressively find their way into profitable organizations, more cluster savvy tools will become accessible over time, which will bridge some of this gap. In order for a cluster to scale to make actual use of numerous CPUs, the workload needs to be properly well-adjusted on the cluster. Workload inequity is easier to handle in a shared memory environment, because switching tasks across processors doesnt involve too much data movement. On the other hand, on a cluster it tends to be very tough to move a by this time running task from one node to another. If the environment is such that workload balance cannot be controlled, a cluster may not provide good parallel proficiency. Programming patterns used on a cluster are typically diverse from those used on shared-memory systems. It is relatively easier to use parallelism in a shared-memory system, since the shared data is gladly available. On a cluster, as in an MPP system, either the programmer or the compiler has to explicitly transport data from one node to another. Before deploying a cluster as a key resource in your environment, you should make sure that your system administrators and programmers are comfortable in working in a cluster environment. Getting Started With Linux Cluster: Although clustering can be performed on various operating systems like Windows, Macintosh, Solaris etc. , Linux has its own advantages which are as follows:- Linux runs on a wide range of hardware Linux is exceptionally stable Linux source code is freely distributed. Linux is relatively virus free. Having a wide variety of tools and applications for free. Good environment for developing cluster infrastructure. Cluster Overview and Terminology A compute cluster comprises of a lot of different hardware and software modules with complex interfaces between various modules. In fig 1.3 we show a simplified concept of the key layers that form a cluster. Following sections give a brief overview of these layers. 4.) Parallel computing and Distributed Computing system Parallel computing It is the concurrent execution of some permutation of multiple instances of programmed instructions and data on multiple processors in order to achieve results faster. A parallel computing system is a system in which computer with more than one processor for parallel processing. In the past, each processor of a multiprocessing system every time came in its own processor packaging, but in recent times-introduced multicore processors contain multiple logical processors in a single package. There are many diverse kinds of parallel computers. They are well-known by the kind of interconnection among the processors (ââ¬Å"processing elements or PEs) and memory. Distributed Computing System: There are two types of distributed Computing systems: Tightly coupled system: In these systems, there is a single system wide primary memory (address space) that is shared by all the processors. In these systems any communication between the processors usually takes place through the shared memory. In tightly coupled systems, the number of processors that can be usefully deployed is usually small and limited by the bandwidth of the shared memory. Tightly coupled systems are referred to as parallel processing systems Loosely coupled systems: In these systems, the processors do not share memory, and each processor has its own local memory. In these systems, all physical communication between the processors is done by passing messages across the network that interconnects the processors. In this type of System Processors are expandable and can have unlimited number of processor. Loosely coupled systems, are referred to as distributed computing systems. Various Models are used for building Distributed Computing System: 4.1) Minicomputer Model It is a simple extension of the centralized time-sharing system. A distributed computing system based on this classical consists of a few minicomputers or large supercomputers unified by a communication network. Each minicomputer usually has many user simultaneously logged on to it through several terminals linked to it with every user logged on to one exact minicomputer, with remote access to other minicomputers, The network permits a user to access remote resources that are available on same machine other than the one on to which the user is currently logged. The minicomputer model is used when resource sharing with remote users is anticipated. The initial ARPAnet is an example of a distributed computing system based on the minicomputer model. 4.2) Workstation Model Workstation model consists of several workstations unified by a communication network. The best example of a Workstation Model can be a companyââ¬â¢s office or a university department which may have quite a few workstation scattered throughout a building or campus, with each workstation equipped with its individual disk and serving time which is specifically during the night, Notion of using workstation Model is that when certain workstations are idle (not being used), resulting in the waste of great amounts of CPU time the model connects all these workstations by a high-speed LAN so that futile workstations may be used to process jobs of users who are logged onto to other workstations and do not have adequate processing power at their own workstations to get their jobs handled efficiently. A user logs onto one of the workstations which is his ââ¬Å"homeâ⬠workstation and submits jobs for execution if the system does not have sufficient processing power for executing the processes of the submitted jobs resourcefully, it transfers one or more of the processes from the userââ¬â¢s workstation to some other workstation that is currently ideal and gets the process executed there, and finally the outcome of execution is given back to the userââ¬â¢s workstation deprived of the user being aware of it. The main Issue increases if a user logs onto a workstation that was idle until now and was being used to perform a process of another workstation .How the remote process is to be controlled at this time .To handle this type of problem we have three solutions: The first method is to allow the remote process share the resources of the workstation along with its own logged-on userââ¬â¢s processes. This method is easy to apply, but it setbacks the main idea of workstations helping as personal computers, because if remote processes are permitted to execute concurrently with the logged-on userââ¬â¢s own processes, the logged-on user does not get his or her fail-safe response. The second method is to kill the remote process. The main disadvantage of this technique is that all the processing done for the remote process gets lost and the file system may be left in an erratic state, making this method repellent. The third method is to migrating the remote process back to its home workstation, so that its execution can be continued there. This method is tough to implement because it involves the system to support preemptive process migration facility that is stopping the current process when a higher priority process comes into the execution. Thus we can say that the workstation model is a network of individual workstations, each with its own disk and a local file system. The Sprite system and experimental system developed at Zerox PARC are two examples of distributed computing systems, based on the workstation model. 4.3) Workstation-Server Model Workstation Server Model consists of a limited minicomputers and numerous workstations (both diskful and diskless workstations) but most of them are diskless connected by a high speed communication Network. A workstation with its own local disk is generally called a diskful workstation and a workstation without a local disk is named as diskless workstation. The file systems used by these workstations is either applied either by a diskful workstation or by a minicomputer armed with a disk for file storage. One or more of the minicomputers are used for applying the file system. Other minicomputer may be used for providing other types of service area, such as database service and print service. Thus, every minicomputer is used as a server machine to provide one or more types of services. Therefore in the workstation-server model, in addition to the workstations, there are dedicated machines (may be specialized workstations) for running server processes (called servers) for handling and providing access to shared resources. A user logs onto a workstation called his home workstation, Normal computation activities required by the userââ¬â¢s processes are performed at the userââ¬â¢s home workstation, but requirements for services provided by special servers such as a file server or a database server are sent to a server providing that type of service that performs the userââ¬â¢s requested activity and returns the result of request processing to the userââ¬â¢s workstation. Therefore, in this model, the userââ¬â¢s processes need not be migrated to the server machines for getting the work done by those machines. For better complete system performance, the local disk of diskful workstation is normally used for such purposes as storage of temporary file, storage of unshared files, storage of shared files that are rarely changed, paging activity in virtual-memory management, and caching of remotely accessed data. Workstation Server Model is better than Workstation Model in the following ways: It is much cheaper to use a few minicomputers equipped with large, fast disks than a large number of diskful workstations, with each workstation having a small, slow disk. Diskless workstations are also preferred to diskful workstations from a system maintenance point of view. Backup and hardware maintenance are easier to perform with a few large disks than with many small disks scattered all Furthermore, installing new releases of software (such as a file server with new functionalities) is easier when the software is to be installed on a few file server machines than on every workstations. In the workstation-server model, since all files are managed by the file servers, users have the flexibility to use any workstation and access the files in the same manner irrespective of which workstation the user is currently logged on .Whereas this is not true with the workstation model, in which each workstation has its local file system, because different mechanisms are needed to access local and remote files. Unlike the workstation model, this model does not need a process migration facility, which is difficult to implement. In this model, a client process or workstation sends a request to a server process or a mini computer for getting some service such as reading a block of a file. The server executes the request and sends back a reply to the client that contains the result of request processing. A user has guarantied response time because workstations are not used for executing remote process. However, the model does not utilize the processing capability of idle workstation. The V-System (Cheriton 1988) is an example of a distributed computing system that is based on the workstation-server model. 4.4) Processor-Pool Model In the process of pool model the processors are pooled together-to be shared by the users needed. The pool -or processors consist of a large number of micro-computers and minicomputers attached to the network. Each processor in the pool has its own memory to load and run a system program or an application program of the distributed-computing system. The processor-pool model is used for the purpose that most of the time a user does not need any computing power but once in a while he may need a very large amount of computing power for short time (e.g., when recompiling a program consisting of a large number of files after changing a basic shared declaration). In processor-pool model, the processors in the pool have no terminal attached directly to them, and users access the system from terminals that are attached to the network via special devices. These terminals are either small diskless workstations or graphic terminals. A special server called a run server manages and allocates the processors in the pool to different users on a demand basis. When a user submits a job for computation an appropriate number of Processors are temporarily assigned to his or her job by the run server. In this type of model we do not have a concept of home machine, in this when a user logs on he is logged on to the whole system by default. The processor-pool model allows better utilization of the available processing power of a distributed computing system as in this model the entire processing power of the system is available for use by the current logged-on users, whereas this is not true for the workstation-server model in which several workstations may be idle at a particular time but they cannot be used for processing the jobs of other users. Furthermore, the processor-pool model provides greater flexibility than the workstation-server model as the systemââ¬â¢s services can be easily expanded without the need to install any more computers. The processors in the pool can be allocated to act as extra servers to carry any additional load arising from an increased user population or to provide new services. However, the processor-pool model is usually considered to be unsuitable for high-performance interactive application, program of a user is being executed and the terminal via which the user is interacting with the system. The workstation-server model is generally considered to be more suitable for such applications. Amoeba [Mullender et al. 1990]. Plan 9 [Pike et al. 1990], and the Cambridge Distributed Computing System [Needham and Herbert 1982] are examples of distributed computing systems based on the processor-pool model. 5) ISSUES IN DESIGNING A DISTRIBUTED OPERATING SYSTEM To design a distributed operating system is a more difficult task than designing a centralized operating system for several reasons. In the design of a centralized operating system, it is assumed that the operating system has access to complete and accurate information about the environment is which it is functioning. In a distributed system, the resources are physically separated, their is no common clock among the multiple processors as the delivery of messages is delayed, and not have up-to-date, consistent knowledge about the state of the various components of the underlying distributed system .And lack of up-to-date and consistent information makes many thing (such as management of resources and synchronization of cooperating activities) much harder in the design of a distributed operating system,. For example, it is hard to schedule the processors optimally if the operating system is not sure how many of them are up at the moment. Therefore a distributed operating system must be designed to provide all the advantages of a distributed system to its users. That is, the users should be able to view a distributed system as a virtual centralized system that is flexible, efficient, reliable, secure, and easy to use. To meet this challenge, designers of a distributed operating system must deal with several design issues. Some of the key design issues are: 5.1) Transparency The main goal of a distributed operating system is to make the existence of multiple computers invisible (transparent) and that is to provide each user the feeling that he is the only user working on the system. That is, distributed operating system must be designed in such a way that a collection of distinct machines connected by a communication subsystem appears to its users as a virtual unprocessed. Accesses Transparency: Access transparency typically refers to the situation where users should not need or be able to recognize whether a resource (hardware or software) is remote or local. This implies that the distributed operating system should allow users to access remote resource in the same ways as local resources. That is, the user should not be able to distinguish between local and remote resources, and it should be the responsibility of the distributed operating system to locate the resources and to arrange for servicing user requests in a user-transparent manner. Location Transparency: Location Transparency is achieved if the name of a resource is kept hidden and user mobility is there, that is: Name transparency: This refers to the fact that the name of a resource (hardware or software) should not reveal any hint as to the physical location of the resource. Furthermore, such resources, which are capable of being moved from one node to another in a distributed system (such as a file), must be allowed to move without having their names changed. Therefore, resource names must be unique system wide. User Mobility: this refers to the fact that no matter which machine a user is logged onto, he should be able to access a resource with the same name he should not require two different names to access the same resource from two different nodes of the system. In a distributed system that supports user mobility, users can freely log on to any machine in the system and access any resource without making any extra effort. Replication Transparency Replicas or copies of files and other resources are created by the system for the better performance and reliability of the data in case of any loss. These replicas are placed on the different nodes of the distributed System. Both, the existence of multiple copies of a replicated resource and the replication activity should be transparent to the users. Two important issues related to replication transparency are naming of replicas and replication control. It is the responsibility of the system to name the various copies of a resource and to map a user-supplied name of the resource to an appropriate replica of the resource. Furthermore, replication control decisions such as how many copies of resource should be created, where should each copy be placed, and when should a copy be created/deleted should be made entirely automatically by the system in a user -transparent manner. Failure Transparency Failure transparency deals with masking from the users partial failures in the system, Such as a communication link failure, a machine failure, or a storage device crash. A distributed operating system having failure transparency property will continue to function, perhaps in a degraded form, in the face of partial failures. For example suppose the file service of a distributed operating system is to be made failure transparent. This can be done by implementing it as a group of file servers that closely cooperate with each other to manage the files of the system and that function in such a manner that the users can utilize the file service even if only one of the file servers is up and working. In this case, the users cannot notice the failure of one or more file servers, except for slower performance of file access operations. Be implemented in this way for failure transparency. An attempt to design a completely failure-transparent distributed system will result in a very slow and highly expensive system due to the large amount of redundancy required for tolerating al l types of failures. Migration Transparency An object is migrated from one node to another for a better performance, reliability and great security. The aim of migration transparency is to ensure that the movement of the object is handled automatically by the system in a user-transparent manner. Three important issues in achieving this goal are as follows: Migration decisions such as which object is to be moved from where to where should be made automatically by the system. Migration of an object from one node to another should not require any change in its name. When the migrating object is a process, the interposes communication mechanism should ensure that a massage sent to the migrating process reaches it without the need for the sender process to resend it if the receiver process moves to another node before the massage is received. Concurrency Transparency In a distributed system multiple users uses the system concurrently. In such a situation, it is economical to share the system resource (hardware or software) among the concurrently executing user processes. However since the number of available resources in a computing system is restricted one user processes, must necessarily influence the action of other concurrently executing processes. For example, concurrent update to the file by two different processes should be prevented. Concurrency transparency means that each user has a feeling that he is the sole user of the system and other users do not exist in the system. For providing concurrency transparency, the recourse sharing mechanisms of the distributed operating system must have the following properties: An event-ordering property ensures that all access requests to various system resources are properly ordered to provide a consistent view to all users of the system. A mutual-exclusion property ensures that at any time at most one process accesses a shared resource, which must not be used simultaneously by multiple processes if program operation is to be correct. A no-starvation property ensures that if every process that is granted a resources which must not be used simultaneously by multiple processes, eventually releases it, every request for that restore is eventually granted. A no-deadlock property ensures that a situation will never occur in which competing process prevent their mutual progress ever though no single one requests more resources than available in the system. Performance Transparency The aim of performance transparency is never get
вторник, 20 августа 2019 г.
Radioactive Decay Coin Experiment
Radioactive Decay Coin Experiment Understanding radioactive decay by experimenting with coins. Abstract The aim of this report is to show how to simulate the radioactive decay process using coins as a safer method of learning, the report is divided into six parts: Introduction: radioactivity, radioactive decay, half-life and the main purpose of the experiments are explained here. Hypothesis of both labs are detailed here. Method: the method to carryout both experiments is in detail in this section, provided in a step by step style that a reader can replicate the experiment himself. Results and discussion: The results of Lab 1 and Lab 2 are thoroughly discussed and analyzed in this section, and my hypothesis is held against the final results of the experiment. Conclusion: the final thought on the results from the experiments and if they did prove the hypothesis or not. References: a full list of all the references that contributed to this report are provided. Appendix: all the final data from Lab 1 and Lab 2 are provided for reference. Introduction Radioactivity can be described as the particles which are emitted from a nuclei as a result of nuclear instability. Radioactive decay is when the isotopes are unstable they tend to discharge energy in the form of radiation. There are a total of three main types of radiation or radioactive decay this depends on the type of the isotope: Alpha decay When there are numerous protons in a nucleus the element will start to discharge radiation in the form of positive charged particles these are called alpha particles. Beta decay When there are numerous neutrons in a nucleus the element will discharge radiation in the form of negative charged particles, these are called beta particles. Gamma decay When there is an excessive amount of energy in the nucleus the gamma particles with no overall charge are discharged from the element. The half-life of an isotope can be explained as the average time that takes half of the total number of atoms in a sample to decay eventually. What this experiment aims to show is how probability is related to radioactive decay. We use coins in this experiment as a model that reflects the randomness of the radioactive decay process. Keeping in mind the randomness of the results from this experiment, one should expect to achieve the desired results eventually (it is a matter of time and trial and error). This experiment is divided into two parts: Lab1 where we deal with a greater number (195 coins in this case) and Lab2 where itââ¬â¢s a much lesser number (16 coins). Hypothesis of the experiments: Since Lab 1 uses a large number of coins (195) there is a probability of 50% that the coins will flip if all of them were to be shaken at once, and this can be a very good representative of how half the atoms in an isotope will decay (half-life). I think that the same can be said about Lab 2 as I expect 50% of the 16 coins to decay as probability is the same regardless of the number of coins. Method Lab 1: we put 195 five pence coins in a big black box shaped folder (all of the coins with their heads side facing up) and shook the box 20 intense shakes each attempt and then we proceed to open the box and count how many coins flipped to their tails side (this represent decaying) and the result gets recorded (number decayed each attempt, accumulated no. decayed and coins left) at the end of each trial the decayed coins are removed from the box. We keep doing this experiment until all coins are flipped to their tails side (decayed). Lab 2: This time we are using less number of coins (16 five pence coins) and we put them in a plastic cup, for each attempt we shake the cup then we flipped the cup upside down on a table, then we check how many coins flipped to their tails side (decayed) for this first throw and we record them, then we put back the heads facing coins back to the cup and we repeat the process of shaking the cup and flipping it on the table until we have 2 heads facing coins or less, and we record how many attempts it took us to have 2 heads coins or less. All of this count as one trial, we do this process for up to 50 trials. Each trial gets recorded separately (Number of coins decayed first throw and number of throws to get 2 or less). An alternative way to do the experiment if it is difficult to do physically is using this online coin toss simulator: http://nrich.maths.org/7220 Results and discussion The results for lab 1 were similar to what I had in theory, approximately 50% of the coins decayed in the first trial and second trial, then the percentage became lesser and more random as the trials goes by. Figure 1: number of coins left (shown as circle markers) and the accumulated number of decayed coins (shown as square markers) against the number of trials. It can be observed in figure 1 that the more coins we have (starting at 195) the higher the decay rate (that can be observed), but the lesser number of coins left the less obvious probability of the coins decaying even though the probability is the same (as the randomness of the decaying process is not related to a certain number of coins) as to make the decaying more obvious in smaller number of coins we did Lab 2: Figure 2: Frequency of the decayed coins in the first throw. As shown in figure 2 the frequency of the 16 coins decaying in the first throw in each trial of the 50 trials is 9 which is still approximately 50% of the total number of coins, this proves my point that the probability of the coins flipping to their tails side (decaying) is the same regardless of the number of the coins in each experiment. Furthermore, the total number of coins decayed out of 16 coins in all of the 50 trials has been calculated and the total percentage was 47.75% again this is approximately 50% of the total number of coins in all of the 50 trials. Figure 3: Frequency of the number of throw to get 2 or less In figure 3 which show the frequency of how many throw of coins we need to reach 2 non-decaying coins or less in each trial (we stop at 2 rather than zero because it will take unnecessary large number of throws per trial), it further proves my hypothesis of the probability of 50% coins decaying as the most frequent number of throws to reach 2 or less was 3, we explain this by saying because 9 coins will mostly flip in the first throw (approximately 50% of the 16 total coins) it will take mostly 3 throws to reach 2 coins in the end because 50% of the coins will probably decay in each throw: 16 Coins > 50% Decay rate (In the first throw) > 8 Coins > 50% Decay rate > 4 Coins > 50% Decay rate > 2 Coins or less = 4 total number of throws going at a decay rate of approximately 50%, 3 throws to reach 2 or less is the most frequent number (also to back up this claim a calculation has been made by calculating the most frequent number of throw to get 2 or less over the total number of 50 trials and the average was 3.08 as provided in the appendix). The decaying process is random in its nature so even if it is likely for the coins to have a 50% decay rate in the experiment done, it cannot be taken for granted. Despite the fact that this final results for this experiment were satisfactory there was still some room for human error in this case, this can vary between simply not counting the coins correctly, to actually losing some of the coins. The experiment could easily be improved by doing the two labs two times between two students and they can compare the results afterwards. Another improvement can be done to the equipment that was being used as the box folder used in lab 1 had some holes in it that was not perfect for shaking the coins inside. Otherwise the coins themselves were all of the same kind (five pence) all of them having the same size and shape helped greatly in avoiding any confusion for the students doing the experiment. Obliviously since this is a student level experiment the equipment and method used were humble but satisfactory, but if this experiment were to be replicated by a higher level institution for a more serious cause then a machine should be used for tossing and counting the coins to get more accurate results. Conclusion The final results of the experiment were satisfactory and have proven my hypothesis and were helpful in understanding the randomness of the radioactive decay process, but as mentioned before, we can achieve better and more accurate results using more advanced methods. References (Ducksters,2015) http://www.ducksters.com/science/chemistry/radiation_and_radioactivity.php (Physics.org) http://www.physics.org/article-questions.asp?id=71 (Mini Physics) http://www.miniphysics.com/radioactive-decay.html (Probability Formula,2011) http://www.probabilityformula.org/ Appendix Table 1: Lab 1 results Table 2: Lab 2 results Table 3: A frequency table of the number of coins decaying in the first throw of each of the 50 trials. Table 4: A frequency table of the number of throws to get 2 non-decayed coins or less throughout the 50 trials.
понедельник, 19 августа 2019 г.
Babe Ruth :: essays research papers
On February 6, 1895, George Herman Ruth, Jr., was born in his grandparents house in Baltimore, Maryland. Ruth as a young child. Ruth’s dad worked as a bartender and owned his own bar. They spent very little time with George because they worked long hours. Eventually, his parents felt that they couldn’t take care of George, and on June 13, 1902, he was taken to St. Mary’s Industrial School for Boys. His custody was also signed over to the Xaverian Brothers, a Catholic Order of Jesuit Missionaries who ran St. Mary’s. St. Mary’s was both a reformatory and orphanage, which was surrounded by a wall like a prison with guards on duty. George, who was always involved in pranks and fights, was classified as "incorrigible" when he was admitted. The only positive thing that happened from going to St. Mary’s was meeting Brother Mathias. Brother Mathias was the disciplinary guy at St. Mary’s. He spent a lot of time with George. He even helped Ruth learn to be a baseball player. Baseball was a popular game for the boys at St. Mary’s and George played well at a young age. He played all positions on the field, was an excellent pitcher and had the ability to hit the ball very well. By his late teens Ruth had developed into a major league baseball prospect. On February 27, 1914, at the age of nineteen, the Baltimore Orioles signed Babe to his first professional baseball contract. Because Ruth’s parents had signed over custody of him to St. Mary’s, he was supposed to remain at the school until he was twenty-one. To go around this, Dunn, the man who signed him, became Ruth’s legal guardian. Just five months after being signed by the Baltimore Orioles, Babe Ruth was sold to the Boston Red Sox. He made his debut as a major leaguer in Fenway Park on July 11, 1914, pitching against the Cleveland Indians. In the mornings, Ruth would frequent Landers’ Coffee Shop in Boston, and it is here that he met Helen Woodford, a seventeen-year-old waitress. They married on October 17, 1914 at St. Paul’s Roman Catholic Church in Ellicott City, Maryland. As Babe’s career began to blossom and his salary increased, by 1919 he was making $10,000 per year, he and Helen were able to buy a home outside of Boston in Sudbury, Massachusetts. In December of 1919 Babe was sold to the New York Yankees, owned by Colonel Jacob Ruppert and managed by Miller Huggins.
воскресенье, 18 августа 2019 г.
Project Mercury :: essays research papers
Project Mercury à à à à à Project Mercury, the first manned U.S. space project, became an official NASA program on October 7, 1958. The Mercury Program was given two main but broad objectives: 1. to investigate manââ¬â¢s ability to survive and perform in the space environment and 2. to develop basic space technology and hardware for manned space flight programs to come. à à à à à NASA also had to find astronauts to fly the spacecraft. In 1959 NASA asked the U.S. military for a list of their members who met certain qualifications. All applicants were required to have had extensive jet aircraft flight experience and engineering training. The applicants could be no more than five feet eleven inches tall, do to the limited amount of cabin space that the Mercury modules provided. All who met these requirements were also required to undergo numerous intense physical and psychological evaluations. Finally, out of a field of 500 people who met the experience, training, and height requirements, NASA selected seven to become U.S. astronauts. There names, Lieutenant M. Scott Carpenter; Air Force Captains L. Gordon Cooper, Jr., Virgil ââ¬Å" Gusâ⬠Grissom, and Donald K. ââ¬Å"Dekeâ⬠Slayton; Marine Lieutenant Colonel John H. Glenn, Jr.; and Navy Lieutenant commanders Walter M. Schirra, Jr., and Alan B. Shepard, Jr. Of these, all flew in Project Mercury except Deke Slayton who was grounded for medical reasons. He later became an American crewmember of the Apollo-Soyuz Test Project. à à à à à The Mercury module was a bell shaped craft. Its base measured exactly 74.5 inches wide and it was nine feet tall. For its boosters NASA chose two U.S. military rockets: the Armyââ¬â¢s Redstone, which provided 78,000 pounds of thrust, was used for suborbital flights, and the Air Force Atlas, providing 360,000 pounds of thrust, was used for orbital fights. The Mercury craft was fastened to the top of the booster for launch. Upon reaching the limits of Earthââ¬â¢s atmosphere the boosters were released from the module, and fell into uninhabited ocean. à à à à à The first Mercury launch was performed on May 5, 1961. The ship, Freedom 7, was the first U.S. craft used for manned space flight. Astronaut Alan Shepard, Jr. remained in suborbital flight for 15 minutes and 22 seconds, with an accumulated distance of 116 miles. à à à à à The second and final suborbital mission of the Mercury Project was launched on July 21, 1961. Gus Grissom navigated his ship, Liberty Bell 7, through flight for just 15 seconds longer than the previous mission. à à à à à The next Mercury flight was accomplished using an Atlas booster. On February 20,1962 it fired up and launched John Glenn, Jr., inside Friendship 7, into orbit. Glenn orbited Earth three times and when he returned the country
Подписаться на:
Сообщения (Atom)