Methods of controlling round-off error in one-step methods in the numerical solution of ordinary differential equations are compared. A new Algorithm called theoretical cumulative rounding is formulated. Round-off error bounds are obtained for single precision, and theoretical cumulative rounding. Limits of these bounds are obtained as the step length approaches zero. It is shown that the limit of the bound on the round-off error is unbounded for single precision and double precision, is constant for theoretical partial double precision, and is zero for theoretical cumulative rounding. The limits of round-off bounds are not obtainable in actual practice. The round-off error increases for single precision, remains about constant for partial double precision and decreases for cumulative rounding as the step length decreases. Several examples are included. (34 pages)

In 1985 a settlement and subsistence model of seasonal round mobility was proposed by Statistical Research, Inc. This model proposed four travel routes used by the Late Prehistoric Serrano to access the higher elevation village site known as Rock Camp to gather acorns and pinyon nuts in the fall. This research investigates the proposed routes, as well as an additional route, for energy efficiency and archaeological evidence of use in prehistory. Data collection involved using experimental methods designed to gather controlled physiological data for evaluating the efficiency of traveling each route. Archaeological sites present on the travel routes and within the research area and were analyzed for elements indicative of prehistoric settlement characteristics. A combination of physiological evidence and archaeological evidence are the basis for determinations on which routes were most likely to have been used in prehistory. An analysis of the settlement model is also provided in order to provide future research with guidelines and context for evaluating sites within the region. Suggestions are provided for future studies to focus on chronology and expansion of the settlement model.

Real-time system refers to the computing, communication, and information system with deadline requirements. To meet these deadline requirements, most systems use a mechanism known as the schedulability test which determines whether each of the admitted tasks can meet its deadline. A new task will not be admitted unless it passes the schedulability test. Schedulability tests can be either direct or indirect. The utilization based schedulability test is the most common schedulability test approach, in which a task can be admitted only if the total system utilization is lower than a pre-derived bound. While the utilization bound based schedulability test is simple and effective, it is often difficult to derive the bound. For its analytical complexity, utilization bound results are usually obtained on a case-by-case basis. In this dissertation, we develop a general framework that allows effective derivation of schedulability bounds for different workload patterns and schedulers. We introduce an analytical model that is capable of describing a wide range of tasks' and schedulers'€™ behaviors. We propose a new definition of utilization, called workload rate. While similar to utilization, workload rate enables flexible representation of different scheduling and workload scenarios and leads to uniform proof of schedulability bounds. We introduce two types of workload constraint functions, s-shaped and r-shaped, for flexible and accurate characterization of the task workloads. We derive parameterized schedulability bounds for arbitrary static priority schedulers, weighted round robin schedulers, and timed token ring schedulers. Existing utilization bounds for these schedulers are obtained from the closed-form formula by direct assignment of proper parameters. Some of these results are applied to a cluster computing environment. The results developed in this dissertation will help future schedulability bound analysis by supplying a unified modeling framework and will ease the implementation practical real-time systems by providing a set of ready to use bound results.

This thesis aims to improve sales forecasting in the context of passenger airlines. We study two important issues that could potentially improve forecasting accuracy: day-to-day price change rather than price itself, and linking flights that are likely to be considered as pairs for a round trip by passengers; we refer to the latter as the Round-Trip Model (RTM). We find that price change is a significant variable regardless of days remaining to flight in the last three weeks to flight departure, which opens the possibility of planning for revenue maximizing price change patterns. We also find that the RTM can improve the precision of the forecasting models, and provide an improved pricing strategy for planners. In the study of the effect of price change on sales, analysis of variance is applied; finite regression mixture models were tested to identify linked traffic in the two directions and the linked flights on a route in reverse directions; adaptive neuro-fuzzy inference system (ANFIS) is applied to develop comparative models for studying sales effect between price and price change, and one-way versus round-trip models. The price change model demonstrated more robust results with comparable estimation errors, and the concept model for the round-trip with only one linked flight reduced estimation error by 5%. This empirical study is performed on a database with 22,900 flights which was obtained from a major North American passenger airline.

In these few years, gradually Internet develops to wideband, multimedia is being used on video or music. In addition, the use of IP Multicast must be based on the deployment of routers, which is too difficult to arrange. Utilities of Application Layer Multicast is in the middle and just between IP Multicast and Unicast.Therefore, in this paper, Application Layer Multicast is still worth to study it. In this paper, is applied effectively build the Application Layer Multicast. Control through the IP Anycast Technique, we can lower the time for host join the Multicast Tree. Every host can join the nearest cluster. We use the hierarchical cluster-based Method in order to serve more hosts. This concept about cluster can substantially decrease control overhead. The Complete Binary Trees lower the cluster leader¡¦s burden, also phased RTT decided effectively the transit sequence. In Summary, associate techniques with methods, to make up the defects from NICE and I-Zigzag.

In presplit blasting operations airborne energy called air blast overpressure or impulsive sound is produced. The air blast induced by blasting may vary significantly at or around an open pit mine depending on several parameters such as the amount of charge detonated, the physical distance between the blast and the monitoring locations and the weather conditions. Therefore evaluation and assessment of noise condition at or around an open pit mine is necessary. The objective of this research study is to monitor and record the noise and to investigate and assess the noise conditions that will be induced from presplit blasting operations at Kisladag Gold Mine. In this research study, several parameters such as the amount of charge, the physical distance to the location of monitoring device or residential structures and the weather condition parameters such as wind direction, wind speed were recorded, analyzed and evaluated. It is observed that with increasing charge per delay air overpressure increases, whereas with increasing scaled distances it decreases. It is also understood that wind speed and the direction are effective in air overpressure propagation also, but this subject needs further investigation. It is concluded that according to the U.S. regulations there is no damage risk to the structures and no disturbance to the inhabitants at present. Due to the uncertainties in weather conditions, in order not to take any risks, the charge amount per delay should be kept at 35 kg or less for presplit blasting at the mine.

This thesis analyzes World Trade Organization Doha Round negotiation process and its implications for Turkey&rsquo / s relations with its neighbors. The thesis mainly focuses on two pillars of negotiating package, namely agricultural and non-agricultural products (NAMA) negotiations. Both segments of negotiations have different dimensions due to Turkey&rsquo / s regional and multilateral obligations. As a developing country, Turkey&rsquo / s position in agriculture is more in line with other developing countries / in NAMA however it defends more liberal policies because of its Customs Union with the EU. Results of Doha Round will affect not only Turkey but also Turkey&rsquo / s neighbors and these effects will be more dramatic in some of them. Chapter I is Introduction Chapter. Chapter II evaluates Doha Round in detail / Chapters III and IV examine agriculture and NAMA negotiations and their implications for Turkey. Chapter V evaluates other negotiation topics such as services, trade facilitation, environment and rules. Chapter VI analyzes Turkey&rsquo / s Customs Union with the EU and its bilateral trade arrangements. The last Chapter is the Conclusion.

Real-time system refers to the computing, communication, and information system with deadline requirements. To meet these deadline requirements, most systems use a mechanism known as the schedulability test which determines whether each of the admitted tasks can meet its deadline. A new task will not be admitted unless it passes the schedulability test. Schedulability tests can be either direct or indirect. The utilization based schedulability test is the most common schedulability test approach, in which a task can be admitted only if the total system utilization is lower than a pre-derived bound. While the utilization bound based schedulability test is simple and effective, it is often difficult to derive the bound. For its analytical complexity, utilization bound results are usually obtained on a case-by-case basis. In this dissertation, we develop a general framework that allows effective derivation of schedulability bounds for different workload patterns and schedulers. We introduce an analytical model that is capable of describing a wide range of tasks' and schedulers'€™ behaviors. We propose a new definition of utilization, called workload rate. While similar to utilization, workload rate enables flexible representation of different scheduling and workload scenarios and leads to uniform proof of schedulability bounds. We introduce two types of workload constraint functions, s-shaped and r-shaped, for flexible and accurate characterization of the task workloads. We derive parameterized schedulability bounds for arbitrary static priority schedulers, weighted round robin schedulers, and timed token ring schedulers. Existing utilization bounds for these schedulers are obtained from the closed-form formula by direct assignment of proper parameters. Some of these results are applied to a cluster computing environment. The results developed in this dissertation will help future schedulability bound analysis by supplying a unified modeling framework and will ease the implementation practical real-time systems by providing a set of ready to use bound results.

<p>Denna rapport undersöker krav, tagna från ett ramverk för evaluering av CASE-verktyg i ett kontextuellt sammanhang, i två representativa CASE-verktyg. Ramverket utnyttjar en modell som föreslagits av Lundell och Lings för att extrahera både krav och förväntningar som en organisation (www.it.volvo.com) hade på vad ett CASE-verktyg är och kan utföra.</p><p>Ramverket extraherar krav i ett organisationell kontext, dvs. utvärderingen utfördes innan verktyget som evaluerades användes i organisationen. Detta indikerar på att kraven inte är knutna till ett specifikt verktyg, samt att CASE-verktyg inte säkert stödjer dessa krav.</p><p>Resultatet för denna rapport är att viss semantisk förlust uppstod vid transformering av kod och modeller.</p>

Thesis (Ph. D.)--University of Texas at Austin, 2005. / Includes bibliographical references (leaves 210-223).