Herengracht 401 (H401), until 2019 known as Castrum Peregrini, represents the complex and intriguing history of a hermetic community artists scholars in Amsterdam which was formed years Nazi occupation The Netherlands, 1940–1945.This article attempts to take stock on what we have learned these ten about place, an indicator memory politics. It also reflects hermeneutic gap cannot know H401’s lac...

Web users increasingly treat the Web as a very large knowledge base and use it to acquire all kinds of knowledge. In this article, we introduce a method that leverages the information on the Web to determine the truthfulness of any statement that attempts to state a fact. This method accomplishes the goal by checking whether there is an alternative statement that is more likely to be truthful. ...

Quasilinear utility functions are a standard assumption in auction theory allowing for truthful and welfare-maximizing auction mechanisms. However, the literature on advertising markets suggests that the utility model of bidders rather resembles a knapsack problem, where advertisers try to maximize the sum of item values subject to a budget for a marketing campaign. Non-quasilinear environments...

An ongoing debate among natural law theorists concerns the way in which the various basic goods are related to each other. St. Thomas maintains that the ultimate good ofhuman beings is the beatific vision. It follows that any action is good inasmuch as it leads one toward this goal, while an action is evil if it leads one away. Germain Grisez laments the way in which many post-Suarezian or "con...

We consider the problem of converting an arbitrary approximation algorithm for a singleparameter social welfare problem into a computationally efficient incentive compatible mechanism. We ask for reductions that are black-box, meaning that they require only oracle access to the given algorithm and (in particular) do not require explicit knowledge of the problem constraints. We demonstrate that,...

We consider the problem of designing truthful mechanisms for scheduling selfish tasks on a single machine or on a set of m parallel machines. The objective of every selfish task is the minimization of its completion time while the aim of the mechanism is the minimization of the sum of weighted completion times. For the model without payments, we prove that there is no (2 − )-approximate determi...

This work presents a conversational agent (CA) that functions as prototype for simulating interrogations. The solution implements cognitive model focuses on the interpersonal relationships between CA and user. can adjust stance of based sentiment phrasing user’s utterances. As result, updates friendliness truthfulness its responses accordingly.

In the originally published version of chapter 48, Table 1 and equation on page 696 contained errors. This has been corrected.