A New Probe into the Color Modeling of Color Output Devices Based on the Method of Five-level Non-uniform Partition and Pyramid Interpolation

2009 ◽  
Author(s):  
Hu Juan-li ◽  
Deng Jia-bin ◽  
Wang Shu liang
Keyword(s):  
Uniform Partition

scholarly journals Partial transformation monoids preserving a uniform partition

2014 ◽  
Vol 90 (2) ◽  
pp. 532-544 ◽  
Author(s):  
Serena Cicalò ◽  
Vítor H. Fernandes ◽  
Csaba Schneider
Keyword(s):  
Partial Transformation ◽  
Uniform Partition ◽  
Transformation Monoids

TWO NEW CHAOTIC CRYPTOGRAPHIES BASED ON DIFFERENT ATTRACTOR-PARTITION ALGORITHMS

2007 ◽  
Vol 21 (27) ◽  
pp. 4739-4750
Author(s):  
XINGYUAN WANG ◽  
MING LIU ◽  
NINI GU
Keyword(s):  
Chaotic Systems ◽  
Invariant Density ◽  
Comparative Experiment ◽  
Uniform Partition ◽  
Equal Interval ◽  
New Methods ◽  
Iteration Time

The paper analyses the limitation of Baptista cryptography in partitioning an attractor, and proposes two new attractor-partition methods: uniform-partition algorithm and dynamic-partition algorithm. They are different from the equal-interval-partition algorithm in Baptista cryptography, but dividing the attractor according to the attractor's natural invariant density and plaintext density, respectively. The comparative experiment indicates: the two new methods improve the unbalanced cryptograph distribution and cryptograph length in Baptista cryptography, they are also able to reduce the iteration time in chaotic systems effectively, which has improved decryption time and cryptographies' security.

scholarly journals Computational Experience with Piecewise-Linear Relaxations for Petroleum Refinery Planning

2021 ◽  
Author(s):  
Zaid Ashraf Rana ◽  
Cheng Seong Khor
Keyword(s):  
Piecewise Linear ◽  
Mixed Integer ◽  
Integer Optimization ◽  
Solution Quality ◽  
Uniform Partition ◽  
Planning Optimization ◽  
Relaxation Schemes ◽  
Relaxation Solution ◽  
Refinery Planning ◽  
Crude Oil Distillation

Refinery planning optimization is a challenging problem as regards handling the nonconvex bilinearity mainly due to pooling operations in processes such as crude oil distillation and product blending. This work investigates the performance of several representative piecewise-linear (or piecewise-affine) relaxation schemes (referred to as McCormick, bm, nf5, nf6t, and de (which is a new approach proposed based on eigenvector decomposition) that mainly give rise to mixed-integer optimization programs to convexify a bilinear term using predetermined univariate partitioning for instances of uniform and non-uniform partition sizes. Computational results show that applying these schemes give improved relaxation tightness than only applying convex and concave envelopes as estimators. Uniform partition sizes typically perform better in terms of relaxation solution quality and convergence behavior. It is also seen that there is a limit on the number of partitions that contributes to relaxation tightness, which does not necessarily correspond to a larger number of partitions, while a direct relation between relaxation size and tightness does not always hold for non-uniform partition sizes.

scholarly journals Uniform partition and the best least-squares piecewise polynomial approximation

1991 ◽  
Vol 44 (2) ◽  
pp. 279-283
Author(s):  
François Dubeau
Keyword(s):  
Least Squares ◽  
Polynomial Approximation ◽  
Piecewise Polynomial ◽  
Degree Polynomial ◽  
Piecewise Polynomial Approximation ◽  
Uniform Partition

It is shown that the best least-squares piecewise n degree polynomial approximation of xn+1 over [a, b] is obtained for a uniform partition. Moreover the approximation is continuous for n odd and discontinuous, with equal stepsizes at the nodes, for n even.

scholarly journals On the Monoids of Transformations that Preserve the Order and a Uniform Partition

2011 ◽  
Vol 39 (8) ◽  
pp. 2798-2815 ◽  
Author(s):  
Vítor H. Fernandes ◽  
Teresa M. Quinteiro
Keyword(s):  
Uniform Partition
Sign in / Sign up

Export Citation Format

Share Document