Sensitivity analysis of lossy coupled transmission lines

An analysis method, based on the numerical inversion of the Laplace transform, is described for the evaluation of the time domain sensitivity of networks that include lossy coupled transmission lines. The sensitivity can be calculated with respect to network components and parameters of the transmission lines. Sensitivity analysis is useful for waveform shaping and optimization. Examples and comparisons with sensitivity determined by perturbation are presented     

快度中心区强子物质输运系数和粘滞流体演化

用Chapman-Enskog方法计算了相对论性重离子碰撞快度中心区产生的π介子物质的输运系数,并建立了相应的粘滞流体力学方程,进而讨论了粘滞对π介子物质演化过程的影响.结果表明,粘滞将减缓快度中心区π介子物质的冷却速度.     

一种可调节电流的电流型PWM直流转换器

介绍一种用于驱动发光二极管(LED)的可调节电流的电流型PWM直流转换器.该直流转换器由于接有一个外接电阻,可以通过调节外接电阻的大小来调节输出电流.输出电流调节范围在5～40mA之间.主要分析了电路的输出电流调节功能,和这种输出电流可变的电流型PWM直流转换器的电流和电压反馈环的反馈实现原理.并简要介绍了这种带电流调节功能的PWM直流转换器的工作原理,最后给出了电路在输出不同电流时使用HSPICE软件对反馈参考电压,PWM锁存器输出波形的仿真结果.     

基于HMM方法的动态手势轨迹训练性能研究

基于HMM(Hidden Markov Model,隐形马尔可夫模型)对动态手势轨迹的训练是手势识别的关键技术之一。本文对HMM的模型训练采用Baum.Welch算法,并分别从迭代次数,样本个数选取,以及模型初值选取等方面对动态手势轨迹的训练性能进行了研究。实验结果表明HMM方法对具有时空特性的动态手势轨迹识别是非常有效的。     

An Analog Front‐End Circuit for ISO/IEC 14443‐Compatible RFID Interrogators

An analog front‐end circuit for ISO/IEC 14443‐compatible radio frequency identification (RFID) interrogators was designed and fabricated by using a 0.25 µm double‐poly CMOS process. The fabricated chip was operated using a 3.3 Volt single‐voltage supply. The results of this work could be provided as reusable IPs in the form of hard or firm IPs for designing single‐chip ISO/IEC 14443‐compatible RFID interrogators.     

多媒体教学课件的网上发布

主要介绍AUTHORWARE下多媒体教学课件的网上发布技术路线与实践     

Protocol design for scalable and reliable group rekeying

We present the design and specification of a protocol for scalable and reliable group rekeying together with performance evaluation results. The protocol is based upon the use of key trees for secure groups and periodic batch rekeying. At the beginning of each rekey interval, the key server sends a rekey message to all users consisting of encrypted new keys (encryptions, in short) carried in a sequence of packets. We present a scheme for identifying keys, encryptions, and users, and a key assignment algorithm that ensures that the encryptions needed by a user are in the same packet. Our protocol provides reliable delivery of new keys to all users eventually. It also attempts to deliver new keys to all users with a high probability by the end of the rekey interval. For each rekey message, the protocol runs in two steps: a multicast step followed by a unicast step. Proactive forward error correction (FEC) multicast is used to reduce delivery latency. Our experiments show that a small FEC block size can be used to reduce encoding time at the server without increasing server bandwidth overhead. Early transition to unicast, after at most two multicast rounds, further reduces the worst-case delivery latency as well as user bandwidth requirement. The key server adaptively adjusts the proactivity factor based upon past feedback information; our experiments show that the number of NACKs after a multicast round can be effectively controlled around a target number. Throughout the protocol design, we strive to minimize processing and bandwidth requirements for both the key server and users.     

基于复合顺序形态变换的车牌边缘检测

边缘检测是图像分割的重要环节,边缘提取的好坏直接影响了整个图像处理的效果。数学形态学用具有一定形态结构的“结构元素”去度量图像的形态,以解决图像处理和分析问题。文章通过对多种边缘检测方法的分析比较,结合高速公路路口汽车图像噪声大的特点,提出了基于复合顺序形态变换的车牌边缘检测。该方法不但能有效地改善有噪图像边缘检测的效果,鲁棒性好,而且并行快速,便于硬件实现。     

信息社会世界峰会及其筹备进程

信息社会世界峰会是根据ITU的相关决议，在ITU的大力倡导下，在联合国和其他国际组织、国际机构的支持和配合下促成的。峰会的目的旨在通过召开尽可能高级别的会议，就信息社会建设问题达成全球共识，通过利用信息通信技术潜力。推动实现联合国《千年宣言》所确定的目标，促进全人类的进步。峰会的整个进程分为两个阶段，第一阶段于2003年12月在日内瓦举行，第二阶段于2005年在突尼斯举行。目前，峰会的主要议题和安排已基本确定，各国，尤其是发达国家和发展中国家在对信息社会的认识和未来的一些做法上还存在明显分歧。     

A NUMERICAL EMBEDDING METHOD FOR SOLVING THE NONLINEAR COMPLEMENTARITY PROBLEM(Ⅱ)-ALGORITHM AND ITS CONVERGENCE

In this paper,based on the results presented in part Ⅰ of this paper[18],we present a numerical embedding algorithm for solving the nonlinear complementarityproblem, and prove its convergence carefully. Numerical experiments show that thealgorithm is successful.