移动宽带城域网节能类型Ⅱ的性能分析

为了有效分析移动网络中移动站点的节能效率,研究了应用于移动宽带城域网的IEEE802.16e节能类型Ⅱ的工作原理,建立了一个具有两种休假机制,且在一种休假机制内可以传输少量数据帧的多重休假排队模型;构建了由能量节省率、系统切换率和数据帧平均响应时间等组成的指标体系,并给出了各个性能指标的解析表达式.通过数值示例,刻画了系统性能与系统参数的依赖关系,表明了该模型的可行性与有效性.     

基于定长时隙的多跳Ad Hoc网络DCF协议马尔可夫链模型

指出了现有的基于不定长时隙的DCF协议马尔可夫链模型的局限性,并在详细分析多跳ad hoc 网络环境中DCF 协议建模的难点问题基础上,提出了一种基于定长时隙的多跳ad hoc 网络DCF 协议马尔可夫链模型.通过模型的求解,得到了反映多跳ad hoc 网络饱和吞吐量性能的相关性能指标的理论值,并结合GloMoSim 网络仿真环境中的仿真实验,证明了模型的有效性.     

Coupled common fixed point theorems for a pair of commuting mappings in partially ordered complete metric spaces

The purpose of this paper is to establish a coupled coincidence point for a pair of commuting mappings in partially ordered complete metric spaces. We also present a result on the existence and uniqueness of coupled common fixed points. An example is given to support the usability of our results.     

Some fixed point theorems in 1-M-complete fuzzy metric-like spaces

Very recently, in order to unify the notions of fuzzy metric space and metric-like space, Shukla and Abbas introduced the concept of fuzzy metric-like space and proved some fixed-point results in this setting. In this article, we modify the notion of Cauchy sequence and completeness to generalize their results. Thus, we extend their theorems to a more general framework, which is also appropriate to generalize some recent, well-known results in this line of research. Furthermore, several examples are presented to illustrate the significance of our results.     

一种新的双足机器人模型设计与相关研究

针对双足机器人最简模型在行走过程中出现摆动腿足部擦地的问题,提出了一种通过摆动腿膝关节弯曲达到摆动腿缩短的新模型。当摆动腿开始摆动时,摆动腿膝关节弯曲锁定,摆动腿缩短;当摆动腿摆动到最大位置时,膝关节解锁,摆动腿伸直再锁定,此后摆动腿回摆,系统变为直腿模型。采用脚后跟冲击控制,在摆动腿落地前,拖后的支撑腿与地面接触处施加一指向髋关节的瞬时冲击力,冲击力可以减小摆动腿着地时能量的损耗,同时驱动被动机器人向前行走。设计了迭代学习控制算法,找到极限环与不动点,实现不同给定期望步长跟踪的冲击力的计算。仿真结果表明,迭代学习控制可以有效的实现不同期望步长的跟踪,可以很快的找到机器人系统的不动点,通过收敛的相平面,得到稳定的极限环,保证了机器人行走过程稳定。     

基于TDMA的无人机多址协议分析与仿真

针对未来战场无人机群作战组网的特点和现有固定TDMA协议无法满足网络拓扑动态变化的缺点,引入按需分配机制,提出了一种能够支持高动态组网方式的DTDMA多址接入协议。利用相关知识对协议性能进行了理论推导和分析,重点研究了改进后协议的吞吐量和端到端时延变化。利用OPNET对协议进行了建模仿真。结果表明,DTDMA协议在不同优先级业务共存条件下较TDMA的时延和吞吐量性能有了明显的提高。     

OSPF路由技术及其在IP宽带网上的应用

随着计算机网络的不断扩大,选择一种合适的路由技术尤为重要本文从ＯＳＰＦ的链路状态数据库,最短路径优先算法和ＯＳＰＦ通信协议等几个方面分析了ＯＳＰＦ的路由技术,说明了采用此技术在网络扩展性,安全性和收敛性方面具有一定优势,同时阐述了在某重大ＩＰ宽带网中采用此技术所进行的路由规划和优化工作,它对于保证ＩＰ宽带网的扩展性和健壮性,优化网络性能具有重要的意义。     

Analyzing the structure of a class of linear automata over a ring $$ Z_{p^k } $$

Basic finite-automaton characteristics are established for the class of all linear automata and information-lossless automata over a ring. The complexities of solving problems of parametric identification and initial-state identification are analyzed. The sets of fixed points for mappings realized by initial automata are characterized. Canonical forms are proposed for linear automata over the ring. __________ Translated from Kibernetika i Sistemnyi Analiz, No. 3, pp. 60–74, May–June 2008.     

Approximate fixed point sequence for a finite family of asymptotically pseudocontractive mappings

Let E be a real Banach space and K be a nonempty, closed, convex, and bounded subset of E. Let T_i:K→K, i=1,2,…,N, be N uniformly L-Lipschitzian, uniformly asymptotically regular with sequences {ε_n}, and asymptotically pseudocontractive mappings with sequences , where {ε_n} and , i=1,2,…,N, satisfy certain mild conditions. Let a sequence {x_n} be generated from x₁K by

for all integers n1, where T_n=T_n(modN), {u_n} be a sequence in K, and {λ_n}, {θ_n} and {μ_n} are three real sequences in [0,1] satisfying appropriate conditions; then x_n−T_lx_n→0 as n→∞ for each l{1,2,…,N}.