We consider a supplier who faces stationary demand and uses dynamically updated forecast information to place orders to an upstream distributor. The order size is restricted and each order entails a high fixed cost. We characterize the form of the optimal policy in the special case where the fixed cost of ordering is high enough to warrant all-or-nothing ordering in each period.

The Team Orienteering Problem (TOP) is defined as to find a set of vehicle walks such that the total collected reward received from visiting a subset of customers is maximized and the length of each vehicle walk is restricted by a pre-specified limit. The team orienteering problem with capacity constraint and time window(TOPCT) is an extension of the TOP where each customer has a demand and a t...

High-capacity image watermarking scheme aims at maximize bit rate of hiding information, neither eliciting perceptible image distortion nor facilitating special watermark attack. Texture, in preattentive vision, delivers itself by concise high-order statistics, and holds high capacity for watermark. However, traditional distortion constraint, e.g. just-noticeable-distortion (JND), cannot evalua...

The complexity of deep neural network algorithms for hardware implementation can be lowered either by scaling the number of units or reducing the word-length of weights. Both approaches, however, can accompany the performance degradation although many types of research are conducted to relieve this problem. Thus, it is an important question which one, between the network size scaling and the we...