Optimal dynamic advertising policies for hereditary processes

In this paper, the Nerlove-Arrow model of optimal dynamic advertising policies is generalized by assuming a general probability distribution of the forgetting time, rather than the exponential one. A control problem with integrodifferential equations of motion is defined for which the transitory and steady-state properties of the optimal advertising policy are examined. The effects of assumptions like IHR-distributions and DHR-distributions, the existence of an upper bound for the forgetting time, etc., are explained. It is shown that there are two (in the case of an exponential distribution even three) different current-value adjoint functions associated with the problem, and relations between the two (three) are established. Also provided is a sensitivity analysis.Thanks are due to G. Feichtinger and S. Jorgensen for useful discussions.     

Melt‐state polymer chain dimensions as a function of temperature

The unperturbed chain dimensions (〈R²〉_o/M) of cis/trans‐1,4‐polyisoprene, a near‐atactic poly(methyl methacrylate), and atactic polyolefins were measured as a function of temperature in the melt state via small‐angle neutron scattering (SANS). The polyolefinic materials were derived from polydienes or polystyrene via hydrogenation or deuteration and represent structures not encountered commercially. The parent polymers were prepared via lithium‐based anionic polymerizations in cyclohexane with, in some cases, a polymer microstructure modifier present. The polyolefins retained the near‐monodisperse molecular weight distributions exhibited by the precursor materials. The melt SANS‐based chain dimension data allowed the evaluation of the temperature coefficients [dln 〈R²〉_o/dT(κ)] for these polymers. The evaluated polymers obeyed the packing length (p)‐based expressions of the plateau modulus, G = kT/np³ (MPa), and the entanglement molecular weight, M_e = ρN_anp³ (g mol^?1), where n_t denotes the number (～21) of entanglement strands in a cube with the dimensions of the reptation tube diameter (d_t) and ρ is the chain density. The product np³ is the displaced volume (V_e) of an entanglement that is also expressible as pd or kT/G. © 2002 Wiley Periodicals, Inc. J Polym Sci Part B: Polym Phys 40: 1768–1776, 2002     

Catalytic Enantioselective Reduction of Prochiral Ketones with Chiral Ferrocenyl Amino Alcohols

The asymmetric reduction of prochiral ketones was catalyzed by a class of recoverable and highly stable chiral ferrocenyl amino alcohols derived from natural amino acids to yield optically active secondary alcohols in high chemical yields and moderate to good enantiomeric excesses.     

Comparison by capillary SFC and SFC-MS of soxhlet and supercritical fluid extraction of hamster feces

Components of hamster feces ranging from low molecular weight fatty acids through the expected range of triglycerides have been eluted in a single SFC run with simultaneous pressure and temperature programming. Temperature programming from 140°C to 240°C was required to provide optimum conditions for separation of the fatty acids and to move the elution region of the sterol esters away from that of the triglycerides. Data from chemical ionization and electron impact mass spectrometry of compounds separated by SFC were used to confirm identities suggested by retention measurements and to provide tentative identities of unknown compounds. SFC with flame ionization detection was used to compare Soxhlet extraction, off-line supercritical fluid extraction (SFE), and on-line SFE of the feces. Although samples obtained by Soxhlet extraction and SFE produced very similar chromatograms, SFE required far less time and consumed much smaller quantities of organic solvent.     

Packings and stationary phases for biopolymer separations by HPLC

Summary Packings and stationary phases applied to high resolution separations of proteins, enzymes, and nucleic acids must satisfy a series of distinct criteria that are different from those usually required by HPLC of low molecular weight non-biologically active analytes. These requirements have been met through substantial improvements in classical gel media together with novel developments in silica supports, and have led to a family of products with tailor-made and reproducible properties. Supports consisting of cross-linked organic gels, and inorganic materials (mostly silicas) are now available with graduated particle sizes, pore sizes, porosities and surface areas as well as non-porous beads. A whole range of stationary phases, such as reversed phase, hydrophobic interaction, ion exchanger and affinity packings, were designed for application as chemical sensors for biopolymer recognition in adsorptive chromatography. The phase systems are operated in the gradient mode, giving high resolution and high peak capacities. In addition, aqueous liquid-liquid partitioning systems have been developed for the fractionation of proteins and nucleic acids. Size exclusion media complete the set of HPLC variants enabling a discrimination of proteins according to their size and shape in an isocratic elution mode. Basically, protein purification and isolation is a multistage process where-by the HPLC variants are combined in a logistic sequence, utilizing the different selectivities of the phase systems and thus maximising resolution, speed and throughput.     

QSPR Modeling of Gibbs Free Energy of Organic Compounds by Weighting of Nearest Neighboring Codes

We examine the encoding of chemical structure of organic compounds by Labeled Hydrogen-Filled Graphs (LHFGs). Quantitative Structure-Property Relationships (QSPR) for a representative set of 150 organic molecules have been derived by means of the optimization of correlation weights of local invariants of the LHFGs. We have tested as local invariants Morgan extended connectivity of zero- and first order, numbers of path of length 2 (P2) and valence shells of distance of 2 (S2) associated with each atom in the molecular structure, and the Nearest Neighboring Codes (NNC). The best statistical characteristics for the Gibbs free energy has been obtained for the NNC weighting. Statistical parameters corresponding to this model are the following n = 100, r² = 0.9974, s = 5.136 kJ/mol, F = 38319 (training set); n = 50, r² = 0.9990, s = 3.405 kJ/mol, F = 48717 (test set). Some possible further developments are pointed out.     

The existence of sensitive optimal policies in two multi-dimensional queueing models

Recently Dekker and Hordijk [3,4] introduced conditions for the existence of deterministic Blackwell optimal policies in denumerable Markov decision chains with unbounded rewards. These conditions include- uniform geometric recurrence.The-uniform geometric recurrence property also implies the existence of average optimal policies, a solution to the average optimality equation with explicit formula's and convergence of the value iteration algorithm for average rewards. For this reason, the verification of-uniform geometric convergence is also useful in cases where average and-discounted rewards are considered.On the other hand,-uniform geometric recurrence is a heavy condition on the Markov decision chain structure for negative dynamic programming problems. The verification of-uniform geometric recurrence for the Markov chain induced by some deterministic policy together with results by Sennott [14] yields the existence of a deterministic policy that minimizes the expected average cost for non-negative immediate cost functions.In this paper-uniform geometric recurrence will be proved for two queueing models: theK competing queues and the two centre open Jackson network with control of the service rates.The research of the author is supported by the Netherlands Organization for Scientific Research N.W.O.     

A review of statistical models for global optimization

A review of statistical models for global optimization is presented. Rationality of the search for a global minimum is formulated axiomatically and the features of the corresponding algorithm are derived from the axioms. Furthermore the results of some applications of the proposed algorithm are presented and the perspectives of the approach are discussed.     

Numerical solution of minimax problems of optimal control,part 1

This paper contains general transformation techniques useful to convert minimax problems of optimal control into the Mayer-Bolza problem of the calculus of variations [Problem (P)]. We consider two types of minimax problems: minimax problems of Type (Q), in which the minimax function depends on the state and does not depend on the control; and minimax problems of Type (R), in which the minimax function depends on both the state and the control. Both Problem (Q) and Problem (R) can be reduced to Problem (P).For Problem (Q), we exploit the analogy with a bounded-state problem in combination with a transformation of the Jacobson type. This requires the proper augmentation of the state vectorx(t), the control vectoru(t), and the parameter vector , as well as the proper augmentation of the constraining relations. As a result of the transformation, the unknown minimax value of the performance index becomes a component of the parameter vector being optimized.For Problem (R), we exploit the analogy with a bounded-control problem in combination with a transformation of the Valentine type. This requires the proper augmentation of the control vectoru(t) and the parameter vector , as well as the proper augmentation of the constraining relations. As a result of the transformation, the unknown minimax value of the performance index becomes a component of the parameter vector being optimized.In a subsequent paper (Part 2), the transformation techniques presented here are employed in conjunction with the sequential gradient-restoration algorithm for solving optimal control problems on a digital computer; both the single-subarc approach and the multiple-subarc approach are discussed.This research was supported by the National Science Foundation, Grant No. ENG-79-18667, and by Wright-Patterson Air Force Base, Contract No. F33615-80-C3000. This paper is a condensation of the investigations reported in Refs. 1–7. The authors are indebted to E. M. Coker and E. M. Sims for analytical and computational assistance.     

Facility location in the presence of forbidden regions,I: Formulation and the case of Euclidean distance with one forbidden circle

A constrained form of the Weber problem is formulated in which no path is permitted to enter a prespecified forbidden region $\text{R}$ of the plane. Using the calculus of variations the shortest path between two points $\text{x}\text{,}\text{y}\text{?}\text{R}$ which does not intersect $\text{R}$ is determined. If $\text{d(}\text{x}\text{,}\text{y}\text{)}$ is unconstrained distance, we denote the shortes distance along a feasible path by $\text{d}\text{(}\text{x}\text{y}\text{)}$. The constrained Weber problem is, then: given points $\text{x}{}_{\mathrm{j}}\text{?}\text{R}$ and positive weights w_j, j = 1,2,…,n, find a point $\text{x}\text{?}\text{R}$ such that

$\text{f(}\text{x}\text{)=}\text{Σ}\text{n}\text{j=1}\text{d(}\text{x}\text{,}\text{x}{}_{\mathrm{j}}\text{)}$

is a minimum.An algorithm is formulated for the solution of this problem when $\text{d(}\text{x}\text{,}\text{y}\text{)}$ is Euclidean distance and $\text{R}$ is a single circular region. Numerical results are presented.