Simultaneous Removal of Antibiotics and Heavy Metals with Poly(Aspartic Acid)-Based Fenton Micromotors

The discharge of diverse pollutants has led to a complex water environment and posed a huge health threat to humans and animals. Self-propelled micromotors have recently attracted considerable attention for efficient water remediation due to their strong localized mass transfer effect. However, a single functionalized component is difficult to tackle with multiple contaminants and requires to combine different decontamination effects together. Here, we introduced a multifunctional micromotor to implement the adsorption and degradation roles simultaneously by integrating the poly(aspartic acid) (PASP) adsorbent with a MnO₂-based catalyst. The as-prepared micromotors are well propelled in contaminated waters by MnO₂ catalyzing hydrogen peroxide. In addition, the catalytic ramsdellite MnO₂(R-MnO₂) inner layer is decorated with Fe₂O₃ nanoparticles to improve their catalytic performance, contributing to an excellent degradation ability with 90% tetracycline (TC) removal in 50 minutes by enhanced Fenton-like reactions. Combining the attractive adsorption capability of poly (aspartic acid) (PASP), the composite micromotors offer an efficient removal of heavy metal ions in short time. Moreover, the designed micromotors are able to simultaneously remove antibiotic and heavy metals in mixed contaminants circumstance just in single treatment. This multifunctional micromotor with distinctive decontamination ability exhibits a promising prospective in treating multiple pollutants in the future.     

On the Moments of Overflow and Freed Carried Traffic for the GI/M/C/0 System

In circuit-switched networks call streams are characterized by their mean and peakedness (two-moment method). The GI/M/C/0 system is used to model a single link, where the GI-stream is determined by fitting moments appropriately. For the moments of the overflow traffic of a GI/M/C/0 system there are efficient numerical algorithms available. However, for the moments of the freed carried traffic, defined as the moments of a virtual link of infinite capacity to which the process of calls accepted by the link (carried arrival process) is virtually directed and where the virtual calls get fresh exponential i.i.d. holding times, only complex numerical algorithms are available. This is the reason why the concept of the freed carried traffic is not used. The main result of this paper is a numerically stable and efficient algorithm for computing the moments of freed carried traffic, in particular an explicit formula for its peakedness. This result offers a unified handling of both overflow and carried traffics in networks. Furthermore, some refined characteristics for the overflow and freed carried streams are derived.     

准移动闭塞系统的元胞自动机模型及列车延迟传播规律的研究

在NaSch模型的基础上，针对铁路交通的特点提出一种用于模拟准移动闭塞系统的元胞自动机模型.应用该模型模拟了准移动闭塞系统列车延迟传播的交通现象，分析了准移动闭塞系统中的轨道定位单元长度、发车时间间隔、初始延迟时间等因素对列车延迟传播的影响. 关键词： 元胞自动机 交通流 准移动闭塞     

Inequalities for the Moments and Distribution of the Ladder Height of a Random Walk

We obtain upper bounds for the tail distribution of the first nonnegative sum of a random walk and for the moments of the overshoot over an arbitrary nonnegative level if the expectation of jumps is positive and close to zero. In addition, we find an estimate for the expectation of the first ladder epoch.     

<Emphasis Type="Italic">J/Ψ</Emphasis>production

For more than 25 yearsJΨ production has helped to sharpen our understanding of QCD. In proton induced reaction some observations are rather well understood while others are still unclear. The current status of the theory ofJΨ production will be sketched, paying special attention to the issues of formation time andJΨ re-interaction in a nuclear medium.     

交通灯控制下城市主干道双车道多速元胞自动机交通流模型研究

提出一个城市主干道双车道多速元胞自动机交通流模型，此模型采用开放性 边界条件，在考虑诸多实际因素影响情况下，研究了主干道中车站的设置、交通灯绿信比对 车流量和车流速度的影响.计算机模拟所得到的基本图（流量 速度图）能较好地反映在交 通灯控制下城市主干道交通流真实状况. 关键词： 元胞自动机模型 交通流 主干道     

On the Existence of Solutions to Vector Quasivariational Inequalities and Quasicomplementarity Problems with Applications Break to Traffic Network Equilibria

For vector quasivariational inequalities involving multifunctions in topological vector spaces, an existence result is obtained without a monotonicity assumption and with a convergence assumption weaker than semicontinuity. A new type of quasivariational inequality is proposed. Applications to quasicomplementarity problems and traffic network equilibria are considered. In particular, definitions of weak and strong Wardrop equilibria are introduced for the case of multivalued cost functions.     

随机化交通灯的二维元胞自动机交通模型

元胞自动机交通模型以简单的规则反映交通系统中的多种因素，可以分析各种交通现象，且可在计算机上方便、高效地运作·Ｂｉｈａｍ－Ｍｉｄｄｌｅｔｏｎ－Ｌｅｖｉｎｅ模型（ＢＭＬ模型）实现了二维交通问题的元胞自动机模型的模拟研究·本文对ＢＭＬ模型作了改进，解除了该模型中关于交通灯同步变化的限制·在新模型中，每个路口的交通灯可以自由选定起始工作时间和变化节奏，于是可以更全面、准确地反映交通灯对交通系统性能的影响·本文还对新模型中出现的若干新效应作了解释·     

Formulation,Stability, and Computation of Traffic Network Equilibria as Projected Dynamical Systems

In this paper, we present a unified treatment and analysis of a dynamic traffic network model with elastic demands formulated and studied as a projected dynamical system. We propose a travel route choice adjustment process that satisfies the projected dynamical system. Under certain conditions, stability and asymptotical stability of the equilibrium patterns are then derived. Finally, two discrete-time algorithms, the Euler method and the Heun method, are proposed for the computation of the solutions, and convergence results established. The convergence results depend crucially on stability analysis. The performance of the algorithms is then illustrated on several transportation networks.     

Polling systems in heavy traffic: Exhaustiveness of service policies

We study the expected delay in cyclic polling models with general ‘branching-type’ service disciplines. For this class of models, which contains models with exhaustive and gated service as special cases, we obtain closed-form expressions for the expected delay under standard heavy-traffic scalings. We identify a single parameter associated with the service discipline at each queue, which we call the ‘exhaustiveness’. We show that the scaled expected delay figures depend on the service policies at the queues only through the exhaustiveness of each of the service disciplines. This implies that the influence of different service disciplines, but with the same exhaustiveness, on the expected delays at the queues becomes the same when the system reaches saturation. This observation leads to a new classification of the service disciplines. In addition, we show monotonicity of the scaled expected delays with respect to the exhaustiveness of the service disciplines. This induces a complete ordering in terms of efficiency of the service disciplines. The results also lead to new rules for optimization of the system performance with respect to the service disciplines at the queues. Further, the exact asymptotic results suggest simple expected waiting-time approximations for polling models in heavy traffic. Numerical experiments show that the accuracy of the approximations is excellent for practical heavy-traffic scenarios. This revised version was published online in June 2006 with corrections to the Cover Date.