Potts models with magnetic field: Arithmetic,geometry, and computation

We give a sheaf theoretic interpretation of Potts models with external magnetic field, in terms of constructible sheaves and their Euler characteristics. We show that the polynomial countability question for the hypersurfaces defined by the vanishing of the partition function is affected by changes in the magnetic field: elementary examples suffice to see non-polynomially countable cases that become polynomially countable after a perturbation of the magnetic field. The same recursive formula for the Grothendieck classes, under edge-doubling operations, holds as in the case without magnetic field, but the closed formulae for specific examples like banana graphs differ in the presence of magnetic field. We give examples of computation of the Euler characteristic with compact support, for the set of real zeros, and find a similar exponential growth with the size of the graph. This can be viewed as a measure of topological and algorithmic complexity. We also consider the computational complexity question for evaluations of the polynomial, and show both tractable and NP-hard examples, using dynamic programming.     

新一代IP QoS的实现

文章介绍了新一代IP骨干网上的IP QoS实现技术，论述了集成业务(IntServ)与差分业务(DiffServ)解决方案的特点，详细介绍了相关的队列管理与排队机制。并结合多协议标签交换（MPLS)技术的最新发展，阐述了综合多协议标签交换流量工程与DiffServ技术体系端到端IP QoS的实现。     

Analysis of Distributed DDQ for QoS Router

In a packet switching network, congestion is unavoidable and affects the quality of real‐time traffic with such problems as delay and packet loss. Packet fair queuing (PFQ) algorithms are well‐known solutions for quality‐of‐service (QoS) guarantee by packet scheduling. Our approach is different from previous algorithms in that it uses hardware time achieved by sampling a counter triggered by a periodic clock signal. This clock signal can be provided to all the modules of a routing system to get synchronization. In this architecture, a variant of the PFQ algorithm, called digitized delay queuing (DDQ), can be distributed on many line interface modules. We derive the delay bounds in a single processor system and in a distributed architecture. The definition of traffic contribution improves the simplicity of the mathematical models. The effect of different time between modules in a distributed architecture is the key idea for understanding the delay behavior of a routing system. The number of bins required for the DDQ algorithm is also derived to make the system configuration clear. The analytical models developed in this paper form the basis of improvement and application to a combined input and output queuing (CIOQ) router architecture for a higher speed QoS network.     

彩色AC-PDP运动图像仿真系统的开发

开发了彩色AC-PDP运动图像仿真系统,通过利用本系统的运动图像仿真功能可以对现有的各种显示技术、与子场有关的各种因素进行仿真及比较,为人们开发提高彩色AC-PDP图像显示质量的新型技术及子场提供了理论上的依据;通过利用本系统的Gamma特性研究功能可以对彩色AC-PDP中视频信号的反Gamma特性进行研究,并对反Gamma相关编码进行子场逼近,为选择符合要求的子场编码提供了判据.     

SDCCH信道话务量评估及最佳配置

本比较详细地阐述了SDCCH信道话务量的计算方法及在GSM网络中的配置原则，以便使网络资源达到最佳配置，发挥最大的经济效益。在论述中提出了3种方法：(1)建立SDCCH信道话务模型的方法；(2)评估SDCCH信道话务量的计算方法；(3)选择SDCCH信道最佳配置的方法。这3种方法供大家参考。     

目标RCS动态数据的分布特征研究

复杂目标在不同视向的RCS分布特征是不同的，传统模型对此都没有给出详细的结果。文中以某歼击机和直升机为对象，应用X^2。分布、对数正态分布和瑞利分布模型，以及Kolmogomv拟合优度检验方法，研究其RCS动态测量数据的统计分布特征，得到了在一定显著性水平下，两种目标在不同视向角下对三种模型的拟合效果，同时得到应用X^2。分布拟合时模型半自由度随视向角的分布情况。在显著性水平为0．05时，对于在较短时间内录得的复杂目标动态RCS数据，应用X^2分布可以取得较好的拟合效果。文中结果精确地描述了目标RCS的起伏特征，能够为目标回波的精确模拟与检测提供可靠的依据。     

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

2Mbit/s高速信令链路在移动通信七号信令网中的应用

通过对2Mbit/s高速信令链路原理、特点的介绍，阐明了该技术在现阶段使用的实际意义，并给出了2Mbit/s高速信令链路在移动通信七号信令网中的应用。     

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.