Improving the efficiency of pig feed manufacturing and application of additives

This project aims to reduce production costs for high-quality pork through understanding how commercial processing conditions affect mill throughput, processing energy efficiency, product durability and the nutritional value of pig feed.

Distributed Scheduling for Multi-Hop Wireless Networks

We study the performance of greedy scheduling in multihop wireless networks where the objective is aggregate utility maximization. Following standard approaches, we consider the dual of the original optimization problem. Optimal scheduling requires selecting independent sets of maximum aggregate price, but this problem is known to be NP-hard. We propose and evaluate a simple greedy heuristic. We suggest how the greedy heuristic can be implemented in a distributed manner. We evaluate an analytical bound in detail, for the special case of a line graph and also provide a loose bound on the greedy heuristic for the case of an arbitrary graph.

Two Tools for Interprocess Communication in Distributed Data-Flow Systems

Abstract is not available.

Implementation of CSP-S for description of distributed algorithms

The implementation of CSP-S (a subset of CSP)—a high level language for distributed programming—is presented in this paper. The language CSP-S features a parallel command, communication by message passing and the use of guarded command. The implementation consists of a compiler translating the CSP-S constructs into intermediate language. The execution is carried out by a scheduler which creates an illusion of concurrency. Using the CSP-S language constructs, distributed algorithms are written, executed and tested with the compiler designed.

Application of Mathematical Programming to the Plywood Design and Manufacturing Problem

Plywood manufacture includes two fundamental stages. The first is to peel or separate logs into veneer sheets of different thicknesses. The second is to assemble veneer sheets into finished plywood products. At the first stage a decision must be made as to the number of different veneer thicknesses to be peeled and what these thicknesses should be. At the second stage, choices must be made as to how these veneers will be assembled into final products to meet certain constraints while minimizing wood loss. These decisions present a fundamental management dilemma. Costs of peeling, drying, storage, handling, etc. can be reduced by decreasing the number of veneer thicknesses peeled. However, a reduced set of thickness options may make it infeasible to produce the variety of products demanded by the market or increase wood loss by requiring less efficient selection of thicknesses for assembly. In this paper the joint problem of veneer choice and plywood construction is formulated as a nonlinear integer programming problem. A relatively simple optimal solution procedure is developed that exploits special problem structure. This procedure is examined on data from a British Columbia plywood mill. Restricted to the existing set of veneer thicknesses and plywood designs used by that mill, the procedure generated a solution that reduced wood loss by 79 percent, thereby increasing net revenue by 6.86 percent. Additional experiments were performed that examined the consequences of changing the number of veneer thicknesses used. Extensions are discussed that permit the consideration of more than one wood species.

Worst-Case Asymmetric Distributed Source Coding

We consider the asymmetric distributed source coding problem, where the recipient interactively communicates with N correlated informants to gather their data. We are mainly interested in minimizing the worst-case number of informant bits required for successful data-gathering at recipient, but we are also concerned with minimizing the number of rounds as well as the number of recipient bits. We provide two algorithms, one that optimally minimizes the number of informant bits and other that trades-off the number of informant bits to efficiently reduce the number of rounds and number of recipient bits.

Postcard distributed by M. Molling & Co., Hannover, to commemorate the 100th anniversary of Friedrich Schiller's death.

Addressed to Therese Gottschalk nee Molling, postmarked 25 April 1905 and mailed from Hannover to Hildesheim, most likely while Therese was visiting her Meyerhof grandparents

Postcard distributed by M. Molling & Co. to commemorate the 100th anniversary of Friedrich Schiller's death; Hannover, Germany. Advertisements

Addressed to Therese Gottschalk nee Molling, postmarked 25 April 1905 and mailed from Hannover to Hildesheim, most likely while Therese was visiting her Meyerhof grandparents

View of Paul I. Landmann manufacturing factory; Mannheim-Neckarau Business Establishments; Factories

"Fabrikansicht"

Printing room 1; Paul I. Landmann Manufacturing Factory; Mannheim-Neckarau Business Establishments; Factories

"Drucksaal 1"

Printing room; Paul I. Landmann Manufacturing Factory; Mannheim-Neckarau Business Establishments; Factories

"Umdruckerei"

Stamping room; Paul I. Landmann manufacturing factory; Mannheim-Neckarau Business Establishments; Factories

"Pragesaal"

Studio and office; Paul I. Landmann manufacturing factory; Mannheim-Neckarau Business Establishments; Factories

"Atelier und Buero"

Paul I. Landmann manufacturing factory; Mannheim-Neckarau Business Establishments; Factories

"Fabrikansicht von der Toreinfahrt"

Factory employee housing; Paul I. Landmann Manufacturing Factory; Mannheim-Neckarau Business Establishments; Factories

"Arbeiter und Mietshaeuser"