This chapter proposes that search engines apply a verticalizing pressure on the WWW many-to-many information distribution model, forcing this to revert to a distributive model similar to that of the mass media. The argument for this starts with a critical descriptive examination of the history of search mechanisms for the Internet. Parallel to this there is a discussion of the increasing ties b...

Style transfer usually refers to the task of applying color and texture information from a specific style image to a given content image while preserving the structure of the latter. Here we tackle the more generic problem of semantic style transfer: given two unpaired collections of images, we aim to learn a mapping between the corpus-level style of each collection, while preserving semantic c...

The authors acknowledge that knowledge creation is a collaborative process by nature and attempt to leverage current IS methods and technology to recreate the classical salons that yielded philosophical discourse. Research has demonstrated physical proximity as a key indicator of both the undertaking and successful completion of research, yet this physical proximity has not shown analogous carr...

The need for robust pronunciation annotation over out-of-vocabulary (OOV) words has been increasing with the development of an application that deals with proper nouns and brand-new words, such as Voice Search. In robust pronunciation annotation over OOV words, the alignment between graphemes and phonemes is vital data. For a many-to-many alignment algorithm between graphemes and phonemes, we d...

Hubs are special facilities that serve as switching, transshipment and sorting points in many-to-many distribution systems. The hub location problem is concerned with locating hub facilities and allocating demand nodes to hubs in order to route the traffic between origin–destination pairs. In this paper we classify and survey network hub location models. We also include some recent trends on hu...

To help improve the reliability of spreadsheets created by end users, we are working to allow users to communicate the purpose and other underlying information about their spreadsheets, using a form of requirement specifications we call “guards.” For large spreadsheets with replicated/shared formulas across groups of rows or columns, guards can only be practical if users can enter them across t...

Recently four different papers have suggested that the supervaluational solution to the Problem of the Many is flawed. Stephen Schiffer (1998, 2000a,b) has argued that the theory cannot account for reports of speech involving vague singular terms. Vann McGee and Brian McLaughlin (2000) say that theory cannot, yet, account for vague singular beliefs. Neil McKinnon (2002) has argued that we canno...

Very recently a new algorithm to the nonnegative single-source shortest path problem on road networks has been discovered. It is very cacheefficient, but only on static road networks. We show how to augment it to the time-dependent scenario. The advantage if the new approach is that it settles nodes, even for a profile query, by scanning all downward edges. We improve the scanning of the downwa...

A dynamic network is a network whose components may interact on channels established dynamically by the communication of their associated ports This paper generalises a speci cation technique based on input output relations on streams to capture the special kind of privacy preservation found in such networks A privacy preserving component never accesses depends on or sends a port whose name it ...