Perfect information two-person zero-sum markov games with imprecise transition probabilities

Based on an extension of the controlled Markov set-chain model by Kurano et al. (in J Appl Prob 35:293–302, 1998) into competitive two-player game setting, we provide a model of perfect information two-person zero-sum Markov games with imprecise transition probabilities. We define an equilibrium value for the games formulated with the model in terms of a partial order and then establish the existence of an equilibrium policy pair that achieves the equilibrium value. We further analyze finite-approximation error bounds obtained from a value iteration-type algorithm and discuss some applications of the model.     

Polymerization of cyclopentadiene initiated by methylaluminoxane

The polymerization of cyclopentadiene (CPD) was effectively initiated by methylaluminoxane (MAO) to generate poly(cyclopentadiene) (polyCPD). The effects on the polymerization of some reaction parameters such as the monomer concentration, the initiator concentration, and solvents were investigated. The conversion of CPD was monitored with gas chromatography to investigate the reaction kinetics. The polymerization rate was proportional to the concentrations of MAO in the first order and of the CPD monomer in the second order, and a reasonable cationic polymerization mechanism was suggested on the basis of the kinetic study. PolyCPD obtained at a low temperature could be dissolved in toluene or chloroform, and this indicated lower cross‐coupling during the polymerization reaction. ¹H NMR and IR analysis of the polymer indicated that there were almost equal amounts of 1,2‐enchainment and 1,4‐enchainment in the polymer chain. The measurement of polyCPD showed its unique properties as a potential candidate for stable wrappings or electronic packaging materials. © 2005 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 44: 264–272, 2006     

Control of the conjugation length and solubility in electroluminescent polymers

A new type of cyclolinear polymer, poly(phenylene vinylene‐alt‐cyclotriphosphazene), was synthesized through Heck‐type coupling reactions to produce π‐conjugated macromolecules with excellent solubility and precise electronic control of the band‐gap energy. This synthesis method is capable of producing well‐defined alternating polymers. The method is highly adaptable and can be readily used for other chromophore systems. The resulting polymers were also capable of accommodating a wide variety of substituents on the cyclophosphazene rings with minimal effect on the electronic properties. The band gap and electron affinities of the polymer were varied through the manipulation of the π‐conjugated unit located between the insulating phosphazene rings. Each chromophore matched the intended conjugation length consistently throughout the macromolecules. The polymers were good film formers because of the chosen substituents on the phosphazene rings. The absorbance of the polymers indicated minimal spectral shift from the monomer absorbance. This suggested an effective insulation of each chromophore unit from its neighbors by the phosphazene rings. Solution photoluminescence efficiencies were found to be up to 44.1%. © 2005 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 44: 69–76, 2006     

Converging Marriage in Honey-Bees Optimization and Application to Stochastic Dynamic Programming

In this paper, we first refine a recently proposed metaheuristic called “Marriage in Honey-Bees Optimization” (MBO) for solving combinatorial optimization problems with some modifications to formally show that MBO converges to the global optimum value. We then adapt MBO into an algorithm called “Honey-Bees Policy Iteration” (HBPI) for solving infinite horizon-discounted cost stochastic dynamic programming problems and show that HBPI also converges to the optimal value.     

Harmonic Algebraic Curves and Noncrossing Partitions

Motivated by Gauss's first proof of the Fundamental Theorem of Algebra, we study the topology of harmonic algebraic curves. By the maximum principle, a harmonic curve has no bounded components; its topology is determined by the combinatorial data of a noncrossing matching. Similarly, every complex polynomial gives rise to a related combinatorial object that we call a basketball, consisting of a pair of noncrossing matchings satisfying one additional constraint. We prove that every noncrossing matching arises from some harmonic curve, and deduce from this that every basketball arises from some polynomial.     

An improved algorithm for solving biobjective integer programs

A parametric algorithm for identifying the Pareto set of a biobjective integer program is proposed. The algorithm is based on the weighted Chebyshev (Tchebycheff) scalarization, and its running time is asymptotically optimal. A number of extensions are described, including: a technique for handling weakly dominated outcomes, a Pareto set approximation scheme, and an interactive version that provides access to all Pareto outcomes. Extensive computational tests on instances of the biobjective knapsack problem and a capacitated network routing problem are presented.     

Model and empirical study on some collaboration networks

In this paper we present an empirical study of a few practical systems described by cooperation networks, and propose a model to understand the results obtained. We study four non-social systems, which are the Bus Route Networks of Beijing and Yangzhou, the Travel Route Network of China, Huai-Yang recipes of Chinese cooked food, and a social system, which is the Collaboration Network of Hollywood Actors. In order to explain the results related to the degree distribution, act-degree distribution and act-size distribution (especially about the degree distribution, which may be better fitted using a stretched exponential distribution (SED)), we suggest a simple model to show a possible evolutionary mechanism for the emergence of such networks. The analytic and numerical results obtained from the model are in good agreement with the empirical results.