全球移动增值业务发展现状

移动增值业务在全球的发展速度依然很快,非话音收入占电信总收入的比重越来越大.在移动增值业务的发展上,日本遥遥领先,韩国紧随其后.在中国,虽然短信业务收入开始下降,但无线应用协议(WAP)、交互式语音回应(lVR)等业务收入快速攀升,从而保证了移动增值业务在中国的发展速度.由于中国信息产业部整顿收费混乱的移动增值业务市场,使服务提供商/内容提供商(SP/CP)的暴利时代成为过去,增值业务市场进入精耕细作期.随着用户对移动增值业务新的需求的不断增长,整首音乐下载、移动E-mail以及手机电视等业务将成为未来全球最有前途的移动增值业务.     

基于Protel DXP的电路仿真设计

Protel DXP是集所有设计工具于一身的电子设计自动化(EDA)软件.文中运用其内嵌的仿真器叙述了分压式偏置电路放大器的仿真设计过程,设计过程简单、方便.在电子线路理论教学过程中引入电路设计仿真环节在不同情况下对电路进行实时分析,不仅可以提高学生的学习兴趣,而且能够在较短时间内加深学生对理论知识的理解;在工程设计过程中利用仿真工具对电路进行即时测试,可以缩短设计周期,提高设计效率.     

A new distributed approximation algorithm for constructing minimum connected dominating set in wireless ad hoc networks

In recent years, constructing a virtual backbone by nodes in a connected dominating set (CDS) has been proposed to improve the performance of ad hoc wireless networks. In general, a dominating set satisfies that every vertex in the graph is either in the set or adjacent to a vertex in the set. A CDS is a dominating set that also induces a connected sub‐graph. However, finding the minimum connected dominating set (MCDS) is a well‐known NP‐hard problem in graph theory. Approximation algorithms for MCDS have been proposed in the literature. Most of these algorithms suffer from a poor approximation ratio, and from high time complexity and message complexity. In this paper, we present a new distributed approximation algorithm that constructs a MCDS for wireless ad hoc networks based on a maximal independent set (MIS). Our algorithm, which is fully localized, has a constant approximation ratio, and O(n) time and O(n) message complexity. In this algorithm, each node only requires the knowledge of its one‐hop neighbours and there is only one shortest path connecting two dominators that are at most three hops away. We not only give theoretical performance analysis for our algorithm, but also conduct extensive simulation to compare our algorithm with other algorithms in the literature. Simulation results and theoretical analysis show that our algorithm has better efficiency and performance than others. Copyright © 2005 John Wiley & Sons, Ltd.     

OADM环网的实验研究

研究了光分插复用器(OADM)的关键技术,重点分析了相关的实现技术,完成了利用OADM构建全光环网的实验研究,给出了重要的实验数据,包括眼图、光谱图、光信噪比、保护与恢复等,并对这些实验数据进行了分析,为光传送网的设计与构建提供了重要的参考依据.     

HL-1M装置等离子体与ICRH发射天线的相互作用

ICRH实验的一个比较突出的问题就是杂质。杂质的产生与ICRH发射天线同等离子体的相互作用和RF脉冲的发射有着不可忽视的联系。对HL－1M装置的ICRH发射天线在两年多实验中的变化作了简要的介绍和讨论，并对今后ICRH发射天线的设计提出了一些建议。     

解线性最小二乘问题的一个新并行算法

讨论了求解无约束线性最小二乘问题的一种并行单纯形法以及对它的改进算法并行共轭梯度—单纯形法 .算法本身具有很强的并行机制 ,能够充分地发挥并行机快速省时的特点 .本文也对算法做了理论分析 ,对算法的收敛性给予了证明 (在二维情形下 ) .最后做了数值实验 (由于软硬件条件的限制 ,并行算法未能在并行计算机上实现 ,鉴于这种情况 ,我们所做的数值实验均是在串行机上完成的 )     

Pump–probe second harmonic generation study of ultrafast spin dynamics in semiconductor multilayers

We report the first application of pump–probe second harmonic generation (SHG) measurements to characterize optically induced magnetization in non‐magnetic multilayer semiconductors. In the experiment, spin‐polarized electrons are excited selectively by a pump beam in the GaAs layer of GaAs/GaSb/InAs structures. However, the resulting net magnetization manifests itself through the induced SHG probe signal from the GaSb/InAs interface, thus indicating a spin‐polarized electron transport across the heterostructure. We find that the magnetization dynamics are governed by an interplay between the spin density evolution at the interfaces and the spin relaxation. Copyright © 2003 John Wiley & Sons, Ltd.     

基因组重排问题的一个近似算法

分子生物学中基因无方向的反向基因组重排问题在数学上已被证明是一个NP困难问题．基于断点图的概念，给出一个时间复杂性为O(max{b^(π)，nb(π)})，空间复杂性为0(n)的求其近似最优解的算法．其中n为基因组中基因个数，π=(π1,π2，…，πn)表示n个基因的一种排列，b(π)表示排列π中的断点数．数据实验的结果表明，该近似算法可以求得较好的结果．     

Effects of Spatial Characteristics on Smart Antenna System with Uniform Linear Antenna Array

1IntroductionCurrently,smart antenna technology can greatly en-hance system performance and i mprove the system ca-pacity so that it has been considered as a keytechnologyinthe third generation wireless communicationsystems .The researches on channel model , beamforming algo-rithms and receive algorithms have been widely carriedout and a great many of proposition have beensubmittedtothe 3th Generation Project Partner (3GPP) . Fromthe viewpoint of link-level and system-level research,many asp…     

A model study for the steady state error of numerical approximations of inviscid flow equations on Cartesian grid

The widely used locally adaptive Cartesian grid methods involve a series of abruptly refined interfaces. In this paper we consider the influence of the refined interfaces on the steady state errors for second‐order three‐point difference approximations of flow equations. Since the various characteristic components of the Euler equations should behave similarly on such grids with regard to refinement‐induced errors, it is sufficient enough to conduct the analysis on a scalar model problem. The error we consider is a global error, different to local truncation error, and reflects the interaction between multiple interfaces. The steady state error will be compared to the errors on smooth refinement grids and on uniform grids. The conclusion seems to support the numerical findings of Yamaleev and Carpenter (J. Comput. Phys. 2002; 181: 280–316) that refinement does not necessarily reduce the numerical error. Copyright © 2005 John Wiley & Sons, Ltd.