No.7信令监测系统的发展与应用

简要介绍No.7信令监测系统的技术现状、发展前景及应用情况,阐述了No.7信令监测系统在公众电话网（国际国内电话网／智能网等）的网络维护管理工可以发挥的强大功能和多种应用。     

传输网管技术的现状及展望

本文从接口标准化、接口提供、网管系统开发实施等方面,全面分析了传输网管技术的发展现状,并对存在的困难及其出路做了探讨和展望。     

A Fast Intra Skip Detection Algorithm for H.264/AVC Video Encoding

A fast intra skip detection algorithm based on the rate‐distortion (RD) cost for an inter frame (P‐slices) is proposed for H.264/AVC video encoding. In the H.264/AVC coding standard, a robust rate‐distortion optimization technique is used to select the best coding mode and reference frame for each macroblock (MB). There are three types of intra predictions according to profiles. These are 16×16 and 4×4 intra predictions for luminance and an 8×8 intra prediction for chroma. For the high profile, an 8×8 intra prediction has been added for luminance. The 4×4 prediction mode has 9 prediction directions with 4 directions for 16×16 and 8×8 luma, and 8×8 chrominance. In addition to the inter mode search procedure, an intra mode search causes a significant increase in the complexity and computational load for an inter frame. To reduce the computational load of the intra mode search at the inter frame, the RD costs of the neighborhood MBs for the current MB are used and we propose an adaptive thresholding scheme for the intra skip extraction. We verified the performance of the proposed scheme through comparative analysis of experimental results using joint model reference software. The overall encoding time was reduced up to 32% for the IPPP sequence type and 35% for the IBBPBBP sequence type.     

高频雷达电台干扰抑制的稳健最小二乘方法

为对抗工作环境下的非平稳短波电台干扰,本文基于对偶极化的高频地波超视距雷达接收系统提出了新的稳健最小二乘抗干扰算法,改善高频雷达目标检测的性能.该方法基于凸空间最优化的思想,修正水平极化辅助天线接收数据,设定最大的环境误差范围,保证在最差误差环境下的最优干扰抑制性能.通过转换该凸最优的约束方程为简单的一维搜索,提出了最优加权系数的有效求解方法.实验数据处理结果表明了方法的有效性.     

Burstification Queue Management in Optical Burst Switching Networks

Among the various issues lying in optical burst switching (OBS) networks, burstification, i.e., assembling multiple IP packets into bursts, is an important one. Between the two important aspects related to burst assembly, the burst assembly algorithm aspect has been extensively studied in the literature. However, as far as we know, there is no research about the burstification queue management (BQM) aspect, which refers to how many burstification queues (BQ) we should set at each OBS edge node and how to manage these BQs. Suppose there are G destinations (egress edge nodes) and the OBS network provides S different quality of service (QoS) classes. Traditionally, it is simply regarded that each ingress edge node needs G· S queues to sort incoming packets, one for each possible destination and QoS class. For simplicity, we call this policy the static dedicate BQM (SDB) policy. The SDB policy, though simple, lacks scalability since we have to add S BQs at each OBS edge node if an extra OBS edge node is added to the OBS network. To solve this problem, we propose in this paper two BQM policies: quasi-static BQM (QSB) policy and dynamic BQM (DB) policy. For the QSB policy, we derive the packet loss probability due to lacking BQs based on a Markov chain, from which we can work out the employed number of BQs for a given packet loss probability. Based on these results, the scalability of the QSB policy is also studied. With the DB policy, we not only can dynamically assign BQs for incoming packets, but also can dynamically allocate buffer capacity for each BQ by using a least-mean-square (LMS)-based linear prediction filter. The performance of the DB policy is investigated by analysis and extensive simulations. We also compared the performance of the QSB policy and the DB policy. Results from analysis and simulation demonstrate that the DB policy is the best.     

Group-Scheduling for Multi-Service Optical Burst Switching (OBS) Networks

We propose a new burst scheduling mechanism for Optical Burst-Switched (OBS) networks. The new approach is made possible by gathering data bursts into groups and performing the scheduling decision for each group collectively. In OBS group-scheduling, bursts will not be considered for scheduling until a pre-defined time period elapses, during which the group of burst header packets would be gathered. By transforming a set of data bursts into a set of corresponding time intervals, the problem of scheduling these bursts is transformed into a combinatorial optimization problem. Graph algorithms are applied to obtain the maximum number of non-overlapping bursts. The proposed OBS group-scheduling scheme is shown to improve the performance of OBS networks over existing scheduling schemes in terms of burst loss probability and channel utilization. With an extension through a sequential optimization, using a Branch-and-Bound technique, the proposed scheme can support multiple classes of service. It is shown that the new scheduling approach has several desired characteristics including fairness and service differentiability among classes in terms of burst loss probability and channel utilization.     

讯宝科技的RFID技术为福田汽车加速

福田作为中国全系列商用汽车领军企业,为了能够确立竞争优势,积极打造服务体系。在无线技术被广泛利用的今天,福田为了避免库存,时效,准确率等问题,经过慎重选型,选择了美国讯宝科技公司及其合作伙伴。条形码结合无线技术不但降低了库存成本,提高了客户响应速度,而且提供了准确及时的库存信息,大大提高了福田汽车在商用车市场的竞争力。     

a—Si太阳电池陷光结构的新模型及其优化

我们在分析陷光结构的表面形貌后,对陷光结构提出一个新的模型,并用它计算和分析析射率、形貌和膜厚等参数对陷光效果的影响。通过计算,我们找出这些参数的最佳值,并依此对陷光结构进行优化,以提高非晶硅太阳电池的效率和稳定性。     

Power and Speed-Efficient Code Transformation of Video Compression Algorithms for RISC Processors

Upcoming multi-media compression applications will require high memory bandwidth. In this paper, we estimate that a software reference implementation of an MPEG-4 video decoder typically requires 200 Mtransfers/s to memory to decode 1 CIF (352×288) Video Object Plane (VOP) at 30 frames/s. This imposes a high penalty in terms of power but also performance.However, we also show that we can heavily improve on the memory transfers, without sacrificing speed (even gaining about 10% on cache misses and cycles for a DEC Alpha), by aggressive code transformations. For this purpose, we have manually applied an extended version of our data transfer and storage exploration (DTSE) methodology, which was originally developed for custom hardware implementations.