Inner derivations and norm equality

We characterize when the norm of the sum of two bounded operators on a Hilbert space is equal to the sum of their norms.

     

Sampling with a String

Kramer's sampling theorem forms a bridge between the Whittaker-Shannon-Kotel'nikov sampling theorem and boundary-value problems. It has been shown that sampling expansions associated with Sturm-Liouville boundary-value problems are Lagrange-type sampling series, i.e., Lagrange series with infinitely many terms converging to entire functions. String theory as developed by Feller, Kac, and Krein, is a generalization of the Sturm-Liouville theory. We investigate sampling series associated with strings and compare them with those associated with Sturm-Liouville problems. We show that unlike sampling series associated with Sturm-Liouville problems, those associated with strings include not only Lagrange-type sampling series, but also Lagrange polynomial interpolation.     

On Quantum Team Games

Recently Liu and Simaan (2004) convex static multi-team classical games have been introduced. Here they are generalized to both nonconvex, dynamic and quantum games. Puu's incomplete information dynamical systems are modified and applied to Cournot team game. The replicator dynamics of the quantum prisoner's dilemma game is also studied.     

Synthèse de nouveaux dérivés tétrahydroquinoléines et quinoléines via la réaction d'aza-Diels-Alder suivie d'aromatisation

The Aza-Diels-Alder reaction of aldimines with isoeugenol is described. New 1,2,3,4-tetrahydroquinoline and quinoline structures are reported. The stereo- and regioselectivities of the [4+2] cycloaddition are discussed.     

The Sample Average Approximation Method Applied to Stochastic Routing Problems: A Computational Study

The sample average approximation (SAA) method is an approach for solving stochastic optimization problems by using Monte Carlo simulation. In this technique the expected objective function of the stochastic problem is approximated by a sample average estimate derived from a random sample. The resulting sample average approximating problem is then solved by deterministic optimization techniques. The process is repeated with different samples to obtain candidate solutions along with statistical estimates of their optimality gaps.We present a detailed computational study of the application of the SAA method to solve three classes of stochastic routing problems. These stochastic problems involve an extremely large number of scenarios and first-stage integer variables. For each of the three problem classes, we use decomposition and branch-and-cut to solve the approximating problem within the SAA scheme. Our computational results indicate that the proposed method is successful in solving problems with up to 2¹⁶⁹⁴ scenarios to within an estimated 1.0% of optimality. Furthermore, a surprising observation is that the number of optimality cuts required to solve the approximating problem to optimality does not significantly increase with the size of the sample. Therefore, the observed computation times needed to find optimal solutions to the approximating problems grow only linearly with the sample size. As a result, we are able to find provably near-optimal solutions to these difficult stochastic programs using only a moderate amount of computation time.     

A new insight into the understanding of the collapsed form of poly(N-isopropylacrylamide) molecules

Possible collapsed forms of poly(N-isopropylacrylamide) molecules are reviewed on the basis of first principle calculations. Various configurations and associated conformations are detailed. The calculated optimized structures exhibit different possibilities of creating networks of intra-molecular bonds of the hydrogen type. We show that the most remarkable one is able to form a local, self-saturated and well ordered helix. We also indicate in which direction the synthesis of the molecule should be oriented to improve its global behavior in term of hydrophobic/hydrophilic behavior.     

Energy of formation for and liquid binary alloys

We have investigated the free energy of formation for Ag_xIn_1-x and Ag_xSn_1-x liquid binary alloys at temperatures 1173 and 1250 K, respectively. A microscopic theory based on the first order perturbation has been applied. The interionic interaction and a reference liquid are the fundamental components of the theory. The interionic interaction is described by a local pseudopotential. A liquid of hard spheres (HS) of two different effective diametres and charges is used to describe the reference system. The results of the calculations for energy of formation agree very well with the available experimental data. Our calculations also reveal that a simple perturbative approach along with appropriate effective pair potentials can produce nearly quantitative results for the concerned alloys.     

An improved max-flow-based lower bound for minimizing maximum lateness on identical parallel machines

In this paper, we introduce a new concept of semi-preemptive scheduling and we show how it can be used to derive a maximum-flow-based lower bound for the P|r_j|L_max which dominates the well-known preemptive lower bound. We show that, in some cases, the proposed bound strictly dominates the preemptive one while having the same complexity.