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.     

Continuation theorem of fractional order evolutionary integral equations

The fractional order evolutionary integral equations have been considered by the first author in [6], the existence, uniqueness and some other properties of the solution have been proved. Here we study the continuation of the solution and its fractional order derivative. Also we study the generality of this problem and prove that the fractional order diffusion problem, the fractional order wave problem and the initial value problem of the equation of evolution are special cases of it. The abstract diffusion-wave problem will be given also as an application.     

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.     

A trust region method for solving the decentralized static output feedback design problem

The shortest-paths problem is a fundamental problem in graph theory and finds diverse applications in various fields. This is why shortest path algorithms have been designed more thoroughly than any other algorithm in graph theory. A large number of optimization problems are mathematically equivalent to the problem of finding shortest paths in a graph. The shortest-path between a pair of vertices is defined as the path with shortest length between the pair of vertices. The shortest path from one vertex to another often gives the best way to route a message between the vertices. This paper presents anO(n ²) time sequential algorithm and anO(n ²/p+logn) time parallel algorithm on EREW PRAM model for solving all pairs shortest paths problem on circular-arc graphs, wherep andn represent respectively the number of processors and the number of vertices of the circular-arc graph.     

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.     

Sinc-Galerkin method for solving linear sixth-order boundary-value problems

There are few techniques available to numerically solve sixth-order boundary-value problems with two-point boundary conditions. In this paper we show that the Sinc-Galerkin method is a very effective tool in numerically solving such problems. The method is then tested on examples with homogeneous and nonhomogeneous boundary conditions and a comparison with the modified decomposition method is made. It is shown that the Sinc-Galerkin method yields better results.