动态HTML与动态Web页面

本文介绍了动态ＨＴＭＬ的几个重要的特征，包括动态风格、动态内容、动画、数据捆绑和动态对象模型。使用它们，无需编程即可以编写灵活、多样的动态Ｗｅｂ页面。     

面向任务扩展的增量学习动态神经网络:研究进展与展望

增量学习是近年来机器学习领域的一个重要的研究方向，它能高效地进行知识迁移却不产生遗忘.与静态模型相比，动态网络可以根据不同的输入调整其结构或参数，从而在准确性、计算效率和适应性等方面具有显著的优势.本文从动态架构角度出发，根据动态网络中的自适应选择方式，对当前增量学习模型中所涉及到动态神经网络进行了系统化的总结.文中首先了阐述了增量学习研究进展和定义，归纳了增量学习的学习场景.其次根据动态路由选择粒度的不同，将增量学习的动态神经网络划分为基于任务的动态选择、基于模块化的动态选择、基于神经元的动态选择、基于卷积通道的动态选择和基于权重的动态选择，并对常用的增量学习模型分类进行了阐述和比较.最后归纳了一些常见数据集，并对未来的研究方向进行展望.     

32位高速动态CMOS超前进位加法器的研究

针对TSPC、NSTSPC、ANT等动态电路所存在的缺点，本文介绍了一种新型的动态电路结构-DPANL，即双通路N逻辑动态电路。本文首先对TSPC、NSTSPC和ANT三种电路存在的缺点进行了分析，然后重点分析了DPANL动态电路的工作原理及其优势。并采用DPANL和ANT两种动态电路实现了32位超前进位结构的加法器，Nanosim的仿真结果表明，采用DPANL电路实现的加法器具有速度快、功耗小的特点。     

动态雷达目标RCS测量及分析

根据动态雷达目标RCS测量原理，结合RCS测量雷达外场试验，确定了动态测量方法、飞行航线、测量参数和数据处理方法，给出了对某飞行目标的实测结果，并与仿真结果进行了对比分析，为内场精确仿真动态飞行目标的RCS提供了依据。     

VMS发布动态交通诱导信息的探讨

结合VMS发布动态实时交通诱导信息的研究和实践，探讨了VMS发布的动态交通诱导信息的生成、信息类型以及VMS发布动态交通诱导信息的视认性等问题，提出了VMS发布动态交通诱导信息的自动生成方法、发布信息的类型、提高视认性的主要措施，介绍了北京快速路交通诱导信息VMS发布的实例。     

一种接收机动态范围的计算方法

讨论了影响接收机动态范围的诸多因素，尤其是杂波干扰环境对动态范围的影响，并从实际工程设计出发，提出了一种接收机动态范围的计算方法。按照该计算方法设计、实现的接收机，其动态范围与理论计算结果吻合，能够满足外场实验要求，效果良好。     

海面舰船SAR成像全动态模拟研究综述

开展海面舰船合成孔径雷达(Synthetic Aperture Radar，SAR)成像模拟具有重要的军事应用价值。为解决模拟的逼真性问题，从模拟方法、场景构建、动态考虑等方面介绍了海面舰船SAR成像模拟的国内外研究概况，总结了全动态场景构建与实时性解决方法这两大实现全动态模拟的关键技术，指出目前国内外对于海面舰船SAR成像全动态模拟的研究基本处于空白，关键在于全动态场景构建与实时性实现，相关工作基础较好。最后对下一步研究工作进行了展望。     

掺铒光纤放大器的动态增益均衡

波分复用系统对掺铒光纤放大器增益的动态平坦提出了严格的要求，为此人们设计了各种动态增益均衡器以实现EDFA的增益谱的平坦化。现有的各种动态增益均衡技术分静态和动态两种。我们讨论了几种不同类型的动态增益均衡方法，详细并举例分析几种典型的动态增益均衡器基本结构、工作原理、适用范围及其优缺点。最后对未来动态增益均衡器的发展作了展望。     

光电编码器的动态误码检测系统

为了实现对光电编码器在动态状态下的误码检测，提高批量生产时对光电编码器的误码检测速度，设计了光电编码器动态误码检测系统。首先，对光电编码器误码产生原因进行了分析，并对光电编码器误码进行特征识别。其次，针对光电编码器误码的特征，采用微分方法对光电编码器进行动态误码检测。然后，搭建了光电编码器动态误码检测系统，设计了软硬件电路。最后，对所设计光电编码器动态误码检测系统进行实验验证。实验表明:所设计的动态误码检测系统能够实现对0~8 r/s转速下光电编码器的误码检测，检测结果直观、准确。检测系统极大的提高了批量生产光电编码器时的检验速度。     

雷达接收机的动态范围

介绍了机载雷达接收机的动态范围，特别是论述了无虚假信号的动态范围。指出了在脉冲多普勒雷达接收机中用１ｄＢ增益压缩点的动态范围不能满足要求，应当用无虚假信号的动态范围表示。给出了无虚假信号动态范围和输出功率的计算与测试方法。在设计雷达接收机时，设计师必须综合考虑接收机的噪声系数、增益和动态范围，以获得最佳接收性能。     

Refined trust energy-ad hoc on demand distance vector (ReTE-AODV) routing algorithm for secured routing in MANET

The characteristics of MANET such as decentralization, dynamic topology and openness are susceptible for security threats. To overcome the security threats and to provide a reliable network to transmit packets, a need for trust based routing arises. Moreover, the trust along with energy requirement on ad hoc on demand distance vector have paved way for the development of the newly proposed algorithm named as refined trust and energy based ad hoc on demand distance vector algorithm which is the refined form of the existing trust and energy based ad hoc on demand distance vector algorithms and the classical AODV. In this paper, the refinement parameter is the trust. Moreover, Bayesian probability is introduced in this paper for trust management due to its ability to handle uncertainty for obtaining the refined form of Trust calculation. The proposed algorithm routes the packets from the source to destination not through the shortest route but by selecting a reliable route which consumes low energy and trustful for sending the packets. The simulation results obtained from this work show that the proposed algorithm performs better than the existing algorithms in terms of Trust based routing and energy efficiency.     

一种计算Ad hoc网络K-终端可靠性的线性时间算法

研究计算Ad hoe网络K-终端可靠性的线性时间算法,可以快速计算Ad hoe网络K-终端可靠性。为了计算Ad hoe网络分级结构尽终端可靠性,可以采用无向概率图表示Ad hoe网络的分级结构。每个簇头由已知失效率的结点表示,并且当且仅当两个簇相邻时,两个结点间的互连由边表示。这个概率图的链路完全可靠,并且已知结点的失效率。此图的K-终端可靠性为给定K-结点集是互连的概率。文中提出了基于合适区间图计算尽终端可靠性的一种线性时间算法。本算法可用来计算Ad hoe网络的K-终端可靠性。其时间复杂度为O（｜V｜＋｜E｜）。     

A novel and efficient address configuration for MANET

At present, one technical challenge of MANET is the address configuration, and another technical challenge is to deal with the network merging in order to ensure the address uniqueness in the merging network. This paper proposes a scheme to address these two issues. In the scheme, the MANET architecture is presented, and based on the architecture the address configuration algorithm is proposed. This algorithm employs an allocation variable to achieve the address configuration, and a node can ensure the address uniqueness without any interactions with other nodes. In order to effectively detect the network merging, this scheme proposes the generation algorithm of the MANET ID which uniquely identifies MANET. Based on this generation algorithm, the network merging algorithm is proposed. In this algorithm, only the nodes with the duplicate address perform the address reconfiguration, so the network merging cost and delay are reduced. This scheme is evaluated, and the results show that this scheme effectively improves the address configuration performance and the network merging performance.     

BSS:基于BDI对手模型的MANET自组织安全分簇

MANET是军用、民用领域都具有很大潜力的一种新型无线网络,大规模MANET的组建必须采用以分簇实现的层次结构。MANET的现有分簇算法一般较少考虑安全性。文中基于MANET的自组织特性和移动节点的Agent特性,采用网络自组织思想及设计规范和理性Agent设计模型,建立了移动节点的BDI对手模型,提出了包含博弈分析的The-Second和Switch-Head算法,并在此基础上建立了一个新的安全分簇算法—BSS。分析表明,此算法具有较好的安全性与较高的性能。     

基于UCDS的战术网络拓扑构建研究

在战术MANET中,底层通信的拓扑结构是不断变化的。寻找最小连通子图(作为一个网络拓扑结构的主干)是在MANET的MAC层设计中网络拓扑构建的有效方法。在战术网络环境下研究用于广播的连通支配集构建算法,阐述了一种分布式的连通支配集算法(UCDS),该算法采用启发式规则选取支配节点及其连接节点。通过与其他相关研究对比分析,表明UCDS具有实施简单、执行速度快、消息复杂度低的特点,同时具备一定的灵活和抗毁能力,并能够实际应用于路由优化和低速率下节点的移动自适应。     

LEO/MEO卫星网络中运用自组网思想的动态路由算法

分析了基于星际链路的LEO/MEO路由算法的特点及卫星网与自组网的相同之处，借鉴了自组网路由协议中适用于卫星网的部分，提出了LEO/MEO卫星网络中运用自组网思想的动态路由算法，并对算法进行了模型仿真和性能分析，这种算法增强了卫星网络的自适应性，使网络具有自治性强，功能更全面、系统开销小、适用范围广等特点。     

Constructing a MANET Based on Clusters

This paper proposes a scheme for constructing a mobile ad hoc network (MANET) based on clusters. The proposed MANET architecture is made up of two hierarchies. One hierarchy is the backbone network which is made up of cluster heads and associate nodes, and the other hierarchy is the cluster which is made up of one cluster head and multiple cluster members. In the proposed cluster generation algorithm, the number of potential cluster members is used as a metric, and it is always the new node with the maximum number of potential cluster members that is elected as a cluster head. In this way, the number of cluster heads is minimized. In this scheme, only one associate node is used to achieve the communication between two cluster heads, so the number of nodes included in the backbone network is minimized. This scheme also proposes the cluster merging algorithm in order to maintain the minimum number of cluster heads. In the proposed cluster repair algorithm, if a cluster head fails/moves out of the cluster, then a new cluster head is elected to maintain the cluster stability. From the perspective of the cluster stability, this paper analyzes the performance parameters of the proposed scheme, and the data results show that the proposed scheme improves the MANET stability.     

Cluster-Based and Distributed IPv6 Address Configuration Scheme for a MANET

In a Mobile Ad hoc Network (MANET), after a mobile node is configured with a unique IP address it can perform the unicast communications. In order to reduce the address configuration cost and shorten the latency, this paper proposes an IPv6 address configuration scheme for a MANET. In the scheme, the cluster-based architecture is proposed. In the architecture, the clustering mechanism is combined with the address configuration process in order to achieve the low-cost and low-latency address configuration for all nodes in a MANET. Based on the architecture, the distributed address configuration algorithm is proposed. In the algorithm, a cluster member acquires an address from a cluster head within one-hop scope, so the address configuration task is distributed around cluster heads. In this way, the address configuration in different clusters can be performed in parallel, so the address configuration delay is shortened and the network scalability is improved. The address reclamation/maintenance algorithm is also proposed so that the address resources released by failed nodes can be rapidly recovered for reuse. Finally, the merging/splitting algorithm is proposed in order to ensure that no address collision happens in a MANET. This paper analyzes the performance parameters of the proposed scheme, and the data results show that the proposed scheme effectively reduces the address configuration cost and shortens the delay.     

GPS/Ant-Like Routing in Ad Hoc Networks

A mobile ad hoc network (MANET) is comprised of mobile hosts that can communicate with each other using wireless links. In this paper we present a novel routing algorithm called GPSAL (GPS/Ant-Like Routing Algorithm) which is based on GPS (Global Positioning System) and mobile software agents modeled on ants for routing in ad hoc networks. We compare our algorithm to the Location-Aided Routing (LAR) [20] algorithm for MANET which is also based on GPS. Simulation results show that our algorithm has less overhead than LAR.     

Proficient link state routing in mobile ad hoc network-based deep Q-learning network optimized with chaotic bat swarm optimization algorithm

Mobile ad-hoc network (MANET) is a category of ad-hoc network that can be reconfigurable its network. MANETS are self-organized networks, that can use the wireless links to connect various networks via mobile nodes: but it consumes more energy and it also has routing problems. This is the major drawback of being connected with the MANET technology. Therefore, this study proposes a new protocol as deep Q-learning network optimized with chaotic bat swarm optimization algorithm (CBS)-based optimized link state routing (OLSR) (CBS-OLSR) for MANET. This protocol reduces MANET energy usage and adopts OLSR multi-point relay (MPR) technology. MANET's OLSR and the CBS algorithm utilize a similar method to locate the best optimum path from source to destination node. By embedding the new improved deep Q-learning and OLSR algorithms, both are used for optimizing the MPR sets selection, it can efficiently diminish the energy consumption in the network topology, but automatically increase the lifespan of the network. It also enhances the package delivery ratio and decreases end-to-end delay. The experimental outcomes prove that the proposed protocol is reliable and proficient that is appropriate for numerous MANET applications.