This paper develops coding techniques to reduce the running time of distributed learning tasks. It characterizes the fundamental tradeoff to compute gradients (and more generally vector summations) in terms of three parameters: computation load, straggler tolerance and communication cost. It further gives an explicit coding scheme that achieves the optimal tradeoff based on recursive polynomial...

For the multi-attribute tradeoff optimization of critical chain multi-project scheduling (CCMPS), multi-attribute utility function was adopted to conduct comprehensive optimization of time, cost, quality, robustness and the optimization model was established. Using randomness and stability of Normal Cloud Model, cloud genetic algorithm was designed to generate priority of multi-project scheduli...

The tradeoff of effectiveness and cost is a vital problem for complex industrial systems, mainly applied in the weapons aviation fields. As typical system, effectiveness-cost satellites becomes challenging interesting. This paper takes remote sensing satellite as research object, an integrated approach to assess optimize its proposed. characteristic parameters are selected according analysis st...

Crowdsourcing marketplaces are widely used for curating large annotated datasets by collecting labels from multiple annotators. In such scenarios one has to balance the tradeoff between the accuracy of the collected labels, the cost of acquiring these labels, and the time taken to finish the labeling task. With the goal of reducing the labeling cost, we introduce the notion of sequential crowds...

We have developed a social optimization model that integrates wastewater treatment cost function and ecosystem damage cost function. The social optimal abatement level of water pollution is determined by finding the tradeoff between pollution control cost and ecosystem damage. The model is applied to data from the Lake Taihu region in China to demonstrate this tradeoff. A wastewater treatment c...

We exhibit a new method for showing lower bounds for time-space tradeoffs of polynomial evaluation procedures given by straight-line programs. From the tradeoff results obtained by this method we deduce lower space bounds for polynomial evaluation procedures running in optimal nonscalar time. Time, denoted by L, is measured in terms of nonscalar arithmetic operations and space, denoted by S, is...

SUMMARY Cdt is a container data type library that provides a uniform set of operations to manage dictionaries based on the common storage methods: list, stack, queue, ordered set/multiset, and unordered set/multiset. Both object description and storage method in a dictionary can be dynamically changed so that abstract operations can be exactly matched with run-time requirements for operational ...

We present three streaming algorithms that (2, δ)− approximate 1 the number of triangles in graphs. Similar to the previous algorithms [3], the space usage of presented algorithms are inversely proportional to the number of triangles while, for some families of graphs, the space usage is improved. We also prove a lower bound, based on the number of triangles, which indicates that our first algo...