Water development and allocation have been among the most important problems Utah has had to face throughout the past 117 years of development . When Utah's first white settlers, the Mormon pioneers, entered Salt Lake Valley in July of 1847, little met their eyes to entice their stay. The earth was so parched and dry that they were unable to scratch the surface with their plows. Less than two hours after their arrival members of the party began digging ditches and building dams to irrigate and soften the earth so they could begin plowing.

<p>In this work we examine a state constrained resource allocation model a with finite time horizon. Therefore, we use the necessary conditions of the Pontrjagin's Maximum Principle to find candidates for the solution and verify them later on using the sufficient conditions given by the duality concept of Klötzler. Moreover, we proof that the solution of the corresponding infinite horizon model does not fulfill the overtaking criterion of Weizsäcker.</p>

The increased use of mobile wireless devices that we have recently been witnessing, such as smartphones, tablets, e-readers, and WiFi enabled devices in general, is driving an unprecedented increase in the amount of data traffic. This fast market adoption of the wireless technology along with the tremendous success of multimedia applications brought about higher capacity, connectivity, and Quality of Service (QoS) requirements that can no longer be met with traditional networking paradigms. As a result, heterogeneous wireless networks have recently emerged as a potential solution for meeting such new requirements. Hybrid wireless mesh networks and femtocell/macrocell networks are examples of these newly emerging heterogeneous networks. While mesh networks are viewed as the backbone/core network, femtocell and cellular networks are viewed as the access networks linking end-users with the backbone networks. In this dissertation, we address the problem of resource allocation in heterogeneous networks. We investigate both types of networks/architectures: next-generation wireless backbone networks or simply wireless mesh networks (WMNs) and next-generation wireless access networks or simply femtocell (FC) networks. WMNs were first introduced to foster the availability of Internet services anywhere and at anytime. However, capacity limitation has been a fundamental challenge to WMNs, mainly due to the interference arising from the wireless nature of the environment as well as to the scarcity of the radio/channel resources. To overcome this problem, we propose in this dissertation an efficient scheduling scheme that reduces interference among active links via wise time and frequency assignments to the wireless mesh routers. The developed scheme is traffic aware in that it maximizes the capacity of wireless links but while accounting for their traffic loads, thus meeting the end-to-end bandwidth requirements as much as possible. In the second part of this thesis, we focus on developing power allocation techniques for FC networks. FCs have recently emerged as a key networking solution that has great potential for improving the capacity and coverage of traditional macrocell (MC) networks through high-speed indoor coverage. Their deployment, however, has given rise to new interference challenges which are mainly due to the FCs' autonomous nature and to the unreliability of the wireless medium. Driven by this fact, in the second part of this thesis, we first design a fully-distributed estimation-based power allocation scheme that aims at fairly maximizing the capacity of FC networks. Second, we propose a novel distributed stochastic power control scheme that aims at maintaining the users' minimum= required QoS. Finally, we provide cross-layer performance analysis of two-tier FC networks, in which we characterize the uplink interference and study its impact on the data-link layer QoS performance in FC networks. / Graduation date: 2013

Thesis (Ph. D.)--University of Texas at Austin, 2006. / Vita. Includes bibliographical references.

Natural gas plants can have multiple owners for raw natural gas streams and processing facilities as well as for multiple products. Therefore, a proper cost allocation method is necessary for taxation of the profits from natural gas and crude oil as well as for cost sharing among gas producers. However, cost allocation methods most often used in accounting, such as the sales value method and the physical units method, may produce unacceptable or even illogical results when applied to natural gas processes. Wright and Hall (1998) proposed a new approach called the design benefit method (DBM), based upon engineering principles, and Wright et al. (2001) illustrated the potential of the DBM for reliable cost allocation for natural gas processes by applying it to a natural gas process. In the present research, a rigorous modeling technique for the DBM has been developed based upon a Taylor series approximation. Also, we have investigated a cost allocation framework that determines the virtual flows, models the equipment, and evaluates cost allocation for applying the design benefit method to other scenarios, particularly those found in the petroleum and gas industries. By implementing these individual procedures on a computer, the proposed framework easily can be developed as a software package, and its application can be extended to large-scale processes. To implement the proposed cost allocation framework, we have investigated an optimization methodology specifically geared toward economic optimization problems encountered in natural gas plants. Optimization framework can provide co-producers who share raw natural gas streams and processing plants not only with optimal operating conditions but also with valuable information that can help evaluate their contracts. This information can be a reasonable source for deciding new contracts for co-producers. For the optimization framework, we have developed a genetic-quadratic search algorithm (GQSA) consisting of a general genetic algorithm and a quadratic search that is a suitable technique for solving optimization problems including process flowsheet optimization. The GQSA inherits the advantages of both genetic algorithms and quadratic search techniques, and it can find the global optimum with high probability for discontinuous as well as non-convex optimization problems much faster than general genetic algorithms.

In this work we examine a state constrained resource allocation model a with finite time horizon. Therefore, we use the necessary conditions of the Pontrjagin's Maximum Principle to find candidates for the solution and verify them later on using the sufficient conditions given by the duality concept of Klötzler. Moreover, we proof that the solution of the corresponding infinite horizon model does not fulfill the overtaking criterion of Weizsäcker.

In this study methods are developed for locating places of education, employment opportunities and housing.The first model allocates places for upper secondary (Am. High School) education in space with the aid of a location-allocation model using capacity constraints and distance-dependent demand. The solution is obtained by an heuristic node-swapping method. For each line of study it sets down the number of locations that could offer such courses, their physical location, their capacities and their geographical catchment areas. The educational resources are allocated according to a criteria that minimizes a weighted sum of geographical distances between the schools and their potential pupils, their applicants and the labour market. In connection with applications of the model, analyses suggest that the location and dimensioning of upper secondary education are primarily steered by the local pupil demand, secondly by the desire for an even regional allocation and thirdly by the demand from the local labour market.In the second model, government employment programmes are allocated among sectors of the economy and sub-districts within a municipality over time. The aim is to offer a sufficient number of employment opportunities for the lowest possible level of public expenditure - irrespective of which support sectors happened to have resources at their disposal at the time of investigation. Given frequencies of persons employed are sought for various groups of people, e.g. men, women, or peripheral residents in the municipality. One general result is that the existing allocation of support resources on sectors only yields less than half as many employment opportunities as could be provided with the same resource input allocated in a different way. Even with a more efficent resource allocation, the amount of support needs to be at least doubled in order to produce national average levels of employment over the long term, within the studied municipality.The third model represents a local housing market with a varying housing stock and population. The changes of accommodation are described for the individual households, giving information on preferences and restrictions. A large proportion of home moves are due to changes in the household composition, changes which are explained internally within the model. The model shows how the new production of housing should be distributed by types of dwelling in different geographically delimited areas over time. The individual's welfare losses during the wait for a new place to live and the costs of empty accommodation are weighed against each other in the allocation algorithm of the model. The model is qualitatively different from traditional models using aggregated data. However models with data on individuals, individual decision processes, and interplay between different actors can probably be developed into usable bases for decision. / digitalisering@umu

Future generation wireless networks are envisioned to provide ubiquitous networking to a wide number of mobile users, promising them the ability to access the various data networks anywhere and anytime. Such networks have motivated the research into efficient management and allocation of the wireless network's limited resources. Heterogeneity also exists amongst the subscribers, i.e. there are those who are willing to spend a little extra on their subscriptions in the prospect of obtaining a better level of service. This work proposes a framework for efficient resource management, while satisfying the heterogeneous QoS demands of the different subscribers. Part of the proposed framework was used to generate mathematical models for the purpose of analyzing the behavior of the system under two different resource management schemes. / February 2006

Network processors are custom high performance embedded processors deployed for a variety of tasks that must operate at high line (Gbits/sec) speeds to prevent packet loss. With the increase in complexity of application domains and larger code store on modern network processors, the network processor programming goes beyond simply exploiting parallelism in packet processing. Unlike the traditional homogeneous threading model, modern network processor programming must support heterogenous threads that execute simultaneously on a microengine. In order to support such demands, we first propose hardware management of registers across multiple threads. In their PLDI 2004 paper, Zhuang and Pande for the first time proposed a compiler based scheme to support register allocation across threads; in this work, we extend their static allocation method to support aggressive register allocation taking dynamic context into account. We also remove the load/stores due to aliased memory accesses converting them into register moves exploiting dead registers. This results in tremendous savings in latency and higher throughput mainly due to the removal of high latency accesses as well as idle cycles. The dynamic register allocator is designed to be light-weight and low latency by undertaking many tradeoffs. In the second part of this work, our goal is to design an automatic register allocation scheme that makes compiler transperant to dual bank register file design for network processors. By design network processors mandate that the operands of an instruction must be allocated to registers belonging to two different banks. The key goal in this work is to take into account dynamic contexts to balance the register pressure across the banks. Key decisions made involve, how and where to map incoming virtual register on a physical register in the bank, how to evict dead ones, and how to minimally undertake bank to bank copies and swaps. It is shown that it is viable to solve both of these problems by simple hardware designs that avail of dynamic contexts. The performance gains are substantial and due to simplicity of the designs (which are also off critical paths) such schemes may be attractive in practice.

Mobile WiMAX multicast communication that is an efficient mechanism for one-to-many transmissions over a broadcast wireless channel is considered as a key technology for supporting emerging broadband multimedia services in the next generation wireless networks, such as Internet Protocol Television (IPTV). Therefore, it is critical to design an efficient multicast resource allocation scheme to support these multimedia services. This thesis proposes a new Band AMC multicast resource allocation scheme for pedestrian mobility environment by collaborating with forward error correction (FEC) coding technology. IPTV multicast is characterized by groups of users watching popular video programs over a wireless fading channel. The proposed scheme can flexibly select efficient channels and appropriate modulation to reduce the resource usage for multicast. Besides, the proposed scheme can provide quality of service (QoS), overcome packet loss and improve the performance over the traditional multicast techniques on Band AMC mode used in today¡¦s wireless OFDMA communication system.