The Coase Theorem and Western US Appropriative Water Rights

The Article analyzes the prior appropriation system in the Western U.S. as a compelling application of the Coase Theorem. In the overall prior appropriation system, few statutory transfers occur, but there are thriving transfer markets in the smaller-scale context of water districts. This suggests that the system at large is not at Coase Equilibrium, but that Equilibrium does prevail inside the water institutions. Institutions facilitate low transaction costs and secure property rights, and catalyze an iterative process that tends toward Coase Equilibrium. The Article makes policy recommendations regarding the formation of larger-scale water institutions to reduce deadweight losses by expanding the scope of Coase Equilibrium within the prior appropriation system

Reconstruction of Yamaha XS400 motorcycle

Cílem této práce je navrhnout zvedací plošinu na motocykl a popsat rekonstrukci motocyklu Yamaha XS 400 na typ Café Racer. Obsahem je návrh a 3D model plošinového zvedáku, pevnostní kontrola a dokumentace jednotlivých postupů rekonstrukce.The aim of this thesis is to design lifting platform for motorcycle and describe reconstructi-on of motorcycle Yamaha XS 400 to Café Racer. Content of this thesis is design and 3D model of lifting platform, strenght check and documentation of individual method of recon-struction.

Implementation of service functions for work with MIB database in simulation environment OPNET Modeler

Předmětem této bakalářské práce je implementace obslužných funkcí pro práci s databází MIB. Databáze MIB je systémová databáze, která slouží k uchovávání řídících informací v síťových uzlech. První kapitola slouží jako lehký úvod do řízení počítačových sítí. Druhá kapitola popisuje základní rysy protokolu SNMP. Protokol SNMP je standardizovaný aplikační protokol, který slouží k přenosu řídících informací z a do systémové databáze MIB. Protokol je založen na konceptu manager – agent, kdy aktivní je až na výjimky vždy manager, který se dotazuje agenta na hodnoty konkrétních položek. Strukturou a standardy pro systémové databáze MIB se zabývá další kapitola. Popisuje základní větvení mezi správními organizacemi. Hlavní část práce je věnována návrhu a implementaci obslužných funkcí databáze MIB. V této kapitole jsou identifikovány hlavní požadavky na databázi MIB z hlediska spolupráce s protokolem SNMP. Tyto procesy jsou dále zapracovány do experimentální implementace databáze MIB. Implementace je napsána v jazyce C++. Z návrhu vznikl hlavičkový soubor tříd a podpůrných funkcí, jež implementují základní mechanizmy databáze MIB a jejích metod pro obsluhu této databáze. Hlavičkový soubor obsahuje též několik procesů pro ulehčení spolupráce databáze MIB s aplikačním protokolem SNMP. Závěrečná kapitola ukazuje používání navržených tříd. Vytvořený program je vybaven grafickým rozhranním, které využívá funkcí určených pro místní přístup. Mezi další ukázané funkce program patří velmi jednoduchý modul pro komunikaci s databází prostřednictvím zpráv SNMP.Implementation of service for work with MIB database is subjeckt the bachelor’s thesis. MIB database is system database which is instrumental for storage of control informations in network elements. A first chapter is instrumental like a introduction to the control computer networks. A second chapter describes the basic features of protocol SNMP. The protocol SNMP is a standardized application protocol which uses for a transmission control informacions from and to the system database MIB. The protocol is based on a draft manager-agent when the manager is mostly active who enquire of the agent for the values of concrete items. A next chapter deals with a structure and standards for the MIB database. It describes a basic enbranchment among the administrative organizations. A main part of working is devoted to a proposal and a implementation of servece functions MIB database. The main requirements for the MIB database in light of a cooperation with the protocol SNMP are identified in this chapter. These processes are trained-in to the experiment implementation of MIB database. The implementation is written in C++. A header file of the classes and supportive functions who implement basic mechanisms of MIB database and its methods for a tender the database created from the proposal. The header file contains the several processes for an easement of cooperation MIB database with the application protocol SNMP, too. A final chapter shows the using of designed classes. The created programe is equipped with a graphics interface who uses the functions for a local access. Very easy modul for the comunication with the database through the messages of SNMP is among next shown functions in the programe.

On-line planning and scheduling: an application to controlling modular printers

We present a case study of artificial intelligence techniques applied to the control of production printing equipment. Like many other real-world applications, this complex domain requires high-speed autonomous decision-making and robust continual operation. To our knowledge, this work represents the first successful industrial application of embedded domain-independent temporal planning. Our system handles execution failures and multi-objective preferences. At its heart is an on-line algorithm that combines techniques from state-space planning and partial-order scheduling. We suggest that this general architecture may prove useful in other applications as more intelligent systems operate in continual, on-line settings. Our system has been used to drive several commercial prototypes and has enabled a new product architecture for our industrial partner. When compared with state-of-the-art off-line planners, our system is hundreds of times faster and often finds better plans. Our experience demonstrates that domain-independent AI planning based on heuristic search can flexibly handle time, resources, replanning, and multiple objectives in a high-speed practical application without requiring hand-coded control knowledge

Investigation of land use of northern megalopolis using ERTS-1 imagery

Primary objective was to produce a color-coded land use map and digital data base for the northern third of Megalopolis. Secondary objective was to investigate possible applications of ERTS products to land use planning. Many of the materials in this report already have received national, dissemination as a result of unexpected interest in land use surveys from ERTS. Of special historical interest is the first comprehensive urban-type land use map from space imagery, which covered the entire state of Rhode Island and was made from a single image taken on 28 July 1972

Best-first heuristic search for multicore machines

To harness modern multicore processors, it is imperative to develop parallel versions of fundamental algorithms. In this paper, we compare different approaches to parallel best-first search in a shared-memory setting. We present a new method, PBNF, that uses abstraction to partition the state space and to detect duplicate states without requiring frequent locking. PBNF allows speculative expansions when necessary to keep threads busy. We identify and fix potential livelock conditions in our approach, proving its correctness using temporal logic. Our approach is general, allowing it to extend easily to suboptimal and anytime heuristic search. In an empirical comparison on STRIPS planning, grid pathfinding, and sliding tile puzzle problems using 8-core machines, we show that A*, weighted A* and Anytime weighted A* implemented using PBNF yield faster search than improved versions of previous parallel search proposals