新一代IP QoS的实现

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

TCP/IP网络的动态模型描述

拥塞现象成为TCP/IP网络发展面临的一个重要问题。因此，拥塞控制对TCP/IP网络的鲁棒性和稳定性具有重要作用。目前，网络拥塞控制策略主要包括两类：端到端的控制机制，如TCP拥塞控制算法；网络内部的主动队列管理(AQM)策略。但由于缺乏对网络系统动态特性的了解，这些拥塞控制策略大都基于专家经验，并没有建立完整的理论分析框架。为此，本文从数据流的角度出发，通过建立网络基本单元状态方程模型来实现IP网络系统的数学解析模型，然后用混杂系统来描述TCP带有拥塞控制策略的数据传输过程，建立了TCP/IP网络的动态模型，为网络系统中动态性能的分析、拥塞控制策略的设计奠定了基础。实验结果表明，该数学模型与NS仿真实验的结果相一致。     

The validity of psychophysiological detection of information with the Guilty Knowledge Test: A meta-analytic review.

The authors performed a meta-analysis based on 169 conditions, gathered from 80 laboratory studies, to estimate the validity of the Guilty Knowledge Test (GKT) with the electrodermal measure. The over-all average effect size was 1.55, but there were considerable variations among studies. In particular, mock-crime studies produced the highest average effect size (2.09). Three additional moderators, were identified: Motivational instructions, deceptive ("no") verbal responses, and the use of at least 5 questions were associated with enhanced validity. Finally, a set of 10 studies that best approximated applications of the GKT under optimal conditions produced an average effect size of 3.12. The authors discuss factors that might limit the generalizability of these results and recommend further research of the GKT in realistic setups. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Jitter in ATM networks and its impact on peak rate enforcement

Cells arriving to an ATM network experience random delays due to queueing in upstream multiplexing stages, notably in customer premises. This is the phenomenon of jitter and the aim of the present paper is to study its influence on peak rate enforcement. We first introduce some general characterizations of jitter and then, describe two models of jittered flows based on simple queueing systems. We discuss the objectives of peak rate enforcement and study the impact of jitter on the dimensioning of jumping window and leaky bucket mechanisms. A useful synthetic characterization of jitter appears to be a remote quantile of the cell delay distribution expressed in units of the initial inter-cell interval.     

Sexualities, technologies, and the teaching of writing: A critical overview

In this introduction to a special issue of Computers and Composition, the authors critically review current literature on computer-assisted writing pedagogies that grapple with issues of sexuality. Although this body of work is small, it points to provocative ways to develop our students’ critical and rhetorical sensibilities about the constructions of sexuality in our culture. Further, such work innovatively addresses the place of networked communication technologies in the interrogation of such constructions. The authors conclude with both an introduction of the work in this special issue that addresses the intersection of sexuality studies and computer-assisted writing studies and with a call for additional work in this field.     

Tandem queues with general blocking: A unified model and comparison results

We study tandem queues with finite intermediate buffers and develop a general blocking scheme that unifies and generalizes various blocking schemes previously studied in the literature, such as manufacturing blocking, communication blocking, kanban blocking and its variations. In the general blocking scheme, job movement and service at each stage are controlled by three parameters, which represent, respectively, the upper limits (at that stage) on work-in-process inventory, finished goods inventory, and buffer space. We derive a set of recursive equations that characterize the dynamics of the system, in terms of the job completion and departure processes, and establish comparison results for these processes in the settings of stochastic ordering, variability ordering and stochastic convexity. Free of distributional assumptions, the results provide characterization of system behavior with respect to the control parameters as well as to the arrival and service processes. We also compare system performance under two different modes of operation: make-to-order versus make-to-stock, and demonstrate the trade-off between improving service and reducing inventory. Numerical studies are also presented to illustrate the diversity of performance trade-off, including composition of inventory, offered by the general model.Supported in part by NSF under grant ECS-89-96201.     

Decisive arrival law parameters and a general finite capacity queueing problem

This paper addresses the problem of finding the parameters of the arrival law which most significantly influence expected occupation and loss of a finite capacity queue. The input process is supposed to be ergodic and wide sense stationary. We show that it is mostly possible to fit an MMPP(2) to the decisive parameters of observational data. Numerical examples illustrate the importance of the decisive parameters, called key parameters, and also show the accuracy of the proposed fitting procedure. Finally, in the appendix we present the solution of the finite capacity queueing problem with Special Semi Markov Process (SSMP) arrivals and a general service strategy.     

A polynomial factorization approach to the discrete time GI/G/1/(N) queue size distribution

The queue of a single server is considered with independent and identically distributed interarrivai and service times and an infinite (GI/G/1) or finite (GI/G/1/N) waiting room. The queue discipline is non-preemptive and independent of the service times.

A discrete time version of the system is analyzed, using a two-component state model at the arrival and departure instants of customers. The equilibrium equations are solved by a polynomial factorization method. The steady state distribution of the queue size is then represented as a linear combination of geometrical series, whose parameters are evaluated by closed formulae depending on the roots of a characteristic polynomial.

Considering modified boundary constraints, systems with finite waiting room or with an exceptional first service in each busy period are included.     

机械制图虚拟实验室的研究与设计

论述了一个网络化，信息化实验系统开发的方法和思路。该系统以虚拟技术为支撑，以图学教育的宗旨为核心，综合利用了虚拟技术的各种开发工具和理论，具有虚拟现实系统常有的特点，沉浸感，交互性，构想。