Excel规划求解的实际应用

介绍Excel中求解最大利润和最小成本的方法。     

Error Performance Evaluation of Wireless Communication Systems Using Maximal Ratio Combining with Multiple Interferers

In this paper we evaluate the error performance of wireless communication systems using M-branch maximal ratio combining (MRC) with multiple cochannel interference. Three cochannel interference models are considered: (A) L independent identically distributed (i.i.d.) Nakagami-m cochannel interferers; (B) L independent cochannel interferers consisting of L-N Nakagami-m interferers and N Rayleigh interferers; (C) L independent cochannel interferers in which each interferer follows Nakagami-m distribution for a fraction of time and Rayleigh distribution for the remaining time. In addition, the desired signal assumes Nakagami-m fading. This paper considers that an exponential correlation model is assumed for the desired signals received on each branch, while the interferers are assumed independent. Closed-form expressions are derived for the probability density functions (PDFs) of the instantaneous signal-to-interference power ratio (SIR) at the output of the MRC for the three interference models. Using these SIR PDFs, further closed-form expressions to evaluate the outage probability (OTP) and the average bit error probability (BEP) of differential phase-shift keying (DPSK) are derived. Numerical results showing the impacts of the system parameters on the OTP and the average BEP are then presented.     

Probabilistic output admissible set for systems with time-varying uncertainties

This paper considers time-varying uncertain constrained systems, and develops a method for computing a probabilistic output admissible (POA) set. This set consists of the initial states probabilistically assured to satisfy the constraint. The time-invariant counterpart has already been investigated in Hatanaka and Takaba [Computations of probabilistic output admissible set for uncertain constrained systems, Automatica 44 (2) (2008), to appear]. We first define the POA set for time-varying uncertainties with finite dimensional probability space. Then, we show that an algorithm similar to Hatanaka and Takaba [Computations of probabilistic output admissible set for uncertain constrained systems, Automatica 44 (2) (2008), to appear] provides the POA set also in the time-varying case, as long as an upper bound of a what we call future output admissibility (FOA) index is available. We moreover present two methods for computing the upper bound of the FOA index: probabilistic and deterministic methods. A numerical simulation demonstrates the effectiveness of our algorithm.     

新型电路版图布局布线算法设计

调研了电路自动布局布线技术的国内外研究现状,在此基础上设计了一种面向中等规模电路布局布线算法,主要用于大型版图设计软件的模块测试环节,为用户提供各模块初步的布线布局结果,方便用户高效查找并修正错误点,填补了我国在相关领域的空白.建立了超图模型并转换为图模型,改进了Stoer-Wagner算法并利用该算法和Fiducci...     

多尺度超图卷积骨架动作识别网络

动作识别是计算机视觉基础任务之一,骨架序列包含了大部分的动作信息,因此基于骨架的动作识别算法受到很多学者关注。人体骨架在数学上是一个天然的图,所以图卷积被广泛应用于动作识别。但普通的图卷积只聚合两两节点间的低阶信息,不能建模多节点间的高阶复杂关系。针对此问题,本文提出一种多尺度超图卷积网络,在空间和时间两个维度聚合更丰富的信息,提高动作识别准确度。多尺度超图卷积网络采用编解码结构,编码器使用超图卷积模块聚合超边中多个节点间的相关信息,解码器使用超图融合模块恢复原始骨架结构,另外基于空洞卷积设计了多尺度时间图卷积模块以更好地聚合时间维度运动信息。NTURGB+D和Kinetics数据集上的实验结果验证了算法的有效性。     

Maximal versus strong solution to algebraic Riccati equations arising in infinite Markov jump linear systems

We deal with a perturbed algebraic Riccati equation in an infinite dimensional Banach space which appears, for instance, in the optimal control problem for infinite Markov jump linear systems (from now on iMJLS). Infinite or finite here has to do with the state space of the Markov chain being infinite countable or finite (see, e.g., [M.D. Fragoso, J. Baczynski, Optimal control for continuous time LQ—problems with infinite Markov jump parameters, SIAM J. Control Optim. 40(1) (2001) 270–297]). By using a certain concept of stochastic stability (a sort of L₂-stability), we have proved in [J. Baczynski, M.D. Fragoso, Maximal solution to algebraic Riccati equations linked to infinite Markov jump linear systems, Internal Report LNCC, no. 6, 2006] existence (and uniqueness) of maximal solution for this class of equations. As it is noticed in this paper, unlike the finite case (including the linear case), we cannot guarantee anymore that maximal solution is a strong solution in this setting. Via a discussion on the main mathematical hindrance behind this issue, we devise some mild conditions for this implication to hold. Specifically, our main result here is that, under stochastic stability, along with a condition related with convergence in the infinite dimensional scenario, and another one related to spectrum—weaker than spectral continuity—we ensure the maximal solution to be also a strong solution. These conditions hold trivially in the finite case, allowing us to recover the result of strong solution of [C.E. de Souza, M.D. Fragoso, On the existence of maximal solution for generalized algebraic Riccati equations arising in stochastic control, Systems Control Lett. 14 (1990) 233–239] set for MJLS. The issue of whether the convergence condition is restrictive or not is brought to light and, together with some counterexamples, unveil further differences between the finite and the infinite countable case.     

基于相邻矩阵快速构建虚拟主干网的近似算法

在无线Ad-hoc网络中,基于极小连通支配集的虚拟主干网技术对资源分配和路由优化具有重要的作用。首先证明了相邻矩阵理论的一个有关结论,然后利用此结论以及极大独立集和极小支配集的关系,提出了一种基于相邻矩阵快速构建无线Ad-hoc网络最小连通支配集的近似算法,并给出了算法的正确性证明、复杂性分析和近似比分析。仿真试验结果表明,利用该算法可以快速高效地构建Ad-hoc网络的虚拟主干网。     

移动计算环境中用户移动模式的挖掘

在移动计算中与移动用户位置相关的移动对象位置管理服务以及基于位置的移动增值服务等都离不开移动用户移动模式的挖掘。该文利用用户的移动日志,通过非二频繁项集把整个日志切割为一系列的子序列,然后把子序列分别归入频繁子序列和非频繁子序列这两个箱中,再分别对其进行合并和拆分处理,寻找最大频繁项集,即移动用户的最大移动模式。     

基于Iceberg概念格的最大频繁项集挖掘

最大频繁项集挖掘算法存在扫描数据集次数多和候选集规模过大等局限。基于Iceberg概念格模型,提出一种在Iceberg概念格上挖掘最大频繁项集的算法ICMFIA。该算法通过一次扫描数据集构建Iceberg概念格,利用Iceberg概念格中频繁概念之间良好的覆盖关系能快速计算出最大频繁项集所对应的最大频繁概念,所有最大频繁概念的内涵就是所求的最大频繁项集的集合。实验结果表明,该算法具有扫描数据集次数少和挖掘效率高的优点。     

形态骨架匹配算法及其在交通标志识别中的应用

交通标志是人为的、具有特殊形状的符号，就其结构可分为外层轮廓和内核两部分。应用计算机视觉可以对交通标志进行自动识别．其关健在于如何检测交通标志和识别它们的内核形状。本文应用数学形态学方法研究交通标志内核形状的形态特征，分析了内核形状的形态骨架，提出和讨论了内核形态骨架的相关函数和距离函数，并就交通标志的有效识别提供了理论分析和实验结果。