People can affect change in their eating patterns by substituting ingredients in recipes. Such substitutions may be motivated by specific goals, like modifying the intake of a specific nutrient or avoiding a particular category of ingredients. Determining how to modify a recipe can be difficult because people need to 1) identify which ingredients can act as valid replacements for the original and 2) figure out whether the substitution is “good” for their particular context, which may consider factors such as allergies, nutritional contents of individual ingredients, and other dietary restrictions. We propose an approach to leverage both explicit semantic information about ingredients, encapsulated in a knowledge graph of food, and implicit semantics, captured through word embeddings, to develop a substitutability heuristic to rank plausible substitute options automatically. Our proposed system also helps determine which ingredient substitution options are “healthy” using nutritional information and food classification constraints. We evaluate our substitutability heuristic, diet-improvement ingredient substitutability heuristic (DIISH), using a dataset of ground-truth substitutions scraped from ingredient substitution guides and user reviews of recipes, demonstrating that our approach can help reduce the human effort required to make recipes more suitable for specific dietary needs.

Optimistic replication allows mobile workspaces to the data, or tag each data item with a version vector; a remain accessible during interrupted network access, but require choice which has a characteristic influence on the scalability consecutive handling of any conflicts. When conflict handling properties and the application domain. Version vector-based requires manual intervention by the user, the system must .. .. not require that conflicts are resolved immediatley after their arc permitid da l data itemsitiob ronclead detection. We present a log-based algorithm for reconciling but require a metadata storage and communication overhead changes to replicated data that supports deferred manual conflict for each data item, which can be expensive especially for resolution, while sharing the favorable scalability properties small data items. In contrast, log-based algorithms only allow of log-based approaches of small storage and communication reconciliation of complete data sets, and their metadata storage overhead. Simulation results validate our design and show that and communication overhead is independent of the size of the it compares favorably in the relevant metrics with version vectorbased designs. data set.Present algorithms that support asynchronous conflict han-I. INTRODUCTION dling are all based on version vectors, which restricts theirWhen collaborative applications reach out to include mobile application to data with a moderate number of large data participants, their workspaces have to be replicated to the items. No algorithms for asynchronous conflict resolution are mobile devices so that the application is operational in times available that have the favorable scaling properties of logof interrupted network access. based algorithms. In order to fill this gap, we have designed Offline mobile participants are expected to make changes a log-based reconciliation algorithm that provides the same to the data, and those changes have to be coordinated later conflict detection and handling facilities as version vectors, between the replicas in order to ensure a consistent view across but with reduced storage and communication overhead. The all devices. This approach to change coordination is said to be key to the algorithm's efficiency is its use of special log for optimistic, because all changes are tentatively accepted with detecting and handling concurrent changes and tracking write the optimistic assumption that other concurrent changes do propagation. This technique eliminates much of the explicit not result in inconsistencies. When communication between metadata associated with version vectors and thus makes the replicas is available again, a deferred change reconciliation algorithm more suitable to resource-limited mobile systems. process is responsible for coordinating data changes post hocWe start with a sketch of our target application domain, and deciding which changes to accept and how to order the replicated shared workspaces. The body of the paper consists accepted changes.of a detailed des...

No abstract

Scalability and efficient global search in large-scale peer-topeer overlays often come at the expense of small-scale, local interactions between peers. For many users, local operations such as browsing, messaging, and direct content exchange between nodes may be more useful than access to the network as a whole. In this note we sketch the design of a small-scale overlay for applications such as ticketing systems, editorial coordination, and ad hoc workflows that currently rely on more general and less efficient mediums such as e-mail. Peers in the overlay form local economies and attempt to maximize user-directed utility functions.

No abstract