Chromogenic compounds of the formula (1A) or (1B) wherein each of Y1 and Y2 independently represents an amino-substituted phenyl radical of the formula (1a) a 3-indolyl radical of the formula (1b) or a 3-carbazolyl radical of the formula (1c) and Q represents alkyl of 1 to 12 carbon atoms or unsubstituted or substituted aryl or aralkyl, while each of X1 and X2 independently represents hydrogen, alkyl containing not more than 12 carbon atoms which is unsubstituted or substituted by halogen, hydroxyl, cyano or lower alkoxy, or represents cycloalkyl, phenyl, benzyl, or phenyl or benzyl which is substituted by halogen, lower alkyl or lower alkoxy, or X1 and X2 together with the nitrogen atom to which they are attached represent a 5- or 6-membered heterocyclic radical, X3 represents hydrogen, halogen, nitro, lower alkyl or lower alkoxy, each of R and Z1 independently represents hydrogen, alkyl containing not more than 12 carbon atoms which is unsubstituted or substituted by halogen, hydroxyl, cyano or lower alkoxy, or represents alkenyl containing not more than 12 carbon atoms, acyl of 1 to 12 carbon atoms, phenyl, benzyl, or phenyl or benzyl which is substituted by halogen, lower alkyl, lower alkoxy or nitro, and Z2 represents hydrogen, lower alkyl or phenyl, and the rings A, B and D, each independently of the other, can be unsubstituted or substituted by cyano, nitro, halogen, lower alkyl, lower alkoxy or lower alkoxycarbonyl, and the ring D can also contain an unsubstituted or substituted phenyl radical or a fused benzene ring. These compounds are particularly suitable for use as color formers in pressure-sensitive or heat-sensitive recording materials.
[1]
Hong Wang,et al.
Effectiveness of penalty function in solving the subset sum problem
,
1996,
Proceedings of IEEE International Conference on Evolutionary Computation.
[2]
Jack Sklansky,et al.
Constrained Genetic Optimization via Dynarnic Reward-Penalty Balancing and Its Use in Pattern Recognition
,
1989,
ICGA.
[3]
E. Hopper,et al.
A genetic algorithm for a 2D industrial packing problem
,
1999
.
[4]
Antonio Albano,et al.
Optimal Allocation of Two-Dimensional Irregular Shapes Using Heuristic Search Methods
,
1980,
IEEE Transactions on Systems, Man, and Cybernetics.
[5]
Ralph E. Gomory,et al.
The Theory and Computation of Knapsack Functions
,
1966,
Oper. Res..
[6]
K.K.B. Hon,et al.
New approaches for the nesting of two-dimensional shapes for press tool design
,
1992
.
[7]
Antonio Albano,et al.
NESTING TWO-DIMENSIONAL SHAPES IN RECTANGULAR MODULES
,
1976
.
[8]
Vassilios Petridis,et al.
Varying fitness functions in genetic algorithm constrained optimization: the cutting stock and unit commitment problems
,
1998,
IEEE Trans. Syst. Man Cybern. Part B.
[9]
Kikuo Fujita,et al.
Approach for Optimal Nesting Using Genetic Algorithm and Local Minimization Algorithm.
,
1993
.
[10]
R. Gomory,et al.
Multistage Cutting Stock Problems of Two and More Dimensions
,
1965
.