Electron beam induced modification of poly(ethylene terephthalate) films

Electron beam processing of poly(ethylene terephthalate) (PET) films is found to promote significant changes in the melting heat, intrinsic viscosity and polymer film-liquid (water, isooctane and toluene) boundary surface tension. These properties are featured with several maximums depending on the absorbed dose and correlating with the modification of PET surface functionality. Studies using adsorption of acid-base indicators and IR-spectroscopy revealed that the increase of PET surface hydrophilicity is determined by the oxidation of methylene and methyne groups. Electron beam treatment of PET films on the surface of N-vinylpyrrolidone aqueous solution provided graft copolymerization with this comonomer at optimum process parameters (energy 700 keV, current 1 mA, absorbed dose 50 kGy).     

Analysis of the manufacturing lead time in a production system with non-renewal batch input,threshold policy and post-operation

In this paper, we analyze the manufacturing lead time in a production system with BMAP (Batch Markovian Arrival process) input and post-operation operated under the N-policy. We use the factorization principle to derive the waiting time distribution (hence the manufacturing lead time) and the mean performance measures. A numerical example is provided.     

矩阵特征值的几个不等式

研究矩阵特征值的上、下界以及特征值的实部、虚部的不等式 ,给出了特征值一些新的上界和下界     

Memory and a priori best strategy in complex adaptive systems

We employ an agent‐based model to show that memory and the absence of an a priori best strategy are sufficient for self‐segregation and clustering to emerge in a complex adaptive system with discrete agents that do not compete over a limited resource nor contend in a winner‐take‐all scenario. An agent starts from a corner of a two‐dimensional lattice and aims to reach a randomly selected site in the opposite side within the shortest possible time. The agent is isolated during the course of its journey and does not interact with other agents. Time‐bound obstacles appear at random lattice locations and the agent must decide whether to challenge or evade any obstacle blocking its path. The agent is capable of adapting a strategy in dealing with an obstacle. We analyze the dependence of strategy‐retention time with strategy for both memory‐based and memory‐less agents. We derive the equality spectrum to establish the environmental conditions that favor the existence of an a priori best strategy. We found that memory‐less agents do not polarize into two opposite strategy‐retention time distributions nor cluster toward a center distribution. © 2004 Wiley Periodicals, Inc. Complexity 9: 41–46, 2004     

Approximating schedules for dynamic process graphs efficiently

A model for parallel and distributed programs, the dynamic process graph (DPG), is investigated under graph-theoretic and complexity aspects. Such graphs embed constructors for parallel programs, synchronization mechanisms as well as conditional branches. They are capable of representing all possible executions of a parallel or distributed program in a very compact way. The size of this representation can be as small as logarithmic with respect to the size of any execution of the program.

In a preceding paper [A. Jakoby, et al., Scheduling dynamic graphs, in: Proc. 16th Symposium on Theoretical Aspects in Computer Science STACS'99, LNCS, vol. 1563, Springer, 1999, pp. 383–392] we have analysed the expressive power of the general model and various variants of it. We have considered the scheduling problem for DPGs given enough parallelism taking into account communication delays between processors when exchanging data. Given a DPG the question arises whether it can be executed (that means whether the corresponding parallel program has been specified correctly), and what is its minimum schedule length.

In this paper we study a subclass of dynamic process graphs called -output DPGs, which are appropriate in many situations, and investigate their expressive power. In a previous paper we have shown that the problem to determine the minimum schedule length is still intractable for this subclass, namely this problem is -complete as is the general case. Here we will investigate structural properties of the executions of such graphs. A natural graph-theoretic conjecture that executions must always split into components that are isomorphic to subgraphs turns out to be wrong. We are able to prove a weaker property. This implies a quadratic upper bound on the schedule length that may be necessary in the worst case, in contrast to the general case, where the optimal schedule length may be exponential with respect to the size of the representing DPG. Making this bound constructive, we obtain an approximation to a -complete problem. Computing such a schedule and then executing the program can be done on a parallel machine in polynomial time in a highly distributive fashion.     

Second order parabolic equations in Banach spaces with dynamic boundary conditions

In this paper, we exhibit a unified treatment of the mixed initial boundary value problem for second order (in time) parabolic linear differential equations in Banach spaces, whose boundary conditions are of a dynamical nature. Results regarding existence, uniqueness, continuous dependence (on initial data) and regularity of classical and strict solutions are established. Moreover, several examples are given as samples for possible applications.

     

PT Symmetry in Quantum Field Theory

The Hamiltonian H specifies the energy levels and the time evolution of a quantum theory. It is an axiom of quantum mechanics that H be Hermitian. The Hermiticity of H guarantees that the energy spectrum is real and that the time evolution is unitary (probability preserving). In this talk we investigate an alternative formulation of quantum mechanics in which the mathematical requirement of Hermiticity is replaced by the more physically transparent condition of space-time reflection (PT) symmetry. We show that if the PT symmetry of a Hamiltonian H is not broken, then the spectrum of H is real. Examples of PT-symmetric non-Hermitian Hamiltonians are H=p ²+ix ³ and H=p ²-x ⁴. The crucial question is whether PT-symmetric Hamiltonians specify physically acceptable quantum theories in which the norms of states are positive and the time evolution is unitary. The answer is that a Hamiltonian that has an unbroken PT symmetry also possesses a physical symmetry that we call C. Using C, we show how to construct an inner product whose associated norm is positive definite. The result is a new class of fully consistent complex quantum theories. Observables exhibit CPT symmetry, probabilities are positive, and the dynamics is governed by unitary time evolution.     

大焦深成像系统仿真实验研究

如何增大非相干光学成像系统的焦深是应用光学研究领域的热点问题.本文对采用高次非球面光学掩模板与图像处理相结合增大成像光学系统焦深的新方法进行了深入分析,建立了大焦深成像系统仿真实验模型,并进行了大焦深成像系统仿真实验.实验结果证明了该方法在维持原相对孔径的同时使光学系统在较大的离焦范围内有好的成像质量.实际应用中还要综合考虑模板参量、信噪比等关键因素.     

Near-Optimal Controls of Discrete-Time Dynamic Systems Driven by Singularly-Perturbed Markov Chains

This work is devoted to near-optimal controls of large-scale discrete-time nonlinear dynamic systems driven by Markov chains; the underlying problem is to minimize an expected cost function. Our main goal is to reduce the complexity of the underlying systems. To achieve this goal, discrete-time control models under singularly-perturbed Markov chains are introduced. Using a relaxed control representation, our effort is devoted to finding near-optimal controls. Lumping the states in each irreducible class into a single state gives rise to a limit system. Applying near-optimal controls of the limit system to the original system, near-optimal controls of the original system are derived.