202,434 research outputs found
The Samuel T. Smith House at Waterloo Village
No full textThe Samuel T. Smith House at Waterloo Village
fullsizeoutput_c58 (4).jpeg
The Samuel T. Smith House was built in 1761 during the forge era. Also called the Ironmaster's house needs major interior and exterior renovations. Damage was caused to this building when a severe weather event of some kind washed out eighty feet of the dam, the bridge and caused major damage to the forge, mills and hydropower systems.Original file name fullsizeoutput_c58 (4).jp
Letter, Aubrey House to James T. Carlisle, August 28, 1944
No full textThis letter, dated August 28, 1944, is written from Aubrey House in Houston, Mississippi to James T. Carlisle while he is stationed overseas. House updates Carlisle on the crops and harvest plans. Notes from Carlisle\u27s grandfather and mother are also included. The air mail envelope is addressed to Carlisle in New York, New York and postmarked August 27, 1944.https://scholarsjunction.msstate.edu/mss-carlisle-papers/1013/thumbnail.jp
The Predictability of House Prices
No full textThe level and direction of autocorrelation in house price movements differ across areas and change over time. This finding reconciles the conflicting reports in the literature. When quarterly house price indices exhibit negative autocorrelation, autocorrelation shows a positive connection to volatility and a negative connection to rate of return. Autocorrelation between longer time periods is mainly positive; it exhibits a negative relationship with volatility and a positive relationship with rate of return. Volatile house price indices tend to have lower rates of return. It would be possible to obtain excess returns by following a trading strategy based on the estimated autocorrelation.
Popular Matchings in the Capacitated House Allocation Problem
No full textWe consider the problem of finding a popular matching in the Capacitated House Allocation problem (CHA). An instance of CHA involves a set of agents and a set of houses. Each agent has a preference list in which a subset of houses are ranked in strict order, and each house may be matched to a number of agents that must not exceed its capacity. A matching M is popular if there is no other matching M′ such that the number of agents who prefer their allocation in M′ to that in M exceeds the number of agents who prefer their allocation in M to that in M′. Here, we give an O(√C+n1m) algorithm to determine if an instance of CHA admits a popular matching, and if so, to find a largest such matching, where C is the total capacity of the houses, n1 is the number of agents and m is the total length of the agents’ preference lists. For the case where preference lists may contain ties, we give an O(√Cn1+m) algorithm for the analogous problem
Letter, [Author unclear] to Paulina T. Merritt
No full textHandwritten letter to Paulina Merritt from an unknown author, October 1, 1876.
Rock House on Mr. (Lester) Davis Farm
No full textPhotograph of J. T. Porter kneeling next to a 50 year old rock house on Mr. (Lester) Davis' recently purchased farm. The back of the photograph proclaims, ""This rock house is 50 years old as indicated by the date (1909) carved in stone over the door. J. T. Porter in photo. It was occupied in 1939. Mr. Davis has recently purchased this farm.
- …
