Hotel Valuation Software, Version 4.0

[Updated August 2016] The Hotel Valuation Software, freely available from Cornell’s Center for Hospitality Research, has been updated to reflect the many changes in the 11th Edition of the Uniform System of Accounts for the Lodging Industry (USALI). Version 4.0 of the Hotel Valuation Software provides numerous enhancements over the original tool from 2011. In addition to a significant increase in functionality and an update to reflect the 11th edition of the USALI, Version 4.0 takes advantage of the power of the latest release of Microsoft Excel®. Note that Version 4.0 works only on a PC running Microsoft Windows, it does not work on a Mac running OS X. Users desiring an OS X compatible version should click here (Labeled as Version 2.5). 酒店评估软件手册和三个程序（点击这里 ) Users desiring a Mandarin version of the Hotel Valuation Software should click here The Hotel Valuation Software remains the only non-proprietary computer software designed specifically to assist in the preparation of market studies, forecasts of income and expense, and valuations for lodging property. The software provides an accurate, consistent, and cost-effective way for hospitality professionals to forecast occupancy, revenues and expenses and to perform hotel valuations. Version 4.0 of the Hotel Valuation Software includes the following upgrades – a complete update to reflect the 11th edition of the USALI – the most significant change to the chart of accounts in a generation, an average daily rate forecasting tool, a much more sophisticated valuation module, and an optional valuation tool useful in periods of limited capital liquidity. Using established methodology, the Hotel Valuation Software is a sophisticated tool for lodging professionals. The tool consists of three separate software programs written as Microsoft Excel files and a software users' guide. The tool is provided through the generosity of HVS and the School of Hotel Administration. The three software modules are: Room Night Analysis and Average Daily Rate: Enables the analyst to evaluate the various competitive factors such as occupancy, average room rate, and market segmentation for competitive hotels in a local market. Calculates the area-wide occupancy and average room rate, as well as the competitive market mix. Produce a forecast of occupancy and average daily rate for existing and proposed hotels in a local market. The program incorporates such factors as competitive occupancies, market segmentation, unaccommodated demand, latent demand, growth of demand, and the relative competitiveness of each property in the local market. The program outputs include ten-year projections of occupancy and average daily rate. Fixed and Variable Revenue and Expense Analysis: The key to any market study and valuation is a supportable forecast of revenues and expenses. Hotel revenue and expenses are comprised of many different components that display certain fixed and variable relationships to each other. This program enables the analyst to input comparable financial operating data and forecast a complete 11-year income and expense statement by defining a small set of inputs: The expected future occupancy levels for the subject hotel Base year operating data for the subject hotel Fixed and variable relationships for revenues and expenses Expected inflation rates for revenues and expenses Hotel Capitalization Software: A discounted cash flow valuation model utilizing the mortgage-equity technique forms the basis for this program. Values are produced using three distinct underwriting criteria: A loan-to-value ratio, in which the size of the mortgage is based on property value. A debt coverage ratio (also known as a debt-service coverage ratio), in which the size of the mortgage is based on property level cash flow, mortgage interest rate, and mortgage amortization. A debt yield, in which the size of the mortgage is based on property level cash flow. By entering the terms of typical lodging financing, along with a forecast of revenue and expense, the program determines the value that provides the stated returns to the mortgage and equity components. The program allows for a variable holding period from four to ten years The program includes an optional model useful during periods of capital market illiquidity that assumes a property refinancing during the holding period

Neotectonics of the southwest Portugal mainland : implications on the regional seismic hazard

Tese de doutoramento, Geologia (Geodinâmica Interna), Universidade de Lisboa, Faculdade de Ciências, 2015

Pulsed extremely low-frequency magnetic fields stimulate microvesicle release from human monocytic leukaemia cells

Microvesicles are released from cell surfaces constitutively during early apoptosis or upon activation with various stimuli including sublytic membrane attack complex (MAC). This study shows that an alternating current, pulsed, extremely low-frequency electromagnetic field (0.3 μT at 10 Hz, 6 V AC) induced transient plasma membrane damage that allowed calcium influx. This in turn caused a release of stimulated microvesicles (sMV). When extracellular calcium was chelated with EGTA, sMV biogenesis initiated by ELFMF was markedly reduced and the reduction was less than when the stimulation was the deposition of sublytic MAC. This suggested that pulsed ELFMF resulted in transcellular membrane pores causing organelles to leak additional calcium into the cytoplasm (which EGTA would not chelate) which itself can lead to sMV release.

Sei whale (Balaenoptera borealis) ecology and management in the North Atlantic

Tese de Doutoramento em Ciências do Mar, especialidade em Ecologia Marinha.

Adding local priority-based dispatching mechanisms to P-NET networks: a fixed priority approach

In this paper we address the real-time capabilities of P-NET, which is a multi-master fieldbus standard based on a virtual token passing scheme. We show how P-NET’s medium access control (MAC) protocol is able to guarantee a bounded access time to message requests. We then propose a model for implementing fixed prioritybased dispatching mechanisms at each master’s application level. In this way, we diminish the impact of the first-come-first-served (FCFS) policy that P-NET uses at the data link layer. The proposed model rises several issues well known within the real-time systems community: message release jitter; pre-run-time schedulability analysis in non pre-emptive contexts; non-independence of tasks at the application level. We identify these issues in the proposed model and show how results available for priority-based task dispatching can be adapted to encompass priority-based message dispatching in P-NET networks.

Extração e caracterização de extratos de Jatropha gossypiifolia L.: avaliação da sua atividade antimicrobiana e antioxidante

Trabalho Final de Mestrado para obtenção do grau de mestre em Engenharia Química e Biológica

RadiaLE: A framework for designing and assessing link quality estimators in wireless sensor networks

Stringent cost and energy constraints impose the use of low-cost and low-power radio transceivers in large-scale wireless sensor networks (WSNs). This fact, together with the harsh characteristics of the physical environment, requires a rigorous WSN design. Mechanisms for WSN deployment and topology control, MAC and routing, resource and mobility management, greatly depend on reliable link quality estimators (LQEs). This paper describes the RadiaLE framework, which enables the experimental assessment, design and optimization of LQEs. RadiaLE comprises (i) the hardware components of the WSN testbed and (ii) a software tool for setting-up and controlling the experiments, automating link measurements gathering through packets-statistics collection, and analyzing the collected data, allowing for LQEs evaluation. We also propose a methodology that allows (i) to properly set different types of links and different types of traffic, (ii) to collect rich link measurements, and (iii) to validate LQEs using a holistic and unified approach. To demonstrate the validity and usefulness of RadiaLE, we present two case studies: the characterization of low-power links and a comparison between six representative LQEs. We also extend the second study for evaluating the accuracy of the TOSSIM 2 channel model.

JamLab: augmenting sensornet testbeds with realistic and controlled interference generation

Radio interference drastically affects the performance of sensor-net communications, leading to packet loss and reduced energy-efficiency. As an increasing number of wireless devices operates on the same ISM frequencies, there is a strong need for understanding and debugging the performance of existing sensornet protocols under interference. Doing so requires a low-cost flexible testbed infrastructure that allows the repeatable generation of a wide range of interference patterns. Unfortunately, to date, existing sensornet testbeds lack such capabilities, and do not permit to study easily the coexistence problems between devices sharing the same frequencies. This paper addresses the current lack of such an infrastructure by using off-the-shelf sensor motes to record and playback interference patterns as well as to generate customizable and repeat-able interference in real-time. We propose and develop JamLab: a low-cost infrastructure to augment existing sensornet testbeds with accurate interference generation while limiting the overhead to a simple upload of the appropriate software. We explain how we tackle the hardware limitations and get an accurate measurement and regeneration of interference, and we experimentally evaluate the accuracy of JamLab with respect to time, space, and intensity. We further use JamLab to characterize the impact of interference on sensornet MAC protocols.

Bandwidth allocation in hexagonal wireless sensor networks for real-time communications

We present an algorithm for bandwidth allocation for delay-sensitive traffic in multi-hop wireless sensor networks. Our solution considers both periodic as well as aperiodic real-time traffic in an unified manner. We also present a distributed MAC protocol that conforms to the bandwidth allocation and thus satisfies the latency requirements of realtime traffic. Additionally, the protocol provides best-effort service to non real-time traffic. We derive the utilization bounds of our MAC protocol.

Improving quality-of-service in wireless sensor networks by mitigating “Hidden-Node Collisions”

Wireless sensor networks (WSNs) emerge as underlying infrastructures for new classes of large-scale networked embedded systems. However, WSNs system designers must fulfill the quality-of-service (QoS) requirements imposed by the applications (and users). Very harsh and dynamic physical environments and extremely limited energy/computing/memory/communication node resources are major obstacles for satisfying QoS metrics such as reliability, timeliness, and system lifetime. The limited communication range of WSN nodes, link asymmetry, and the characteristics of the physical environment lead to a major source of QoS degradation in WSNs-the ldquohidden node problem.rdquo In wireless contention-based medium access control (MAC) protocols, when two nodes that are not visible to each other transmit to a third node that is visible to the former, there will be a collision-called hidden-node or blind collision. This problem greatly impacts network throughput, energy-efficiency and message transfer delays, and the problem dramatically increases with the number of nodes. This paper proposes H-NAMe, a very simple yet extremely efficient hidden-node avoidance mechanism for WSNs. H-NAMe relies on a grouping strategy that splits each cluster of a WSN into disjoint groups of non-hidden nodes that scales to multiple clusters via a cluster grouping strategy that guarantees no interference between overlapping clusters. Importantly, H-NAMe is instantiated in IEEE 802.15.4/ZigBee, which currently are the most widespread communication technologies for WSNs, with only minor add-ons and ensuring backward compatibility with their protocols standards. H-NAMe was implemented and exhaustively tested using an experimental test-bed based on ldquooff-the-shelfrdquo technology, showing that it increases network throughput and transmission success probability up to twice the values obtained without H-NAMe. H-NAMe effectiveness was also demonstrated in a target tracking application with mobile robots - over a WSN deployment.

Efficient aggregate computations in large-scale dense WSN

We focus on large-scale and dense deeply embedded systems where, due to the large amount of information generated by all nodes, even simple aggregate computations such as the minimum value (MIN) of the sensor readings become notoriously expensive to obtain. Recent research has exploited a dominance-based medium access control(MAC) protocol, the CAN bus, for computing aggregated quantities in wired systems. For example, MIN can be computed efficiently and an interpolation function which approximates sensor data in an area can be obtained efficiently as well. Dominance-based MAC protocols have recently been proposed for wireless channels and these protocols can be expected to be used for achieving highly scalable aggregate computations in wireless systems. But no experimental demonstration is currently available in the research literature. In this paper, we demonstrate that highly scalable aggregate computations in wireless networks are possible. We do so by (i) building a new wireless hardware platform with appropriate characteristics for making dominance-based MAC protocols efficient, (ii) implementing dominance-based MAC protocols on this platform, (iii) implementing distributed algorithms for aggregate computations (MIN, MAX, Interpolation) using the new implementation of the dominance-based MAC protocol and (iv) performing experiments to prove that such highly scalable aggregate computations in wireless networks are possible.

A traffic differentiation add-on to the IEEE 802.15.4 protocol: implementation and experimental validation over a real-time operating system

The IEEE 802.15.4 is the most widespread used protocol for Wireless Sensor Networks (WSNs) and it is being used as a baseline for several higher layer protocols such as ZigBee, 6LoWPAN or WirelessHART. Its MAC (Medium Access Control) supports both contention-free (CFP, based on the reservation of guaranteed time-slots GTS) and contention based (CAP, ruled by CSMA/CA) access, when operating in beacon-enabled mode. Thus, it enables the differentiation between real-time and best-effort traffic. However, some WSN applications and higher layer protocols may strongly benefit from the possibility of supporting more traffic classes. This happens, for instance, for dense WSNs used in time-sensitive industrial applications. In this context, we propose to differentiate traffic classes within the CAP, enabling lower transmission delays and higher success probability to timecritical messages, such as for event detection, GTS reservation and network management. Building upon a previously proposed methodology (TRADIF), in this paper we outline its implementation and experimental validation over a real-time operating system. Importantly, TRADIF is fully backward compatible with the IEEE 802.15.4 standard, enabling to create different traffic classes just by tuning some MAC parameters.

WiDom: a dominance protocol for wireless medium access

In this paper, we address the problem of sharing a wireless channel among a set of sporadic message streams where a message stream issues transmission requests with real-time deadlines. We propose a collision-free wireless medium access control (MAC) protocol which implements static-priority scheduling, supports a large number of priority levels and is fully distributed. It is an adaptation to a wireless channel of the dominance protocol used in the CAN bus. But, unlike that protocol, our protocol does not require a node having the ability to receive an incoming bit from the channel while transmitting to the channel. The evaluation of the protocol with real embedded computing platforms is presented to show that the proposed protocol is in fact collision-free and prioritized. We measure the response times of our implementation and show that the response-time analysis developed for the protocol offers an upper bound on the response times.

Static-priority scheduling over wireless networks with multiple broadcast domains

We propose a wireless medium access control (MAC) protocol that provides static-priority scheduling of messages in a guaranteed collision-free manner. Our protocol supports multiple broadcast domains, resolves the wireless hidden terminal problem and allows for parallel transmissions across a mesh network. Arbitration of messages is achieved without the notion of a master coordinating node, global clock synchronization or out-of-band signaling. The protocol relies on bit-dominance similar to what is used in the CAN bus except that in order to operate on a wireless physical layer, nodes are not required to receive incoming bits while transmitting. The use of bit-dominance efficiently allows for a much larger number of priorities than would be possible using existing wireless solutions. A MAC protocol with these properties enables schedulability analysis of sporadic message streams in wireless multihop networks.

How a cyber-physical system can efficiently obtain a snapshot of physical information even in the presence of sensor faults

We present a distributed algorithm for cyber-physical systems to obtain a snapshot of sensor data. The snapshot is an approximate representation of sensor data; it is an interpolation as a function of space coordinates. The new algorithm exploits a prioritized medium access control (MAC) protocol to efficiently transmit information of the sensor data. It scales to a very large number of sensors and it is able to operate in the presence of sensor faults.