the problem of finding the minimum cost multi-commodity flow in an undirected and completenetwork is studied when the link costs are piecewise linear and convex. the arc-path model and overflowmodel are presented to formulate the problem. the results suggest that the new overflow model outperformsthe classical arc-path model for this problem. the classical revised simplex, frank and wolf and a ...

Piecewise Linear Representation has been widely used to compress online data which are collected by sensors. However, the current existing methods, including Piecewise Aggregate Approximation and Perceptually Important Points cannot own both advantages of calculation speed and recovery accuracy at the same time. In order to improve the Piecewise Linear Representation performance, this work prop...

Piecewise quasilinearization methods for singular boundary-value problems in second-order ordinary differential equations are presented. These methods result in linear constant-coefficients ordinary differential equations which can be integrated analytically, thus yielding piecewise analytical solutions. The accuracy of the globally smooth piecewise quasilinear method is assessed by comparisons...

Yu et al. (Fuzzy Sets and Systems 105 (1999) 429) performed general piecewise necessity regression analysis based on linear programming (LP) to obtain the necessity area. Their method is the same as that according to data distribution, even if the data are irregular, practitioners must specify the number and the positions of change-points. However, as the sample size increases, the number of ch...

Abstract We introduce the use of Zig-Zag sampler to problem sampling conditional diffusion processes (diffusion bridges). The is a rejection-free scheme based on non-reversible continuous piecewise deterministic Markov process. Similar Lévy–Ciesielski construction Brownian motion, we expand path in truncated Faber–Schauder basis. coefficients within basis are sampled using sampler. A key innova...