Jewish New Years Card from Editorial Staff at Unzer Sztyme at Bergen Belsen Displaced Persons Camp

Envelope: Small envelope with typewritten address to L. Hendler and Unzer Sztyme stamp on back flap.Card: Small card with printed message in Hebrew with Our Voice stamp. Information Provided by Michael D. Bulmash: 1946 Jewish New Years Card (Shenah Tovah) from the Editorial Staff of Unzer Sztyme (Our Voice) to Mr. L. Hendler, Montreal Canada with red rectangular Displaced Persons Mail/PAID handstamp.https://digital.kenyon.edu/bulmash/1879/thumbnail.jp

Jewish New Years Card from P. Tremen at the Central Jewish Committee From Bergen-Belson Displaced Persons Camp

Envelope: Small envelope with address handwritten in blue ink to L. Hendler and return address written on back flap.Card: Small card with text printed in Hebrew. Information Provided by Michael D. Bulmash: 1946 Jewish New Years Card (Shenah Tovah) from P. Trepmen, Central Jewish Committee, 619 Mil. Gov. Det., BAOR to L. Hendler, Montreal, Canada with red rectangular handstamp Displaced Persons Mail/PAID.https://digital.kenyon.edu/bulmash/1880/thumbnail.jp

Ilan Props., Inc. v. Hendler

The court declined to decide if the tenant has the right to occupy the apartment or if the landlord has standing to evict, finding these issues require Supreme Court resolution due to the agreements\u27 arbitration provisions. The landlord sought to evict the tenant, claiming she no longer used the apartment as her primary residence in violation of the lease. The tenant argued the agreement mandated arbitration and lacked standing for eviction. The court denied both motions for summary judgment and compelled arbitration, but later stayed arbitration upon finding the court, not an arbitrator, should decide the threshold issues of occupancy rights and standing due to the agreements\u27 provisions. Key legal points: 1) Agreements requiring Supreme Court dispute resolution override Housing Court jurisdiction for threshold issues like occupancy rights and standing. 2) Unclear whether the tenant breached the lease or if the landlord has standing for eviction requires further court determination

Wedding Invitation from Bergen-Belsen Displaced Persons Camp

Envelope: Green envelope addressed to L. Hendler in black pen with return address on back flap.Letter: Printed note in Hebrew with geometric design. Information Provided by Michael D. Bulmash: A wedding invitation from Bergen-Belsen to L. Hendler, Montreal, Canada. The invitation reads, We write to you to participate in our Wedding Ceremony on 3/28/1946 at 5pm in the Drama Studio Hall-Black 39, Room 5. Stampless cover, via military mail, with handwritten OAS (On Active Service). In Displaced Persons Camps, survivors were getting married virtually every day, and had one of the highest birth rates per capita in the world.https://digital.kenyon.edu/bulmash/1875/thumbnail.jp

Long-Lived Counters with Polylogarithmic Amortized Step Complexity

A shared-memory counter is a well-studied and widely-used concurrent object. It supports two operations: An Inc operation that increases its value by 1 and a Read operation that returns its current value. Jayanti, Tan and Toueg [Jayanti et al., 2000] proved a linear lower bound on the worst-case step complexity of obstruction-free implementations, from read and write operations, of a large class of shared objects that includes counters. The lower bound leaves open the question of finding counter implementations with sub-linear amortized step complexity. In this paper, we address this gap. We present the first wait-free n-process counter, implemented using only read and write operations, whose amortized operation step complexity is O(log^2 n) in all executions. This is the first non-blocking read/write counter algorithm that provides sub-linear amortized step complexity in executions of arbitrary length. Since a logarithmic lower bound on the amortized step complexity of obstruction-free counter implementations exists, our upper bound is optimal up to a logarithmic factor

Social Machines

The term ‘social machine’ has recently been coined to refer to Web-based systems that support a variety of socially-relevant processes. Such systems (e.g., Wikipedia, Galaxy Zoo, Facebook, and reCAPTCHA) are progressively altering the way a broad array of social activities are performed, ranging from the way we communicate and transmit knowledge, establish romantic partnerships, generate ideas, produce goods and maintain friendships. They are also poised to deliver new kinds of intelligent processing capability by virtue of their ability to integrate the complementary contributions of both the human social environment and a global nexus of distributed computational resources. This chapter provides an overview of recent research into social machines. It examines what social machines are and discusses the kinds of social machines that currently exist. It also presents a range of issues that are the focus of current research attention within the Web Science community

A Domain-Independent Algorithm for Plan Adaptation

The paradigms of transformational planning, case-based planning, and plan debugging all involve a process known as plan adaptation - modifying or repairing an old plan so it solves a new problem. In this paper we provide a domain-independent algorithm for plan adaptation, demonstrate that it is sound, complete, and systematic, and compare it to other adaptation algorithms in the literature. Our approach is based on a view of planning as searching a graph of partial plans. Generative planning starts at the graph's root and moves from node to node using plan-refinement operators. In planning by adaptation, a library plan - an arbitrary node in the plan graph - is the starting point for the search, and the plan-adaptation algorithm can apply both the same refinement operators available to a generative planner and can also retract constraints and steps from the plan. Our algorithm's completeness ensures that the adaptation algorithm will eventually search the entire graph and its systematicity ensures that it will do so without redundantly searching any parts of the graph.Comment: See http://www.jair.org/ for any accompanying file

Thank You Note from Bergen-Belsen Displaced Persons Camp

Envelope: Small envelope with typewritten address to Mrs. L. Hendler with four purple British stamps.Letter: Typewritten letter on Jewish Committee for Relief Abroad stationery. The letter is in English and signed by Ida Lichtenholz. Information Provided by Michael D. Bulmash: A letter from the Jewish Committee for Relief Abroad to Mrs. L. Hendler, Montreal, thanking her for the relief parcels received in Belsen Camp. This included a note that The parcels received from the above named ladies were very good and we made full use of the contents. Mrs. Chait\u27s food parcel was particularly acceptable, as at the present our small food stocks are being gradually exhausted! Note envelope Forces Mails with 12p stamps (via Airmail) canceled with Field Post Office 745 obliterator.https://digital.kenyon.edu/bulmash/1886/thumbnail.jp

Storing and Indexing Plan Derivations through Explanation-based Analysis of Retrieval Failures

Case-Based Planning (CBP) provides a way of scaling up domain-independent planning to solve large problems in complex domains. It replaces the detailed and lengthy search for a solution with the retrieval and adaptation of previous planning experiences. In general, CBP has been demonstrated to improve performance over generative (from-scratch) planning. However, the performance improvements it provides are dependent on adequate judgements as to problem similarity. In particular, although CBP may substantially reduce planning effort overall, it is subject to a mis-retrieval problem. The success of CBP depends on these retrieval errors being relatively rare. This paper describes the design and implementation of a replay framework for the case-based planner DERSNLP+EBL. DERSNLP+EBL extends current CBP methodology by incorporating explanation-based learning techniques that allow it to explain and learn from the retrieval failures it encounters. These techniques are used to refine judgements about case similarity in response to feedback when a wrong decision has been made. The same failure analysis is used in building the case library, through the addition of repairing cases. Large problems are split and stored as single goal subproblems. Multi-goal problems are stored only when these smaller cases fail to be merged into a full solution. An empirical evaluation of this approach demonstrates the advantage of learning from experienced retrieval failure.Comment: See http://www.jair.org/ for any accompanying file