End-to-End QoS for Video Delivery Over Wireless Internet

Providing end-to-end quality of service (QoS) support is essential for video delivery over the next-generation wireless Internet. We address several key elements in the end-to-end QoS support, including scalable video representation, network-aware end system, and network QoS provisioning. There are generally two approaches in QoS support: the network-centric and the end-system centric solutions. The fundamental problem in a network-centric solution is how to map QoS criterion at different layers respectively, and optimize total quality across these layers. We first present the general framework of a cross-layer network-centric solution, and then describe the recent advances in network modeling, QoS mapping, and QoS adaptation. The key targets in end-system centric approach are network adaptation and media adaptation. We present a general framework of the end-system centric solution and investigate the recent developments. Specifically, for network adaptation, we review the available bandwidth estimation and efficient video transport protocol; for media adaptation , we describe the advances in error control, power control, and corresponding bit allocation. Finally, we highlight several advanced research directions.     

Analysis of queueing policies in QoS switches

It is widely accepted that next-generation networks will provide guaranteed services, in contrast to the “best effort” approach today. We study and analyze queueing policies for network switches that support the QoS (Quality of Service) feature. One realization of the QoS feature is that packets are not necessarily all equal, with some having higher priorities than the others. We model this situation by assigning an intrinsic value to each packet. In this paper we are concerned with three different queueing policies: the nonpreemptive model, the FIFO preemptive model, and the bounded delay model. We concentrate on the situation where the incoming traffic overloads the queue, resulting in packet loss. The objective is to maximize the total value of packets transmitted by the queueing policy. The difficulty lies in the unpredictable nature of the future packet arrivals. We analyze the performance of the online queueing policies via competitive analysis, providing upper and lower bounds for the competitive ratios. We develop practical yet sophisticated online algorithms (queueing policies) for the three queueing models. The algorithms in many cases have provably optimal worst-case bounds. For the nonpreemptive model, we devise an optimal online algorithm for the common 2-value model. We provide a tight logarithmic bound for the general nonpreemptive model. For the FIFO preemptive model, we improve the general lower bound to 1.414, while showing a tight bound of 1.434 for the special case of queue size 2. We prove that the bounded delay model with uniform delay 2 is equivalent to a modified FIFO preemptive model with queue size 2. We then give improved upper and lower bounds on the 2-uniform bounded delay model. We also show an improved lower bound of 1.618 for the 2-variable bounded delay model, matching the previously known upper bound.     

A theoretical study of the ion pair SN2 reaction between lithium isocyanates with methyl fluoride with inversion and retention mechanism

This paper is devoted to a detailed theoretical study of an ion pair S_N2 reaction LiNCO+CH₃F in the gas phase and in solution at the level of MP2(full)/6-31+G**//HF/6-31+G**. Two possible reaction mechanisms, inversion and retention, are discussed. There are eight possible reaction pathways. The inversion mechanism is more favorable no matter in the gas phase or in solution based on analyses of the transition structures. Methyl isocyanate should form preferentially in the gas phase and more stable methyl cyanate is the main product in solution. The retardation of the reaction in solvents was attributed to the difference in solvation in the separated reactants and in the transition state.     

DSP技术在声强测试系统中的应用

根据声强测试过程中对数据处理系统的需求,提出了以数字信号处理器(DSP)TMS320C5409与A/D转换器芯片MAX125为核心构建高速多通道声强数据采集处理系统的方案,并结合它们的特点对该方案进行了论证.同时,详细介绍了TMS320C5409与MAX125之间的硬件接口电路的设计和软件编程的方法.实验表明,该数据采集处理系统具有速度快、可靠性高、结构简单等特点,满足声强测试过程的技术要求.     

MIMO系统中简单的扩展空时块编码分集技术研究

本文提出一种多输入多输出（MIMO）天线系统中简单的扩展空时块编码（SSTBC）分集技术，采用沃尔什码来区分各天线发送数据子流。采用这种方法，在系统带宽一定时，不降低发送信息速率，同时接收机简单。不同天线的发送信息经过了所有收一发天线对之间的空间子信道，获得了所有路径的部分空间分集增益，仿真结果表明，这种增益的获得不受限于接收分集阶数，并且随发射天线的增加以一定的线性关系增加。     

组件式GIS在密钥管理系统中的应用

本文讲述了利用组件式GIS技术,在密钥管理系统中进行GIS集成二次开发,实现设备地图技术,为密钥管理系统业务中的保密设备管理提供图形化、可视化支持,并给出了基于组件式GIS的密钥管理系统模型。     

Ultra-wideband bandpass filter with hybrid microstrip/CPW structure

A novel ultra-wideband (UWB) bandpass filter (BPF) is presented using the hybrid microstrip and coplanar waveguide (CPW) structure. A CPW nonuniform resonator or multiple-mode resonator (MMR) is constructed to produce its first three resonant modes occurring around the lower end, center, and higher end of the UWB band. Then, a microstrip/CPW surface-to-surface coupled line is formed and modeled to allocate the enhanced coupling peak around the center of this UWB band, i.e., 6.85GHz. As such, a five-pole UWB BPF is built up and realized with the passband covering the entire UWB band (3.1-10.6GHz). A predicted frequency response is finally verified by the experiment. In addition, the designed UWB filter, with a single resonator, only occupies one full-wavelength in length or 16.9mm.     

Frequency notched printed slot antenna with parasitic open-circuit stub

A new frequency notched ultra-wideband microstrip slot antenna with a parasitic tuning stub is proposed. The antenna is similar in configuration to a conventional microstrip slot antenna; by introducing a parasitic open-circuit tuning stub, flexible frequency notched function is achieved. Several properties of the antenna, such as frequency notched function, antenna transfer function and gain, have been investigated. As is reported, the operation bandwidth of the antenna is 2.91-11.16 GHz, in which a frequency notched band of 5.10-5.85 GHz has been achieved. Furthermore, good ultra-wideband linear transmission performance over the entire operation frequency range has also been achieved.     

Circular perfect graphs

For 1 ≤ d ≤ k, let K_k/d be the graph with vertices 0, 1, …, k ? 1, in which i ～j if d ≤ |i ? j| ≤ k ? d. The circular chromatic number χ_c(G) of a graph G is the minimum of those k/d for which G admits a homomorphism to K_k/d. The circular clique number ω_c(G) of G is the maximum of those k/d for which K_k/d admits a homomorphism to G. A graph G is circular perfect if for every induced subgraph H of G, we have χ_c(H) = ω_c(H). In this paper, we prove that if G is circular perfect then for every vertex x of G, N_G[x] is a perfect graph. Conversely, we prove that if for every vertex x of G, N_G[x] is a perfect graph and G ? N[x] is a bipartite graph with no induced P₅ (the path with five vertices), then G is a circular perfect graph. In a companion paper, we apply the main result of this paper to prove an analog of Haj?os theorem for circular chromatic number for k/d ≥ 3. Namely, we shall design a few graph operations and prove that for any k/d ≥ 3, starting from the graph K_k/d, one can construct all graphs of circular chromatic number at least k/d by repeatedly applying these graph operations. © 2005 Wiley Periodicals, Inc. J Graph Theory 48: 186–209, 2005     

3,7-二硝基亚氨基-2,4-二氮杂双环[3,3,0]辛烷的放热分解反应动力学

在程序升温条件下 ,用DSC研究了标题化合物的放热分解反应动力学 .用线性最小二乘法、迭代法以及二分法与最小二乘法相结合的方法 ,以积分方程、微分方程和放热速率方程拟合DSC数据 .在逻辑选择建立了微分和积分机理函数的最可几一般表达式后 ,用放热速率方程得到相应的表观活化能 (Ea)、指前因子 (A)和反应级数 (n)的值 .结果表明 :该反应的微分形式的经验动力学模式函数、Ea 和A值分别为 (1-α) 0 .44、2 30 .4kJ/mol和 10 18.16s-1.借助加热速率和所得动力学参数值 ,提出了标题化合物放热分解反应的动力学方程 .该化合物的热爆炸临界温度为 30 2 .6℃ .上述动力学参数对分析、评价标题化合物的稳定性和热变化规律十分有用 .